IS445(AOG) - Data Viz
This is the course website for IS445(AOG) in Fall 2020
View On GitHub
Week 16 - Network Visualization & Word clouds
Downloads
Data:
Several small nodes facebook data
One major node facebook data
More facebook data
Text of Othello (othello.txt)
Optional reading list
VAD Ch. 9: Arrange Networks and Trees
VAD, Ch. <IP_ADDRESS>: Reduce Items and Attributes
VAD, Ch. 6: Rules of Thumb
FDV, Ch. 28: Choosing the right visualization software
FDV, Ch. 26: Don’t go 3D
FDV, Ch. 25: Avoid line drawings
Extra Resources
Variety of SNAP datasets
We used this SNAP dataset
Python Library to parse snap facebook data
Materials
Lecture 16: (
view
,
source
,
present
)
Notebook: inClass_week16_theLast: (
view
,
download
)
Notebook: inClass_week16_theLast_networks: (
view
,
download
)
Notebook: prep_notebook_networks_part2: (
view
,
download
)
Notebook: prep_notebook_wordcloud_part1: (
view
,
download
)
Materials from Previous Courses
Notebook: spring2019_prep_notebook: (
view
,
download
)


Mimar Sinan (Ottoman Turkish: معمار سينان, romanized: Mi'mâr Sinân, Turkish: Mimar Sinan, pronounced ) c. 1488/1490 – July 17, 1588) was the chief Ottoman architect (Turkish: mimar) and civil engineer for sultans Suleiman the Magnificent, Selim II, and Murad III. Known as Koca Mi'mâr Sinân Âğâ, "Sinan Agha the Grand Architect" or Grand Sinan, he was responsible for the construction of more than 300 major structures and other more modest projects, such as schools. His apprentices would later design the Sultan Ahmed Mosque in Istanbul and Stari Most in Mostar. The son of a stonemason, he received a technical education and became a military engineer. He rose rapidly through the ranks to become first an officer and finally a Janissary commander, with the honorific title of Sinan. He refined his architectural and engineering skills while on campaign with the Janissaries, becoming expert at constructing fortifications of all kinds, as well as military infrastructure projects, such as roads, bridges and aqueducts. At about the age of fifty, he was appointed as chief royal architect, applying the technical skills he had acquired in the army to the "creation of fine religious buildings" and civic structures of all kinds. He remained in this post for almost fifty years. His masterpiece is the Selimiye Mosque in Edirne, although his most famous work is the Suleiman Mosque in Istanbul. He headed an extensive governmental department and trained many assistants who, in turn, distinguished themselves, including Sedefkar Mehmed Agha, architect of the Sultan Ahmed Mosque and Mimar Hayruddin, architect of the Stari Most. He is considered the greatest architect of the classical period of Ottoman architecture and has been compared to Michelangelo, his contemporary in the West. Michelangelo and his plans for St. Peter's Basilica in Rome were well known in Istanbul, since Leonardo da Vinci and he had been invited, in 1502 and 1505 respectively, by the Sublime Porte to submit plans for a bridge spanning the Golden Horn. Mimar Sinan's works are among the most influential buildings in history.
94 large mosques
57 colleges
52 smaller mosques
48 bath-houses
35 palaces
22 mausoleums
20 caravanserai
17 public kitchens
8 bridges
8 store houses or granaries
7 Koranic schools
6 aqueducts
3 hospitals


This is screen 3.2. The back button is set but will not be usable due to clearing the previous screen. Please refresh your browser to restart.
<< || >>


MapPinchEvent QML Type
MapPinchEvent type provides basic information about pinch event. More...
| Import Statement: | import QtLocation 5.3 |
| Since: | Qt Location 5.0 |
Properties
Detailed Description
MapPinchEvent type provides basic information about pinch event. They are present in handlers of MapPinch (for example pinchStarted/pinchUpdated). Events are only guaranteed to be valid for the duration of the handler.
Except for the accepted property, all properties are read-only.
Example Usage
The following example enables the pinch gesture on a map and reacts to the finished event.
Map { id: map gesture.enabled: true gesture.onPinchFinished:{ var coordinate1 = map.toCoordinate(gesture.point1) var coordinate2 = map.toCoordinate(gesture.point2) console.log("Pinch started at:") console.log(" Points (" + gesture.point1.x + ", " + gesture.point1.y + ") - (" + gesture.point2.x + ", " + gesture.point2.y + ")") console.log(" Coordinates (" + coordinate1.latitude + ", " + coordinate1.longitude + ") - (" + coordinate2.latitude + ", " + coordinate2.longitude + ")") } }
Property Documentation
Setting this property to false in the MapPinch::onPinchStarted
handler will result in no further pinch events being generated, and the gesture ignored.
This read-only property holds the current angle between the two points in the range -180 to 180. Positive values for the angles mean counter-clockwise while negative values mean the clockwise direction. Zero degrees is at the 3 o'clock position.
These read-only properties hold the actual touch points generating the pinch. The points are not in any particular order.
These read-only properties hold the actual touch points generating the pinch. The points are not in any particular order.
This read-only property holds the number of points currently touched. The MapPinch will not react until two touch points have initiated a gesture, but will remain active until all touch points have been released.


Jury acquits La Crosse man in death of ex-girlfriend
LA CROSSE, Wis. (AP) - A jury has acquitted a La Crosse man accused of killing his former girlfriend and disposing of her body in a lake.
The La Crosse Tribune reports jurors deliberated for about five hours Thursday before finding 39-year-old Erik Sackett not guilty in the death of 35-year-old Erin Somvilai. Her body was found in a Vernon County lake near Sackett's family cabin in June 2018, nearly two weeks after her family reported her missing.
In closing arguments, La Crosse County District Attorney Tim Gruenke accused Sackett of wanting to get rid of a problem and throwing Somvilai away like garbage.
Defense attorney Chris Zachar countered that the prosecution failed to prove its case.
Police say Somvilai's body had been weighted with concrete blocks. A fisherman discovered her body.


| > The Unit Test Framework > Tutorials > Introduction into testing |
Copyright © 2006 John R. Phillips
Use, modification and distribution is subject to the Boost Software License, Version 1.0. (See accompanying file
LICENSE_1_0.txt
or copy at
http://www.boost.org/LICENSE_1_0.txt )
For almost everyone, the first introduction to the craft of programming is a version of the simple "Hello World" program. In C++, this first example might be written as
对于几乎每个人来说，第一个接触到的程序应该就是简单的 "Hello World"。在 C++ 中，第一个例子可能是这样写的。
#include <ostream> int main() { std::cout << "Hello World\n"; }
This is a good introduction for several reasons. One is that the program is short enough, and the logic of its
execution simple enough that direct inspection can show whether it is correct in all use cases known to the new
student programmer. If this were the complexity of all programming, there would be no need to test anything before
using it. In programming as a new student experiences it, testing is pointless and adds unneeded complexity.
基于几个原因，这是一个很好的入门。其中之一就是程序足够短，执行逻辑足够简单，
对于编程的初学者来说在任何情况下都可以直接看出它正确与否。
如果所有程序都是这种复杂度的话，那么在使用之前就不需要测试任何东西了。
在初学者经历的编程中，测试是无意义的，并且会增加无用的复杂度。
However, no actual programs are as simple as an introductory lesson makes "Hello World" seem. Not even "Hello World".
In all real programs, there are decisions to be made and multiple paths of execution based on these decisions. These
decisions could be based on user input, streaming data, resource availability and dozens of other factors. The
programmer strives to control the inputs, and results of these decisions, but no one can keep all of them clearly
in mind once the size of the project exceeds just a few hundred lines. Even "Hello World" hides complexities of
this sort in the simple seeming call to std::cout.
但是，实际的程序没有像入门教程 "Hello World" 那么简单的。
在实际的程序中，有很多要做的决定，基于这些决定有多个执行路径。
这些决定可能基于用户输入、流数据、资源获得和很多其它因素。
程序员努力控制输入和这些决定的结果，但一旦工程的大小超过几百行，就没有人能够清楚地记得所有这些。
即使是 "Hello World" 也在看似简单的 std::cout 调用中隐藏了复杂度。
Since the individual programmer can no longer determine the correctness of the program, there is a need for a
different approach. An obvious possibility is testing the program after construction. Someone develops a set of
test cases, where inputs are given to the program such that the behavior and outputs of a correctly performing
program are known. The performance of the new program is compared to known standards and the new program either
passes or fails. If it fails, attempts are made to fix it. If the test cases are carefully chosen, the specifics of
the failure give an indication of what in the program needs to be fixed.
因为单个程序员不再能判断程序的正确性，就有不同方式的需要。
一个很明显的可能性是在构建后测试程序。
某些人开发了一系列测试用例，对于问题输入给定，那么正确的行为和输出就可能确定。
将新程序的执行和已知的标准进行比较就可以判断程序正确与否。如果错误，就试图修正它。
如果测试用例被仔细选择，那么失败的情况就可以说明程序的哪部分需要被修正。
This is an improvement over just not knowing whether the program is working properly, but it isn't a big improvement.
If the whole program is tested at once, it is nearly impossible to develop test cases that clearly indicate what
the failure is. The system is too complex, and the programmer still needs to understand almost all of the possible
outcomes to be able to develop tests. As always, when a problem is too big and complicated a good idea is to try
splitting it into smaller and simpler pieces.
这比起不知道程序工作正确与否是一种进步，但不是很大的进步。
如果程序整体被一起测试，几乎不可能写出清楚表示错误在哪儿的测试用例。
系统太复杂，程序员仍然需要知道几乎所有可能的输入才能构造出测试用例。
所以通常，当问题太大太复杂时，试图将其分割为更小更简单的片断是个好主意。
This approach leads to a layered system of testing, that is similar to the layered approach to original development
and should be integrated into it. When writing a program, the design is factored into small units that are
conceptually and structurally easier to grasp. A standard rule for this is that one unit performs one job or
embodies one concept. These simple units are composed into larger and more complicated algorithms by passing needed
information into a unit and receiving the desired result out of it. The units are integrated to perform the whole
task. Testing should reflect this structure of development.
这会导致一个分层的测试系统，类似于分层的开发，并结合在一起。
写程序时，设计被分解为小的单元，在概念和结构上可以更容易地把握。
这种方式的原则标准是一个单元执行一项工作或表达一个概念。
这些简单的单元通过传入相应的信息得到期望的结果，组成更大更复杂的算法。
这些单元被组合用来完成整个任务。测试应该反应这种开发的结构。
The simplest layer is Unit Testing. A unit is the smallest conceptually whole segment of the program. Examples of
basic units might be a single class or a single function. For each unit, the tester (who may or may not be the
programmer) attempts to determine what states the unit can encounter while executing as part of the program. These
states include determining the range of appropriate inputs to the unit, determining the range of possible
inappropriate inputs, and recognizing any ways the state of the rest of the program might affect execution in this
unit.
最简单的一层是单元测试。单元是程序中概念完整的最小片段。基本单元的例子可能是单个类或单个函数。
对于每个单元，测试人员 (可能是程序员也可能不是) 试图判断单元作为程序一部分在执行中可能遇到的状态。
这些状态包括判断单元适当输入的范围，判断可能的不适当输入的范围，以及识别程序其它部分的状态对这个单元可能造成的影响。
With so many general statements, an example will help clarify. Imagine the following procedural function is part of
a program, and the programmer wants to test it. For the sake of brevity, header includes and namespace qualifiers
have been suppressed.
说了这么多一般性的描述，一个例子可能会很有用。
假设下面的函数是程序的一部分，并且程序员想要测试它。
出于简短的目的，包含的头文件和命名空间声明都被忽略。
double find_root( double (*f)(double), double low_guess, double high_guess, std::vector<double>& steps, double tolerance ) { double solution; bool converged = false; while(not converged) { double temp = (low_guess + high_guess) / 2.0; steps.push_back( temp ); double f_temp = f(temp); double f_low = f(low_guess); if(abs(f_temp) < tolerance) { solution = temp; converged = true; } else if(f_temp / abs(f_temp) == f_low / abs(f_low)) { low_guess = temp; converged = false; } else { high_guess = temp; converged = false; } } return solution; }
This code, although brief and simple is getting long enough that it takes attention to find what is done and why.
It is no longer obvious at a glance what the intent of the program is, so careful naming must be used to carry that
intent.
代码虽然非常简洁，但已经足够关注查找做了什么以及如何做。
一眼扫过去已经不能很清楚地明白程序要做什么，所以小心的名字对表达要做什么是很重要的。
Thanks to the control structures, there are some obvious execution paths in the code. However, there are also a few
less obvious paths. For example, if the root finder takes many steps to converge to an acceptable answer, the
vector that is holding the history of steps taken may need to reallocate for additional space. In this case, there
are many hidden steps in the single push_back command. These steps also include the chance of failure, since that
is always a possibility in a memory allocation.
由于控制结构，代码中有一些很明显的执行路径。然而，同样有一些不太明显的路径。
例如，如果根查找器需要很多步来汇聚于一个可接受的结果，用来保存历史步骤的 vector 可能需要重新申请更多的空间。
在这种情况下，在单个 push_back 命令中有很多隐藏的步骤。
在这些步骤中同样包含着失败的机会，因为内存申请总有失败的可能。
A second example notes that the value of the function at the low guess has not been tested, so there is the chance
of a zero division. Also, if the value of the function at the high guess is zero, the root finder will miss that
root entirely. It may even fall into an infinite loop if no root lies between the low and high values.
第二个例子是注意到函数 low_guess 的值没有被测试，那就有可能在除数上为 0。
同样，如果 high_guess 的值是 0，根查找器会直接错过根。
如果在 low 和 high 值之间没有根甚至会陷入无限循环。
In this unit, proper testing includes checking the behavior in each possibility. It also includes checking the
function by giving inputs where the correct answer is known and checking the results against that answer. Thus,
the unit is tested in every execution path to assure proper behavior.
在这个单元中，适当的测试包括检查在各种可能性下的行为。
同样包括检查函数在给定输入情况下的结果是否为已知的正确结果。
换句话说，单元的每个执行路径都被测试用来确保正确的行为。
Test cases are chosen to expose as many errors as possible. A defining characteristic of a good test case is that
the programmer knows what the unit should do if it is functioning properly. Test cases should be generated to
exercise each available execution path. For the above snippet, this includes the obvious and the not so obvious
paths. Every path should be tested, since every path is a possible outcome of program execution.
测试用例是选择用来暴露尽可能多错误的。好的测试用例是需要程序员知道在正常工作下单元应该做什么的。
测试用例应该能够覆盖每一个执行路径。对于上面的片段，这包括明显和不那么明显的路径。
每一个路径都应该被测试，因为每条路径都是程序执行可能的结果。
Thus, to write a good testing suite, the tester must know the structure of the code. The most dependable way to
accomplish this is if the original programmer writes tests as part of creating the code. In fact, it is advisable
that the tests are produced before the code is written, and updated whenever structure decisions are changed. This
way, the tests are written with a view toward how the unit should perform instead of reproducing the programmer's
thinking from writing the code. While black box testing is also useful, it is important that someone who knows the
design decisions made and the rationale for those decisions test the code unit. A programmer who can't devise
good tests for a unit does not yet know the problem at hand well enough to program dependably.
所以，想要写一个好的测试套件，测试人员必须了解代码的结构。
完全这个最可靠的方式是由最初的开发人员将编写测试作为代码的一部分。
实际上，一个很好的建议是测试应先于代码编写，并随时根据设计结构的改变而改变。
在这种方式下，测试是关注于单元应如何运行而不是重现开发者通过代码展现的想法。
黑盒测试同样是有用的，它对于了解设计决定和原理的测试人员是很重要的。
不能设计出好的测试的开发人员实际上并不完全了解单元的用处。
When a unit is completed and tested, it is ready for integration with other units in the program. This is
integration should also be tested. At this point, the test cases focus on the interaction between the units. Tests
are designed to exercise each way the units can affect each other.
当一个单元被完成并测试过，它就已经可以和程序中其它单元进行集成了。集成同样应该被测试。
在这一点上，测试用例关注于单元之间的交互。测试被设计用来测试单元之间相互影响的各种情况。
This is the point in development where proper unit testing really shines. If each unit is doing what it should be
doing and not creating unexpected side effects, any issues in testing a set of integrated units must come from how
they are passing information. Thus, the nearly intractable problem of finding an error while many units interact
becomes the less intimidating problem of finding the breakdown in communications.
这是在单元测试被充分使用的情况下的开发。
如果每个单元都工作正常且不发生未预料的副作用，那么单元集成测试就必须关注于它们之间如何传递信息。
也就是说，多单元交互之间难于寻找错误的棘手问题现在变成寻找通信中断的较简单的问题了。
At each layer of increasing complexity, new tests are run, and if the prior tests of the components are well
designed and all issues are fixed, new errors are isolated to the integration. This process continues, in parallel
with development, from the smallest units to the completed program.
在复杂度增加的每一层中，运行新的测试，如果之前组件的测试是良好设计并且所有的问题都被解决，那么新的错误就只是集成的问题。这个过程被继续，和开发并行，从最小的单元到完整的程序。
This shows that there is a need to be able to check and test code snippets such as individual functions and classes
independent the program of which they will become a part. That is, the need for a means to provide predetermined
inputs to the unit to check the outputs against expected results. Such a system must allow for both normal
operation and error conditions, allow the programmer to produce a thorough description of the results.
这显示了一个需要，能够检查并测试程序一部分的代码片段，例如独立的函数和类。
换句话说，能够根据给定的输入检查单元的输出是否正确。
这样的系统必须同时允许正常的操作和错误的情况，使程序员可能对结果产生一个完整的描述。
This is the goal and rationale for all unit testing, and supporting testing of this sort is the purpose of the
Boost.Test library. As is shown below, Boost.Test provides a well-integrated set of tools to support this testing
effort throughout the programming and maintenance cycles of software development.
这是所有单元测试的目标和原理，同样是 Boost.Test 库的目的。
就像下面将看到的，Boost.Test 提供了一系列良好集成的工具在软件开发的开发和维护循环中提供支持。


focusClear
tri
Used to execute a function, typically to clear the contents of an input field, when it receives focus.
<input ... focus-clear='function-to-execute'>


ng-coding Rules
- The goal is to contribute to open-source. Play fair!
- Pick and issue from the Contributions List,
then click the "Work on this" button.
- When you finish working on an issue, you will be gain score, as determined by the ng-coding mentors.
- All data is open and public on GitHub.
Credits


?<^y>IMA6ED
y,
>Ñ
YlALCs-
pJO
-u^s.
No.
^THE
NEW
YORK
BOTANICAL
GARDEN
EXPLORATION
OF
PORTO
RICO
RIO
DE
MARICAO-600-720
M.
ALT.
COLLECTORS
FEB
14,
1915
N.
L.
BRITTON
J.
F.
COWELL
010
4922
01014922
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


LOOKUP_TABLES_READER_NG
Documentation du Custom Transformer FME
Description
This custom transformer reads and manipulates the content of a lookup table. The lookup table must be a coma separated value (CSV) file. The manipulation directives are contained in a YAML file located in the same directory as the CSV file. The YAML file must bear the same name that the CSV file. (ex.: Province.csv and Province.yaml). See section below for a description of the YAML file.
Input Ports
- This custom transformer has no Input Port
Output Ports
- OUTPUT_LOCAL: The content of the lookup table (one record by row in the CSV file)
Parameters
- FEATURE_TYPE: File name of the lookup table without the .csv extension. If this parameter is empty than no CSV file is read and the process continue
- CSV_PATH: Name of the root directory containing the lookup table. The custom transformer will try to find the lookup table in two directories: firstly into CSV_PATH\shared when it is a lookup table shared between PT and secondly in CSV_PATH\PT when the lookup table is specific to a PT
- PT: Two letter code of the province or territory to process (ex.: ON, QC, AB...)
- CSV_ENCODING: Type of encoding of the lookup tale
Content of the YAML file
The YAML file is used by the custom transformer for manipulating (editing, cloning lines, create key/value attributes and validate unicity) the CSV file. Below is an example of a YAML file.
CSV_COLUMNS: original_value: [trim, lower, no_null, explode] real_value_english: [trim, upper, no_null, explode] real_value_french: [no_null_err, explode] code_value: [upper, explode] # CREATE_KEY_VALUE: code_value: original_value # NO_DUPLICATE: DUP_1: [code_value] DUP_2: [original_value, real_value_english] # CHECK_DOMAIN original_value: [year, yearly]
Description of the three sections of a YAML file
The first section CSV_COLUMNS defines the actions to perform on the column of the CSV file. Following the "CSV_COLUMNS:" you list on separate line the name of the column as defined in the header (first line) of the CSV file (an error is raised if the column name is mispelled); Followed by a colon ":"; followed by the list of actions separated by a coma "," and enclosed between brackets "[]". Here's the list of possible actions:
- trim: Remove front and trailing whitespcaes; it also remove extra white spces in the interior of the column value (ex.: " a test" ==> "a test");
- lower: Put the column value in lower case;
- upper: Put the column value in upper case;
- no_null: Check that the column is not empty or null; it terminates execution if not null; explode: Duplicate the row if the column contains values separated by semicolumn ";". The line is exploded by the number of values in the column (ex: "QC;ON;MB", will duplicate all the content of the line 2 times, the first line will contain "QC"; the second "ON" and the third "MB".
The second section CREATE_KEY_VALUE creates of FME key/value attributes. Following the "CREATE_KEY_VALUE:" you list on separate line all key: value pair that will create an FME attribute. The key is the name of the column containing the attribute name to create; followed by a colon ":"; followed by the name of the column containing the value of the attribute;
The third section NO_DUPLICATE defines the column that are used for checking the unicity of one or more columns. Following "NO_DUPLICATE:" you list on separate line the duplication to check. You write the name of the duplication (name is not important but must be unique); follwed by colon ":"; followed by the list of name of the column to check for unicity separated by a coma and enclosed between bracket.
The fourth section CHECK_DOMAIN defines the domain of values to check for a specific column(s). Following "CHECK_DUPLICATE:" you list on separate line the domain validation to check. You write the name of the column to check; followed by a colon ":"; followed by the domain values separated by a coma "," and enclosed between brackets "[]". If you want to check for empty value "", you place an extra coma at the end of the list: ex: [A,B,]. Important: do not place extra whitespaces in the list.
Documentation du code Python LOOKUP_TABLES_READER_NG.py
This method checks if a file is present in the shared or the province directory. |
|
Template Class Interface: When using this class, make sure its name is set as the value of the 'Class to Process Features' transformer parameter. |
- class LOOKUP_TABLES_READER_NG.LoadValidateYaml[source]
Bases:
object
Template Class Interface: When using this class, make sure its name is set as the value of the ‘Class to Process Features’ transformer parameter.
- input(feature)[source]
This method is called for each FME Feature entering the PythonCaller. If knowledge of all input Features is not required for processing, then the processed Feature can be emitted from this method through self.pyoutput(). Otherwise, the input FME Feature should be cached to a list class member and processed in the close() method.
- Parameters
feature (fmeobjects.FMEFeature) – FME Feature entering the transformer.


Mdbc is the Windows PowerShell v2.0+ module based on the official MongoDB C# driver. Mdbc makes MongoDB scripting in PowerShell easier and provides some extra features like bson/json file collections which do not even require MongoDB.
Step 1: Get and install. Mdbc is distributed as the NuGet package Mdbc. Download it to the current location as the directory "Mdbc" by this PowerShell command:
Invoke-Expression "& {$((New-Object Net.WebClient).DownloadString('https://github.com/nightroman/PowerShelf/raw/master/Save-NuGetTool.ps1'))} Mdbc"
Alternatively, download it by NuGet tools or directly. In the latter case save it as ".zip" and unzip. Use the package subdirectory "tools/Mdbc".
Copy the directory Mdbc to a PowerShell module directory, see $env:PSModulePath
, normally like this:
C:/Users/<User>/Documents/WindowsPowerShell/Modules/Mdbc
Step 2: In a PowerShell command prompt import the module:
Import-Module Mdbc
Step 3: Take a look at help:
help about_Mdbc
help Connect-Mdbc -full
...
Step 4: Invoke these operations line by line, reading the comments (make sure that mongod is started, otherwise Connect-Mdbc
fails):
# Load the module
Import-Module Mdbc
# Connect the new collection test.test
Connect-Mdbc . test test -NewCollection
# Add some test data
@{_id=1; value=42}, @{_id=2; value=3.14} | Add-MdbcData
# Get all data as custom objects and show them in a table
Get-MdbcData -As PS | Format-Table -AutoSize | Out-String
# Query a document by _id using a query expression
$data = Get-MdbcData (New-MdbcQuery _id -EQ 1)
$data
# Update the document, set the 'value' to 100
$data._id | Update-MdbcData (New-MdbcUpdate -Set @{value = 100})
# Query the document using a simple _id query
Get-MdbcData $data._id
# Remove the document
$data._id | Remove-MdbcData
# Count remaining documents, 1 is expected
Get-MdbcData -Count
If the code above works then the module is installed and ready to use.
Read cmdlet help topics and take a look at their examples, they show some basic use cases to start with.
Take a look at scripts in the directory Scripts, especially the interactive profile Mdbc.ps1. Other scripts are rather toys but may be useful. Even more examples can be found in the directory Tests of the project repository.
Mdbc cmdlets are designed for rather simple jobs. For advanced operations the C# driver API should be used directly. Some API was specifically designed with PowerShell in mind. See the C# driver manuals.


Healthy Coaching
Home
Healthy Tips
Service Provider
Therapy Group
Quiz
Your Mesurments
Our clients measurments statistics
Show-Chart


--- layout: page title: Side Projects ---
An ambitious rougue-like shmup made with Unity3d where you flee from the ultimate doom in the form of an apocalyptic sandstorm.
It's a simple 3D pong game, still missing some pieces. It's made with the BabylonJS framework and some other bits. It does require an updated browser.
A hexagonal grid spiral/ring indexation model that stores each hexagon index in a simple array. Each index is automatically mapped to its position in the grid.
A very simple voice converter that uses the Web Audio API to apply sound effects to an audio stream coming from your microphone.
https://github.com/mseefelder/inKlan. Collaborative web drawing powered by node.js and some other stuff.


I grew up in Boulder, CO and have been fixated with music from a young age. In junior high I received a large collection of discarded music magazines from a librarian who was aware of my obsession, thus seeding my interest in library science. Upon receiving a Bachelor of Science in Music from the University of Colorado at Denver and working in public libraries, I eventually moved to Washington, DC where I received a Master of Science in Library Science with a specialization in Music Librarianship. I am currently a student at the University of Denver’s Coding Boot Camp adding full-stack web development to my professional repertoire. In addition to my academic and professional pursuits, I have played in several garage, punk, and indie-pop bands in both Denver and Washington DC.
Meta search of ebook and eaudioboook collections.
View the projectTimed trivia game using JavaScript and Bootstrap.
View the projectAPI search of Giphy fail gifs.
View the projectTrain Schedule using Moment.js
View the projectCompatibility app using Node.js and Express Servers
View the projectCoin generating game with JavaScript and JQuery
View the project


Gets the reflected class instance (describing a class with generic types resolved) of a class declaration.
Gets the reflected class template (describing a class with unresolved generic types) of a class declaration.
Gets the reflected function instance (describing a function with generic types resolved) of a function declaration.
Gets the reflected function template (describing a function with unresolved generic types) of a function declaration.
Gets the reflected type of an expression.
Tests if the specified node has an 'abstract' modifier.
Tests if the specified node is flagged 'const'.
Tests if the specified node, or optionally either its parent, has a 'declare' modifier.
Tests if the specified node, or optionally either its parent, has an 'export' modifier.
Tests if a function fulfills the requirements to become a start function.
Tests if the specified node has a 'static' modifier or is otherwise part of a static context.
Removes a modifier from a node and optionally also from its parent.
Sets the reflected class instance (describing a class with generic types resolved) of a class declaration.
Sets the reflected class template (describing a class with unresolved generic types) of a class declaration.
Sets the reflected function instance (describing a function with generic types resolved) of a function declaration.
Sets the reflected function template (describing a function with unresolved generic types) of a function declaration.
Sets the reflected type of an expression.
Converts a WebAssembly binary to text format using linear syntax. Requires wabt.js to be present.
Converts WebAssembly text format using linear syntax to a binary. Requires wabt.js to be present.
Generated using TypeDoc
Utility functions.


Apr 2015 → Current
Sep 2014 → Mar 2015
Lead Developer on client project
Mar 2013 → Aug 2014
2009 → 2012
education summary
Feb 2013 → Feb 2015
Feb 2014 → Feb 2016
Mar 2009 → Aug 2011
description
Mar 2016
asdf


Control Statements are Statements which control or change the flow of execution.The following are the statements available in Python:
=> if Statements
=> if...else Statements
=> if ...elif...else Statements
=> while loop
=> for loop
=> else suite
=> break Statements
=> continue Statements
=> pass Statements
=> assert Statements
=>return Statements
The if Statements:
The general form of the if statement in Python looks like this:
syntax:
_______________________
if condition:
statements
_______________________
Example
n=10
if(n==10):
print(n)
o/p: 10
Example 2.
weight = float(input("How many pounds does your suitcase weigh? "))
if(weight > 50):
print("There is a $25 charge for luggage that heavy.")
print("Thank you for your business.")
o/p:
How many pounds does your suitcase weigh? 12
Thank you for your business.
How many pounds does your suitcase weigh? 56
There is a $25 charge for luggage that heavy.
Thank you for your business.
The if...else Statements:
It's executes a group of statements when a condition is True; otherwise ,it will execute another group of statements.
syntax:
___________________________
if condition:
statements1
else:
statements2
___________________________
Example
temperature = float(input('What is the temperature? '))
if(temperature > 70):
print('Wear shorts.')
else:
print('Wear long pants.')
print('Get some exercise outside.')
o/p:
What is the temperature? 50
Wear long pants.
Get some exercise outside.
What is the temperature? 88
Wear shorts.
Get some exercise outside.
#program to check even or odd
a = int(input('Enter number '))
if(a %2==0):
print('Even number\t',a)
else:
print('Odd number\t',a)
o/p:
Enter number 15
Odd number 15
The if ...elif...else Statements:
The programmer has to test multiplecondition and execute statements depending on those conditions.
syntax:
_________________________
if condition:
statements1
elif condition:
statements2
elif condition:
statements3
elif condition:
statements4
else:
statements5
_________________________
Example
#prorgam to know if a given number is zero,or +ve or-ve
a=int(input("Enter a value"))
if(a==0):
print("a is ",a)
elif(a>0):
print(a," is posativeve")
else:
print(a," is negative")
o/p:
Enter a value-3
-3 is negative
The while loop:
A while loop statement in Python programming language repeatedly executes a target statement as long as a given condition is true.
syntax:
__________________________
while condition:
statements
__________________________
Example
x=1
while(x<=10):
print(x,end=" ")
x=x+1
print('end')
o/p: 1 2 3 4 5 6 7 8 9 10 end
Example
# Display even numbers between m and n
m,n=[int(i) for i in input("Enter min and max value").split(",")]
x=m
if(x%2!=0):
x=x+1
while(x>=m and x<=n):
print(x,end=" ")
x=x+2
print('end')
o/p:
Enter min and max value9,21
10 12 14 16 18 20 end
The for loop:
For loops can iterate over a sequence of numbers using the "range" and "xrange" functions. The difference between range and xrange is that the range function returns a new list with numbers of that specified range, whereas xrange returns an iterator, which is more efficient.
syntax:
____________________________
for var in range(start,end,jump):
statements
____________________________
#Display 1 to 20
for i in range(1,21):
print(i,end=" ")
o/p: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
#display odd number between 1 to 20
for i in range(1,21,2):
print(i,end=" ")
o/p:
1 3 5 7 9 11 13 15 17 19
#display odd number between 20 to 1
for i in range(20,0,-1):
print(i,end=" ")
o/p:
20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
Example
primes = [2, 3, 5, 7]
for prime in primes:
print(prime)
o/p:
2
3
5
7
Nested Loops:
Python supports to have an else statement associated with a loop statement.
==>If the else statement is used with a for loop, the else statement is executed when the loop has exhausted iterating the list.
==>If the else statement is used with a while loop, the else statement is executed when the condition becomes false.
Example
for i in range(3):
for j in range(4):
print("i=",i,"\tj=",j)
o/p:
i= 0 j= 0
i= 0 j= 1
i= 0 j= 2
i= 0 j= 3
i= 1 j= 0
i= 1 j= 1
i= 1 j= 2
i= 1 j= 3
i= 2 j= 0
i= 2 j= 1
i= 2 j= 2
i= 2 j= 3
#Display stars in right angle triangle form
for i in range(1,8):
for j in range(1,i+1):
print("*",end=" ")
print()
o/p:
*
* *
* * *
* * * *
* * * * *
* * * * * *
* * * * * * *
#Display stars in equilateral angle triangle form
n=20
for i in range(1,8):
print(' '*n,end="")
print('* '*(i))
n-=1
o/p:
*
* *
* * *
* * * *
* * * * *
* * * * * *
* * * * * * *
The else Suite:
It is possible to use else statements along with for loop or while loop.
for with else while with else
syntax: syntax
for var in range(): while(condition):
statements statements
else: else:
statements statements
Example
#for with else
for i in range(1,8):
print(i,end=' ')
else:
print("\nFinish")
o/p:
1 2 3 4 5 6 7
Finish
Example
#while with else
x=1
while(x<5):
print(x,end=' ')
x=x+1
else:
print('\nout of loop')
o/p:
1 2 3 4
out of loop
The Break Statement:
It terminates the current loop and resumes execution at the next statement, just like the traditional break statement in C.
The most common use for break is when some external condition is triggered requiring a hasty exit from a loop. The break statement can be used in both while and for loops.
If you are using nested loops, the break statement stops the execution of the innermost loop and start executing the next line of code after the block.
Example
x=1
while(x<10):
print(x,end=' ')
x=x+1
if(x==7):
break
print("out of loop")
o/p:
1 2 3 4 5 6 out of loop
The Pass Statement:
It is used when a statement is required syntactically but you do not want any command or code to execute.The pass statement is a null operation; nothing happens when it executes.
x=1
while(x<10):
print(x,end=' ')
x=x+1
if(x>7): # if >7 then continue next iteration
pass
print("out of loop")
o/p:
1 2 3 4 5 6 7 8 9 out of loop
The assert Statement:
It is useful to check if a particular condition is fulfille or not.
syntax:
assert expression,message
Example
def avg(marks):
assert(len(marks) != 0)
return(sum(marks)/len(marks))
mark1 = [15,20,18]
print("Average of mark1:",avg(mark1))
o/p:
Average of mark1: 17.666666666666668
Example
# Fibonacci numbers
def pro():
a,b=0,1
print("Sequence\' is")
for i in range(0,6):
print(a)
a,b=b,a+b
return()
pro()
o/p:
Sequence' is
0
1
1
2
3
5


Writing readable code is hard in the same way as waking up early in the morning or exercising is hard. You know it is good for you in the long run, but not doing it does not hurt you in the short run, and so you find it hard to motivate yourself to do it.
However, just like exercising, once you get in the habit of it (either by your own will power, or by being a part of organisation that demands it), you start treating as a game and start enjoying it, and become a better programmar. It does however, require some will power on a constant basis to sustain it.
Over past several years building QGraph, I have worked with several engineers. There are some whose code is challenging puzzle to understand. One has to constantly figure out the motivations for all the quirks found in the code, and work like a detective to unravel the crime. There are others whose code is a breeze to read, with well named functions, smooth flow of the code and liberal comments explaining the motivations of what the programmar has tried to achieve, and why he took certain approach over apparently superior alternative approach. Act of programming is hard and I appreciate any help I can get.
Writing comments explaining your motivation behind choosing a certaing approach is always a good idea. The code specifies precisely what you are doing, however, why you are doing that may not be obvious.
Indespenable as the comments are, they suffer from some shortcomings:
def get_mongo_start_and_end_time(self, start_time, end_time, mongo_time_limit): ''' this function returns mongo start and end time which returns mongo time frame for which segmentation will be done from mongo mongo_time_limit is datetime separates mongo time and segment service time ''' mongo_start_time = start_time if start_time > mongo_time_limit else mongo_time_limit mongo_end_time = end_time if end_time > mongo_time_limit else mongo_time_limit return mongo_start_time, mongo_end_time
While the programmar is trying hard to explain in English what he is trying to do, I find his code does a better job explaining his intent.
That is why there is a saying:"Code doesn't lie". The idea is that while comments or documentation may be misleading or outright false, the executing code is the unadulterated truth.
Most programming languages now a days support asserts.
They are a way to check for correctness of the state of the program during the run time. For instance, let's say we have implemented some very complicated factorization algorithm, like Lenstra elliptic-curve factorization. (I have sat in lecture by Hendrik Lenstra, by the way):
def find_factors(n): # Complex unreadable logic involving esoteric number theory return a, b
If despite test cases, we are not fully certain of correctness of the algorithm, we can assert that its output is correct, at run time:
n = ...get the number to be factored... a, b = find_factors(n) assert a * b == n
In case the assert fails, the program will crash, and the programmar can observe the input values to function find_factors which made it crash, and make amends. Crashing the program early is better than continuing with the wrong factorization and outputting a bogus result at the end.
Another variant of assert is used in test cases, where you input values with known correct output and assert that the actual output equals the known output. If the results do not match, you do not end the program, you just communicate this to the user.
Apart from run time checking and test cases, as outlined above, I have found it useful to use asserts as comments. I have profitably used asserts to document the assumptions that are made throughout the code. This leads to following benefits:
Let's consider a few examples.
def get_db_name(self, seg_os, env): assert env in ['prod', 'dev'] assert seg_os in ['android', 'ios', 'web'] if seg_os == 'ios': db_name = self.app_id + '_ios' if env == 'prod' else self.app_id + '_dev_ios' elif seg_os == 'android': db_name = self.app_id else: db_name = self.app_id + '_' + seg_os return db_name
In reading the above snippet, if the reader is not familar with the codebase and the conventions, he might struggle to understand what seg_os or env mean? The two asserts make it instantly clear as to what the possible values of the variables are.
Consider the following code:
def get_users_in_time_range(condition, start_time, end_time): assert start_time < end_time # More logic
Using the variable names as hint, the reader of the code can guess that start_time should be smaller than end_time, but can the two be equal? An assert makes it clear that the function expects start_time to be strictly smaller than end_time.
Code evolves as requirements change. We keep modifying code as more demands are placed on the software, and at times when we look at the overall code, we find ourselves to have done things differently from the way we would have done had we known the requirements in advance. (This holds true for living beings too: organisms evolve in response to changing environments, and their current form is not reflective of the just current environement, but also of past environments)
This sometimes leads to the code making quirky assumptions. These assumptions should be ideally gotten rid of. However, such clean up may sometimes fall behind in priority. Have a look at following example.
def compute_users(conditions): assert len(conditions) == 1 condition = conditions[0] # Work on condition
Without having a clarifying assert, the reader would be left thinking: why are we operating on only the first element of conditions? What happens to other conditions? After reading the assert, he will be clear that the array has only one element after all, for reasons unknown to him. He may wonder why is this single element being wrapped in an array (that is because of legacy reasons), but at least this particular function will be clear to him.
If you can understand a function without knowing the context in which it is used, that is a plus. Asserts can sometimes enable that. Consider the following code.
def work_1(): # do something def work_2(): # do something def work_3(): # do something def check_1(): return is_cond1() def check_2(): assert is_cond1() return is_cond2() and is_cond3() def do_something(): if not check_1(): work_1() elif check_2(): work_2() else: work_3()
In above example, suppose that evaluating condition2 make sense only if condition1 is true, and evaluationg condition3 makes sense only if condition2 is true.
Now, consider the context in which check_2() is called. From do_something() it is clear that check_2() will be called only if cond1 is true, (Otherwise the program would not come to elif clause). Thus, we should not check for cond1 in check_2(). However, if we only check for cond2 and cond3, the reader who is only reading check_2() will be left wondering whether or not cond1 is true. He knows that checking for cond2 makes sense only if cond1 is true. Thus he may wonder if writer of check_2() is even aware that checking cond2 makes sense only if cond1 is true.
Adding an assert here helps clarify the situation. Now the reader of check_2() can be convinced that check_2() is correct, without needing to know the context in which it is called.
Arguments against asserts are few. Here are two pitfalls to avoid.
That's it! As in life, so in programming, we should stand by truth, we should ASSERT truth! I hope you have fun doing it.


org.elasticsearch.search.suggest.term
类
TermSuggester
TermSuggestion
TermSuggestion.Entry
TermSuggestion.Entry.Option
TermSuggestion.Frequency
TermSuggestion.Score
TermSuggestionBuilder
枚举
TermSuggestionBuilder.StringDistanceImpl
TermSuggestionBuilder.SuggestMode


this is a ballerina. She's proabably so skinny from hamming so much.
This is a picture of characters from an anime called Deathnote! I missed it so much I drew this picture.
I drew this as a supplement for my application to the High School Diplomats program.
I drew this during winter break some time ago. I used pens!
I also draw plants and people, but I don't take pictures of those... I have tons more sketches and what not in my sketchbooks.


Career Profile
Experiences
Overall responsibility for the company's web development strategy.
NDTP manage projects of digital textbooks, timelines, authoring tools and repository. the scripting language is PHP using Codeigniter framework, Javascript. The database is MySql. AWS, API, MVC and Git.
Testing and measuring performance of 3G/UMTS network. assessing the coverage, capacity, and quality of service of the mobile radio


Attn:The managing director/ The President. 16/07/2006. Dear Sir, I seeks to have business dealings with you and your companies, in capital investments for business dealings . I will look forward to your prompt response to enable us discuss and venture into a business coporation, conatact should be made via mail . email address<EMAIL_ADDRESS>). I will look forward to your prompt response and future business relationship. Thanks Mr.Fred Chima.


I am a Full-Stack developer based out of Orange County, California. My passion for software development began in a small classroom at the University of Arizona where I took part in a virtual reality course. Through that class, I was introduced to the world of programming. After months of learning game development over the summer after graduating I decided to reach out to a friend who was already working as a software engineer at the time. He introduced me to web development, and recommended I take a few courses on HTML/CSS/JavaScript. I immediately fell in love, and began learning basic web development concepts.
After a few months of doing the self-taught route, I decided on taking my skills to the next level and enrolled into a full immersion Web Development program with LearningFuze. Throughtout the program I dove deep into understanding more advanced concepts of Web Development and launched a number of web applications that utitlized technolgies such as: HTML, CSS, JavaScript, React.js, Node.js, Express, SQL, and PostgreSQL


--- title: Changes made to Windows support version: "5.3" tags: - "5.3" - windows ---
Changes to the Windows releases:
php_pdo_oci8.dll
library (for use with Oracle version 8
client libraries) is no longer being built. Instead, use
php_pdo_oci.dll
(note no '8') with Oracle 10 or 11
client libraries. Connection to other database versions is still supported.
php_oci8_11g.dll
is available in addition to
php_oci8.dll
. Only one can be enabled at any time. Use
php_oci8.dll
with Oracle 10.2 client libraries. Use
php_oci8_11g.dll
with Oracle 11 or later client libraries.
Connection to other database versions is still supported.
Windows support has been added for the following functions:
Other changes:
PHP_WINDOWS_*
. A list of these constants and their usage
can be found at Predefined Constants.
Support for the ISAPI module has been dropped. Use the improved FastCGI SAPI module instead.
Note: A new dedicated site for PHP on Windows is now available, including downloads, release candidates, and snapshots in various flavors (thread-safe/not-thread-safe, VC6/VC9, x86/x64). The URL of this site is » https://windows.php.net/.


960px
. less/components/GridSystem.less
provides all column widths, which are documented below, for most use cases.Each row of columns is wrapped within a GridRow
. This keeps them organized and prevents a mosaic effect from occuring. GridRow
has no defined properties but instead has a state rule for ::after
, which sets its display
property value to block
, its clear
property value to both
, and its content
property value to ""
. Having this rule in place allows every instance of GridRow
to fully contain any elements within it that may be floating.
GridRow
also updates any children img
nodes to be responsive by setting their max-width
property value to 100%
and their height
property value to auto
.
To use it, give a div
node a class
of GridRow
and place your content inside. A GridRow
must go within a Block
.
The purpose of the GridContainer
is to contain a pages content within a set width. This prevents a pages content from spanning 100% of the viewport. Viewports that have a minimum width of 1024px
have the GridContainer
width
property value set to 960px
. Viewports smaller than this have the GridContainer
width
property value set to 100%. A GridContainer
has a margin
property value of 0 auto
. Like the GridRow
, a GridContainer
has a state rule for ::after
, which sets its display
property value to block
, its clear
property value to both
, and its content
property value to ""
. Having this rule in place allows every instance of GridRow
to fully contain any elements within it that may be floating.
To use it, give a div
node a class
of GridContainer
and place your content inside. A GridContainer
must go within a GridRow
.
Our grid contains 12 columns. Columns break up content into vertical groups. Depending on the design we're trying to build, depends on the arrangement of the widths of each column. Each GridRow
must contain column widths that equate to 12
. For example:
We've chosen to be super descriptive with our column nomenclature. To use a single column, give a div
node a class
of OneColumn
followed by either the --medium
or --large
modifier. Columns larger than a single column use *Columns
, i.e. ThreeColumns
, EightColumns
, etc.
Any column with a --large
modifier will determine how many columns that node will use on a viewport with a width greater than or equal to 1024px
.
Any column with a --medium
modifier will determine how many columns that node will use on a viewport with a width less than 1024px
.


acl acl2010 acl2010-126 acl2010-126-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Verena Henrich ; Erhard Hinrichs
Abstract: GernEdiT (short for: GermaNet Editing Tool) offers a graphical interface for the lexicographers and developers of GermaNet to access and modify the underlying GermaNet resource. GermaNet is a lexical-semantic wordnet that is modeled after the Princeton WordNet for English. The traditional lexicographic development of GermaNet was error prone and time-consuming, mainly due to a complex underlying data format and no opportunity of automatic consistency checks. GernEdiT replaces the earlier development by a more userfriendly tool, which facilitates automatic checking of internal consistency and correctness of the linguistic resource. This paper pre- sents all these core functionalities of GernEdiT along with details about its usage and usability. 1
Claudia Kunze and Lothar Lemnitzer. 2002. GermaNet – representation, visualization, application. Proceedings of LREC 2002, Main Conference, Vol V. pp. 1485-1491, 2002. Christiane Fellbaum (ed.). 1998. WordNet – An Electronic Lexical Database. Cambridge, MA: MIT Press. Verena Henrich and Erhard Hinrichs. 2010. GernEdiT – The GermaNet Editing Tool. Proceedings of LREC 2010, Main Conference, Valletta, Malta. Rat für deutsche Rechtschreibung (eds.) (2006). Deutsche Rechtschreibung – Regeln und Wörterverzeichnis: Amtliche Regelung. Gunter Narr Verlag Tübingen. 24


andrew_gelman_stats andrew_gelman_stats-2011 andrew_gelman_stats-2011-729 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Peng Yu writes: On page 180 of BDA2, deviance is defined as D(y,\theta)=-2log p(y|\theta). However, according to GLM 2/e by McCullagh and Nelder, deviance is the different of the log-likelihood of the full model and the base model (times 2) (see the equation on the wiki webpage). The english word ‘deviance’ implies the difference from a standard (in this case, the base model). I’m wondering what the rationale for your definition of deviance, which consists of only 1 term rather than 2 terms. My reply: Deviance is typically computed as a relative quantity; that is, people look at the difference in deviance. So the two definitions are equivalent.
sentIndex sentText sentNum sentScore
1 Peng Yu writes: On page 180 of BDA2, deviance is defined as D(y,\theta)=-2log p(y|\theta). [sent-1, score-0.86]
2 However, according to GLM 2/e by McCullagh and Nelder, deviance is the different of the log-likelihood of the full model and the base model (times 2) (see the equation on the wiki webpage). [sent-2, score-1.56]
3 The english word ‘deviance’ implies the difference from a standard (in this case, the base model). [sent-3, score-0.673]
4 I’m wondering what the rationale for your definition of deviance, which consists of only 1 term rather than 2 terms. [sent-4, score-0.579]
5 My reply: Deviance is typically computed as a relative quantity; that is, people look at the difference in deviance. [sent-5, score-0.467]
wordName wordTfidf (topN-words)
[('deviance', 0.708), ('theta', 0.219), ('base', 0.206), ('mccullagh', 0.18), ('peng', 0.18), ('nelder', 0.17), ('yu', 0.157), ('wiki', 0.145), ('consists', 0.139), ('rationale', 0.139), ('definitions', 0.137), ('glm', 0.134), ('difference', 0.124), ('computed', 0.117), ('equation', 0.114), ('webpage', 0.113), ('quantity', 0.112), ('model', 0.106), ('implies', 0.102), ('definition', 0.102), ('english', 0.101), ('equivalent', 0.092), ('relative', 0.086), ('defined', 0.085), ('wondering', 0.085), ('word', 0.083), ('term', 0.077), ('according', 0.074), ('typically', 0.069), ('page', 0.067), ('full', 0.065), ('however', 0.061), ('times', 0.057), ('standard', 0.057), ('reply', 0.052), ('look', 0.046), ('case', 0.039), ('rather', 0.037), ('different', 0.036), ('two', 0.034), ('writes', 0.027), ('people', 0.025), ('see', 0.024)]
simIndex simValue blogId blogTitle
same-blog 1 1.0000001 729 andrew gelman stats-2011-05-24-Deviance as a difference
Introduction: Peng Yu writes: On page 180 of BDA2, deviance is defined as D(y,\theta)=-2log p(y|\theta). However, according to GLM 2/e by McCullagh and Nelder, deviance is the different of the log-likelihood of the full model and the base model (times 2) (see the equation on the wiki webpage). The english word ‘deviance’ implies the difference from a standard (in this case, the base model). I’m wondering what the rationale for your definition of deviance, which consists of only 1 term rather than 2 terms. My reply: Deviance is typically computed as a relative quantity; that is, people look at the difference in deviance. So the two definitions are equivalent.
Introduction: Jean Richardson writes: Do you know what might lead to a large negative cross-correlation (-0.95) between deviance and one of the model parameters? Here’s the (brief) background: I [Richardson] have written a Bayesian hierarchical site occupancy model for presence of disease on individual amphibians. The response variable is therefore binary (disease present/absent) and the probability of disease being present in an individual (psi) depends on various covariates (species of amphibian, location sampled, etc.) paramaterized using a logit link function. Replicates are individuals sampled (tested for presence of disease) together. The possibility of imperfect detection is included as p = (prob. disease detected given disease is present). Posterior distributions were estimated using WinBUGS via R2WinBUGS. Simulated data from the model fit the real data very well and posterior distribution densities seem robust to any changes in the model (different priors, etc.) All autocor
3 0.30894631 1516 andrew gelman stats-2012-09-30-Computational problems with glm etc.
Introduction: John Mount provides some useful background and follow-up on our discussion from last year on computational instability of the usual logistic regression solver. Just to refresh your memory, here’s a simple logistic regression with only a constant term and no separation, nothing pathological at all: > y <- rep (c(1,0),c(10,5)) > display (glm (y ~ 1, family=binomial(link="logit"))) glm(formula = y ~ 1, family = binomial(link = "logit")) coef.est coef.se (Intercept) 0.69 0.55 --- n = 15, k = 1 residual deviance = 19.1, null deviance = 19.1 (difference = 0.0) And here’s what happens when we give it the not-outrageous starting value of -2: > display (glm (y ~ 1, family=binomial(link="logit"), start=-2)) glm(formula = y ~ 1, family = binomial(link = "logit"), start = -2) coef.est coef.se (Intercept) 71.97 17327434.18 --- n = 15, k = 1 residual deviance = 360.4, null deviance = 19.1 (difference = -341.3) Warning message:
4 0.30265656 696 andrew gelman stats-2011-05-04-Whassup with glm()?
Introduction: We’re having problem with starting values in glm().  Here’s the R code: > y <- rep (c(1,0),c(10,5)) > glm (y ~ 1, family=binomial(link="logit")) Call: glm(formula = y ~ 1, family = binomial(link = "logit")) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=2) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 2) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=5) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 5) Coefficients: (Intercept) 1.501e+15 Degrees of Freedom: 14 Total (i.
5 0.13177542 1089 andrew gelman stats-2011-12-28-Path sampling for models of varying dimension
Introduction: Somebody asks: Iâ€™m reading your paper on path sampling. It essentially solves the problem of computing the ratio \int q0(omega)d omega/\int q1(omega) d omega. I.e the arguments in q0() and q1() are the same. But this assumption is not always true in Bayesian model selection using Bayes factor. In general (for BF), we have this problem, t1 and t2 may have no relation at all. \int f1(y|t1)p1(t1) d t1 / \int f2(y|t2)p2(t2) d t2 As an example, suppose that we want to compare two sets of normally distributed data with known variance whether they have the same mean (H0) or they are not necessarily have the same mean (H1). Then the dummy variable should be mu in H0 (which is the common mean of both set of samples), and should be (mu1, mu2) (which are the means for each set of samples). One straight method to address my problem is to preform path integration for the numerate and the denominator, as both the numerate and the denominator are integrals. Each integral can be rewrit
6 0.1214527 1941 andrew gelman stats-2013-07-16-Priors
7 0.11978365 776 andrew gelman stats-2011-06-22-Deviance, DIC, AIC, cross-validation, etc
8 0.097317882 547 andrew gelman stats-2011-01-31-Using sample size in the prior distribution
9 0.097149417 1868 andrew gelman stats-2013-05-23-Validation of Software for Bayesian Models Using Posterior Quantiles
10 0.09711498 899 andrew gelman stats-2011-09-10-The statistical significance filter
11 0.08824192 1975 andrew gelman stats-2013-08-09-Understanding predictive information criteria for Bayesian models
12 0.087236129 1476 andrew gelman stats-2012-08-30-Stan is fast
13 0.080732659 571 andrew gelman stats-2011-02-13-A departmental wiki page?
14 0.079227261 961 andrew gelman stats-2011-10-16-The “Washington read” and the algebra of conditional distributions
15 0.0763603 2349 andrew gelman stats-2014-05-26-WAIC and cross-validation in Stan!
16 0.074544653 2155 andrew gelman stats-2013-12-31-No on Yes-No decisions
17 0.073678389 1999 andrew gelman stats-2013-08-27-Bayesian model averaging or fitting a larger model
18 0.071264133 1130 andrew gelman stats-2012-01-20-Prior beliefs about locations of decision boundaries
20 0.066449381 1913 andrew gelman stats-2013-06-24-Why it doesn’t make sense in general to form confidence intervals by inverting hypothesis tests
topicId topicWeight
[(0, 0.071), (1, 0.07), (2, 0.018), (3, 0.019), (4, 0.017), (5, -0.015), (6, 0.027), (7, -0.013), (8, 0.026), (9, -0.018), (10, -0.012), (11, 0.005), (12, -0.016), (13, -0.029), (14, -0.04), (15, 0.021), (16, 0.005), (17, -0.021), (18, -0.002), (19, -0.028), (20, 0.071), (21, 0.011), (22, 0.058), (23, -0.08), (24, 0.03), (25, 0.0), (26, -0.01), (27, -0.007), (28, 0.029), (29, -0.004), (30, -0.047), (31, 0.04), (32, 0.006), (33, 0.015), (34, 0.002), (35, 0.015), (36, -0.011), (37, -0.009), (38, 0.009), (39, 0.047), (40, 0.025), (41, 0.014), (42, -0.062), (43, -0.016), (44, -0.017), (45, -0.025), (46, 0.095), (47, 0.028), (48, -0.037), (49, 0.104)]
simIndex simValue blogId blogTitle
same-blog 1 0.90058339 729 andrew gelman stats-2011-05-24-Deviance as a difference
Introduction: Peng Yu writes: On page 180 of BDA2, deviance is defined as D(y,\theta)=-2log p(y|\theta). However, according to GLM 2/e by McCullagh and Nelder, deviance is the different of the log-likelihood of the full model and the base model (times 2) (see the equation on the wiki webpage). The english word ‘deviance’ implies the difference from a standard (in this case, the base model). I’m wondering what the rationale for your definition of deviance, which consists of only 1 term rather than 2 terms. My reply: Deviance is typically computed as a relative quantity; that is, people look at the difference in deviance. So the two definitions are equivalent.
Introduction: Jean Richardson writes: Do you know what might lead to a large negative cross-correlation (-0.95) between deviance and one of the model parameters? Here’s the (brief) background: I [Richardson] have written a Bayesian hierarchical site occupancy model for presence of disease on individual amphibians. The response variable is therefore binary (disease present/absent) and the probability of disease being present in an individual (psi) depends on various covariates (species of amphibian, location sampled, etc.) paramaterized using a logit link function. Replicates are individuals sampled (tested for presence of disease) together. The possibility of imperfect detection is included as p = (prob. disease detected given disease is present). Posterior distributions were estimated using WinBUGS via R2WinBUGS. Simulated data from the model fit the real data very well and posterior distribution densities seem robust to any changes in the model (different priors, etc.) All autocor
3 0.70818084 1089 andrew gelman stats-2011-12-28-Path sampling for models of varying dimension
Introduction: Somebody asks: Iâ€™m reading your paper on path sampling. It essentially solves the problem of computing the ratio \int q0(omega)d omega/\int q1(omega) d omega. I.e the arguments in q0() and q1() are the same. But this assumption is not always true in Bayesian model selection using Bayes factor. In general (for BF), we have this problem, t1 and t2 may have no relation at all. \int f1(y|t1)p1(t1) d t1 / \int f2(y|t2)p2(t2) d t2 As an example, suppose that we want to compare two sets of normally distributed data with known variance whether they have the same mean (H0) or they are not necessarily have the same mean (H1). Then the dummy variable should be mu in H0 (which is the common mean of both set of samples), and should be (mu1, mu2) (which are the means for each set of samples). One straight method to address my problem is to preform path integration for the numerate and the denominator, as both the numerate and the denominator are integrals. Each integral can be rewrit
4 0.69102883 696 andrew gelman stats-2011-05-04-Whassup with glm()?
Introduction: We’re having problem with starting values in glm().  Here’s the R code: > y <- rep (c(1,0),c(10,5)) > glm (y ~ 1, family=binomial(link="logit")) Call: glm(formula = y ~ 1, family = binomial(link = "logit")) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=2) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 2) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=5) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 5) Coefficients: (Intercept) 1.501e+15 Degrees of Freedom: 14 Total (i.
5 0.59972167 1422 andrew gelman stats-2012-07-20-Likelihood thresholds and decisions
Introduction: David Hogg points me to this discussion: Martin Strasbourg and I [Hogg] discussed his project to detect new satellites of M31 in the PAndAS survey. He can construct a likelihood ratio (possibly even a marginalized likelihood ratio) at every position in the M31 imaging, between the best-fit satellite-plus-background model and the best nothing-plus-background model. He can make a two-dimensional map of these likelihood ratios and show a the histogram of them. Looking at this histogram, which has a tail to very large ratios, he asked me, where should I put my cut? That is, at what likelihood ratio does a candidate deserve follow-up? Here’s my unsatisfying answer: To a statistician, the distribution of likelihood ratios is interesting and valuable to study. To an astronomer, it is uninteresting. You don’t want to know the distribution of likelihoods, you want to find satellites . . . I wrote that I think this makes sense and that it would actualy be an interesting and useful rese
6 0.59885615 1868 andrew gelman stats-2013-05-23-Validation of Software for Bayesian Models Using Posterior Quantiles
7 0.59860235 1516 andrew gelman stats-2012-09-30-Computational problems with glm etc.
8 0.58251852 1346 andrew gelman stats-2012-05-27-Average predictive comparisons when changing a pair of variables
9 0.57061929 858 andrew gelman stats-2011-08-17-Jumping off the edge of the world
10 0.56861353 547 andrew gelman stats-2011-01-31-Using sample size in the prior distribution
12 0.5296616 2342 andrew gelman stats-2014-05-21-Models with constraints
13 0.52899522 1476 andrew gelman stats-2012-08-30-Stan is fast
14 0.52747732 782 andrew gelman stats-2011-06-29-Putting together multinomial discrete regressions by combining simple logits
15 0.52333391 1284 andrew gelman stats-2012-04-26-Modeling probability data
16 0.52327418 2311 andrew gelman stats-2014-04-29-Bayesian Uncertainty Quantification for Differential Equations!
17 0.52296317 1527 andrew gelman stats-2012-10-10-Another reason why you can get good inferences from a bad model
18 0.52004939 151 andrew gelman stats-2010-07-16-Wanted: Probability distributions for rank orderings
19 0.51806509 160 andrew gelman stats-2010-07-23-Unhappy with improvement by a factor of 10^29
20 0.51618332 1363 andrew gelman stats-2012-06-03-Question about predictive checks
topicId topicWeight
[(0, 0.025), (16, 0.056), (21, 0.032), (24, 0.142), (50, 0.164), (54, 0.025), (55, 0.032), (61, 0.124), (87, 0.021), (89, 0.026), (94, 0.037), (98, 0.027), (99, 0.131)]
simIndex simValue blogId blogTitle
same-blog 1 0.90691459 729 andrew gelman stats-2011-05-24-Deviance as a difference
Introduction: Peng Yu writes: On page 180 of BDA2, deviance is defined as D(y,\theta)=-2log p(y|\theta). However, according to GLM 2/e by McCullagh and Nelder, deviance is the different of the log-likelihood of the full model and the base model (times 2) (see the equation on the wiki webpage). The english word ‘deviance’ implies the difference from a standard (in this case, the base model). I’m wondering what the rationale for your definition of deviance, which consists of only 1 term rather than 2 terms. My reply: Deviance is typically computed as a relative quantity; that is, people look at the difference in deviance. So the two definitions are equivalent.
2 0.77870291 818 andrew gelman stats-2011-07-23-Parallel JAGS RNGs
Introduction: As a matter of convention, we usually run 3 or 4 chains in JAGS. By default, this gives rise to chains that draw samples from 3 or 4 distinct pseudorandom number generators. I didn’t go and check whether it does things 111,222,333 or 123,123,123, but in any event the “parallel chains” in JAGS are samples drawn from distinct RNGs computed on a single processor core. But we all have multiple cores now, or we’re computing on a cluster or the cloud! So the behavior we’d like from rjags is to use the foreach package with each JAGS chain using a parallel-safe RNG. The default behavior with n.chain=1 will be that each parallel instance will use .RNG.name[1] , the Wichmann-Hill RNG. JAGS 2.2.0 includes a new lecuyer module (along with the glm module, which everyone should probably always use, and doesn’t have many undocumented tricks that I know of). But lecuyer is completely undocumented! I tried .RNG.name="lecuyer::Lecuyer" , .RNG.name="lecuyer::lecuyer" , and .RNG.name=
3 0.74730194 374 andrew gelman stats-2010-10-27-No matter how famous you are, billions of people have never heard of you.
Introduction: I was recently speaking with a member of the U.S. House of Representatives, a Californian in a tight race this year. I mentioned the fivethirtyeight.com prediction for him, and he said “fivethirtyeight.com? What’s that?”
4 0.7463814 696 andrew gelman stats-2011-05-04-Whassup with glm()?
Introduction: We’re having problem with starting values in glm().  Here’s the R code: > y <- rep (c(1,0),c(10,5)) > glm (y ~ 1, family=binomial(link="logit")) Call: glm(formula = y ~ 1, family = binomial(link = "logit")) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=2) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 2) Coefficients: (Intercept) 0.6931 Degrees of Freedom: 14 Total (i.e. Null); 14 Residual Null Deviance: 19.1 Residual Deviance: 19.1 AIC: 21.1 > glm (y ~ 1, family=binomial(link="logit"), start=5) Call: glm(formula = y ~ 1, family = binomial(link = "logit"), start = 5) Coefficients: (Intercept) 1.501e+15 Degrees of Freedom: 14 Total (i.
5 0.74480128 16 andrew gelman stats-2010-05-04-Burgess on Kipling
Introduction: This is my last entry derived from Anthony Burgess’s book reviews , and it’ll be short. His review of Angus Wilson’s “The Strange Ride of Rudyard Kipling: His Life and Works” is a wonderfully balanced little thing. Nothing incredibly deep–like most items in the collection, the review is only two pages long–but I give it credit for being a rare piece of Kipling criticism I’ve seen that (a) seriously engages with the politics, without (b) congratulating itself on bravely going against the fashions of the politically incorrect chattering classes by celebrating Kipling’s magnificent achievement blah blah blah. Instead, Burgess shows respect for Kipling’s work and puts it in historical, biographical, and literary context. Burgess concludes that Wilson’s book “reminds us, in John Gross’s words, that Kipling ‘remains a haunting, unsettling presence, with whom we still have to come to terms.’ Still.” Well put, and generous of Burgess to end his review with another’s quote. Other cri
7 0.72339398 1433 andrew gelman stats-2012-07-28-LOL without the CATS
8 0.72003365 1975 andrew gelman stats-2013-08-09-Understanding predictive information criteria for Bayesian models
9 0.71727717 1558 andrew gelman stats-2012-11-02-Not so fast on levees and seawalls for NY harbor?
10 0.71323454 1370 andrew gelman stats-2012-06-07-Duncan Watts and the Titanic
12 0.69896781 1028 andrew gelman stats-2011-11-26-Tenure lets you handle students who cheat
13 0.69796979 1793 andrew gelman stats-2013-04-08-The Supreme Court meets the fallacy of the one-sided bet
14 0.69516408 1757 andrew gelman stats-2013-03-11-My problem with the Lindley paradox
15 0.69309723 2349 andrew gelman stats-2014-05-26-WAIC and cross-validation in Stan!
16 0.69032383 1805 andrew gelman stats-2013-04-16-Memo to Reinhart and Rogoff: I think it’s best to admit your errors and go on from there
17 0.68760127 1283 andrew gelman stats-2012-04-26-Let’s play “Guess the smoother”!
19 0.68701279 827 andrew gelman stats-2011-07-28-Amusing case of self-defeating science writing
20 0.68114209 232 andrew gelman stats-2010-08-25-Dodging the diplomats


Data Feed: DivFeed
Category: EntityExtenderFeed
| Field | DivRecord Property | Type | Description |
|---|---|---|---|
| --- Required Fields --- | |||
| entityId | entity | String | any valid security identifier |
| date | date | Date | ex-date of dividend data |
| currencyId | baseCurrency | String | id of currency in which dividends are provided |
| --- Suggested Fields --- | |||
| adjustmentDate | adjustmentDate | Date | date through which dividend is adjusted |
| recordValue | recordValue | Number | total cash dividends on ex-date |
Note that you do not need to resend data that has changed as the result of a split adjustment. Only true data corrections need to be supplied using this feed.
The following tab-delimited feed could be used to create DividendRecord
instances:
Related Feeds:
Sample Upload:
Interface ExternalFeedManager upload: "DivFeed" using:
"entityId date currencyId recordValue
45920010 05/07/1997 USD 0.20
45920010 08/07/1997 USD 0.20
45920010 11/06/1997 USD 0.20
37044210 05/13/1997 USD 0.50
37044210 08/12/1997 USD 0.50
37044210 11/10/1997 USD 0.50
" ;
| Copyright © 2000 Innovative Systems Techniques, Inc. | Updated December 15, 2000 |


Services
Payments
How it works
Solution
FAQ
⇓ Whitepaper
Services
Payments
How it Works
Solution
FAQ
⇓ Whitepaper
Changelog
Date: 01/30/2020 - Initial Launch


PARTYNEXTDOOR Releases New Drake Collaboration ‘Loyal’
by Corey AtadDrake is giving a boost to his OVO prodigy.
On Friday, PARTYNEXTDOOR released his first single as lead artist since 2017, “Loyal”, featuring Drake.
The rapper also hasn’t appeared as a featured artist since Calvin Harris’ 2018 track “Nuh Ready Nuh Ready”.
Along with “Loyal”, PARTYNEXTDOOR also dropped a second single, “The News”, which despite not featuring Drake, has all the atmospherics of an early track by the Canadian superstar.


100%
80%
60%
40%
20%
0%
Then
Now
current
Chances you are on the page you are looking for.
Please go back to your home dashboard and try again.
If the error persists, seek help on the community site.


Seedwater Projects in Kenya
Maai Mahiu is a truck-stop town at the base of the Rift Valley escarpment in Kenya. Home to more than 60,000 residents, the area is rich in trade, agriculture, and showcases a kaleidoscope of cultures. Here, you can enjoy a steaming plate of nyama choma (roasted meat) or a slice of fresh mango. Amid the traffic, poor farmers and pastoralists coalesce with long-haul truck drivers and small business owners. Poverty is a daily reality here, where garbage lines the roads, collecting in waterways and rotting on corners.
The buildup of garbage in Maai Mahiu is more than just an eyesore. Due to a lack of adequate services, trash has been accumulating on streets, around homes, and in the natural environment - causing concern for the health and wellbeing of the community. Not only is there a huge need for proper sanitation services and waste removal, but there is an untapped market for waste collection and recycling – especially plastics – to keep trash off the streets, and when possible, out of the landfill.
Rocky Muuri, a community leader and expert in waste management, has a vision for a greener, healthier Maai Mahiu. He’s been making this dream a reality since 2012, when he led a local NGO project bringing waste collection to Maai Mahiu for the first time. He is now expanding this project into a private enterprise to ensure long-term sustainability, and to offer these essential services to the whole community – not just a small slice. Realizing this vision for all of Maai Mahiu starts with a cargo truck.
Rocky needed funds for a truck to transport waste and recyclable materials to appropriate processors, which would also add new jobs and expand key services to community members. Rocky has seen the detrimental impacts of waste on the community and the environment since he was a child. Maai Mahiu residents are currently not afforded the right to a clean life, as the government and private waste haulers have historically neglected them.
Seedwater Consulting supported Rocky's community leadership through business development services, technical assistance, and fundraising through grants and a crowdfunding campaign.


Unused Computing are converted to research. Researches on the backlog will not be researched. Research multiplier: Computing is increasing at: Research /s:
ToDo


cupsaccept
Section: Apple Inc. (8)Updated: CUPS
Index Return to Main Contents
NAME
cupsaccept/cupsreject - accept/reject jobs sent to a destinationSYNOPSIS
cupsaccept [ -E ] [ -U username ] [ -h hostname[:port] ] destination(s)cupsreject [ -E ] [ -U username ] [ -h hostname[:port] ] [ -r reason ] destination(s)
DESCRIPTION
cupsaccept instructs the printing system to accept print jobs to the specified destinations.cupsreject instructs the printing system to reject print jobs to the specified destinations. The -r option sets the reason for rejecting print jobs. If not specified the reason defaults to "Reason Unknown".
OPTIONS
The following options are supported by both cupsaccept and cupsreject:- -E
-
Forces encryption when connecting to the server. - -U username
-
Sets the username that is sent when connecting to the server. - -h hostname[:port]
-
Chooses an alternate server. - -r "reason"
-
Sets the reason string that is shown for a printer that is rejecting jobs.
COMPATIBILITY
Unlike the System V printing system, CUPS allows printer names to contain any printable character except SPACE, TAB, "/", or "#". Also, printer and class names are not case-sensitive.The CUPS versions of accept and reject may ask the user for an access password depending on the printing system configuration. This differs from the System V versions which require the root user to execute these commands.
SEE ALSO
cancel(1), cupsenable(8), lp(1), lpadmin(8), lpstat(1),http://localhost:631/help
COPYRIGHT
Copyright 2007-2009 by Apple Inc.
Index
This document was created by man2html, using the manual pages.
Time: 05:34:24 GMT, December 24, 2015


Before Change
i_atomic_numbers = set(atoms.get_atomic_numbers())
i_symbols = set(atoms.get_chemical_symbols())
distance_matrix = atoms.get_all_distances(mic=True)
elif isinstance(atoms, System):
i_atomic_numbers = set(atoms.numbers)
i_symbols = set(atoms.symbols)
distance_matrix = atoms.get_periodic_distances()
// Gather atomic numbers and symbols
After Change
// Gather min distance. For periodic systems we must also consider
// distances from an atom to it"s periodic copy, as given by
// get_distance_matrix() on the diagonal.
if np.any(system.get_pbc()):
triu_indices = np.triu_indices(len(distance_matrix), k=0)
else:
triu_indices = np.triu_indices(len(distance_matrix), k=1)
distances = distance_matrix[triu_indices]
i_min_dist = distances.min()
if min_distance is None or i_min_dist < min_distance:


[80]
Global Carbon Project, via Our World in Data. Annual CO2 Emissions by Region.
https://ourworldindata.org/grapher/annual-co-emissions-by-region
.https://ourworldindata.org/grapher/annual-co-emissions-by-region
.


¡Bienvenido!
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s. It has survived not only five centuries.


Bourbon is a library of pure Sass mixins that are designed to be simple and easy to use. No configuration required. The mixins aim to be as vanilla as possible, meaning they should be as close to the original CSS syntax as possible.
The mixins contain vendor specific prefixes for all CSS3 properties for support amongst modern browsers. The prefixes also ensure graceful degradation for older browsers that support only CSS3 prefixed properties. Bourbon uses SCSS syntax.
For command line help, visit our wiki page on Bourbon’s command line interface.
gem install bourbon
Alternatively, you can install Bourbon with Bower.
bourbon install
Pro Tip: You can target installation into a specific directory using the path
flag:
bourbon install --path my/custom/path/
@import "bourbon/bourbon";
It’s not recommended to add or modify the Bourbon files so that you can update them easily.
gem 'bourbon'
bundle install
application.css
to application.scss
: mv app/assets/stylesheets/application.css app/assets/stylesheets/application.scss
Delete all Sprockets directives in application.scss
(require
, require_tree
and require_self
) and use Sass’s native @import
instead.
Import Bourbon at the beginning of application.scss
. All additional stylesheets should be imported below Bourbon:
@import "bourbon";
@import "home";
@import "users";
Help! I’m getting an undefined mixin error.
gem uninstall bourbon
-v
flag to specify the version you need: gem install bourbon -v 3.2.4
Also check out Proteus, a collection of useful starter kits to help you prototype faster. Each kit comes with Bourbon, Neat and Bitters out-of-the-box.
Bourbon is maintained and funded by thoughtbot, inc. Tweet your questions or suggestions to @bourbonsass and while you’re at it follow us too.
Copyright © 2011–2015 thoughtbot, inc. Bourbon is free software, and may be redistributed under the terms specified in the license.


| I l@ve RuBoard |
The Windows platform (Windows 95, 98, and NT) is one of the most active areas of growth for Python, both in terms of the number of users and in the number of extensions being built. While the standard distribution from www.python.org works just fine on Windows, there are a set of Windows-specific extensions that are available as part of the win32all package, from Mark Hammond. The win32all package is available at http://www.python.org/windows/win32all/ and includes several powerful programs and extensions.
The most visible is the Pythonwin program, which is an integrated development environment for Python, providing an interactive interpreter interface (with keyboard shortcuts, font coloring, etc.), an editor, and an object browser (see Figure B.1). Pythonwin is, in fact, using several large packages that allow Python to drive a great deal of the libraries available as part of Windows, such as the Microsoft Foundation Classes, the ODBC database interface, NT-specific services such as logging, performance monitoring, memory-mapped files, pipes, timers, and, most importantly, all of COM, Microsoft's Common Object Model. This means that, as we mentioned in Chapter 10, most modern software written for Windows should be scriptable from Python if it supports any scripting at all. In general, almost anything you can do in heavily marketed scripting languages such as Visual Basic, you can do in Python with COM support. Python can also be used as an ActiveX scripting host in such programs as Internet Explorer.
| I l@ve RuBoard |


When using AbstractActionController or AbstractRestfulController, the request and response object are composed directly into the controller as soon as dispatch() is called. You may access them in the following ways:
1 2 3 4 5 6 7 | // Using explicit accessor methods
$request = $this->getRequest();
$response = $this->getResponse();
// Using direct property access
$request = $this->request;
$response = $this->response;
|
Additionally, if your controller implements InjectApplicationEventInterface (as both AbstractActionController and AbstractRestfulController do), you can access these objects from the attached MvcEvent:
1 2 3 | $event = $this->getEvent();
$request = $event->getRequest();
$response = $event->getResponse();
|
The above can be useful when composing event listeners into your controller.
The parameters returned when routing completes are wrapped in a Zend\Mvc\Router\RouteMatch object. This object is detailed in the section on Routing.
Within your controller, if you implement InjectApplicationEventInterface (as both AbstractActionController and AbstractRestfulController do), you can access this object from the attached MvcEvent:
1 2 | $event = $this->getEvent();
$matches = $event->getRouteMatch();
|
Once you have the RouteMatch object, you can pull parameters from it.
The same can be done using the Params plugin.
You can effectively short-circuit execution of the application at any point by returning a Response from your controller or any event. When such a value is discovered, it halts further execution of the event manager, bubbling up to the Application instance, where it is immediately returned.
As an example, the Redirect plugin returns a Response, which can be returned immediately so as to complete the request as quickly as possible. Other use cases might be for returning JSON or XML results from web service endpoints, returning “401 Unauthorized” results, etc.
Often you may want module-specific listeners. As an example, this would be a simple and effective way to introduce authorization, logging, or caching into your application.
Each Module class can have an optional onBootstrap() method. Typically, you’ll do module-specific configuration here, or setup event listeners for you module here. The onBootstrap() method is called for every module on every page request and should only be used for performing lightweight tasks such as registering event listeners.
The base Application class shipped with the framework has an EventManager associated with it, and once the modules are initialized, it triggers the bootstrap event, with a getApplication() method on the event.
So, one way to accomplish module-specific listeners is to listen to that event, and register listeners at that time. As an example:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | namespace SomeCustomModule;
class Module
{
/**
* @param \Zend\Mvc\MvcEvent $e The MvcEvent instance
* @return void
*/
public function onBootstrap($e)
{
$application = $e->getApplication();
$config = $application->getConfig();
$view = $application->getServiceManager()->get('ViewHelperManager');
// You must have these keys in you application config
$view->headTitle($config['view']['base_title']);
// This is your custom listener
$listener = new Listeners\ViewListener();
$listener->setView($view);
$application->getEventManager()->attachAggregate($listener);
}
}
|
The above demonstrates several things. First, it demonstrates a listener on the application’s bootstrap event (the onBootstrap() method). Second, it demonstrates that listener, and how it can be used to register listeners with the application. It grabs the Application instance; from the Application, it is able to grab the attached service manager and configuration. These are then used to retrieve the view, configure some helpers, and then register a listener aggregate with the application event manager.
The source code of this file is hosted on GitHub. Everyone can update and fix errors in this document with few clicks - no downloads needed.


The following are functions which provide procedural programming capabilities as found in languages such as Pascal, C, and Ada.
BIND
BREAK
IF
LOOP-FOR-COUNT
PROGN
PROGN$
RETURN
SWITCH
WHILE


new WebRtcPeer(mode, localVideo, remoteVideo, videoStream, audioStream)
Wrapper object of an RTCPeerConnection. This object is aimed to simplify the
development of WebRTC-based applications.
Parameters:
| Name | Type | Description |
|---|---|---|
mode |
String | Mode in which the PeerConnection will be configured. Valid values are: 'recvonly', 'sendonly', and 'sendrecv' |
localVideo |
Video tag for the local stream | |
remoteVideo |
Video tag for the remote stream | |
videoStream |
MediaStream | Stream to be used as primary source (typically video and audio, or only video if combined with audioStream) for localVideo and to be added as stream to the RTCPeerConnection |
audioStream |
MediaStream | Stream to be used as second source (typically for audio) for localVideo and to be added as stream to the RTCPeerConnection |
- Source:
Methods
addIceCandidate(iceCandidate, callback)
Callback function invoked when an ICE candidate is received. Developers are
expected to invoke this function in order to complete the SDP negotiation.
Parameters:
| Name | Type | Description |
|---|---|---|
iceCandidate |
Literal object with the ICE candidate description | |
callback |
Called when the ICE candidate has been added. |
- Source:
dispose()
This method frees the resources used by WebRtcPeer.
- Source:
processAnswer(sdpAnswer, callback)
Callback function invoked when a SDP answer is received. Developers are
expected to invoke this function in order to complete the SDP negotiation.
Parameters:
| Name | Type | Description |
|---|---|---|
sdpAnswer |
Description of sdpAnswer | |
callback |
Invoked after the SDP answer is processed, or there is an error. |
- Source:
processOffer(sdpOffer, callback)
Callback function invoked when a SDP offer is received. Developers are
expected to invoke this function in order to complete the SDP negotiation.
Parameters:
| Name | Type | Description |
|---|---|---|
sdpOffer |
Description of sdpOffer | |
callback |
Called when the remote description has been set successfully. |
- Source:


Here is the content for the about us 1 tab.
Here is the content for the about us 2 tab.
Here is the content for the about us 3 tab.


---
layout: page
title: Outreach
use-site-title: true
show-avatar: true
---
ATLAS experiment underground Guide
Deep Underground Neutrino Experiment (DUNE)
Physics without Frontiers
Websites, articles, blogs
CineGlobe Festival - Volunteer
CERN Open Days 2019 - underground guide


Book Your Flight
Ticket Price
Your ticket price in USD($) is:
$0.00
Airlines We Support
Have a long Layover?
Visit our Airport Guide page to see all the wonderful resturants, entertainment, shopping, and lodging we offer!
Your ticket price in USD($) is:
$0.00
Visit our Airport Guide page to see all the wonderful resturants, entertainment, shopping, and lodging we offer!


All Tips by Title
Contribute to a GitHub Project
Cut, Copy and Paste to and from the Clipboard
Display an Alert asking for User Confirmation
Do Things with the File System
Establish Communication between a Window Controller and its View Controller
Format a Number as a String with Leading Zeros
A Framework is a Library packaged as a Bundle
Help Screens for your Mac Application
Make a Control the First Responder
Obtain Information About a File
Position One View within Another using Anchors
Prompt the User to Choose/Create Files and Directories
Represent your Custom Class Instance as a String
Show the User a Simple Text Field
Store and Retrieve User Preferences


No need to explicitly extend Object. Example:
public class Foo extends Object { // not required }
This rule is deprecated, use {rule:squid:S1939} instead.


ArcGIS Online (AGO) is pretty cool...
limited in data interactivity
Especially for us #geodevs
(Amy and John right now...)
The task at hand...
Sorry, surveyors
Send some surveyors out into the field to find some monuments...

AND get it onto the network before the next day...
The traditional surveyor method...
Write some of it in their Chartwell waterproof Survey book
Maybe fill out half the report sheet (and have it blow away)
Accidentally write down the wrong picture # for the wrong monuments
Get fed up with trying to sync the photos because it's been a long day in the field
Say 'screw it' and go home to have a beer
Load target monuments into ArcGIS Online
Have surveyors use Collector app with offline editing
On the commute back from the field, initiate sync with ArcGIS Online
Create FileGDB export from AGO and process the data
Pfffft.
Super vague overview
(Psst... Use the AGO Rest Endpoints!)
Come talk to me for more in depth overview
Wield Python like it's a web app!
Upload new locations to AGO via an internal web form
Download new features locally and update existing attributes
Download and insert attachments into GDB
Even grabs missing photos taken at a later date
Create PDF reports for survey deliverables
And the best part... it's AUTOMATED and runs within seconds
Secret sauce
Use custom GUIDs (text) for tracking
Python
import urllib
import json
from PIL import image
from PIL.ExifTags import TAGS
from base64 import decodestring


The 10 Most Expensive Cars in the World
The list of cars and figures mentioned below have been compiled from various sources around the web, such as Wikipedia, beautiful life and thewisdompost.
These are the 20 most expensive cars in the world:
- 10. McLaren P1 – $1.15 million
Kicking off our list of the 20 most expensive cars in the world is the McLaren P1.
Following the footsteps of the iconic McLaren F1, this limited edition hybrid supercar was released in October 2013 by British manufacturer McLaren Automotive.
Interestingly, 34% of all cars were purchased by owners in the United States, followed closely by 26% in Europe.
All 375 cars sold out within one month of release!
- 09. Ferrari LaFerrari – $1.4 million
The first Ferrari on our list is the Ferrari LaFerrari, or Ferrari “The Ferrari” after translation.
Obviously a powerful head turner, this limited production hybrid sports car was one of Ferrari’s most ambitious projects.
According to Ferrari, the goal with this car was to push all the pre-existing boundaries of technology in a road car.
It’s a stunna that’s for sure!
- 08. Zenvo TS1 GT — $1.9 million
Built by Danish Automotive, the Zenvo TS1 GT is a limited edition production sports car.
First unveiled at the 2016 Geneva Motor Show, the company only plan to release 5 cars per year to maintain exclusivity.
Sharing a similar body shape and chassis with its predecessor, the ST1, the Zenvo TS1 has an upgraded interior and a 5.8-litre twin-supercharged V8 engine.
- 07. Koenigsegg One – $2 million
Deemed as the “Worlds first Mega Car” by Koenigsegg themselves, the Koenigsegg One has a 5.0-litre V8 twin-turbo engine and generates 940 horsepower.
The car was introduced in 2014 and was one of the most exclusive production car programs ever envisaged in the car industry.
Another expensive sports car from Koenigsegg, but well worth its place in our list of most expensive cars in the world.
- 6. McLaren P1 LM – $3.6 million
The McLaren P1 LM is more or less a street legal version of the track-only McLaren P1 GTR. Lanzante, a British firm, bought the original P1 and converted it for sale.
Six LMs were made in total. Five were sold to private buyers and the sixth, codenamed ‘XP1 LM,’ the prototype P1 LM, is now being used for development and testing purposes.
The P1 LM features a larger twin-turbocharged V8 engine than the P1 and P1 GTR and reaches a limited top speed of 214 mph!
- 5. Lamborghini Veneno Roadster – $4.5 million
Lamborghinis poisonous Veneno starts the top five countdown.
Veneno means venom or poison in Spanish and the car certainly gives off a deadly presence.
Based on the Aventador, the Veneno was created to celebrate Lamborghini’s 50th anniversary and was introduced at the 2013 Geneva Motor Show.
It can reach 60 mph in 2.9 seconds and it’s price tag makes it one of the most expensive production cars in the world!
- 4. Koenigsegg CCXR Trevita – $4.8 million
Intended to be limited to only three units, the CCXR Trevita cost so much to manufacture, Koenigsegg decided to make the car even more exclusive and limit the number to just two.
Some of its features include a diamond weave carbon fibre finish, a unique double carbon rear wing, inconell exhaust system, carbon ceramic brakes with ABS and a tire monitoring system.
The car featured above is from Floyd Mayweather’s own personal collection.
It has a top speed of 254 mph!
- 3. Bugatti Divo – $5.8 million
The Bugatti Divo is a mid-engine sports car developed with a track-focused approach and manufactured by Bugatti Automobiles S.A.S.
It was named after French racing driver Albert Divo, who won the Targa Florio race twice in the 1920s for Bugatti.
According to Bugatti, the DIVO is the most agile and dynamic car they’ve ever created.
Limited to 40 units, the car was pre-sold before the public debut to Chiron owners through special invitation by the dealers. It sold out in its first day of availability.
Top speed – a reduced 236 mph!
- 2. Mercedes Benz Maybach Exelero – $8.0 million
In second place on our list of most expensive cars is the Maybach Exelero from Mercedes Benz.
Despite its peculiar looks, it’s one hell of a high-performance four-seater sports car with V12 twin-turbo engine.
It was commissioned by a German subsidiary of Goodyear, Fulda, to test their new Carat Exelero tire range.
The Exelero featured in one of Jay-Z’s music videos and was purchased by rapper Birdman according to Top Gear.
It has an impressive top speed of 213 mph.
- 1. Rolls Royce Sweptail – $13 Million
Dominating the top spot on our list of the most expensive cars is what can only be described as one jaw-droppingly stunning piece of handcrafted magic.
A powerhouse of automotive design and engineering, the Rolls-Royce Sweptail is a one-off luxury peace made in the United Kingdom by Rolls-Royce Motor Cars.
Commissioned in 2013 for a super-yacht and aircraft specialist, who’s identity Rolls-Royce does not divulge.
The Sweptail made its debut as the most expensive new car in the world at the yearly Concorso d’Eleganza Villa d’Este event in 2017.
It surpassed all its rivals and remains one of the most expensive cars ever!