UTC +8
Voltage: 220 V
Frequency: 50 Hz
Note - The "official" plug type is like type A but slightly shorter and without holes in blades. Type A and I outlets are common, and Type G might also be found. Click here for photos and more info.
Renminbi (RMB) or yuan (Y) = 10 jiao. All records of exchange should be kept. One cannot import or export local currency. Foreign currency must be declared.
International dialing code for China is +86.
Chinese cellular service has greatly improved along with the coverage, while the rates have lowered.
A prepaid SIM card for China with a world cell phone is the most convenient and economical solution. All incoming calls while you travel China are no more then $.19 USD per minute (Only $.07 in Guangdong province), regardless of where they originate. Pay the local rate for local calls on a cellular phone.
SE Asia Cruisers Net
THIS NET IS NO LONGER OPERATIONAL.
From within Mainland China, the following emergency numbers are used (and mainly in major cities):
Police - 110
Fire - 119
Ambulance - 120
Traffic Accident - 122
Weather - 121
999, for all of the above services in Beijing and Shanghai, but it is privately operated.
In most cities, the emergency numbers provide assistance in English and Mandarin.
IMRAY AND ADLARD COLES PILOT BOOKS are available at a discounted price for Noonsite.com users via World Cruising Club
Cruising Guide To Southeast Asia Volume I: South China Sea, Philippines, Gulf Of Thailand To Singapore
By Stephen Davies & Elaine Morgan
Publisher: Imray, Laurie, Norie & Wilson (Nov 1998)
ISBN-13:<PHONE_NUMBER>962
Comprehensive coverage of the South China Sea, detailing Hong Kong and Macau, The Phillippines, Brunei, East Malaysia and the Gulf of Thailand and Singapore.
Noonsite welcomes information and updates especially regarding clearance, customs and immigration procedures from cruisers visiting this country.
Please E-mail noonsite with any new information, updates or corrections. Even just a short email confirming that the current data is accurate would be most helpful.


GUNTANTRA
India's gun laws may be among the strictest in the world, but does that deter us from owning them?
Rashmi Singh
India's gun laws may be among the strictest in the world, but does that deter us from owning them?
Rashmi Singh
With 273 mass shootings in 275 days this year, it's difficult to believe that the Las Vegas mass shooting -the deadliest in recent years - will be the last. And despite a string of such cases, the unrestricted access to guns continues.
Stephen Paddock, the Las Vegas shooter, was found to have acquired 47 guns, including rifles and semi-autos. He lived in a state (Nevada) where buyers don't need permits to buy assault weapons.
The picture is different in India, which has one of the strictest gun laws in the world. Here, acquiring firearms is a privilege and not a constitutional right (like in the US). In fact, Arms Rules, 2016, makes licences necessary, even for air guns. The process of procuring licences though, is difficult and often takes months. They are granted only after a thorough assessment, including background checks.
The Sydney University database on guns puts the rate of private gun ownership per 100 Indians at 3.4. That's a paltry number compared with 101 guns per 100 Americans - that's more guns than people!
India might not be trigger happy but it has its own misfiring when it comes to gun ownership. One, strict gun laws restrict access to licenced weapons but unlicenced firearms form about 85% of the civilian-owned stockpile. Second, India too has its 'gun hubs' - areas with a higher gun ownership and fatalities.
It's difficult to put a number on the unlawfully held guns, but a look at the licence status of firearm seizures made in the past gives a clear picture of how prevalent unlicenced guns are. Sixty percent of more than 100,000 firearms seized in India between 2014 and 2015 were found to be unlicenced, with Uttar Pradesh accounting for most of it.
Worryingly, the recently-released home ministry data on active gun licenses reveals that UP trumps other states in terms of licenced weapons as well. Home to 16% of the country's population, the state accounts for 38% of the 33.7 lakh active gun licenses in the country, emerging as India's gun hub.
With just about 10 in 100 homicides using guns, Indians are less likely to be killed by firearms. But more than 90% of deaths by firearms have been caused using an unlawfully-held weapon- a trend noticed year after year.
Crimes like mass shootings are rarely heard of in India, but gun violence in road rage cases is not. While strict gun laws do succeed in restricting access to guns to an extent, but illegal gun ownership is a matter of concern.
Data also establishes, that Indian states with higher gun ownership figures, are also more likely to see higher gun fatalities.
Telangana
Total firearm deaths: 19
| States | Active licenses | Total firearm deaths |
|---|---|---|
| Andhra Pradesh | - | 8 |
| Arunachal Pradesh | 34,394 | 6 |
| Assam | 19,283 | 14 |
| Bihar | 82,585 | 691 |
| Chhattisgarh | - | 113 |
| Goa | - | 2 |
| Gujarat | 60,784 | 25 |
| Haryana | 1,41,926 | 98 |
| Himachal Pradesh | 77,069 | 3 |
| Jammu & Kashmir | 3,69,191 | 52 |
| Jharkhand | 17,654 | 654 |
| Karnataka | 1,13,631 | 41 |
| Kerala | 9,459 | 52 |
| Madhya Pradesh | 2,47,130 | 476 |
| Maharashtra | 84,050 | 114 |
| Manipur | 26,836 | 40 |
| Meghalaya | 18,688 | 2 |
| Mizoram | 15,895 | 4 |
| Nagaland | 36,606 | 6 |
| Odisha | 20,588 | 9 |
| Punjab | 359,349 | 161 |
| Rajasthan | 1,33,968 | 115 |
| Sikkim | - | 0 |
| Tamil Nadu | 22,532 | 2 |
| Telangana | - | 20 |
| Tripura | - | 9 |
| Uttar Pradesh | 12,77,914 | 2,155 |
| Uttarakhand | 64,770 | 14 |
| West Bengal | 60,525 | 43 |
India too has its pro-gun lobby. There are voices that argue that guns don't kill people. That easy access to legal guns may reduce illegal firearm sales. The argument may have weight, but one things is clear: Legal or illegal, more guns mean more gun deaths.


Watch: Shaq Lawson confronts Broncos OL who dissed him before game
by Marcelo VillaShaq Lawson got to the quarterback twice in Buffalo’s blowout win against Broncos on Sunday, and it appears the Bills defensive end was playing with some extra motivation after getting dissed by one of Denver’s players before the game.
“First of all, they were talking junk,’’ Lawson told reporters after the game. “That’s my thing, I talk junk. You can’t out-junk me. I like that stuff. To start the game, I think it was No. 60 (center Connor McGovern), he goes ‘I haven’t remembered you since college.’ I said, ‘I bet I show you.’ ’’
During the postgame handshake between both teams, Lawson went over to McGovern to make sure the Broncos offensive lineman remembered him after getting two sacks.
Lawson was a star at Clemson before getting selected in the first round of the 2016 draft. Since then, the 25-year-old has flown under the radar in Buffalo, but he’s on pace to have the best season of his career.


CCONJ
: coordinating conjunction
This document is a placeholder for the language-specific documentation
for CCONJ
.
Treebank Statistics (UD_Romanian)
There are 12 CCONJ
lemmas (0%), 15 CCONJ
types (0%) and 6468 CCONJ
tokens (3%).
Out of 17 observed tags, the rank of CCONJ
is: 13 in number of lemmas, 14 in number of types and 10 in number of tokens.
The 10 most frequent CCONJ
lemmas: și, sau, dar, însă, ci, ori, fie, deci, căci, or
The 10 most frequent CCONJ
types: și, sau, dar, însă, și-, ci, ori, fie, deci, căci
The 10 most frequent ambiguous lemmas: dar (CCONJ 336, NOUN 6)
The 10 most frequent ambiguous types: și (CCONJ 4823, PRON 18), și- (PRON 157, CCONJ 38), ori (NOUN 54, CCONJ 37), fie (AUX 185, CCONJ 26, VERB 16), or (AUX 3, CCONJ 2)
- și
- și-
- ori
- fie
- or
Morphology
The form / lemma ratio of CCONJ
is 1.250000 (the average of all parts of speech is 1.812886).
The 1st highest number of forms (3) was observed with the lemma “și”: Ș-, și, și-.
The 2nd highest number of forms (2) was observed with the lemma “dar”: da’, dar.
The 3rd highest number of forms (1) was observed with the lemma “ci”: ci.
CCONJ
occurs with 2 features: ro-feat/Polarity (6468; 100% instances), ro-feat/Variant (3; 0% instances)
CCONJ
occurs with 2 feature-value pairs: Polarity=Pos
, Variant=Short
CCONJ
occurs with 2 feature combinations.
The most frequent feature combination is Polarity=Pos
(6465 tokens).
Examples: și, sau, dar, însă, și-, ci, ori, fie, deci, căci
Relations
CCONJ
nodes are attached to their parents using 17 different relations: ro-dep/cc (5779; 89% instances), ro-dep/advmod (372; 6% instances), ro-dep/fixed (183; 3% instances), ro-dep/cc:preconj (58; 1% instances), ro-dep/conj (29; 0% instances), ro-dep/mark (15; 0% instances), ro-dep/compound (8; 0% instances), ro-dep/obl (5; 0% instances), ro-dep/root (5; 0% instances), ro-dep/nmod (3; 0% instances), ro-dep/aux (2; 0% instances), ro-dep/discourse (2; 0% instances), ro-dep/expl:poss (2; 0% instances), ro-dep/iobj (2; 0% instances), ro-dep/advcl (1; 0% instances), ro-dep/expl:pass (1; 0% instances), ro-dep/flat (1; 0% instances)
Parents of CCONJ
nodes belong to 16 different parts of speech: NOUN (2751; 43% instances), VERB (2233; 35% instances), ADJ (589; 9% instances), ADV (278; 4% instances), PROPN (204; 3% instances), NUM (161; 2% instances), PRON (138; 2% instances), ADP (37; 1% instances), CCONJ (21; 0% instances), DET (20; 0% instances), SCONJ (11; 0% instances), PART (10; 0% instances), AUX (7; 0% instances), ROOT (5; 0% instances), INTJ (2; 0% instances), SYM (1; 0% instances)
6388 (99%) CCONJ
nodes are leaves.
33 (1%) CCONJ
nodes have one child.
43 (1%) CCONJ
nodes have two children.
4 (0%) CCONJ
nodes have three or more children.
The highest child degree of a CCONJ
node is 4.
Children of CCONJ
nodes are attached using 11 different relations: ro-dep/punct (72; 55% instances), ro-dep/fixed (19; 14% instances), ro-dep/conj (18; 14% instances), ro-dep/case (7; 5% instances), ro-dep/discourse (6; 5% instances), ro-dep/amod (4; 3% instances), ro-dep/nummod (2; 2% instances), ro-dep/advmod (1; 1% instances), ro-dep/det (1; 1% instances), ro-dep/nsubj (1; 1% instances), ro-dep/obj (1; 1% instances)
Children of CCONJ
nodes belong to 11 different parts of speech: PUNCT (54; 41% instances), CCONJ (21; 16% instances), SYM (18; 14% instances), ADV (15; 11% instances), ADP (8; 6% instances), PRON (7; 5% instances), VERB (3; 2% instances), NUM (2; 2% instances), SCONJ (2; 2% instances), INTJ (1; 1% instances), NOUN (1; 1% instances)
CCONJ in other languages: [u]


Fader Class
An effect changes the amplitude or volume of the audio that this effect is connected to.
Constructor
Fader
-
[context]
Parameters:
-
[context]
AudioContext optionalAudioContext to be used.
Item Index
Methods
Methods
connect
-
destination
-
[output]
-
[input]
If the parameter output
is an AudioNode, it connects to the outputNode.
If the output is a BaseEffect, it will connect BaseEffect's outputNode to the output's inputNode.
disconnect
-
[outputIndex]
Disconnects the Sound from the AudioNode Chain.
Parameters:
-
[outputIndex]
Number optionalIndex describing which output of the AudioNode to disconnect.
listParams
-
[paramArray]
List all SPAudioParams this Sound exposes
Parameters:
-
[paramArray]
Array optionalArray of all the SPAudioParams this Sound exposes.
Properties
audioContext
AudioContext
Web Audio API's AudioContext. If the context passed to the constructor is an AudioContext, a new one is created here.
inputNode
AudioNode
final
The output node of this effect. This node will be connected to the next Effect or destination
outputNode
AudioNode
final
The output node of this effect. This node will be connected to the next Effect or destination
volume
SPAudioParam
Fades or reduces the volume of the audio based on the value in percentage. 100% implies no change in volume. 0% implies completely muted audio.
Default: 100
volumeInDB
SPAudioParam
Fades or reduces the volume of the audio based on the value in decibles. 0 dB implies no change in volume. -80 dB implies almost completely muted audio.
Default: 0


- saveCurrentGame() - Method in class domain.controller.GameController
-
Save current game
- scanner - Variable in class presentation.utils.TerminalUtils
-
- scoreGuess(ColorRow) - Method in class domain.model.player.computer.DummyComputer
-
Generates the correction of one guess
- scoreGuess(ColorRow) - Method in class domain.model.player.ComputerPlayer
-
Calls to compareGuess in order to generate the number of blacks and whites of the attempt.
- scoreGuess(ColorRow) - Method in class domain.model.player.Player
-
Evaluates the correct control row to the breaker's combination
- scoreGuess(ColorRow) - Method in class domain.model.player.UserPlayer
-
The Maker user player gives a controlRow to answer the Breaker's guess
- scrollPane - Variable in class presentation.view.GameView
-
- setBlacks(int) - Method in class presentation.controller.TerminalController.Turn
-
Sets blacks.
- setColor(int, String) - Method in class presentation.view.components.ColorPeg
-
Sets the color id of a peg.
- setCorrectGuess(TerminalController.Turn) - Method in class presentation.controller.TerminalController.Board
-
Add correct guess.
- setCorrectGuess(TerminalController.Turn) - Method in class presentation.controller.TerminalController.BoardController
-
Add correct guess.
- setCurrentBoard(TerminalController.BoardController) - Method in class presentation.controller.TerminalController
-
Sets current board.
- setDebugBuild(boolean) - Method in class domain.controller.DomainController
-
Sets debug build status
- setGameInterface(Receiver) - Method in class domain.controller.DomainController
-
Sets game interface
- setGameInterface(VisualGameReceiver) - Method in class presentation.controller.PresentationController
-
Saves the game interface to domain controller.
- setGameInterface() - Method in class presentation.controller.TerminalController
-
Sets the Terminal Game Interface
- setLanguage(LocaleUtils.Language) - Method in class presentation.utils.LocaleUtils
-
Sets a neew language
- setSelectionActionListener(int) - Method in class presentation.view.components.ColorRow
-
Set the Action listener to the pegs.
- setUpButtons() - Method in class presentation.controller.view.LoginViewController
-
- setUpDrawer() - Method in class presentation.controller.view.NebulaViewController
-
- setUpImageViews() - Method in class presentation.controller.view.LoginViewController
-
- setUpTextFields() - Method in class presentation.controller.view.LoginViewController
-
- setWhites(int) - Method in class presentation.controller.TerminalController.Turn
-
Sets whites.
- showContinueGameMenu(String) - Method in class presentation.TerminalMastermind
-
- showCustomDialog(String, Node) - Static method in class presentation.utils.ComponentUtils
-
Shows a custom type alert.
- showErrorDialog(String, String) - Static method in class presentation.utils.ComponentUtils
-
Shows a error type alert.
- showInformationDialog(String, String) - Static method in class presentation.utils.ComponentUtils
-
Shows a information type alert.
- showNewGameMenu(String) - Method in class presentation.TerminalMastermind
-
- showOutput() - Method in class presentation.utils.TerminalMenuBuilder
-
- showPlayMenu(String) - Method in class presentation.TerminalMastermind
-
- showPointStats() - Method in class presentation.TerminalMastermind
-
- showQuery() - Method in class presentation.utils.TerminalMenuBuilder
-
- showStats() - Method in class presentation.TerminalMastermind
-
- showTimeStats() - Method in class presentation.TerminalMastermind
-
- showUserMenu(TerminalMenuBuilder, String) - Method in class presentation.TerminalMastermind
-
- showWarningDialog(String, String) - Static method in class presentation.utils.ComponentUtils
-
Shows a warning type alert.
- sort(ArrayList<Integer>, ArrayList<ColorRow>, int, int) - Method in class domain.model.player.computer.GeneticComputer
-
- sortFeasibleByFitness(ArrayList<Integer>, ArrayList<ColorRow>) - Method in class domain.model.player.computer.GeneticComputer
-
- start(Stage) - Method in class presentation.VisualMastermind
-
Starts the Visual Mastermind
- startGame() - Method in class domain.model.Game
-
Start game.
- startGame(String) - Method in class domain.model.player.computer.DummyComputer
-
- startGame(String) - Method in class domain.model.player.Player
-
Start Game with Title
- startGame(String) - Method in class domain.model.player.UserPlayer
-
Notifies a new game has started
- startGame(String) - Method in interface domain.model.Receiver
-
Start game with a certain title
- startGame(String) - Method in class presentation.controller.receiver.TerminalGameReceiver
-
Starts the game
- startGame(String) - Method in class presentation.controller.receiver.VisualGameReceiver
-
Starts the game
- startGame(String, String, int, int) - Method in class presentation.controller.view.NebulaViewController
-
Starts a game with the given parameters
- startNewGame(String, String, String, int, int, int) - Method in class domain.controller.GameController
-
Start a new game with an user player and a computer
- startNewGame(String, int, int, int) - Method in class domain.controller.GameController
-
Start a new game computer vs computer
- startTerminalApplication() - Method in class presentation.TerminalMastermind
-
Starts the Mastermind in a terminal
- StatController - Class in domain.controller
-
The Stat controller
- StatController() - Constructor for class domain.controller.StatController
-
- statDataController - Variable in class domain.controller.StatController
-
- StatDataModel<E extends StatController> - Class in persistence.model
-
The type Stat data model.
- StatDataModel() - Constructor for class persistence.model.StatDataModel
-
- STATS_POINTS - Static variable in class resources.strings.TerminalConstants
-
The constant STATS_POINTS.
- STATS_TIME - Static variable in class resources.strings.TerminalConstants
-
The constant STATS_TIME.
- statsView - Variable in class presentation.controller.view.NebulaViewController
-
- StatsView - Class in presentation.view
-
The Stats View
- StatsView() - Constructor for class presentation.view.StatsView
-
Loads the StatsView to nebula.
- Status() - Constructor for enum domain.model.Game.Status
-
- stopCurrentGame() - Method in class domain.controller.GameController
-
Stop current game
- stringToArray(String) - Static method in class presentation.view.components.ColorRow
-
- swapColorRow(ArrayList<ColorRow>, int, int) - Method in class domain.model.player.computer.GeneticComputer
-
- swapInteger(ArrayList<Integer>, int, int) - Method in class domain.model.player.computer.GeneticComputer
-


Python supports the creation of anonymous functions at runtime, using a construct called "lambda".
Let's see an example:
# Standard way to define a function
def my_func(in_num):
return in_num*in_num
# Lambda way
my_func_l = lambda x: x*x
Both of the functions return the same result, but are declared in different ways.
So the question is: "When is it useful to use a lambda function?". I find it particularly useful when i'm working on "dynamic" functions:
def my_func(n):
return lambda x:x*n
# This creates the anonymous function by defining the n value
f = my_func(2)
g = my_func(4)
# This calls the function by passing the parameter x
f(5)
g(3)
# You can also call the function without assigning it
my_func(2)(8)
But Lambdas functions are often used with map, filter and reduce.
Map
Map applies a function to all the items in an input_list.
# Let's declare a simple list of number
items = [1, 2, 3, 4, 5]
# We create a Lambda that does the square for the number
# and apply it to the list by using map
list(map(lambda x:xx,items))
Out[354]: [1, 4, 9, 16, 25]
This is a really fast way to apply a function on a list. It is really useful if you need to use it once.
Filter
Filter creates a list of elements for which a function returns true.
# Let's declare a simple list of number
items = [1, 2, 3, 4, 5]
# We create a Lambda that check if the number is even
# and apply it to the list by using filter
list(filter(lambda x: x%2 == 0, items))
Out[356]: [2, 4]
By using filter you can clean your list easily.
Reduce
Reduce is a really useful function for performing some computation on a list and returning the result.
# We need to import reduce from functools library
from functools import reduce
# Let's declare a simple list of number
items = [1, 2, 3, 4, 5]
# We create a Lambda that compute the product of the integers
# and apply it to the list by using reduce
reduce(lambda x,y: xy, items)
Out[363]: 120
And that's all for today!


initial value of accumulator
helper object defining how to add elements of type T
Merge two accumulable objects together
Merge two accumulable objects together
Normally, a user will not want to use this version, but will instead call +=
.
the other Accumulable that will get merged with this
Add more data to this accumulator / accumulable
Get the current value of this accumulator from within a task.
Get the current value of this accumulator from within a task.
This is NOT the global value of the accumulator. To get the global value after a
completed operation on the dataset, call value
.
The typical use of this method is to directly mutate the local value, eg., to add an element to a Set.
Access the accumulator's current value; only allowed on master.
Access the accumulator's current value; only allowed on master.
Set the accumulator's value; only allowed on master.
Set the accumulator's value; only allowed on master.
A simpler value of Accumulable where the result type being accumulated is the same as the types of elements being merged.
result type


{% extends "horizon/common/_modal_form.html" %} {% load i18n %} {% block form_id %}add_interface_form{% endblock %} {% block form_action %}{% url form_url router.id %} {% endblock %} {% block modal-header %}{% trans "Add Interface" %}{% endblock %} {% block modal-body %}
{% trans "You can connect a specified subnet to the router." %}
{% blocktrans trimmed %} If you don't specify an IP address here, the gateway's IP address of the selected subnet will be used as the IP address of the newly created interface of the router. If the gateway's IP address is in use, you must use a different address which belongs to the selected subnet. {% endblocktrans %}


When I first set up this blog, I knew I wanted to use a Jekyll layout - they’re nice, responsive, and work well across devices and browsers. They also have nice coupling with Github, which should make serving easy and free. The problem was that getting Ruby and Windows to work well together weren’t obvious (not much experience), and WSL had its own issues at the time - although promising. So, I set up the site to serve from AWS via S3 and wrote about that process here.
Good news - all of these challenges have now come a long way, and setting up everything locally and having GH do the work for you is super easy! So, I’ve moved from AWS back to Github. I also find that I am actually writing more now - calling bundle exec jekyll serve
from the Ubuntu terminal is no sweat, and after a commit, the work is out there in less than 1m. There are a few minor things that tripped me up - documenting here to make easier for others.
Steps to getting your blog up on GH via Windows 10
- Use WSL and the Ubuntu terminal! The Ruby devkits for Windows were known to be challenging - it required a very strong desire to make it work. I would follow these directions for getting WSL and bash set up on your terminal - but stop before it recommends downloading Ruby!!
- Don’t mess with bare installations, use rbenv. This was a good article documenting
PATH
challenges when not using rbenv, as well as scripts for getting everything up and running.- When installing Ruby and Jekyll, make sure to use the gh-pages specified dependencies: Link is here. If you had other versions pre-installed, make sure you are loading from rbenv (eg, the shims in ruby and jekyll)
- Create and initialize your GH repo. Github has good instructions for this here. I made sure to have the bundler installed.
- Pick your theme. Github has a list of supported themes - these work out of the box, and are specified in your config file. Github also supports remote themes now. This requires a little bit of extra work, but expands the number of layouts you can use. I like and use minimal mistakes.
- Set up a custom domain, if desired. Github has a good walkthrough, and many folks on the internet have worked through this themselves. Depending on where you buy your domain, each company has slightly different ways for managing the CNAME, A records, etc. I originally had been using bluehost and found this guidance helpful.
- Write your first post! Your post will be in the
_posts
folder for the repo (which is created when you instantiate withjekyll new
). The filename will be the date of the posting + the URL path for the post. For example2018-05-02-setting-up-blog.md
will render as posted on May 2nd at your site:xxx.github.io/setting-up-blog
.
I hope this is helpful. If you have any questions, thoughts, or comments - please let me know!


The aggregator is to be mixed into an actor for the aggregator behavior.
This actor is intended to be used on an external node that is not member of the cluster.
ClusterClient connects to this actor to retrieve.
Manages singleton actor instance among all cluster nodes or a group of nodes tagged with a specific role.
Thrown when a consistent state can't be determined within the defined retry limits.
Java API.
This actor manages a registry of actor references and replicates the entries to peer actors among all cluster nodes or a group of nodes tagged with a specific role.
A ReliableProxy is a means to wrap a remote actor reference in order to obtain certain improved delivery guarantees:
Fast, small, and dirty implementation of a linked list that removes transient work entries once they are processed.
Extension that starts ClusterReceptionist and accompanying DistributedPubSubMediator
with settings defined in config section akka.contrib.cluster.receptionist
.
Extension that starts a DistributedPubSubMediator actor
with settings defined in config section akka.contrib.cluster.pub-sub
.
Provides the utility methods and constructors to the WorkList class.


LENT 5 SATURDAY
ENTRANCE ANTIPHON
O Lord, do not stay afar off; my strength, make haste to help me! For I am a worm and no man, scorned by everyone, despised by the people.
COLLECT
O God, who have made all those reborn in Christ a chosen race and a royal priesthood, grant us, we pray, the grace to will and to do what you command, that the people called to eternal life may be one in the faith of their hearts and the homage of their deeds. Through our Lord Jesus Christ, your Son, who lives and reigns with you in the unity of the Holy Spirit, one God, for ever and ever.
PRAYER OVER THE OFFERINGS
May the gifts we offer from our fasting be acceptable to you, O Lord, we pray, and, as an expiation for our sins, may they make us worthy of your grace and lead us to what you promise for eternity. Through Christ our Lord.
Preface of the Passion of the Lord I
COMMUNION ANTIPHON
Christ was handed over, to gather into one the scattered children of God.
PRAYER AFTER COMMUNION
We entreat
your majesty most humbly, O Lord, that, as you feed us with the nourishment
which comes from the most holy Body and Blood of your Son, so you may make us
sharers of his divine nature. Who lives and reigns for ever and ever.
PRAYER OVER THE PEOPLE (for optional use)
Have mercy,
Lord, on your Church, as she brings you her supplications, and be attentive to
those who incline their hearts before you: do not allow, we pray, those you
have redeemed by the Death of your Only Begotten Son, to be harmed by their
sins or weighed down by their trials. Through Christ our
Lord.


SPRAYER BOT
Problem:
High Expenditure very injurious to health for the human who
sprays takes a lot of
human
energy.
Our
Solution:
less
human
power.
How it
works?
Nozzle positions, motor
speed and nozzle pressure are Presetted
by operator
Guided for path by
operator
Play
Video
Benefits:
Reduces the
cost.Less manpower as
machine is semi automated. Uses battery power,causes no pollution
Download
Brochure
Request
a Quote


Please select one product, you would most likely purchase, by clicking the image below.
Click for End Results


Notification
Noty
NOTY is a notification library that makes it easy to create alert - success - error - warning - information - confirmation messages as an alternative the standard alert dialog.
Sweet Alert
Sweetalert is a beautiful replacement for JavaScript "alert"
SweetAlert automatically centers itself on the page and looks great no matter if you're using a desktop computer, mobile or tablet. It's even highly customizeable, as you can see below!
With Function
A warning message, with a function attached to the "Confirm"-button
Passing a Parameter
you can execute something else for "Cancel".


Full Name
Address
Gender
Male
Female
Date of Birth
Email
Password
What Git hosting provider do you use recently?
GitHub
GitLab
Bitbucket
Other / Self-Hosted
Which platform do you use to develop your project? (You can choose more than one)
Windows
Mac
Linux
Mobile : Android
Mobile : iOS
Other
Do you frequently checked
Stack Overflow
to find solution to your project's problem?
Yes
No
I don't know
Which license is the most frequently used by your projects?
Apache License 2.0
BSD (any version)
MIT
GNU License (GPL, LGPL, GFDL)
Mozilla Public License (any version)
Other Licenses
Write your thoughts and/or comments about world's current programming development (optional)
Restart Survey


--- layout: page title: About Me description: This is what I do. background: '/img/bg-about.jpg' ---
My name is Burak, from Istanbul/Turkey. I am a computer scientist, and working as R&D Engineer for a cybersecurity company. Most of my time is about doing research and experiments on Machine Learning and Data Science. I like to extract meaning from massive amount of data. On the other hand, I am a computer geek, i love almost all stuff that related to computer. It's like an addiction for me. Writing code and creating value for people excites me. So, in my freetimes, making contributions to open source projects.


I am a resourceful, hands-on Full-Stack Software Engineer committed to making websites match visual and performance expectations, in correlation with robust code. I like to think of myself as the missing bridge between UI/UX Design and front end development. But, I am just as strong in the back end! I have experience in HTML, CSS, SCSS, Sass, Javascript, Node JS, jQuery, MongoDB, Mongoose, ReactJs (Redux, Hooks), Nosql Databases, SQL Databases, C#, Elasticsearch, .NET, and Python. I will be adding more skills as I progress throughout my journey!
Designed, built and maintained complete e-commerce websites, while incorporating visual and graphic images to use on multiple platforms. I also designed, developed, and maintained key components of the software using JavaScript, React/React-Redux, Python, and Flask
I built, tested, and deployed scalable, highly available and modular software products. I also analyzed requirements and designed, developed and implemented software applications for multiple websites
I designed, built and maintained complete e-commerce websites. In addition, I defined and conducted design processes at all stages, including research, conceptualization, testing and implementation. Worked extensively with engineering staff to better understand Elasticsearch (ELK Stack) solutions and benefits to projects
Created proof-of-concept prototype applications for demonstration and evaluation purposes. Completed 4 major projects in 12 weeks by collaborating with agile development team and testing, developing and maintaining web and desktop-based software applications. Developed scripts to communicate with back-end servers in order to provide real-time updated information.
Used ASP.NET, C#, and JavaScript (React) to design and develop new sites and web-based solutions, both front end and back end.


|
ML 12(PEENYA II) No.67/68A, 3rd Phase, Peenya Industrial Area, Bangalore - 560 058 Tel:<PHONE_NUMBER>7/98 Fax :<PHONE_NUMBER>3 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
The Peenya Unit 2 manufacturing facility was commissioned in the year 1978 by the Eros Pharma Management. This facility was acquired by Micro Labs Ltd in the year 2002. The facility was renamed as Micro Labs Ltd (ML 12) Peenya Unit 2 in the year 2005. The facility has been manufacturing tablets, capsules and topicals for domestic and ROW markets. Medicines under the category of cardiovascular drugs, anti-hypertensives, anti-diabetics, NSAIDs etc are being manufactured under the brand names such as Dolo 650, Dolo 500, Divon 50, Amlong, Avas, Melmet, Angizaar 50 and Angizaar H etc.
|


Preface
Recently, our SRDP (Student Researching and Development Project) occurs some problems about how to track multi objectives in one kind and count them. We then try the deep sort network based on YOLO-v3(You Only Look Once) network, however, although YOLO may be tested and deployed on pytorch or other DeepLearning framework, it only support darknet to train.
Preparation
- OpenCV. May this blog is helpful for you.
- Custom data for VOC2007. May this blog is helpful for you
- VOC2007 -> YOLO. May this blog is helpful for you.
Deploy
clone the whole project
git clone https://github.com/pjreddie/darknet
modify the configure file
vim Makefile
GPU=1
CUDNN=1
OPENCV=1
NVCC=/usr/local/cuda-8.0/bin/nvcc
Notifying the NVCC
item, cuda-8.0
or cuda-9.0
or 10.0
should be set according your actual state.
make
Just one commend
make -j
download pretrained weight
wget https://pjreddie.com/media/files/darknet53.conv.74
Modifying
cfg/voc.data
classes= 1
train = /home/liuxiang/darknet/scripts/train.txt
valid = /home/liuxiang/darknet/scripts/2007_test.txt
names = /home/liuxiang/darknet/data/voc.names
backup = /home/liuxiang/darknet/results/
backup is path where the weight store.
data/voc.name
One row
holothurian
if you have more than one objects to detect, modifying it is okay.
cfg/yolov3-voc.cfg
Annotate Testing and its relevant configure rows. Apply Training and its relevant rows. batches = 64
is not suggest to change, changing subdivisions
is allowed. If your GPU memory is limited, enlarge it may help you to train. If contrary, reduce it. the picture feed into network each time is $\dfrac{batches}{subdivisions}$
YOLO layers
Separately at row 608, 692, 776, change the classes item in YOLO layers as yours, 1 in ours. And Accordingly the filters of convolutional layers before YOLO should also be changed to filters = (classes + 5) * 3
Train
One command
CUDA_VISIBLE_DEVICES=0 nohup ./darknet detector train cfg/voc.data cfg/yolov3-voc.cfg darknet53.conv.74 -gpus 0 2>&1 >train_yolov3.log &


Dear, Beloved Friend, I am Mrs. Susan John from London ; I am married to Mr. John Mike who worked with London embassy for Ten years before he died in the year 2004. We were married for eleven years without a child. He died after a brief illness that lasted for only four days. Before his death we were both born again Christian. Since his death I decided not to remarry or get a child outside my matrimonial home which the Bible is against. When my late husband was alive he deposited the sum of $9.8Million (NINE Million Eight hundred thousand U.S.Dollars) with one Bank in London Presently, this money is still with the Bank. Recently, my Doctor told me that I would not last for the next Eight months due to cancer problem. The one that disturbs me most is my stroke sickness. Having known my condition I decided to keep this fund in the Bank I want an organization or an individual that will use this fund for orphanages, widows, propagating the word of God and to endeavor that the house of God is maintained. The Bible made us to understand that blessed is the hand that grivet. I took this decision because I don't have any child that will inherit this money and my husband relatives are not Christians and I don't want my husband’s efforts to be used by unbelievers. I don't want a situation where this money will be used in an ungodly way. This is why I am taking this decision. I am not afraid of death hence I know where I am going. I know that I am going to be in the bosom of the Lord. Exodus 14 VS 14 says that the lord will fight my case and I shall hold my peace. I don't need any telephone communication in this regard because of my health hence the presence of my husband's relatives around me always. I don't want them to know about this development. With God all things are possible. As soon as I receive your reply I shall inform the Bank in London that you are the beneficiary of the said fund in London . I will also issue you an authority letter that will prove you the present beneficiary of this fund. I want you and the organization to always pray for me because the lord is my shepherd. My happiness is that I lived a life of a worthy Christian. Whoever that wants to serve the Lord must serve him in spirit and truth. Please always be prayerful all through your life. Any delay in your reply will give me room in sourcing another person for this same purpose. Please assure me that you will act accordingly as I stated herein. Hoping to receive your reply and Remain blessed in the Lord. Yours in Christ, Mrs. Susan John GREETINGS FROM MRS SUSAN JOHN


| Number of species: | {{speciesCountAll}} | |
| Number of occurrences: | {{countAll}} | |
| Classification (first 10): |
{{c.scientificName}} >
|
|
| List of LSIDs (first 10): | {{x.name}}, | |
| Data providers: |
{{x.name}}
{{x.name}}: {{x.count}} records
|
|
| QID | {{species.qid}} | |
| Table view of these records | ||
| Standard download of these records |


With this page you can connect to your mqtt broker via websockets. After the connection is established, you can create dashboards and add widgets to them. There are widgets for subscribing to topics and widgets for sending strings to topics via buttons. Connections and Dashboards are saved in local storage and are available after reopening this page.


#assign elastic_queue = "true">
There are quite a few different reasons why ElasticSearch integration is useful to applications using Ebean ORM.


on web stuff
jQuery, underscore, basic JavaScript
jQuery-less JavaScript, prototypal inheritance, JS frameowrk
Creating a new repo, Cloning a repo, branching and merging locally.
Collaboration workflow, pull requests, code reviews
Keep your scripts out of your head tag.
Limit the number of http requests.
Reduce http overhead via minification.
AMD, RequireJS
Uglify


To get current weather report for your location, please accept the request to access your location in {{weatherctrl.timer}} secs...
or provide your location manually
To get current weather report for your location, please accept the request to access your location in {{weatherctrl.timer}} secs...
or provide your location manually


Home
About
Archive
Tag
Seonho Oh's Blog
Think different. Being positive.


git-upload-pack - Send objects packed back to git-fetch-pack
git-upload-pack [--strict] [--timeout=<n>] <directory>
Invoked by git fetch-pack, learns what objects the other side is missing, and sends them after packing.
This command is usually not invoked directly by the end user. The UI for the protocol is on the git fetch-pack side, and the program pair is meant to be used to pull updates from a remote repository. For push operations, see git send-pack.
--strict
Do not try <directory>/.git/ if <directory> is no Git directory.
--timeout=<n>
Interrupt transfer after <n> seconds of inactivity.
<directory>
The repository to sync from.
Part of the git(1) suite


GSTIN
Year
Sheet Status
Warehouse Name
Month
3.1 Details of outward supplies and inward liable to reverse charge
| Name of supplier | Total taxable value | Integrated tax | Central tax | State/UT Tax | Cess |
|---|---|---|---|---|---|
| (a)Outward taxable supplies( other than zero rated, nil rated and expanded ) | {{total_taxable_value}} | {{integrated_tax}} | {{central_tax}} | {{state_tax}} | {{cess}} |
| (b)Outward taxable supllies( zero rated ) | 0 | 0 | 0 | 0 | 0 |
| (c)Other outward taxable supplies( Nil rated, expanded ) | 0 | 0 | 0 | 0 | 0 |
| (d)Inward supplies(liable to reverse charge ) | 0 | 0 | 0 | 0 | 0 |
| (e)Non-GST outward supplies | 0 | 0 | 0 | 0 | 0 |
| Total | {{total_taxable_value}} | {{integrated_tax}} | {{central_tax}} | {{state_tax}} | {{cess}} |
4. Eligible ITC
| Details | Integrated tax | Central tax | State/UT Tax | Cess |
|---|---|---|---|---|
| A) ITC Available(Whether in full or part) | ||||
| 1)Import of goods | 0 | 0 | 0 | 0 |
| 2)Import of services | 0 | 0 | 0 | 0 |
| 3)Inward supplies liable to reverse charge ( other than 1&2 above ) | 0 | 0 | 0 | 0 |
| 4)Inward supplies from ISD | 0 | 0 | 0 | 0 |
| 5)All other ITC | {{integrated_tax_itc}} | {{central_tax_itc}} | {{state_tax_itc}} | {{cess_itc}} |
| B) ITC Reversed | ||||
| 1)As per Rule 42 & 43 of SGST/CGST rules | 0 | 0 | 0 | 0 |
| 2)Others | {{other_integrated_tax}} | {{other_central_tax}} | {{other_state_tax}} | {{other_cess}} |
| C)Net ITC Available (A) - (B) | {{integrated_tax_available}} | {{central_tax_available}} | {{state_tax_available}} | {{cess_available}} |
| D) Ineligible ITC | ||||
| 1)As per section 17(5) of CGST/SGST Act | 0 | 0 | 0 | 0 |
| 2)Others | 0 | 0 | 0 | 0 |
5. Values of exempt,Nil-rated and Non-Gst inward Supplies
| Nature of supplies | Inter-State supplies | Intra-State supllies |
|---|---|---|
| From a supplies under composition scheme,Exempt and Nil rated supply | 0 | 0 |
| Non GST supply | 0 | 0 |
| Total | 0 | 0 |
5.1 Interest & Late fee payable
| Description | Integrated tax | Central Tax | Sate/UT Tax | Cess |
|---|---|---|---|---|
| Interest | 0 | 0 | 0 | 0 |
3.2 of the supplies Shown in 3.1(a), details of inter-state supplies madeto unregistered person, composition taxable person
| Place of Supply( State/UT ) | Supplies made to unregistered persons | Supplies made to composition taxable persons | Supplies made to UIN holders | |||
|---|---|---|---|---|---|---|
| Total taxable value | Amount of integrated tax | Total taxable value | Amount of integrated tax | Total taxable value | Amount of integrated tax | |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Total | 0 | 0 | 0 | 0 | 0 | 0 |


Gluten-Free Lemon-Blueberry Muffins
Search Results
Ingredients:
Batter
- 1 ½ cups Bob’s Red Mill Gluten Free Biscuit and Baking Mix
- ½ cup sugar
- ¼ cup unsalted butter, melted
- 2 eggs
- ½ cup milk
- ½ teaspoon vanilla bean paste
- zest of one lemon
- juice of one lemon
- 1 cup fresh blueberries
Streusel
- 6 Tablespoons unsalted butter
- 1 ½ cup gluten free all-purpose flour
- ½ cup sugar
- ¼ teaspoon salt
- ⅓ cup oats
Lemon Glaze
- 1 ½ cups powdered sugar
- ½ teaspoon vanilla bean paste
- 3 tablespoons fresh lemon juice
Directions:
- First, make the streusel by placing the butter in a small saucepan over medium-low heat. Once the butter is melted, stir in all other ingredients with a fork. Stir until evenly distributed and set aside.
- Preheat oven to 350°F and grease a muffin tin.
- For the batter, place the baking mix and sugar in a medium bowl and whisk to combine.
- In a large bowl, whisk together the butter, eggs, milk, vanilla, and lemon juice & zest.
- Pour the dry ingredients into the wet ingredients and stir until just combined. Fold in the blueberries.
- Fill each muffin cup until almost full and sprinkle some streusel on top. Let muffins sit for 10 minutes.
- Place in oven and bake for 20-25 minutes or until a cake tester inserted into the muffins comes out clean.
- While the muffins are baking, prepare your glaze. Place all ingredients in a small bowl and stir until no lumps remain.
- After your muffins are done baking, let them rest for 5 minutes and then transfer to a cooling rack to let cool.
- Let muffins cool completely before drizzling some glaze on top. Let glaze harden before eating.


It's as exciting as it sounds!
I'm a New York City based Software Engineer with a few decades of experience.
If that sounds interesting, you might look at my resume.
I haven't yet dug into documentation for Github's Jekyll template support, so this is quite static. I hope you're good with that.
We could have recently met in the whirlwind between working in Seattle and Seoul. I even got to visit Shanghai.
Google in Chelsea was a great place to meet people with neat ideas, some of them were even relevant to Google! Personally, the Serif logo was the right logo.
Maybe we met at Travelocity or IgoUgo. That gnome was a playful ambassador; I had the snorkling one on my desk.
You might know me from EMC Corporation. It was a long time ago, but we sure had a fun time with petabyte scale tape-library robots, didn't we?
For now, glean what you can via stalking.
You probably noticed this site is really just a couple of links out to my linkedin, resume, github, and Google+ profiles. This is because I do not spend a lot of time writing blog posts and such. To explain, G+ was alive and well when I started this.
As noted above, I'm a NYC SW Eng with decades of experience. I have a family here (🇺🇸) and extended family in Switzerland (🇨🇭), France (🇫🇷), Canada (🇨🇦), and Korea (🇰🇷). I grew up in Dubai (🇦🇪).
If I said "at gmail" would that mean something to you?
Actually there's a fun way to get a link to my email on my resume. You'll need to click after m: twice.


My Bio
Graduate from the University of Puerto Rico in Humacao, with a International Business and Accountings BBA. Currently studying a Juris Doctor in the University of Puerto Rico, Rio Piedras campus. Worked in government, non-profit organizations and technology industries. Interested in Intelectual Property and Technology Law.
Experience
Assistant Web Development
- Develop Web Forms Views for Web Application in order for them to export their operations to Colombia.
Project Manager
- Design the agenda flow and planed logistics for the event discussing the reality of Puerto Rico and the importance of the 17 Sustainable Development Goals of the United Nations.
- Create alliances with Enactus Puerto Rico, the Polytechnic University, Ballet Concierto and other companies to identify and recruit speakers and fundraise donations event.
Campaign Manager, Social Media Manager
- Manage successful campaign implementing strategic plans in order to obtain awareness and growth in the number of votes.
- Attend events and create network to create campaign and platform awareness.
- Design and executed social campaign with digital art promotions for networking events.
Team Leader
- Finance, Legal and Business Development Manager: Manage and supervise budgets, bookkeeping, legal documentation and the creation of partnerships for the entity at a national level (120+ members island wide) and improve product development for the organization’s innovations and growth.
- President & Founder: Lead the board of directors in order to open an Official Extension at the University of Humacao being part of the organization’s network and coordinate alliances between AIESEC in Humacao and the University of Puerto Rico.
PromoExport Intern
- Organized exhibitions, conferences and projects for 25+ local and 10+ foreign companies to promote trade of goods and services between Puerto Rico and other countries.
Education
Learned basic installation of MongoDB, JSON, schema design, querying, insertion of data, indexing and working with language drivers.
I am in my first year of Law School. To see more of my experience please visit:
My ArticlesLearned and developed Web Development projects using html, CSS, JavaScript, Node.js and Express. See more here:
My ProjectsHonors and Awards
Creation of a complete StartUp using the Business Model Canvas in 54hours and present the idea to a panel of judges from EDP University and Puerto Rico Trade Center.
Scholarship recipient to participate at the 26th Annual Conference at Washington, DC.
Skills and Interest
Web Development: HTML, CSS, Bootstrap, JavaScript, JQuery., C# and ASP.net. Interests: Art, Technology, Business, Diplomacy, Economics, Public Affairs and International Relations.


This is a simple Chess AI, that uses the minimax algorithm to evaluate the next few positions. It doesn't learn from played matches or any dataset. If you scroll down you can see the next moves for the AI to choose from. The algorithm isn't perfect but it know's how to capture figures and more. If you have enough computing power make the tree deeper, so the AI becomes smarter. Now have fun play against it!


Kylian Mbappe: PSG star backs Lionel Messi for Ballon d'Or award
- Kylian Mbappe believes Lionel Messi deserves to win 2019 Ballon d'Or award
- The French sensation says he is convinced the Barcelona star had a remarkable 2019 above others
- Messi will face stiff competition from Juventus star Cristiano Ronaldo and Liverpool's Virgil van Dijk
Paris Saint Germain forward, Kylian Mbappe, has thrown his weight behind Barcelona talisman Lionel Messi for the prestigious Ballon d'Or 2019 award.
The Argentine faces stiff competition from his close rival Cristiano Ronaldo and Liverpool's centre-back Virgil van Dijk ahead of this year's award gala slated for December.
Messi failed to win Champions League but under his enviable tutelage, Barcelona coasted to a big glory with domestic win.
The winger netted an astonishing 51 goals in all competitions for his club in the 2018-19 campaign.
And Mbappe, who is also a strong contender for the coveted gong, backed Messi for the individual honour.
Deontay Wilder 'attacks' Anthony Joshua, makes stunning revelation about Ruiz ahead of Saudi rematch
The PSG star was convinced the Argentine will clinch the award because he boasts the most remarkable calendar year among the thirty nominees, Goal reports.
“Messi. In individual terms, he was the best this year,” Mbappe told German media outlet Der Spiegel.
The 32-year-old Argentine forward has won the awards on five different occasions tying him with Juventus striker Ronaldo who also has five pieces of the honour in his name.
Messi won the Ballon d'Or award in 2009, 2010, 2011, 2012 and 2015, and he is one of the three favourites to take away the most sought gong this year.
The Barcelona superstar was recently crowned FIFA The Best player for the year 2019 after helping his team win La Liga last season.
The Argentine beat Liverpool's Virgil Van Dijk and his arch-rival Cristiano Ronaldo to the prestigious award.
PAY ATTENTION: Install Pitch Football App for FREE to get the latest football News & Scores
Super Eagles star beats Man City's Sterling, Chelsea's Jorginho to Premier League landmark
Meanwhile, Legit.ng had reported that Kylian Mbappe has become the youngest footballer to score 15 goals in the Champions League.
Mbappe achieved the rare feat after scoring a sensational second half hat-trick for Paris Saint-Germain against Club Brugge on Tuesday night, October 22.
Can Liverpool retain the Champions League Title | Legit TV


PAM_ISSUE
Section: Linux\-PAM Manual (8)Updated: 06/16/2009
Index Return to Main Contents
pam_issue - PAM module to add issue file to user prompt
Synopsis
- pam_issue.so [noesc] [issue=issue-file-name]
DESCRIPTION
Recognized escapes:
\d
- current day
\l
- name of this tty
\m
- machine architecture (uname -m)
\n
- machine's network node hostname (uname -n)
\o
- domain name of this system
\r
- release number of operating system (uname -r)
\t
- current time
\s
- operating system name (uname -s)
\u
- number of users currently logged in
\U
- same as \u except it is suffixed with "user" or "users" (eg. "1 user" or "10 users")
\v
- operating system version and build date (uname -v)
OPTIONS
noesc
- Turns off escape code parsing.
issue=issue-file-name
- The file to output if not using the default.
MODULE TYPES PROVIDED
Only the auth module type is provided.
RETURN VALUES
PAM_BUF_ERR
- Memory buffer error.
PAM_IGNORE
- The prompt was already changed.
PAM_SERVICE_ERR
- A service module error occurred.
PAM_SUCCESS
- The new prompt was set successfully.
EXAMPLES
Add the following line to FC/etc/pam.d/loginF[] to set the user specific issue at login:
-
auth optional pam_issue.so issue=/etc/issue
SEE ALSO
AUTHOR
pam_issue was written by Ben Collins<EMAIL_ADDRESS>Index
This document was created by man2html, using the manual pages.
Time: 05:34:28 GMT, December 24, 2015


THE SAILOR WIZARD.
THIS appears to have been, and it may still be, a very common superstition. I have lately received from Mr T. Q. Couch of Bodmin the story of some sailors, who had reason to suspect that one of their body was a wizard. This was eventually proved to have been the case, by circumstances in every way resembling those of our old witch. There had been a quarrel, and revenge had been talked of. The sailors were all grouped together in the forepart of the ship, except the suspected one, and a toad fell sprawling amongst them. One of the men flung the creature into the fire in the caboose. It struggled for a moment in the fire, and then by a convulsive effort flung itself out. Immediately the toad was caught up by one of the men, and flung into the sea.
 In a drunken frolic he had first fallen into the fire at a low beer shop or "Kiddle-e-wink," and subsequently he fell out of the boat into the sea.


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:

/[a-z]+'[a-z]+/]]></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:

 http://tartarus.org/martin/PorterStemmer/

 Any implementation should work, but only Python and Java have been tested. Stem the following excerpt from Wikipedia:

 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.
 Feel free to download a raw text file of the excerpt here.]]></text> <explanation><![CDATA[To use the java file:

 $ 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
 to use the python version:

 $ 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
]]></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-numerical characters:

 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.
 Feel free to download a raw text file of the excerpt here.

 Take special care to avoid treating two consecutive non-alpha-numerical characters as delimiting an empty token (see the -s flag for tr)]]></text> <explanation><![CDATA[First, download or copy the file:

 $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt

 Then, for the BSD version of tr the following code should work:

 $ tr -sc '[:alnum:]' '\n' < au.txt | wc -l

 In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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 tr and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></explanation> </option> <option id="4d0f8f85a13c26d91010fc3e2828acf4" selected_score="0" unselected_score="0"> <text><![CDATA[[144,1000]]]></text> <explanation><![CDATA[You should be using the utilities tr and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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?

 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.
 Feel free to download a raw text file of the excerpt here.

 Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the -s flag for tr)]]></text> <explanation><![CDATA[First, download or copy the file:

 $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt

 Then, for the BSD version of tr the following code should work:

 $ tr -s '[:space:]' '\n' < au.txt | sort | uniq -c | wc -l

 -

 $ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l

 In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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 tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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.

 You should be using the utilities tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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?

 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.
 Feel free to download a raw text file of the excerpt here.

 Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the -s flag for tr)]]></text> <explanation><![CDATA[First, download or copy the file:

 $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt

 Then, for the BSD version of tr the following code should work:

 $ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l

 -

 $ tr -sc '[:alpha:]' '\n' < au.txt | tr '[:upper:]' '[:lower:]' | sort | uniq -c | wc -l

 In general the manual page is your best friend for problems like these. At a unix-like command-line type:

 $ man NAME-OF-PROGRAM]]></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.

 You should be using the utilities tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></explanation> </option> <option id="41f905bec7d2f935fc509b2c1074865f" selected_score="0" unselected_score="0"> <text><![CDATA[[1,3]]]></text> <explanation><![CDATA[You should be using the utilities tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></explanation> </option> <option id="e667dbd69152fc94c186cb77199e4d8f" selected_score="0" unselected_score="0"> <text><![CDATA[[5,15]]]></text> <explanation><![CDATA[You should be using the utilities tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></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

 You should be using the utilities tr, sort, uniq and wc. In general the manual page is your best friend for problems like these. At a unix-like command line type:

 $ man NAME-OF-PROGRAM]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[
 What is the value in the marked cell of the following Levenshtein distance (substitutions cost 2) table below:

]]></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[]]></text> <explanation><![CDATA[]]></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[]]></text> <explanation><![CDATA[]]></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[]]></text> <explanation><![CDATA[]]></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[]]></text> <explanation><![CDATA[]]></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[]]></text> <explanation><![CDATA[]]></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[
 Consider the Levenshtein distance (substitutions cost 2) table below. What are the backpointers for the highlighted cell?

]]></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[

[the highlighted cell corresponds to the letter 'c' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[]]></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[

[the highlighted cell corresponds to the 'v' in 'cave' and the 'v' in 'vase']]]></text> <explanation><![CDATA[]]></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[

[the highlighted cell corresponds to the letter 'a' in 'cave' and the 's' in 'vase']]]></text> <explanation><![CDATA[]]></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[

[the highlighted cell corresponds to the letter 'e' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[]]></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[

[the highlighted cell corresponds to the letter 'a' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[]]></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.


Enter text into the first text box to encode it, or enter base64 encoded deflate-encoded text into the second to decode


--- layout: page title: About header-img: "img/about-bg.png" ---
Hi guys, I am Mona from Mobile, Alabama. I did my Masters in Business Administration from India back in 2017. Since quite sometime I regretted making certain decisions in my academic life. I started gaining interest in computer programming but thought it's a bit too late for that. I thought I only had two choices, either to go deeper in my field of finance (by studying) or just keep looking for a job through my existing accomplishments. But after hearing of bootcamps that help you become a software engineer, my whole perception changed. Anyway more about that later.


Visibility
Hidden
✔ Small
(Phone Landscape)
Small
(Phone Landscape)
✔ Medium
(Tablet Landscape)
Medium
(Tablet Landscape)
✔ Large
(Desktop)
Large
(Desktop)
✔ X-Large
(Large Screens)
X-Large
(Large Screens)
Visible
Small
(Phone Landscape)
✔ Small
(Phone Landscape)
Medium
(Tablet Landscape)
✔ Medium
(Tablet Landscape)
Large
(Desktop)
✔ Large
(Desktop)
X-Large
(Large Screens)
✔ X-Large
(Large Screens)
Toggle (Hover + Focus)
Hidden Hover
✔ Hidden Hover
Focus Test
Invisible Hover
✔ Invisible Hover
Focus Test
Touch
✔ Hidden Touch
Hidden Touch
✔ Hidden No-Touch
Hidden No-Touch


Del Subtotal (I-squares = 38.7%. p = 0.182) ‘M-H Subtotal
‘Others
Oi (2008)
‘Tao (2011)
Zhang (2010)
Attia (2010)
‘Barbosa (2016)
Del Subtotal (I-squared = 74.0%, p = 0.004) ‘MH Subtotal
Del Overall (I-squares = 78.0%, p = 0.000) ‘MH Overall
NOTE: Weights are from random effects analysis
OR (95% Cl)
0.65 (0.28, 1.48) 0.16 (0.04, 0.68) 0.17 (0.08, 0.85) 0.47 (0.27, 0.81) 0.38 (0.21. 0.69) 0.40 (0.28, 0.60)
0.62 (0.29, 1.32) 6.39 (2.48, 16.48) 1.20064, 222) 1.31 (0.75, 2.20) 0.93 (0.24, 2.52) 1.38 (0.71, 2.65) 1.16 (0.84, 1.61)
(0.78 (0.43, 1.40) 0.74 (0.58, 0.98)
*]
au182 11780 45/105 196/577
20172 41/5645,
zine 2226/3144"
(2344/32018
Bg*
11.53 7.72 B41 13.20 40.88
12.09 10.75 12.80 13.15 10.43 59.14
100.00