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>Lexical Semantics and Question Answering</title> <open_time>2012-04-27 0001</open_time> <soft_close_time>2012-05-22 2359</soft_close_time> <hard_close_time>2012-05-22 2359</hard_close_time> <duration>0</duration> <retry_delay>10</retry_delay> <maximum_submissions>6</maximum_submissions> <modified_time>1335919009996</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="88a53bf7c453e4977c02869d060e40a5" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assume we have a corpus of 1000 words and the following WordNet Hierarchy:

Now assume we collect the following count data for each of the words:

 J = 100
 O = 100
 P = 100
 F = 100
 G = 100
 L = 100
 M = 100
 N = 100
 I = 200

 Assuming that all other words do not appear in the corpus, what is $$\text{sim}_\text{resnick}(J, P)$$? Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43) and use natural log in your calculation.]]></text> <explanation><![CDATA[We can solve this problem by first taking the lowest common subsumer of the two words. We can calculate the probability of that lowest common subsumer by summing up the counts of words in the subtree rooted at the lowest common subsumer (which in this case is simply summing over all the leaves) and dividing that number by 1000, the number of words in the corpus. We then take the negative log of that probability to obtain our answer.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="d42cbe195f9acbe0936a81266e2a626f" selected_score="1" unselected_score="0"> <text><![CDATA[[1.20,1.21]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="4e184e6752d0f765c3016b4e0c22a536" selected_score="0" unselected_score="0"> <text><![CDATA[[-999999,1.199999]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> <option id="ef4525b808586a64f2caf0ada4cd5fd6" selected_score="0" unselected_score="0"> <text><![CDATA[[1.20000001,10000000]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="1564d90ed288af795493b884f4d70794" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assume we have a corpus of 1000 words and the following WordNet Hierarchy:

Now assume we collect the following count data for each of the words:

 J = 100
 O = 100
 P = 100
 F = 100
 G = 100
 L = 100
 M = 100
 N = 100
 I = 200

 Assuming that all other words do not appear in the corpus, what is $$\text{sim}_\text{resnick}(N, L)$$? Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43) and use natural log in your calculation.]]></text> <explanation><![CDATA[We can solve this problem by first taking the lowest common subsumer of the two words. We can calculate the probability of that lowest common subsumer by summing up the counts of words in the subtree rooted at the lowest common subsumer (which in this case is simply summing over all the leaves) and dividing that number by 1000, the number of words in the corpus. We then take the negative log of that probability to obtain our answer.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="2e813ccf3493f21634d2f37329e605f4" selected_score="1" unselected_score="0"> <text><![CDATA[[1.20,1.21]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="328cdf7d9b52d2c00f5057d49463d60a" selected_score="0" unselected_score="0"> <text><![CDATA[[-999999999,1.199999]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> <option id="e99ab656aa8365b070edab85ea84384d" selected_score="0" unselected_score="0"> <text><![CDATA[[1.20000001,10000000]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="7f356cd96535157759385f325ded8cc8" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assume we have a corpus of 1000 words and the following WordNet Hierarchy:

Now assume we collect the following count data for each of the words:

 J = 200
 P = 200
 F = 100
 G = 50
 L = 50
 M = 100
 N = 100
 I = 200

 Assuming that all other words do not appear in the corpus, what is $$\text{sim}_\text{resnick}(F, E)$$? Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43) and use natural log in your calculation.]]></text> <explanation><![CDATA[We can solve this problem by first taking the lowest common subsumer of the two words. We can calculate the probability of that lowest common subsumer by summing up the counts of words in the subtree rooted at the lowest common subsumer (which in this case is simply summing over all the leaves) and dividing that number by 1000, the number of words in the corpus. We then take the negative log of that probability to obtain our answer.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="4c723852d64cd7e3766942a86882f635" selected_score="1" unselected_score="0"> <text><![CDATA[[0.69,0.79]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="2a140baeb26c22a75d078accfe089016" selected_score="0" unselected_score="0"> <text><![CDATA[[0.7900000001,1000000000]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> <option id="b5bbae0fbb15561a2fcaa6cadda71b16" selected_score="0" unselected_score="0"> <text><![CDATA[[-99999999,.68999999]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="6bea3154ca51bc569f6d76526678dbab" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assume we have a corpus of 1000 words and the following WordNet Hierarchy:

Now assume we collect the following count data for each of the words:

 J = 200
 P = 200
 F = 100
 G = 50
 L = 50
 M = 100
 N = 100
 I = 200

 Assuming that all other words do not appear in the corpus, what is $$\text{sim}_\text{resnick}(M, I)$$? Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43) and use natural log in your calculation.]]></text> <explanation><![CDATA[We can solve this problem by first taking the lowest common subsumer of the two words. We can calculate the probability of that lowest common subsumer by summing up the counts of words in the subtree rooted at the lowest common subsumer (which in this case is simply summing over all the leaves) and dividing that number by 1000, the number of words in the corpus. We then take the negative log of that probability to obtain our answer.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="3d74908f690c93f3287b77310211ee9a" selected_score="1" unselected_score="0"> <text><![CDATA[[0.79,0.80]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="ad519b19773c4da1b5645c3b46d59e4e" selected_score="0" unselected_score="0"> <text><![CDATA[[0.800000001,100000000]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> <option id="22e00be56ed8b6769056b034ed660f92" selected_score="0" unselected_score="0"> <text><![CDATA[[-999999999,0.789]]]></text> <explanation><![CDATA[Observe that there are no counts for internal nodes. Thus we can calculate the probability of any node by only examining the counts of the leaves of the subtree rooted at that node.]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[Consider the following list of words and their hypernyms, which are listed in order from the word itself to the root of the WordNet hierarchy:

 shoe, plate, shield, protection, covering, artifact, whole, object, physical entity, entity
 shoe, footwear, covering, artifact, whole, object, physical entity, entity

 drive, propulsion, act, event, psychological feature, abstract entity, entity
 drive, mechanism, device, instrumentality, artifact, whole, object, physical entity, entity

 disc, sound recording, recording, memory device, device, instrumentality, artifact, whole, object, physical entity, entity
 disc, round shape, shape, attribute, abstract entity, entity

 chair, seat, furniture, furnishing, instrumentality, artifact, whole, object, physical entity, entity
 chair, position, occupation, activity, act, event, psychological feature, abstract entity, entity

]]></preamble> <question id="4eb55f98fff40074b2f48f175c88606b" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Calculate wordsim(shoe, drive) and round your answer to two decimal places.]]></text> <explanation><![CDATA[Because there are two senses for each word, we must calculate the pairwise distance between four different pairs of senses. We then take the shortest of those path lengths and use that to compute the wordsim by taking the reciprocal of that number. We can calculate the path length between two senses by examining where along the list of each sense's hypernyms the two senses intersect.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="25d505e4b5ace5c65d748e88ab134e81" selected_score="1" unselected_score="0"> <text><![CDATA[[0.12,0.13]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="d572f96affe0fb3fca64dd4a0167bdaf" selected_score="0" unselected_score="0"> <text><![CDATA[[-999999999,0.1199999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> <option id="4b95d6abd703f1fb8859dca44133d558" selected_score="0" unselected_score="0"> <text><![CDATA[[0.130000001,9999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="cf67911cf04dd226f77e020d56bbc02f" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Calculate wordsim(shoe, disc) and round your answer to two decimal places.]]></text> <explanation><![CDATA[Because there are two senses for each word, we must calculate the pairwise distance between four different pairs of senses. We then take the shortest of those path lengths and use that to compute the wordsim by taking the reciprocal of that number. We can calculate the path length between two senses by examining where along the list of each sense's hypernyms the two senses intersect.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="1de633a38339e350b13f82e709b9b810" selected_score="1" unselected_score="0"> <text><![CDATA[[0.09,0.11]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="7e0ee7084c23b91fbcb3622014c37d3b" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.0899999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> <option id="98dabaa9f426d5897d05be678a95106a" selected_score="0" unselected_score="0"> <text><![CDATA[[0.110000001,99999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="d4eff24e47c8e7ebcaa6fa730bd0e692" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Calculate wordsim(drive, chair) and round your answer to two decimal places.]]></text> <explanation><![CDATA[Because there are two senses for each word, we must calculate the pairwise distance between four different pairs of senses. We then take the shortest of those path lengths and use that to compute the wordsim by taking the reciprocal of that number. We can calculate the path length between two senses by examining where along the list of each sense's hypernyms the two senses intersect.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="54a670f13e844fc787e4ddc23211488c" selected_score="1" unselected_score="0"> <text><![CDATA[[0.14,0.15]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="70cd0cae6da7b9d1693013a5a0165149" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.13999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> <option id="25499c975b66a9c749a7c50cdde7b075" selected_score="0" unselected_score="0"> <text><![CDATA[[0.1500000001,99999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="22bad7533d3a863f6e8496421b441ffc" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Calculate wordsim(disc, chair) and round your answer to two decimal places.]]></text> <explanation><![CDATA[Because there are two senses for each word, we must calculate the pairwise distance between four different pairs of senses. We then take the shortest of those path lengths and use that to compute the wordsim by taking the reciprocal of that number. We can calculate the path length between two senses by examining where along the list of each sense's hypernyms the two senses intersect.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="6d2476fa8f831d5fa8df9fc0b60fac63" selected_score="1" unselected_score="0"> <text><![CDATA[[0.095,0.1050]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="9991b266d0e94cb2a6ebe31e7fd2360c" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.094999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> <option id="23c5b75073ea70c4d3db0fa47cb1f2b8" selected_score="0" unselected_score="0"> <text><![CDATA[[0.10500000001,9999999]]]></text> <explanation><![CDATA[Remember that there are 4 possible pairwise path lengths you must compute.]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="3887428989778a3506e57af644eae6d7" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Let's say we've calculated $$ppmi(\text{Stanford, University})$$, that is the positive pointwise mutual information for the word "Stanford" in the context of "University", and found that to be 2.3219. The particular context we are examining is one in which "University" was the next word following "Stanford", though for this problem, you don't need to be concerned with how the specific context is defined. Your professor now wants you to find how many of the sentences you examined contained the word "Stanford". Rather than running through the entire corpus and searching for the word "Stanford", you instead attempt to calculate this count using numbers you noted from before.

 You remember looking at a corpus of 100,000 sentences, and of those sentences, there was a 50% chance that you saw "Stanford" right before the word "University" in the sentence when a sentence contained "University". For the sake of simplicity, also assume that each sentence contained at most one instance of the word "Stanford" or "University".  Assume that the ppmi was calculated using a log of base 2 and round your answer to the nearest integer. Also, if your integer involves more than three digits, please do not include commas in your response, (so 1,234 -> 1234).]]></text> <explanation><![CDATA[Using the formula for ppmi, we have that,

 $$2.3219 = \frac{P(w | c) P(c)}{P(w)P(c)} = \frac{0.5}{x / 100000}$$

 which we get from the fact that the $$P(c)$$s cancel out. Solving for the equation of $$x$$ gives us our solution of 10000.]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="e178a07875e67163c76d1f01c6c6523f" selected_score="1" unselected_score="0"> <text><![CDATA[[9995,10005]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="dd54e040d94be3287ec450e7bd143da0" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,9994.99999]]]></text> <explanation><![CDATA[Remember that $$P(x, y) = P(x | y) P(y)$$]]></explanation> </option> <option id="97a3d3275a1b36165e3e8d94f4683f2c" selected_score="0" unselected_score="0"> <text><![CDATA[[10005.000001,9999999]]]></text> <explanation><![CDATA[Remember that $$P(x, y) = P(x | y) P(y)$$]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[Assume we have the following co-occurence vectors for the words, "fish", "bird", "ant".

 "fish"
 subj-of-A 3
 mod-of-B 2
 obj-of-B 4
 mod-of-C 2

 "bird"
 subj-of-A 3
 subj-of-D 1
 mod-of-C 4

 "ant"
 subj-of-A 5
 mod-of-C 2
 subj-of-D 1
 obj-of-B 1

 The numbers above represent the count for the context relation to the left.]]></preamble> <question id="cc9bf9ee1a8c3b69b251894aee8935a7" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assuming that counts not listed are 0, calculate the cosine similarity (using counts, not PMI) for "fish" and "bird". Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider "fish" and "bird". We first calculate the lengths of these variables. The length of fish is simply $$\sqrt{3^2 + 2^2 + 4^2 + 2^2} = \sqrt{33}$$ and the length of bird is $$\sqrt{3^2 + 4^2 + 1^2} = \sqrt{26}$$. We now compute the dot product of the fish and bird vectors. We see that they share "subj-of-A" and "mod-of-C", which means the counts for those elements are multiplied together. All those counts contribute nothing to the dot product. Thus we have that the dot product is $$3 \times 3 + 2 \times 4 = 17$$. This gives a cosine similarity of $$\frac{17}{\sqrt{26}\sqrt{33}} \approx 0.5804$$]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="bf76e5505f89b11f232ae64e0138e9eb" selected_score="1" unselected_score="0"> <text><![CDATA[[0.58,0.59]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="b50ae9072592d17bb22963f155a99326" selected_score="0" unselected_score="0"> <text><![CDATA[[-99999999,0.57999999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> <option id="d128719b817fa5cb5d180f2f1e432a87" selected_score="0" unselected_score="0"> <text><![CDATA[[0.590000001,999999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="4962db262dcba2a06ca4a7a70029abb6" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assuming that counts not listed are 0, calculate the cosine similarity (using counts, not PMI) for "fish" and "ant". Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[Question explanation]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="fce5eed4aa0d27e651f5b04fa4945a51" selected_score="1" unselected_score="0"> <text><![CDATA[[0.71,0.72]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="6a147fa93d1d5fae0124cc6b0c26b960" selected_score="0" unselected_score="0"> <text><![CDATA[[-999999,0.709999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> <option id="8f9087de1e8f1e457fa1d23858db3d07" selected_score="0" unselected_score="0"> <text><![CDATA[[0.720000001,9999999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="fe973ed94739e0854decf4ce1144fba9" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Assuming that counts not listed are 0, calculate the cosine similarity (using counts, not PMI) for "bird" and "ant". Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[Question explanation]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="9ed22127d7fe44da69039e87ba180dca" selected_score="1" unselected_score="0"> <text><![CDATA[[0.84,0.85]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="99de008a0f9b4bb24aadcd8ecd14ba3d" selected_score="0" unselected_score="0"> <text><![CDATA[[-99999999,0.839999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> <option id="119a65c79e4a7bd02e654fb5a6c7e7cd" selected_score="0" unselected_score="0"> <text><![CDATA[[0.85000001,999999]]]></text> <explanation><![CDATA[Remember that in order to take the cross product of two co-occurence vectors, we must align them so that the counts are of the same context.]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[Consider the following queries and the results that follow:

 What is the capital of California?

 1. New York City
 2. Alabama
 3. Sacramento*
 4. Stanford

 What is the capital of Georgia?

 1. Altanta*
 2. Wyoming
 3. Chicago
 4. Washington DC
 5. China
 6. Steve Jobs

 What is the capital of Texas?

 1. Denver
 2. Obama
 3. New York City

 What is the capital of Massachusetts?

 1. Bush
 2. Japan
 3. Massachusetts City
 4. Boston*

 What is the capital of Maryland?

 1. Facebook
 2. Africa
 3. Los Angeles
 4. Annapolis*
 5. England

 What is the capital of Nevada?

 1. Flag
 2. Baton Rouge
 3. Montana
 4. Disney World
 5. New Zealand
]]></preamble> <question id="98329cc9be22e1c923ac0542e6628a6b" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Note that answers which are followed by an asterisk are the correct answers to the query. What is the mean reciprocal rank for the set of queries over the capital of the following set of states:

 California, Georgia, Texas, Massachusetts

 Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider the query set for California, Georgia, Texas, and Massachusetts. In these queries, the correct answer appeared in position 3, 1, never, and 4, respectively. Taking the reciprocals of these values yields 1/3, 1, 0, and 1/4, where a list that does not contain the correct result receives a reciprocal rank of 0. Averaging the reciprocals by taking the sum and dividing by 4 gives 19/48 $$\approx$$ 0.396]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="6c88cad281d32ebfda87e66ff8a72273" selected_score="1" unselected_score="0"> <text><![CDATA[[0.39,0.40]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="a36f6b211de5287c3a80e4970196b202" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.389999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> <option id="9a635b2ff45f91cdfaa25f2701dc0d90" selected_score="0" unselected_score="0"> <text><![CDATA[[0.40000001,99999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="e6a3933ccad69a1a2a11380f3dcfeffd" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Note that answers which are followed by an asterisk are the correct answers to the query. What is the mean reciprocal rank for the set of queries over the capital of the following set of states:

 California, Texas, Maryland, Nevada

 Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider the query set for California, Georgia, Texas, and Massachusetts. In these queries, the correct answer appeared in position 3, 1, never, and 4, respectively. Taking the reciprocals of these values yields 1/3, 1, 0, and 1/4, where a list that does not contain the correct result receives a reciprocal rank of 0. Averaging the reciprocals by taking the sum and dividing by 4 gives 19/48 $$\approx$$ 0.396]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="5ed0f1c78b4b38556b33a2ca0380ccc8" selected_score="1" unselected_score="0"> <text><![CDATA[[0.14,0.15]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="e59893b9fbac41608d0de0a844b47064" selected_score="0" unselected_score="0"> <text><![CDATA[[-99999999,0.139999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> <option id="b0baf098238ecf1a2c5fa16e3d9624e9" selected_score="0" unselected_score="0"> <text><![CDATA[[0.15000001,99999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="61f66a271be937a449a47d83497e5f95" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Note that answers which are followed by an asterisk are the correct answers to the query. What is the mean reciprocal rank for the set of queries over the capital of the following set of states:

 Texas, Massachusetts, Maryland, Nevada

 Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider the query set for California, Georgia, Texas, and Massachusetts. In these queries, the correct answer appeared in position 3, 1, never, and 4, respectively. Taking the reciprocals of these values yields 1/3, 1, 0, and 1/4, where a list that does not contain the correct result receives a reciprocal rank of 0. Averaging the reciprocals by taking the sum and dividing by 4 gives 19/48 $$\approx$$ 0.396]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="df0f040fa5393277f3c2e97c875515c3" selected_score="1" unselected_score="0"> <text><![CDATA[[0.12,0.13]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="5dbe119e24b939d82e94d5877790a754" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.119999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> <option id="5a78d3c8e5d3d7663cd81a0de9c4a145" selected_score="0" unselected_score="0"> <text><![CDATA[[0.1300001,9999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="bcebfb2eddd824a8fb81c43976773b0b" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Note that answers which are followed by an asterisk are the correct answers to the query. What is the mean reciprocal rank for the set of queries over the capital of the following set of states:

 Georgia, Texas, Massachusetts, Nevada

 Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider the query set for California, Georgia, Texas, and Massachusetts. In these queries, the correct answer appeared in position 3, 1, never, and 4, respectively. Taking the reciprocals of these values yields 1/3, 1, 0, and 1/4, where a list that does not contain the correct result receives a reciprocal rank of 0. Averaging the reciprocals by taking the sum and dividing by 4 gives 19/48 $$\approx$$ 0.396]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="2a8b9d3b4b84b138c78d4dfe7b3bc913" selected_score="1" unselected_score="0"> <text><![CDATA[[0.31,0.32]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="3d1441155cc5d5ec174d629660a08a1a" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.30999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> <option id="9badd7d79c10fb0f926eb540bb95aca5" selected_score="0" unselected_score="0"> <text><![CDATA[[0.3200001,999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="b100f2bdb98ed1ae76b13cf6fe237473" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Note that answers which are followed by an asterisk are the correct answers to the query. What is the mean reciprocal rank for the set of queries over the capital of the following set of states:

 California, Georgia, Massachusetts, Maryland

 Round your answer to two decimal places (e.g. 0.35, 0.60, 1.43).]]></text> <explanation><![CDATA[As an example, consider the query set for California, Georgia, Texas, and Massachusetts. In these queries, the correct answer appeared in position 3, 1, never, and 4, respectively. Taking the reciprocals of these values yields 1/3, 1, 0, and 1/4, where a list that does not contain the correct result receives a reciprocal rank of 0. Averaging the reciprocals by taking the sum and dividing by 4 gives 19/48 $$\approx$$ 0.396]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="107066d49fe23d7635a69ccf333ced04" selected_score="1" unselected_score="0"> <text><![CDATA[[0.45,0.46]]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="2554e38f9e59ad93e7eae5ec50f2218d" selected_score="0" unselected_score="0"> <text><![CDATA[[-9999999,0.44999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></explanation> </option> <option id="abb0db6900629b0ee57989898b8330d9" selected_score="0" unselected_score="0"> <text><![CDATA[[0.46000001,999999]]]></text> <explanation><![CDATA[Remember that lists which don't contain the correct answer have a reciprocal rank of 0.]]></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.


Display List Item - With Partial Navigation
A Display list without border, setting [noBorder]="true"
will help to have no border and
[navigationIndicator]="true"
helps to display navigation and it will display navigation for specfic
items for which navigtion indicator is set to true again, by default its value is false. Below examples shows
declarative way to bind the list items. Where we can pass list items individually where a number of items are
less
Display List Item - Navigation
Display List with Navigation Option. [navigationIndicator]="true"
will provide *>* indicator,
[link]
will help to get into the desired destination on click of navigation. Below example shows
declarative way to use it.


AIMEX SOFTWARE
JUAN DELACRUZ
HELLO USER!
ENTER YOUR CLIENT'S FULL NAME
FIRST NAME
LAST NAME
TRANSACTION TYPE:
NEW
OLD (REFER FOR PREVIOUS TRANSACTIONS)
PROCEED TO CLIENT APPLICATION FORM
NOTE: IF THE TRANSACTION TO BE DONE WOULD REFER TO A PRECIOUS TRANSACTION, CLICK 'OLD'.


| With exclusive access to his extraordinary unseen and unheard personal archive including hundreds of hours of audio recorded over the course of his life, this is the definitive Marlon Brando cinema documentary. Charting his exceptional career as an actor and his extraordinary life away from the stage and screen with Brando himself as your guide, the film will fully explore the complexities of the man by telling the story uniquely from Marlon's perspective, entirely in his own voice. No talking heads, no interviewees, just Brando on Brando and life. | |
| Genres: | Documentary, Biography |
| Director: | Stevan Riley |
| Writer: | Stevan Riley, Peter Ettedgui |
Cast: | Himself - Marlon Brando Herself - Stella Adler Himself - Bernardo Bertolucci Young Marlon Brando - Michael Borne Himself - Marlon Brando Sr. Himself - Christian Brando Himself - Dick Cavett Himself - Montgomery Clift Himself - Francis Ford Coppola Herself - Bette Davis Himself - Joel Grey Herself - Anna Kashfi Himself - Robert F. Kennedy Himself - Martin Luther King Herself - Sacheen Littlefeather Herself - Dorothy Malone Himself - Kevin McCarthy Himself - Roger Moore Himself - Edward R. Murrow Himself - Richard Nixon Himself - Burt Reynolds Himself - Konstantin Stanislavski Herself - Tarita Herself - Liv Ullmann Himself - Jersey Joe Walcott Herself - Esther Williams |


This is a detailed Matlab implementation of classic inpainting methods.
All the scripts provided are used in Partial Differential Equation Methods for Image Inpainting (Carola-Bibiane Schoenlieb, Cambridge University Press, 2015):
@book{Schonlieb:2015ux,
author = {Sch\"{o}nlieb, Carola-Bibiane},
title = ,
publisher = {Cambridge University Press},
month = {November}
year = {2015},
}
Please use the following entry to cite this code:
@Misc{MATLABinpainting2016,
author = {Parisotto, Simone and Sch\"{o}nlieb, Carola},
title = {MATLAB Codes for the {Image} {Inpainting} {Problem}},
howpublished = {GitHub repository, {MATLAB} Central File Exchange},
month = {September},
year = {2016}
}
Copyright (c) 2016, Simone Parisotto and Carola-Bibiane Schoenlieb All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

Path: ./amle/inpainting_amle.m
Note: Used to reproduce Figure 4.10 in \cite{Schonlieb:2015ux}. (Only grayscale images).
Bibliography:
Path: ./harmonic/inpainting_harmonic.m
Note Used to reproduce Figure 2.2 in \cite{Schonlieb:2015ux}. This program solves harmonic inpainting via a discrete heat flow. (Both Grayscale / Color Images).
Bibliography:
Path: ./mumford-shah/inpainting_mumford-shah.m
Note: Used to reproduce Figure 7.3 in \cite{Schonlieb:2015ux}. (Both Grayscale / Color Images).
Bibliography:
Path: ./cahn-hilliard/inpainting_cahn_hilliard.m
Note: Used to reproduce Figure 5.9 in \cite{Schonlieb:2015ux}. (Both Grayscale / Color Images).
Bibliography:
Path: ./transport/inpainting_transport.m
Note: Refer to Section 6.1 in \cite{Schonlieb:2015ux}. (Both Grayscale / Color Images).
Bibliography:


SENDING:
FROM:
Choose Account to send from
Toggle Dropdown
Primary Spend Account
175
Savings
0
Generate new address
TO:
Send Now
Send Later
Reset
History
Account history coming soon
×
Name your account


UPDATES: Callie was last updated on September 23rd, 2017.
This is a one-man side project, so I appreciate the folks who have reached out via email to let me know when they've encountered any issues or bugs. Please continue to do so, and I'll work to keep Callie as consistent and reliable as possible. Maintaining a slack app for thousands of users is, unsurprisingly, a decent amount of work, so if you use Callie and enjoy the experience, please consider making a small donation to support free software. Callie and I appreciate it!
Just a few commands gives Callie all she needs to keep you and your team informed of upcoming events, trips, or deadlines.
Let Callie give you weekly or daily updates on the countdown, and update your settings whenever you like.
That's what we're all here for, really.  Right?


Command Terminal¶
Set up a Terminal for Windows 10
Install Ubuntu
Follow the instruction of this tutorial and another Chinese version tutorial. Now please restart your laptop.
Install Cmder
Cmder is a more user friendly command line terminal than cmd, which gave me a shock when I used it for the first time. Unzip the files to C:\Program Files\Cmder.
Add the path where the cmd.exe lies in to the system environment, which enables you to use Cmder with the Win+r shortcut followed by cmder. You may follow the this example. Open the cmd terminal as adminitrator, type in the following the command:
cmder.exe /REGISTER ALL
Now you can srart your cmder with Win+Alt+P. Find the setting opition at the right bottom of cmder terminal and click the Startup, choose Command line and set it as
bash -cur_console:p
. Enter the bash shell with the following way: click the green icon at the right bottom, choose 3:{bash} and 4:{bash}, open the setting window, Startup/tasks, set it as {bash::bash} and set taks paramaters as/icon "%CMDER_ROOT%\icons\cmder.ico"
, confirm and exit. Now you can use it. Enjoy!


--- layout: default title: Preface ---
We may define therapy as a search for value. ~Abraham Maslow
text


CD-FIX-PROFILE(1) CD-FIX-PROFILE(1) NAME cd-fix-profile - Color Manager Testing Tool SYNOPSIS cd-fix-profile [ --verbose ] DESCRIPTION This manual page documents briefly the cd-fix-profile command. cd-fix-profile allows an administrator to modify and fix ICC profiles on thier system. The program will also repair common errors found in profiles. OPTIONS This program follows the usual GNU command line syntax, with long options starting with two dashes (`-'). A summary of options is included below. --help Show summary of options. --description Sets the profile description. --copyright Sets the profile copyright. --model Sets the profile model. --manufacturer Sets the profile manufacturer. AUTHOR This manual page was written by Richard Hughes<EMAIL_ADDRESS>8 April,1011 CD-FIX-PROFILE(1)


Fcuksene
Artificial intelligence driving
results for travel industry
Welcome Back, Please login to your account
Or logins with


Substrate RPC Examples
Click any of the links below to see an example of calling the Substrate RPC endpoint.
Balance Transfer
Metadata
Runtime Storage
Utilities


speechmatics.helpers¶
Helper functions used by the library.
-
speechmatics.helpers.
del_none
(dictionary)[source]¶ Recursively delete from the dictionary all entries which values are None. This function changes the input parameter in place.
- Parameters
dictionary (dict) – input dictionary
- Returns
output dictionary
- Return type
dict
-
speechmatics.helpers.
json_utf8
(func)[source]¶ A decorator to turn a function’s return value into JSON
-
speechmatics.helpers.
read_in_chunks
(stream, chunk_size)[source]¶ Utility method for reading in and yielding chunks
- Parameters
stream (io.IOBase) – file-like object to read audio from
chunk_size (int) – maximum chunk size in bytes
- Raises
ValueError – if no data was read from the stream
- Returns
a sequence of chunks of data where the length in bytes of each chunk is <= max_sample_size and a multiple of max_sample_size
- Return type
collections.AsyncIterable


Security for your service
User-friendly
Support with updates
10 000 Assessments per month
24/7 Technical Support
User statistics
Security for your service
User-friendly
Support with updates
100 000 Assessments per month
12/5 Technical Support
User statistics
Security for your service
User-friendly
Support with updates
Unlimited Assessments
24/7 Technical Support
User statistics


pgAdmin has a selection of configuration options that you can use to personalize your workspace. pgAdmin is usually configured by using the Options dialog from within the pgAdmin application; to open the Options dialogue, select Options from the File menu.
The navigation panel on the Options dialog contains a tree control; each node of the tree control provides access to customizable options that are related to the selected node. For information about the configurable options on each node of the pgAdmin tree control, please select from the links shown below.
Contents:


N33b fraud case: Mompha remanded in prison custody
- Embattled Instagram celebrity Mompha has pleaded not guilty to a money laundering charge leveled against him by EFCC
- Mompha was arraigned at a Federal High Court sitting in Ikoyi, Lagos
- The case has been adjourned till Friday, November 29
Popular Dubai-based Nigerian Ismaila Mustapha popularly known on social media as Mompha has pleaded not guilty to a N33 billion money laundering charge leveled against him by the Economic Financial Crimes Commission (EFCC).
According to reports by PM News, the flamboyant Instagram big boy and suspected fraudster was arraigned by the EFCC on Monday, November 25, on a 14-count charge, at a Federal High Court in Ikoyi, Lagos state.
He, however, pleaded not guilty to the charge bordering on money laundering offences.
PAY ATTENTION: Read best news on Nigeria's #1 news app
The report further noted that one Justice Mohammad Liman remanded the bureau de change operator in custody, and adjourned till Friday, November 29, for the hearing of his bail application and commencement of trial.
UPDATED: Court remands Mompha over alleged N32.9bn money laundering
Just recently, Legit.ng gathered that Mompha’s verified account on the photo-sharing app, Instagram, resurfaced after it mysteriously disappeared in the heat of his arrest by the EFCC. Although, the last post on the page appeared to have been shared several weeks ago.
PAY ATTENTION: Get your daily relationship tips and advice on Africa Love Aid group
Similarly, it was gathered that about three accomplices of the individual were nabbed by officials of the anti-graft agency. One of them who is a Lebanese identified as Hamza Koudeih, was arrested in his luxury home situated at the Eko Atlantic Pearl Tower, Victoria Island, Lagos.
PAY ATTENTION: NAIJ.com upgrades to Legit.ng: a letter from our Editor-in-Chief Bayo Olupohunda
NAIJ.com (naija.ng) -> Legit.ng We have upgraded to serve you better
Can you date, marry a yahoo boy? | Legit TV
Court makes final decision on N16.4m fraud charge against ex-IGP


deutsche-telekom
Businessmodel of Deutsche Telekom
Customer Segments
Deutsche Telekom continuously strives to connect people all over the world with their loved ones to share the most beautiful moments of their life. The company targets both individuals and businesses who seek to establish connections with others.
Value Proposition
Deutsche Telekom primarily focuses on innovation, accessibility, and customer relations when it comes to value proposition.
The organization takes great pride in being one of the market leaders in the world of telecom, being number one in Germany. Ever since its inception, Deutsche Telekom was always looking to cutting-edge telephony technologies. Working with the likes of Alexander Graham Bell in the 19th century set the precedence for long-distance telecommunications. Starting in Germany, the technology and reach of Deutsche Telekom extended to the rest of Europe and eventually extended to other continents. This is only possible with the large investments made in research and development as well as the firm working with partners to always find the next best technology.
Deutsche Telekom once had only a few thousand telephone customers in Berlin in the late 1800s, and now it has well over 100 million subscribers all around the world. The organizations seeks to provide service to every single individual on the planet, by acquiring software firms to help create the future world of “connected work and life.” They also work with other software and hardware companies to help realize the interconnected world of the future. Collaborating with the right organizations leads to growth and accessibility, helping people to connect in even the most remote locations.
In addition to providing quality service to their clients, the organization maintains continuous support by always being available to answer any questions and solve any problems. The company strives to ensure that all customers are always receiving a proper network connection in their area. In case of any issues, no matter how big or small, the technical support team is ready to follow up and remedy the situation. Deutsche Telekom has consistently ranked as one of the top telecommunications companies because the company provides grade-A customer service at all times anywhere in the world.
Channels
Deutsche Telekom has a long-standing distribution channel that includes wholesalers, retailers, and distributors. The company has both direct and indirect channels of distributing its good and services. Its own retail stores located all over the world sell products bearing the brand name. Deutsche Telekom also utilizes partner channels to collaborate with other companies to sell its product and service.
The company has implemented an improved online marketing strategy to couple with its already strong non-digital counterpart. Using techniques such as search engine marketing and social media marketing, the firm is tapping into the digital youth, generation Y, millennials, and other tech savvy individuals. By marketing their services with top-of-the-line smartphone brands in the industry, Deutsche Telekom is able to provide topnotch services to customers in all fields, private individuals and business concerns.
Customer Relationships
Deutsche Telekom is a telecommunications company providing communications services for the customers. As a result, there is a highly qualified technical support team in place to take care of any issues. If customers seem to be experiencing a failure in the network or any other service being offered, they can call the support line and talk to an experienced professional to receive aid in solving their problem. The company offers an online portal where anybody can file a complaint with their service and their team will get back to the customer as soon as possible for a one-on-one conversation.
In addition to help services available online and over the phone, the company knows that the best way to establish a strong presence and communication with customers is to have customer care points in cities where services are being offered. Subscribers can drop by the customer care center and talk to a member of tech support face-to-face and explain their problem, whether it be a hardware or software related issue. To provide continuous support to customers shows Telecom’s commitment and dedication to their customer base.
Key Activities
The business model of Deutsche Telekom involves establishing new international standards and to promote and facilitate the sustainable development of environment and society. Climate change, inequality, and a lack of media skills are some of the major challenged faced by modern society. New information and communication technologies can help master these obstacles. To reach this end, the organization is taking four key steps to be a pioneer in communications technology. This helps keep the stakeholders of the firm interested in corporate social responsibility while the company is simultaneously able to make a mark in history in telecommunications.
- Integrated IP Networks: Deutsche Telekom intends to offer its customers the best network and the fastest connections at all times. The Group is working on shifting from a fixed-network infrastructure to an all IP technology. The transition is expected to take place by the end of 2018. By the end of 2017, Deutsche Telekom plans to offer its customers in Europe LTE network coverage of at least 50%.
- Best Customer Experience: Deutsche Telekom understands that customer loyalty and satisfaction ensure the position of market leader and to that end, the firm is improving the service and network quality and ensure reliable and easy to use products and services. The intention is to make service simpler and faster and to ensure a seamless experience for the customer.
- Win with Partners: According to CEO Tim Höttges, “We build standardized platforms – imagine a power strip where partners simply plug in their devices.” Deutsche Telekom wants to collaborate with partners to create innovate products and services. A simplified network infrastructure is being built to allow products from partners to integrate to this platform. Deutsche Telekom is currently doing with partners like Spotify and Evernote, big names in the industry.
- Lead the Business: Deutsche Telekom has high expectations of its business customers unit and the company intends to profit more from growth in IT solutions for the SME sector in Germany. The Group is focusing on cloud services, security services, convergent mobile and fixed-network products, and solutions for virtual collaboration. ### Key Partners
“Win with Partners” is one of the four key elements of Deutsche Telekom’s strategy. This highlights the importance of cooperation for the organizations future success. The company continues to develop its own ideas but it is always open to concepts from other groups and it is increasingly emphasizing the significance of collaborations. From large corporations to small startups, anybody can become a partner on equal terms with Deutsche Telekom.
Partnerships help Deutsche Telekom to set itself apart from the competition. The best networks and services are the foundation for their continued success with customers. Deutsche Telekom works closely together with people in Silicon Valley, Germany, and other tech and innovation hubs.
Their large-scale partners include the likes of Amazon, SAP, Cisco, Apple, Samsung, and Microsoft, just to name a few. Deutsche Telekom has also supported a number of startup companies because the organization realizes that by helping others achieve their goals, everybody can live in a better society.
Key Resources
People are the reason why Deutsche Telekom is as successful as it is today. The company owes all of its success to the amazing personnel they have cultivated with the quality mentorship and leadership programs. With well over 200,000 employees in multiple locations around the globe, Deutsche Telekom has a varied team of sales and marketing staff in addition to excellent engineers and researchers who are always developing new technologies to advance communications.
Being a telecommunications company, research and development is the prime element of Deutsche Telekom and it has brought much success to the company. The scientists, engineers, and researchers employed at Deutsche Telekom are always innovating, thinking of a new idea on a consistent basis. The company has filed for a patent every week for several decades now. To maintain the market leader status, the Group must always ensure Intellectual Property Rights are sustained and the inventions are protected by law. This guarantees that the products are unique and cannot be copied by the competitors.
The technically gifted individuals make the company what it is today, but there needs to be infrastructure to make it all happen. Deutsche Telekom has an extensive system of manufacturing plants and telecommunication towers in the operating zones to provide sustained network coverage. With state-of-the-art laboratories and modern equipment, the engineers are able to create, innovate, test, and implement. This is a necessary business function and keeps the business in prime position.
Cost Structure
In order to create all of the goods and services Deutsche Telekom is renowned for, the company has a highly detailed cost structure to ensure that losses are not incurred. Deutsche Telekom continuously revises the costs involved in marketing and sales, research and development, and product development and manufacturing.
By finding ways to minimize inefficiency and raise productivity, the costs can be lowered and profit margins can be increased. The strategic development leading to continuous improvements in the cost structure and a more integrated structure are the pillars for the company’s long-term business success. Deutsche Telekom Group’s Save for Service program is continuing to improve cost structures.
Revenue Streams
In the year 2015, Deutsche Telekom had a revenue of € 69.2 billion globally from all of their divisions present in all markets of operation. The Deutsche Telekom Group has 156.4 million mobile customers, 25 million fixed-network lines, and 17.8 million broadband lines. The table below provides details of each of the geographic business segments.
Business Segment Revenue (billions in €) Mobile Customers (millions) Fixed-network Lines (millions) Broadband Lines (millions) Employees Germany 22.4 40.4 20.2 12.6 110,354 Europe 12.7 52.2 8.7 5.2 49,638 USA 32 63.3 N/A N/A 44,229 The fourth business segment, T-Systems, offers IT and telecommunications services in all industries, e.g. automotive, finance, transport, and retails sectors. It is a pioneer in cloud computing for corporate customers and private individuals. It enjoyed a revenue of €8.6 billion in 2015 and has 46,000 employees.
With 156 million mobile customers, 29 million fixed-network customers, and 18 million broadband customers, a significantly vast majority of the revenue comes from mobile and landline phone as well as internet services. Furthermore, there are approximately 6.6 million TV customers, a high percentage of which are in Germany, so there is another source of revenue from entertainment TV subscribers.


{{define "body"}} {{$collegesMap := .collegesMap}} {{$collegeAbbreviations := .collegeAbbreviations}}
{{range $name, $abbreviation := $collegeAbbreviations}} | {{$name}} {{end}}|


--- layout: archive title: Zulip Chat Archive permalink: /stream/144837-PR-reviews/topic/1089.20Commuting.20elements.html ---
Hi @Johan Commelin @Chris Hughes , could you please have another look at #1089?
@Yury G. Kudryashov I'll try my best to do it soon
Thank you!
@Yury G. Kudryashov Thanks a lot for bringing this PR up to speed again!
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


---
layout: border
subject: staff-newsletter template
---
During the holiday season the Foundation would like to recognize you for your hard work and dedication by giving you more time to spend with your friends and family. Your options include the 28th, 29th and 30th. Please fill out the Compensatory Time Off to request your day off. Also just a friendly reminder that the 26th and 27th are statutory holidays.
Let’s join the movement and create a healthier workspace! The new Scent Free Workplace Policy can be found in Dropbox!
Removing unnecessary scented products from where you work (and live) can be beneficial for your health, the health of those around you, and the environment. Chemicals used in fragrances can cause health problems such as shortness of breath, headaches and migraines, nausea, muscle pain, and cold-like symptoms. Asthma, emphysema, bronchitis, and allergies can all be adversely affected by the chemicals found in scented products. According to the Lung Association, one study found that 72 per cent of people with asthma had adverse reactions to perfumes.
Holiday Time Off
Happy Holidays!
We are a Scent free Workplace!
Mark your calendars: Dec 12, 2016/ 12:00-3:30pm/ CP1 & 2 Boardrooms.
We have invited Victoria Maxwell to join us and lead a discussion around Mental Illness in the Workplace. At the end of this workshop, you will be able to understand more about the most common mental health issues such as depression, anxiety, and etc, while recognizing typical associated symptoms.
Moreover, you’ll get a chance to recognize the behaviours which are often exhibited at work and are therefore expected. You will also be able to understand the importance of taking a proactive approach to mental health and how the Foundation will support you!
Mental health issues are often misunderstood and stigmatized, and are growing at a faster rate than any other kind of disability in today’s workplace. According to the Canadian Mental Health Association in any given year 1 in 5 Canadians will experience a mental health problem or illness.
Each week approximately 500,000 Canadians don’t feel well enough to go to work due to a mental illness. The Canadian economy spends more than $51 Billion a year in lost productivity due to a workplace mental illness with 70% of overall disability costs attributed to mental health related issues.
|
Now that the year is winding down, we just wanted to take this opportunity to send out a huge thanks to our Social Committee. They take time out of their busy schedules to plan, organize and oversee all of our social events. Their volunteer work and energy is making a difference here in our office and we could not do these events without them. If interested in being a part of this amazing team please email Corina in HR.
Congratulations Mom to Be Adrienne! We are really excited and happy to hear the good news. We are sure you are going to be an excellent Mom!
Congratulations are also in order for a very proud grandma on the arrival of her second granddaughter. All the best Candice!
Welcome!
Craig Reisinger
Associate Director, Fundraising Events
Start Date: November 23rd
Craig started his fundraising career over 20 years ago at CMHA. Since then he has worked at Vancouver Friends for Life Society, Multiple Sclerosis Society of Canada, Canadian Cancer Society, BC Children’s Hospital Foundation, Arts Umbrella, and JDRF. Some of Craig’s fundraising event experience includes managing and producing Art for Life, Super Cities Walk/Run for MS, Diamond Ball, Crystal Ball, Global and Mail Invitational Golf Tournament, Splash and Rockin’ for Research.
Corina Somerville
Human Resources Coordinator
Start Date: October 31st
Corina brings as strong set of skill and a passion for Human Resources and the not-for-profit sector. Previously Corina was the HR/Contract and Legal Assistant to the BC Principal’s and Vice-Principal’s Association where she provided executive support to the Contract and Legal managers. Prior to that she held HR roles with the West Vancouver School District, PMC Sierra and Capilano University. Corina holds a BA in Business Administration (Human Resources) from Simon Fraser University.


The corresponding effective divergent angle Δθ B, source size l ef, energy width δ E and longitudinal coherence length l L for formation of the IFRB between these two beams are in the fourth to the seventh columns. Δ l p in the last column is the path length difference between these two beams.


 |
"Banner" |
NOT SHOWN |
"Banner" |
banner |
"Banner" |
banner |
 |
"Main" |
main |
"Main" |
main |
"Main" |
main |
 |
"Complementary" |
complementary |
"Complementary" |
complementary |
"Complementary" |
complementary |
 |
"Navigation" |
navigation |
"Navigation" |
navigation |
"Navigation" |
navigation |

 |
"Article" |
article |
"Article" |
NOT SHOWN |
"Article" |
NOT SHOWN |
 |
"Footer" |
NOT SHOWN |
"Content" |
content |
"Content information" |
content information |
 |
"Banner" |
banner |
"Banner" |
banner |
"Banner" |
banner |
 |
"Main" |
main |
"Main" |
main |
"Main" |
main |
 |
"Complementary" |
complementary |
"Complementary" |
complementary |
"Complementary" |
complementary |
 |
"Navigation" |
navigation |
"Navigation" |
navigation |
"Navigation" |
navigation |

 |
"Article" |
article |
"Article" |
NOT SHOWN |
"Article" |
NOT SHOWN |
 |
"Contentinfo" |
contentinfo |
"Content" |
content |
"Content information" |
content information |
 |
"Red. Banner" |
NOT SHOWN |
"Red. Banner" |
Red banner |
"Red. Banner" |
Red banner |
 |
"Orange. Main" |
Orange main |
"Orange. Main" |
Orange main |
"Orange. Main" |
Orange main |
 |
"Yellow. Complementary" |
Yellow complementary |
"Yellow. Complementary" |
Yellow complementary |
"Yellow. Complementary" |
Yellow complementary |
 |
"Green. Navigation" |
Green navigation |
"Green. Navigation" |
Green navigation |
"Green. Navigation" |
Green navigation |

 |
"Blue. Article" |
Blue article |
"Blue. Article" |
NOT SHOWN |
"Blue. Article" |
NOT SHOWN |
 |
"Violet. Footer" |
NOT SHOWN |
"Violet. Content" |
Violet content |
"Violet. Content information" |
Violet content information |
 |
"Colour red. Banner" |
NOT SHOWN |
"Colour red. Banner" |
Colour red main |
"Colour red. Banner" |
Colour red main |
 |
"Colour orange. Main" |
Colour orange main |
"Colour orange. Main" |
Colour orange main |
"Colour orange. Main" |
Colour orange main |
 |
"Colour yellow. Complementary" |
Colour yellow complementary |
"Colour yellow. Complementary" |
Colour yellow complementary |
"Colour yellow. Complementary" |
Colour yellow complementary |
 |
"Colour green. Navigation" |
Colour green navigation |
"Colour green. Navigation" |
Colour green navigation |
"Colour green. Navigation" |
Colour green navigation |

 |
"Colour blue. Article" |
Colour blue article |
"Colour blue. Article" |
NOT SHOWN |
"Colour blue. Article" |
NOT SHOWN |
 |
"Colour violet. Footer" |
NOT SHOWN |
"Colour violet. Content" |
Colour violet content |
"Colour violet. Content information" |
Colour violet content information |


Project: Bouncing Ball
New concept: any game, or interactive program, usually uses a gaming loop, which is a never ending loop where you get inputs, make changes, display output
New code
x, y = (3, 3)
while True:
fb.erase()
fb.point(x, y)
fb.show()
time.sleep(.1)
Note: in this case we’re displaying something in a gaming loop - but we didn’t change anything! (We could perhaps increment the point until it falls off the screen)


CatPhotoApp
Click here to view more
cat photos
.
Things cats love:
cat nip
Top 3 things cats hate:
this is another head
flea treatment
thunder
something else
Submit


-
elementKey
String elementKey
The fully qualified key for this element. This is the element's database
column name. For composite types whose elements are individually retained
(e.g., geopoint), this would be the elementName of the geopoint (e.g.,
'myLocation' concatenated with '_' and this elementName (e.g.,
'myLocation_latitude').
Never longer than 58 characters.
Never a SQL or SQLite reserved word
Satisfies this regex: '^\\p{L}\\p{M}*(\\p{L}\\p{M}*|\\p{Nd}|_)*$'
-
elementName
String elementName
The name by which this element is referred. For composite types whose
elements are individually retained (e.g., geopoint), this would be simply
'latitude'
Never longer than 58 characters.
Never a SQL or SQLite reserved word
Satisfies this regex: '^\\p{L}\\p{M}*(\\p{L}\\p{M}*|\\p{Nd}|_)*$'
-
elementType
String elementType
This is the ColumnType of the field. It is either:
boolean
integer
number
configpath
rowpath
array
array(len)
string
string(len)
typename
typename(len)
or
typename:datatype
typename:datatype(len)
where datatype can be one of boolean, integer, number, array, object
Where:
'typename' is any other alpha-numeric name (user-definable data type).
The (len) attribute, if present, identifies the VARCHAR storage
requirements for the field when the field is a unit of retention.
Ignored if not a unit of retention.
The server stores:
integer as a 32-bit integer.
number as a double-precision floating point value.
configpath indicates that it is a relative path to a file under the 'config'
directory in the 'new' directory structure. i.e., the relative path is
rooted from:
/sdcard/opendatakit/{appId}/config/
rowpath indicates that it is a relative path to a file under the row's attachment
directory in the 'new' directory structure. i.e., the relative path is
rooted from:
/sdcard/opendatakit/{appId}/data/attachments/{tableId}/{rowId}/
array is a JSON serialization expecting one child element key
that defines the data type in the array. Array fields
MUST be a unit of retention (or be nested within one).
string is a string value
anything else, if it has no child element key, it is a string
(simple user-defined data type). Unless a datatype is specified.
anything else, if it has one or more child element keys, is a
JSON serialization of an object containing those keys
(complex user-defined data type).
-
listChildElementKeys
String listChildElementKeys
JSON serialization of an array of strings. Each value in the
array identifies an elementKey of a nested field within this
elementKey. If there are one or more nested fields, then the
value stored in this elementKey is a JSON serialization of
either an array or an object. Otherwise, it is either an
integer, number or string field.
If the elementType is 'array', the serialization is an
array and the nested field is retrieved via a subscript.
Otherwise, the serialization is an object and the nested
field is retrieved via the elementName of that field.


Genetics may determine who benefits from broccoli's effects on kidney health
| Source: | American Society of Nephrology |
| Summary: | Deletion of the gene that codes for an enzyme called GSTM1 increased kidney injury in mice with hypertension and kidney disease, but supplementing the diet with broccoli powder lessened kidney injury in the genetically altered mice. In humans, high consumption of broccoli and other cruciferous vegetables was linked with a lower risk of kidney failure, primarily in individuals lacking GSTM1. |
New research indicates that the benefits of a dietary compound on kidney health may depend on an individual's genetics. The findings, which appear in an upcoming issue of JASN, may be helpful for tailoring interventions to prevent or treat kidney disease.
Glutathione S-transferase mu-1 (GSTM1) is an enzyme that plays a role in ridding the body of toxins and combatting oxidative stress. Many individuals carry a variant in the GSTM1 gene that prevents the gene's expression (called a null variant) and therefore they lack production of the enzyme. A team led by Thu H. Le, MD (University of Rochester Medical Center) previously showed that individuals carrying this variant face a higher risk of experiencing kidney function decline.
In their latest study, the investigators found that deletion of the gene increases kidney injury in mice with hypertension and kidney disease. Supplementing the diet with broccoli powder (which is rich in an antioxidant-activating compound) significantly lessened kidney injury in the genetically altered mice, but not in normal mice with kidney disease.
"We speculate that the GSTM1 enzyme may be involved in the breakdown of antioxidant-promoting compounds, and therefore deficiency in the enzyme may increase the bioavailability of protective compounds relevant in kidney disease," said Dr. Le.
When the researchers examined information from a large clinical trial, they found that high consumption of broccoli and other cruciferous vegetables was linked with a lower risk of kidney failure, primarily in participants with the GSTM1 null variant.
"Our study highlights diet-gene interactions in kidney disease and illustrates that response to the disease-modifying effect of diet is influenced by genetics," said Dr. Le. "In the context of personalized and precision medicine, increased consumption of cruciferous vegetables may be protective, particularly in those lacking GSTM1 who are genetically most at risk for kidney disease progression. Furthermore, our study suggests that knowing an individual's genetic information enables tailoring an intervention to prevent or delay kidney disease progression among those who would respond based on their genetic makeup."
make a difference: sponsored opportunity
Story Source:
Materials provided by American Society of Nephrology.
Note: Content may be edited for style and length.
Journal Reference:
- Joseph C. Gigliotti, Adrienne Tin, Shirin Pourafshar, Sylvia Cechova, Yves T. Wang, Sun-sang J. Sung, Gabor Bodonyi-Kovacs, Janet V. Cross, Guang Yang, Nhu Nguyen, Fang Chan, Casey Rebholz, Bing Yu, Megan L. Grove, Morgan E. Grams, Anna Köttgen, Robert Scharpf, Phillip Ruiz, Eric Boerwinkle, Josef Coresh, Thu H. Le. GSTM1 Deletion Exaggerates Kidney Injury in Experimental Mouse Models and Confers the Protective Effect of Cruciferous Vegetables in Mice and Humans. Journal of the American Society of Nephrology, 2019; ASN.2019050449 DOI: 10.1681/ASN.2019050449
Cite This Page:
| MLA | American Society of Nephrology. "Genetics may determine who benefits from broccoli's effects on kidney health." ScienceDaily. ScienceDaily, 14 November 2019. <www.sciencedaily.com/releases/2019/11/191114180027.htm>. |
| APA | American Society of Nephrology. (2019, November 14). Genetics may determine who benefits from broccoli's effects on kidney health. ScienceDaily. Retrieved November 17, 2019 from www.sciencedaily.com/releases/2019/11/191114180027.htm |
| Chicago | American Society of Nephrology. "Genetics may determine who benefits from broccoli's effects on kidney health." ScienceDaily. www.sciencedaily.com/releases/2019/11/191114180027.htm (accessed November 17, 2019). |


--- layout: post title: 'Casuality Europe: Alternative business models for Europe' date: 2006-02-07 00:00:00 categories: business interfaces-&-interaction mobile play ---
Alternative business models for Europe
Julie Pitt, General Manager, RealArcade
Riccardo Zacconi, CEO MidasPlayer
Eric Bethke, CEO GoPets
Kai Bolik, CEO GameDuell
Mathieu Nouzareth, President Boonty
JP: Try-before-you-buy games really picked up after the crash. Real Networks had to convince GameHouse to build a downloadable game. In Asia this model doesn't work so well (perhaps thanks to lack of protection for IP). 2% of games downloaders make a purchase; so most folks aren't spending money for content.
MN: Advertisers are willing to spend lots of money online. They need good products to help them do this. CPM for banners are too low. Rich Media advertising might be an answer. In-game advertising might be an answer.
[ Yuck - are we as an industry really fixated on banner advertising - still? How do production costs for a rich media advert stack up - presumably they're much higher? In-game ads sound more interesting, and you can see a precedent for it with product placement in films - it's familiar, perhaps. ]
MN: A 20mb game with a 2% conversion rate means you're shifting 2GB of data for each 2 sales - that cuts into margins.
JP: Most advertising has been around online games. What about in-game advertising?
MN: Perhaps this is more acceptable in the US which is more accepting of advertising.
KB: When we founded in 2003, games were popular. We wanted to monetise free players and do so by letting them pay small amounts at a time: they place a bet etc. So they're not paying for game content at all.
RZ: We have a 2-step process: at the first step he plays for free, up to 10 times. After that he's asked to upgrade to a paid account: £10, $10, 10 zloty. Once he is paid up, to compete against others he has to take small amounts from his deposit.
[ So it's either advertising-supported or gambling games, thus far. ]
RZ: Our experience is that many factors are at play here: the maturity of the market (how old your players are), say. We offer more than 37 payment systems: different ones for different markets. e.g. in the US credit cards work well, in the UK they're alright, in Germany they don't work that well.
EB: We think that advertising is extremely important. We're cautious about it. Gopets have a tool to let you design clothing for your pets so product placement seems quite natural. This is more exciting for advertisers than banner ads say. Companies like Massive are acting as a bridge between developers and advertisers. There is no equivalent of Massive in the UK yet.
[ So... specialist media buyers for the games industry then. Seems sensible. ]
JP: Massive focus more on the hardcore traditional gaming. They've not really looked at casual gaming much.
[ But this seems to be a theme here: lots of folks from the traditional gaming industry see casual as a new market for them, rather than a new sort of activity. And given that the models, the content, and the audience are all rather different... does this hold? ]
EB: Massive came to us to sign a deal. But they don't have any salespeople selling to women. I could put together Gap Jeans for the pets, but it's difficult without such a salesforce.
JP: It's not necessarily about the play, it's about the things you can add to the play and monetise.
EB: In Korea they had only games with subscription models for some time. Everything else collapsed - retail etc. Then came price competition, and free MMOs. The intention was to build volume then start charging - but users kept switching between games to avoid paying up. Then the "death model" was tried out: paying for new lives, selling accessories, etc. This was quite popular because it kept the perception of "freeness" in the games, but still provided for revenue. Players ended up spending more than they played for the subscription model.
MN: Mixing casual and MMOs is a new idea. Until recently MMOs are for serious gamers and casual games for everyone else.
EB: Western perception is "oh yeah, Korea are just nuts".
RZ: We've launched a sophisticated community. 80% of our users set up an avatar, 25% have bought additional items for their avatar. From surveys, we know that users like this - it's about showing off, it's not just about money.
EB: There was a phase in Korea when everyone had avatars you dress up. That lasted about 9 months before players noticed it had no effect on gameplay. Temporary gameplay-affecting items are the ones which make the most money. Gopets make $30 pcm from their paying users.
RZ: Lipstick, winning modes and losing modes are the biggest sellers.
EB: We have our own virtual currency, which has different exchange rates in different territories depending on friction costs accrued by working with different payment mechanisms. Our top selling item is a virtual rock for our virtual zen garden.
EB: Games have to be designed from the ground up for a given business model. Taking a subscription game and moving it over doesn't work that well. In the West we don't like these models because they seem unfair: but it's just like real life!
[ Maybe this is because we look to games for escapism? ]
Q: You're selling perishable goods. The rock can be used only once and resold. Are you looking to enable a marketplace and let players create and sell their own items?
EB: The initial approach is to make items non-transferable and perishable. This works for a little bit if you're the first mover. CyWorld (?) in Korea had a model where you rented skins for your site, which worked at first but then started losing players. Permanent items should be permanent. If they paid for something from you, they've bought it, and should be able to sell it.
Q: Who are your customers?
EB: Women in their teens and 25-45. Most revenue comes from the latter but the user-base is split.
JP: Other than avatars, how can we monetise community?
MN: Subscriptions? With a low price-point, yep.
RZ: We're monetising what is basically an online community. We don't want users to go away; with our model, we make money from plays so we need to keep them in.
EB: You can make subscriptions work with the item model. We have a limited-edition item which is only available to premium subscribers. This item normally has more game value and tends to resell for $25-35 each time too - so the player sees values. But the item-selling model came first, not subscriptions.
KB: Subscriptions fit well with any long-term proposition; anything which players think they'll need for a long time. Subscriptions need to have unique or exclusive elements to be successful.
JP: Do you price games lower in Italy and Spain (where the market demands lower pricing)
MN: On a case-by-case basis, yes. 25-30% lower.
EB: We price v differently between different territories (China, Philippines, etc.). How do players react to this?
MN: They don't tend to know. Players don't tend to go into price comparison services.
[ All this despite the single currency across Europe! I wonder how long this blindness to price variations will continue. ]
JP: How likely is it that the model will change completely? e.g. ISPs pay for content and bundle with access, as in the RealNetworks/Comcast music product bundle.
MN: This is taking over very quickly in Europe now. If you buy large quantities of games in advance you can do so very cheaply - e.g. 10% of retail. ISPs are fighting hard to acquire and retain customers. We've worked with ISPs giving away free music, games and videos. Games are more effective than music or videos when given away for free.
EB: Some carriers will pay for exclusivity on mobile games.
JP: Where is this going to go in the future?
MN: We've not mentioned loyalty schemes (frequent flyer miles etc.).
JP: People could pay for game content via these existing schemes?
MN: We're doing this in Korea. Companies have such an inventory of this virtual currency that they need ways to get it spent!
KB: Skill gaming is a perfect example of this: a points-burner.
[ Is skill-gaming a euphemism for gambling these days? ]
EB: The item business model is the most efficient I know of: players get to spend what they want to spend. This will happen to every market. The idea that you pay a fixed price for your content will die: we don't do this almost anywhere else in our lives.
[ ? Aside from mobile tariffs, TV subscriptions, magazine subscriptions, etc. ]
Q: What about in-game advertising vs advergames?
MN: I've yet to see a good advergame.
EB: Advertisers want to advertise a product, not develop good games. If I had a product that women over 30 bought a lot of, I'd talk to PopCap.
Q: From the gamers POV, buying an item means more involvement. Isn't this the opposite of casual?
EB: In Korea they have a term "advanced casual games". They have play times of 5-20 minutes. e.g. "freestyle basketball".


Type [class][api.type.class] Library together.* Revision Current Public Version Keywords GameInstanceManager Sample code github samples
The GameInstanceManager is used for fetching and finding matches that exist for the current game.
Finds the GameInstance with the specified GameInstanceID if it exists, otherwise returns nil.
GameInstanceManager:FindByGameInstanceID( gameInstanceID )
Gets the number of GameInstances currently managed internally.
Returns the index of the GameInstance with the specified GameInstanceID if it exists, otherwise returns -1.
GameInstanceManager:IndexOfByGameInstanceID( gameInstanceID )
Creates a new GameInstance. Upon success, this will automatically update the internal list.
GameInstanceManager:Create( gameInstanceType, gameInstanceSubType, roomID, maxUsers, passTurn, gameInstanceProperties, gameInstanceUserProperties, callbackFunc )
string gameInstanceType
The type of GameInstance to create. Potentially, a Game could have several types of GameInstance types within it. Type is limited to 16 characters.
string gameInstanceSubType
The subtype of the GameInstance that will be created. Potentially, a Game could have several sub types within it. SubType is limited to 16 characters.
number roomID
The ID of the room the rematch GameInstance is created in. Pass 0 to bypass room creation.
number maxUsers
The max number of users the GameInstance supports. Pass in 2 for a two player game.
boolean passTurn
A boolean indicating whether the turn should be passed immediately onto the next User. When true, the TurnUserID will actually be set to nil. When the next User joins the GameInstance, the TurnUserID will be set to them.
PropertyCollection gameInstanceProperties
The properties to assign to the GameInstance. Pass nil to assign no properties to the GameInstance.
PropertyCollection gameInstanceUserProperties
The properties to assign to your GameInstanceUser. Pass nil to assign no properties to the GameInstanceUser.
function callbackFunc
The function to call upon completion.
Creates a rematch of a GameInstance. Upon success, this will automatically update the internal list. If the GameInstance is not already finished, it will be finished and a leaderboard will be generated.
GameInstanceManager:CreateRematch( originalGameInstanceID, gameInstanceType, gameInstanceSubType, roomID, maxUsers, winningUserID, turnUserID, includeLeftGameUsers, rematchMessage, originalGameProps, origianlGameWinningUserProps, rematchGameProps, callbackFunc )
number originalGameInstanceID
The ID of the original GameInstance we're creating a rematch from.
string gameInstanceType
The type of GameInstance to create. Potentially, a Game could have several types of GameInstance types within it. Type is limited to 16 characters.
string gameInstanceSubType
The subtype of the GameInstance that will be created. Potentially, a Game could have several subtypes within it. SubType is limited to 16 characters.
number roomID
The ID of the room the rematch GameInstance is created in. Pass in 0 for no room.
number maxUsers
The max number of users the GameInstance supports. Pass in 2 for a two player game.
number winningUserID
The ID of the User that has won the GameInstance.
number turnUserID
The ID of the User whose initial turn it is.
boolean includeLeftGameUsers
A boolean dictating whether users that have left the original game should be included in the rematched GameInstance.
string rematchMessage
The notification message to send to all other users that are a member of the rematched GameInstance. Pass "" to have no notification message sent.
PropertyCollection originalGameProps
The final properties of the original GameInstance.
PropertyCollection origianlGameWinningUserProps
The properties of the winning User of the original GameInstance.
PropertyCollection rematchGameProps
The properties of the rematch GameInstance. Pass in nil to assign no properties to the rematched GameInstance.
function callbackFunc
The function to call upon completion.
Deletes a GameInstance. Upon success, this will automatically update the internal list.
GameInstanceManager:Delete( gameInstanceID, callbackFunc )
number gameInstanceID
The ID of the GameInstance to delete.
function callbackFunc
The function to call upon completion.
Gets all GameInstances. Upon success, this will automatically update the internal list.
GameInstanceManager:GetAll( userID, stateMask, maxCount, getGameInstanceProperties, friendsOnly, gameInstanceType, gameInstanceSubtype, callbackFunc )
number userID
The ID of the User who must be a member of a GameInstance retrieved. Pass 0 to fetch all games regardless of membership within them.
table stateMask
A table containing the GameInstance States to retrieve. The following stateMask table members are examined:| waitingForPlayers | Waiting for players to join the game. |
| inProgress | Players are currently playing the game. |
| finished | Game has been finished and a leaderboard was generated. |
| possibleRematch | A rematched Game waiting for enough players to join. |
| forfeit | Game was forfeited by a User. |
-- To get all GameInstances that are playable. local stateMasks = { waitingForPlayers=true, inProgress=true }; -- To get all GameInstances regardless of State. local stateMasks = { waitingForPlayers=true, inProgress=true, finished=true, possibleRematch=true, forfeit=true };
number maxCount
The maximum number of GameInstance to retrieve.
boolean getGameInstanceProperties
Set TRUE to retrieve the property collections of each game instance, FALSE to retrieve the instances without properties.
boolean friendsOnly
Set TRUE to retrieve only gamesin which you and your friends are joined in
string gameInstanceType
Set to retrieve only games with this type, pass nil to ignore.
string gameInstanceSubtype
Set to retrieve only games with this subtype, pass nil to ignore.
function callbackFunc
The function to call upon completion.
Gets all the GameInstances in a duel. Upon success, this will automatically update the internal list.
GameInstanceManager:GetAllInDuel( gameInstanceDuelID, callbackFunc )
number gameInstanceDuelID
The ID of the duel to retrieve all GameInstances for.
function callbackFunc
The function to call upon completion.
Joins an existing GameInstance. Upon success, this will automatically update the internal list.
GameInstanceManager:Join( gameInstanceID, gameInstanceUserProperties, callbackFunc )
number gameInstanceID
The ID of the specific GameInstance to join.
PropertyCollection gameInstanceUserProperties
The properties to assign the User joining the GameInstance.
function callbackFunc
The function to call upon completion.
Joins a random existing GameInstance. Upon success, this will automatically update the internal list.
GameInstanceManager:JoinRandom( gameInstanceType, gameInstanceSubType, gameInstanceUserProperties, callbackFunc )
string gameInstanceType
The type of GameInstance to join.
string gameInstanceSubType
The sub-type (if any) of GameInstance to join.
TogetherPropertyCollection gameInstanceUserProperties
The properties to assign the User joining the GameInstance.
function callbackFunc
The function to call upon completion.


Beautiful moments from Win a Wedding 2019 Beth and Chris tied the knot in style in front of emotional family and friends 01 Nov 2019, 17:52 by Sarah Waddington Bride and groom, Beth Cooper and Chris Thorning(Image: Penny Cross / Plymouth Live) The wedding day at St Mellion International Resorted and sponsored by Drake's Jewellers(Image: Penny Cross / Plymouth Live) Photographer and Video: Shield Media Services, Jamie Haigh and Ashley Hughes(Image: Penny Cross / Plymouth Live) St Mellion International Resort's Anna Sirby, Beth Cooper, Chris Thorning and Katie Townsley(Image: Penny Cross / Plymouth Live) Drake's Jewellers' Nikki Price, Natasha Manning, Bridge and groom Beth Cooper and Chris Thorning and Monique Hirshman(Image: Penny Cross / Plymouth Live) Bride and groom Beth Cooper and Chris Thorning(Image: Penny Cross / Plymouth Live) Bride and groom Beth Cooper and Chris Thorning(Image: Penny Cross / Plymouth Live) Debenhams provided the bridesmaids dresses. Pictured: Millie and Brooke Webb(Image: Penny Cross / Plymouth Live) Florist: Flowers by Catherine, Catherine Date(Image: Penny Cross / Plymouth Live) Stationery : F3 Design, Alan Lomax(Image: Penny Cross / Plymouth Live) DJ: Paul Webber from Love Audio(Image: Penny Cross / Plymouth Live) Wedding cake: Celebration Cakes by Kelly(Image: Penny Cross / Plymouth Live) Hair and Make up from the Fox House Retreat. Pictured: Chloe Mills and Nancy Koohathong(Image: Penny Cross / Plymouth Live) Wedding dress: The Wedding Company(Image: Penny Cross) Wedding rings: Drake's Jewellers(Image: Penny Cross / Plymouth Live) Transport: Westcountry Wedding Cars(Image: Penny Cross / Plymouth Live) Suit Hire: The Wedding Company(Image: Penny Cross / Plymouth Live) Happy wedding day Chris and Beth(Image: Penny Cross / Plymouth Live)


IRCConnection Class.
More...
|
| | connect ($server, $port, $nickname, $password="") |
| | Connect to an IRC server. More...
|
| |
| | joinChannel ($channel, $entry_message=null) |
| | Join in an IRC channel. More...
|
| |
| | sendChannelMessage ($message) |
| | Send a message into the channel chat. More...
|
| |
| | sendUserMessage ($user, $message) |
| | Send a message to a specific user. More...
|
| |
| | sendNotice ($user, $message) |
| | Send a notice to a specific user. More...
|
| |
| | sendDCCResponse ($user, $filename, $host, $port, $filesize) |
| | Send a DCC response to a user. More...
|
| |
| | sendDCCAccept ($user, $filename, $port, $position) |
| | Send a DCC accept after a RESUME request.  More...
|
| |
| | getData () |
| | Reads available data on connection buffer. More...
|
| |
| | isResumeRequested () |
| | Check if a resume is requested for transfer. More...
|
| |
|
| setBlockingSocket () |
| | Change the socket operating mode in blocking.
|
| |
|
| setNonBlockingSocket () |
| | Change the socket operating mode in non-blocking.
|
| |
| | pong ($recipient) |
| | Answer to a PING request.  More...
|
| |
IRCConnection Class.
This is the class that gives methods to handle IRC connection. You can send and receive messages to/from users in IRC and manage the IRC in general.
This class works on BSD Sockets with sockets library of PHP - http://php.net/manual/en/book.sockets.php
The protocol used is the original IRC protocol RFC 1419, following RFC 2812 and the unofficial CTCP and DCC extensions introduced by ircII client DCC
- Author
- Francesco Salvatore
- Copyright
- Apache License 2.0
| IRCConnection::connect |
( |
|
$server, |
|
|
|
$port, |
|
|
|
$nickname, |
|
|
|
$password = "" |
|
) |
| |
Connect to an IRC server.
- Parameters
-
| $server | String, is the hostname of IRC server |
| $port | Integer, is the port of IRC server |
| $nickname | String, is the nickname of bot |
| $password | String, optional, is the password required to login into the IRC net |
- Returns
- TRUE on success and a string containing the socket error in case of failure
| IRCConnection::getData |
( |
| ) |
|
Reads available data on connection buffer.
Note: default operating mode is blocking. If you want to change the operating mode see the relative methods setBlockingSocket() and setNonBlockingSocket().
- Returns
- An array in the form key=>value containing informations about the read data.
$data = $IRC->getData();
echo $data["type"];
echo $data["sender"];
echo $data["content"];
| IRCConnection::isConnected |
( |
| ) |
|
Get the status of IRC connection.
Warning: the internal status of connection is based on a periodic check, so it can be no really accurate. Use with caution.
| IRCConnection::isResumeRequested |
( |
| ) |
|
Check if a resume is requested for transfer.
- Returns
- An integer containing the file pointer position for resuming or FALSE if no resume is found.
| IRCConnection::joinChannel |
( |
|
$channel, |
|
|
|
$entry_message = null |
|
) |
| |
Join in an IRC channel.
- Parameters
-
| $channel | String, is the channel of IRC server that you want to enter |
| $entry_message | String, optional, is a message wrote in the channel after joining (a welcome message) |
| IRCConnection::pong |
( |
|
$recipient | ) |
|
Answer to a PING request.
- Parameters
-
| $recipient | String, the hostname that send the PING |
| IRCConnection::quit |
( |
|
$exit_message = "" | ) |
|
Quit connection.
- Parameters
-
| $exit_message | String, optional, an exit message |
| IRCConnection::sendChannelMessage |
( |
|
$message | ) |
|
Send a message into the channel chat.
- Parameters
-
| $message | String, the message you want to send |
| IRCConnection::sendDCCAccept |
( |
|
$user, |
|
|
|
$filename, |
|
|
|
$port, |
|
|
|
$position |
|
) |
| |
Send a DCC accept after a RESUME request.
- Parameters
-
| $user | String, the user you want to send the DCC accept |
| $filename | String, the name of requested file |
| $port | Integer, the port on requesting user will connect to |
| $position | Integer, the position that you have to move the file pointer for resuming an interrupted transfer |
| IRCConnection::sendDCCResponse |
( |
|
$user, |
|
|
|
$filename, |
|
|
|
$host, |
|
|
|
$port, |
|
|
|
$filesize |
|
) |
| |
Send a DCC response to a user.
- Parameters
-
| $user | String, the user you want to send the DCC response |
| $filename | String, the name of requested file |
| $host | String, the host address
Note: You can use IPv6 address only if both requesting user system and your system support IPv6. For that, use of IPv4 is prefered.
|
| $port | Integer, the port on requesting user will connect to |
| $filesize | Integer, the filesize of requested file
Note: DCC original protocol value used for filesize is a 32 bit unsigned integer, so the maximum filesize allowed is 4GB.
|
| IRCConnection::sendNotice |
( |
|
$user, |
|
|
|
$message |
|
) |
| |
Send a notice to a specific user.
- Parameters
-
| $user | String, the user you want to send the notice |
| $message | String, the message
Warning: you cannot send a message that contains EOF characters (end of line, \n) because it will be truncate at this character (this is a limitation of IRC protocol). If you want to send this type of message split it into multiple sends.
|
| IRCConnection::sendUserMessage |
( |
|
$user, |
|
|
|
$message |
|
) |
| |
Send a message to a specific user.
- Parameters
-
| $user | String, the user you want to send the message |
| $message | String, the message
Warning: you cannot send a message that contains EOF characters (end of line, \n) because it will be truncate at this character (this is a limitation of IRC protocol). If you want to send this type of message split it into multiple sends.
|
The documentation for this class was generated from the following file: