This site is an interactive slideshow exploring high and low temperature and rainfall data at several major cities along the Atlantic coast of the United States from the period 1969 to 2018.
To browse this site:
The charts below show the temperature difference (anomaly) in New York City during the summer months (June-August) for the past 50 years. The baseline used to calculate the anomaly was the average New York City summer temperature from 1900 through 1968. It is difficult to determine if there has been a significant trend from this graph.
While daily, weekly, or monthy variations in weather are expected, signifcant yearly or multi-year variations across an entire season of 3 months are easily visible in this graph: this is the reason why analysis of climate requires long time frames.
This graph also includes a time line of signficant cultural and political events related to climate change during the period.
This is a graph of the same data, adding the display of a linear trendline calculated through the period. The trendline displays a positive slope, which indicates an increase in the high termperature anomaly through the time period. The trend in New York City summer climate definitely shows an increase in average temperatures in the past 50 years, but one not dramatic enough to be obvious without the trendline display.
This is a graph of the same period for Miami Beach. Is there an apparent trend visible to you? If you're not sure, try this button:
One of the common features of summers on the East Coast of the U.S. are heat waves. The graph below shows the New York City summer heat waves as circles along the graph. The size of the circle represents the total length of all heat waves in a year: you can hover over the circle to see more specific information.
For this analysis, a heat wave is defined as a period of more than 3 days where the daily maximum temperature exceeds the area's baseline average maximum temperature by more than 9 degrees. The baseline is calculated from the average maximum temperature records before 1969.
It's not obvious there is a trend towards increaing heat waves in New York City. Let's explore summer heat waves some more on the next slide.
The graph below shows summer heat waves in Portland, Maine, the most northern city in this analysis. Note this slide focuses on the past 25 years.
Clicking the "Move North" and "Move South" buttons will update the display of summer heat waves accordingly, moving through all the Atlantic coastal cities in the analysis. (You'll have to head back north once you reach Miami Beach!)
A more detailed analysis of heat waves would likely need to examine the promity of the city to the Atlantic Ocean and the prevailing winds. For now, let's move on to look at temperature trends in the opposite season.
The graphs below show the average high termperature anomaly for New York City and Miami Beach during the winter months (December-February).
While it was difficult to see the trend in New York City summer high temrperatures without the trendline, this trend would be much more difficult not to see. Interesting winter in Miami Beach in 2010!
What about trends in winter temperatures? Below are graphs of the winter low and high average temperature anomalies in New York City, showing a strong trend towards a warmer average low temperature over the past 50 years.
This concludes the section on Temperature Trends for the past 50 years: the next section presents Preciptation Trends. Use the buttons at the top of the down-arrow key to move to the next Section. The left and right arrow keys will move you back through this section.
If you're interested in exploring the seasonal temperature data on your own, this link will take you to a new page where you can create your own visualizations of temperature data: Explore Temperature Trends.
The graphs below show the total preciptation in New York City through the spring and summer seasons from 1969 through 2018. The dotted line is the average total seasonal preciption recorded before 1969. Precipitation amounts for individual years are color-coded: darker green for years with preciptation above the baseline, lighter green for years with less.
The overall relationship of spring to summer preciptation has held through the time frame, and a slight trend towards wetter springs in the more recent past is visible.
Tropical storms and hurricanes are major summer and fall preciptation events along the U.S. East Coast. These graphs include these weather events during summer for New York City and Miami Beach, Florida. Hurricanes are red circles on the timeline, tropical storms and other preciptation events are yellow circles. The size of the circle represents the size of the event(s) in the year.
To compare fall preciptation over the past 25 years between the northern and southern cities in this analysis, select the cities from the list and click the "Display" button.
If you're interested in exploring the seasonal preciptation data on your own, this link will take you to a new page where you can create your own visualizations: Explore Preciptation Trends.
Source code for this web site is available from GitHub.
Land station weather observations were obtained from the Global Historical Climatology Network (GHCN).
Weather events were obtained from the National Weather Service
Visualizations were built with D3 and D3-Annotations.
| City | GHCN Network Id | Location |
|---|---|---|
| Portland ME | USW00014764 | 43.64222, -70.30444 |
| Boston MA | USW00014739 | 42.3606, -71.0097 |
| New Haven CT | USW00014758 | 41.26389, -72.88722 |
| New York City NY | USW00094789 | 40.6386, -73.7622 |
| Philadelphia PA | USW00013739 | 39.87327, -75.22678 |
| Baltimore MD | USW00093721 | 39.1733, -76.684 |
| Norfolk VA | USW00013750 | 36.93746, -76.28926 |
| Wilmington NC | USW00013748 | 34.2675, -77.8997 |
| Charleston SC | USW00013782 | 32.775, -79.9239 |
| Jacksonville FL | USC00084366 | 30.2875, -81.3927 |
| Ft Lauderdale FL | USW00012849 | 26.07875, -80.16217 |
| Miami Beach FL | USW00092811 | 25.8063, -80.1334 |
The data were reduced using the following process:
The final data sets used to create graphs:


| Package | Description |
|---|---|
| org.plasma.provisioning.xsd | |
| org.plasma.xml.schema |
Copyright 2017 TerraMeta Software, Inc.
|
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
ConverterSupport.getDocumentationContent(Annotated annotated) |
protected java.lang.String |
AbstractAssembler.getDocumentationContent(Annotated annotated) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractAttributeGroup
Java class for attributeGroup complex type.
|
class |
AbstractComplexType
Java class for complexType complex type.
|
class |
AbstractElement
The element element can be used either at the top level to define an
element-type binding globally, or within a content model to either reference
a globally-defined element or type or declare an element-type binding
locally.
|
class |
AbstractGroup
group type for explicit groups, named top-level groups and group references
Java class for group complex type.
|
class |
AbstractSimpleType
Java class for simpleType complex type.
|
class |
All
Only elements allowed inside
Java class for all complex type.
|
class |
Any
Java class for anonymous complex type.
|
class |
Attribute
Java class for attribute complex type.
|
class |
AttributeGroup
Java class for namedAttributeGroup complex type.
|
class |
AttributeGroupRef
Java class for attributeGroupRef complex type.
|
class |
ComplexContent
Java class for anonymous complex type.
|
class |
ComplexRestrictionType
Java class for complexRestrictionType complex type.
|
class |
ComplexType
Java class for topLevelComplexType complex type.
|
class |
Element
Java class for topLevelElement complex type.
|
class |
Enumeration
Java class for enumeration complex type.
|
class |
ExplicitGroup
group type for the three kinds of group
Java class for explicitGroup complex type.
|
class |
ExtensionType
Java class for extensionType complex type.
|
class |
Facet
Java class for facet complex type.
|
class |
Field
Java class for anonymous complex type.
|
class |
Group
Java class for namedGroup complex type.
|
class |
GroupRef
Java class for groupRef complex type.
|
class |
Import
Java class for anonymous complex type.
|
class |
Include
Java class for anonymous complex type.
|
class |
Keybase
Java class for keybase complex type.
|
class |
Keyref
Java class for anonymous complex type.
|
class |
List
itemType attribute and simpleType child are mutually exclusive, but one or
other is required
Java class for anonymous complex type.
|
class |
LocalComplexType
Java class for localComplexType complex type.
|
class |
LocalElement
Java class for localElement complex type.
|
class |
LocalSimpleType
Java class for localSimpleType complex type.
|
class |
NarrowMaxMin
restricted max/min
Java class for narrowMaxMin complex type.
|
class |
NoFixedFacet
Java class for noFixedFacet complex type.
|
class |
Notation
Java class for anonymous complex type.
|
class |
NumFacet
Java class for numFacet complex type.
|
class |
Pattern
Java class for anonymous complex type.
|
class |
RealGroup
Java class for realGroup complex type.
|
class |
Restriction
base attribute and simpleType child are mutually exclusive, but one or other
is required
Java class for anonymous complex type.
|
class |
RestrictionType
Java class for restrictionType complex type.
|
class |
Selector
Java class for anonymous complex type.
|
class |
SimpleContent
Java class for anonymous complex type.
|
class |
SimpleExplicitGroup
Java class for simpleExplicitGroup complex type.
|
class |
SimpleExtensionType
Java class for simpleExtensionType complex type.
|
class |
SimpleRestrictionType
Java class for simpleRestrictionType complex type.
|
class |
SimpleType
Java class for topLevelSimpleType complex type.
|
class |
TopLevelAttributeType
Java class for topLevelAttribute complex type.
|
class |
TotalDigits
Java class for anonymous complex type.
|
class |
Union
memberTypes attribute must be non-empty or there must be at least one
simpleType child
Java class for anonymous complex type.
|
class |
WhiteSpace
Java class for anonymous complex type.
|
class |
Wildcard
Java class for wildcard complex type.
|
| Modifier and Type | Field and Description |
|---|---|
protected java.util.List<Annotated> |
RestrictionType.attributesAndAttributeGroups |
protected java.util.List<Annotated> |
ExtensionType.attributesAndAttributeGroups |
protected java.util.List<Annotated> |
AbstractComplexType.attributesAndAttributeGroups |
protected java.util.List<Annotated> |
AbstractAttributeGroup.attributesAndAttributeGroups |
protected java.util.List<Annotated> |
Schema.simpleTypesAndComplexTypesAndGroups |
| Modifier and Type | Method and Description |
|---|---|
Annotated |
ObjectFactory.createAnnotated()
Create an instance of
Annotated |
| Modifier and Type | Method and Description |
|---|---|
java.util.List<Annotated> |
RestrictionType.getAttributesAndAttributeGroups()
Gets the value of the attributesAndAttributeGroups property.
|
java.util.List<Annotated> |
ExtensionType.getAttributesAndAttributeGroups()
Gets the value of the attributesAndAttributeGroups property.
|
java.util.List<Annotated> |
AbstractComplexType.getAttributesAndAttributeGroups()
Gets the value of the attributesAndAttributeGroups property.
|
java.util.List<Annotated> |
AbstractAttributeGroup.getAttributesAndAttributeGroups()
Gets the value of the attributesAndAttributeGroups property.
|
java.util.List<Annotated> |
Schema.getSimpleTypesAndComplexTypesAndGroups()
Gets the value of the simpleTypesAndComplexTypesAndGroups property.
|
PlasmaSDO™ and PlasmaQuery™ are trademarks of TerraMeta Software, Inc. Copyright © 2011 - All Rights Reserved.


| Fig 1 |
Occurrence records of Ixodes ricinus derived from various so ... |
| Fig 2 |
Current and future potential distribution of Ixodes ricinus ... |
| Fig 3 |
Summary of the binary modeled potential distributions of Ixo ... |
| Fig 4 |
MOP calculations for model transfers from present to future ... |


Pampatar lies on the east coast of Margarita Island, about 8nm north east of Porlamar.
The port captain here has been reported as not very welcoming to yachts.
Venetur Margareta marina lies in the bay between Porlamar and Pampatar.
Last updated January 2014.


Let's manipulate some geospatial data
There are
X
groups
All groups
Group name
Calculate whn you submit?


A {@link edu.cmu.minorthird.text.TextToken} is a "token" (usually a single word in a document), plus some additional information that allows one to find out where this word/token occured. Specifically one can recover the string that contained the token, a shorter string identifier of this "document" string, and the character offsets of the token--i.e., where it appeared in the document string.
A {@link edu.cmu.minorthird.text.Span} is a sequence of adjacent TextTokens from the same document.
Spans and TextTokens are considered to be inheritantly ordered. If two Spans or TextTokens are from different document, they are ordered lexigraphically based on the identifiers of those documents. Within a single document, TextTokens are according to their position in their document, and Spans are ordered according to their leftmost TextToken (using the rightmost TextToken to break ties.)
A {@link edu.cmu.minorthird.text.TextBase} is a collection of tokenized "document" strings, accessible as Spans.
A {@link edu.cmu.minorthird.text.TextLabels} contains markup for a {@link edu.cmu.minorthird.text.TextBase}. This markup can consist of
Markup in a TextLabels object is usually provided by an {@link
edu.cmu.minorthird.text.Annotator}. A sort of subroutine-calling
mechanism for Annotators is provided by the
textLabels.require
call, the
textLabels.isAnnotatedBy
call, and the {@link
edu.cmu.minorthird.text.AnnotatorLoader} mechanism. If one
Annotator relies on the output of another---for instance, an NP
chunker requires POS tags---it should use the
textLabels.require
method to make sure that the
annotation is present. textLabels.require
then uses
an AnnotatorLoader to find an Annotator that will produce the
required annotation type, using the
annotatorLoader.findAnnotator
method. Annotators
record the fact that they have been run on a textLabels object by
using the textLabels.setAnnotatedBy(...)
method;
this ensures that annotations are not run more than once.
Taken together these mechanisms provide something in between a programming language for annotations, and a simple planner for constructing annotations. As a planner, each Annotator corresponds to an operator: its preconditions are specified by calls to "require", and its postconditions are specified by calls to "setAnnotatedBy" (or in mixup, by "provide" statements.) The AnnotatorLoader corresponds to a backwards-chaining planner, and its decisions about what Annotator to use are how the plan is constructed.
However, the AnnotatorLoader don't do anything fancy to find Annotators: in response to a "require" call for label "foo", the AnnotatorLoader looks for a file "foo.mixup" or a Java class names "foo", in that order. So the default behavior is simple enough that it looks more like a programming language, with the AnnotatorLoader being just a binding mechanism.
There are several ways the binding mechanism can be modified.
require
call, one can specify a filename
in addition to a desired label type (in mixup, this is the
second argument to the "require" call). This causes this
filename to be used instead of the the default "foo.mixup" or
Java class "foo".
annotators.config
file, (usually located
in minorthird/config), one can specify default filenames for a
set of label types "foo". These will be used instead of
"foo.mixup", unless some other filename is specified.
require
,
which uses different rules to find files.
The main use of this mechanisms is the {@link edu.cmu.minorthird.text.EncapsulatingAnnotatorLoader}, which contains a cache of files and/or Java classes that it will use in preference to anything on the classpath.
Currently, AnnotatorLoaders are not used for loading Mixup resources like dictionary files, only for loading Annotators.
A {@link edu.cmu.minorthird.text.NestedTextLabels} is an odd sort of implementation of a MonotonicTextLabels. It combines two TextLabels's, an "inner" one and an "outer" one, such that the outer one can be monotonically added to, but the inner one is never modified. Semantically, the markup in a NestedTextLabels is the union of the markup in the inner and outer TextLabels's, except that property values in the outer TextLabels "shadow" values in the inner TextLabels. This has several possible uses, for instance:


jquery.nestable.css and jquery.nestable.js are now taken from Bucket Admin Bootstrap theme, because this Edit Mode was originally created to work under that theme.


我是一個來自馬來西亞的孩子。目前就讀世新大學資訊傳播學系，學習關於傳播的可惜是我的夢想。因此我會出現在這裡。你問我為什麼會選擇來台灣升學？只因為馬來西亞的傳播科系很少選擇。呵~
I'm a kid who came from Malaysia. And now I'm studying at Shih Hsin University in Taiwan. I know somebody will ask me why I'm here to study Mass Communication? That's no any other special reason, just because of learning Mass Comm is my dream. Moreover, if I study in Malaysia, there was just a little choice of this course. :)
SORRY, ONLY AVAILABLE IN ＦＢ ：目
舞蹈團 ， 建言社
Dance Club, Debate Club
２０１１年由於剛入學，只是社團的一個無名小卒。２０１２年有幸被選作舞蹈團的總務組（的一名成員），不過也算是委員會的一員了。２０１３年晉陞成社團副秘書，而無意外的在２０１４年成了社團的秘書。擔任了秘書的大任後，２０１５年就被導師和社團成員們推選為社團主席。來到了２０１６年，也就是我最後一年的高中生涯，無例外的成了社團的顧問學姐。（這是我們學校的優良傳統，高三的學生就是退休的顧問們）呵～
When 2011, I was just intake by SCHS. So, I do nothing. 2012, I started to do one of the member of community that needs to care anything. 2013, I became a secretary asistant of Dance Club and 2014 I'm the secretary. In 2015, I have been choosen by teachers and students as the head of our club. 2016, that as my last year of high school, I became a club consultant.
在高三畢業以後，由於馬來西亞與台灣的開學和畢業的時間不一樣（我們是一月開學十一月畢業，我是於２０１６年十一月畢業的），所以我擁有了長達８個月的空閒時間。乘著這麼多個月的空擋，我的國小老師恰好生請產假。然後我就去國小代了三個月的課。總歸一句，現在的國小學生與我們有嚴重的代工啊．．．短短三個月足以讓我吐了很多口老血哈哈～
When I just graduated from high school, I found a jon in my primary school because that was a teacher need to take a maternity leave. So, I'm there to be a substitute teacher for three months. I found that student nowadays aren't like us in the old times... By the way, I feel so happy in the three months, that's an unforgettable experience!
世新大學Shih Hsin University（SHU）
巴華中學SABAH CHINESE HIGH SCHOOL
育進公學SJK(C) Yuk Chin
1. 漢語
2. 英語
3. 馬來西亞語
4. （略懂）韓語
5. 印度尼西亞語
1. Chinese
2. English
3. Malay (of Malaysia)
4. Hangul (know some of it)
5. Malay (of Indonesia)
1. 客家話
2. 廣東話（粵語）
3. 福建話（閩南語）
~身為馬來西亞人必會的就是Rojak語，那就是一句話裡面參雜著以上我所會的語言們~
1. Hakka
2. Cantonese
3. Hokkien
!! 'Rojak Language' is a kind of language that known by any one of a typical Malaysian. We communicate with each other with using all of the kind of languages that I had listed out above !!
| 1.Let's Dance~ | |
|---|---|
| 2.看看展覽 | ||
|---|---|---|
| 3.看風景，從地上仰視，從天空俯視 | ||
|---|---|---|
| 4.我還是個吃貨呵 | |||
|---|---|---|---|


Data is your biggest business asset.
Our safe & secure data erasure solutions ensure that your data is never
compromised at the end of the device lifecycle. Our cutting-edge technology
guarantees permanent wiping of sensitive data from hard drive, SSD, desktop,
laptop & server. Our DIY drive wiping solutions generate tamper-proof reports &
certificates to help you meet statutory & regulatory compliance.
Hard Disk Data Recovery
Secure Data Recovery is an industry leader in
hard drive recovery with state-of-the-art tools and engineers with
decades of experience.
SSD Data Recovery
If you experienced data loss on your SSD, the
safest option is to consult an expert for SSD data recovery. Ontrack
can recover from any make or model SSD.
Laptop & Desktop Recovery
We offer Professional Data Recovery Services for
Laptops and Desktops Manufactured by Dell, Samsung, Toshiba, hp, and
more.
CCTV Footage Recovery
Now Data Recovery can recover the video footage
from CCTV/DVR Hard Drive, SD Card, Pen Drive etc.


convertChildrenList
fun ViewGroup.convertChildrenList(): List<View>
Convert ViewGroup's Children to List


{% load staticfiles %}
It all started on May 21, 2018 at a classic Josh Mueller birthday party. Everything was pretty standard:
Josh's mom made
some cinnamon buns, we were playing some German lawn game, and there were a lot of friends.
I (Storm) knew that Josh had been a part of this small group from the project (along with friends Jason,
Josh, and Brianna) for a while now, and (luckily for me haha) decided to invite over some other friends
he had made there! Elise just so happened to be one of those friends.
Later that evening around the (propane) campfire, I happened to sit next to Elise and Jason who were
chatting. I didn't know Elise, and so I introduced myself, and at the time I had no clue I was meeting
my future wife! Now, you know how some people don't believe in instant attraction ever working out?
They're completely full of it, because Elise and I hit it off instantly and we still enjoy talking about
this to this day. With some help from Jason Ramer and Tana Reimer, we discussed topics from our
favourite worship music to how Google home devices are ethical, and everything in between. We even
chatted about Elise's potential plans to go to England in the fall to teach (WOW this would have been
rough if she still ended up going through with that), and how our family dynamics played a part in
making us who we are today (special shoutout to Tana for helping us go deeper than we ever thought we
would that night haha). Both Elise and I talked for about 4 hours late into the evening, and it just
wasn't enough. I knew I was completely enamoured by her.
Instantly the next morning I sent her a message on Facebook, and that next week we exchanged so many
messages about so many different things that you could easily fill a full length novel that would make even J.R.R
Tolkien jealous. But my thumbs were hurting!! Texting that much is difficult! I needed to talk to her
face to face, so the next Saturday, I asked her if she'd be interested in going out that evening. She
was busy playing synth at a worship gig, but she still wanted to go so we went out afterwards!
That evening, we walked and talked for a few hours and really got to know each other. I came to see the
depths of Elise's character and how she cares for her family and others, and I've never related to
anybody that deeply ever. I was also extremely impressed by her knowledge of Halo and musical skills, as
well as her love for personality tests! I'm an ENFJ and she's an INFJ, and they're extremely compatible
personality types ;)
After one more date at Ryan's year end Jazz concert at the Yardbird Suite with the Littlebirds, we
realized that we needed things between us to be official, so over a mojito pitcher at Earls we decided
that we were dating! Easily the one of the best decisions I've ever made, right next to deciding to
marry her :)
We appreciate all of the friends who helped us meet and come together. We are very grateful for every
single one of you!


In this tutorial, you will develop a simple TCP "greet" server. Clients are meant to connect to it by telnet. After a client has connected, the server will ask for their name, reply with a greeting, and then proceed to close the connection.
An interaction with the server will look like this:
$ telnet <IP_ADDRESS> 5555
Trying <IP_ADDRESS>...
Connected to <IP_ADDRESS>.
Escape character is '^]'.
What's your name?
Bartholomaeus
Hello, Bartholomaeus!
Connection closed by foreign host.
Throughout the tutorial, you will learn how to use coroutines, channels, and sockets.
Start by including the libdill header file. Later we'll need some functionality from the standard library, so include those headers as well:
#include <libdill.h>
#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
Add a main
function. We'll assume that the first argument, if present, will be the port number to be used by the server. If not specified, the port number will default to 5555:
int main(int argc, char *argv[]) {
int port = 5555;
if(argc > 1) port = atoi(argv[1]);
return 0;
}
Now we can move on to the actual interesting stuff.
The tcp_listen()
function creates a listening TCP socket. The socket can be used to accept new TCP connections from clients:
struct ipaddr addr;
int rc = ipaddr_local(&addr, NULL, port, 0);
if (rc < 0) {
perror("Can't open listening socket");
return 1;
}
int ls = tcp_listen(&addr, 10);
assert( ls >= 0 );
The ipaddr_local()
function converts the textual representation of a local IP address to the actual address. Its second argument can be used to specify a local network interface to bind to. This is an advanced feature and you likely won't need it. For now, you can simply ignore it by setting it to NULL
. This will cause the server to bind to all local network interfaces available.
The third argument is, unsurprisingly, the port that clients will connect to. When testing the program, keep in mind that valid port numbers range from 1 to 65535 and that binding to ports 1 through 1023 will typically require superuser privileges.
If tcp_listen()
fails, it will return -1
and set errno
to the appropriate error code. The libdill API is in this respect very similar to standard POSIX APIs. Consequently, we can use standard POSIX error-handling mechanisms such as perror()
in this case.
As for unlikely errors, the tutorial will simply use assert
s to catch them so as to stay succinct and readable.
If you run the program at this stage, you'll find out that it terminates immediately without pausing or waiting for a client to connect. That is what the tcp_accept()
function is for:
int s = tcp_accept(ls, NULL, -1);
assert(s >= 0);
The function returns the newly established connection.
Its third argument is a deadline. We'll cover deadlines later on in this tutorial. For now, remember that the constant -1
can be used to mean 'no deadline' — if there is no incoming connection, the call will block forever.
Finally, we want to handle any number of client connections instead of just one so we put the tcp_accept()
call into an infinite loop. For now we'll just print a message when a new connection is established. We will close it immediately:
while(1) {
int s = tcp_accept(ls, NULL, -1);
assert(s >= 0);
printf("New connection!\n");
rc = hclose(s);
assert(rc == 0);
}
The source code for this step can be found in the libdill repository as tutorial/step1.c. All the steps that follow can be found in the same directory.
Build the program like this:
$ gcc -o greetserver step1.c -ldill
Then run the resulting executable:
$ ./greetserver
The server is now waiting for a new connection. Use telnet at a different terminal to establish one and then check whether the program works as expected:
$ telnet <IP_ADDRESS> 5555
To test whether error handling works, try using an invalid port number:
$ ./greetserver 70000
Can't open listening socket: Invalid argument
$
Everything seems to work as expected. Let's now move on to the step 2.
When a new connection arrives, the first thing that we want to do is to establish the network protocol we'll be using. libdill contains a small library of easily composable microprotocols that allows you to compose a wide range of protocols just by plugging different microprotocols into each other in a lego brick fashion. In this tutorial, however, we are going to limit ourselves to just a very simple setup. On top of the TCP connection that we've just created, we'll have a simple protocol that will split the TCP bytestream into discrete messages, using line breaks (CR+LF
) as delimiters:
int s = suffix_attach(s, "\r\n", 2);
assert(s >= 0);
Note that hclose()
works recursively. Given that our SUFFIX socket wraps an underlying TCP socket, a single call to hclose()
will close both of them.
Once finished with the setup, we can send the "What's your name?" question to the client:
rc = msend(s, "What's your name?", 17, -1);
if(rc != 0) goto cleanup;
Note that msend()
works with messages, not bytes (the name stands for "message send"). Consequently, the data will act as a single unit: either all of it is received or none of it is. Also, we don't have to care about message delimiters. That's done for us by the SUFFIX protocol.
To handle possible errors from msend()
(such as when the client has closed the connection), add a cleanup
label before the hclose
line and jump to it whenever you want to close the connection and proceed without crashing the server.
char inbuf[256];
ssize_t sz = mrecv(s, inbuf, sizeof(inbuf), -1);
if(sz < 0) goto cleanup;
The above piece of code simply reads the reply from the client. The reply is a single message, which in our case translates to a single line of text. The mrecv
function returns the number of bytes in the message.
Having received a reply, we can now construct the greeting and send it to the client. The analysis of this code is left as an exercise to the reader:
inbuf[sz] = 0;
char outbuf[256];
rc = snprintf(outbuf, sizeof(outbuf), "Hello, %s!", inbuf);
rc = msend(s, outbuf, rc, -1);
if(rc != 0) goto cleanup;
Compile the program and check whether it works as expected.
At this point, the client cannot crash the server, but it can block it. Do the following experiment:
The reason for this behavior is that the program doesn't even start accepting new connections until the entire dialogue with the client has finished. What we want instead is to run any number of dialogues with clients in parallel. And that is where coroutines kick in.
Coroutines are defined using the coroutine
keyword and launched with the go()
construct.
In our case, we can move the code performing the dialogue with the client into a separate function and launch it as a coroutine:
coroutine void dialogue(int s) {
int rc = msend(s, "What's your name?", 17, -1);
...
cleanup:
rc = hclose(s);
assert(rc == 0);
}
int main(int argc, char *argv[]) {
...
while(1) {
int s = tcp_accept(ls, NULL, -1);
assert(s >= 0);
s = suffix_attach(s, "\r\n", 2);
assert(s >= 0);
int cr = go(dialogue(s));
assert(cr >= 0);
}
}
Let's compile it and try the initial experiment once again. As can be seen, one client now cannot block another one. Excellent. Let's move on.
Now it's time to consider how to shut down the server cleanly. In the real-world you would have some kind of administrative user interface to ask the server to terminate. In our case we'll make it simple and just shut down the server after three clients have connected to it.
Once we get out of the loop we have to deallocate all the allocated resources. For example, we have to close the listening socket.
More importantly though, we are creating coroutines and never closing the coroutine handles. In fact, the previous step of this tutorial contains a memory leak: While individual dialogue
coroutines finish and their stacks are automatically deallocated, the handles to those coroutines remain open and consume a little bit of memory. If the server was run for a very long time those handles would eventually accumulate and cause memory usage to go up.
Closing them is not an easy feat though. The main function would have to keep a list of all open coroutine handles. The coroutines, before they exit, would have to notify the main function about the fact so that it can close the handle... The more you think about it the more complex it gets.
Luckily though, libdill has a concept of coroutine bundles. Bundle is a set of zero or more coroutines referred to by a single handle. In fact, there's no such a thing as direct coroutine handle. Even go
which seems to return a coroutine handle really returns a handle to a bundle containing a single coroutine.
We can use bundles to solve our cleanup problem. First, we will create an empty bundle. Then we will launch individual dialogue
coroutines within the bundle. As the execution of any particular coroutine finishes its stack will be automatically deallocated and it will be removed from the bundle. There will be no memory leaks.
Moreover, when shutting down the server we have only a single handle the close which will, in turn, cancel all the coroutines that are still running.
int main(int argc, char *argv[]) {
...
int b = bundle();
assert(b >= 0);
int i;
for(i = 0; i != 3; i++) {
int s = tcp_accept(ls, NULL, -1);
assert(s >= 0);
s = suffix_attach(s, "\r\n", 2);
assert(s >= 0);
rc = bundle_go(b, dialogue(s));
assert(rc == 0);
}
rc = hclose(b);
assert(rc == 0);
rc = hclose(ls);
assert(rc == 0);
return 0;
}
One thing to remember about canceling coroutines is that once a coroutine is canceled all the blocking operations within the coroutine, such as reading from a socket or sleeping, will start returning ECANCELED
error. The coroutine should then deallocate all its resources and exit.
Looking at our dialogue
coroutine it turns out that it already does that. It responds to any error, including ECANCELED
by closing the socket handle and exiting.
Now try to compile this step and run it under valgrind. (Don't forget to compile libdill itself with --enable-valgrind
and --disable-shared
options!) Here's what you'll get:
==179895== HEAP SUMMARY:
==179895== in use at exit: 0 bytes in 0 blocks
==179895== total heap usage: 11 allocs, 11 frees, 1,329,272 bytes allocated
==179895==
==179895== All heap blocks were freed -- no leaks are possible
To get some background on how object lifetimes are supposed to be managed in libdill read the article about structured concurrency.
File descriptors can be a scarce resource. If a client connects to the greetserver and lets the dialogue hang without entering a name, one file descriptor on the server side is, for all intents and purposes, wasted.
To deal with the problem, we are going to timeout the whole client/server dialogue. If it takes more than 10 seconds, the server will kill the connection at once.
One thing to note is that libdill uses deadlines rather than the more conventional timeouts. In other words, you specify the time instant by which you want the operation to finish rather than the maximum time it should take to run it. To construct deadlines easily, libdill provides the now()
function. The deadline is expressed in milliseconds, which means you can create a deadline one minute in the future as follows:
int64_t deadline = now() + 60000;
Furthermore, you have to modify all potentially blocking function calls in the program to take the deadline parameter. In our case:
int64_t deadline = now() + 60000;
int rc = msend(s, "What's your name?", 17, deadline);
if(rc != 0) goto cleanup;
char inbuf[256];
ssize_t sz = mrecv(s, inbuf, sizeof(inbuf), deadline);
if(sz < 0) goto cleanup;
Note that errno
is set to ETIMEDOUT
if the deadline is reached. Since we're treating all errors the same (by closing the connection), we don't make any specific provisions for deadline expiries.
Now note that the third connection to the greetserver is closed immediately without even given user a chance to enter their name. This is a common use case for network servers. When the server is being shut down we want it to stop accepting new connections, but we also want to give it some time to finish handling those connections that are still open.
This can be achieved by calling bundle_wait()
on the dialogue()
coroutine bundle. bundle_wait()
waits for all the coroutines in the bundle to finish. Also, it allows to specify a deadline. We can do so immediately after exiting the loop:
rc = bundle_wait(b, now() + 10000);
assert(rc == 0 || (rc < 0 && errno == ETIMEDOUT));
Suppose we want the greetserver to keep statistics: The overall number of connections made, the number of those that are active at the moment and the number of those that have failed.
In a classic, thread-based application, we would keep the statistics in global variables and synchronize access to them using mutexes.
With libdill, however, we aim at "concurrency by message passing", and so we are going to implement the feature in a different way.
We will create a new coroutine that will keep track of the statistics and a channel that will be used by the dialogue()
coroutines to communicate with it:
First, we define the values that will be passed through the channel:
#define CONN_ESTABLISHED 1
#define CONN_SUCCEEDED 2
#define CONN_FAILED 3
Now we can create the channel and pass it to the dialogue()
coroutines:
coroutine void dialogue(int s, int ch) {
...
}
int main(int argc, char *argv[]) {
...
int ch[2];
rc = chmake(ch);
assert(rc == 0);
while(1) {
int s = tcp_accept(ls, NULL, -1);
assert(s >= 0);
s = suffix_attach(s, "\r\n", 2);
assert(s >= 0);
int cr = go(dialogue(s, ch[1]));
assert(cr >= 0);
}
}
Libdill channels are "unbuffered". In other words, the sending coroutine will block each time until the receiving coroutine can process the message.
This kind of behavior could, in theory, become a bottleneck, however, in our case we assume that the statistics()
coroutine will be extremely fast and not turn into one.
At this point we can implement the statistics()
coroutine, which will run forever in a busy loop and collect statistics from all the dialogue()
coroutines. Each time the statistics change, it will print them to stdout
:
coroutine void statistics(int ch) {
int active = 0;
int succeeded = 0;
int failed = 0;
while(1) {
int op;
int rc = chrecv(ch, &op, sizeof(op), -1);
if(rc < 0 && errno == ECANCELED) return;
switch(op) {
case CONN_ESTABLISHED:
++active;
break;
case CONN_SUCCEEDED:
--active;
++succeeded;
break;
case CONN_FAILED:
--active;
++failed;
break;
}
printf("active: %-5d succeeded: %-5d failed: %-5d\n",
active, succeeded, failed);
}
}
int main(int argc, char *argv[]) {
...
int ch[2];
rc = chmake(ch);
assert(rc == 0);
int cr = go(statistics(ch[0]));
assert(cr >= 0);
...
}
The chrecv()
function will retrieve one message from the channel or block if there is none available. At the moment we are not sending anything to it, so the coroutine will simply block forever.
To fix that, let's modify the dialogue()
coroutine to send some messages to the channel. The chsend()
function will be used to do that:
coroutine void dialogue(int s, int ch) {
int op = CONN_ESTABLISHED;
int rc = chsend(ch, &op, sizeof(op), -1);
assert(rc == 0);
...
cleanup:
op = errno == 0 ? CONN_SUCCEEDED : CONN_FAILED;
rc = chsend(ch, &op, sizeof(op), -1);
assert(rc == 0 || errno == ECANCELED);
rc = hclose(s);
assert(rc == 0);
}
Now recompile the server and run it. Create a telnet session and let it time out. The output on the server side will look like this:
$ ./greetserver
active: 1 succeeded: 0 failed: 0
active: 0 succeeded: 0 failed: 1
The first line is displayed when the connection is established: There is one active connection and no connection has succeeded or failed yet.
The second line shows up when the connection times out: There are no active connection anymore and one connection has failed so far.
And that's the end of the tutorial. Enjoy your time with the library!


--- title: I did not expect that disqus: y ---
It seems like techradar shares my love of fractals.
I found this out somewhat randomly. Though so far I have still been averaging 30 downloads a day, about what I would expect from a fractal app (not many people even know what that word means), it's still nice that someone ranked Fractal Photographer #6. On the other hand, the number of downloads should be increasing veryyy soon :


Psalm 77
For the chief musician; after the manner of Jeduthun. A psalm of Asaph.
1 I will call out with my voice to God;
I will call with my voice to God, and my God will hear me.
2 In the day of my trouble I sought the Lord;
at night I stretched my hands out, and they would not become tired.
I refused to be comforted.
3 I thought of God as I groaned;
I thought about him as I grew faint.
Selah
4 You held my eyes open;
I was too troubled to speak.
5 I thought about the days of old,
about times long past.
6 During the night I called to mind the song I once sang.
I thought carefully
and tried to understand what had happened.
7 Will the Lord reject me forever?
Will he never again show me favor?
8 Was his covenant faithfulness gone forever?
Had his promise failed forever?
9 Had God forgotten to be gracious?

Selah
10 I said, "This is my sorrow:
the changing of the Almighty's right hand toward us."
11 But I will call to mind your deeds, Yahweh;
I will think about your wonderful deeds of old.
12 I will ponder all your deeds
and will reflect on them.
13 Your way, God, is holy;
what god compares to our great God?
14 You are the God who does wonders;
you have revealed your strength among the peoples.
15 You gave your people victory by your great power—
the descendants of Jacob and Joseph.
Selah
16 The waters saw you, God;
the waters saw you, and they were afraid;
the depths trembled.
17 The clouds poured down water;
the skies thundered;
your arrows flashed about.
18 Your thunderous voice was heard in the wind;
the lightning lit up the world;
the earth trembled and shook.
19 Your path went through the sea
and your way through the surging waters,
but your footprints were not seen.
20 You led your people like a flock
by the hand of Moses and Aaron.


Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.
You are to write a program that reads the coordinates of a point (x, y),
and writes the number (if any) that has been written at that point.
(x, y) coordinates in the input are in the range 0...10000.
The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.
For each point in the input, write the number written at that point or write No Number if there is none.
Input: 3 4 2 6 6 3 4 Output: 6 12 No Number


Personal Interests
Personal Strengths
Work Experience
Work Skills
Job Interests
How You Can Support Me
My Job Requests
What are your interested industries?
F&B
Cleaning
Laundry
Hotel
Production/Packing
Retail/Service
Admin/Office


In Ghanian culture, it is a common occurrence for children to have Akan Names.You may be wondering what an Akan name is. Well, Akan Names or "day-names" are names given to the Akan people's children based on the day of the week that a child was born. They often have a deeper meaning regarding the child's character and soul. Akan names are also gender specific. This means that although the inherent meaning of the name is the same, a male and female child born on the same day will have different "day-names"
| DAY | MALE | FEMALE | ASSOCIATION |
|---|---|---|---|
| Sunday | Kwasi | Akosua | Universe |
| Monday | Kwadwo | Adwoa | Peace |
| Tuesday | Kwabena | Abenaa | Ocean |
| Wednesday | Kwaku | Akua | Spider |
| Thursday | Yaw | Yaa | Earth |
| Friday | Kofi | Afua | Fertility |
| Saturday | Kwame | Ama | God |
FIND OUT YOUR AKAN NAME!
It's that simple. Give it a try!


welcome
april 18th 2013
The FrozenJS Blog is live!
What is it for?
We needed a place to write articles showing how to use Frozen or best practices, so we made this blog.
Not to mention, we want to spotlight things we are doing, or being done by others, with Frozen.
comments powered by Disqus


John Legend pans Nikki Haley comparing impeachment to 'death penalty'
by Sam DormanNikki Haley, the former U.S. ambassador to the United Nations, got some celebrity pushback on Friday after she likened impeachment to "the death penalty for a public official."
"It's not the death penalty," singer John Legend tweeted. "It's firing him from the most important job in the country because he can't be trusted with it. Real people are actually sentenced to death. This is not that."
Legend was responding to a tweet from Haley promoting an article about her comments. "This is a decision for the American people," she tweeted.
Haley had told CBS anchor Norah O'Donnell that there was nothing in the Ukraine transcript that "warrants the death penalty for the president."
JOHN LEGEND RIPS TRUMP, CALLS HIM A 'F------ EMBARRASSMENT' ON TWITTER
Haley spoke out as House Democrats pursued an impeachment inquiry centered on President Trump's July 25 call with Ukrainian President Volodymyr Zelensky, whom he urged to investigate former Vice President Joe Biden.
In another tweet, Legend questioned Haley's credibility by suggesting she secretly knew Trump wasn't fit for office.
 "You obviously know he's not morally or intellectually fit for office. I wish you would admit it for the sake of the nation and your own credibility."
Legend had previously attacked Trump on Thursday, tweeting that the president was a "f-----g embarrassment."


WITNESS LIST Public Health Committee March 3, 1999-1:30P HB 272 For: Smith, Charles A. (Self and City of Odessa) Spear, M.D., Dave (Self and Odessa Fire Department) Against: Fawcett, Jimmy (Texas Police Chief Association) McLaughlin, James (Texas Police Chief Association) Ybarbo, Lt. Ray (San Antonio Police Department) On: Wall, Matthew T. (The Association of Texas Hospitals and Health Care Organizations) Registering, but not testifying: On: Walker, Craig A. (Texas Ambulance Association) HB 670 For: Endicott Jr., James A. (Self) McLemore, Bill (Texas Coalition of State Veteran's Organizations) Registering, but not testifying: On: Green, Billy G. (Texas Veterans Commission) HB 836 For: Bell, Bert (Self) Registering, but not testifying: On: Bays, Richard (Texas Department of Health, Bureau of Vital Statistics) HB 867 On: Maline, John (Executive Council of Physical Therapy and Occupational Therapy) Registering, but not testifying: For: Gelfand, Augusta (Texas Occupational Therapy Association) Hennigan, Mary (Self and Texas Occupational Therapy Association) On: Polichino, Jean E. (Texas Board of Occupational Therapy Examiners) HB 985 Registering, but not testifying: On: Cannaday, Gerald D. (Texas Department of Health) Dembosky, Hank (Texas Department of Human Services) Poon, Theresa (Comptroller of Public Accounts) HB 1033 On: Jacobs, Mickey L. (Texas Cancer Council) Registering, but not testifying: For: Gilchrist, Alfred (Texas Medical Association) On: Wissolik, Erica (Sunset Advisory Commission) HB 1302 Registering, but not testifying: For: Marshall, Susan (The Arc of Texas) On: Carmona, Paul (Office of Attorney General) HB 1336 For: Speight, Susan (Texas Association of Marriage and Family Therapy) Registering, but not testifying: For: Ashby, Cindy (Texas Counseling Association) Hernandez, Leslie (National Association of Social Workers of Texas) On: Schmidt, Med., Bobby D. (Self) HB 1342 For: Wieck, Lynn (Texas Nurses Association) Registering, but not testifying: For: Evans, Elaine (Self and Texas Organization of Baccalaureate & Graduate Nurse Educators) Jones, Rebecca A. Patronis (Texas Organization for Baccalaureate & Graduate Nurse Educators) Jordan, R.N., Clair (Texas Nurses Association) Moon, Michael D. (Texas State Council of Emergency Nurses Association) Vasek, Heather (Texas Association for Home Care) Willmann, J.D., James (Texas Nurses Association) On: Thomas, Kathy (Board of Nurse Examiners) HB 1396 Registering, but not testifying: For: Chapa, Sylvia (Self and EduCare Community Living Corporation - Texas) Childress, Terry (Private Providers Association of Texas) Davis, Judy (Self) Davis-Fleming, Joe (Self and EduCare Community Living Corporation and Private Providers Association of Texas) Haas, Phil (Self) Hudson-Jones, Audra A. (Self) Marshall, Susan (The Arc of Texas) Scherffius, Gina McAskill (Self and EduCare Community Living Corp. - America) Simms, Kaye (Self and EduCare Community Living Corp. - Texas & Gulf Coast) Steur, Jane (Self and EduCare Community Living Corp. - Gulf Coast) West, Lori (Self) On: Alexander, Cindy (Comptroller of Public Accounts) Gold, Marc (Texas Department of Human Services) Mendez-Lewis, Maria (Comptroller of Public Accounts) HB 1503 Registering, but not testifying: For: Newhouse, Liz (Texas Respite Resource Network) Schwartz, Jonas (United Cerebral Palsy of Texas) On: Dorr, Barbra (Sunset Advisory Commission) Elder, Mary (Interagency Council on Early Childhood Intervention) Hawkins, John (Sunset Advisory Commission) SB 380 Registering, but not testifying: For: Marshall, Susan (The ARC of Texas) On: Carmona, Paul (Office of the Attorney General)


Display/edit a string based on a (possibly non-existing) field in the current object (\$object). So if field is "name", \$object->getName() is displayed. However if the
slotString is editable, this value can be overridden by editing the text. If virtual is "yes", "field" doesn't have to be an existing field in the object, and
content will become the default value.
No title
or
or
field - the name of a field in the current object. If "virtual" is "yes", then "field" is just an identifying name.
editable [no] - {yes, no}. Should it be possible to edit the slotString?
virtual [no] - {yes, no}. If virtual is "yes", "field" doesn't have to be an existing field in the current object, and
content will become the default value.
content - the default value displayed.


Reconnaissance Tools are the first step towards planning out an attack, knowing what you're attacking is alot better than attacking blindly.
Reconnaissance Tools are the first step towards planning out an attack, knowing what you're attacking is alot better than attacking blindly.
Here is some more information about this product that is only revealed once clicked on.
ALthough small, the Raspberry Pi can still number crunch fast enough to crack passwords. Although a more powerful system is recommended.


I got my inspiration from the audio track on Minuit webpage. Audio track is a
good representation of record company.
I abstracted the shape of B to their shapes to lines and rectangles, which are
similar to audio tracks. I also chose the track color as my main logo color to make the
logo outstanding. The green is eye-catching on social media as a profile picture.
I used function of perspective to change the two parts of B to two open doors.
Finally, I add the brand name “backdoor” centralized below the icon.
In total, it gives out the sense of the sense of safety, creation and openness.


5.10. evaluation¶
5.10.1. losses¶
define a loss function \(\mathcal{L}\)
0-1 loss: \(\vert C-f(X)\vert\) - hard to minimize (combinatorial)
\(L_2\) loss: \([C-f(X)[^2\)
risk = \(E_{(x,y)\sim D}[\mathcal L(f(X), y) ]\)
optimal classifiers
Bayes classifier minimizes 0-1 loss: \(\hat{f}(X)=C_i\) if \(P(C_i\vert X)=max_f P(f\vert X)\)
KNN minimizes \(L_2\) loss: \(\hat{f}(X)=E(Y\vert X)\)
classification cost functions
misclassification error - not differentiable
Gini index: \(\sum_{i != j} p_i q_j\)
cross-entropy: \(-\sum_x p(x)\: \log \: \hat p(x) \), where \(p(x)\) are usually labels and \(\hat p(x)\) are softmax outputs
only penalizes target class (others penalized implicitly because of softmax)
for binary, \(- (p \log \hat p + (1-p) \log (1-\hat p)\)
5.10.2. measures¶
goodness of fit - how well does the learned distribution represent the real distribution?
accuracy-based
accuracy = (TP + TN) / (P + N)
correct classifications / total number of test cases
balanced accuracy = 1/2 (TP / P + TN / N)
denominator is total pos/neg
recall = sensitivity = true-positive rate = TP / P = TP / (TP + FN)
what fraction of the real positives do we return?
specificity = true negative rate = TN / N = TN / (TN + FP)
what fraction of the real negatives do we return?
false positive rate = FP / N \(= 1 - \text{specificity}\)
what fraction of the predicted negatives are wrong?
fraction is total predictions
precision = positive predictive value = TP / (TP + FP)
what fraction of the prediction positives are true positives?
negative predictive value = TN / (FN + TN)
what fraction of predicted negatives are true negatives?
F-score is harmonic mean of precision and recall: 2 * (prec * rec) / (prec + rec)
NRI (controversial): compares 2 model’s binary predictions
curves - easiest is often to just plot TP vs TN or FP vs FN
roc curve: true-positive rate (recall) vs. false-positive rate
perfect is recall = 1, false positive rate = 0
precision-recall curve
summarizing curves
AUC: area under (either one) of these curves - usually roc
concordance = inter-rate reliability
exact concordance - percentage where cohort is in total agreement (i.e. accuracy)
Cohen’s kappa coefficient - 0 is uncorrelated, 1 is perfect, negative is inverse correlation
\(\kappa \equiv \frac{p_{o}-p_{e}}{1-p_{e}}=1-\frac{1-p_{o}}{1-p_{e}}\)
\(p_o\) is relative observed agreement and \(p_e\) is chance expected agreement
weighted kappa coefficient - used when ordering for predicted labels (being off by more is given bigger weight)
5.10.3. comparing two things¶
odds: \(p : \text{not }p\)
odds ratio is a ratio of odds
5.10.4. cv¶
cross validation - don’t have enough data for a test set
properties
not good when n < complexity of predictor
because summands are correlated
assume data units are exchangeable
can sometimes use this to pick k for k-means
data is reused
types
k-fold - split data into N pieces
N-1 pieces for fit model, 1 for test
cycle through all N cases
average the values we get for testing
leave one out (LOOCV)
train on all the data and only test on one
then cycle through everything
random split - shuffle and repeat
one-way CV = prequential analysis - keep testing on next data point, updating model
ESCV - penalize variance between folds
regularization path of a regression - plot each coeff v. \(\lambda\)
tells you which features get pushed to 0 and when
for OLS (and maybe other linear models), can compute leave-one-out CV without training separate models
5.10.5. stability¶
computational stability
randomness in the algorithm
perturbations to models
generalization stability
perturbations to data
sampling methods
bootstrap - take a sample
repeatedly sample from observed sample w/ replacement
bootstrap samples has same size as observed sample
subsampling
sample without replacement
jackknife resampling
subsample containing all but one of the points
5.10.6. other considerations¶
computational cost
interpretability
model-selection criteria
adjusted \(R^2_p\) - penalty
Mallow’s \(C_p\)
\(AIC_p\)
\(BIC_p\)
PRESS


Author: Daniel Spicar - clerezza.org
Date: January 29, 2009
The permission classes represent access to system resources. [1]
Internally they are represented as classes. In this document we will not
go into the details of how to program with them but rather how to use them
in the CMS from an administrator's perspective.
Basically a permission has this following syntax
(fully.qualified.class.name "/path/to/ressource" "actions")
Example: (java.io.FilePermission "/home/john/businessplan", "read")
It is easy to see that this permission would grant a user that has it the right to read the file businessplan located in the directory /home/john/.
In the ressource path wildcards and special symbols can be used. Their interpretation depends on the permission. For FilePermission the wildcards are:
The actions that are possible depend on the permission. For FilePermission the possible actions are:
Clerezza uses its own custom permission for access to TripleCollections. The permission class is org.apache.clerezza.rdf.core.access.security.TcPermission. As a ressource it expects an URI. The possible actions are:
(org.apache.clerezza.rdf.core.access.security.TcPermission "urn:x-localinstance:/system.graph" "readwrite")
[1] Java Security Architecture, Chapter 3, http://java.sun.com/javase/6/docs/technotes/guides/security/spec/security-spec.doc3.html


Please click to select an excel containing sms information here
| {{key}}{{row[key]}} | Remove this record ? |
Total sendable sms Tsh{{putCommaPesa(upload.summary.sum)}}/=
sendable entries Count {{upload.summary.validCount}}
Invalid Entries {{upload.summary.invalidCount}}
Your session has ended, unfortunately you cannot continue, please log in again by clicking the log in button to continue!


---
layout: service-grid
subject: 'This is a hard coded subject line'
description: 'Hard coded description tag line'
---
Although you don’t have to use it in order to send emails with MailChimp, our template language is a powerful, easy way to code your own email templates that are reusable and editable from within the application.
With more mapping features and a new mobile app, you can stay connected wherever you are, no matter what device you're on and get work done faster.
With more mapping features and a new mobile app, you can stay connected wherever you are, no matter what device you're on and get work done faster.


Klopp tells UEFA seminar that VAR must improve
by AFPLAUSANNE: The day after Liverpool beat Manchester City in a crunch match where VAR decisions were hotly disputed, the Premier League leader’s coach Jurgen Klopp and other top football figures have suggested improvement is needed to the fledgling system.
Klopp, his City opposite number Pep Guardiola, Real Madrid coach Zinedine Zidane, and Thomas Tuchel of Paris Saint-Germain all attended the UEFA coaches forum in Nyon, Switzerland on Monday, where the VAR (Video Assistant Referee) system was a hot topic.
“It is clear it’s a process where they have to keep on improving,” Klopp said.
“It can be improved, a lot of things have to be done by human beings and we are not 100 percent (either).
“There is space for some mistakes, nobody asks for perfection, just to have the right decision, that’s all.”
His comments were made a day after the marquee game of the Premier League season so far saw a controversial VAR call after six minutes when City could easily have had a penalty when the ball ricocheted around the Liverpool area and hit the Reds’ defender Trent Alexander-Arnold on the arm.
Not only did VAR fail to overturn the referee’s decision not to award City a penalty, but they were doubly punished 22 seconds later when Liverpool midfielder Fabinho fired home a brilliant strike to give the Reds a 1-0 lead.
UEFA assistant general secretary Giorgio Marchetti said uniformity was needed but called for time for the promising new system to bed in.
“Now we have VAR, it’s quite useful that coaches and representatives of referees can speak together,” Marchetti said.
“Let’s not forget VAR is very young and it’s a revolution in the game. “What we all need is uniformity.
“There are points which need to be fine-tuned, but you have to look at the positive points that VAR brings,” he said.


Passing off the Complexity
How I have settled into the pass ecosystem.The Password Dilemma
For quite some time I was a user of KeePass. Life was great I had a
client that worked on every platform (OpenBSD via mono
, Android and
iOS via 3rd party apps). Every now and then I would manually copy the
file from my “main” machine to all the others.
After a while the syncing process became tedious. I attempted to find
things that would aid in the process.. Tools like syncthing
,
unison
, dropbox.. etc. They all had issues. With syncthing
the
synchronizing was unreliable. Most of the time it couldn’t find other
hosts on my network.. and when it finally did I would end up needing
to tell it how to resolve conflicts. Dropbox didn’t have a native
client for OpenBSD - not to mention putting your password database
online is a terrifying proposition (my main issue with LastPass)!
Out of all the management methods I tried - LastPass was the most “complete”:
| Name | Syncing | Browser | OpenBSD | iOS/Android | My Trust |
|---|---|---|---|---|---|
| LastPass | ✓ | ✓ | ✓ | ✓ | ✗ |
| KeePass | ✗ | ✗ | ✓ | ✓ | ✓ |
| Password-Gorilla | ✗ | ✗ | ✓ | ✓ | ✓ |
Enter pass
pass
is touted as “the standard Unix password manager”. It works
by keeping your passwords in individual PGP encrypted files. For
example, the entry Web/google.com
would hold my “google.com”
password. An entry can contain more than just your passwords (I
have username: ....
set on the 2nd line.), the first line
is always expected to be the password.
Out of the box, pass supports syncing via git, multiple recipients (meaning it can encrypt a password file for multiple people), random password generation and copying to clipboard with auto-clear!
It doesn’t, however, work out of the box on iOS/Android or my browser. Fortunately for me - pass has a fantastic ecosystem with a multitude of 3rd party browser extensions, iOS/Android apps.. best all, they are open source! There are even full replacements for pass itself! One such replacements is gopass.
gopass
extends pass a bit further, it’s written in Go,
seamlessly supports multiple “stores” (allowing me to have an
extra level of privledge separation for sensitive passwords),
is pledge()’d, AND can run on every OS I use!
For browsers, I have settled on browserpass. It’s also written in Go, pledge()’d, works on all my systems* (OpenBSD, Windows, macos), has auto-fill and easy to grok source code!
For iOS/Android there are passforios and Android-Password-Store. All of which support syncing via git!
Couple all this together and I get:
| Name | Syncing | Browser | OpenBSD | iOS/Android | My Trust |
|---|---|---|---|---|---|
| gopass/browserpass/mobile app | ✓ | ✓ | ✓ | ✓ | ✓ |
A few hurdles
Key management
PGP key management was an initial hurdle for me. Having to copy keys from one computer to another put me back in the same situation I had with KeePass.. syncing.
My solution to this problem is to store my PGP keys on a SmartCard (Yubikey 4 in this case). This lets me “transfer” my PGP key between my main computers without issue. It also has the added advantage of giving me an ssh key I can use on less trusted machines!
For me, the Yubikey is ideal because of the form factor, however, there are other alternatives such as NitroKey.
Remote access
Because pass and friends sync by way of git, you must expose your git repo to be able to use the sync mechanism. I didn’t want to expose my main repo to the world (even though it is only available via ssh), so it is only accessible via my home network.
I have an ssh key per device, and use the command=
option in
~/.ssh/authorized_keys
to force git-only ssh access to less trusted
devices.
For example, my phone is less trusted than my OpenBSD laptop, so I have an entry like this:
command="git-shell -c \"$SSH_ORIGINAL_COMMAND\"",no-port-forwarding,no-agent-forwarding,no-X11-forwarding,no-pty ssh-rsa ........ dumbdevice
This limits the device dumbdevice
to only executing git-shell
!
Conclusion
All things considered, this setup takes a little bit to configure initially (with keys and git repos.. etc), but its advantages out weigh that hurdle for me:
- It’s very simple. No databases, no extra exposed services.. etc.
- It uses existing tools to manage / sync my passwords. I trust ssh way more than I trust a web server!
- The ecosystem is very active.
- If need be, I can operate entirely without the “pass” tools via
something like:
gpg -d ~/.password-store/Web/google.com | head -n1 | xclip
* Currently there is a bug in Firefox on OpenBSD that prevents native extensions from functioning.. I hope to get this fixed soon! Chromium works fine, however.


Creating this website was my very first web dev (web development) project. Since starting this project there has been a slew of language formalities I've had to learn, kinks I've had to figure out, and choices I've had to make. Halfway through the process, I decided to document it. I wanted to provide an extra resource to students and developers building their own github.ios using Jekyll. I hope you find this post useful.
This website is hosted by GitHub Pages. A GitHub Page turns a GitHub repository into a site with the extension github.io. Between WordPress and GitHub Pages, I chose github.io because it seemed simpler and more doable. GitHub Pages mentioned using Jekyll, a static site generator, so I gave it a shot. A static site generator, sometimes called a flat page or stationary page, is said to require no PHP scripting, no databases, nor server code. It is therefore safer, but less interactive. For more on Jekyll, scroll down to find the section Choosing Jekyll.
Like for all other projects:
To build a github.io using Jekyll, you'll need the latest versions of:
To use Jekyll I had to download the newest version of Ruby. I spent hours trying to figure out how to change the PATH so Ruby would default to the freshly downloaded version. The solution ended up being: The two other popular options for managing ruby and its many versions are to use rvm or rbenv. After my struggle, I ended up downloading rvm anyway.
Quora answer Login Shells (.bash_profile) A login shell is a bash shell that is started with - or --login. The following are examples that will invoke a login shell. sudo su - bash --login ssh user@host When BASH is invoked as a login shell, the following files are executed in the displayed order. /etc/profile ~/.bash_profile ~/.bash_login ~/.profile
I chose Jekyll because it seemed easy to use. Jekyll was written in Ruby by GitHub's cofounder Tom Preston-Werner, so I thought it would work well in conjunction to this GitHub-oriented project. To use Jekyll, one must download Jekyll and bundler, which may also be a process of its own.
For me, the Jekyll docs were not enough. My experience with Jekyll was more trial-and-error, meaning I playing around with the front matter and syntax, learning how files were being generated, etc. to debug. Truthfully, I probably should have done some more research, like watch a Youtube video or read about other site testing systems. (I spent a long time trying to figure out why my edits off of a free Jekyll theme from could not display correctly.) Meanwhile, the video shows how to, at the very least, publish a testing page using a Jekyll theme.
The cool thing about Jekyll is it is a high level software. One can write a Markdown file and Jekyll will generate it into an HTML file for you. Editing and testing your site is also very user-friendly--simply edit the code, ensure there are no compilation errors, type jekyll serve
if not already serving, and refresh the localhost:4000
page. There were really only two commands I was taught and therefore used, jekyll build
and jekyll serve
.
Nevertheless, Jekyll is a pretty useful software for making sites. Unfortunately, I cannot compare it to other workflows, because at the time of writing, I know only how to make edits, code, and deploy in a Jekyll workflow setting.
To learn the basics step by step, the Jekyll Docs worked well for me. I recommend following it to learn how to structure your files. You create an index.html
file and learn the basic HTML file structure. You learn about front matter, a way to set variables of a file, sort of like an object and its instance variables. And you learn how to employ include and layout files.
Step by Step Takeaways
_config.yml
Errors
A navbar (navigation bar) allows a user to go from page to page on your site. When creating my site, I wanted a homepage, an about me page, and a page for posts. Ergo, I needed a navbar. To create a navbar, I need to:


Tests that the inspected page does not crash after undoing a new rule addition.
Bug 104806
The test has passed (no crash).


Bangladesh opt to bowl in series decider against India
Nagpur - Bangladesh skipper Mahmudullah Riyad won the toss and elected to bowl in the third and deciding Twenty20 international against India in Nagpur on Sunday.
The tourists have made one change from their previous loss of the series that is tied at 1-1. Batsman Mohammed Mithun comes in to the side in place of injured Mosaddek Hossain.
"Wicket looks good, but India is a good chasing side," Mahmudullah said at the toss.
"Dew could come into play as well. We started well in Rajkot (second match), but need to keep up momentum in the middle overs."
India have also made one change to their starting line-up, with Krunal Pandya making way for Manish Pandey.
India captain Rohit Sharma admitted that he would have chosen to bowl as well despite eight of the 11 T20 matches played at the Nagpur stadium have been won by the team batting first.
"Teams batting first have posted targets and have managed to defend it, possibly because of the slowness of the pitch. Still have to be good on the day and hope we can post a good score," he said.
Teams
India: Rohit Sharma (capt), Shikhar Dhawan, KL Rahul, Shreyas Iyer, Rishabh Pant, Manish Pandey, Shivam Dube, Washington Sundar, Deepak Chahar, Yuzvendra Chahal, Khaleel Ahmed
Bangladesh: Mahmudullah Riyad (capt), Liton Das, Soumya Sarkar, Mohammad Naim, Mushfiqur Rahim, Afif Hossain, Mohammed Mithun, Aminul Islam, Shafiul Islam, Mustafizur Rahman, Al-Amin Hossain
Umpires: CK Nandan (IND), Anil Chaudhary (IND)
TV Umpire: Nitin Menon (IND)
Match referee: Ranjan Madugalle (SRI)


{include file="inc/header" /}
{include file="inc/toper" /} {include file="inc/menu" /}
你好！{$Request.session.username}，欢迎登录系统
{include file="inc/script" /}


Explanations of Non-Monotonic Inference in Abstract Argumentation
#### Idea
* Formal argumentation is non-monotonic reasoning approach
* But when do we violate monotony?
&rarr Can arguments with certain properties *explain* the violation of monotony?
* This paper is a simple starting point:
* Abstract argumentation
* Admissibility-based semantics
* Focus on normal expansion ('adding arguments and attacks')
#### Abstract Argumentation
* Argumentation framework: tuple $AF = (AR, AT)$,
where $AR$ is a **finite** set of elements ("arguments") and $AT \subseteq AR \times AR$ ("attacks")
* Argumentation semantics $\sigma$ takes $AF = (AR, AT)$ and returns $ES \subseteq 2^{AR}$
* E.g.: preferred semantics returns every $\subseteq$-maximal set that attacks all of it attackers
#### (Normal) Expansions
#### (Normal) Expansions - Example
#### (Cardinality-)Maximal Monotonic Extensions
#### Maximal Monotonic Extensions - Example
Real-world Motivation
#### *Degrees of Monotony* Approach
* Given $AF, AF', AF \preceq_N AF', \sigma, E \in \sigma(AF)$
* Select an $E' \in \sigma(AF')$ that is *as monotonic as possible*
* Degree of monotony for non-empty $E$:
$\frac{|E \cap E'|}{|E|}$
* Property is not transitive
Degrees of Monotony
Explainable violation of monotony
#### Cautious monotony
* $AF = (AR, AT), AF' = (AR', AT'), AF \preceq_N AF'$, semantics $\sigma$
* $\sigma$ satisfies cautious monotony iff $\forall E \in \sigma(AF)$
$AR' \setminus AR$ does not attack $E$
$\implies \exists E' \in \sigma(AF)$, s.t. $E \subseteq E'$
* Satisfied by preferred, complete, grounded semantics
* If cautious monotony "condition" is false, arguments that attack $E$ are potential explanations
* Only attacks to arguments in $E$ that are no longer admissible are relevant
Explanation by Cautious Monotony
#### Open questions
* Are there any problems with integrating the two approaches?
* What about *monotony of rejection*?
* What about naive-based and weak admissibility-based semantics?
* How to move from here to gradual argumentation?


Binary classification based on an ensemble of kernel machines ("Ballings, M. and Van den Poel, D. (2013), Kernel Factory: An Ensemble of Kernel Machines. Expert Systems With Applications, 40(8), 2904-2913"). Kernel factory is an ensemble method where each base classifier (random forest) is fit on the kernel matrix of a subset of the training data.
| Version: | 0.3.0 |
| Imports: | randomForest, AUC, genalg, kernlab, stats |
| Published: | 2015-09-29 |
| Author: | Michel Ballings, Dirk Van den Poel |
| Maintainer: | Michel Ballings <Michel.Ballings at GMail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| Citation: | kernelFactory citation info |
| Materials: | NEWS |
| CRAN checks: | kernelFactory results |
| Reference manual: | kernelFactory.pdf |
| Package source: | kernelFactory_0.3.0.tar.gz |
| Windows binaries: | r-devel: kernelFactory_0.3.0.zip, r-release: kernelFactory_0.3.0.zip, r-oldrel: kernelFactory_0.3.0.zip |
| OS X binaries: | r-release: kernelFactory_0.3.0.tgz, r-oldrel: kernelFactory_0.3.0.tgz |
| Old sources: | kernelFactory archive |
| Reverse imports: | aCRM, hybridEnsemble |
Please use the canonical form https://CRAN.R-project.org/package=kernelFactory to link to this page.


Starting out: The Ferry and Whale Watching
My girlfriend and I set off on our journey around 4am, to catch the 8:15am ferry from Port Angeles. The ferry ride started out foggy but it cleared up the closer we got to Victoria.
After arriving, we headed to our hotel to drop off our luggage and started exploring along the waterfront. We headed in the direction of the Fisherman's Wharf because we had a whale watching tour at 3pm.
After eating at Fisherman's Wharf, we checked-in with our tour and the captain let us know the plan for the trip. There had been orca sightings earlier in the day so he was hopeful the luck would continue for our tour. We all boarded the ship and set sail!
The trip was set to take 3 hours and the first 30-45 minutes was just about us finding the correct location. After a while, we noticed a bunch of other boats all centered around one specific location. It looks like we had found what we were after!
Day 2: Ziplining, the Royal BC Museum, and Kayaking!
Our second day in Victoria, we decided to try out ziplining. We tried it once before in Las Vegas, but this one was a proper zipline tour. We made our way out to Sooke, about 40 minutes away from downtown Victoria.
The tour itself takes about 2 hours to complete. It is 8 separate lines, ranging from 150 feet to 1,000 feet long. After you complete the first line, there's no turning back, the only way down is by completing the course.
The views were breathtaking and our guides did a fantastic job keeping us safe, and also showing us different ways to ride the lines. (My personal favorite was the "Spiderman")
After our ziplining tour we made our way back to Victoria and headed to the Royal BC Museum.
Their Natural History Exhibits were very impressive. They had several rooms that represented different regions.
There was also a very interesting exhibit about Modern History which had entire rooms set up as if they were a time capsule from the past.
After running out of time exploring the museum, we made our way to the waterfront to start our kayak tour.
Our tour lead us out from the Inner Harbour and up the Gorge Waterway. We got to see a few Great Blue Heron and another Harbour seal.
Day 3: Miniature World and the Ferry Home
Our last day in Victoria was rainy, so we decided to check out Miniature World. It's a very interesting place that has miniature displays that show off both historical events and fictional worlds.
In all honesty, the pictures don't do the displays justice. They are all very impressively detailed, and a few, like the fair, have moving parts to represent the actual motion of the amusement rides. It also has a day/night cycle to show off the colorful lights you'd expect if you were to visit at night. It was a fun way to spend a rainy last day in Victoria.
After visiting for a while we made our way back to the hotel, collected our belongings, and headed to the ferry terminal. This was a very fun way to spend the Memorial Day Weekend.


--- title: pwnat - NAT to NAT client-server communication layout: post ---
pwnat, pronounced "poe-nat", is a tool that allows any number of clients behind NATs to communicate with a server behind a separate NAT with *no* port forwarding and *no* DMZ setup on any routers in order to directly communicate with each other. The server does not need to know anything about the clients trying to connect.Simply put, this is a proxy server that works behind a NAT, even when the client is behind a NAT, without any 3rd party.
This seems really useful for new p2p projects.


| Equipment | {{ copy.equipment }} |
| Description | {{ copy.description|readmore:50 }} |
| Location | {{ copy.location }} |
| {{ copy.email }} |
No results to display
{% endif %}{% extends "base_generic.html" %} {% block content %}
| Equipment | {{ copy.equipment }} |
| Description | {{ copy.description|readmore:50 }} |
| Location | {{ copy.location }} |
| {{ copy.email }} |
No results to display
{% endif %}


Select Fix Ready to Deploy to DEV Fix tested in DEV (Ready to Deploy to QC) Fix Deployed to QC (Ready for Testing) Fix tested in QC (Ready to Deploy to PROD) Fix Deployed to PROD Prev (Ready for Testing) Fix Tested in PROD Prev (Ready to Deploy to PROD Live) Fix Deployed to Prod Live (Ready for Re-Testing) On Hold Fix Failed Testing Fix Passed Testing (Approved)
Change Log
Mark Complete
Time Stamp


|
| | MachineActorState (int _interlock_pin=21, int _relay_pin=25, int _motor_x_pin=13, int _motor_y_pin=14) |
| |
| bool | _set_output (int pin, bool enabled) |
| |
◆ MachineActorState()
| MachineActorState::MachineActorState |
( |
int |
_interlock_pin = 21 , |
|
|
int |
_relay_pin = 25 , |
|
|
int |
_motor_x_pin = 13 , |
|
|
int |
_motor_y_pin = 14 |
|
) |
| |
|
inline |
◆ _set_output()
| bool MachineActorState::_set_output |
( |
int |
pin, |
|
|
bool |
enabled |
|
) |
| |
|
inline |
◆ disable_interlock_tref
| TRef MachineActorState::disable_interlock_tref = NullTRef |
◆ disable_relay_tref
| TRef MachineActorState::disable_relay_tref = NullTRef |
◆ INTERLOCK_OFF
| constexpr bool MachineActorState::INTERLOCK_OFF = true |
|
static |
◆ INTERLOCK_ON
| constexpr bool MachineActorState::INTERLOCK_ON = false |
|
static |
◆ interlock_pin
| int MachineActorState::interlock_pin |
◆ last_motor_activity_timestamp
| TimeDuration MachineActorState::last_motor_activity_timestamp = 0s |
◆ last_motor_pulse_count
| int MachineActorState::last_motor_pulse_count = 0 |
◆ last_motor_pulse_timestamp
| TimeDuration MachineActorState::last_motor_pulse_timestamp = 0s |
◆ max_job_end_interval
◆ max_job_start_interval
| TimeDuration MachineActorState::max_job_start_interval = 25s |
◆ max_motor_pulse_count
| int MachineActorState::max_motor_pulse_count = 1024 |
◆ motor_activity_check_tref
| TRef MachineActorState::motor_activity_check_tref = NullTRef |
◆ motor_activity_seconds
| int MachineActorState::motor_activity_seconds = 0 |
◆ motor_x_pin
| int MachineActorState::motor_x_pin |
◆ motor_y_pin
| int MachineActorState::motor_y_pin |
◆ RELAY_OFF
| constexpr bool MachineActorState::RELAY_OFF = false |
|
static |
◆ RELAY_ON
| constexpr bool MachineActorState::RELAY_ON = true |
|
static |
◆ relay_pin
| int MachineActorState::relay_pin |
◆ threshold_motor_pulse_count
| int MachineActorState::threshold_motor_pulse_count = 25 |
The documentation for this struct was generated from the following file:


an enthousiastic architect with a passion for creating the link between the business and it as communication is key for creating value. although i'm definitely a fan of modeling problems, i'm also still quite fond of engineering, code and i love to have an understanding of technical problems.
twitter linkedina social mmo inspired by games like Habbo. The game is currently in development using the Godot Engine and a custom backend hosted in Azure.
actively modding gameboys (pocket, color, advance), rom hacking, tinkering with CRTs and MiSTer FPGA
development in the crypto space, mostly web3 and defi projects
dutch hobby radio station for whenever i feel like putting some tunes out in the world


| Name: MRS. CHETHANA | Reg No: 012-3SMHC19 |
|---|---|
| Age / Sex:34/F | Contact No:9845317593 |
| Marital Status:ML-11 YRS | Date:16/3/19 |
| Occupation:SOFTWARE ENG | Dr. PJFP |
Address: NATIVE BLORE. |
DIAGNOSIS- |
COUGH SINCE MONTH/PRODUCTIVE . <NIGHT TIMES, DRY IN THE NIGHT. IT DOESNT STOP AT ALL. SOME SMOKE TRIGERRED HAPPENED AND BURNING OF LEAVES BEHIND THEIR HOUSE ATER WHICH SHE GOT THIS COUGH. HAD FEVER AND TOOK ANTIBIOTICS ALSO THEN. HAD PAIN IN ONE SIDE OF THE THROAT. TOOK MED FOR A MOTNTH ANTI ALLERGIC. ON COF MIXTURE.
H/O SINUS ONE SIDED. LEFT SIDE. NOSE ON THE LEFT HAND SIDE PAINS A LOT.   THE SMOKE THING THT TRIGGERED ITS NOT REDUCING NOW.
MNG TIMES THERE IS BLOOD SPOTS AND NOSE ALSO BLOOD WITH PHLEGM. CONSTANT COUGH. PRIOR USE TO BE PERFUME FAN BUT NOW A DAYS NOT ABLE TO TOLERATE THT ALSO. FISH DOESN’T SUIT SMELL ALSO. LONG AGO HAD RASHES AFTER EATING IT. SINCE THEN STOPPED EATING FISH. SOME PLANT ALSO TRIGGERED HER RASHES. DON’T LIKE CATS. SNAKES INTOLERANT. I CAN FEEL AS IF THE SKIN IS BEING RUBBED IF SHE SEES THEM AND CAUSES A LOT OF HEADACHE FR HER. LIKES LOVE STORIES.  INDIAN AUTHORS. LIKES COLD CLIMATE BUT FEELS INTOLERANT GETS PAINS EVERYWHERE. FIRST PART IS HER LEGS START TO PAIN.
RX:
STANNUM MET 200 – 4-4-4 B/FOOD.
NAT MUR KALI SULPH 6X 4-4-4-4.
26/3/19: COUGH ISNT LEAVING. NECK PAIN
RX:
TUB1M/CALC PHOS1M/ RHUS TOX 1M – 4-4-4-4.


Murphy's Law
`Prev `__
M
`Next `__
--------------
**Murphy's Law**: prov.
The correct, *original* Murphy's Law reads: “If there are two or more
ways to do something, and one of those ways can result in a catastrophe,
then someone will do it.” This is a principle of defensive design, cited
here because it is usually given in mutant forms less descriptive of the
challenges of design for `*luser* <../L/luser.html>`__\ s. For example,
you don't make a two-pin plug symmetrical and then label it “THIS WAY
UP”; if it matters which way it is plugged in, then you make the design
asymmetrical (see also the anecdote under `*magic
smoke* `__).
Edward A. Murphy, Jr. was one of McDonnell-Douglas's test engineers on
the rocket-sled experiments that were done by the U.S. Air Force in 1949
to test human acceleration tolerances (USAF project MX981). One
experiment involved a set of 16 accelerometers mounted to different
parts of the subject's body. There were two ways each sensor could be
glued to its mount, and somebody methodically installed all 16 in a
replacement set the wrong way around. Murphy then made the original form
of his pronouncement, which the test subject (Major John Paul Stapp)
mis-quoted (apparently in the more general form “Whatever can go wrong,
*will* go wrong)” at a news conference a few days later.
Within months ‘Murphy's Law’ had spread to various technical cultures
connected to aerospace engineering. Before too many years had gone by
variants had passed into the popular imagination, changing as they went.
Most of these are variants on “Anything that can go wrong, will”; this
is more correctly referred to as `*Finagle's
Law* <../F/Finagles-Law.html>`__. The memetic drift apparent in these
mutants clearly demonstrates Murphy's Law acting on itself!
--------------
+--------------------------+----------------------------+--------------------------+
| `Prev `__ | `Up <../M.html>`__ | `Next `__ |
+--------------------------+----------------------------+--------------------------+
| munge | `Home <../index.html>`__ | music |
+--------------------------+----------------------------+--------------------------+


This sample shows how Tabbed Panels can load content dynamically, using the Spry.Utils.UpdateContent function in SpryData.js. When the tab is clicked, the HTML fragment is loaded into the Panel content DIV. The panels are each given an ID so we can direct the content to the panel.


My son asked my to watch his friend Peanut today and teach him some computer stuff. Mostly a Java day but he seemed really interested in bash scripting.
10/25/2021, 10:47:27 AM
Favs: 4
Retweets: 0
link--- layout: tweet ---
My son asked my to watch his friend Peanut today and teach him some computer stuff. Mostly a Java day but he seemed really interested in bash scripting.
10/25/2021, 10:47:27 AM
Favs: 4
Retweets: 0
linkApparently I wasn’t sharing the keyboard enough yesterday
10/26/2021, 1:03:05 AM
Favs: 1
Retweets: 0
link


US stocks end mostly higher as Nasdaq hits new record
NEW YORK: US stocks ended mixed on Tuesday (Nov 12) but the Nasdaq posted a new record even though investors still have not received clarity on an agreement to end the US-China trade war.
Attention now will shift to back-to-back testimony on Wednesday and Thursday by Federal Reserve Chairman Jerome Powell but it is unlikely he will do much beyond confirm the central bank is on hold for now.
In a rarely seen development, the Dow Jones Industrial Average closed with no change at 27,691.49.
But the broader S&P 500 gained 4.83 points (0.16 per cent) to finish at 3,091.84 while the tech-dominated Nasdaq Composite Index rose 21.81 points (0.26 per cent) to close at a new high of 8,486.09.
The highly-anticipated speech by President Donald Trump failed offer any positive news on US trade disputes with China or Europe. Instead he threatened to raise tariffs "substantially" on Chinese goods if no deal is reached with Beijing.
Trump downplayed the impact on the economy of the trade conflicts, saying "The real cost... would be if we did nothing."
Schwab market analysts summed it up saying the speech "fell short of those expectations."
Trump again criticized the Fed for raising rates two quickly and cutting two slowly.
But the December policy meeting is likely to keep rates on hold, a message Powell likely will reiterate in his congressional appearance.
CFRA's Sam Stovall said, "We are in a period where we have to wait until December to see what the Fed might be doing again. We still have to wait to get some sort of an agreement on the trade situation."
One of the major movers in the trading session was Disney, which posted a gain of 1.4 per cent after launching a streaming service that will offer major competition to Netflix, Hulu and other services.
But Advance Auto Parts fell 7.5 per cent after reporting disappointing quarterly earnings.


{% load static %}
I design and develop services for customers of all sizes, specializing in creating stylish, modern websites, web services and online stores. My passion is to design digital user experiences through the bold interface and meaningful interactions.
4th april 1998
22 Yr
Canada
California, USA
<EMAIL_ADDRESS>820-885-3321
skype.0404
Available
Happy Clients
Project Completed
Photo Capture
Telephonic Talk


module Memmap:sig
..end
Memmap
is an instance of the Interval_tree
with the
Memory
serving as an interval.
type'a
t ='a Std.memmap
val empty : 'a t
empty
mapval singleton : Std.mem -> 'a -> 'a t
singleton
a memory map containing only one memory regionval min_addr : 'a t -> Std.addr option
min_addr map
is a minimum addr mapped in map
val max_addr : 'a t -> Std.addr option
max_addr map
is a maximum addr mapped in map
val min_binding : 'a t -> (Std.mem * 'a) option
min_binding map
is a minimum binding mapped in map
val max_binding : 'a t -> (Std.mem * 'a) option
max_binding map
is a maximum binding mapped in map
val add : 'a t -> Std.mem -> 'a -> 'a t
add map mem tag
adds a new memory region mem
tagged with
tag
. If the same region was already in the map
it will be
tagged with the tag
again, even if it has had the same tag.val dominators : 'a t -> Std.mem -> (Std.mem * 'a) Std.seq
dominators map mem
an ordered sequence of all memory regions,
containing mem
. A memory region (x,y)
contains region (p,q)
,
iff p >= x && q <= y
, where memory regions are depicted using
closed intervals.val intersections : 'a t -> Std.mem -> (Std.mem * 'a) Std.seq
intersections map mem
an ordered sequence of all memory regions,
that intersects with mem
. Memory region (x,y)
intersects with
region (p,q)
iff there exists such z
that
z >= p || z <= q && z >= x && z <= y
.
In other words if there exists such byte that belongs to both memory
regions.
val intersects : 'a t -> Std.mem -> bool
intersects map mem
is true if intersections map mem
is not emptyval dominates : 'a t -> Std.mem -> bool
dominates map mem
if there is a non empty set of dominatorsval contains : 'a t -> Std.addr -> bool
contains map addr
true if there exists such memory region mem
,
that Memory.contains mem addr
val lookup : 'a t -> Std.addr -> (Std.mem * 'a) Std.seq
lookup map addr
returns an ordered sequence of all memory
containing the addr
val map : 'a t -> f:('a -> 'b) -> 'b t
map m f
returns a new map with each tag mapped
with function f
val mapi : 'a t -> f:(Std.mem -> 'a -> 'b) -> 'b t
mapi m f
the same as map
, but f
is called with two
arguments: mem
and tag
, where mem
is a memory region,
and tag
is a tag
assosiated with that region.val filter : 'a t -> f:('a -> bool) -> 'a t
filter map f
returns a map that contains only those elements
for which f
evaluated to true
val filter_map : 'a t -> f:('a -> 'b option) -> 'b t
filter_map m f
creates a new map by applying a function f
to
each tag. If f
returns Some x
then this region will be mapped
to x
in a new map, otherwise it will be dropped.val filter_mapi : 'a t ->
f:(Std.mem -> 'a -> 'b option) -> 'b t
filter_mapi
is like filter_map
but use function also accepts
would assosiated memory regionval remove : 'a t -> Std.mem -> 'a t
remove map mem
removes all bindings to mem
val remove_intersections : 'a t -> Std.mem -> 'a t
remove_intersections map mem
removes all bindings that
that intersects with mem
val remove_dominators : 'a t -> Std.mem -> 'a t
remove_dominators map mem
removes all bindings that are
dominators to mem
val to_sequence : 'a t -> (Std.mem * 'a) Std.seq
to_sequence map
converts the memmap 'a t
to a sequence of
key-value pairsinclude Container.S1
val pp : 'a Std.printer -> 'a t Std.printer
pp pp_elem
constracts a printer for a memmap to the given element.


Execution is performed using your browser's javascript's regex engine.
Explanation is done according to the Mozilla RegExp Reference. This obviously may not match the regular expression flavor that you are using.
Please let me know if you find a bug, or if I've missed something, or if you have an idea for something to add.
2010-10-18: Quantifer description now includes greedy flag.
See Also: JSON Visualization and
XML Utilities


Egypt police arrest three journalists
by https://www.dawn.com/authors/119/afp, AFPCAIRO: Three Egyptian news editors from local news outlet Mada Masr have been referred for prosecution after police in civvies raided its office on Sunday, the site said.
“We have just got our phones and laptops back. Security forces left. Lina Attalah, Mohamed Hamama and Rana Mamdouh have been taken to the prosecution service, according to one of the men who entered our offices,” the independent news site said.
It posted on social media that nine plain-clothed officers questioned the journalists on site for several hours, demanding that they unlock their phones and laptops and hand them over.
The whereabouts of the three who were detained is not yet known.
Sunday’s raid came at around 1:30pm, a day after Shady Zalat, 37, a news editor who has worked at the prominent website since 2014, was arrested at his home.
The news website’s Twitter feed said Zalat was released later on Sunday at around 5:30pm.
Mada Masr publishes investigations into corruption and security issues in both Arabic and English.
Published in Dawn, November 25th, 2019


--- layout: archive title: Zulip Chat Archive permalink: /stream/218272-FoMM-/-Lean-Together-2020/topic/Zoom.html ---
We've got 90 people registered! It should be a great meeting. The weather forecast looks o.k. -- comfortably above freezing, no winter storms on the horizon.
I set up Zoom meetings for the sessions for the first day, and posted the links at the bottom of the page here:
http://www.andrew.cmu.edu/user/avigad/meetings/fomm2020/schedule.html
We should be able to start the "meeting" before the session begins, so you can click the link early and watch people file into the room. It might help to pre-install the Zoom app ahead of time, but if you don't, your browser should prompt you to do it when you click the link. It only takes a few seconds.
I've been sick in bed for the last week. I'm recovering now, but I think it's still good for me to stay home today. So even for locals, the Zoom sessions are very welcome!
We are having some technical difficulties, but the AV guys are here. Hopefully, it will be up soon.
We can't zoom the camera, but at least we can see the room.
Is it possible to screen share so that we can see the slides?
I think the general plan is to get it fixed. We haven't started yet
Also, the audio is still off.
Is the audio back on?
No
no, it's muted
There are still complications with the video. We're working on it.
now it's on
Can you hear anything? It's unmuted for me also but with no sound output
Yes, I can hear it well
I can also hear
It works now, thanks!
We can only screen share from the lectern, which is clunky. Is the sound o.k.?
AV will come back at 11 to get it fixed.
Kevin just asked a question from the third row. Was that audible on the stream?
It looks like the whole room has mics, but I'm not sure which are active.
Yes I could hear it fine
(where) can we access the slides?
We don't have Reid's yet. We do have Cyril's for the next talk: http://cyrilcohen.fr/fomm2020.pdf
Here's mine: https://www21.in.tum.de/~eberlm/pdfs/fomm2020.pdf
The audio quality is pretty low, making it sometimes hard to hear. I don't know whether that is a microphone issue or a Zoom issue.
The AV guys could not get the zoom working. They will try again during the lunch break, but I am afraid the camera will still be zoomed out for the next session.
mic is suddenly not working (10 sec ago)
the audio just got muted
after Kevin Buzzard remarked that the d_r is the lcm from 1 to r
indeed the audio was muted
it's unmuted now
fixed again
I tried to turn the volume up before Manuel started, but I'm not sure if it worked. Is the quality any better?
the audio quality is still pretty bad, but I can hear the words that are spoken
We'll investigate at lunch. There are lots of weird noises here and I don't know where any of it is coming from.
Slides for Sebastien's talk, coming up next: http://robertylewis.com/files/fomm_gouezel.pdf
I am sorry that the streaming is not working as well as planned. This web page has links to the first two talks after lunch: http://www.andrew.cmu.edu/user/avigad/meetings/fomm2020/schedule.html. (Rob has been posting them on his site; the link addresses are formulaic.) We'll try to get Ulrik's slides up before his talk.
We tried to bump up the mic volume again. Has the stream quality improved at all?
I've put my slides on my webpage.
The session 4 (659-260-510) stream just died for me ("waiting for the host to start this meeting")
the meeting got canceled because the host started another meeting.
Sorry. We don't know what happened, but we got it fixed pretty quickly.
I get the message "the host has another meeting in progress" again.
Rob is on the case
Rob is putting Bruno on the case.
And Bruno has put Jeremy on the case.
Damn, I started the wrong meeting. The meeting ID is 332-471-944. If you change the number in the link (without the hyphens) it should work.
https://cmu.zoom.us/j/332471944
I fixed the link on the web page now.
Thanks!
The next talk is Patrick's. I don't think his slides made it to the website yet. For now they're here: http://robertylewis.com/files/fomm_massot.pdf
They are now also on the website.
Are the slides for this talk or Markus's talk going to be online?
@Reid Barton Are your slides available somewhere?
We prompted the speakers for slides a few times. He hasn't sent his slides yet, but hopefully we can post them later (together with a recording of his talk).
(I was responding to Jason, not Chris!)
@Markus Rabe I would love to see the slides for your talk. Would you mind sharing them?
Alas, it seems that he cannot make them public. (Google rules, I guess.)
Google doesn't want the world to know that they're trying to write an AI which can translate ArXiv into dependent type theory!
They do want the world to know, but they don't want the world to know how they do it.
The website reverted to listing yesterday's streams: http://www.andrew.cmu.edu/user/avigad/meetings/fomm2020/schedule.html
The current meeting id seems to be 896-922-652
The current meeting id seems to be 896-922-652
Yes, this is the correct id.
Thanks for catching that! The web site is fixed now.
Let me know if I should ask Gabriel to readjust the microphone to make it louder.
If anyone is streaming right now: how is the volume?
If anyone is streaming right now: how is the volume?
Weren't we explicitly told this was not recorded?
It's streaming, not being recorded.
It's streaming, not being recorded.
oh,... right
The volume is very good.
It's streaming, not being recorded.
unless someone is recording the stream...
Please don't :slight_smile:
So Lean 4 is classified material?
Sorry. To clarify, the talks are being recorded, the informal discussions are not. Sebastian's talk will be put on YouTube afaik.
aah, ok
I'm looking forward to the youtube versions!
Hi, please find attached the slides for my presentation this afternoon.
TextMiningArXiv.pdf
I'll put them on the web page during the lunch break.
Reid Barton Are your slides available somewhere?
There's now available at http://www.andrew.cmu.edu/user/avigad/meetings/fomm2020/slides/fomm_barton.pdf
Floris doesn't have slides for his talk, but he will use this file for the demo. I'll put it on the web page later. demo_filled.lean
Is there an ETA for the youtube videos?
I have a long bus ride tomorrow and I'm planning to cut up the recordings then. They'll reach YouTube once I have a stable internet connection.
Thanks! I can wait that long (-;
The bus ride was productive, videos are cut up into individual talks. Still haven't reached the stable internet connection though. Hopefully tomorrow.
Were they all there? Bruno and I were worried that we might have lost one or two.
Yes, I think every talk was captured by at least one of you.
We're missing the very beginning of Ulrik's talk. Otherwise I think we got everything. Here's a playlist: https://www.youtube.com/playlist?list=PLlF-CfQhukNkWwZt45vkNfWfuO-tBBqPN
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC