|
Cheetah API
|
Functions | |
| def | make_executable (path) |
| def | swift_escape_string (s) |
| def | parse_timedelta_seconds (v) |
| def | copy_to_dir (source_file, dest_dir, follow_symlinks=True) |
| def | copy_to_path (source_file, dest_file, follow_symlinks=True) |
| def | is_executable (fpath) |
| def | copytree_to_dir (source_dir, dest_dir, follow_symlinks=True) |
| def | relative_or_absolute_path (prefix, path) |
| def | relative_or_absolute_path_list (prefix, path_list) |
| def | get_immediate_subdirs (dir_path) |
| def | dir_size (path) |
| def | get_file_size (dir_entry) |
| def | is_campaign_directory (path) |
| def | require_campaign_directory (path) |
| def | json_config_set_option (filename, key, value) |
| def codar.cheetah.helpers.copy_to_dir | ( | source_file, | |
| dest_dir, | |||
follow_symlinks = True |
|||
| ) |
Wrapper around copyfile with directory destination and more control over permissions.
Definition at line 80 of file helpers.py.
| def codar.cheetah.helpers.copy_to_path | ( | source_file, | |
| dest_file, | |||
follow_symlinks = True |
|||
| ) |
Wrapper around copyfile that respects umask and preserves executability.
Definition at line 94 of file helpers.py.
| def codar.cheetah.helpers.copytree_to_dir | ( | source_dir, | |
| dest_dir, | |||
follow_symlinks = True |
|||
| ) |
Custom version of copytree that does not preserve permissions, but does preserve executability. The goal is to respect the current umask but keep executable files executable.
Definition at line 112 of file helpers.py.
| def codar.cheetah.helpers.dir_size | ( | path | ) |
Get the size of the directory represented by path recursively. :param path: Path to the dir whose size needs to be calculated :return: size in bytes of the dir
Definition at line 151 of file helpers.py.
| def codar.cheetah.helpers.get_file_size | ( | dir_entry | ) |
Get size of the file or directory pointed to by path. Directory size is recursive; it includes sizes of enclosing files/dirs. :param dir_entry: path to the file or directory. Should not contain wildcards. Must be of type DirEntry. :return: size in bytes
Definition at line 170 of file helpers.py.
| def codar.cheetah.helpers.get_immediate_subdirs | ( | dir_path | ) |
Get a list of top-level subdirectories. :param dir_path: Directory path to search :return: list of subdirectory names
Definition at line 141 of file helpers.py.
| def codar.cheetah.helpers.is_campaign_directory | ( | path | ) |
Return True if the specified path exists, is a directory, and has a .campaign file to indicate it's a top level campaign directory.
Definition at line 186 of file helpers.py.
| def codar.cheetah.helpers.is_executable | ( | fpath | ) |
Definition at line 107 of file helpers.py.
| def codar.cheetah.helpers.json_config_set_option | ( | filename, | |
| key, | |||
| value | |||
| ) |
Definition at line 201 of file helpers.py.
| def codar.cheetah.helpers.make_executable | ( | path | ) |
Definition at line 14 of file helpers.py.
| def codar.cheetah.helpers.parse_timedelta_seconds | ( | v | ) |
Parse a time duration. Can be a number of seconds (integer only), a timedelta object, or a string in "HH:MM:SS" format. Returns the number of seconds in the duration as an int, safe for JSON serialization or passing to time.sleep. >>> parse_timedelta_seconds('15') 15 >>> parse_timedelta_seconds('01:15') 75 >>> parse_timedelta_seconds('10:00:05') 36005 >>> parse_timedelta_seconds(12345) 12345 >>> parse_timedelta_seconds(datetime.timedelta(days=1, seconds=7)) 86407 >>> parse_timedelta_seconds(1.1) Traceback (most recent call last): ... ValueError: Invalid duration (must be timedelta, int, or 'HH:MM:SS'): 1.1 >>> parse_timedelta_seconds("12:34:34bad") Traceback (most recent call last): ... ValueError: Invalid duration string, must be HH:MM:SS format
Definition at line 29 of file helpers.py.
| def codar.cheetah.helpers.relative_or_absolute_path | ( | prefix, | |
| path | |||
| ) |
If path is an absolute path, return as is, otherwise pre-pend prefix.
Definition at line 130 of file helpers.py.
| def codar.cheetah.helpers.relative_or_absolute_path_list | ( | prefix, | |
| path_list | |||
| ) |
Definition at line 137 of file helpers.py.
| def codar.cheetah.helpers.require_campaign_directory | ( | path | ) |
Raise CheetahException if the specified path is not a top-level campaign directory.
Definition at line 193 of file helpers.py.
| def codar.cheetah.helpers.swift_escape_string | ( | s | ) |
Escape backslashes and double quotes in string, so it can be embedded in a literal swift string when generatig swift source code.
Definition at line 19 of file helpers.py.


General
Alerts
Modals
Show Modal Success
Success, Account Created
Congratulation, Account @rezaSarifulFikri has been created, now you have access for all features.
Info, Data Permission
You not have permission for look this data. Please call Admin if this wrong!.
Danger, Are you sure?
This action can't canceled, this will permanently delete account @rezaSarifulFikri.
Enter password for confirm deletion Account!
Warning, Login Unrecognized
Your account login in new device: Linux, Firefox. Tell us if not you!.
Loadings
Fixed Loadings
Show Loading Default Fixed


Expert on MVP development, Lean Startup Principles
Web Dev since 2009
Ruby on Rails Web Development Bootcamp at The Starter League in 2012
iOS Bootcamp at Mobile Makers in 2014
CTO at ChangEd since 2017
Learn Craps for iOS


[Biography]-[Resume]-[Research
& Projects]-[Courses]-[Album]-[Links]-[Others]-[Contact]
Biography
Resume
N/A
Research and
Projects
Courses
- Fall, 2002
CS6250
Computer Networks
CS7001 Graduate Studies in Computing
CS8801 Special Topics -- Graduate Teaching Workshop
Album
Links
-
Alumni
Homepage
- Friends' Homepage
Others
- Programming Stuffs
- Essential C++
- Thinking in C++:
Vol. 2
- Thinking in Java
- Java in a Nutshell
- Current Reading Stuffs
- Unix Network
Programming
- TCP/IP Illustrated
- Internetworking
with TCP/IP
- Java/C++
Cross-Reference Handbook
- Computer Networks:
A System Approach
- Chinese Stuffs
Contact Information
Address: 325335 Georgia Tech
Station
Atlanta, GA 30332-1150
USA
Email:
<EMAIL_ADDRESS>[Biography]-[Resume]-[Research
& Projects]-[Courses]-[Album]-[Links]-[Others]-[Contact]
LAST
UPDATED: Aug 24, 2002


{% extends 'base.html' %} {% load staticfiles %}
Like Lion at SCH First Logo Image
{{ portfolio.description }}


transcription
reactions.TranscriptionData
object that contains additional information about the
TranscriptionReaction
.transcription
reaction.translation
reaction.TranslationData
object that contains additional information about the
TranslationReaction
.translation
reaction.PostTranslationReaction
,
may be null.TranslocationData
objects
in the PostTranslationReaction
, may be null.SubreactionData
of type
TranslocationData to the annotation of reactions.tRNAData
object that
contains additional information about the
tRNAChargingReaction
.generic
tRNA
.tRNA charging
reaction.


This is an HTML page served from a Deno web server.
This page was read by your Deno web server and sent to your browser. Your browser knows this is HTML rather than CSS or plain text because of the MIME type (Content-Type) header in your code!
The same concept applies to this image. The server sent over the raw packets of information (bytes) and your browser understood it was supposed to be a picture from the Content-Type.


@(user: String, reqFollowers: Int) @base { } {
Sorry @(user). To prevent misuse, girl restricts usage to GitHub users with over 50 followers or users and organizations on the whitelist. Please add your accounts and submit a pull request to gain access. Thanks!
girl is completely open source and you can alternatively run a local instance by following the instructions in the README.
}


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 1915 of 2014 Tapas Kumar Deb ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties. CORAM: THE HON'BLE MR JUSTICE P.P. BHATT -------- For the Petitioner : Mr. Ajay Kr. Sah, Adv. For the State : A.P.P. ......... 3/19.11.2014
: Put up this case on 3rd December, 2014, awaiting the service report.
Till the next date of listing, ad interim order granted earlier shall continue.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2526 of 2013 Guddu Tanti and Anr. ....Petitioners Versus The State of Jharkhand and Ors. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Subhash Chandra Prakash, Adv.
For the State : A.P.P.
For the Opp. Party Nos. 2 to 4: Mr. Ashish Jha, Advocate.
.........
7/19.11.2014: Learned counsel Mr. Ashish Jha submits that he has received instruction and filed Vakalatnama on behalf of Opp. Party Nos. 2 to 4 and his name is also appearing in the cause list.
Learned counsel for Opp. Party Nos. 2 to 4 prays for two weeks time to file counter affidavit, for which, the learned counsel for the petitioners has no objection.
In view of the above position, put up this case on 17th December, 2014.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2505 of 2013 Bam Shankar Pathak ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Pankaj Kumar, Advocate.
For the State : A.P.P. ......... 4/19.11.2014: In view of office report dated 18.11.2014, the service report
of ordinary service has not been received. So far as registered cover is concerned, the same has been returned undelivered, as the Opp. Party No. 2 is not working with Simdega Branch.
Learned counsel for the petitioner shall provide the present and correct address of Opp. Party No. 2 within a week and thereafter, fresh notice be served upon Opp. Party No. 2 at correct and present address.
Learned counsel for the petitioner submitted that the petitioner is a Bank employee and at present, he is posted in Bihar at Purniya Branch which is 500 K.M. away form the place, where the trial is pending. It is also submitted that as per the FIR, there is allegation for tampering and misappropriation of money and the said amount has been deposited before lodging of FIR.
In view of above submissions, put up this case on 7 th January, 2015.
Till the next date of listing, further proceeding in connection with Simdega P.S. Case no. 64/2011 (G.R. No. 173/2011), pending in the court of learned CJM, Simdega is stayed.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2020 of 2013 Toshif Azmi ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Nazia Rashid, Adv.
For the State : A.P.P. ......... 5/19.11.2014: As prayed, put up this case on 26.11.2014
In the meantime, let the Demand Draft be got renewed. Till the next date of listing, ad interim order granted earlier shall continue.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2017 of 2014 Hari Shankar Pathak ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Ashok Kumar Singh, Adv.
For the State : A.P.P. ......... 4/19.11.2014: Put up this case after one week, awaiting the service report.
Till the next date of listing, ad interim order granted earlier shall continue.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2744 of 2013 Amresh Kumar Dhiraj and Ors. ....Petitioners Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. A.K. Chaturvedy, Adv.
For the State : A.P.P. For the Opp. Party No. 2 : Mr. Nilesh Kumar, Advocate. ......... 5/19.11.2014: With consent of the parties, put up this case on 27.11.2014.
Till the next date of listing, ad interim order granted earlier shall continue.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 1472 of 2011 Sanjay Kumar Roy. ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : M/s. Ragini and Arun Kr. Dey , Advocates For the State : A.P.P. For the Opp. Party No. 2 : Mr. M.M. Sharma, Advocate. ......... 5/19.11.2014: Learned counsel, R. M.M. Sharma submitted that he has
received instruction and he will file Vakalatnaman on behalf of Opp. Party No. 2 in course of the day, thereafter, he will also file counter affidavit within two weeks, for which, the learned counsel for the petitioner has no objection.
In view of the above position, put up this case after two weeks.
Till the next date of listing, ad interim order granted earlier shall continue.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Tr. Petition (Cr.) No. 09 of 2014 Foolmani Devi. ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Ravi Prakash, Advocate.
For the State : A.P.P. ......... 6/19.11.2014: Defect as pointed out vide S.R. dated 15.4.2014 is ignored for the present.
The present petition has been filed under Section 407 Cr.P.C. praying therein for transfer of Matrimonial Title Suit No. 176 of 2013 filed under Sections 13(i)(ia)(ib) of the Hindu Marriage Act for divorce before the learned Principal Judge, Family Court, Hazaribagh to the court of learned Principal Judge, Family Court, Gumla, where the petitioner is residing.
Learned counsel for the petitioner submitted that the petitioner is residing about more than 200 K.M. from Hazaribagh, where the case is pending and she is facing great difficulties in attending the said case at Hazaribagh.
In view of the above position, let notice be issued upon Opp. Party No. 2, for which requisites etc. under ordinary process as well as registered cover with A/D must be filed on or before 21.11.1014.
Notice is made returnable on 22nd December, 2014. Till the next date of listing, further proceeding in connection with Matrimonial Title Suit No. 176/2013 pending in the court of learned Principal Judge, Family Court, Hazairbagh be stayed.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 242 of 2014 Ayub Raza ....Petitioner Versus The State of Jharkhand. ... Opposite Party.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Arshad Hussain, Advocate.
For the State : A.P.P.
2/19.11.2014: The present petition has been filed under Section 482 Cr.P.C. for quashing the entire criminal proceeding including the First Information Report being Karra P.S. Case No. 72/2013 (G.R. No. 495/2013) for the offence punishable under Sections 379 and 411 IPC, Section 4(i) of the Mines and Minerals (Regulation and Development) Act, 1957 and Section 21 of the Air (Prevention and Control of Pollution) Act, 1981, pending in the court of learned Judicial Magistrate, 1st Class, Khunti.
Heard the learned counsel for the petitioner as well as the learned A.P.P. appearing on behalf of the State and perusal the materials placed on record.
Learned counsel for the petitioner submitted that the Sub-Inspector of Police instituted the present FIR against the petitioner, who is not having the authority under law to institute such FIR for the alleged offence under Sections 379 and 411 IPC, Section 4(i) of the Mines and Minerals (Regulation and Development) Act, 1957 and Section 21 of the Air (Prevention and Control of Pollution) Act, 1981. It is further submitted that in view of Section 22 of the Mines and Minerals (Regulation and Development) Act, 1957, which specifically provides that no court shall take cognizance of any offence punishable under this Act or any rules made thereunder except upon complaint in writing made by a person authorised in this behalf by the Central Government or the State Government. In support of his submission, learned counsel for the petitioner also referred to and relied upon the judgment passed in 2009(2)JCR 509(Jhr.) and 2010(3) JCR 301(Jhr.).
Per contra, the learned APP appearing for the State prays some time to place the case law against the submission made by the learned counsel for the petitioner pertaining to question of law.
Put up this case tomorrow i.e. on 20.11.2014.
Anu/- (P.P.Bhatt, J.) IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr.M.P. No. 2802 of 2013 Baliram Prasad Gupta ....Petitioner Versus The State of Jharkhand and Anr. ... Opposite Parties.
CORAM: THE HON'BLE MR JUSTICE P.P. BHATT
--------
For the Petitioner : Mr. Devesh Krishna, Advocate.
For the State : A.P.P. ......... I.A. No. 3602 of 2014. 4/19.11.2014: The present interlocutory application has been filed for
seeking amendment in para 1 and prayer portion of the main petition.
Heard the learned counsel for the petitioner as well as the learned APP appearing for the State and perused the materials placed on record.
For the reasons stated in this application, supported by an affidavit, the same is allowed.
Let necessary amendment be carried out accordingly in course of the day.
I.A. (Cr.) No. 3602/2014 stands allowed and disposed of.
Cr.M.P. No. 2802 of 2013.
Put up this case tomorrow i.e. on 20.11.2014.
Anu/- (P.P. Bhatt, J.)


2 April 2003
Disease Outbreak Reported
As of 2 April 2003, the Ministry of Health, the Republic of the Congo has reported 135 cases, (13 laboratory-confirmed and 122 epidemiologically linked), including 120 deaths in the districts of Mbomo and Kellé in Cuvette Ouest Département ( see previous report). Thirty four contacts are being followed-up.
The Ministry of Health, WHO, the Red Cross and the international team continue to assist with social mobilization, surveillance and case management activities.


Test is sub menu of parent by position.
-----
get direct sub links.
regular menus
Menu with direct sub links...
menu with div as container
menu with div sibling sub menu.
menu with javascript mouseover submenu..
menu with div container.
Get menu under container
Get menu with related value
external or category links no menu
regular menu convert result


CrimPapers
Articles published on 27 August 2019
On 27 August 2019, 7 new articles were published in 6 journals.
Validation and Examination of the Ohio Youth Assessment System With Juvenile Sex Offenders by Jordan Papp,
christina A. Campbell,
william T. Miller
Executive Deviance As A Sociopolitical Force in Dismissals by Jeremy J. Foreman, Brian P. Soebbing, Chad S. Seifried
Global Street Code. A Cross-Cultural Perspective on Youth Violence by Sebastian Kurtenbach, Steffen Zdun, Simon Howell, Muhammad Zaman, Abdul Rauf
What May Be Learned About Crime in Europe (and Beyond) From International Surveys of Youth: Results From the International Self-Report Delinquency Study (isrd3)
Reading the Child Within: How Bibliotherapy Can Help the Victim of Child Sexual Abuse by Agnes Wohl, Gregory W. Kirschen
Who Errs? Algorithm Aversion, the Source of Judicial Error, and Public Support For Self-Help Behaviors by Leanna Ireland
Omitted Level Bias in Multilevel Research: An Empirical Test Distinguishing Block Group, Tract, and City Effects of Disadvantage on Crime by Marin R. Wenger


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import config.FrontendAppConfig @import uk.gov.hmrc.govukfrontend.views.html.components.{GovukHeader, GovukLayout} @import views.html.helper.CSPNonce @this( appConfig: FrontendAppConfig, govukLayout: GovukLayout, header: GovukHeader, hmrcHead: HmrcHead, hmrcStandardHeader: HmrcStandardHeader, hmrcStandardFooter: HmrcStandardFooter, hmrcScripts: HmrcScripts, hmrcReportTechnicalIssueHelper: HmrcReportTechnicalIssueHelper, hmrcTrackingConsentSnippet: HmrcTrackingConsentSnippet, hmrcTimeoutDialogHelper: HmrcTimeoutDialogHelper, hmrcLanguageSelectHelper: HmrcLanguageSelectHelper, govukBackLink : GovukBackLink ) @( title: String, beforeContentHtml: Option[Html] = None, hasTimeOut: Boolean = true, backLink: Option[String] = None )(mainContent: Html)(implicit request: Request[_], messages: Messages) @head = { @if(hasTimeOut && appConfig.enableRefresh) { @hmrcTimeoutDialogHelper( signOutUrl = controllers.routes.SessionController.onPageLoad.url, keepAliveUrl = Some(controllers.routes.SessionController.keepAlive.url), timeout = Some(appConfig.timeOutSeconds), countdown = Some(appConfig.timeOutCountDownSeconds), title = Some(messages("ctutr.timeoutDialog.title")), message = Some(messages("ctutr.timeoutDialog.p1")), keepAliveButtonText = Some(messages("ctutr.timeoutDialog.button")), signOutButtonText = Some(messages("ctutr.timeoutDialog.signOutButtonText")) ) } } @beforeContentWithLanguageToggle = {


--- description: templateLanguage: liquid templateEngineOverride: html orientation: vertical typing: - 68-91 --- {% layout "./layouts/liquid-layout.html" %} {% block content %}


These tutorials were originally developed for an undergraduate class in quantitative methods in the social sciences at Stanford.
basic syntax
reading data
loading & installing packages
basic data manipulation
more on data manipulation
graphing with ggplot
for loops
central limit theorem
more on for loops
graphing with ggplot
functions
coverage probability
exporting tables & graphs
hypothesis testing
merging & appending data
interpreting & graphing OLS models
analyzing (quasi-)experimental data
propensity score matching


Connecting to Device
Device is Ready
Click Start To Begin
On TaskOff Task
Subject Peer
On-Task
AET
PET
Off-Task
OTM
OTV
OTP
The SOTO (Student On-Task Observation) App helps you gather, analyze and document "on-task / off-task" observation data of your students.
Our goal is to provide a simple, intuitive app that makes behavioral observation fast and easy for everyone. We hope this app helps save you time and effort with accurate data collection and reporting.
Special credit and acknowledgement goes to Dr. Edward S. Shapiro, Ph.D. for his book Academic Skills Problems - Direct Assessment and Intervention, and the definitions of his interval codings for the Behavioral Observation of Students.
Current Version: 1.3.0
Email us at<EMAIL_ADDRESS>From the home page, click on the "Settings" button in the top right corner of the screen.
Interval Length - This setting represents how long each observation interval will last (in seconds). The default recommended length is 15 seconds.
Peer Interval - This setting is the interval factor for when you want to observe a peer, for comparing against your subject student. For example, if you enter 5, then every 5th interval will be a peer observation.
Default Email - This is the default email you want SOTO reports to be sent to. You are able to modify recipients before sending any report.
Vibrate New Intervals - Check this box if you want the SOTO to vibrate your device just before the start of a new interval
Click on this item to begin recording a new observation session. You are required to enter the student's name, the location of the observation and optionally, a description of the activity or setting being observed.
After entering this information, click on the "Next" button to continue.
The first two checkboxes record when you observe that the student is "On-Task". You should make this determination within the first few seconds of every interval.
If you observe that the student is "On-Task", then check whether the student is "Academically Engaged" or "Passively Engaged".
If you observe that the student is "Off-task", then do NOT select either of these two checkboxes. The interval will then be recorded as "off-task".
The last three checkboxes indicate any type of "Off-Task" observation throughout the duration of a given interval. If at any time during the interval, you observe the student being "Off-Task", then select all appropriate "Off-Task" types.
TIP: It is possible that in the beginning of the interval, you recorded that the student is "On-Task", but then later in the interval, you observe that the student was "Off-Task".
START - Simply click the start button when you're ready to begin your observations.
PAUSE - Click the pause button when for any reason you need to temporarily stop the observation. Click the "start" button again to resume your session.
END - When you are finished with your session, click the END button. This will save all of your recorded data.
This page will list all of your recorded observation sessions, in order by the date of each observation. Simply click on any observation listing, and this will take you to the Reports page.
When you view a report, there is a button near the top that will send the report and graphs via email.
TIP: You must have email configured on your mobile device in order to send out SOTO reports. SOTO Graphs are included as PNG image attachments, which you can then copy and use in your own report documentation.


Analyzing Marianne Moore's Poems
=======================================================================================================================
Project maintained by MehtA-Tutoring-DHMLBootcamp21
Hosted on GitHub Pages - Theme by mattgraham
Named Entity Recognition
Kabir Goel, Siddarth Kappa, Dylan Sheehan
Locating Geographical References in Poems Written by Marianne Moore
Analysis
Our NER reliant method required multiple stages:-
- First, we did some text preprocessing and turned the large pdfs of poems into text using Split PDF.
- We then worked to clear the errors caused by the pdf conversion software
- These errors primarily occured on page turns, line breaks, and dates
- Next we stripped all empty spaces and created a string of strings present in each list from the list of poems (yes.)
- This allows for spacy to be easily implemented.
- After creating the data table that Spacy will print onto, we are able to simply run the produced labeled entities through a filter so that geographical entities are exclusively defined.
- Ultimately creating a list of geographical entities in the poems.
Our Resources


Mumbai: 51-year-old man jumps off Dadar highrise
Hiren Dand lived with his wife and 20-year-old son on the 22nd floor of Spring Tower at GD Ambedkar Marg in Dadar, police said.
by Express News ServiceA 51-year-old man allegedly committed suicide by jumping off a high-rise building in Dadar, police said Friday. Hiren Dand lived with his wife and 20-year-old son on the 22nd floor of Spring Tower at GD Ambedkar Marg in Dadar, police said. He used to work as a share broker, but had quit following a mental illness. Dand was undergoing treatment for the past eight years, police added.
“He would often tell his wife that he would do something to himself. On Friday, he complained of illness. While his family members were doing their daily chores, he jumped off the building at 8.30 am,” a police officer said.
Dand was rushed to KEM hospital, where he was declared dead before admission. “We have lodged a case of accidental death,” said an officer from RAK Marg police station.


Documents will be added soon.
This project is a part of
MILJS
project.
Machine Intelligence Laboratory, The University of Tokyo


Activities Location Distance @for(i <- 0 until activities.size) { @activities(i).location @activities(i).distance }


{{profile.followers}} followers following {{profile.following}} {{profile.public_gists}} public gists {{profile.public_repos}} repos view more detail on gitHub


WRFLgroove is a web application that allows users to access the music of the University of Kentucky's radio station (WRFL) at any time. Each DJ has their own page on WRFLgroove, and any track they play that is available on Grooveshark is able to be reached there.
Once an hour, on the hour, WRFLgroove scrapes the WRFL playlist page and returns a list of recently played songs. Each list contains the time each song was played, as well as the artist, album, and song name as well as the DJ who played it. After a bit of housekeeping with the formatting, each of these lists is inserted as a row into the database. Then, using the Tinysong API, Grooveshark links to all available songs are produced.
One reason is that WRFL's stance on playing only alternative music necessarily limits the percentage of their songs that are available from streaming music services. This is one important reason that WRFLgroove is not a substitute for tuning in to WRFL, but merely a supplement to help listeners find music they would have otherwise missed.
In addition, the songs available on WRFLgroove only include those played since March 12, 2013, when the site first reached a workable form. Since I am limited to 32 Tinysong API requests each hour, I won't be able to add older songs from WRFL's substantial archives.
Here are some things still in the works for WRFLgroove:
This website and its source code are free to use for any purpose. The best way to support WRFLgroove is to support WRFL! It's been running non-stop for 25 years, and you can tune in any time at 88.1 FM if you're local, or drop in on their live stream.
For questions, bug reports, or feature requests, you may email me at nathan.andrew.carter@gmail.com.


The @keyframes Rule
Note:
The @keyframes rule is not supported in Internet Explorer 9 and earlier versions.


Once we start using random variables as estimators, we will want to see how far the estimate is from a desired value. For example, we might want to see how far a random variable $X$ is from the number 10. That's a function of $X$. Let's call it $Y$. Then
$$ Y = |X - 10| $$which is not a linear function. To find $E(Y)$, we need a bit more technique than we currently have. Throughout, we will assume that all the expectations that we are discussing are well defined.
This section is about finding the expectation of a function of a random variable whose distribution you know.
First, let's note that we do know how to do this for linear functions. In what follows, let $X$ be a random variable whose distribution (and hence also expectation) are known.
Let $Y = aX + b$ for some constants $a$ and $b$. In an earlier section we showed that
$$ E(Y) = aE(X) + b $$This includes the case where $a=0$ and thus $Y$ is just the constant $b$ and thus has expectation $b$.
Now let $Y = g(X)$ where $g$ is any numerical function. Remember that $X$ is a function on $\Omega$. So the function that defines the random variable $Y$ is a composition:
$$ Y(\omega) = (g \circ X) (\omega) ~~~~ \omega \in \Omega $$This allows us to write $E(Y)$ in two equivalent ways:
As before, it is a straightforward matter of grouping to show that the two forms are equivalent.
For computation, the second form is the one to use. It says that to find $E(Y)$ where $Y = g(X)$ for some function $g$:
The crucial thing to note about this method is that we didn't have to first find the distribution of $Y$. That saves us a lot of work. Let's see how our method works in some examples.
Let $X$ have a distribution we worked with earlier:
x = np.arange(1, 6)
probs = make_array(0.15, 0.25, 0.3, 0.2, 0.1)
dist = Table().values(x).probability(probs)
dist = dist.relabel('Value', 'x').relabel('Probability', 'P(X=x)')
dist
Let $g$ be the function defined by $g(x) = |x-3|$, and let $Y = g(X)$. In other words, $Y = |X - 3|$.
To calculate $E(Y)$, we first have to create a column that transforms the values of $X$ into values of $Y$:
dist_with_Y = Table().with_columns(
'x', dist.column('x'),
'g(x)', np.abs(dist.column('x')-3),
'P(X=x)', dist.column('P(X=x)')
)
dist_with_Y
To get $E(Y)$, find the appropriate weighed average: multiply the g(x)
and P(X=x)
columns, and add. The calculation shows that $E(Y) = 0.95$.
ev_Y = sum(dist_with_Y.column('g(x)')*dist_with_Y.column('P(X=x)'))
ev_Y
Let $X$ be as above, but now let $Y = \min(X, 3)$. We want $E(Y)$. What we know is the distribution of $X$:
dist
To find $E(Y)$ we can just go row by row and replace the value of $x$ by the value of $\min(x, 3)$, and then find the weighted average:
ev_Y = 1*0.15 + 2*0.25 + 3*0.3 + 3*0.2 + 3*0.1
ev_Y
Let $X$ have the Poisson $(\mu)$ distribution. You will see in the next chapter that it will be useful to know the value of $E(X^2)$. By our non-linear function rule,
$$ E(X^2) = \sum_{k=0}^\infty k^2 e^{\mu} \frac{\mu^k}{k!} $$This sum turns out to be hard to simplify. The term for $k=0$ is 0. In each term for $k \ge 1$, one of the $k$'s in the numerator cancels a $k$ in the denominator but the other factor of $k$ in the numerator remains. It would be so nice if that factor $k$ were $k-1$ instead, so it could cancel $k-1$ in the denominator.
This motivates the following calculation. No matter what $X$ is, if we know $E(X)$ and can find $E(X(X-1))$, then we can use additivity to find $E(X^2)$ as follows:
$$ E(X(X-1)) = E(X^2 - X) = E(X^2) - E(X) $$so $$ E(X^2) = E(X(X-1)) + E(X) $$
Let's see if we can find $E(X(X-1))$ by applying the non-linear function rule.
\begin{align*} E(X(X-1)) &= \sum_{k=0}^\infty k(k-1) e^{-\mu} \frac{\mu^k}{k!} \\ \\ &= e^{-\mu} \mu^2 \sum_{k=2}^\infty \frac{\mu^{k-2}}{(k-2)!} \\ \\ &= e^{-\mu}\mu^2 e^\mu \\ \\ &= \mu^2 \end{align*}Now $E(X) = \mu$ as we have shown in an earlier section, so
$$ E(X^2) = \mu^2 + \mu $$In the next chapter you will see why this is useful. For now, see if you can find $E(X(X-1)(X-2))$ and hence $E(X^3)$.


--- layout: guide ---
| Cockpit Guide |
|---|
While cockpit allows you to monitor and administer several servers at the same time, there is always a primary server your browser connects to that runs the Cockpit web service (cockpit-ws) through which connections to additional servers are established. See this diagram for how it works.
Normally, a session is established on the primary server, and you use the Shell UI of that session to connect to secondary servers.
However, it is also possible to instruct the
cockpit-ws
process on the primary server to
directly connect to a secondary server, without opening a
session on the primary server at all. This is done on the main
login page of Cockpit, by filling out the "Connect to"
field.
The most common way to use Cockpit is to just log directly into the server that you want to access. This can be done if you have direct network access to port 9090 on that server.
By default the cockpit web service is installed on the base system and
socket activated by systemd. In this setup
access is controlled by a cockpit specific pam stack, generally located
at /etc/pam.d/cockpit
. By default this is configured
to allow you to login with the username and password of any local account on the
system. You can also setup a Kerberos based SSO
solution or certificate/smart
card authentication.
You can also disable authentication schemes to enforce authentication policies, or to suppress undesired browser GSSAPI authentication dialogs.
The web server can also be run from the
cockpit/ws
container. If you are running cockpit on a container host operating system like
Fedora CoreOS
this will be the only supported mode. In this setup, cockpit establishes an
SSH connection from the container to the underlying host, meaning that it is up to
your SSH server to grant access. To login with a local account, sshd
will need to be configured to allow password based authentication.
Alternatively you can setup a Kerberos based SSO
solution.
Like sshd
, cockpit can be configured to limit the number
of concurrent login attempts allowed. This is done by adding a MaxStartups
option to the WebService
section of your cockpit.conf
.
Additional connections will be dropped until authentication succeeds or
the connections are closed.
Once you have a session on the primary server you will be able to connect to additional servers by using the host switching UI of the Cockpit Shell. This is useful if you have direct network access to the primary server, but not to the secondary server.
On the command line, you would log into the primary server
and then use SSH to log into the secondary one. Cockpit does just
the same, and uses SSH to log into the secondary server. Instead
of running a interactive shell there, however, it starts a
cockpit-bridge
process.
Thus, these servers will need to be running an SSH server on port 22 and be configured to support one of the following authentication methods.
The target server will need to be a member of the same domain as the primary server and your domain must be whitelisted in your browser. See the SSO documentation for how to set this up.
When you successfully log into the primary server, a
ssh-agent
is started and keys are loaded into
it by running ssh-add
without any arguments.
Any passphrase prompt is answered with the password used to log
into the primary server.
Cockpit provides a user interface for loading other keys into the agent that could not be automatically loaded.
The target server will need to have public key
authentication enabled in sshd
, and the
public key you wish to use must be present in
~/.ssh/authorized_keys
. Cockpit has a user
interface for creating SSH keys and for authorizing them.
It is also possible to log into a secondary server without opening a session on the primary server. This is useful if you are not actually interested in the primary server and would only use it because you do not have direct network access to the secondary server.
In this case, cockpit-ws
still runs on
the primary server, but the credentials from the login screen are
directly used with SSH to log into the secondary server given in
the "Connect To" field of the login screen.
Thus, the PAM configuration and accounts on the primary server don't matter at all. Often, the only purpose of the primary server is to sit on the boundary of your network and forward connections to internal machines.
In this case, the login page will prompt you to verify unknown SSH keys. Accepted keys will be remembered in the local storage of your browser.


--- layout: default map: true title: Netafilter Map description: Explore candidate information on interactive maps ---
Netafilter has been built on top of MyNeta's database which contains data of the educational qualifications, net assests owned and criminal cases, as declared by the Lok Sabha members of the 16th Lok Sabha.
Hover over a constituency to view information about the MP of that constituency in the tooltip on bottom-right. Larger circles represent a larger value of each field of data.
You are empowered to copy, share and improve this project for a better tomorrow Contribute & Provide Feedback


This SRFI is currently in ``draft'' status.
To see an explanation of
each status that a SRFI can hold, see here.
To provide input on this SRFI, please
mail to
<srfi minus 113 at srfi dot schemers dot org>
. See
instructions here to
subscribe to the list. You can access previous messages via
the archive of the mailing list.
Sets and bags (also known as multisets) are unordered collections that can contain any Scheme object. Sets enforce the constraint that no two elements can be the same in the sense of the set's associated equality predicate; bags do not. Integer sets are a variant of sets that can only contain non-negative exact integers that are less than a maximum value specified when the integer set is created, and that always use numerical equality as their equality predicate.
16. What provisions should we have for controlling which element of a set is preserved when a new element equal to an existing element is added?
Sets are a standard part of the libraries of many high-level programming languages, including Smalltalk, Java, and C++. Racket provides general sets similar to those of this proposal, though with fewer procedures, and there is a Chicken egg called sets
(unfortunately undocumented), which provides a minimal set of procedures.
Bags are useful for counting anything from a fixed set of possibilities, e.g. the number of each type of error in a log file or the number of uses of each word in a lexicon drawn from a body of documents. Although other data structures can serve the same purpose, using bags clearly expresses the programmer's intent and can be optimized.
Although sets subsume integer sets, providing them separately allows for increased implementation efficiency. There are two Chicken eggs that provide integer sets: iset
, which is conceptually similar to the integer sets described here, but using bignums rather than bytevectors; and cis
, which uses lists of integer intervals.
Insofar as possible, the names in this SRFI are harmonized with the names used for ordered collections (lists, strings, vectors, and bytevectors) in Scheme. However, size
is used instead of length
to express the number of elements in the collection, because length
implies order.
Although it's possible to use the general sets of this SRFI to contain characters, the use of SRFI 14 is recommended instead. The names in this SRFI are harmonized with SRFI 14, except that SRFI 14 does not contain analogues of the set>>?
, set<=?
, set>=?
, set-remove
, or set-partition
procedures.
Sets do not have a lexical syntax representation. It's possible to use SRFI 108 quasi-literal constructors to create them in code, but this SRFI does not standardize how that is done.
The interface to general sets and bags depends on SRFI 114 comparators, despite that SRFI having a higher number than this one (for hysterical raisins). Comparators conveniently package the equality predicate of the set with the hash function or comparison procedure needed to implement the set efficiently.
During the discussion of this SRFI, a new expression type enumeration-case
similar to case
was proposed. It would dispatch based on a member of an enumeration set, with enumeration-specific error checking? Specifically, an error would be signaled if the cases are not exhaustive, or if any clause datum is not a member of the enumeration set. Unfortunately, due to phasing problems, enumeration-case
would only work with enumerations defined using define-enum
, and it would be awkward to implement it with syntax-rules
only. Therefore, it was not included.
Sets, bags, and integer sets are mutually disjoint, and disjoint from other types of Scheme objects.
It is an error for any procedure defined in this SRFI to be invoked on sets or bags with different comparators.
The procedures of this SRFI, by default, are "pure functional" — they do not alter their parameters. However, this SRFI defines a set of "linear-update" procedures, all of whose names end in !
. They have hybrid pure-functional/side-effecting semantics: they are allowed, but not required, to side-effect one of their parameters in order to construct their result. An implementation may legally implement these procedures as pure, side-effect-free functions, or it may implement them using side effects, depending upon the details of what is the most efficient or simple to implement in terms of the underlying representation.
It is an error to rely upon these procedures working by side effect. For example, this is not guaranteed to work:
(let* ((set1 (set 'a 'b 'c)) ; set1 = {a,b,c}. (set2 (set-adjoin! 'd))) ; Add d to {a,b,c}. set1) ; Could be either {a,b,c} or {a,b,c,d}.
However, this is well-defined:
(let ((set1 (set 'a 'b 'c))) (set-adjoin! set1 'd)) ; Add d to {a,b,c}.
So clients of these procedures write in a functional style, but must additionally be sure that, when the procedure is called, there are no other live pointers to the potentially-modified character set (hence the term "linear update").
There are two benefits to this convention:
Implementations are free to provide the most efficient possible implementation, either functional or side-effecting.
Programmers may nonetheless continue to assume that sets are purely functional data structures: they may be reliably shared without needing to be copied, uniquified, and so forth.
In practice, these procedures are most useful for efficiently constructing sets in a side-effecting manner, in some limited local context, before passing the character set outside the local construction scope to be used in a functional manner.
Scheme provides no assistance in checking the linearity of the potentially side-effected parameters passed to these functions — there's no linear type checker or run-time mechanism for detecting violations.
Note that if the implementation is entirely pure functional, it is allowed to return existing sets rather than newly allocated ones, even where this SRFI explicitly says otherwise.
Constructors: set
, set-adjoin
, set-delete
, set-unfold
Predicates: set?
, set-contains?
, set-empty?
, set-disjoint?
Accessor: set-value
Linear update procedures: set-adjoin!
, set-delete!
, set-intern!
The whole set: set-size
, set-find
, set-count
, hash-table-any?
, hash-table-every?
Mapping and folding: set-map
, set-for-each
, set-fold
, hash-table-filter
, hash-table-filter!
, hash-table-remove
, hash-table-partition
Copying and conversion: set-copy
, set-empty-copy
, set->list
, list->set
, list->set!
Subsets: hash-table=?
, hash-table<?
, hash-table>?
, hash-table<=?
, hash-table>=?
Set operations: hash-table-union!
, hash-table-intersection!
, hash-table-difference!
Additional bag procedures: bag-element-count
, bag-for-each-unique
, bag-fold-unique
, bag-increment!
, bag-decrement!
, bag->set
, set->bag
, set->bag!
Additional integer set procedures: integer-set
, make-universal-integer-set
, integer-set-complement
, integer-set-complement!
, integer-set-min
, integer-set-max
(set
comparator element ... )
Returns a newly allocated empty set. The comparator argument is a SRFI 114 comparator. The elements are used to initialize the set.
(set-adjoin
set
element ... )
Returns a newly allocated set that uses the same comparator as set and contains all the values of set, and in addition each element unless it is already the same (in the sense of set's equality predicate) as an existing member. It is an error to add an element to set that does not return #t
when passed to the type test procedure of the comparator with which set was defined.
(set-delete
set
element ... )
Returns a newly allocated set containing all the values of set except for the elements. Any element that is not a member of the set is ignored.
(set-unfold
comparator continue? mapper successor seed)
Create a newly allocated set as if by set
using comparator. If the result of applying the predicate continue? to seed is #f
, return the set. Otherwise, apply the procedure mapper to seed. The value that mapper returns is added to the set. Then get a new seed by applying the procedure successor to seed, and repeat this algorithm.
(set?
obj)
Returns #t
if obj is a set, and #f
otherwise.
(set-member?
set
element)
Returns #t
if element is a member of set and #f
otherwise.
(set-empty?
set)
Returns #t
if set has no elements and #f
otherwise.
(set-disjoint?
set1 set2)
Returns #t
if set1 and set2 have no elements in common and #f
otherwise.
(set-value
set
element)
Returns the element of set that is equal, in the sense of set's equality predicate, to element. If element is not a member of set, it is returned.
(set-adjoin!
set
element)
Returns a set that uses the same comparator as set and contains all the values of set, and in addition each element unless it is already a member. It is an error to add an element to set that does not return #t
when passed to the type test procedure of the comparator with which set was defined.
(set-delete!
set
element)
Returns a set containing all the values of set except for the elements. Any element that is not equal (in the sense ofset's equality predicate) to some member of the set is ignored.
(set-intern!
set
element)
Returns two values. If there is an element of set that is equal, in the sense of set's equality predicate, to element, then that element is returned as the first value and set is returned as the second value. If there is no such element, then the first value is element and the second value is the result of (set-add!
set element)
.
(set-search!
set element failure success)
The set is searched for element. If it is not found, then the failure procedure is tail-called with two continuation arguments, insert and ignore, and is expected to tail-call one of them. If element is found, then the success procedure is tail-called with the matching element of set and two continuations, update and remove, and is expected to tail-call one of them.
The effects of the continuations are as follows (where obj is any Scheme object):
Invoking (
insert obj)
causes element to be inserted into set.
Invoking (
ignore obj)
causes set to remain unchanged.
Invoking (
update new-element obj)
causes new-element to be inserted into set.
Invoking (
remove obj)
causes the matching element of set to be removed from it.
In all cases, two values are returned: the possibly updated set and obj.
(set-size
set)
Returns the number of elements in set as an exact integer.
(set-count
predicate
set)
Returns the number of elements of set that satisfy predicate as an exact integer.
(set-find
predicate set failure)
Returns an arbitrarily chosen element of set that satisfies predicate, or the result of invoking failure with no arguments if there is none.
(set-any?
predicate
set)
Returns #t
if any element of set satisfies predicate, or #f
otherwise. Note that this differs from the SRFI 1 analogue because it does not return a useful value.
(set-every?
predicate
set)
Returns #t
if every element of set satisfies predicate, or #f
otherwise. Note that this differs from the SRFI 1 analogue because it does not return a useful value.
(set-map
comparator
proc
set)
Applies proc to each element of set in arbitrary order and returns a newly allocated set, created as if by set
, which contains the results of the applications. For example:
(set-map string-ci=? symbol->string (set eq? 'foo 'bar 'baz)) => (set string-ci=? "foo" "bar" "baz")
(set-for-each
proc
set)
Applies proc to set in arbitrary order, discarding the returned values. Returns an unspecified result.
(set-fold
proc
nil
set)
Invokes proc on each member of set in arbitrary order, passing the result of the previous invocation as a second argument. For the first invocation, nil is used as the second argument. Returns the result of the last invocation.
(set-filter
predicate
set)
Returns a newly allocated set, created as if by set-empty-copy
, containing just the elements of set that satisfy predicate.
(set-filter!
predicate
set)
A linear update procedure that returns a set containing just the elements of set that satisfy predicate.
(set-remove
predicate
set)
Returns a newly allocated set, created as if by set-empty-copy
, containing just the elements of set that do not satisfy predicate.
(set-partition
predicate
set)
Returns two values: a newly allocated set, created as if by set-empty-copy
, containing just the elements of set that satisfy predicate, and another newly allocated set, created as if by set-empty-copy
, containing just the elements of set that do not satisfy predicate.
(set-copy
set)
Returns a newly allocated set containing the elements of set, and using the same comparator.
(set-empty-copy
set)
Returns a newly allocated set containing no elements, and using the same comparator as set.
(set->list
set)
Returns a newly allocated list containing the members of set in unspecified order. However, repeated calls to this procedure will return a list in the same order until the set is mutated.
(list->set
comparator list)
Returns a newly allocated set, created as if by set
using comparator, that contains the elements of list.
(list->set!
comparator list)
Returns a set using comparator that contains the elements of list.
(set=?
set ...)
Returns #t
if each set contains the same elements.
(set<?
set ...)
Returns #t
if each set other than the last is a proper subset of the following set, and #f
otherwise.
(set>?
set ...)
Returns #t
if each set other than the last is a proper superset of the following set, and #f
otherwise.
(set<=?
set ...)
Returns #t
if each set other than the last is a subset of the following set, and #f
otherwise.
(set>=?
set ...)
Returns #t
if each set other than the last is a superset of the following set, and #f
otherwise.
(set-union
set1
set2 ...)
(set-intersection
set1
set2 ...)
(set-difference
set1
set2 ...)
(set-xor
set1
set2)
Returns a newly allocated set that is the union, intersection, asymmetric difference, or symmetric difference of the sets. Asymmetric difference is extended to more than two sets by taking the difference between the first set and the union of the others. Symmetric difference is not extended beyond two sets. Elements in the result set are drawn from the first set in which they appear.
(set-union!
set1
set2 ...)
(set-intersection!
set1
set2 ...)
(set-difference!
set1
set2 ...)
(set-xor!
set1
set2)
Linear update procedures returning a set that is the union, intersection, asymmetric difference, or symmetric difference of the sets. Asymmetric difference is extended to more than two sets by taking the difference between the first set and the union of the others. Symmetric difference is not extended beyond two sets. Elements in the result set are drawn from the first set in which they appear.
Bags are like sets, but can contain the same object more than once. However, if two elements that are the same in the sense of the equality predicate, but not in the sense of eqv?
, are both included, it is not guaranteed that they will remain distinct when retrieved from the bag. It is an error for a single procedure to be invoked on bags with different comparators.
The procedures for creating and manipulating bags are the same as those for sets, except that set
is replaced by bag
in their names, and that adding an element to a bag is effective even if the bag already contains the element. If two elements in a bag are the same in the sense of the equality predicate, the implementation may in fact store just one of them. There are no procedures named bag-xor
or bag-xor!
.
(bag-element-count
bag
element)
Returns an exact integer representing the number of times that element appears in bag.
(bag-for-each-unique
proc
bag)
Applies proc to each unique element of bag in arbitrary order, passing the element and the number of times it occurs in bag, and discarding the returned values. Returns an unspecified result.
(bag-fold-unique
proc
nil
bag)
Invokes proc on each unique element of bag in arbitrary order, passing the number of occurrences as a second argument and the result of the previous invocation as a third argument. For the first invocation, nil is used as the third argument. Returns the result of the last invocation.
(bag-increment!
bag
element
count)
(bag-decrement!
bag
element
count)
Linear update procedures that return a bag with the same elements as bag, but with the element count of element in bag increased or decreased by the exact integer count (but not less than zero).
(bag->set
bag)
(set->bag
set)
The bag->set
procedure returns a newly allocated set containing the unique elements of bag. The set->bag
procedure returns a newly allocated bag containing the elements of set. The comparator of the result is the same as the comparator of the argument.
The elements of an integer set are non-negative exact integers less than the set's limit, which is specified when it is created. Except as noted below, the procedures for creating and manipulating integer sets are the same as those for sets, except that set
is replaced by integer-set
in their names.
Wherever a newly allocated integer set is returned, it has the same limit as the source sets. It is an error for a single procedure to be invoked on integer sets with different limits.
There are no integer-set-value
or integer-set-intern!
procedures.
(integer-set
limit element ...)
Returns a newly allocated integer set. The possible elements of the set are the exact integers from 0 to limit - 1, where limit is an exact non-negative integer. The set contains the elements.
(universal-integer-set
limit)
Returns a newly allocated integer set. The possible elements of the set are the exact integers from 0 to limit - 1, where limit is an exact non-negative integer. The set contains all possible elements.
(range->-integer-set
limit low high)
Returns a newly allocated integer set. The possible elements of the set are the exact integers from 0 to limit - 1, where limit is an exact non-negative integer. The set contains the elements from low (inclusive) to high (exclusive).
(integer-set-adjoin-range
integer-set low high)
Returns a newly allocated integer set with the same limit as integer-set and that contains all its values, and in addition each integer from low (inclusive) to high (exclusive) unless it is already equal to an existing member.
(integer-set-adjoin-range!
integer-set low high)
A linear update procedure that returns an integer set with the same limit as integer-set and that contains all its values, and in addition each integer from low (inclusive) to high (exclusive) unless it is already equal to an existing member.
(integer-set-complement
integer-set)
Returns a newly allocated integer set that is the complement of integer-set.
(integer-set-complement!
integer-set)
A linear update procedure that returns a set that is the complement of integer-set.
(integer-set-min
integer-set)
(integer-set-max
integer-set)
Returns the smallest or largest integer in integer-set, or #f
if there is none.
(integer-set-delete-min!
integer-set)
(integer-set-delete-max!
integer-set)
Linear update procedures that return two values: the smallest or largest integer in integer-set or #f
if there is none, and a set which contains all the elements of set except the integer being returned.
The implementation places the identifiers defined above into the sets
library.
Sets and bags are implemented as a thin veneer over hashtables, and integer sets over bytevectors. For clarity, the integer set implementation stores just one value into each bytevector element rather than the eight that would be possible.
The sample implementation contains the following files:
sets-impl.scm
– implementation of general setsbags-impl.scm
– implementation of bagsisets-impl.scm
– implementation of integer setscount.scm
– provides macros for conveniently looping over bytevectorssrfi-4-shim.scm
– minimal implementation of R7RS bytevectors on top of SRFI 4's u8vectorssets.sld
– an R7RS library named (sets)
sets.scm
– a Chicken librarysets-test.scm
– test suiteThe test suite will work with the Chicken test
egg, which is provided on Chibi as the (chibi test)
library.
Copyright (C) John Cowan 2013. All Rights Reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


Read Genesis 27:18-29 to see how Rebekah’s plan of deceit unfolded.
Clearly Isaac was unsure that this was really his son Esau. What questions and “tests” did he use to settle his uncertainty (vv. 20-22)? What finally convinced him (v. 23)?
What hopes for his son did Isaac convey in his blessing (vv. 28-29)?
Favoritism is the notion that in order to give a fuller measure of love to one person, we must neglect or deprive another. Judging from their actions, both Rebekah and Isaac believed this to be true, and they could not have been more wrong.
Of all the commodities that families provide one another—shelter, food, quality time, love—love is the one resource that isn’t ever limited or scarce. When we share love, affection, and approval with another person, our storehouse is not depleted but multiplied.
Families are sometimes programmed to act with a sense of scarcity, as if we have to choose who receives love and praise and blessing because they are in short supply. Our lack of contentment is often rooted in the feeling that we weren’t given enough by our families of origin—enough love, praise, or attention.
The heart-wrenching final scene in this story is a picture of a son begging for approval and blessing, while a father believes there’s no more to offer because he has already given it all away to the wrong son. Scarcity is the controlling idea on his side of the parenting equation, as well as his wife’s.
Read Genesis 27:30-40. How would you describe the emotions expressed in this scene?
How does Esau’s blessing compare to Jacob’s (vv. 39-40)?
The good news is that God never operates according to the principle of scarcity. He is never limited in how many prayers He can answer or how much love He can pour out. Just because God loves and blesses one of His children doesn’t mean He can’t love and bless all the others. In fact, He knows specifically how


STEP 2: Authorise payment
Payment authorisation for user with no SCA methods
5. Continue payment authorisation with call to
PUT endpoint
6. Enter payment id in the field in the field
7. Fill the header fields with the following values:
Put in YOUR_USER_LOGIN the name of the user you chose (you can view users and their information in TPP-UI).
8. Insert into request body the following json:
{{ jsonData1 | json }}
Put in YOUR_USER_PASSWORD the password of the user you chose (you can view users and their information in TPP-UI).
9. Execute endpoint and get
5. Continue payment authorisation with call to
PUT endpoint
6. Enter payment id in the field in the field
7. Fill the header fields with the following values:
Put in YOUR_USER_LOGIN the name of the user you chose (you can view users and their information in TPP-UI).
8. Insert into request body the following json:
{{ jsonData1 | json }}
Put in YOUR_USER_PASSWORD the password of the user you chose (you can view users and their information in TPP-UI).
9. Execute endpoint and get
10. Execute this PUT endpoint again, but this time update request body: fill it with the following json:
{{ jsonData2 | json }}
User has only one SCA method, so test TAN
5. Continue payment authorisation with call to
PUT endpoint
6. Enter payment id in the field in the field
7. Fill the header fields with the following values:
Put in YOUR_USER_LOGIN the name of the user you chose (you can view users and their information in TPP-UI).
8. Insert into request body the following json:
{{ jsonData1 | json }}
Put in YOUR_USER_PASSWORD the password of the user you chose (you can view users and their information in TPP-UI).
9. Execute endpoint and get
10. Execute this PUT endpoint again, but this time update request body: fill it with the following json:
{{ jsonData3 | json }}
Put in placeholder
"YOUR_AUTHENTICATION_METHOD_ID" any
value of authenticationMethodId of your choice. The response should be
200 and
11. Execute this PUT endpoint again, update request body: fill it with the following json:
{{ jsonData2 | json }}
SCA method was chosen, so test TAN
The response should be 200 and


{% extends "layout.html" %} {% block body %}
Enter a name, a company or a position and let us show you how to get there


Test URLs to see if they respond and if the response has the correct data. Built with Spring Boot and React in order to test the feasibility of that combo.
This is a hobby project that I created on my own. The basic idea is to ping a URL and see if it
You're able to add single URLs and export/import them in bulk. The app also supports auto-refresh every minute.
Download a release from the releases page.
Run from the command line:
java -jar url-monitor-VERSION.jar
This will start an embedded Tomcat server inside the war file. Then navigate to the local server http://localhost:8080 or the remote server where you started the app http://yourserverhere:8080
You can find more info on the GitHub repo or by emailing derrek @ derrek.young.com
https://github.com/derrekyoung/url-monitor-react-springboot/
Actually though, my main motivation for this project was mostly wanted to experiment with merging React and Spring Boot into a self-contained, cross-platform application. This app uses Spring Boot, Webpack, Node, React, Bootstrap, and a few other modules.
The experiment was mostly a success but I think this combo is not the way to go for cross-platform apps. Server-side web apps, sure, ok, maybe. But the dev process here kind of sucks. Merging webpack with Spring Boot introduced too much latency in the test cycle compared to a straight Node.js cycle. This combo takes all the good things of React/Node and ruins them. I think that my next cross-platform app/experiment will be pure Node.js and based on Electron or NW.js. We shall see.


| Constellation Action | Keyboard Shortcut | User Action | Menu Icon |
|---|---|---|---|
| Run Expand Graph | Arrange -> Expand Graph |
Expand Graph alters the X, Y, and Z attributes of the selected nodes and transactions to expand the graph. This spreads the graph to a larger physical space.


Module: Sprockets::PathUtils
| Relationships & Source Files | |
| Extension / Inclusion / Inheritance Descendants | |
|
Extended In:
| |
|
Included In:
| |
| Defined in: | lib/sprockets/path_utils.rb |
Overview
Internal: File and path related utilities. Mixed into Environment
.
Probably would be called FileUtils, but that causes namespace annoyances when code actually wants to reference ::FileUtils
.
Constant Summary
-
SEPARATOR_PATTERN =
# File 'lib/sprockets/path_utils.rb', line 89"#{Regexp.quote(File::SEPARATOR)}"
Instance Method Summary
-
#absolute_path?(path) ⇒ Boolean
On Windows, ALT_SEPARATOR is \ Delegate to Pathname since the logic gets complex.
-
#atomic_write(filename)
Public: Write to a file atomically.
-
#directory?(path) ⇒ Boolean
Public: Like
File.directory?
. -
#entries(path)
Public: A version of
Dir.entries
that filters out ‘.` files and~
swap files. -
#file?(path) ⇒ Boolean
Public: Like
File.file?
. -
#find_matching_path_for_extensions(path, basename, extensions)
Internal: Match paths in a directory against available extensions.
-
#find_upwards(basename, path, root = nil)
Internal: Find target basename checking upwards from path.
-
#join(base, path)
Public: Joins path to base path.
-
#match_path_extname(path, extensions)
Internal: Match path extnames against available extensions.
-
#path_extnames(path)
Internal: Get path’s extensions.
-
#path_parents(path, root = nil)
Internal: Returns all parents for path.
-
#paths_split(paths, filename)
Internal: Detect root path and base for file in a set of paths.
-
#relative_path?(path) ⇒ Boolean
Public: Check if path is explicitly relative.
-
#relative_path_from(start, dest)
Public: Get relative path from
start
todest
. -
#set_pipeline(path, mime_exts, pipeline_exts, pipeline)
Public: Sets pipeline for path.
-
#split_subpath(path, subpath)
Internal: Get relative path for root path and subpath.
-
#stat(path)
Public: Like
File.stat
. -
#stat_directory(dir)
Public: Stat all the files under a directory.
-
#stat_sorted_tree(dir, &block)
Public: Recursive stat all the files under a directory in alphabetical order.
-
#stat_tree(dir, &block)
Public: Recursive stat all the files under a directory.
Instance Method Details
#absolute_path?(path) ⇒ Boolean
On Windows, ALT_SEPARATOR is \ Delegate to Pathname since the logic gets complex.
See additional method definition at line 79.
# File 'lib/sprockets/path_utils.rb', line 83
def absolute_path?(path) Pathname.new(path).absolute? end
#atomic_write(filename)
Public: Write to a file atomically. Useful for situations where you don’t want other processes or threads to see half-written files.
Utils.atomic_write('important.file') do |file|
file.write('hello')
end
Returns nothing.
# File 'lib/sprockets/path_utils.rb', line 348
def atomic_write(filename) dirname, basename = File.split(filename) basename = [ basename, Thread.current.object_id, Process.pid, rand(1000000) ].join('.'.freeze) tmpname = File.join(dirname, basename) File.open(tmpname, 'wb+') do |f| yield f end File.rename(tmpname, filename) ensure File.delete(tmpname) if File.exist?(tmpname) end
#directory?(path) ⇒ Boolean
Public: Like File.directory?
.
path - String file path.
Returns true path exists and is a directory.
#entries(path)
Public: A version of Dir.entries
that filters out ‘.` files and ~
swap files.
path - String directory path
Returns an empty Array
if the directory does not exist.
# File 'lib/sprockets/path_utils.rb', line 56
def entries(path) if File.directory?(path) entries = Dir.entries(path, encoding: Encoding.default_internal) entries.reject! { |entry| entry.start_with?(".".freeze) || (entry.start_with?("#".freeze) && entry.end_with?("#".freeze)) || entry.end_with?("~".freeze) } entries.sort! entries else [] end end
#file?(path) ⇒ Boolean
Public: Like File.file?
.
path - String file path.
Returns true path exists and is a file.
#find_matching_path_for_extensions(path, basename, extensions)
Internal: Match paths in a directory against available extensions.
path - String directory basename - String basename of target file extensions - Hash of String extnames to values
Examples
exts = { ".js" => "application/javascript" }
find_matching_path_for_extensions("app/assets", "application", exts)
# => ["app/assets/application.js", "application/javascript"]
Returns an Array of [String path, Object value] matches.
# File 'lib/sprockets/path_utils.rb', line 231
def find_matching_path_for_extensions(path, basename, extensions) matches = [] entries(path).each do |entry| next unless File.basename(entry).start_with?(basename) extname, value = match_path_extname(entry, extensions) if basename == entry.chomp(extname) filename = File.join(path, entry) if file?(filename) matches << [filename, value] end end end matches end
#find_upwards(basename, path, root = nil)
Internal: Find target basename checking upwards from path.
basename - String filename: “.sprocketsrc” path - String path to start search: “app/assets/javascripts/app.js” root - String path to stop at (default: system root)
Returns String filename or nil.
# File 'lib/sprockets/path_utils.rb', line 273
def find_upwards(basename, path, root = nil) path_parents(path, root).each do |dir| filename = File.join(dir, basename) return filename if file?(filename) end nil end
#join(base, path)
Public: Joins path to base path.
base - Root path path - Extending path
Example
join('base/path/', '../file.js')
# => 'base/file.js'
Returns string path starting from base and ending at path
# File 'lib/sprockets/path_utils.rb', line 127
def join(base, path) (Pathname.new(base) + path).to_s end
#match_path_extname(path, extensions)
Internal: Match path extnames against available extensions.
path - String extensions - Hash of String extnames to values
Returns [String extname, Object value] or nil nothing matched.
# File 'lib/sprockets/path_utils.rb', line 202
def match_path_extname(path, extensions) basename = File.basename(path) i = basename.index('.'.freeze) while i && i < basename.length - 1 extname = basename[i..-1] if value = extensions[extname] return extname, value end i = basename.index('.'.freeze, i+1) end nil end
#path_extnames(path)
Internal: Get path’s extensions.
path - String
Returns an Array of String extnames.
# File 'lib/sprockets/path_utils.rb', line 192
def path_extnames(path) File.basename(path).scan(/\.[^.]+/) end
#path_parents(path, root = nil)
Internal: Returns all parents for path
path - String absolute filename or directory root - String path to stop at (default: system root)
Returns an Array of String paths.
#paths_split(paths, filename)
Internal: Detect root path and base for file in a set of paths.
paths - Array of String paths filename - String path of file expected to be in one of the paths.
Returns [String root, String path]
# File 'lib/sprockets/path_utils.rb', line 178
def paths_split(paths, filename) paths.each do |path| if subpath = split_subpath(path, filename) return path, subpath end end nil end
#relative_path?(path) ⇒ Boolean
Public: Check if path is explicitly relative. Starts with “./” or “../”.
path - String path.
Returns true if path is relative, otherwise false.
# File 'lib/sprockets/path_utils.rb', line 100
def relative_path?(path) path.match?(/^\.\.?($|#{SEPARATOR_PATTERN})/) ? true : false end
#relative_path_from(start, dest)
Public: Get relative path from start
to dest
.
start - String start path (file or dir) dest - String destination path
Returns relative String path from start
to dest
# File 'lib/sprockets/path_utils.rb', line 110
def relative_path_from(start, dest) start, dest = Pathname.new(start), Pathname.new(dest) start = start.dirname unless start.directory? dest.relative_path_from(start).to_s end
#set_pipeline(path, mime_exts, pipeline_exts, pipeline)
Public: Sets pipeline for path
path - String path extensions - List of file extensions pipeline - Pipeline
Examples
set_pipeline('path/file.js.erb', config[:mime_exts], config[:pipeline_exts], :source)
# => 'path/file.source.js.erb'
set_pipeline('path/some.file.source.js.erb', config[:mime_exts], config[:pipeline_exts], :debug)
# => 'path/some.file.debug.js.erb'
Returns string path with pipeline parsed in
# File 'lib/sprockets/path_utils.rb', line 146
def set_pipeline(path, mime_exts, pipeline_exts, pipeline) extension, _ = match_path_extname(path, mime_exts) path.chomp!(extension) pipeline_old, _ = match_path_extname(path, pipeline_exts) path.chomp!(pipeline_old) "#{path}.#{pipeline}#{extension}" end
#split_subpath(path, subpath)
Internal: Get relative path for root path and subpath.
path - String path subpath - String subpath of path
Returns relative String path if subpath is a subpath of path, or nil if subpath is outside of path.
# File 'lib/sprockets/path_utils.rb', line 162
def split_subpath(path, subpath) return "" if path == subpath path = File.join(path, ''.freeze) if subpath&.start_with?(path) subpath[path.length..-1] else nil end end
#stat(path)
Public: Like File.stat
.
path - String file or directory path
Returns nil if the file does not exist.
# File 'lib/sprockets/path_utils.rb', line 16
def stat(path) if File.exist?(path) File.stat(path.to_s) else nil end end
#stat_directory(dir)
Public: Stat all the files under a directory.
dir - A String directory
Returns an Enumerator of [path, stat].
#stat_sorted_tree(dir, &block)
Public: Recursive stat all the files under a directory in alphabetical order.
dir - A String directory
Returns an Enumerator of [path, stat].
# File 'lib/sprockets/path_utils.rb', line 324
def stat_sorted_tree(dir, &block) return to_enum(__method__, dir) unless block_given? self.stat_directory(dir).sort_by { |path, stat| stat.directory? ? "#{path}/" : path }.each do |path, stat| yield path, stat if stat.directory? stat_sorted_tree(path, &block) end end nil end
#stat_tree(dir, &block)
Public: Recursive stat all the files under a directory.
dir - A String directory
Returns an Enumerator of [path, stat].
# File 'lib/sprockets/path_utils.rb', line 304
def stat_tree(dir, &block) return to_enum(__method__, dir) unless block_given? self.stat_directory(dir) do |path, stat| yield path, stat if stat.directory? stat_tree(path, &block) end end nil end


Protocols¶
-
qunetsim.components.protocols.
_decode_superdense
(q1, q2)¶ Return the message encoded into q1 with the support of q2.
- Parameters
q1 (Qubit) – The qubit the message is encoded into
q1 – The supporting entangled pair
- Returns
A string of decoded message.
- Return type
(str)
-
qunetsim.components.protocols.
_encode_superdense
(message, q)¶ Encode qubit q with the 2 bit message.
- Parameters
message – the message to encode
q – the qubit to encode the message
-
qunetsim.components.protocols.
_rec_classical
(packet)¶ Receives a classical message packet , parses it into sequence number and message and sends an ACK message to receiver.
- Parameters
packet (Packet) – The packet in which to receive.
- Returns
A dictionary consisting of ‘message’ and ‘sequence number’
- Return type
dict
-
qunetsim.components.protocols.
_rec_epr
(packet)¶ Receives a classical message packet , parses it into sequence number and message and sends an ACK message to receiver.
- Parameters
packet (Packet) – The packet in which to receive.
- Returns
A dictionary consisting of ‘message’ and ‘sequence number’
- Return type
dict
-
qunetsim.components.protocols.
_rec_ghz
(packet)¶ Receives a GHZ state and stores it in quantum storage.
- Parameters
packet (Packet) – The incoming packet
-
qunetsim.components.protocols.
_rec_key
(packet)¶ Receive a QKD key.
- Parameters
packet (Packet) – The incoming packet
-
qunetsim.components.protocols.
_rec_qubit
(packet)¶ Receive a packet containing qubit information (qubit is transmitted externally)
- Parameters
packet (Packet) – The packet in which to receive.
-
qunetsim.components.protocols.
_rec_superdense
(packet)¶ Receives a superdense qubit and decodes it.
- Parameters
packet (Packet) – The packet in which to receive.
- Returns
A dictionary consisting of decoded superdense message and sequence number
- Return type
dict
-
qunetsim.components.protocols.
_rec_teleport
(packet)¶ Receives a classical message and applies the required operations to EPR pair entangled with the sender to retrieve the teleported qubit.
- Parameters
packet (Packet) – The packet in which to receive.
-
qunetsim.components.protocols.
_rec_w
(packet)¶ Receives a W state and stores it in quantum storage.
- Parameters
packet (Packet) – The incoming packet
-
qunetsim.components.protocols.
_relay_message
(packet)¶ Reduce TTL of network packet and if TTL > 0, sends the message to be relayed to the next node in the network and modifies the header.
- Parameters
packet (RoutingPacket) – Packet to be relayed
-
qunetsim.components.protocols.
_send_ack
(sender, receiver, seq_number)¶ Send an acknowledge message from the sender to the receiver. :param sender: The sender ID :type sender: str :param receiver: The receiver ID :type receiver: str :param seq_number: The sequence number which to ACK :type seq_number: int
-
qunetsim.components.protocols.
_send_classical
(packet)¶ Sends a classical message to another host.
- Parameters
packet (Packet) – The packet in which to transmit.
-
qunetsim.components.protocols.
_send_epr
(packet)¶ Sends an EPR to another host in the network.
- Parameters
packet (Packet) – The packet in which to transmit.
-
qunetsim.components.protocols.
_send_ghz
(packet)¶ Gets GHZ qubits and distributes the to all hosts. One qubit is stored in own storage.
- Parameters
packet (Packet) – The incoming packet
-
qunetsim.components.protocols.
_send_qubit
(packet)¶ Transmit the qubit :param packet: The packet in which to transmit. :type packet: Packet
-
qunetsim.components.protocols.
_send_superdense
(packet)¶ Encodes and sends a qubit to send a superdense message.
- Parameters
packet (Packet) – The packet in which to transmit.
-
qunetsim.components.protocols.
_send_teleport
(packet)¶ Does the measurements for teleportation of a qubit and sends the measurement results to another host.
- Parameters
packet (Packet) – The packet in which to transmit.
-
qunetsim.components.protocols.
_send_w
(packet)¶ Gets W qubits and distributes the to all hosts. One qubit is stored in own storage.
- Parameters
packet (Packet) – The incoming packet
-
qunetsim.components.protocols.
encode
(sender, receiver, protocol, payload=None, payload_type='', sequence_num=-1, await_ack=False)¶ Encodes the data with the sender, receiver, protocol, payload type and sequence number and forms the packet with data and the header. :param sender: ID of the sender :type sender: str :param receiver: ID of the receiver :type receiver: str :param protocol: ID of the protocol of which the packet should be processed. :type protocol: str :param payload: The message that is intended to send with the packet. Type of payload depends on the protocol. :param payload_type: Type of the payload. :type payload_type: str :param sequence_num: Sequence number of the packet. :type sequence_num: int :param await_ack: If the sender should await an ACK :type await_ack: bool
- Returns
Encoded packet
- Return type
(Packet)


INTROVERTED | INTUITIVE | THINKING | JUDGING
As Sailor Star Healer, The Strategist you are intelligent, skeptical and independent. You hold both yourself and others to a very high standard and even though you radiate with self confidence you are still an introverted type who prefers to shy away from being in the spotlight. Landing on various ends of the spectrum, you can be imaginative and decisive, ambitious yet private and curious with a wandering mind but yet, still focused.
The Strategist is one to seek knowledge, you are often acknowledged as being a bookworm and are proud of how much you know, because along with learning about things, this type also enjoys sharing the knowledge they gain with others -- proud of the mastery they achieve in the subjects they chose to study.
Their fluidity is clear through their actions, gaining perspective which can easily look from both sides of a situation for example being a positive dreamer but also a bitter pessimist at the same time. Although this is so, The Strategist does focus on positive notes, living by the idea that nothing is impossible with the right amount of effort, thought or careful crafted intellect invested into it. This allows you to step away from the feeling that others are usually too lazy or selfish to reach their own goals, and instead push forward to pursue your own.
As The Strategist, some may mistake you as cold but, the matter of the fact is that you simply believe that the best way to act, is as if life were a giant chess board that you can advance through by using intelligence, tactics, strategies and well put together plans. You are smart and independent and at the end of the day because of this, can achieve any goal you put your mind to.