Common Pile v0.1 Filtered Data
Collection
An LLM pre-training dataset produced by filtering and deduplicating the raw text collected in the Common Pile v0.1
•
31 items
•
Updated
•
13
Dataset Viewer
added
string | created
timestamp[us] | id
string | metadata
dict | source
string | text
string |
|---|---|---|---|---|---|
2024-11-18T17:59:32.302108+00:00 | 2022-02-17T02:51:14 | 4058a41e892e702a091856e0213a93c5dcbed14e | {
"blob_id": "4058a41e892e702a091856e0213a93c5dcbed14e",
"branch_name": "refs/heads/master",
"committer_date": "2022-02-17T02:51:14",
"content_id": "369b25fd97af846b1049ae910a57f936e65bbaea",
"detected_licenses": [
"MIT"
],
"directory_id": "38f1f88683f707c076c56408edf0d66a8829fb36",
"extension": "html",
"filename": "howtouse.html",
"fork_events_count": 0,
"gha_created_at": "2018-03-29T21:11:02",
"gha_event_created_at": "2020-11-03T23:03:32",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 127347788,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 15689,
"license": "MIT",
"license_type": "permissive",
"path": "/frontend/docs/html/howtouse.html",
"provenance": "stackv2_html-0000.json.gz:1",
"repo_name": "mikewong-sfsu/GeneDive",
"revision_date": "2022-02-17T02:51:14",
"revision_id": "d2f11eb9f1bf63c9e494f5039b098536f9d5aa96",
"snapshot_id": "3163cbf1753e9a8d59fc4b83bc31eae138c8da14",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/mikewong-sfsu/GeneDive/d2f11eb9f1bf63c9e494f5039b098536f9d5aa96/frontend/docs/html/howtouse.html",
"visit_date": "2022-03-01T03:36:15.275163"
} | stackv2 | |
GeneDive
|
This documentation is geared towards scientists who intend to use GeneDive for their research purposes.
GeneDive is a web application designed to allow easy lookup, visualization, and exporting of gene, chemical, and disease relationships. The relationships are probabilities based on how closely they are connected grammatically in articles from PLOS One, PLOS Biology, and PLOS Genetics.
GeneDive is a collaborative project between the San Francisco State University Department of Computer Science and Stanford Bioengineering.
To register for the site, click Register on the front page and fill out the appropriate forms. You will then be able to login with your information, and be redirected to the search page.
When you successfully login, you will be presented with a large area in the center-right of the screen for results, along with a search and filter panel on the right side. We will first go over the features of the panel from top to bottom.
GeneDive title
A link that takes you back to the login page.
Undo and Redo
These buttons allow you to undo and redo your actions on the site. If there is no action to undo or redo, the buttons will be disabled. This is a valuable tool since you can do expiromentation with the system, then click undo or redo at any time.
1-Hop, 2-Hop, 3-Hop, Clique
The four choices, 1-Hop, 2-Hop, 3-Hop, and Clique will determine how a search is conducted for the DGRs that a user enters.
1-Hop: This will search for results that are directly interacting with one another. If 1 item is selected, then all direct interactions with that one item will be presented. If more than one item is selected, then only direct interactions with those items will be shown. 2-Hop: This search will present results whom mutually interact with the same items. The intermediates will be highlighted in orange. This requires more than 1 item to be specified. 3-Hop: This search will present results whom's direct interactions mutually interact with each other. The intermediates will be highlighted in orange. This requires more than 1 item to be specified. Clique: Similar to 1-Hop, except only the results that are 1 jump away from the search that are related to one another will be presented. You are limited to one item at a time when in this search mode.
Search Bar
This will accept any string input. Upon typing in your query, GeneDive will lookup the query amongst Genes, Chemicals, Diseases, and Genesets, and present the findings below the search field, which you can either click on or use the arrow keys and hit enter to select.
More than one item can be selected from the list, but only if you are choosing 1, 2, or 3-Hops. Clique does not support mulitple item selection.
Minimum Confidence
This option allows you to choose the threshold for the confidence of gene interactions. By default, new searches start at 0.7 to present the user with a decent selection of results. Lowering this value will present more results, but will increase increase waiting time as more data has to be retrieved from the server and processed locally. Increasing this value will give better results.
The Confidence Cutoffs can be clicked to set the Minimum Confidence with the following values: Low 0.7 | Medium 0.85 | High: 0.95
Tip: If it's taking a long time to load the results, you may change the confidence level, DGRs, or Hop/Clique selection to stop the current search and start a new one.
Filtering
You can further filter results down by Article, Exerpt, Gene, Journal, and Section. Upon adding an "is" filter, all results not containing the filter will be hidden. If you add a "not" filter, any results matching the filter's value will be hidden.
Highlight Rows
When you enter strings in here, any results that contain that contain that value in their data will be highlighted in the table view. Edges will also be highlighted in the graph view.
Group Table Results By
The Interactions are grouped by unique DGR interactions by default. Clicking on group by Article will group the interactions by Article instead.
Download Results
This allows you to save the following: State history (undo, redo), a picture of the graph as it currently is, the results table in csv format, the terms and conditions, and a custom README file containing a note that you specify when you click Download Results. All this data will be stored in a zip file with its name containing the current timestamp.
Upload Results
If you upload the zip file you downloaded from Download Results, the website will be restored to the exact state that it was when that file was downloaded. The website will also have the state history, allowing you to click undo and redo if applicable.
The majority of screen space is taken up in the middle by the results. On the top is a table of the results, and the bottom a graph.
Grouped Results Table The results here are grouped by DGR interactions by default. You can group them by article interactions by clicking on Articles at the bottom of the Search area, under Group Table Results By. You can sort the table by clicking the small, black arrows next to each field header. If there is only one visible arrow, then the table is sorted by that column. Down arrow means descending, up arrow means ascending.
TIP: You can sort by multiple rows by holding shift when click on the headers.
Detailed Results Table
Clicking on a table row will present you with all the interactions of that group. The columns have the same meaning as in the Grouped Results Table, except for the following.
To go back to the grouped results, click the Back button at the top right.
The graph below the table presents a visual representation of the DGR interactions. The thickness of an edge represents how many interactions between the DGR there are in the articles. The color of the node corresponds to the colors of the search items, located under the search bar.
The graph can also be visually modified in a number of ways, along with being used to alter your search parameters. |
2024-11-18T17:59:32.303550+00:00 | 2021-10-24T16:39:04 | 9daa4599acb80093c785dd4d5bf303c86a2d7dbf | {
"blob_id": "9daa4599acb80093c785dd4d5bf303c86a2d7dbf",
"branch_name": "refs/heads/main",
"committer_date": "2021-10-24T16:39:04",
"content_id": "5c9b5c9baf8175e79e1ee6c8bcb4da415946e280",
"detected_licenses": [
"MIT"
],
"directory_id": "3d648619e31cf4217a6cb5ef91eb9e6f7e1fe4aa",
"extension": "html",
"filename": "pricing.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 367088838,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 11406,
"license": "MIT",
"license_type": "permissive",
"path": "/pricing.html",
"provenance": "stackv2_html-0000.json.gz:2",
"repo_name": "valazeinali/vanir.github.io",
"revision_date": "2021-10-24T16:39:04",
"revision_id": "39205805e3d9119fb6d5df08cf977da8cbf129a4",
"snapshot_id": "bb1fa5df1b07f2c9f74a72b2c25905d20eaa94d2",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/valazeinali/vanir.github.io/39205805e3d9119fb6d5df08cf977da8cbf129a4/pricing.html",
"visit_date": "2023-08-28T11:04:52.911181"
} | stackv2 | Pricing Plan
Vanir Pricing Outcomes
- Investing
- Rebalancing
- Custom Portfolios
- Education (Free for all)
- Everything in Vanir Starter
- Net Worth Projection
- Roth IRA or Traditional
- Punch-Card Lottery
- Everything in Vanir Normal
- 2x Punch-Card Lottery
- Access to portfolio margin
- Personalized Retirement Advice |
2024-11-18T17:59:32.305747+00:00 | 2022-04-22T20:05:10 | cce122f63df94180a380707a8a8da2120caebecd | {
"blob_id": "cce122f63df94180a380707a8a8da2120caebecd",
"branch_name": "refs/heads/master",
"committer_date": "2022-04-22T20:05:10",
"content_id": "75b437ce8192ffd976ee102caa81dd7bb588bd22",
"detected_licenses": [
"MIT"
],
"directory_id": "862bee845b055a3cfb7c0ab5ac1c277ed35f438f",
"extension": "html",
"filename": "TeamsHalf.html",
"fork_events_count": 2,
"gha_created_at": "2019-09-01T21:31:43",
"gha_event_created_at": "2020-11-02T21:31:19",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 205734717,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2104,
"license": "MIT",
"license_type": "permissive",
"path": "/library/Lahman/html/TeamsHalf.html",
"provenance": "stackv2_html-0000.json.gz:3",
"repo_name": "mayousif/Turbidity-Cleaner",
"revision_date": "2022-04-22T20:05:10",
"revision_id": "e756d9359f1215a4c9e6ad993eaccbc3fb6fe924",
"snapshot_id": "a4862f54ca47305cfa47d6fcfa048e1573d6a2b7",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/mayousif/Turbidity-Cleaner/e756d9359f1215a4c9e6ad993eaccbc3fb6fe924/library/Lahman/html/TeamsHalf.html",
"visit_date": "2022-05-09T07:32:55.856365"
} | stackv2 | | TeamsHalf {Lahman} | R Documentation |
Split season data for teams
data(TeamsHalf)
A data frame with 52 observations on the following 10 variables.
yearID
Year
lgID
League; a factor with levels AL
NL
teamID
Team; a factor
Half
First or second half of season
divID
Division
DivWin
Won Division (Y or N)
Rank
Team's position in standings for the half
G
Games played
W
Wins
L
Losses
Lahman, S. (2021) Lahman's Baseball Database, 1871-2020, 2020 version, http://www.seanlahman.com/baseball-archive/statistics/
# 1981 season team data split into half seasons data(TeamsHalf) library("dplyr") # List standings with winning percentages by # season half, league and division TeamsHalf %>% group_by(Half, lgID, divID) %>% mutate(WinPct = round(W/G, 3)) %>% arrange(Half, lgID, divID, Rank) %>% select(Half, lgID, divID, Rank, teamID, WinPct) |
2024-11-18T17:59:32.309554+00:00 | 2017-09-07T17:53:40 | 55135af4605fd3496fe8e190e4817338add789fc | {
"blob_id": "55135af4605fd3496fe8e190e4817338add789fc",
"branch_name": "refs/heads/master",
"committer_date": "2017-09-07T17:53:40",
"content_id": "b122321df29b025c6eeed005ff12bca1b1e9a3f1",
"detected_licenses": [
"MIT"
],
"directory_id": "4f53a8b719f0b3cbc21e5599999baed9dec6544e",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 102767605,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 685,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:4",
"repo_name": "macengr/FCC_ProdPage",
"revision_date": "2017-09-07T17:53:40",
"revision_id": "b8d1b48bd285c4838e1929a4100206db65c9053a",
"snapshot_id": "25e66727878fa0dfb705d048bb79eefbe02d9d2c",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/macengr/FCC_ProdPage/b8d1b48bd285c4838e1929a4100206db65c9053a/index.html",
"visit_date": "2021-01-23T17:35:18.094728"
} | stackv2 | Hello How Are you
This is soon to become a sample product landing page built only with CSS and HTML, and using Bootstrap as a framework. |
2024-11-18T17:59:32.312960+00:00 | 2019-12-02T23:58:02 | 3d034010773e2eb71b22f892a40afd6c33ce3cd1 | {
"blob_id": "3d034010773e2eb71b22f892a40afd6c33ce3cd1",
"branch_name": "refs/heads/master",
"committer_date": "2019-12-02T23:58:02",
"content_id": "cd8c85a2c29179488eed72e325eb5403d64f6ea3",
"detected_licenses": [
"MIT"
],
"directory_id": "2e83864a44aac24cff8c37ea35ebced1eebe7fe6",
"extension": "html",
"filename": "default.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 208929213,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 7016,
"license": "MIT",
"license_type": "permissive",
"path": "/_layouts/default.html",
"provenance": "stackv2_html-0000.json.gz:5",
"repo_name": "Haoran-Lin/Haoran-Lin.github.io",
"revision_date": "2019-12-02T23:58:02",
"revision_id": "81e1826b91f642d98f62405394094a7658e6d0c0",
"snapshot_id": "156cf6057bc12bf6a82c41613d9f0a6de1ba1c25",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Haoran-Lin/Haoran-Lin.github.io/81e1826b91f642d98f62405394094a7658e6d0c0/_layouts/default.html",
"visit_date": "2020-09-08T09:32:18.790565"
} | stackv2 | About me
Hi, I'm Haoran, a User Experience Designer, you can also call me Eddie. I'm currently studying at Wilfrid Laurier University, and I have been studying UX for 2 years. What really makes me want to become a UXer is the world around us, especially back home in China. There are a lot of things and design product in our lives that just doesn't make sense and feel strange to use. I want to improve some elements around us and make things feel more pleasant for users. UX is a very interesting field overall, I would encourage more students who wants to improve things around us to join our UX program.
My Portfolio
{% endif %}
{{ current.title }}
{{ post.title }}
My Angle
Pen Tool And Me: There is always some interesting process in learning different skills, testing my skills with various things, even myself, be creative and try things out, alwasy step outside of own's confort-zone, explore more things to understand self in a better way.
Burger Chef Animated Ad: It is my first time using multiple design software to create a animated GIF ad, group skill and communication skill are very important in this project, as a designer, communication skills and abilities are necessary, but also to be able to endure loneliness and boredom.
Icon Set: Creative inspiration and thinking are essential skills of a UX designer. Good work must have a complete and unique thinking behind it. In the process of making ICONS, I have been trying to figure out how to change one icon into four different styles, which tested my independent thinking ability, and apply the concept into life, always looking for a better change.
Photoshop Assignment: Colour is very important in the design work, it can bring the viewer the most intuitive impact in the first time. Colours are nou just important to designers, but also to everyone else. Colors stand for one's attitude, emotion and passion, live your life in different styles. |
2024-11-18T17:59:32.323041+00:00 | 2012-09-10T20:06:30 | c3801aa63b49b89711357a846729b28c6539f353 | {
"blob_id": "c3801aa63b49b89711357a846729b28c6539f353",
"branch_name": "refs/heads/master",
"committer_date": "2012-09-10T20:06:30",
"content_id": "8b27b016d3700dc237349b2900d8def472758a29",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "9f20dcfff04522bc4cd7edaa3687169276ebdcb2",
"extension": "html",
"filename": "quizRaw.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 73334,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/problem-sets/quizzes/Text-Processing-And-Edit-Distance/quizRaw.html",
"provenance": "stackv2_html-0000.json.gz:6",
"repo_name": "gootyfer/class2go",
"revision_date": "2012-09-10T20:06:30",
"revision_id": "6a4da70aaf4e61de2a258f9a5a3cef67d782d736",
"snapshot_id": "df37b3d19e91055c8691f49193403c60dd90966d",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/gootyfer/class2go/6a4da70aaf4e61de2a258f9a5a3cef67d782d736/problem-sets/quizzes/Text-Processing-And-Edit-Distance/quizRaw.html",
"visit_date": "2021-01-15T19:05:04.944129"
} | stackv2 | Skip Navigation
Coursera
Beta
Jason Bau
Preferences
All Courses
Admin
Support
I18N Editor
About
Contact Us
Logout
Dan Jurafsky,
Professor of Linguistics
Chris Manning,
Associate Professor of Computer Science
Administration
General
Course Settings
Deployment & Staging
Grading Policy
Navigation Bar Settings
Announcement Management
Content Management
Quiz Management
Assignment Management
Lecture Management
Section Management
Upcoming Items Display
Platform Services
Asset Administration
Forum Administration
Email Users
Advanced Tools
Queue Administration
Chronos
Log Viewer
User Administration
Import Tools
Assignment Submissions
Export Tools
Quiz Summary
Detailed Quiz Responses
Assignment Submissions
Class Gradebook
Status Monitoring
Activity Tracking
Export Statistics
Video Status
<quiz> <metadata> <title>Text Processing and Edit Distance</title> <open_time>2012-03-04 0101</open_time> <soft_close_time>2012-03-27 2359</soft_close_time> <hard_close_time>2012-05-22 2359</hard_close_time> <duration>0</duration> <retry_delay>10</retry_delay> <maximum_submissions>5</maximum_submissions> <modified_time>1335394035880</modified_time> <parameters> <show_explanations> <question>after_hard_close_time</question> <option>before_soft_close_time</option> <score>before_soft_close_time</score> </show_explanations> </parameters> <maximum_score>5</maximum_score> </metadata> <preamble><![CDATA[]]></preamble> <data> <question_groups> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="a35e67bd49080cc9f5aeb5aec91b0dcd" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[Which of the following strings doesn't match the regex: <br><br><code>/[a-z]+'[a-z]+/</code>]]></text> <explanation><![CDATA[Question explanation]]></explanation> <option_groups randomize="true"> <option_group select="3"> <option id="7fe1ff03d7de4c86809490734c1f7502" selected_score="0" unselected_score="0"> <text><![CDATA[he'd]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="d9ec153ffdda8b0ad8a4203db9064517" selected_score="0" unselected_score="0"> <text><![CDATA[it's]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="b41ad88bb85117cdca66b1849caa6c98" selected_score="0" unselected_score="0"> <text><![CDATA[cat's]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="87b1a9b98703945d39ca82211f0e4ba0" selected_score="0" unselected_score="0"> <text><![CDATA[isn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="a3809f6b32483cec73d7b6236afa28fa" selected_score="0" unselected_score="0"> <text><![CDATA[won't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="064fc376316d4892746cbdaa842cc009" selected_score="0" unselected_score="0"> <text><![CDATA[oughtn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="f1601373696b906a5059f0ed59b3fa68" selected_score="0" unselected_score="0"> <text><![CDATA[shan't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="a53510a7d9cbd83d58c672a158f6e0fb" selected_score="0" unselected_score="0"> <text><![CDATA[mightn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="816dfe114d12f55aa2dd01849aa466cc" selected_score="0" unselected_score="0"> <text><![CDATA[we're]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> </option_group> <option_group select="1"> <option id="cd2d24c2d049e0f8bc7f68b96cfe3b8e" selected_score="1" unselected_score="0"> <text><![CDATA[you'd've]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="6476a32349d46d7023e77fe3084cc850" selected_score="1" unselected_score="0"> <text><![CDATA[We'd]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="f6a61c89dce2b1a4665b9c3b18e604db" selected_score="1" unselected_score="0"> <text><![CDATA[rock 'n' roll]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="30e44f3b747c69bea1d5f57ac8e8bc1c" selected_score="1" unselected_score="0"> <text><![CDATA['tis]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="a7ea8106a1785d5dc304ef89096f6a49" selected_score="1" unselected_score="0"> <text><![CDATA[I'm]]></text> <explanation><![CDATA[Correct]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="02cf8f5f55165a2b0b66c84530a34bd3" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>regexp</type> </parameters> </metadata> <data> <text><![CDATA[Download either the Java or Python implementations of the porter stemmer from:<br> <br> <a href="http://tartarus.org/martin/PorterStemmer/">http://tartarus.org/martin/PorterStemmer/</a><br> <br> Any implementation should work, but only Python and Java have been tested. Stem the following excerpt from Wikipedia:<br> <br> <pre> In linguistic morphology and information retrieval, stemming is the process for reducing inflected words to their stem, base or root form-generally a written word form. The stem need not be identical to the morphological root of the word; it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. Algorithms for stemming have been studied in computer science since 1968. Many search engines treat words with the same stem as synonyms as a kind of query broadening, a process called conflation. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt">here</a>.]]></text> <explanation><![CDATA[To use the java file:<br> <br> <pre> $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt $ wget http://tartarus.org/martin/PorterStemmer/java.txt $ mv java.txt Porter.java $ javac Porter.java $ java Porter stem.txt > stem.stemmed.txt $ cat stem.stemmed.txt </pre> to use the python version:<br> <br> <pre> $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt $ wget http://tartarus.org/martin/PorterStemmer/python.txt $ mv python.txt porter.py $ python porter.py stem.txt > stem.stemmed.txt $ cat stem.stemmed.txt </pre>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f65157f32c3f09db10b3c94c7d01681e" selected_score="1" unselected_score="0"> <text><![CDATA[/in linguist morpholog and inform retriev, stem is the process for reduc inflect word to their stem, base or root form-gener a written word form. the stem need not be ident to the morpholog root of the word; it is usual suffici that relat word map to the same stem, even if thi stem is not in itself a valid root. algorithm for stem have been studi in comput scienc sinc 1968. mani search engin treat word with the same stem as synonym as a kind of queri broaden, a process call conflat./]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="7e2c59f72c36fa5a12ca95dd59d6e08c" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[A simple way to tokenize a document is to split on any non-alphabetical character. However, this sometimes has the undesirable consequence of removing any numerical information. Use the unix command line utilities to find the number of tokens in the following excerpt from a Wikipedia article on Astronomical Units (AUs), splitting on all non-alpha-<b>numerical</b> characters:<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alpha-numerical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -sc '[:alnum:]' '\n' < au.txt | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="da7dbf0c3c2998551742b9b508e1630d" selected_score="1" unselected_score="0"> <text><![CDATA[143]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="5a29de036b2fa9fb7230a7f3da4cd381" selected_score="0" unselected_score="0"> <text><![CDATA[[0,142]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="4d0f8f85a13c26d91010fc3e2828acf4" selected_score="0" unselected_score="0"> <text><![CDATA[[144,1000]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="6db81c9a1c6788ef62c7d7b3410bfdae" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Using simple white-space tokenizing, how many additional word types will we create in the following excerpt, when compared to tokenizing on all non-alphabetical characters?<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -s '[:space:]' '\n' < au.txt | sort | uniq -c | wc -l</code><br> <br> -<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="5dd759f0f6d1026ad4bf5fa4f7f2c510" selected_score="1" unselected_score="0"> <text><![CDATA[10]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="14b70845ffee5389bde26ae256e6abcf" selected_score="0" unselected_score="0"> <text><![CDATA[[11,80]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="680a26bd7a9bc684a00102635e7dc7d9" selected_score="0" unselected_score="0"> <text><![CDATA[[80,1000]]]></text> <explanation><![CDATA[Remember, you should be entering the difference between the number of unique word types created by two different tokenizing methods. <br><br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="8e4da6a97596fde2901405dff150083b" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[First tokenize the following text on all non-alphabetical characters and count the number of unique word types. How many word types disappear if we do case normalization?<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l</code><br> <br> -<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | tr '[:upper:]' '[:lower:]' | sort | uniq -c | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command-line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="63f29e99f0221c63c81dce9e38308c68" selected_score="1" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="93744aa03ad843238c58ce4aaa430466" selected_score="0" unselected_score="0"> <text><![CDATA[[-1000,0]]]></text> <explanation><![CDATA[Remember, your answer should be the number of word types that disappear, which should be a positive integer. <br><br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="41f905bec7d2f935fc509b2c1074865f" selected_score="0" unselected_score="0"> <text><![CDATA[[1,3]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="e667dbd69152fc94c186cb77199e4d8f" selected_score="0" unselected_score="0"> <text><![CDATA[[5,15]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="8ce10a51f24dc10ce32ce708bdc483fd" selected_score="0" unselected_score="0"> <text><![CDATA[[16,1000]]]></text> <explanation><![CDATA[Remember, you should be entering the difference between the number of unique word types generated by using one method of counting word types and another, not the absolute number of word types <br> <br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[<br> What is the value in the marked cell of the following Levenshtein distance (substitutions cost 2) table below:<br> <br>]]></preamble> <question id="032689b9d45f492afba24f9e0ec35a3f" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="165" width="165" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/barn_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/barn_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="8dcb6e617ab455148b8354e848ebeb40" selected_score="1" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="074ff4af3d45979b573c8c2068b1fda0" selected_score="0" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="b244f68458897f103daf46e6ce6e032b" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="af6b87b1190c29f3582ba7420ca3b9b1" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="f92ff1beb04096673dac04f298937587" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="190" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cone_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="200" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cone_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="36aaf96967cfe839b41c7dc15dd68533" selected_score="1" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="6f3ad808ea066b3231582ca96cbb401a" selected_score="0" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="58f0ce4226e052621a6134457a02b3b0" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="30ace6d61683143fa0273349d50e24b3" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="d4d8519a2ab5607b5e8588ed4b4e126c" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="200" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/demure_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="200" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/demure_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="8d04d542975de404c947742bd7167842" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="ae4ca6138c1d9c864d10a67b72e5167b" selected_score="0" unselected_score="0"> <text><![CDATA[0]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="3493f877a754faf38f61288d8fcd13bf" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="5d62d90c9c36b4fb3f86b385178aee20" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="636c58d2a03deb33686bdd7d065aceac" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="398b60fb473cce489d0a7af8247e7f9f" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/peon_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/peon_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="49c2eac9fe38b42d9ccc80704c2d4a3a" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="a16bc0003eec7ea9ceb4f1195d549820" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="887e9ac6939a727cd1887ca770542917" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="54ebd66cadec7a32576ec6e9778ffee8" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="94a0dc9c48386799262ff428052896fd" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="160" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/torn_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="170" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/torn_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f981d2b93f83f92b1011de012d5a29d5" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="b06e2d5d7419735bc8207746a0d5e7db" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="5252c7239a2ba49f554aad3f542af231" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="f561f9ec6dd7376bb918488e35dab163" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[<br> Consider the Levenshtein distance (substitutions cost 2) table below. What are the backpointers for the highlighted cell?<br> <br>]]></preamble> <question id="8e196cc2b93b14723056b40a8966160b" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave1.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'c' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="96610a94ea728a71b5c8d3383a820158" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="2ae97f09e714ba7829ccef548bd8869a" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="7b50fb38f2799e4b96987f0bea1fcd88" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="9ce9dcdb43de0f9de9538647bf6871cf" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="398cb1f4039273d2190a42984367ad17" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0f4324f31f0ee6c95d1cf3287eb330fa" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="fd60028c3209ccaa811c8925ceb99cb1" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="54ab4954454e03feac975378c162e1f4" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave2.html"></iframe> <br><br>[the highlighted cell corresponds to the 'v' in 'cave' and the 'v' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="899b01b5d54457f76af26cd2673f2c7c" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="02e5805afec7db5837fc90921148a9d0" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0941b586e0e4b2788bbea27079025acd" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="9ee4d52416642fd19ee7d68ea8f15083" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="ed1e5aa33741b0c8c42a99c4e44da43e" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="0993315442a8f4731a2b892095f5699d" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="699b7f8fa52f62b1c474ef1aab36212a" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Option explanation]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="5ef5a6915b0468cd6c2de63aeba9ca6a" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave3.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'a' in 'cave' and the 's' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="7720fa189f7b570f12f8333088d1ad6b" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="201a6573e2ca5bb0273aa9b8c5824d1f" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="5a57f76ceed56e451f2c2fa13400f1f5" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="069cda44a06d289e5e51c8c66623bf2a" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="6985b0ecf7d6c8226223b84e7497cc25" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="46e2993b6233b8f3374d11e377622dfb" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="a7001053fa859368e48b43243c416162" selected_score="1" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="4fdc8292cfa01f0d4a09cea98f3a5f15" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave4.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'e' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="25f4a6214ab5e11be020405dac07db35" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="4ce2aaef2d9484e0d818a4addb552cdd" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="b2597986062d36cb3792901f525fa87a" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0b4e799385799b650bbe5122a1f39668" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="2c725410f00d4747a1dc72d216d636fe" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="70b60a55afbb503e3d37e18662cd2899" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="888ac7b9cfd82bc36009432223000853" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="201d516574cc26afcc1269258be5429f" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave5.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'a' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f08b64819299de110f93608008208fa9" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="fb7b99bc4acca96b961a16f331e3dbc1" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="096abc6d14a58fc270ddafdddbfc6973" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="af7eb7c8d727334ee88459fbb0fd3655" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="b059f6cf30740ba0e4c2c347b68c52ce" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="734bb96e81179e4097bc6dbad04f15c5" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="d1b01f66c5a068de9dd6ed9b1ca451b7" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> </question_groups> </data> </quiz>
Exit Without Saving
{"0":"Coursera","1":"Preferences","2":"All Courses","3":"Admin","4":"Support","5":"I18N Editor","6":"About","7":"Contact Us","8":"Logout","9":"Natural Language Processing"}
This page features MathJax technology to render mathematical formulae. If you are using a screen reader, please visit
MathPlayer
to download the plugin for your browser. Please note that this is an Internet Explorer-only plugin at this time. |
2024-11-18T17:59:32.346758+00:00 | 2021-03-22T06:53:36 | 552c33dcdc2f3f764a612634ea69366643e32c58 | {
"blob_id": "552c33dcdc2f3f764a612634ea69366643e32c58",
"branch_name": "refs/heads/main",
"committer_date": "2021-03-22T06:53:36",
"content_id": "7a3a1776199fcf276d8a426d439e76e4a54b2b45",
"detected_licenses": [
"MIT"
],
"directory_id": "4be1774695f366933f406e70a20505864e088631",
"extension": "html",
"filename": "create.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3628,
"license": "MIT",
"license_type": "permissive",
"path": "/public/create.html",
"provenance": "stackv2_html-0000.json.gz:7",
"repo_name": "ffakih5/SourcE-commerce",
"revision_date": "2021-03-22T06:53:36",
"revision_id": "a7490f6fad1dd81f192e22234ec8a6df2ad6551c",
"snapshot_id": "babe0d8e388afed0a5fbf7cd433fb5b56051996e",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ffakih5/SourcE-commerce/a7490f6fad1dd81f192e22234ec8a6df2ad6551c/public/create.html",
"visit_date": "2023-03-22T01:50:38.078858"
} | stackv2 | Create Account Page
First Name
Last Name
Business Name
Phone Number
Email address
We'll never share your email with anyone else.
Password
Re-Enter Password
Submit |
2024-11-18T17:59:32.354109+00:00 | 2022-06-09T08:24:38 | 7e702526a293942f82baee76afd7e4be76d7232f | {
"blob_id": "7e702526a293942f82baee76afd7e4be76d7232f",
"branch_name": "refs/heads/main",
"committer_date": "2022-06-09T08:24:38",
"content_id": "5e4c9ecec703be601287feee7a105549ada75caf",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "6c3325ff8d6691f380b329b9d032f75be39ae1df",
"extension": "html",
"filename": "sampleChange.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 402224739,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1146,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/src_supermine/3/5108/sampleChange.html",
"provenance": "stackv2_html-0000.json.gz:8",
"repo_name": "mlcodepatterns/mlcodepatterns.github.io",
"revision_date": "2022-06-09T08:24:38",
"revision_id": "0ee8a195eefed1d63db6f2e29b581606dff2bd1a",
"snapshot_id": "322951b2282fbb38f1116f94e8c5f26b365d47f6",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/mlcodepatterns/mlcodepatterns.github.io/0ee8a195eefed1d63db6f2e29b581606dff2bd1a/src_supermine/3/5108/sampleChange.html",
"visit_date": "2022-07-28T06:51:31.501809"
} | stackv2 | Before Change
split_list = tf.split(x, split_indices, axis=1)
for i, distribution in enumerate(self.child_distributions):
// Remove extra categorical dimension
if isinstance(distribution, Categorical):
split_list[i] = tf.cast(
tf.squeeze(split_list[i], axis=-1), tf.int32)
log_list = [
distribution.logp(split_x) for distribution, split_x in zip(
self.child_distributions, split_list)
]
After Change
split_x = tf.split(x, split_indices, axis=1)
// Structured or flattened (by single action component) input.
else:
split_x = tree.flatten(x)
def map_(val, dist):
// Remove extra categorical dimension.
if isinstance(dist, Categorical): |
2024-11-18T17:59:32.609272+00:00 | 2019-03-03T21:23:49 | b01e8d884aa17c2ab3efcb2148e6ca7dcc8ce59a | {
"blob_id": "b01e8d884aa17c2ab3efcb2148e6ca7dcc8ce59a",
"branch_name": "refs/heads/master",
"committer_date": "2019-03-03T21:23:49",
"content_id": "d963bff60544c18b32a9cde247b46c2430f1042a",
"detected_licenses": [
"MIT",
"BSD-3-Clause"
],
"directory_id": "46b7bbb005adb398b77321fc37b393b96d09b785",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 48960112,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 10867,
"license": "MIT,BSD-3-Clause",
"license_type": "permissive",
"path": "/app/index.html",
"provenance": "stackv2_html-0000.json.gz:9",
"repo_name": "ifraixedes/landing",
"revision_date": "2019-03-03T21:23:49",
"revision_id": "95fbfa60d74961cbe453feab2093fb8b9fc61be6",
"snapshot_id": "0774cb40a3253065d92ab14c743561052d89ccb4",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ifraixedes/landing/95fbfa60d74961cbe453feab2093fb8b9fc61be6/app/index.html",
"visit_date": "2021-01-19T00:02:00.852762"
} | stackv2 | About...
I love to build maintainable & reliable software with simplicity & performance in mind.
Software engineering is NOT about writing high level machine language with no sense.
Engineering is about using the science in a practical way to innovate, design, build, improve and maintain software systems with the main goal to solving real problems.
To achieve it, we have to build software with simplicity in mind; simple things are easy to understand for other people and that's very important in software engineering, because it makes our software more maintainable.
Making simple things are not easy and only is possible to do achieve for a group of people who collaborate together with no barriers, they are open to provide and receive feedback and they also look for it outside of the group itself.
Experience
I have piled 12 year of working experience in technology.
In chronological order, I worked as help desk and system maintainer, developer in a university research team, programmer analyst for an insurance company and system administrator and IT manager for two non technological companies.
After those and not being satisfied in what I achieved, I moved abroad to work for the new enterprise era (a.k.a startups) as a software engineer.
After I had an experience of designing and building from scratch the whole system for a new business idea for a year, with all the headaches, constraints and lack of resources, I joined as a first paid employee to a high tech visual exploration startup which apply deep learning techniques.
Today I am achieving my goals working as a software engineer for new the new enterprise and spending almost my whole spare time involved with technology for fun and profit.
I keep updating my knowledge with the new appearing technology, I am involved and collaborating with a some tech and open source communities, working in a few side projects and helping to design and build maintainable software for organizations, consolidated companies, startups and individuals.
My Current Stack
It would be to large to write a list of all the systems, data bases, libraries, frameworks, programming languages, etc that I use furthermore I think that it would confusing and it would not say anything about Software Engineering which is in what I am interested than being classified by technology trends.
I used, I am using and I will probably use many of them which existed, are existing and will exist, so I think it is better to apply simplicity here and only mention the ones that nowadays I use in daily basis.
- Golang
- JS for Node & Browsers
- Docker
- Git
If you have arrived here, I would like to hear from you
Your enquiry has been submitted.
I will get back to you soon!
Thanks for your patience.
Unfortunately something went wrong! plesae,
if it fails contact me through social networks (links are at the bottom of the page). |
2024-11-18T17:59:32.609434+00:00 | 2017-02-22T23:44:14 | 9dd627c46286b604c2cd012990ba0644c123ccc7 | {
"blob_id": "9dd627c46286b604c2cd012990ba0644c123ccc7",
"branch_name": "refs/heads/master",
"committer_date": "2017-02-22T23:44:14",
"content_id": "cbd3ace4ebf0bf04be1b8fd4e15f763732c7df26",
"detected_licenses": [
"Apache-2.0",
"BSD-2-Clause"
],
"directory_id": "7db8f7c7771b756f954ca82a771306c213f905eb",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2017-02-23T08:37:54",
"gha_event_created_at": "2021-07-28T07:52:23",
"gha_language": "JavaScript",
"gha_license_id": "NOASSERTION",
"github_id": 82904750,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3797,
"license": "Apache-2.0,BSD-2-Clause",
"license_type": "permissive",
"path": "/utils/switcher/index.html",
"provenance": "stackv2_html-0000.json.gz:10",
"repo_name": "tjenkinson/videojs-contrib-hls",
"revision_date": "2017-02-22T23:44:14",
"revision_id": "fa729cf5ef0d92c8e86e50b1ad17641e712ec7e5",
"snapshot_id": "be822c558c4d8dc3493cb7b647598cfefa030818",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/tjenkinson/videojs-contrib-hls/fa729cf5ef0d92c8e86e50b1ad17641e712ec7e5/utils/switcher/index.html",
"visit_date": "2023-06-19T13:43:54.466368"
} | stackv2 | You can use this page to visualize the behavior of the playlist switcher under different network conditions. It can helpful to understand how tweaks to the switching logic will affect playback.
Timeline
Simulation results will show up here
You can use this page to visualize the behavior of the playlist switcher under different network conditions. It can helpful to understand how tweaks to the switching logic will affect playback.
Simulation results will show up here |
2024-11-18T17:59:32.618940+00:00 | 2020-04-18T15:27:26 | c4b7949b3c9c9c5bd69779f5c8b8e7bf8e7cf4ef | {
"blob_id": "c4b7949b3c9c9c5bd69779f5c8b8e7bf8e7cf4ef",
"branch_name": "refs/heads/master",
"committer_date": "2020-04-18T15:27:26",
"content_id": "13bf045e4a0caf053d9ce29570879057195b70c3",
"detected_licenses": [
"MIT"
],
"directory_id": "6c845be45fb9b50ba0e17bbf101191708d9872a5",
"extension": "html",
"filename": "carer.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 256557597,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3156,
"license": "MIT",
"license_type": "permissive",
"path": "/project/carer.html",
"provenance": "stackv2_html-0000.json.gz:11",
"repo_name": "usmanbabarDev/School-Website",
"revision_date": "2020-04-18T15:27:26",
"revision_id": "cb668916a359bbfabefcc94ae3aa495710fe13bd",
"snapshot_id": "26e29aef31fa5695b4431e89bb363bbb4c1ea344",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/usmanbabarDev/School-Website/cb668916a359bbfabefcc94ae3aa495710fe13bd/project/carer.html",
"visit_date": "2022-04-17T21:52:37.967188"
} | stackv2 | Career
Complete Careers Guidance Management Solutions
Our Schools provides careers guidance management solutions to help you meet statutory guidance, satisfy Ofsted and achieve the Gatsby Benchmarks.
- Intuitive management suites to help you monitor and track your students
- Personalised careers profiles and individual action plans providing evidence of students’ progress
- Group reports to help you evaluate your careers programme
- Everything in one place, providing the perfect audit trail for Ofsted inspections
- Opportunity to improve your destinations data
- Affordable and cost-effective delivery saving you both time and money
- Comprehensive digital careers libraries to provide your students with impartial guidance across the full range of student options
- Ready-made programmes of lesson plans to support delivery and empower your teachers
- Careers reference libraries to engage your parents
- Opportunity to improve your destinations data
Chungi Amer sidhu, Lahore pakistan
Tel: + 92<PHONE_NUMBER>
Fax: + 92<PHONE_NUMBER>0
Email: [email protected] |
2024-11-18T17:59:32.619015+00:00 | 2021-06-17T19:27:57 | 7cd6759969fd36de43030f44d7a99e0bb41c4bab | {
"blob_id": "7cd6759969fd36de43030f44d7a99e0bb41c4bab",
"branch_name": "refs/heads/main",
"committer_date": "2021-06-17T19:27:57",
"content_id": "994d4785ac0245c5837ce96ef620058f7e0483a2",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "2279ba472cf968aa48b02f9a0937b969705e5953",
"extension": "html",
"filename": "package-summary.html",
"fork_events_count": 5,
"gha_created_at": "2021-05-31T18:39:57",
"gha_event_created_at": "2021-06-02T14:52:54",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 372599054,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 11242,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/content/release-doc/2.2.2/api/com/sun/jini/thread/package-summary.html",
"provenance": "stackv2_html-0000.json.gz:12",
"repo_name": "apache/river-site",
"revision_date": "2021-06-17T19:27:57",
"revision_id": "03bc3d5ee71f4e28170fa4b35507eef9bf0de066",
"snapshot_id": "6be49b4a33518bfd7116c844d4a12fdd57305bcc",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/apache/river-site/03bc3d5ee71f4e28170fa4b35507eef9bf0de066/content/release-doc/2.2.2/api/com/sun/jini/thread/package-summary.html",
"visit_date": "2023-06-03T11:44:37.202903"
} | stackv2 | See: Description
| Interface | Description |
|---|---|
| Executor |
Executor is an abstraction for a thread factory or thread pool for
executing actions asynchronously.
|
| TaskManager.Task |
The interface that tasks must implement
|
| Class | Description |
|---|---|
| GetThreadPoolAction |
Provides security-checked access to internal thread pools as a
java.security.PrivilegedAction, to be used conveniently with an
AccessController.doPrivileged or Security.doPrivileged.
|
| InProgress |
This class provides a blocking mechanism that will not proceed while
some operation bounded by this object is in progress.
|
| InterruptedStatusThread |
Common Thread subclass to handle potential loss of
interrupted status.
|
| NewThreadAction |
A PrivilegedAction for creating a new thread conveniently with an
AccessController.doPrivileged or Security.doPrivileged.
|
| ReadersWriter |
An Object to control the concurrent state.
|
| ReadyState |
Utility class used to prevent access to a service before it has completed
its initialization or after it starts to shutdown.
|
| RetryTask | |
| StreamPlugThread |
StreamPlugThread is a utility class that "plugs" two streams,
one input stream and one output stream, together by creating a thread that
repeatedly reads any data available from the input stream and writes it to
the output stream. |
| TaskManager |
A task manager manages a single queue of tasks, and some number of
worker threads.
|
| ThreadPoolPermission |
Permission to use internal thread pools (see GetThreadPoolAction).
|
| WakeupManager |
A Queue of timed tasks.
|
| WakeupManager.ThreadDesc |
Description of a future thread.
|
| WakeupManager.Ticket |
A ticket that can be used for cancelling a future task.
|
| Exception | Description |
|---|---|
| ReadersWriter.ConcurrentLockException |
InterruptedException transformed to a runtime exception.
|
InProgress
) provide synchronization
mechanisms. Others, such as TaskManager
, provide utilities
for managing the creation of multiple threads to do independent tasks.Copyright 2007-2013, multiple authors.
Licensed under the Apache License, Version 2.0, see the NOTICE file for attributions. |
2024-11-18T17:59:32.620359+00:00 | 2023-08-24T12:41:16 | 8e2f2f386be44909b1aab5974eb95c3692e86ee3 | {
"blob_id": "8e2f2f386be44909b1aab5974eb95c3692e86ee3",
"branch_name": "refs/heads/main",
"committer_date": "2023-08-24T12:41:16",
"content_id": "0dee14ea58e7234a3ab9ad24adb5bea9de7ad0e3",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "febe8ff169ad595221b8d794ec3bdc4fedd67687",
"extension": "html",
"filename": "SelectLoginMfaView.scala.html",
"fork_events_count": 6,
"gha_created_at": "2018-08-10T12:40:25",
"gha_event_created_at": "2023-08-31T08:36:37",
"gha_language": "Scala",
"gha_license_id": "Apache-2.0",
"github_id": 144284496,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3374,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/app/views/SelectLoginMfaView.scala.html",
"provenance": "stackv2_html-0000.json.gz:13",
"repo_name": "hmrc/third-party-developer-frontend",
"revision_date": "2023-08-24T12:41:16",
"revision_id": "527e8c0cefa6fe501bfd9c48af0d30292ca6b1a8",
"snapshot_id": "bb95177905313da2a2433350626dcf1149cc7573",
"src_encoding": "UTF-8",
"star_events_count": 6,
"url": "https://raw.githubusercontent.com/hmrc/third-party-developer-frontend/527e8c0cefa6fe501bfd9c48af0d30292ca6b1a8/app/views/SelectLoginMfaView.scala.html",
"visit_date": "2023-08-28T18:48:02.718259"
} | stackv2 | @* * 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 uk.gov.hmrc.thirdpartydeveloperfrontend.domain.models.views.BackButtonWithJavaScript @import views.html.include.DevMain @import uk.gov.hmrc.thirdpartydeveloperfrontend.controllers.routes @import views.html.include.fieldError @import uk.gov.hmrc.apiplatform.modules.mfa.models.MfaId @import uk.gov.hmrc.apiplatform.modules.mfa.forms.SelectLoginMfaForm @this(devMain: DevMain) @(form: Form[SelectLoginMfaForm], authAppMfaId: MfaId, smsMfaId: MfaId)(implicit messages: Messages, request: play.api.mvc.Request[Any], appConfig: ApplicationConfig) @devMain( title = "How do you want to get access codes?", back = BackButtonWithJavaScript, isRegistering = false, developerSession = None ) { @helper.form(action = routes.UserLoginAccount.selectLoginMfaAction()){ @helper.CSRF.formField @fieldError(form.errors, "mfaId") |
2024-11-18T17:59:32.620432+00:00 | 2021-09-02T20:52:26 | b8bca230c9a359066af393caf62ef81d801188c8 | {
"blob_id": "b8bca230c9a359066af393caf62ef81d801188c8",
"branch_name": "refs/heads/development",
"committer_date": "2021-09-02T20:52:26",
"content_id": "e38281a3876a39dfa4d62aea6cb749834b32ebc7",
"detected_licenses": [
"MIT"
],
"directory_id": "05a70c12df808455100598d8a6fdb5635c641ab8",
"extension": "html",
"filename": "Locacion-21.html",
"fork_events_count": 0,
"gha_created_at": "2020-08-23T20:54:55",
"gha_event_created_at": "2021-09-02T20:52:27",
"gha_language": "Python",
"gha_license_id": "MIT",
"github_id": 289764892,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 423,
"license": "MIT",
"license_type": "permissive",
"path": "/Ago-Dic-2019/Ricardo_Romero_Medina/Ordinario/Locaciones/Locacion-21.html",
"provenance": "stackv2_html-0000.json.gz:14",
"repo_name": "Jonathan-aguilar/DAS_Sistemas",
"revision_date": "2021-09-02T20:52:26",
"revision_id": "4d02efc64161871084df1bff258112351e5d1241",
"snapshot_id": "991edcc929c33ba9bb8bc84e741b55c10a8420a3",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/Jonathan-aguilar/DAS_Sistemas/4d02efc64161871084df1bff258112351e5d1241/Ago-Dic-2019/Ricardo_Romero_Medina/Ordinario/Locaciones/Locacion-21.html",
"visit_date": "2023-07-24T12:26:54.698452"
} | stackv2 | Id = 21
Nombre Capitulo = Testicle Monster Dimension
Tipo = Dimension
Dimension = Testicle Monster Dimension
Personaje = ['https://rickandmortyapi.com/api/character/7', 'https://rickandmortyapi.com/api/character/436']
Numero Personaje = ['7', '436']
URL Locacion = https://rickandmortyapi.com/api/location/21 |
2024-11-18T17:59:32.621969+00:00 | 2017-08-27T18:59:04 | 05d61e80cb636ec8ee2467ee2297e75f895de211 | {
"blob_id": "05d61e80cb636ec8ee2467ee2297e75f895de211",
"branch_name": "refs/heads/master",
"committer_date": "2017-08-27T18:59:04",
"content_id": "74c0821c7835c86f807683b2bd06e31e416f541c",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "927519e00769bd518ba20a147665837dfaf6c240",
"extension": "html",
"filename": "templates_manual.html",
"fork_events_count": 0,
"gha_created_at": "2017-08-18T17:01:52",
"gha_event_created_at": "2017-08-27T18:59:05",
"gha_language": "Perl",
"gha_license_id": null,
"github_id": 100733480,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 46873,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/docs/templates_doc/templates_manual.html",
"provenance": "stackv2_html-0000.json.gz:15",
"repo_name": "E69-Heracles/dangerzone",
"revision_date": "2017-08-27T18:59:04",
"revision_id": "03740d4d10cb4ff7747804719416b55450ad291e",
"snapshot_id": "23c1fe265638c8e38826de85d57ca9ab162b7b44",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/E69-Heracles/dangerzone/03740d4d10cb4ff7747804719416b55450ad291e/docs/templates_doc/templates_manual.html",
"visit_date": "2021-01-22T17:48:35.401586"
} | stackv2 | geo_obj.data : Holds most important data. It has 4 main group data:
1) The airfields localization, their damage, the park places, army owner, code name, etc
2) Sector coordinates, type (atackable or not), TTL, army owner, etc
3) City name, coordinates, damage, suply radius, spot Zones, army owner, etc...
4) A list of relation on city and sectors, to know wich sectors has a city and will be not
attacable till city has 50% damage
city.mis : this is a mission file created using FMB (Full Mission Builder). It is the more time consuming file. Here you determine wich cityes are part of the campaign, and make the spot Zones. Each of this spot zone is an atacable place. This file indicates what types of objects will be place, and where they will be placed. It NOT has the objects. The indicators are a combination of aircrafts way points of differen altitudes to represent different objects. (I will explain later). Later generator will put objects "under" those WP lines.
tanks_wp.mis : This is the tank placement template. Each serctor of 10x10 km needs to have 2 or more "points". Later the genator will use 2 of those "points" to place champs and initial 9-tank-group. As you see 2 points at least are needed. More is better, so generator will have more combination of 2 points to pick from, making more umpredictable where champs /moving tanks are placed. Those "points" are static tanks, really do not matter what type the object is, the generator will look objects coordinates (the points). On sectors where is impossible to place 2 tank places, the sector will be un-attacable.
red_obj.mis : A mission that holds one LI-2 per airfield. Nothing more.
blue_obj.mis : Same, but with JU-52, and objects numbers starts with 10000.
frontline.mis: This file holds the frontline status. It has one flag per square, exept for the unattacable sectors.
aircraft.data: This file has the information of plane aviables, type, tasks, airclass, etc etc.
imap.data : This file is a HTML image image to aid target selection at mission creation time. It holds the setors names (and aditionally fields and city names) to be displayed as a popup when placing mouse over front image.
To create templates for a map, all files described above has to be written, each file has
particular conditions to meet. The templates files at firt impresion looks very complex,
but they are not.
I provide in this guide a explanation file by file and some tools to semi-automate template creation. But before start looking onto each file I better explain the difference between "static objects templates" and "places template".
Static objects templates are files created with FMB, they have all the objects of
the map. Usually it holds thouthands of cars, planes, AAA, trains, etc. all spread on a
particular map. Later, when you attack a place, mission generator looks for a set of
objects close to that place you attack, "copy" them and "paste" into the mission it is
created.
This system has advantages and disdvantages. They are easy to build, can take several hours to build them, but later are easy to use for generator program with "copy and paste". The disadvantage is that you cant change object types, you need a red template and a blue template, the objects are all at the same place and after several attacks to same place people can know where is the AAA and where are the jackpots (best place to bomb).
Badc uses 2 static objects templates files: red_obj.mis and blue_obj.mis. They only hold static planes to place on airbases, 1 per base, and used only to make bases display correct color on maps. (no white bases).
Places templates: This templates do not have objects that later will be on mission. They have the "places" where we like to have objects placed. Later the generator will insert the objects in correct place into the mission we are generating. Thats all.
The paces templates are not hard to make, it only needs some convetion (rules) on how those places are marked, to later the generator understand where and how the objects has to be inserted. Badc uses "place" templates for airbases, tank waypoints and city targets. Lets see a general example, later we will see each template details rules.
Lets say we are creating a static template for an airfield, we place several
planes, and can look like this:
After those planes are selected (type) and placed, we have to rotate them one by one and
later align them. Now, lets use the same airfiled, and use the "place template" idea. We
want to have some planes aligned in 2 lines, like is showed in next image:
So later the generator will insert planes like whow next image (they are correct lined up and
rotated, maybe not visible because image size):
So, how do we make those lines to later the generator place the objects? We use
an aircraft (any flyable) and we set waypoints, this way we "draw" lines. Maybe You can
not undestand this the first time you read, but is very easy. When you place a flight, FMB
writes the coordinates of the way points. Placing the waypoints and "drawing" a line with
a plane will make 2 things: tell us where the coordinates are and show us where the
objects will be placed.
Lets see a working example, next image shows several waypoints where I like to place some
planes. I use B-17 aircraft to "draw" those waypoints:
Next image shows how aircrafts are placed:
Compare last 2 images, look the direction of waypoints and how planes are
placed. You will notice that planes always are placed with nose pointing to the right of
the lines. When I say "right" I mean: imagine you stand up on WP0 and look on direction to
WP1, the planes will be looking to the "right" of that direction.
For easy understand I combine those 2 images into a single one and drawed a big red arrow
of the "right" direction. When you make templates you will not see the planes, and you
have to create this image in your mind:
This way place templates works. You just use a mission to place flights, you never place the objects. Trust that later the generator will use that file with flight waypoints to read the coordinates and place the objects as you wish. You can use any plane to "draw" places, it does not matters the army or the type of the plane. Generator will place red static planes if later that base is soviet, or place blue static planes if the base is on german side. Be sure to understand all to this point before read next tips.
To avoid using many flyiable planes and to speed up template creation, we use same
flight to make several places. How? well, generator will look into pairs of
waypoints because we know a line is defined by 2 points. So, when you create you places
you can keep adding points using same flight like show next image:
Those waypoints indicates 3 places: place planes from WP0 to WP1, place planes from WP2 to WP3,
place planes from WP4 to WP5. When you "draw" those waypoints you have to keep pairs of
waypoints. I say to myself when I make those templates:
placing WP0 I think: planes from here
placing WP1 I think: to here
placing WP2 I think: planes from here
placing WP3 I think: to here
placing WP4 I think: planes from here
placing WP5 I think: to here
As you can see, you are free to select srating point between places. In this example, the
lines between WP1 and WP2 will not define a place, its just a relocating line and you have
to ignore it. Same goes for line btween WP3 and WP4.
Really is is very simple after you try several times. Next image shows how planes are
located using the places showed in previous image:
And next image is the combination of both of them, showing what you have to "imagine"
at the moment you "darw" your templates. Remember, it is VERY important you use
pairs or waypoints, because they define the lines. Just remember to use "from here" - "to
here" nemotechnic.
We create templates in several stages (or steps), because some stages needs data from previous stages. For example, the Geo_obj.data contains four (4) main gruopg of data. One of those gropus are the sector definitions, and to write the sectors definition you need to have the tank waypoints. And tank waypoints will be made using a template created after finishing "stage 1", where we define airfields and park places. Dont worry now about this, the only important thing now is to know that there are several "stages".
This semi-automatic template creation uses perl scripts. So you need to have perl installed. If you dont have perl, it will not be possible to make templates as I describe in this manual.
The process of template creation need you to work with FMB, and time to time run some scripts, so to make things easy, create a folder under FB/missions. I usually name the forlder with the name of the map templates im building, do for example to make normandie1 templates I have a folder: "D:\Ubi Soft\IL-2 Sturmovik Forgotten Battles\Missions\normandie1" where I place all the perl scrips and where I will hold template files. Once thy are finished I rename them, adding a 2 or 3 letter code before each file to easy recgnition.
copy all the scrips provided with this manual into a folder you like.
Lets start building templates for Normandie1 map. As described before I place all
scripts into a new folder called normandie. Then I start IL2FB, and load map
"normandie1". The first thing to do is to place a object "airfield champfire" on the
most right-top corner, better just a bit outside last sector number/letter (if you
can, if not place as far you can on top-right of map). This will be used
by scripts to determine the limits of map. Save this file as "initial.mis". This
file now will provide important data: the limits of the map and the map name.
Abobe image shows the "airfield champfire" localization for normandie1 map. This map has at top-right coordinates named O-10, so the "airfield champfire" is located at P-11 sector. Of course, P-11 cordinates are not displayed on FMB. This top right square will have different coordinates on different maps.
This new file initial.mis will hold the data of airfields, besides other information I told. For each airfield on map we like to use for campaign, we need to colect several information: The coordinates of the location, the 2 headings for take off and landing, the orientation of runway, the "places" where we will like to put parked planes and the place for a static plane to be used a airfield army identification.
All this data is colected by adding 3 objects to each airfiels:
When you have all this 3 object placed, you select other airfield and repeat process
adding a new JU-52, a B17 with 2 waypoints (one take-off other landing), and other B17 to
"draw" the parking places. Next image shows a screen shot with those 3 objects for an
airfield.
Time to time you will like to check how planes are placed, if the orientation is correct, if you have correct pairs of WP for the park places, and so on. To see a preview of your work, run the script "view_bases.pl". This script will read your "initial.mis" file and create a new file called "preview_bases.mis". Load this file into FMB and check how planes are placed. This script will print an error if you have even (not pairs) amount of waypoints. The preview will only display german planes, like if the base is under german control, later the generator will place greman or soviet planes.
Remember to keep working on "initial.mis". It is a common mistake to load the preview, and then keep adding Ju-52, park places and toff/land WP to the preview mission. The preview mission is just that, a mission to look how yor waypoints will be read by generator. The important file is "initial.mis". After you inspect the preview mission remmenber to load back "initial.mis" to keep working on.
Next picture is how you see a base in preview_base.mis. Notice that the static JU-52
will not be showed. The preview mission only display the "aircrafts park places".
This is how looks an error message when you try to make a preview and the waypoints
amount are not pairs. When this happens you have to load "initial.mis" on FMB and search
where is located the problem. A recomendation is to do a preview every time you finish a
base. So if there is a problem with pairs WP, the problem will be always in the last base
you was working. Aditionally, error will display what line number is the one making even
waypoints, so if you like you can manual delete that line, by editing "initial.mis" in a
text editor. (not recomended, better look the WP in FMB).
This is all we need to finish first stage, a "initial.mis" with a champfire, and each base with 3 objects. Once you are used to make this bases, each base will not take more than a couple of minutes. The way I work in doing first adding the filedchamp, the I add all JU-52 to all bases I like to use, so they are a visual aid to find bases. Later I add all take-off and landing waypoints using a B-17 for each base. This way, when I look all the map, I have to see "something blue" (the ju-52) and "something red" (the b17 waypoints). Finally I add the parking places to each base, doing some previews time to time.
If you look into the initial.mis I provide as example you will see frontline markers. You do not need them yet. Is something we will add in next stages, explained later.
Now we are ready to run 1_stage.pl script. (run in a cmd window: perl -w 1_stage.pl). This will create 5 files:
If you are curious, you can look into geo_obj.data just created, there you can see
several lines with the onformation of each airfield. For example this are the lines
representing the airfiled is showded on above example images . That information is: airfield
general information (first line), Heading coordinates (AF06:Hx), followed by several lines with
parking places coordinates and angle for plane placements (AF06:Px)
AF06,aerodromo--D03,38788.61,29109.76,2,-D,03,2,0:2 AF06:H1,38048.61,28764.76, AF06:H2,39530.43,29455.75, AF06:P1,38451.23,29622.01,38526.13,29846.98,378, AF06:P2,38509.59,29613.09,38578.11,29816.26,378, AF06:P3,39102.59,29655.61,39159.29,29544.57,152, AF06:P4,39185.28,29124.04,38982.10,29024.82,243, AF06:P5,38386.74,29213.82,38443.44,29383.92,378, AF06:P6,38625.36,29535.12,38665.52,29639.07,381, #--- End AF06 (aerodromo--D03)
Don worry if you dont understand this information, you dont need to understand it to
keep woring on templates.
The tank template holds "points" where generator will later place a defense champ (some static objects, AAA, and static tanks) or a group of moving tanks (the attacking group). Each sector needs at least 2 "points" so it will be possible to place both goups, one in each point. More points places are welcome, so generator later can pick diferent combinations of them, making missions less repetitive. The amount of "points" recomended for each sector is up to 5, and no less than 3 to make some variations on selection.
There are some sectors where tanks can not move. For example sea, lagoons, sectors covered by forest, etc. On this sectors we will place 0 points, that is, there will be no starting points, and sectors become un-attacable.
Go to FMB and load the mission "tank_wp.mis" created on first stage. You will see
something like this (showed only a small part):
You can see on all sectors 5 tanks, one on each corner and one more in sector center. This file is created in this way for speed edit. Is more easy to delete and move objects alrready lpaced on mission. Each of those static tanks you see are the "points". Like on paking places we use flight for later place objects, here we use a static tank to indicate the coordinates of where a camp, or a group of moving tanks will be placed. In that image I named sectors with numbers 1 to 4, just for easy reference on this manual.
Previous image shows 4 sectors. The very first thing to do is delete all 5 points from
unattacable sectors(sea, lagoons and only forest sectors). Later, you have to relocate
points based on simple rules. The points (actually tanks on this template) needs to be not
very close. All of them has to be inside the sector, no river, lagoon, city or forest has to
intercept their path. If you cant place all 5 of them, try deleting some of them for easy
find correct places. Next image shows how edited those points. Sector named 1 is
un-attacable (sea) and deleted all 5 points. Sector named 2 has 4 points, sector named 3
has 5 points and sector named 4 has only 3 points:
As you can see, all points meet requeriments. Now I will show a mage with incorrect
point placement. I will add some lines to conect them, and place a red dot over green
lines to show a problem. Those lines have to be done in your mind when you are moving
points.
Sector named as 1 has one point in other side of river. Sector named 2 has poins incorrect
placed because the run into a city. Sector named 3 are correct, but two points are too
close, so is recomended to move one of them a bit away, like the red line show. Sector
named 4 has two paths runing into forest. On next image I show how this points are
corrected:
You have to check sector by sector point placement. Make sure that sectors has at least 2 waypoints, but a minimum of 3 is recomended. Also be sure to not place points outside sector. For work more confortable, zoom in and out so the grid lines only display 10x10 squares. It is also recomndable for areas with hils and mountains to look exacltly the place you are placing a point, so you avoid to place them on hill precipices.
This template takes some time, when you are used to work with it, you can make several
sectors in a minute. The more important thing is to make unatacable the sectors that cant
hold tanks points. The other sectors can be edited or corrected later (problem with hills,
or a point on other side of river, etc..)
Now we start with city template. This template will hold the cityes that will like to
include as targets. Only one city per sector. City cant be closer to 10km each
other. Load city.mis into FMB. The first thing to do is to place a "observation ballon
90m" object over each city we like to include. This way we easy check that we dont place 2
city too close. Next image shows how the template looks after adding several cityes. The
lines are drawed only to show the distance you have check
After you finish, you have to zoom close to each city and add several "champfires"
objects. Each champfire will be an "attacable zone", add at least one and up to 9
zones for each city. All places marked with a fire (zones) has to be close to the city,
never place them in a distance bigger than 5 km. Also, each target place zone needs to be
1 km or more seperated from any other zone. So, you leave room to place objects and not
overlap them. Next image shows a city with 3 zones (3 fires), all of them inside 5km
limit, and all of them seperated at least 1km from other fires.
Place more zones on more important cityes (5 or 6 is ok) and less zones on small towns
(2 or 3 is ok). Once you finish placing fire zone markers, you have to place objects on
each of them. Next images shows one zone with objects and remaining others still empty.
The way to place objects is very simmilar to the method described as "place templates". In fact, is the same with a few more options. You have to draw pair of waypoints. Those pair of waypoints indicates the line where objects will be placed. But now we have a extra fearture. Using the altitude of the wp we can indicate different objects types. Think like the waypoints is a pencil, and the altitude is the pencil type. So, with different altitudes we can "draw" diferent objects.
Again, no matter what plane you use to draw places. But now is very important to use
the correct altitude to represent the objects you want to place. Usually I use a
german plane (blue wp) to "draw" the AAA places, and I use a red flight to "draw" vehicles
places. And usually for each zone I use diferent flights for diferent targtes. For
example, with one B17 I draw all vehicles parallel to lines (WP altitude 500). I place
about 10 up to 20 waypoints, so I "draw" 5 to 10 places. Then I insert a new B17 flight,
set Wp alt to 1000 and place several vehicles rotated to "right". If there is a railroad,
i inser a new B17 flight, set wp to 1500 and add all trains. Finally I add a german flight
(any, usually I use JU-87) and insert several AAA places. Next image shows how a target
looks.
As before, you have a script to preview how targets will be read by generator. This
script is called "view_city.pl" and will read city.mis (the file you are working on) and
create a new file called "preview_city.mis". After adding one or more zones, run the
script and then load into FMB the preview mission. Check how targets are placed, if all
what you planned to add is in correct place, etc... Like before, dont make the mistake to keep adding zones into the preview
mission. This script also will tell if there was a porblem with even (not pair)
waypoints. Next image shows the previe of the zone showed before as example.
And this next image shows the combination of previous 2 images, there you can see the
objects placed on the lines you are drawin. This is what you have to try imagine when
adding points. Note that all targets on preview are red objects, but later, generator will
place correct army places based on who is the ownler of the city.
Ok, now we are ready to run 2nd stage script. This script will read both templates
(tanks_wp and city templates) and add information to geo_obj.data file. The
information added is:
Sector information, lines like:
SEC-E08,sector--E08,45000,75000,30,1:0 SEC-E09,sector--E09,45000,85000,30,1:3 etc...
# Name F08 SUC02,SUM-city-F08,53945.30,73549.92,-,-,-,-,-:0 CT02,city-F08,53945.30,73549.92,25,tipo,TOTAL_ZONES_HERE,0,25:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1
poblado,city-H07,sector--H07 poblado,city-F08,sector--F08 poblado,city-I04,sector--I04
For example, city on normadie1 map, at sector-F08 is Bayeux so we make this
changes on geo_obj.data:
Initial lines afected:
# Name F08 SUC02,SUM-city-F08,53945.30,73549.92,-,-,-,-,-:0 CT02,city-F08,53945.30,73549.92,25,tipo,TOTAL_ZONES_HERE,0,25:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1 . .(other lines) . poblado,city-F08,sector--F08 . .
# Bayeux F08 SUC02,SUM-Bayeux,53945.30,73549.92,-,-,-,-,-:0 CT02,Bayeux,53945.30,73549.92,40,tipo,3,0,40:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1 . . . poblado,Bayeux,sector--F08 . .
Notice I changed the text "TOTAL_ZONES_HERE" by the amount of zones, this case is
3. Aditionally I like to set Bayeux with a max suply radius of 40 kilometer instead of 25
km default. So I changed both "25 values" to 40. Those values are the max suply radius
and the current suplay radius (because damage is 0 both values are equal).
Once you finish adding all names and seting correct amount of zones and initial suply radius, you have to define what will be the initial frontline of campaign and make all objects on goe_obj.data file be "sincronized" to the initial frontline.
To acomplish this, load the "initial.mis" and place some blue/red front markers. Save the file and finally run the 3_stage.pl script. This script will read the frontline you just set on initial.mis and will create a frontline.mis template. It also will sincronize the geo_obj.data file. Now, we are almost done.
The aircraft.data file has the definition for each aircraft you are interested to place into campaign. Also this file holds information on squadron names and static planes and static vehicles. Lines starting with a numeral (#)are ignored.
There is no automatic way to create this file, so open a new file in text editor and write them following next indications and later save it as aircrafts.data.
Next lines indicates that russian fighters squadron can be 176IAP or 3IAK. Selection will be random. Jabo task will have 11IAP squadron and Transports(suply) and bombers (suply) will be 34BAP squadron. For german fighters will be from I_JG3,II_JG3,I_JG27 squadrons,bombers will use Stab_KG27a,I_KG27a,II_KG27a,III_KG53a squadrons, and so on. Other lines like this describe diferent squadrons for other country/task combinations. When there is more than one definition, a random one is picked. At least one squadron must be present for a existent country+task definition.
##--red sqds rusfig=176IAP,3IAK; rusjab=11IAP; rusbom=34BAP; rustrp=34BAP; gerfig=I_JG3,II_JG3,I_JG27; gerjab=I_LG2; gerbom=Stab_KG27a,I_KG27a,II_KG27a,III_KG53a; gertrp=KGrzbV102a; romfig=Eskadrila54; romjab=Eskadrila54; rombom=Eskadrila54;The squadron names cant be any you like. They have to be exactly the same used by FB game. If you plan to add sqadron names, be sure they are aviable on FB. Later, this file contains plane description and are comma seperated values a colon the task and plane amount. The fields are in order:
army, country+task, name of plane, class air, loadout, fuel, crusier alt, crusier speed : task, number,
The tasks are:
BA : Bomber Attack. Group of bombers attacking city or airfields.
SUM: SUply Mission. Group of transport planes, doing suply mission task
BD: Bomber Defend. Group og defending bombers, attacking the incoming enemy tanks
EBA: Escort BA bombers
ESU: Escort SUply transports
EBD: Escort BD bombers
ET: Escort Tanks. When you attack a sector, planes doing air cover and intercept enemy BD
INT: INTercept. In general, intercept enemy Suply transports and enemy BA.
The number is the amount of planes of that type and and is equal for each entry. (not manadatory)
Here is how looks a entry for a P-40 bomber/fighter:
(NOTE INTERCEPT TAK IS A SINGLE "I" not "INT" as described above)
# P40-E 1,rusjab,P-40E,1,air.P_40E,500lb,100,3000,400:BD,6, 1,rusfig,P-40E,1,air.P_40E,500lb,100,3000,400:ET,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:EBA,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:EBD,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:ER,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:I,6,
To get classair names, open FMB, load any small map, for example online1. Then insert a
plane you like to get the air class name. Let say FW190-A8, so insert a flight of that
plane with weapons default. Then insert another one FW190-A8 and set this one with a bomb
load you like to use, for example SC500. Save the mission whith any name, for example
call it airnames.mis (you can insert more flights of other airclass you will need).
Open this mission with a text editor, you will see something like this:
[MAIN] MAP Net1Summer/load.ini TIME 12.0 CloudType 0 CloudHeight 1000.0 army 1 playerNum 0 [Wing] g0101 g0100 [g0101] Planes 1 Skill 1 Class air.FW_190A8 Fuel 100 weapons default [g0101_Way] NORMFLY 15421.69 25085.94 500.00 300.00 [g0100] Planes 1 Skill 1 Class air.FW_190A8 Fuel 100 weapons 1sc500 [g0100_Way] NORMFLY 15421.69 23440.96 500.00 300.00 [NStationary] [Buildings] [Bridge] [House]
There you can see that the class air is: air.FW_190A8
The default loadout is default
The bombload loadout is: 1sc500
Ok, lets build this FW190-A8 entry using default loadouts, and 1SC500 bomb for bomber
defense (BD) , and set 45/300 planes. First write a single line, for intercept
task:
2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45,
Those values are:
2 = axis side
gerfig = 3 leters country + 3 leters code
FW-190A8 = is the name of the plane to be displayed on briefings, reports and stats
1 = because is human flyable
air.FW_190A8 = is the class air you just find as explainded above
default = is the loadout
100 = is the fuel load
3000 = is the crousier altitude
400 = is the criusier speed
: is a separator
I = intercpet task (NOTE that is a single letter, not 3 letter "INT")
45 is the plane amount number
, final comma
When you have that line, copy and paste several lines (4 more) to get this:
2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45,
Finaly change so you have EBA EBD ET BD tasks, set 1sc500 loadout for ET and BD tasks.
reduce crusier altitude to 1000 meters and set gerjab code for defensive bombing (BD): I
usually add a comented (#) line with the name and other info at begining:
# FW-190A8 45/300 planes as Pirx table for map bla-bla at year xxxx ... 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:EBA,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:EBD,45, 2,gerfig,FW-190A8,1,air.FW_190A8,1sc500,100,3000,400:ET,45, 2,gerjab,FW-190A8,1,air.FW_190A8,1sc500,100,1000,400:BD,45,
If you investigate other load outs, you will know that mk108 guns on FW-190A8 is named
"r22mk108" so you maybe like to add those for intercept task. Just change default by
r22mk108 on Intercpet task line, so it looks this way:
2,gerfig,FW-190A8,1,air.FW_190A8,r22mk108,100,3000,400:I,45,
Repeat this method for other planes. I usually make a mission (airnames.mis) where I insert all planes I will need with several loadouts. So later I open the mission to read all air.class data and all loadouts I need. In your case, maybe you need P51, P38, P47, 109-G6, B25 etc etc... place all of them on you airnames.mis using FMB.
Later on this file we have static planes distribution and static vehicles distributions.
The static planes line are like this:
ST100,1,I153,vehicles.planes.Plane$I_153_M62,15:150 ST101,1,I16,vehicles.planes.Plane$I_16TYPE24,15:350 ST102,1,IL2,vehicles.planes.Plane$IL_2_1940Late,20:400 ST103,1,LaGG3,vehicles.planes.Plane$LAGG_3SERIES4,15:500And the fields are:
The number are acumulative values, and last static plane has to have the number 1000.
they have to be in order, for the example avobe: we have 150 I-153 per 1000 planes, the we
have 200 (350-150) I-16type24, the we have 50 (400-350) Il2 1940, then we have 100
(500-400) LaGG3 and so on. Notice that mixed with staic planes we have some fuel trucks,
they will be placed like planes, simulating fuel loading.
Finally the static vehicles definition. This is almost the same like static planes, useing
acumulative values frecuency up to 1000. Here some examples for blue side vehicles
SV201,2,VW82,vehicles.stationary.Stationary$VW82,15:80 SV202,2,VW82t,vehicles.stationary.Stationary$VW82t,15:160 SV203,2,OpelKadett,vehicles.stationary.Stationary$OpelKadett,15:260 SV204,2,OpelBlitz36S,vehicles.stationary.Stationary$OpelBlitz36S,15:340 SV205,2,OpelBlitz6700A,vehicles.stationary.Stationary$OpelBlitz6700A,15:440 SV206,2,Kettenkrad,vehicles.stationary.Stationary$Kettenkrad,15:500And the fields are:
The image to be used is BMP 24bits/pix image you have to make with a program of preference. Take several screenshots to the map in the FMB. Later edit and resize to get 900 pixels with. You can use other sizes, but is not recomended more than 900 width because performance and server load. Smaller can be to hard to see information. Always use a divisible by 4 width, because scripts do not handle padding. Add to the image the names of the cityes. Lets call this image NM1.BMP. Later use a tool to create the image map file (lets call it imap.data). GIMP has a nice imagemap editor.
When you build the image, count how many pixels per sector you have. Later you need that information to be written into config.pl (explained later). For example, if your image has 900 pixels width and the map has 15 sectors, the count for pixels per sectors is 60. Maybe one less because maps have partial sectors at end, where are cordinates.
The image map is just a html file, pointing to the image (not this one, point to a
default "front.jpg" ) and later the map definition, like this:
<br> <p> Use the map to find the name of the area of attack </p> <IMG SRC="/images/front.jpg" WIDTH=xxx HEIGHT=xxx BORDER=0 alt="" USEMAP="#map"> <MAP NAME="map"> <AREA SHAPE="RECT" COORDS="0,31,46,77" HREF="./no_click.html" alt="sector--A16"> . . (other imap lines) . </MAP>Note that you have to set width and height. usually the imagemap tool does that.
initial.mis -> NM1_initial.mis (this is not longer used, but saveit just in case) geo_obj.data -> NM1_geo_obj.data red_obj.mis -> NM1_red_obj.mis blue_obj.mis -> NM1_blue_obj.mis tank_wp.mis -> NM1_tank_wp.mis city.mis -> NM1_city.mis frontline.mis -> NM1_frontline.mis aircrafts.data -> NM1_aircrafts.data NM1.BMP -> NM1_000.BMP (000 is just to say it is original map image). imap.data -> NM1_imap.data
Now you have to add this map information to the config.pl file. First define a map name ($MAP_NAME_LONG), a
short text with some clear info of map. After that several lines has to be included inside
a if condition:
1) The map image information
2) The tank types to be used as defense and attack for both armyes, and AAA precense
3) The file names for this map.
4) The plane list to be used on this map. (for takeslot.pl form printing)
The MAP_NAME_LOAD (in our example is Normandy/load2.ini) can be extracted by looking into
any template just created. Open with a text editor and dind the line that starts with
"MAP" then copy the information it follows.
$MAP_NAME_LONG="Normandie. June 1944"; if ( $MAP_NAME_LONG eq "Normandie. June 1944") { # 1 . map image information $ANCHO=900; # NM1_000.bmp image width in pixels $ALTO=600; # NM1_000.bmp image height in pixels $H_BLOCK_PIX=60; # horizontal sector size in pixels $V_BLOCK_PIX=60; # vertical sector size in pixeles $LETRAS=16; # map sector letters, 1 in excess (Normandie1 last is O, that is 15) $NUMEROS=11; # map sector numbers, 1 in excess (Normandie1 last number is 10) # 2. tank types and aaa placement $ALLIED_TANKS_ATTK="Armor.3-BT7"; $AXIS_TANKS_ATTK="Armor.3-PzIIIG"; $ALLIED_TANKS_DEF="vehicles.artillery.Artillery\$BT7"; # notice "escaped $" $AXIS_TANKS_DEF="vehicles.artillery.Artillery\$PzIIIG"; # notice "escaped $" $AAA_IN_CHAMPS=0; # place or not place AAA on field champs $LATE_AAA_IN_CHAMPS=0; # place or not place advanced AAA, like nimrod and M16 # 3. file names $GEOGRAFIC_COORDINATES="NM1_geo_obj.data"; $FRONT_LINE="NM1_frontline.mis"; $RED_OBJ_FILE="NM1_red_obj.mis"; $BLUE_OBJ_FILE="NM1_blue_obj.mis"; $CITY_PLACES="NM1_city.mis"; $TANKS_WP="NM1_tank_wp.mis"; $FRONT_IMAGE="NM1_000.bmp"; $IMAP_DATA="NM1_imap.data"; $MAP_NAME_LOAD="Normandy/load2.ini"; $FLIGHTS_DEF="MM1_aircrafts.data"; # 4 . data for takeslot.pl planes names shuld be the exact same used in aircrafts.data) @VVS_SUM_PLANES=("Li-2","TB3-4M-34R"); @VVS_BA_PLANES=("IL2 series1","IL2 series2","SB-2M100A","SB2-M103","SU-2","TB3-4M-34R"); @VVS_AI_PLANES=("Li-2","IL-4-DB3B","PE-2 1940","R-10","SB-2M100A","SB2-M103","SU-2"); @LW_SUM_PLANES=("HE-111H2","JU-52"); @LW_BA_PLANES=("BF-110C4B","HE-111H2","JU-87B2","JU-88A4"); @LW_AI_PLANES=("JU-52","BF-110C4B","JU-88A4"); }
The values on VVS_SUM_PLANES, VVS_BA_PLANES, VVS_AI_PLANES are the suply allowed planes, the bomber attack planes and the AI planes list.Same goes for LW_* fields with axis planes. All this values are used on take_slot.pl to make the plane selection form at creation of missison. The names of the planes needs to be exactly the same as is writed on aircrafts.data file. The ones I printe in example are not for normandie, they are just an example.
When you set the ATTACK tanks types, be sure to include in a variable name called
(TANK_REGEX) a string to identify them. For example if you add KV1 tanks, you have to make
this line:
$TANK_REGEX="Pz|T34|ValentineII|BT7|M4A2|T70"; # tank string identification use | as separatorlook now like:
$TANK_REGEX="Pz|T34|ValentineII|BT7|M4A2|T70|KV1"; # tank string identification use | as separator
Notice that defence tanks names, the static ones, has an escaped $, by adding a backslash before $.For example, the FB object name for a static BT7 is: vehicles.artillery.Artillery$BT7 and you have to add the backslash before the $ simbol, like this: vehicles.artillery.Artillery\$BT7.
For sure the templates take longs to be done, and several files has to be edited, created and changed. After all files are done, you have to test if they are correct, for example, all planes are used, all city and suply city targets are present, the front image and suply image are correclty created, and so on.
I will release more templates, the ones we will use in bellum: Kursk, Smolenk and Balaton. I will not make more templates that the mentioned before. All questions are welcome and for sure I will help to any with template building. At least to the ones they prove have spent some time to understand this manual (besides my bad english) :).
Use the Bellum forum for questions (http://il2fb-bellum.com.ar/foro) and help with problems with templates you are making (If possible provide files you are working on).
Note: I know that small FB maps can work with badc, but I really dont know if generator/parser can handle big maps, those that has 2 letters per sector. (finland, crimea, etc..)
Thats all. :) |
2024-11-18T17:59:32.624851+00:00 | 2021-02-26T01:47:22 | fc6f739c09c15f97643468ade45b1c544e9ca3fb | {
"blob_id": "fc6f739c09c15f97643468ade45b1c544e9ca3fb",
"branch_name": "refs/heads/main",
"committer_date": "2021-02-26T01:47:22",
"content_id": "28eda6e0a940bdb3295c06aa9a7ba413a44efad5",
"detected_licenses": [
"MIT"
],
"directory_id": "6b48cca5873cff360feff1306b0635ec572ea82d",
"extension": "html",
"filename": "RentACar.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 342418304,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6886,
"license": "MIT",
"license_type": "permissive",
"path": "/views/RentACar.html",
"provenance": "stackv2_html-0000.json.gz:16",
"repo_name": "Smit24-git/CarRental",
"revision_date": "2021-02-26T01:47:22",
"revision_id": "afabbdfdbcdb010ffe18ea607ae37d133a87d04e",
"snapshot_id": "a7cadd5a8aa3e3e1b25e85604a3f28bd7f035a18",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Smit24-git/CarRental/afabbdfdbcdb010ffe18ea607ae37d133a87d04e/views/RentACar.html",
"visit_date": "2023-03-09T22:02:35.320092"
} | stackv2 | CarsWorld.com
Login
Login
Sign Up
Log Out
Car Name
Are you sure you want to rent this car?
Yes
No
Home
View Car Collection
Compare Cars
Rent a Car
Driving Test [Required]
Rent Car
Sort By:
Name A-Z
Name Z-A
Rent ↑
Rent ↓ |
2024-11-18T17:59:32.640945+00:00 | 2020-06-21T01:46:22 | e232461e5534b8cfbd268b768533b25fe8865a9f | {
"blob_id": "e232461e5534b8cfbd268b768533b25fe8865a9f",
"branch_name": "refs/heads/master",
"committer_date": "2020-06-21T01:46:22",
"content_id": "1a05507f5045372bd08ec12eab744788abd85afc",
"detected_licenses": [
"MIT"
],
"directory_id": "1325b86a5a81283bd268d03d8143cb1d0e03a531",
"extension": "html",
"filename": "recognition.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9886,
"license": "MIT",
"license_type": "permissive",
"path": "/recognition.html",
"provenance": "stackv2_html-0000.json.gz:17",
"repo_name": "MattTengtrakool/QuaranGreenWebsite",
"revision_date": "2020-06-21T01:46:22",
"revision_id": "d30aa03d34eb87ae4bb66e53aea473a3c7c480d0",
"snapshot_id": "456b559c8a82316af07ef5181440eeabc677d36a",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/MattTengtrakool/QuaranGreenWebsite/d30aa03d34eb87ae4bb66e53aea473a3c7c480d0/recognition.html",
"visit_date": "2023-03-17T10:48:12.787846"
} | stackv2 | The Power of Youth Challenge, which is made possible through support from the Charles Stewart Mott Foundation, encourages and inspires youth-led remote service projects related to COVID-19 that young people can lead safely from home. QuaranGreen was awarded a mini-grant and guidance from the America's Promise Campaign.
The K4C Program is the bridge between ideas and action. This program provides teens inspiration and financial support to take their ideas and burgeoning projects to the next, increasingly impactful level. These young people are citizen leaders, endeavoring to make and already making a difference in our world. By helping build and better the communities in which they live, they help repair our world. QuaranGreen was honored with a rapid-response COVID-19 grant to expand the organiation.
TThe Young Leaders grant program is geared towards groups led by young adults. Working with the Grass Roots Fund, QuaranGreen has made environmental sustainability and produce security at the cornerstone of its mission, a student-led practice that defines the endurance of young community aid.
In tandem with trainings, mentorship, and peer-to-peer grantee hubs and support groups, The Pollination Project fosters collaboration among grantees and community partners through our global network, providing a wellspring of support to grassroots innovators through financial and non-financial means. QuaranGreen is a proud member of this community and is honored to be awarded the Polination Projects Grant.
Peace First launched a rapid response grant process to help young people around the world lead projects that address community impacts of COVID-19. QuaranGreen started with the kickstarting mini-grant recieved from the PeaceFirst foundation and it grateful for all of the support provided as a part of the PeaceFirst family. |
2024-11-18T17:59:32.641034+00:00 | 2018-05-10T14:36:53 | 4d65c416d60f961a385fc7caecefc21c0cfeb4fa | {
"blob_id": "4d65c416d60f961a385fc7caecefc21c0cfeb4fa",
"branch_name": "refs/heads/master",
"committer_date": "2018-05-10T14:36:53",
"content_id": "250047e32b9532a556fe07342cf4b6b54f1a7dea",
"detected_licenses": [
"MIT"
],
"directory_id": "ff52725cd19fddb7cb3bde5186f512da4a637a84",
"extension": "html",
"filename": "fav-music.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 120779183,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1229,
"license": "MIT",
"license_type": "permissive",
"path": "/2-20-18/fav-music.html",
"provenance": "stackv2_html-0000.json.gz:18",
"repo_name": "jhunyee/misy350-s18-exercises",
"revision_date": "2018-05-10T14:36:53",
"revision_id": "02811ce6d2ea19fec11180c32d30dc03b138fd51",
"snapshot_id": "6415e86e46c830825c68961b3d54349c492b1ba1",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jhunyee/misy350-s18-exercises/02811ce6d2ea19fec11180c32d30dc03b138fd51/2-20-18/fav-music.html",
"visit_date": "2021-05-02T11:28:57.853977"
} | stackv2 | I listen to a lot of different kinds of music, ranging from Rap and Hip-Hop to Indie Rock. I am also a big fan of kpop (korean pop). |
2024-11-18T17:59:32.642825+00:00 | 2017-10-29T12:18:36 | b406114c5f5a7a1b1b9aa2f63f978c3b2ff29a80 | {
"blob_id": "b406114c5f5a7a1b1b9aa2f63f978c3b2ff29a80",
"branch_name": "refs/heads/master",
"committer_date": "2017-10-29T12:18:36",
"content_id": "07aefe10cc28d9c3d273e1471b988e8ce1092615",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "2a41b60eb4b7b3556c02add0a74597d6510a8ccf",
"extension": "html",
"filename": "2967.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 86565828,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6046,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/com/radityalabs/Python/origin/movie/2967.html",
"provenance": "stackv2_html-0000.json.gz:19",
"repo_name": "radityagumay/BenchmarkSentimentAnalysis_2",
"revision_date": "2017-10-29T12:18:36",
"revision_id": "e509a4e749271da701ce9da1d9f16cdd78dcdf40",
"snapshot_id": "fe66d9e7baf561a932bfd0205c47d1d44cb6e6fa",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/radityagumay/BenchmarkSentimentAnalysis_2/e509a4e749271da701ce9da1d9f16cdd78dcdf40/com/radityalabs/Python/origin/movie/2967.html",
"visit_date": "2020-12-31T07:09:31.676010"
} | stackv2 | PULP FICTION [Spoilers] A film review by Jules N. Binoculas Copyright 1994 Jules N. Binoculas
No doubt many will say that PULP FICTION is one of the year's greatest films--how many will say it's one of cinematic history's most offensive? How many have the guts?
Nor is offensive because the film's director himself appears in an extended cameo to remind his two lead actors that his house is "not a dead nigger storage" facility.
Don't get the wrong idea; these are the film's strengths!
When 19th Century British iconoclast and literary prankster, Oscar Wilde was testifying in his own defense for writing offensive literature--he was asked, "Mr. Wilde, do you feel that work was immoral?," he answered, "It was worse than that. It was badly written."
PULP FICTION is not offensive because it tries to be cute. Call it what you will, but call it "baaad!"
It's probably good manners for your humble reviwer to summarize the plot of this warped and anaemic ego-trip:
A black hitman and a white hitman murder three Causcasian burger-eating adolescents living in a cheesy la-apartment (one of whom bears a frightening resemblance to an uncredited Jerry Seinfeld (believe it or not).
They take a black hostage because the black assassin feels that, although they were shot at close range by the Seinfeld-look-alike, the bullets miraculously only put holes in the wall behind them because God intervened to save their candy a*ses.
Next, they visit Quentin Tarantino, playing a Caucasian suburban Southern California husband married to an African-American nurse who's due home any minute, and would be deeply offended to see a "dead nigger stored in the garage."
To make a 2-hour-and-44-minute story shorter:
Harvey Keitel shows up in black tie and tuxedo to order the hitmen to put the corpse in the trunk, and clean the car to remove blood and "small pieces of brain and skull" with household disinfectants.
During all the unfolding excitement, the white hitman finds time to take his (black) boss's white wife out dancing in a 50's retro drive-in juke joint before she overdoses but survives after heroic medical instructions from Travolta's neurotic (white) drug dealer.
There's probably another subplot, but you get the idea.
Here's the big secret: QT is way over his head! The film is an (amazingly) sometimes humorous non-stop rip-off of every 20th Century media cliche imaginable--complete with no context, no soul, no pacing, no proportion, and no ideas!
Be sure to see it--if you want to encourage independent filmmakers to continue their anal-ysis of modern culture!
Rating: **** (4 assholes)
(Making this film was obviously a ploy to drive up the price of silver used in all the release prints/)
Final recommendation: Hand over your $ and enjoy making others rich!
.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews |
2024-11-18T17:59:32.652031+00:00 | 2023-08-30T02:00:35 | 6cc420bb7cc179ba1b030c1816df3f98212df9f9 | {
"blob_id": "6cc420bb7cc179ba1b030c1816df3f98212df9f9",
"branch_name": "refs/heads/master",
"committer_date": "2023-08-30T02:00:35",
"content_id": "b76cd274c760200ec7cb7db43adf3dbaf7ab1ce7",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "afda17d7310a47142511c9f5d9d9a0a05cfe1ceb",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2019-09-27T13:26:58",
"gha_event_created_at": "2022-12-08T06:38:43",
"gha_language": "Python",
"gha_license_id": "BSD-2-Clause",
"github_id": 211325233,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 71226,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/docs/reports/2023/03/22/index.html",
"provenance": "stackv2_html-0000.json.gz:20",
"repo_name": "jpstroop/issue-reporter",
"revision_date": "2023-08-30T02:00:35",
"revision_id": "449728cbf92cc73c8134d10da4aca29868cd6aa8",
"snapshot_id": "7d325f46c3dcddd4bf0aad9eedf2f07d959fdad3",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jpstroop/issue-reporter/449728cbf92cc73c8134d10da4aca29868cd6aa8/docs/reports/2023/03/22/index.html",
"visit_date": "2023-08-30T21:17:12.164006"
} | stackv2 | @sandbergja I think you might be onto something with your ssh question. Just tried doing this manually and got this error:
pulsys@appdeploy1:~$ sudo su - deploy
deploy@appdeploy1:~$ ssh<EMAIL_ADDRESS>The authenticity of host 'dss-staging1.princeton.edu (<IP_ADDRESS>)' can't be established.
ECDSA key fingerprint is SHA256:y+WbY2eLsmAUj3LsEwECIfQGTj82gg/JHG/bMsAiIbA.
Are you sure you want to continue connecting (yes/no)? yes
Warning: Permanently added 'dss-staging1.princeton.edu' (ECDSA) to the list of known hosts.
Load key "/home/deploy/.ssh/id_rsa": invalid format
<EMAIL_ADDRESS>password:
@sandbergja I noticed that I CAN ssh from appdeploy1 to dss-staging1 if I use the right key, though: ``` deploy@appdeploy1:~/.ssh$ ssh -i CodeDeployKey<EMAIL_ADDRESS>Welcome to Ubuntu 22.04.2 LTS (GNU/Linux 5.15.0-60-generic x86_64)
Support: https://ubuntu.com/advantage
Introducing Expanded Security Maintenance for Applications. Receive updates to over 25,000 software packages with your Ubuntu Pro subscription. Free for personal use.
https://ubuntu.com/pro Last login: Wed Mar 22 14:42:49 2023 from <IP_ADDRESS> ```
mentioned
by Jane Sandberg at 2023-03-22 17:47:38.subscribed
by Jane Sandberg at 2023-03-22 17:47:38.mentioned
by Jane Sandberg at 2023-03-22 17:54:25.subscribed
by Jane Sandberg at 2023-03-22 17:54:25.assigned
by None at 2023-03-22 16:16:00.labeled
by Kevin Reiss at 2023-03-22 16:44:18.unlabeled
by Kevin Reiss at 2023-03-22 16:45:11.referenced
by Kevin Reiss at 2023-03-22 18:19:44.merged
by Kevin Reiss at 2023-03-22 18:19:44.closed
by Kevin Reiss at 2023-03-22 18:19:45.head_ref_deleted
by Kevin Reiss at 2023-03-22 18:19:46.assigned
by Cliff Wulfman at 2023-03-22 12:57:52.review_requested
by Cliff Wulfman at 2023-03-22 14:02:58.https://thesis-central.princeton.edu was released in the production network this morning.
closed
by James R. Griffin III at 2023-03-22 13:53:54.This was confirmed as completed by the reporting user.
closed
by James R. Griffin III at 2023-03-22 13:55:02.I have not been receiving this e-mail on a weekly basis (as I was). I will look to reopen this on SN@P.
This is being actively advanced using a new SN@P ticket, https://princeton.service-now.com/now/workspace/agent/record/incident/8b148fe4873de954731f322d0ebb3583
unassigned
by James R. Griffin III at 2023-03-22 13:55:56.assigned
by James R. Griffin III at 2023-03-22 14:59:59.referenced
by Max Kadel at 2023-03-22 15:04:18.merged
by Max Kadel at 2023-03-22 15:04:19.closed
by Max Kadel at 2023-03-22 15:04:19.head_ref_deleted
by Max Kadel at 2023-03-22 15:04:20.deployed to prod
closed
by Kevin Reiss at 2023-03-22 16:10:51.deployed
by None at 2023-03-22 16:29:01.deployed
by None at 2023-03-22 16:30:31.deployed
by None at 2023-03-22 16:42:19.referenced
by Bess Sadler at 2023-03-22 18:01:01.merged
by Bess Sadler at 2023-03-22 18:01:01.closed
by Bess Sadler at 2023-03-22 18:01:01.head_ref_deleted
by Bess Sadler at 2023-03-22 18:01:02.closed
by Robert-Anthony Lee-Faison at 2023-03-22 18:09:37.referenced
by Bess Sadler at 2023-03-22 18:10:15.merged
by Bess Sadler at 2023-03-22 18:10:15.closed
by Bess Sadler at 2023-03-22 18:10:15.head_ref_deleted
by Bess Sadler at 2023-03-22 18:10:16.referenced
by Bess Sadler at 2023-03-22 18:22:17.merged
by Bess Sadler at 2023-03-22 18:22:17.closed
by Bess Sadler at 2023-03-22 18:22:17.head_ref_deleted
by Bess Sadler at 2023-03-22 18:22:18.closed
by Bess Sadler at 2023-03-22 18:22:19.referenced
by Bess Sadler at 2023-03-22 18:35:25.merged
by Bess Sadler at 2023-03-22 18:35:25.closed
by Bess Sadler at 2023-03-22 18:35:25.head_ref_deleted
by Bess Sadler at 2023-03-22 18:35:26.referenced
by Bess Sadler at 2023-03-22 20:40:36.merged
by Bess Sadler at 2023-03-22 20:40:36.closed
by Bess Sadler at 2023-03-22 20:40:36.head_ref_deleted
by Bess Sadler at 2023-03-22 20:40:37.referenced
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.merged
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.closed
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.head_ref_deleted
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:22.head_ref_force_pushed
by Francis Kayiwa at 2023-03-22 20:11:27.labeled
by Kevin Reiss at 2023-03-22 18:30:08.labeled
by Kevin Reiss at 2023-03-22 18:30:08.labeled
by Kevin Reiss at 2023-03-22 21:50:17.labeled
by Kevin Reiss at 2023-03-22 21:50:17.labeled
by Kevin Reiss at 2023-03-22 21:50:17.unassigned
by James R. Griffin III at 2023-03-22 13:53:01.assigned
by James R. Griffin III at 2023-03-22 14:58:49.referenced
by Bess Sadler at 2023-03-22 16:36:48.merged
by Bess Sadler at 2023-03-22 16:36:48.closed
by Bess Sadler at 2023-03-22 16:36:48.head_ref_deleted
by Bess Sadler at 2023-03-22 16:36:49.This seems to have reoccurred on 03/22/23 (please see the discussion thread beginning with https://pulibrary.slack.com/archives/C02PHG9MGU8/p1679501056444349)
Please see https://github.com/pulibrary/pdc_discovery/issues/400 for reference.
The following ConfigSets are available:
deploy@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/configs?action=LIST&omitHeader=true"
{
"configSets":["_default",
"cdh_shxco",
"geniza",
"figgy-production",
"oawaiver-production",
"reserves",
"pdc-discovery-production",
"dpul",
"catalog-production-v2",
"lae",
"cicognara",
"libwww",
"pulmap",
"cdh_ppa",
"pulfalight-production",
"dss-production"]}
Attempting to add a replica node for the existing shard1
failed, as the recovery for the newly-added node is also failing:
The first attempt to invoke REINDEXCOLLECTION
failed due to a server timeout, however, the second (invoked asynchronously) seems to be successful thus far:
pulsys@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/collections?action=REINDEXCOLLECTION&name=pdc-discovery-production-2&target=pdc-discovery-production-4&async=pdc-disc-reindex2"
pulsys@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/collections?action=REQUESTSTATUS&requestid=pdc-disc-reindex2"
{
"responseHeader":{
"status":0,
"QTime":0},
"status":{
"state":"running",
"msg":"found [pdc-disc-reindex2] in running tasks"}}
Once this has been finished, I believe that I should be able to update the Solr Cloud alias for pdc-discovery-production
While the new Solr Collection was created, the Solr Documents were not migrated:
mentioned
by Hector Correa at 2023-03-22 16:16:23.subscribed
by Hector Correa at 2023-03-22 16:16:23.assigned
by James R. Griffin III at 2023-03-22 16:16:32.assigned
by Hector Correa at 2023-03-22 16:16:41.Manually running the reindex in production took care of these issue, the 4 records are now available in PDC Discovery: * dsp01gt54kr255 * dsp01fq977z011 * dsp01c247dw32c * dsp01j098zf33b
We did notice that the problem is only in production, the four records were already in staging. The culprit seems to be that we have an extra condition in production that is stopping the process.
The reindex task calls the delete index task and that is not allowed in production.
labeled
by James R. Griffin III at 2023-03-22 15:56:08.assigned
by Hector Correa at 2023-03-22 18:52:05.So, I am able to deploy to pas staging locally without making any changes. I suspect the Princeton and Slavery issue may be different from the DSS issue.
referenced
by Max Kadel at 2023-03-22 18:34:24.merged
by Max Kadel at 2023-03-22 18:34:24.closed
by Max Kadel at 2023-03-22 18:34:24.head_ref_deleted
by Max Kadel at 2023-03-22 18:34:25.referenced
by Francis Kayiwa at 2023-03-22 17:33:25.closed
by Max Kadel at 2023-03-22 18:34:25.referenced
by Christina Chortaria at 2023-03-22 21:50:00.merged
by Christina Chortaria at 2023-03-22 21:50:00.closed
by Christina Chortaria at 2023-03-22 21:50:01.head_ref_deleted
by Christina Chortaria at 2023-03-22 21:50:02.referenced
by Trey Pendragon at 2023-03-22 15:40:36.merged
by Trey Pendragon at 2023-03-22 15:40:36.closed
by Trey Pendragon at 2023-03-22 15:40:37.head_ref_deleted
by Trey Pendragon at 2023-03-22 15:40:38.same issue happend with special_collections
labeled
by Kevin Reiss at 2023-03-22 18:22:13.labeled
by Kevin Reiss at 2023-03-22 18:23:46.labeled
by Kevin Reiss at 2023-03-22 18:24:55.Closes #1971
deployed
by None at 2023-03-22 22:15:14.referenced
by Max Kadel at 2023-03-22 15:37:37.merged
by Max Kadel at 2023-03-22 15:37:37.closed
by Max Kadel at 2023-03-22 15:37:37.head_ref_deleted
by Max Kadel at 2023-03-22 15:37:39.referenced
by Bess Sadler at 2023-03-22 16:17:49.merged
by Bess Sadler at 2023-03-22 16:17:50.closed
by Bess Sadler at 2023-03-22 16:17:50.head_ref_deleted
by Bess Sadler at 2023-03-22 16:17:51.This machine connects successfully from the rails console.
also related: https://app.honeybadger.io/projects/65922/faults/82765616#notice-summary
okay it's not connecting from rails console now.
From Lyrasis support:
Sorry about that Anna, we put a new firewall rule in place to rate limit logins to help defend against brute-force attacks, and apparently that's picking up Arclight.
For some reason Arclight does the login thing once a second.
I'll make a change to the rules on the server.
You might just want to double check with Arclight about that login rate, once a second seems surprising.
In this case the source of all the traffic was the PACSCL discovery harvester.
labeled
by None at 2023-03-22 13:25:58.labeled
by None at 2023-03-22 13:25:58.closed
by None at 2023-03-22 15:35:28.labeled
by None at 2023-03-22 15:35:38.deployed
by None at 2023-03-21 23:01:01.referenced
by Christina Chortaria at 2023-03-22 12:39:30.merged
by Christina Chortaria at 2023-03-22 12:39:30.closed
by Christina Chortaria at 2023-03-22 12:39:30.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:31.Looks like vm2 is up-to-date now, so this is no longer needed.
closed
by None at 2023-03-22 12:40:11.head_ref_deleted
by None at 2023-03-22 12:40:13.head_ref_force_pushed
by None at 2023-03-22 12:40:27.deployed to prod
assigned
by Kevin Reiss at 2023-03-21 23:21:44.closed
by Kevin Reiss at 2023-03-22 16:11:45.referenced
by Christina Chortaria at 2023-03-22 12:39:10.merged
by Christina Chortaria at 2023-03-22 12:39:10.closed
by Christina Chortaria at 2023-03-22 12:39:10.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:11.deployed to prod
assigned
by Kevin Reiss at 2023-03-21 22:31:23.closed
by Kevin Reiss at 2023-03-22 16:13:40.referenced
by Christina Chortaria at 2023-03-22 12:39:54.merged
by Christina Chortaria at 2023-03-22 12:39:54.closed
by Christina Chortaria at 2023-03-22 12:39:54.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:55.closing this branch failed to deploy because of https://github.com/pulibrary/pul_library_drupal/issues/1978
closed
by Kevin Reiss at 2023-03-22 16:14:38.deployed to prod
closed
by Kevin Reiss at 2023-03-22 16:15:45.head_ref_force_pushed
by James R. Griffin III at 2023-03-22 14:35:09.convert_to_draft
by James R. Griffin III at 2023-03-22 14:37:32.head_ref_force_pushed
by James R. Griffin III at 2023-03-22 14:52:12.ready_for_review
by James R. Griffin III at 2023-03-22 14:56:37.review_requested
by James R. Griffin III at 2023-03-22 14:57:00.review_requested
by James R. Griffin III at 2023-03-22 14:57:01.referenced
by Hector Correa at 2023-03-22 15:46:33.merged
by Hector Correa at 2023-03-22 15:46:33.closed
by Hector Correa at 2023-03-22 15:46:33.head_ref_deleted
by Hector Correa at 2023-03-22 15:46:34. |
2024-11-18T17:59:32.654567+00:00 | 2021-02-13T05:31:05 | 37b38f26e85c7849b239fcad8e74e7520ed04298 | {
"blob_id": "37b38f26e85c7849b239fcad8e74e7520ed04298",
"branch_name": "refs/heads/master",
"committer_date": "2021-02-13T05:31:05",
"content_id": "5ec82a08e4d019640f15276f51dd318be9782542",
"detected_licenses": [
"MIT"
],
"directory_id": "0feeca5ccb525310e8794501b731714ccfa20eca",
"extension": "html",
"filename": "me.conorthedev.peep.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 263300014,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 4248,
"license": "MIT",
"license_type": "permissive",
"path": "/depictions/web/me.conorthedev.peep.html",
"provenance": "stackv2_html-0000.json.gz:21",
"repo_name": "elprofesor1160/killem",
"revision_date": "2021-02-13T05:31:05",
"revision_id": "6a70e2c97011e2e3e3d755333c2abdc77431c30c",
"snapshot_id": "5da0923059f49934c5ede3c011a5e9e373bddf37",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/elprofesor1160/killem/6a70e2c97011e2e3e3d755333c2abdc77431c30c/depictions/web/me.conorthedev.peep.html",
"visit_date": "2023-03-03T04:42:13.345741"
} | stackv2 | Developer
ConorTheDev
Compatibility: This package is compatible with iOS iOS 12.0 to 13.4.1.
peep is a tweak that allows you to temporarily hide your status bar by tapping on it. It only works on the homescreen and lockscreen at the moment.
The settings instantly apply without the need to respring your device!
Current preference options:
Notes:
🎉 Initial Release! |
2024-11-18T17:59:32.656893+00:00 | 2015-03-19T09:41:01 | 9f6396465e9e0056c947ce29a17f2e6bd966d2f8 | {
"blob_id": "9f6396465e9e0056c947ce29a17f2e6bd966d2f8",
"branch_name": "refs/heads/master",
"committer_date": "2015-03-19T09:41:01",
"content_id": "ae3f2f1296e0037d1e8e0c7f4a6c9eb4a9f50ac5",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "f2c94f27ab6c97689183f62de1d2bffd1d4a5de2",
"extension": "html",
"filename": "template.html",
"fork_events_count": 1,
"gha_created_at": "2015-03-18T17:09:28",
"gha_event_created_at": "2015-04-20T13:23:26",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 32472678,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 4749,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/template.html",
"provenance": "stackv2_html-0000.json.gz:22",
"repo_name": "PulseCheck/PulseCheck-Email-Template",
"revision_date": "2015-03-19T09:41:01",
"revision_id": "03c14b5c1961f5f503a7b74f83c21f4946328b52",
"snapshot_id": "c2d0bef54a4531bc6a9754fbc89050e2fb7f9495",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/PulseCheck/PulseCheck-Email-Template/03c14b5c1961f5f503a7b74f83c21f4946328b52/template.html",
"visit_date": "2016-09-09T18:27:46.017674"
} | stackv2 |
Jesus look at all of the new we have created. Much News .Very Wow. Can't even handle it, louis guns are out. Bullets and such things: |
2024-11-18T17:59:32.680411+00:00 | 2017-12-10T07:09:19 | 2e7d3398ccea973c8040b7912f216a8df7656ec5 | {
"blob_id": "2e7d3398ccea973c8040b7912f216a8df7656ec5",
"branch_name": "refs/heads/master",
"committer_date": "2017-12-10T07:09:19",
"content_id": "0da6233ec49b26682c196a05d7cf1e18b193ac9c",
"detected_licenses": [
"MIT"
],
"directory_id": "7cabe328b5377a6654f8b4cc1a5c532ef4e4aa10",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 42533633,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9267,
"license": "MIT",
"license_type": "permissive",
"path": "/_site/languages/index.html",
"provenance": "stackv2_html-0000.json.gz:23",
"repo_name": "ChristopherSalam/blog",
"revision_date": "2017-12-10T07:09:19",
"revision_id": "f3217487b5ee03ea2de454cea77da2471bc7b7bb",
"snapshot_id": "b3f92f4f3850472517e3c3139dd627cca42c26b5",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ChristopherSalam/blog/f3217487b5ee03ea2de454cea77da2471bc7b7bb/_site/languages/index.html",
"visit_date": "2020-12-25T17:24:13.859766"
} | stackv2 | languages
Even if we all speak a different language we find a way to communicate
The cool icons you see on this page can be found here.
I am preparing for software engineering interviews outside of JavaScript ( ).
Links for job seekers | Languages
While attending a bootcamp you do run into a bit of the dogma surrounding as the Language of the Future .
That's all fine and dandy and perhaps true to some extent, but low and behold we live in the present. And in the present, I've got these annoying interviews asking me about the other languages.
So I've started work on them. Some questions deal with whether language is interpreted and compiled.
Compiled vs. Interpreted Languages.
This is a pretty common question so let's be somewhat exhaustive.
Compiled languages require a compiler (a translator) that convert source code into machine code pre-runtime.
Examples of compiled languages include all family languages, such as , (which compiles to Intermediary Language (IL) then is just-in-time (JIT) compiled to Assembly language), Objective-C , D, Erlang , Go, Haskell , Java , Lisp (can be both), Scala , and Swift in addition to the ones on this list.
Advantages of Compiled Languages
- (1) They run very quickly, as opposed to translated/interpretation.
- (2) Opportunity to apply powerful optimizations during the compile stage.
Disadvantages of Compiled Languages
- (1) Writing a compiler is difficult.
- (2) Code can't be run without compilation
Interpreted or scripted languages have instead of a compiler the ability to process the language on the machine and the code is read step by step.
Advantages of Interpreted/Scripted Languages
- (1) Platform independent, i.e. being standalone.
- (2) Reflection, which means you can use the language to inspect and fix itself.
- (3) Dynamic typing which means that types can be set at runtime.
- (4) Dynamic scoping which I'm going to leave to wikipedia
- (5) Generally a smaller executable program size.
Disadvantages of Interpreted/Scripted Languages
- (1) Bugs from a lack of static type-checking
- (2) Susceptibility to code injection attacks
- (3) Slower execution except where JIT takes place
- (4) Can be read and copied in the case of commercial advantages (bleh)
Examples of Intrepreted Languages are and other languages in the EMCAscript tree (like ActionScript, JScript). This is understanding that doesn't have to be interpreted. Chrome uses compiled just-in-time(JIT), Perl , PHP , Python , Lisp (can be both), Ruby , and R and the other languages here.
HTML is the markup language most web pages and applications have some small bit of. Angular began a process of creating special unique elements, but d3 and other frameworks were making and other elements on the page prior to that. New frameworks such as React don't even use or the DOM until reading a object containing all information of what should be in the DOM (the Shadow DOM) and that allows diff evaluations to take place such that only the changes to the Shadow DOM will be rendered to the DOM.
This is a stub, there's more coming |
2024-11-18T17:59:32.681820+00:00 | 2022-07-14T23:07:33 | 07de69c836487e2314c8b1249a0f07aa2cc641d8 | {
"blob_id": "07de69c836487e2314c8b1249a0f07aa2cc641d8",
"branch_name": "refs/heads/main",
"committer_date": "2022-07-14T23:07:33",
"content_id": "45c3c2ff7e6bdc8055be880c250712caac69ccf5",
"detected_licenses": [
"MIT"
],
"directory_id": "02db1304b280677ccdf6bf4902e40590c094f0bc",
"extension": "html",
"filename": "admin.html",
"fork_events_count": 53,
"gha_created_at": "2017-11-14T14:31:56",
"gha_event_created_at": "2023-02-04T02:14:32",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 110701087,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2897,
"license": "MIT",
"license_type": "permissive",
"path": "/src/docroot/main/toplevel/admin.html",
"provenance": "stackv2_html-0000.json.gz:24",
"repo_name": "arnehilmann/markdeck",
"revision_date": "2022-07-14T23:07:33",
"revision_id": "f8ea0b937afce76d0d61e8518325a61f46e90265",
"snapshot_id": "c9a65d94e0a8087cbf0e194fadb9d1d4c501eb65",
"src_encoding": "UTF-8",
"star_events_count": 1185,
"url": "https://raw.githubusercontent.com/arnehilmann/markdeck/f8ea0b937afce76d0d61e8518325a61f46e90265/src/docroot/main/toplevel/admin.html",
"visit_date": "2023-09-02T02:31:31.649960"
} | stackv2 | markdeck v0.60.1
Convert Slides into PDF
Disclaimer: Tested with Google Chrome on MacOS only right now.
- Click render pdf.
- Wait for a fresh browser window to open.
- Wait for the "Choose what to share" dialog.
- Select "Chrome Tab".
- Select "* * * MARKDECK PDF RENDERING * * *".
- Click "Share".
- Wait for the rendering to finish.
- The pdf can be found in the Download location of your browser.
Note: Keep the area of the new window clear! (Screenshots will be taken! Hide your mouse, too!)
More Links
Some helpful resources
(icons, emojis, ...)
The markdeck repo at github
Versions
pandoc 2.18
• revealjs 4.3.1
• impressjs 1.1.0
• asciinemaplayer v2.6.1
• mermaid 9.0.0 |
2024-11-18T17:59:32.683525+00:00 | 2023-06-02T09:44:34 | 503ffe0dca76b848e875cf313ed83ea0fd84b3e6 | {
"blob_id": "503ffe0dca76b848e875cf313ed83ea0fd84b3e6",
"branch_name": "refs/heads/master",
"committer_date": "2023-06-02T09:44:34",
"content_id": "d737c942ebd254753e29b95843a8c2011eed7658",
"detected_licenses": [
"MIT"
],
"directory_id": "3c77e28d2e578f1d960ff49d2bcab2cbc737014c",
"extension": "html",
"filename": "defence-2-1.html",
"fork_events_count": 3,
"gha_created_at": "2017-03-15T12:08:19",
"gha_event_created_at": "2023-06-02T09:44:35",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 85067901,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9450,
"license": "MIT",
"license_type": "permissive",
"path": "/app/views/prototypes/features-to-be-built/defendant/task-list/your-defence/defence-2-1.html",
"provenance": "stackv2_html-0000.json.gz:25",
"repo_name": "hmcts/cmc-prototype",
"revision_date": "2023-06-02T09:44:34",
"revision_id": "feb394529a132c77dd87d30f2ad3bd83ce36a148",
"snapshot_id": "b526f8aea778ab11485d225262ea4424d81d2ea1",
"src_encoding": "UTF-8",
"star_events_count": 6,
"url": "https://raw.githubusercontent.com/hmcts/cmc-prototype/feb394529a132c77dd87d30f2ad3bd83ce36a148/app/views/prototypes/features-to-be-built/defendant/task-list/your-defence/defence-2-1.html",
"visit_date": "2023-06-08T08:14:43.852644"
} | stackv2 | {% extends "layout_task-list.html" %} {% block page_title %} Money Claims Prototype {% endblock %} {% block home_link %} ../../task-list {% endblock %} {% block proposition_header %} {% set my_account="1" %} {% include "includes/propositional_navigation.html" %} {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} {% if data.return_page and data.return_page.includes('check-and-send') or data.return_page and data.return_page.includes('check-your-answers')%} {% else %} {% endif %} {{formData | safe}} Add your timeline of events Their timeline Date What happened 03/11/2017 I contacted {% if data.counterclaim=="true" %}Jan Clark{%else%}Mary Richards{% endif %} to discuss building works on our roof. 06/11/2017 We agreed what work should be done and signed a contract. 30/11/2017 The work started on the roof. 21/12/2017 The work on the roof was completed but I noticed that there was a problem with one section. 27/12/2017 I sent an email to Mary Richards and asked them to get the problem fixed. 15/01/2018 I hadn't had a reply so I told them I would be making a money claim. 27/12/2017 I sent an email to Mary Richards and asked them to get the problem fixed. 15/01/2018 I hadn't had a reply so I told them I would be making a money claim. Show more Show less Add your timeline of events (optional) Include dates if you know them. To change the order of your timeline, drag the entry up or down. Explain what happened Date For example, March 2021 What happened For example, you might have signed a contract Action {{data['cd-timeline-1']}} Remove Add new Add new Add any comments about their timeline (optional) {{data['defence-disagree-timeline']}} {% if data.return_page and data.return_page.includes('check-and-send') or data.return_page and data.return_page.includes('check-your-answers')%} Cancel {% else %} {% endif %} {% block page_scripts %} {% endblock %} {% include 'prototypes/prototype-oct-2019/includes/contact.html' %} {% endblock %}
Include dates if you know them.
To change the order of your timeline, drag the entry up or down. |
2024-11-18T17:59:32.683748+00:00 | 2020-09-04T16:46:41 | 3acffdd3cb028f226176d66cbfb9355d847d7ba8 | {
"blob_id": "3acffdd3cb028f226176d66cbfb9355d847d7ba8",
"branch_name": "refs/heads/master",
"committer_date": "2020-09-04T16:46:41",
"content_id": "571791d9907d0ddd50ad5d0ada65e4c287d2cbae",
"detected_licenses": [
"MIT"
],
"directory_id": "fa8b1bb8b278f56599fb5a3c03092564d34069b5",
"extension": "html",
"filename": "48.html",
"fork_events_count": 0,
"gha_created_at": "2020-09-04T16:21:25",
"gha_event_created_at": "2020-09-04T16:21:25",
"gha_language": null,
"gha_license_id": "MIT",
"github_id": 292894326,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 22920,
"license": "MIT",
"license_type": "permissive",
"path": "/SC-Sample-Dataset/SC-Dataset-Sample/docsource/42/48.html",
"provenance": "stackv2_html-0000.json.gz:26",
"repo_name": "MarkFuller1/SurfClipse-Replication-Package-WCRE2014",
"revision_date": "2020-09-04T16:46:41",
"revision_id": "2d00508c72fd7248750a4e3d43ca594c5caa1873",
"snapshot_id": "8050e0f12f2ec20b47dab968be9c717cc8855be6",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/MarkFuller1/SurfClipse-Replication-Package-WCRE2014/2d00508c72fd7248750a4e3d43ca594c5caa1873/SC-Sample-Dataset/SC-Dataset-Sample/docsource/42/48.html",
"visit_date": "2022-12-09T23:59:55.712566"
} | stackv2 | |
|
|
| javaprepare.com
your tool for Java Certification |
home | tutorial | questions | test 1 | test 2
Mock Exam 2 for SCJP 6
The mock exam is modeled on the Sun Certification for Java Programmer SCJP 6 exam. The exam has 29 questions. The real exam may be a little tougher than this. You need to score 58.33% correct answers to clear the real exam. Please let us know at ngabrani AT hotmail dot com if you find any issues with this exam. Some differences between this and the real exam are given below.
- The real exam will be tougher than this.
- The real exam will have 60 questions. This one has only 29
- The real exam would have more programmatic questions. Questions of the type - "what will happen when this code is compiled".
- Which of the following are Java keywords? Select the three correct answers.
- external
- implement
- throw
- void
- integer
- private
- synchronize
- unsigned
- Which of the following are legal definitions of the main method that can be used to execute a class. Select the one correct answer.
- public void main(String args)
- public static int main(String args[])
- public static void main(String args[])
- static public void MAIN(String args[])
- public static void main(string args[])
- public static void main(String *args)
- Which of these are legal array declarations or definitions? Select the two correct answers.
- int[] []x[];
- int *x;
- int x[5];
- int[] x = {1,2,3};
- Name the collection interface used to represent a sequence of numbers in a fixed order.
- The class Hashtable is used to implement which collection interface. Select the one correct answer.
- Table
- List
- Set
- SortedSet
- Map
- What gets printed when the following program is compiled and run? Select the one correct answer.
class test {
public static void main(String args[]) {
int i;
do {
i++;
}
while(i < 0);
System.out.println(i);
}
}
- The program does not compile as i is not initialized.
- The program compiles but does not run.
- The program compiles and runs but does not print anything.
- The program prints 0.
- The program prints 1.
- What gets printed when the following program is compiled and run? Select the one correct answer.
class xyz {
static int i;
public static void main(String args[]) {
while (i < 0) {
i--;
}
System.out.println(i);
}
}
- The program does not compile as i is not initialized.
- The program compiles but does not run.
- The program compiles and runs but does not print anything.
- The program prints 0.
- The program prints 1.
- What gets printed when the following program is compiled and run? Select the one correct answer.
class xyz {
public static void main(String args[]) {
int i,j,k;
for (i = 0; i < 3; i++) {
for(j=1; j < 4; j++) {
for(k=2; k<5; k++) {
if((i == j) && (j==k))
System.out.println(i);
}
}
}
}
}
- 0
- 1
- 2
- 3
- 4
- Using up to four characters what is the Java representation of the number 23 in hex?
- What gets printed when the following program is compiled and run? Select the one correct answer.
class test {
static boolean check;
public static void main(String args[]) {
int i;
if(check == true)
i=1;
else
i=2;
if(i=2) i=i+2;
else i = i + 4;
System.out.println(i);
}
}
- 3
- 4
- 5
- 6
- The program does not compile because of the statement if(i=2)
- Select the one correct answer. The smallest number that can be represented using short primitive type in Java is -
- 0
- -127
- -128
- -16384
- -32768
- The smallest number is compiler dependent.
- Given the following declarations, which of the assignments given in the options below would compile. Select the two correct answers.
int i = 5;
boolean t = true;
float f = 2.3F;
double d = 2.3;
- t = (boolean) i;
- f = d;
- d = i;
- i = 5;
- f = 2.8;
- What gets printed when the following program is compiled and run. Select the one correct answer.
public class incr {
public static void main(String args[]) {
int i , j;
i = j = 3;
int n = 2 * ++i;
int m = 2 * j++;
System.out.println(i + " " + j + " " + n + " " + m);
}
}
- 4 4 8 6
- 4 4 8 8
- 4 4 6 6
- 4 3 8 6
- 4 3 8 8
- 4 4 6 8
- Given two non-negative integers a and b and a String str, what is the number of characters in the expression str.substring(a,b) . Select the one correct answer.
- a + b
- a - b
- b - a - 1
- b - a + 1
- b - a
- b
-
What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
char ch;
String test2 = "abcd";
String test = new String("abcd");
if(test.equals(test2)) {
if(test == test2)
ch = test.charAt(0);
else
ch = test.charAt(1);
}
else {
if(test == test2)
ch = test.charAt(2);
else
ch = test.charAt(3);
}
System.out.println(ch);
}
}
- 'a'
- 'b'
- 'c'
- 'd'
-
What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
int i,j=0;
for(i=10;i<0;i--) { j++; }
switch(j) {
case (0) :
j=j+1;
case(1):
j=j+2;
break;
case (2) :
j=j+3;
break;
case (10) :
j=j+10;
break;
default :
break;
}
System.out.println(j);
}
}
- 0
- 1
- 2
- 3
- 10
- 20
- What is the number displayed when the following program is compiled and run.
class test {
public static void main(String args[]) {
test test1 = new test();
System.out.println(test1.xyz(100));
}
public int xyz(int num) {
if(num == 1) return 1;
else return(xyz(num-1) + num);
}
}
- Which of the following statements are true. Select the one correct answer.
- Arrays in Java are essentially objects.
- It is not possible to assign one array to another. Individual elements of array can however be assigned.
- Array elements are indexed from 1 to size of array.
- If a method tries to access an array element beyond its range, a compile warning is generated.
- Which expression can be used to access the last element of an array. Select the one correct answer.
- array[array.length()]
- array[array.length() - 1]
- array[array.length]
- array[array.length - 1]
- What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
int[] arr = {1,2,3,4};
call_array(arr[0], arr);
System.out.println(arr[0] + "," + arr[1]);
}
static void call_array(int i, int arr[]) {
arr[i] = 6;
i = 5;
}
}
- 1,2
- 5,2
- 1,6
- 5,6
- Which of the following statements are correct. Select the one correct answer.
- Each Java file must have exactly one package statement to specify where the class is stored.
- If a Java file has both import and package statement, the import statement must come before package statement.
- A Java file has at least one class defined.
- If a Java file has a package statement, it must be the first statement (except comments).
-
What happens when the following program is compiled and then the command "java check it out" is executed. Select the one correct answer.
class check {
public static void main(String args[]) {
System.out.println(args[args.length-2]);
}
}
- The program does not compile.
- The program compiles but generates ArrayIndexOutOfBoundsException exception.
- The program prints java
- The program prints check
- The program prints it
- The program prints out
- What all gets printed when the following code is compiled and run. Select the three correct answers.
class test {
public static void main(String args[]) {
int i[] = {0,1};
try {
i[2] = i[0] + i[1];
}
catch(ArrayIndexOutOfBoundsException e1) {
System.out.println("1");
}
catch(Exception e2) {
System.out.println("2");
}
finally {
System.out.println(3);
}
System.out.println("4");
}
}
- 1
- 2
- 3
- 4
- A program needs to store the name, salary, and age of employees in years. Which of the following data types should be used to create the Employee class. Select the three correct answers.
- char
- boolean
- Boolean
- String
- int
- double
- To make a variable defined in a class accessible only to methods defined in the classes in same package, which of the following keyword should be used. Select the one correct answer.
- By using the keyword package before the variable.
- By using the keyword private before the variable.
- By using the keyword protected before the variable.
- By using the keyword public before the variable.
- The variable should not be preceded by any of the above mentioned keywords.
- In implementing two classes Employee and Manager, such that each Manager is an Employee, what should be the relationship between these classes. Select the one correct answer.
- Employee should be the base class of Manager class.
- Manager should be the base class of Employee class.
- Manager class should include the Employee class as a data member.
- Employee class should include Manager class as a data member.
- The Manager and Employee should not have any relationship.
- Select the one most appropriate answer. What is the purpose of method parseInt defined in Integer class.
- The method converts an integer to a String.
- The method is used to convert String to an integer, assuming that the String represents an integer.
- The method is used to convert String to Integer class, assuming that the String represents an integer.
- The method converts the Integer object to a String.
- What should be done to invoke the run() method on a thread for an object derived from the Thread class. Select the one correct answer.
- The run() method should be directly invoked on the Object.
- The start() method should be directly invoked on the Object.
- The init() method should be directly invoked on the Object.
- The creation of the object using the new operator would create a new thread and invoke its run() method.
- What is the default priority of a newly created thread.
- MIN_PRIORITY (which is defined as 1 in the Thread class.)
- NORM_PRIORITY (which is defined as 5 in the Thread class.)
- MAX_PRIORITY (which is defined as 10 in the Thread class.)
- A thread inherits the priority of its parent thread.
Answers to Sample Test 2
- c, d, f
- c. The main method must be static and return void. Hence a and b are incorrect. It must take an array of String as argument. Hence e and f are incorrect. As Java is case sensitive, d is incorrect.
- a, d
- List
- e. The collection interface Map has two implementation HashMap and Hashtable.
- a. Local variables are not initialized by default. They must be initialized before they are used.
- d. The variable i gets initialized to zero. The while loop does not get executed.
- c. During various iterations of three loops, the only time i, j and k have same values are when all of them are set to 2.
- 0x17 or 0X17.
- e. The statement "i=2" evaluates to 2. The expression within the if block must evaluate to a boolean.
- e. The range of short primitive type is -32768 to 32767.
- c,d. Java does not allow casts between boolean values and any numeric types. Hence a is incorrect. Assigning double to a float requires an explicit cast. Hence b and e are incorrect.
- a
- e
- b. Both Strings test and test2 contain "abcd" . They are however located at different memory addresses. Hence test == test2 returns false, and test.equals(test2) returns true.
- d. The for loop does not get executed even once as the condition (i < 0) fails in the first iteration. In the switch statement, the statement j = j +1; gets executed, setting j to 1. As there is no break after this case, the next statement also gets executed setting j to 3.
- 5050. The recursive function xyz essentially sums up numbers 1 to num. This evaluates to (num * (num + 1))/2.
- a. Java supports assignment of one array to another. Hence b is incorrect. Array elements are indexed from 0. Hence c is incorrect. A method that accesses array elements out of its range does not generate a compilation error. Hence d is incorrect.
- d. array.length gives the number of elements in the array. As indexes in Java start from 0, d is the correct answer.
- c. In the invocation of call_array, the first element is invoked using call-by-value, and the second using call-by-reference.
- d. import statement, package statement and class definitions are all optional in a file. Hence a and c are incorrect. If both import and package statements are present in a file, then package statement must appear before the import statement. Hence b is incorrect.
- e. The args array consists of two elements "it" and "out". args.length is set to two.
- a,c,d. The exception ArrayIndexOutOfBoundsException is generated as the main method tries to access i[2]. Hence 1 gets printed. After this finally block gets excuted, before the program exits.
- d,e,f
- e. A data member that does not have public/protected/private is accessible to all methods in the same package.
- a. The Manager and Employee share as "is a" relationship - A Manager is an Employee. This is captured by making Employee the base class of Manager.
- b. The method int parseInt(Sting s) returns the integer value corresponding to input String, assuming that the input string represents an integer in base 10.
- b. The start() method invokes the run() method when the thread is ready to execute.
- d
home | tutorial | questions | test 1
| |
2024-11-18T17:59:32.690863+00:00 | 2020-01-07T21:23:35 | 4686d5cf2d4e73fdba32de923dcb2a23816f8d71 | {
"blob_id": "4686d5cf2d4e73fdba32de923dcb2a23816f8d71",
"branch_name": "refs/heads/master",
"committer_date": "2020-01-07T21:23:35",
"content_id": "d4469642d1c21c2b8060fd097fb24f98b5aebc48",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "8ccfaf3f7dbf31a78ee860d6c1bce41bbb355751",
"extension": "html",
"filename": "5562547235330466615.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2094,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/dataset/20191121/00/5562547235330466615.html",
"provenance": "stackv2_html-0000.json.gz:27",
"repo_name": "5l1v3r1/telegram-data-clustering-contest",
"revision_date": "2020-01-07T21:23:35",
"revision_id": "f5fa880068b00b166fcf46b5790f4e9a77ba555e",
"snapshot_id": "95673424bdfcbbbdea02658879312ce1a0f51a43",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/5l1v3r1/telegram-data-clustering-contest/f5fa880068b00b166fcf46b5790f4e9a77ba555e/dataset/20191121/00/5562547235330466615.html",
"visit_date": "2022-04-06T15:09:53.483062"
} | stackv2 | Mikey Williams DROPS 40 POINTS in First HS Game! 🤯
by SLAM StaffMikey Williams is on a mission. Williams, one of the top players in the Class of 2023, put up a 40-piece as San Ysidro (CA) HS opened up its season earlier this week.
Prior to the start of the season, Williams had a 37-point performance. |
2024-11-18T17:59:32.694109+00:00 | 2019-10-04T11:14:39 | bd7236cddf4a58d1d1ee7f046b894b2fe574652f | {
"blob_id": "bd7236cddf4a58d1d1ee7f046b894b2fe574652f",
"branch_name": "refs/heads/master",
"committer_date": "2019-10-04T11:14:39",
"content_id": "55c026a3aa642a7555d983abecba75a9e14a48c6",
"detected_licenses": [
"MIT"
],
"directory_id": "c947d69de36fcbd3ae95f107c8ee24c2943a57c1",
"extension": "html",
"filename": "assignment.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 7862,
"license": "MIT",
"license_type": "permissive",
"path": "/assignment.html",
"provenance": "stackv2_html-0000.json.gz:28",
"repo_name": "EngineersBox/Quantum-Mechanics-and-Computing",
"revision_date": "2019-10-04T11:14:39",
"revision_id": "a224dddbffe4e9a4899a2bfdfb6c70b5c4202c80",
"snapshot_id": "a83a9879d82d7d6560bc7be2d05d44ea91f50f96",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/EngineersBox/Quantum-Mechanics-and-Computing/a224dddbffe4e9a4899a2bfdfb6c70b5c4202c80/assignment.html",
"visit_date": "2020-08-06T01:36:32.145723"
} | stackv2 | This page is the marking guide to your website that your tutor will use to find your elements. Do not name this page anything other than assignment.html (all lower case) or else we may not be able to find and mark your assignment elements. How to use this page:
Introduction to Quantum Physics
Notes: This gives an idea of the concepts in the topic. However it does not discuss specifics, the specific topics covered can be seen in the site map.
Notes: There is alot of webkit styles, although I am aware some of them are not needed, they are used as a "just in case" precaution.
Notes: The site map is also availble in index.html by clicking the hamburger menu icon in the top right.
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Notes: The image map is located at the top of the page regardless of scroll position as it is a fixed element
Notes: Provide any notes you may have about this element here.
I am doing JavaScript
Notes: For the overall site, the JavaScript that i implemented was purely for aesthetic purposes such as animating movements and mouse events. The JavaScript for the quantum mechanics section is for graphical simulation of particles that cannot be achieved with CSS3. The JavaScript for quantum computing simulates qubits and quantum gates, although it is under the restriction of non quantum speeds, it is purely a simulation, this uses (and will use) the actual mathematical representation of qubits and quantum gates to retain as close a similarity as possible.
Notes: To view the side bar, scroll down a bit and a hamburger icon will appear in the top right. Click on it to open the side bar.
JavaScript for quantum mechanics
JavaScript for quantum computation (WIP)
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Responsive design for smaller screens (all pages)
Notes: To access the alternate themes for the IDE, click the cog icon in the top right of the results panel, then you can choose from a dropdown list. All pages are responsive, utilising media queries to change the single-row design of content sections to double row designs. Also alterting image sizes and content placement.
Notes: Provide any notes you may have about this element here.
Twitter feed of arXiv.org quantum physics paper releases
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
In-browser JavaScript IDE and custom quantum computing JS library (QComp.js)
Notes: The QComp.js library is self built from scatch, you can check the GitLab repository for push updates to see the development process here: https://gitlab.com/EngineersBox/qcompjs.
Replace this line with the date you attended the continuous improvement session. |
2024-11-18T17:59:32.694324+00:00 | 2021-06-14T15:18:58 | 4b88b85f588d06b5ae950e7010c046ce4e806379 | {
"blob_id": "4b88b85f588d06b5ae950e7010c046ce4e806379",
"branch_name": "refs/heads/master",
"committer_date": "2021-06-14T15:18:58",
"content_id": "a17107d518084bd0650c1e87c6354343e21ba1ea",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "3ce2c74c18add751d91363ece6ae0d6be9ac3a17",
"extension": "html",
"filename": "iron-chlorosis.html",
"fork_events_count": 2,
"gha_created_at": "2015-05-29T02:10:37",
"gha_event_created_at": "2022-10-05T20:36:37",
"gha_language": "HTML",
"gha_license_id": "Apache-2.0",
"github_id": 36477529,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1887,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/gardening/iron-chlorosis.html",
"provenance": "stackv2_html-0000.json.gz:29",
"repo_name": "redbuttegarden/redbuttegarden.github.io",
"revision_date": "2021-06-14T15:18:58",
"revision_id": "db0f0cdaacb07dd268142eb3f1a3300272e39a95",
"snapshot_id": "d735c600fe5b9c90041ac0184ccbfc7d53114824",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/redbuttegarden/redbuttegarden.github.io/db0f0cdaacb07dd268142eb3f1a3300272e39a95/gardening/iron-chlorosis.html",
"visit_date": "2022-11-01T07:46:33.760440"
} | stackv2 | --- title: Iron Chlorosis layout: default ---
If you've noticed your garden plants producing healthy green leaves in spring that turn yellow as the season progresses, your plants may be suffering from iron chlorosis. Iron chlorosis is a common problem in alkaline soils and is easily recognizable by interveinal chlorosis, which is characterized by yellow leaves with dark green veins.
Iron is a nutrient needed in small amounts by plants and is plentiful in most Utah soils. Unfortunately, the high pH of our soils affects the availability of iron. In high pH soils (pH above 7), the iron rapidly forms solids and, therefore, is not available to plants.
The best solution to iron chlorosis is to choose plants more tolerant of high pH soils and low iron. For existing landscape plants, there are several options, though these are only temporary solutions:
All of these products can be purchased at a local garden store.
To learn more about your garden soil, have your soil tested. Soil testing kits are available from the Utah State Extension office at 2001 South State St., Ste S-1200, Salt Lake City. For a minimal fee they will test soil for pH, major nutrients, organic matter, and texture, as well as make fertilizer recommendations. |
2024-11-18T17:59:32.695518+00:00 | 2020-05-03T22:00:26 | a796b5a495639b362f45f1a7e0ee8b1e2513935e | {
"blob_id": "a796b5a495639b362f45f1a7e0ee8b1e2513935e",
"branch_name": "refs/heads/master",
"committer_date": "2020-05-03T22:26:23",
"content_id": "04f6dc64211e4b2e082941e0c56a1f2d86e8f7cc",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "7773ea6f465ffecfd4f9821aad56ee1eab90d97a",
"extension": "html",
"filename": "StringEqualsEmptyString.html",
"fork_events_count": 0,
"gha_created_at": "2020-05-04T03:48:35",
"gha_event_created_at": "2020-05-04T03:48:36",
"gha_language": null,
"gha_license_id": "Apache-2.0",
"github_id": 261074802,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 486,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/plugins/InspectionGadgets/src/inspectionDescriptions/StringEqualsEmptyString.html",
"provenance": "stackv2_html-0000.json.gz:30",
"repo_name": "aghasyedbilal/intellij-community",
"revision_date": "2020-05-03T22:00:26",
"revision_id": "fa602b2874ea4eb59442f9937b952dcb55910b6e",
"snapshot_id": "5fa14a8bb62a037c0d2764fb172e8109a3db471f",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/aghasyedbilal/intellij-community/fa602b2874ea4eb59442f9937b952dcb55910b6e/plugins/InspectionGadgets/src/inspectionDescriptions/StringEqualsEmptyString.html",
"visit_date": "2023-04-10T20:55:27.988445"
} | stackv2 | Reports cases when .equals() is called to compare a String with an empty string. In this case, using .isEmpty() is better as
it shows you exactly what you're checking.
"".equals(str) returns false when str is null. For safety, this inspection's quick fix inserts an explicit null-check when
the equals() argument is nullable. Use the checkbox below to suppress the warning in this case. |
2024-11-18T17:59:32.695787+00:00 | 2023-06-13T11:09:58 | 2fb2ea683b01a8eb9f1d28991cbebbdab41b4f1d | {
"blob_id": "2fb2ea683b01a8eb9f1d28991cbebbdab41b4f1d",
"branch_name": "refs/heads/master",
"committer_date": "2023-06-13T11:09:58",
"content_id": "e323bb05c3754763e5142b57809ec6a58343e16b",
"detected_licenses": [],
"directory_id": "d42b86a9186d1fb7bb0f3ba4c1c83b2d74940d6f",
"extension": "html",
"filename": "classcaf_1_1net_1_1web__socket_1_1framing.html",
"fork_events_count": 1,
"gha_created_at": "2014-09-30T19:50:03",
"gha_event_created_at": "2020-09-14T06:54:38",
"gha_language": "Less",
"gha_license_id": "MIT",
"github_id": 24653084,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 63000,
"license": "",
"license_type": "permissive",
"path": "/static/doxygen/0.19.1/classcaf_1_1net_1_1web__socket_1_1framing.html",
"provenance": "stackv2_html-0000.json.gz:31",
"repo_name": "actor-framework/actor-framework.github.io",
"revision_date": "2023-06-13T11:09:58",
"revision_id": "4515111334a2801798da1bb1cdf158694812137c",
"snapshot_id": "6b1e99caea6b391a5251dd0efbcff490e87576b1",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/actor-framework/actor-framework.github.io/4515111334a2801798da1bb1cdf158694812137c/static/doxygen/0.19.1/classcaf_1_1net_1_1web__socket_1_1framing.html",
"visit_date": "2023-06-23T07:05:21.800859"
} | stackv2 | |
C++ Actor Framework 0.19
|
Implements the WebSocket framing protocol as defined in RFC-6455. More...
#include <framing.hpp>
Public Types | |
| using | binary_buffer = std::vector< std::byte > |
| using | upper_layer_ptr = std::unique_ptr< web_socket::upper_layer > |
Public Member Functions | |
| auto & | up () noexcept |
| const auto & | up () const noexcept |
| auto & | down () noexcept |
| const auto & | down () const noexcept |
| error | start (octet_stream::lower_layer *down) override |
| Initializes the upper layer. | |
| void | abort (const error &reason) override |
| Called by the lower layer for cleaning up any state in case of an error or when disposed. | |
| ptrdiff_t | consume (byte_span input, byte_span) override |
| Consumes bytes from the lower layer. | |
| void | prepare_send () override |
| Gives the upper layer an opportunity to add additional data to the output buffer. | |
| bool | done_sending () override |
| Queries whether all pending data has been sent. | |
| multiplexer & | mpx () noexcept override |
| Returns the multiplexer instance that executes this protocol stack. | |
| bool | can_send_more () const noexcept override |
| Queries whether the output device can accept more data straight away. | |
| void | suspend_reading () override |
Stops reading messages until calling request_messages . | |
| bool | is_reading () const noexcept override |
| Queries whether the lower layer is currently reading from its input device. | |
| void | write_later () override |
| Triggers a write callback after the write device signals downstream capacity. | |
| void | shutdown (status code, std::string_view desc) override |
Sends a shutdown message with custom status code and msg text. | |
| void | request_messages () override |
Pulls messages from the transport until calling suspend_reading . | |
| void | begin_binary_message () override |
| Begins transmission of a binary message. | |
| byte_buffer & | binary_message_buffer () override |
| Returns the buffer for the current binary message. | |
| bool | end_binary_message () override |
| Seals the current binary message buffer and ships a new WebSocket frame. | |
| void | begin_text_message () override |
| Begins transmission of a text message. | |
| text_buffer & | text_message_buffer () override |
| Returns the buffer for the current text message. | |
| bool | end_text_message () override |
| Seals the current text message buffer and ships a new WebSocket frame. | |
| virtual error | start (lower_layer *down)=0 |
| Initializes the upper layer. | |
| virtual ptrdiff_t | consume (byte_span buffer, byte_span delta)=0 |
| Consumes bytes from the lower layer. | |
| virtual void | prepare_send ()=0 |
| Gives the upper layer an opportunity to add additional data to the output buffer. | |
| virtual bool | done_sending ()=0 |
| Queries whether all pending data has been sent. | |
| virtual void | abort (const error &reason)=0 |
| Called by the lower layer for cleaning up any state in case of an error or when disposed. | |
| Public Member Functions inherited from caf::net::web_socket::lower_layer | |
| virtual void | request_messages ()=0 |
Pulls messages from the transport until calling suspend_reading . | |
| virtual void | suspend_reading ()=0 |
Stops reading messages until calling request_messages . | |
| virtual void | begin_binary_message ()=0 |
| Begins transmission of a binary message. | |
| virtual byte_buffer & | binary_message_buffer ()=0 |
| Returns the buffer for the current binary message. | |
| virtual bool | end_binary_message ()=0 |
| Seals the current binary message buffer and ships a new WebSocket frame. | |
| virtual void | begin_text_message ()=0 |
| Begins transmission of a text message. | |
| virtual text_buffer & | text_message_buffer ()=0 |
| Returns the buffer for the current text message. | |
| virtual bool | end_text_message ()=0 |
| Seals the current text message buffer and ships a new WebSocket frame. | |
| void | shutdown () override |
| Shuts down any connection or session gracefully. | |
| void | shutdown (const error &reason) override |
| Shuts down any connection or session du to an error. | |
| virtual void | shutdown (status code, std::string_view msg)=0 |
Sends a shutdown message with custom status code and msg text. | |
| virtual multiplexer & | mpx () noexcept=0 |
| Returns the multiplexer instance that executes this protocol stack. | |
| virtual bool | can_send_more () const noexcept=0 |
| Queries whether the output device can accept more data straight away. | |
| virtual bool | is_reading () const noexcept=0 |
| Queries whether the lower layer is currently reading from its input device. | |
| virtual void | write_later ()=0 |
| Triggers a write callback after the write device signals downstream capacity. | |
| virtual void | shutdown ()=0 |
| Shuts down any connection or session gracefully. | |
| virtual void | shutdown (const error &reason) |
| Shuts down any connection or session du to an error. | |
Static Public Member Functions | |
| static std::unique_ptr< framing > | make_client (upper_layer_ptr up) |
| Creates a new framing protocol for client mode. | |
| static std::unique_ptr< framing > | make_server (upper_layer_ptr up) |
| Creates a new framing protocol for server mode. | |
Public Attributes | |
| bool | mask_outgoing_frames = true |
| When set to true, causes the layer to mask all outgoing frames with a randomly chosen masking key (cf. | |
Implements the WebSocket framing protocol as defined in RFC-6455.
|
overridevirtual |
Called by the lower layer for cleaning up any state in case of an error or when disposed.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Begins transmission of a binary message.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Begins transmission of a text message.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Returns the buffer for the current binary message.
Must be called between calling begin_binary_message
and end_binary_message
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtualnoexcept |
Queries whether the output device can accept more data straight away.
Implements caf::net::generic_lower_layer.
|
overridevirtual |
Consumes bytes from the lower layer.
| buffer | Available bytes to read. |
| delta | Bytes that arrived since last calling this function. |
Implements caf::net::octet_stream::upper_layer.
|
overridevirtual |
Queries whether all pending data has been sent.
The lower calls this function to decide whether it has to wait for write events on the socket.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Seals the current binary message buffer and ships a new WebSocket frame.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Seals the current text message buffer and ships a new WebSocket frame.
Implements caf::net::web_socket::lower_layer.
|
overridevirtualnoexcept |
Queries whether the lower layer is currently reading from its input device.
Implements caf::net::generic_lower_layer.
|
overridevirtualnoexcept |
Returns the multiplexer instance that executes this protocol stack.
Implements caf::net::generic_lower_layer.
|
overridevirtual |
Gives the upper layer an opportunity to add additional data to the output buffer.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Pulls messages from the transport until calling suspend_reading
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Sends a shutdown message with custom status code
and msg
text.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Initializes the upper layer.
| down | A pointer to the lower layer that remains valid for the lifetime of the upper layer. |
Implements caf::net::octet_stream::upper_layer.
|
overridevirtual |
Stops reading messages until calling request_messages
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Returns the buffer for the current text message.
Must be called between calling begin_text_message
and end_text_message
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Triggers a write callback after the write device signals downstream capacity.
Does nothing if this layer is already writing.
Implements caf::net::generic_lower_layer.
| bool caf::net::web_socket::framing::mask_outgoing_frames = true |
When set to true, causes the layer to mask all outgoing frames with a randomly chosen masking key (cf.
RFC 6455, Section 5.3). Servers may set this to false, whereas clients are required to always mask according to the standard. |
2024-11-18T17:59:32.706896+00:00 | 2018-11-13T14:20:22 | e52f7b785280d3a4220a3a70cd41b25fff447baa | {
"blob_id": "e52f7b785280d3a4220a3a70cd41b25fff447baa",
"branch_name": "refs/heads/master",
"committer_date": "2018-11-13T14:20:22",
"content_id": "546594dd581e6c7bf7daa4373b7445679103124f",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "5a1972793c80802ced82c0b5e09a1506791ac55a",
"extension": "html",
"filename": "Microx_concretizer.main-c.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6377,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/bap/api/v1.4.0/Microx_concretizer.main-c.html",
"provenance": "stackv2_html-0000.json.gz:32",
"repo_name": "yqyunjie/binaryanalysisplatform.github.io",
"revision_date": "2018-11-13T14:20:22",
"revision_id": "7eec206a1201a736e1363aaa01518ed82dd76f88",
"snapshot_id": "9c4e9ae31032223206a9440e13ad0afeb52f3abf",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/yqyunjie/binaryanalysisplatform.github.io/7eec206a1201a736e1363aaa01518ed82dd76f88/bap/api/v1.4.0/Microx_concretizer.main-c.html",
"visit_date": "2020-04-10T05:29:57.065316"
} | stackv2 | class[#Expi.context]
main :?memory:addr -> word option -> ?lookup:var -> word option -> ?random_seed:int -> ?reg_policy:policy -> ?mem_policy:policy -> unit ->
[#Expi.context as 'a]
expi
It can be used as mixin class for other interpreters.
memory
: returns a byte value at the given address, if knownlookup
: returns a value of a given variable, if knownrandom_seed
: if non None
the the value is used to
initialize the pseudo random generator.reg_policy
: a policy for concretizing register values;mem_policy
: a policy for concretizing heap values. |
2024-11-18T17:59:32.717541+00:00 | 2019-11-14T11:30:25 | 70d025558940d96894495b9ffec66d6f9b8c6a29 | {
"blob_id": "70d025558940d96894495b9ffec66d6f9b8c6a29",
"branch_name": "refs/heads/master",
"committer_date": "2019-11-14T11:30:25",
"content_id": "f10538e61c5e2891451c513ad36d25a41fc206d2",
"detected_licenses": [
"MIT"
],
"directory_id": "836080f79b4ef1615637f7cb6af376be6eeef1db",
"extension": "html",
"filename": "ui-manager.html",
"fork_events_count": 0,
"gha_created_at": "2018-12-03T09:41:29",
"gha_event_created_at": "2022-12-10T08:55:44",
"gha_language": "CSS",
"gha_license_id": "MIT",
"github_id": 160167358,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3521,
"license": "MIT",
"license_type": "permissive",
"path": "/public/tests/ui-manager.html",
"provenance": "stackv2_html-0000.json.gz:33",
"repo_name": "OllieFordandCo/ui-manager",
"revision_date": "2019-11-14T11:30:25",
"revision_id": "b5eabaa1a875bbf826d6675eed0911379126e08d",
"snapshot_id": "6d649e1183e910e35ce9732859de04f1a34ed660",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/OllieFordandCo/ui-manager/b5eabaa1a875bbf826d6675eed0911379126e08d/public/tests/ui-manager.html",
"visit_date": "2022-12-23T16:31:14.360903"
} | stackv2 | amaranth
Social Network Engine for Laravel
Login
Access your account
Username:
Password:
Remember this device
Login
Register for the beta
Forgot Password? |
2024-11-18T17:59:32.721447+00:00 | 2018-06-14T04:57:06 | ba5dcfffc6bbddcd024e08a821c7dd5fac63a33a | {
"blob_id": "ba5dcfffc6bbddcd024e08a821c7dd5fac63a33a",
"branch_name": "refs/heads/master",
"committer_date": "2018-06-14T04:57:06",
"content_id": "61f1285ce6a9b452795334205295e320f621ef96",
"detected_licenses": [
"Unlicense"
],
"directory_id": "5223b4efa719f200ced8bca36b61ab0585505418",
"extension": "htm",
"filename": "default.htm",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 137006700,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3945,
"license": "Unlicense",
"license_type": "permissive",
"path": "/StackBot/wwwroot/default.htm",
"provenance": "stackv2_html-0000.json.gz:34",
"repo_name": "Armando-GarzaTech/StackBot",
"revision_date": "2018-06-14T04:57:06",
"revision_id": "94a0a32848064fddae81054e65df5bedf5c5790f",
"snapshot_id": "4260671fa9d0a1c8e10bba532f206223ceec3308",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Armando-GarzaTech/StackBot/94a0a32848064fddae81054e65df5bedf5c5790f/StackBot/wwwroot/default.htm",
"visit_date": "2020-03-20T01:43:49.256240"
} | stackv2 | Visit Bot Framework to register your bot. When you register, remember to set the endpoint to:
To debug you bot using the Bot Framework Emulator, paste this URL into the Emulator window: |
End of preview. Expand
in Data Studio
No dataset card yet
- Downloads last month
- 228
Size of downloaded dataset files:
2.07 GB
Size of the auto-converted Parquet files:
3.12 GB
Number of rows:
1,674,654