From: EMMANUEL JEFF
Abidjan Cote D'Ivoire.
Dear sir,
Permit me to inform you of my desire of going into
business relationship with you .
I am djiouf samba The first son of late Mr and Mrs
ATTAH JEFF of Zimbabwe and my family comes
from the royal lineage. My father was a very wealthy
GOLD and COCOA manchant who based in ACCRA GHANA
and ABIDJAN respectively, The economic capital of cote
D’Ivoire.
He was poisoned to death by his business associate on
one of their business outings.
When my mother died on the 21ST october 1994 , My
father took me and my brother so specail because we
were motherless.
Before the death of my father on the 29th April
2002 in a private hospital here in Abidjan , He
sincerely called me on his bed side and told me that
he had a sum of 3.5OO MILLION USA DOLLARS)
kept
in a security company in
(AFRICA). He also said that the security company
does not know the content of the safe Box.He also
used my name to Deposit the money as his first Son
for next of kin. He also explained to me that it was
because of this wealth that he was poisoned by his
business assocaites, That I should seek for a foreign
partner in a country of my choice where I will
transfer this money and use it for investment
purposes, I want you to assist me in clearing this
fund into your account overseas as a beneficiary of
the fund, and also use
it for an ivestment purpose, such as real estate
management. My intrested areas of investment are; REAL
ESTATE,HOTELS, PETROLUM INDUSTRY.
, I am honourably seeking for your assistance in
the following ways.
(1)To assist me to clear this fund from the security
company and transfer to
your account successfully.
(2) to provide a bank account into which this money
would be transfer to.
(3)To serve as the guardian of this fund since
I am a Boy of (22)yrs .
(4) To make arrangement for me to come over to your
country to further my Education and to secure a
residential permit in your country.
Moreover, I am willing to offer you 15% of the total
sum as compensation for your effort /input after the
successful transfer of this fund to your nominated
account.
Furthermore, you can indicate your option towards
assisting me as I believe that this transaction
would be concluded within 14days,from the day you
signify interest to assist me.
Awaiting to hear from you soonest.
Please reach me through the E-mail address above,
to enable us discuss the
modanities.
Thanks and God bless you as you for your anticipated
coperation.
THE IS
MY EMAIL
Best Regards,
EMMANUEL JEFF
Do you Yahoo!?
Yahoo! Search presents - Jib Jab's 'Second Term'


Player 1
Sam Pachnev
Player 2
Julia Verma
Match name
Delta Open Round II
Date
December 11, 2017
Sets follow regular tennis scoring rules.
Turn advantages on or off.
Turn tiebreaks at 6-all on or off.
Decide the style of the last set.
Sudden death
Tiebreak
Super tiebreak
Win-by-2 games
Decide the number of games played per set.
2
3
4
5
6
7
8
Pick which stats to track, in addition to scorekeeping.
For each point, you'll be asked:


Using the numactl Utility to Control Resource Utilization with the DeepSparse Engine¶
The DeepSparse Engine works best when run on a single socket and with hyper-threading disabled. One standard way of controlling compute/memory resources when running processes is to use the numactl utility. numactl can be used when multiple processes need to run on the same hardware but require their own CPU/memory resources to run optimally.
To run the DeepSparse Engine on a single socket (N) of a multi-socket system, you would start the DeepSparse Engine using numactl. For example:
numactl --cpunodebind N <deepsparseengine-process>
It is advised to also allocate memory from the same socket on which the engine is running. So, --membind
or --preferred
should be used when using --cpunodebind.
For example:
numactl --cpunodebind N --preferred N <deepsparseengine-process>
or
numactl --cpunodebind N --membind N <deepsparseengine-process>
The difference between --membind
and --preferred
is that --preferred
allows memory from other sockets to be allocated if the current socket is out of memory. --membind
does not allow memory to be allocated outside the specified socket.
For more fine-grained control, numactl can be used to bind the process running the DeepSparse Engine to a set of specific CPUs using --physcpubind
. CPUs are numbered from 0-N, where N is the maximum number of logical cores available on the system. On systems with hyper-threading (or SMT), there may be more than one logical thread per physical CPU. Usually, the logical CPUs/threads are numbered after all the physical CPUs/threads. For example, in a system with two threads per CPU and N physical CPUs, the threads for a particular CPU (K) will be K and K+N for all 0<=K<N. The DeepSparse Engine currently works best with hyper-threading/SMT disabled, so only one set of threads should be selected using numactl, i.e., 0 through (N-1) or N through (N-1).
Similarly, for a multi-socket system with N sockets and C physical CPUs per socket, the CPUs located on a single socket will range from K*C to ((K+1)C)-1 where 0<=K<N. For multi-socket, multi-thread systems, the logical threads are separated by NC. For example, for a two socket, two thread per CPU system with 8 cores per CPU, the logical threads for socket 0 would be numbered 0-7 and 16-23, and the threads for socket 1 would be numbered 8-15 and 24-31.
Given the architecture above, to run the DeepSparse Engine on the first four CPUs on the second socket, you would use the following:
numactl --physcpubind 8-11 --preferred 1 <deepsparseengine-process>
Note that --preferred 1
is needed here since the DeepSparse Engine is being bound to CPUs on the second socket.
DeepSparse Engine and Thread Pinning¶
When using numactl to specify which CPUs/sockets the engine is allowed to run on, there is no restriction as to which CPU a particular computation thread is executed on. A single thread of computation may run on one or more CPUs during the course of execution. This is desirable if the system is being shared between multiple processes so that idle CPU threads are not prevented from doing other work.
However, the engine works best when threads are pinned (i.e., not allowed to migrate from one CPU to another). Thread pinning can be enabled using the NM_BIND_THREADS_TO_CORES
environment variable. For example:
NM_BIND_THREADS_TO_CORES=1 <deepsparseengine-process>
or
export NM_BIND_THREADS_TO_CORES=1 <deepsparseengine-process>
NM_BIND_THREADS_TO_CORES
should be used with care since it forces the DeepSparse Engine to run on only the threads it has been allocated at startup. If any other process ends up running on the same threads, it could result in a major degradation of performance.
When using server mode with multiple engines, it is advisable to keep thread pinning disabled.
Note: The threads-to-cores mappings described above are specific to Intel only. AMD has a different mapping. For AMD, all the threads for a single core are consecutive, i.e., if each core has two threads and there are N cores, the threads for a particular core K are 2K and 2K+1. The mapping of cores to sockets is also straightforward, for a N socket system with C cores per socket, the cores for a particular socket S are numbered S*C to ((S+1)*C)-1.
Additional Notes¶
numactl --hardware
Displays the inventory of available sockets/CPUs on a system.
numactl --show
Displays the resources available to the current process.
For further details about these and other parameters, see the man page on numactl:
man numactl


Probable leave / remain voting percentages by constituency in the EU Referendum 2016.
With thanks to Chris Hanretty for the data. More info here
“Areal interpolation and the UK’s referendum on EU membership”, Chris Hanretty, Journal Of Elections, Public Opinion And Parties, Online Early Access, Link


Attended primary school at Doonholm Catholic Primary School.
Sat for my Kenya Certificate of Secondary Education at Lukenya High School.
A first year student at Jomo Kenyatta University of Agriculture and Technology, pursuing Bachelor of Science in Information Technology.
I developed interest in Software Developent after a C language unit in campus. It was like learning a new language to communicate, but this time not human to human but human to machine. So far the journey at Moringa School, though tough, is exciting and fulfiling. I look forward to becoming a Full-Stack Software Development GURU!


#!/usr/local/bin/perl use strict; use warnings; use FCGI; my $count = 0; my $handling_request = 0; my $exit_requested = 0; my $request = FCGI::Request(); sub sig_handler { $exit_requested = 1; exit(0) if !$handling_request; } $SIG{USR1} = \&sig_handler; $SIG{TERM} = \&sig_handler; $SIG{PIPE} = 'IGNORE'; while ($handling_request = ($request->Accept() >= 0)) { &do_request; $handling_request = 0; last if $exit_requested; } $request->Finish(); exit(0); sub do_request() { print("Content-type: text/html\r\n\r\n", ++$count); $request->Finish(); }
Here's an example that handles SIGPIPE in order to abort the request as quickly as possible:
#!/usr/local/bin/perl use strict; use warnings; use FCGI; my $count = 0; my $handling_request = 0; my $exit_requested = 0; my $request = FCGI::Request(); sub sig_handler { $exit_requested = 1; exit(0) if !$handling_request; } $SIG{USR1} = \&sig_handler; $SIG{TERM} = \&sig_handler; $SIG{PIPE} = sub {die 'SIGPIPE\n';}; while ($handling_request = ($request->Accept() >= 0)) { eval {&abort_request;} if (!eval {&do_request; 1;} && $@ ne 'SIGPIPE\n'); $handling_request = 0; last if $exit_requested; } $request->Finish(); exit(0); sub do_request() { print("Content-type: text/html\r\n\r\n", ++$count); $request->Finish(); } sub abort_request() { $exit_requested = 1; # assume the error isn't recoverable print STDERR "fatal error, request aborted, shutting down: $@\n"; $request->Finish(); }How do I use fork or exec ?
When a request handle object is destroyed that has accepted a connection without finishing it, the connection will automatically be finished. Usually, this is what you want, although it is preferable to explicitly call the Finish() method. When you fork, however, without calling exec as well, i.e. when you have two instance of perl running, the request handle object will (eventually) be destroyed in both instances of perl. As a result, a possible request being handled will be finished when the object is destroyed for the first time. This is probably not what you expect, since you will usually only be handling the request in either the parent or the child. To inhibit this unwanted request finishing, you can send the Detach() message to the request handle object. In a detached state, destruction will not lead to any finishing of requests. It is advised you call Detach() before forking and Attach afterwards (in the process that will continue handling the request).
Before doing this though, please think about whether or not you really need to fork inside the accept loop. Since the FastCGI paradigm is different from the normal CGI one, you'll find that there are situations where you would fork in a CGI context, whereas it may not be necessary in a FastCGI context. In other cases, you're better off doing the forking before the accept loop.
Conversely, when you call exec without forking, the object will not be destroyed and no connection will automatically be finished, so in that case you are forced to do it yourself.
#!/usr/bin/perl use strict; use warnings; use FCGI; my $request = FCGI::Request(); while ($request->Accept() >= 0) { # do stuff with $request $request->Detach(); my $child; $child = fork; if (!defined $child) { # error handling } elsif ($child == 0) { # do child stuff } $request->Attach(); # continue processing request $request->Finish(); }How can I get my application to reload when a new version is available? Mod_perl has Apache::Reload, and Apache::StatINC. Is there a similar mechanism for FastCGI? Assuming the application will automatically be restarted by mod_fastcgi (or another process manager), putting something like this at the end of your request loop should do it.
while ( $request->Accept() >= 0) { # handle request request->Finish(); exit if -M $ENV{SCRIPT_FILENAME} < 0; # Autorestart }


Firstly I regard myself as something of a (hateful cliche) free spirit. I practise Yoga every day and meditate at least three times a week. I believe this prepared me well for the LSD experience. This report is on what is probably about my 20th trip in about two years. I'll skip the usual 'Is anything happening?', rumours, myths and political innuendo here.
About 2 hours into the trip (which I ingested at about 1500 that afternoon) I did my usual Yoga routine. (at this stage I was at about level 2 of 5 of the Psychedelic experience). I found breathing/movement coordination to be improved and my awareness of energy flowing through the body heightened. On the negative side, my balance was slightly impaired, though not significantly so.
Following that I meditated for about a half hour. Initially it was difficult to calm my mind with the myriad of low pH flavoured thoughts but once I reached The State my meditation brought me through full course to a very interesting place. By allowing my attention to centre on my Brow Chakra (Third Eye) and allow that consciousness to expand outward to infinity after Hara Consciousness was attained I was able to fully remove my self from the ego and all games. I recommend the online paper
'Psychedelic Yoga'.
At around 7 I met with my girlfriend, and (personal details omitted). My experience of sex that night was one of heightened awareness of my partner resulting in a very intense experience (word to the wise-NEVER attempt to see a significant other without making them aware of your altered state. This will save your relationship. Think about it). Now. My trip reached its highest point at about 1030pm. 6hours in odd. The report below occurred with closed eyes lying down on my bed. I was not asleep. Here is my description:
I'm standing in a dark field witha loomin g building to my left. The building is dark with a single light atop the building. I'm wearing a tattered tailcoat with long monk-robe like sleeves. ahead is a throne which I can barely make out.  I walk toward her.
As I start walking I become aware of a huge funeral procession behind me. playing a mournful dirge in a sombre cacophany. They are also proceeding to the throne. When I approach the nun on her right hand side I see she is crying. She begins to scream as she waves a gold medalion back and forth. The crowd behind me appraches me slowly as though swimming in the air. The nun begins to cry. Tears of blood streaming from each eye and the crowd begins to attack each other. They bite, tear and fight. tearing pieces of flesh from young and old alike.
I fall and cloe my eyes. When I open them I am at the foot of a staircase covered in writing I cannot read. I climb the stairs and look over the balcony they end in. There is a group of masked actors performing silently below me. I open my eyes to the swimming luxuriant silence of my real-world awareness.
This was a pretty intense trip, but I would say an overall positive experience.
Peace and Light.
LiquidSky.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


JavaJam Gear
JavaJam gear not only looks good, it's good to your wallet too.

JavaJam shirts are comforable to war to school and around town. 100 cotton.


Fill in the form to calculate staggered starting times for GTA races (based on testing done by Broughy1322).


texi2dvi - convert Texinfo documents to DVI or PDF
texi2dvi [OPTION]... FILE...
texi2pdf [OPTION]... FILE...
pdftexi2dvi [OPTION]... FILE...
Run each Texinfo or (La)TeX FILE through TeX in turn until all cross-references
are resolved, building all indices. The directory containing each FILE is
searched for included files. The suffix of FILE is used to determine its
language ((La)TeX or Texinfo). To process (e)plain TeX files, set the
environment variable LATEX=tex.
When invoked as `texi2pdf' or given the option --pdf
generate PDF output. Otherwise, generate DVI.
- -D, --debug
- turn on shell debugging (set -x)
- -h, --help
- display this help and exit successfully
- -o, --output=OFILE
- leave output in OFILE; only one input FILE is allowed
- -q, --quiet
- no output unless errors
- -v, --version
- display version information and exit successfully
- -V, --verbose
- report on what is done
- --max-iterations=N
- don't process files more than N times [7]
- --mostly-clean
- remove auxiliary files or directories from previous runs (but not the
output)
- --dvi
- output a DVI file [default]
- --dvipdf
- output a PDF file via DVI (using a dvi-to-pdf program)
- --html
- output an HTML file from LaTeX, using HeVeA
- --info
- output an Info file from LaTeX, using HeVeA
- -p, --pdf
- use pdftex or pdflatex for processing
- --ps
- output a PostScript file via DVI (using dvips)
- --text
- output a plain text file from LaTeX, using HeVeA
- -E, --expand
- macro expansion using makeinfo
- -I DIR
- search DIR for Texinfo files
- -l, --language=LANG
- specify LANG for FILE, either latex or texinfo
- --no-line-error
- do not pass --file-line-error to TeX
- --shell-escape
- pass --shell-escape to TeX
- --src-specials
- pass --src-specials to TeX
- --translate-file=FILE
- use given charset translation file for TeX
- -t, --command=CMD
- insert CMD in copy of input file
- --build=MODE
- specify the treatment of auxiliary files [local]
- --tidy
- same as --build=tidy
- -c, --clean
- same as --build=clean
- --build-dir=DIR
- specify where the tidy compilation is performed; implies --tidy;
defaults to TEXI2DVI_BUILD_DIRECTORY [.]
The MODE specifies where the TeX compilation takes place, and, as
a consequence, how auxiliary files are treated. The build mode can also be
set using the environment variable TEXI2DVI_BUILD_MODE.
- `local'
- compile in the current directory, leaving all the auxiliary files around.
This is the traditional TeX use.
- `tidy'
- compile in a local *.t2d directory, where the auxiliary files are left.
Output files are copied back to the original file.
- `clean'
- same as `tidy', but remove the auxiliary directory afterwards. Every
compilation therefore requires the full cycle.
The values of these environment variables are used to run the
corresponding commands, if they are set:
- BIBER BIBTEX DVIPDF DVIPS EGREP HEVEA LATEX MAKEINDEX MAKEINFO PDFLATEX
PDFTEX SED T4HT TEX TEX4HT TEXINDEX TEXINDY THUMBPDF_CMD
Regarding --dvipdf, if DVIPDF is not set in the
environment, the following programs are looked for (in this order): dvipdfmx
dvipdfm dvipdf dvi2pdf dvitopdf.
If Texinfo is installed on your site, then the command
- info texi2dvi
should give you access to more documentation.
Report bugs to<EMAIL_ADDRESS>general questions and discussion to
<EMAIL_ADDRESS>GNU Texinfo home page: <http://www.gnu.org/software/texinfo/>
General help using GNU software: <http://www.gnu.org/gethelp/>
Copyright © 2019 Free Software Foundation, Inc. License GPLv3+: GNU GPL
version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it. There is NO
WARRANTY, to the extent permitted by law.
The full documentation for texi2dvi is maintained as a Texinfo manual. If
the info and texi2dvi programs are properly installed at your
site, the command
- info texi2dvi
should give you access to the complete manual.


Earthquake Update
Home
Links
Markers represent recent earthquakes. Click marker to learn more about the earthquake at that location.
+ Show Filters
Filter Quakes by Magnitude:
Filter Quakes by Location:
Using an Address
Using Coordinates
Please enter both a valid location and search radius.
How many earthquakes happened in the last three weeks where you live?
Enter location find out:
Reset


U.S. forecaster sees 70% chance for neutral weather during winter
(Reuters) - There is about a 70% chance that neutral weather conditions will prevail in the Northern Hemisphere this winter, a U.S. government weather forecaster said on Thursday.
The El Niño-Southern Oscillation-neutral (ENSO) weather pattern is marked by average long-term ocean temperatures, tropical rainfall and atmospheric winds.
The chances of the weather pattern continuing through spring 2020 is at 60% to 65%, the National Weather Service’s Climate Prediction Center (CPC) said in its monthly forecast.
ENSO-neutral conditions refer to those periods in which neither El Niño nor La Niña are present, often coinciding with the transition between the two weather patterns, according to the CPC.
“Forecasters believe this recent warmth reflects sub-seasonal variability and is not indicative of an evolution toward El Niño. (However,) the chances for El Niño are predicted to be near 25% during the winter and spring,” CPC said.
El Niño emerged in 2018 for the first time since 2016, and persisted until August 2019. The weather pattern has been linked to crop damage, fires and flash floods.
It is a climate phenomenon linked to a periodic warming in sea-surface temperatures across the central and east-central equatorial Pacific and is the opposite of La Niña, characterized by unusually cold temperatures in the region, according to CPC website.


Blaue Elfe by
frau poncho illustration
Brain Appetite by
frau poncho illustration
Lady at Night by
frau poncho illustration
Lazy Evening by
frau poncho illustration
Lila Elfe by
frau poncho illustration
Magic by
frau poncho illustration
Mysterious by
frau poncho illustration
Nighthawks by
frau poncho illustration


{% extends 'base.html' %} {% load static %} {% block title %} Economy | {{ block.super }} {% endblock %} <{% block content %}
This page shows your personal {{ camp.title }} economy overview. You can use the buttons to see the Expenses and Revenues you've registered in the system. You can also see any reimbursements you might have. If you registered an expense and you are waiting for a reimbursement please ask someone in the Economy Team to make a reimbursement.
| What | Description | Actions |
|---|---|---|
Expenses |
You have {{ expense_count }} expense{{ expense_count|pluralize }} ({{ approved_expense_count }} approved, {{ rejected_expense_count }} rejected, and {{ unapproved_expense_count }} pending approval) for {{ camp.title }}, for a total of {{ expense_total|default:"0" }} DKK. | List Expenses Create Expense |
Reimbursements |
You have {{ reimbursement_count }} reimbursement{{ reimbursement_count|pluralize }} ({{ paid_reimbursement_count }} paid, {{ unpaid_reimbursement_count }} pending payment) for {{ camp.title }}, for a total of {{ reimbursement_total }} DKK. | List Reimbursements |
Revenue |
You have {{ revenue_count }} revenue{{ revenue_count|pluralize }} ({{ approved_revenue_count }} approved, {{ rejected_revenue_count }} rejected, and {{ unapproved_revenue_count }} still pending approval) for {{ camp.title }}, for a total of {{ revenue_total|default:"0" }} DKK. | List Revenues Create Revenue |


https://dirkjanm.io/krbrelayx-unconstrained-delegation-abuse-toolkit/
Technical details - Unconstrained delegation flow and krbrelayx
Let’s have a look at how a Windows 10 client uses Kerberos with unconstrained delegation. Some write-ups mention that whenever the Windows 10 client requests a service ticket to a host with unconstrained delegation, this ticket automatically includes a delegated version of a TGT. This is not how it actually works. Let’s look at what happens over the wire when a host authenticates to our attacker service.
When our user (testuser) logs in on the workstation, a TGT is requested from the DC (the KDC in this case). This is visible via two AS-REQs, the initial one which requests the TGT without any kind of information, and a second one in which preauthentication information is included.
In the reply to the first AS-REQ, we see that the server replies with the correct salt that should be used in case of AES key deriviation from the password:
Now we make the client connect to our malicious SMB server hosted using krbrelayx. In the traffic we see two requests for a service ticket (TGS-REQ), and after some SMB traffic in which the Kerberos authentication is performed.
Let’s take a closer look at these TGS requests. The first one is as expected, a service ticket is requested for the cifs/attacker.internal.corp SPN which we added to our account previously.
The second one however is interesting. This time the server requests a service ticket not for the service it is connecting to, but for the krbtgt/internal.corp SPN. This is similar to an AS-REQ request, in which this SPN is also used, but now it’s used in a TGS-REQ structure using the TGT with an authenticator. The second interesting part are the flags, especially the forwarded flag. This flag is used to request a TGT which can be used for delegation and will later be sent to the attacker’s rogue service.
How does Windows know whether it should request a forwarded TGT and send this to a server when authenticating? The encrypted ticket part has a ‘flags’ field, in which the ticket options are specified. RFC4120 defines an OK-AS-DELEGATE flag, which specifies that the target server is trusted for unconstrained delegation. Some changes made to getST.py from impacket show us that this flag is indeed set, it is easier however to just list the tickets in Windows with klist:
This command also shows us the forwarded TGT that will be sent to the attacker:
The attackers view
From the attackers perspective, we have set up krbrelayx and it is listening on port 445 and 80 to accept SMB and HTTP connections. When the victim connects to us (for which examples to trigger this are given above), they will authenticate with Kerberos if we request this. Unlike with NTLM authentication, which requires multiple messages back and forth, a client will directly send their Kerberos ticket upon authenticating. In both SMB and HTTP the GSS-API and SPNEGO protocols are used to wrap Kerberos authentication.
Whoever designed these protocols thought it would be a great idea to not only use ASN.1, but to mix ASN.1 with some custom binary constants in one structure (and to let part of that structure depend on the constant). This makes it pretty unusable with any standard ASN.1 library. Fortunately I did find some ways to hack around this, which is already an improvement on having to write your own ASN.1 parser.
Once we reliably parsed the structure, we can see the AP_REQ message containing a Kerberos ticket and an authenticator. These are both important in Kerberos authentication:
- The ticket is encrypted with the password of “our” service. It contains information that identifies the user who is authenticating, as well as an encrypted session key. This ticket is also used for authorization, since it contains a PAC with the groups the user is a member of.
- The authenticator is an structure encrypted with the session key. It proves the client is in posession of this key and is used to authenticate the client.
When you see this in Wireshark, it is easy to notice the difference between a regular Kerberos AP_REQ packet and one where a TGT is sent along with it (unconstrained delegation). A regular AP_REQ packet will contain an encrypted ticket, which is the largest substructure in the AP_REQ structure. In the case of my test domain, the ticket is 1180 bytes. If unconstrained delegation is used, the largest substructure in the AP_REQ is the authenticator, which contains the delegated TGT from the user. In my domain this is 1832 bytes. An authenticator that doesn’t contain a TGT is usually much smaller, around 400 bytes.
Using the previously calculated Kerberos keys, we decrypt the ticket and get the following structure:
EncTicketPart:
flags=1084555264
key=EncryptionKey:
keytype=23
keyvalue=0xbd88d929fc420e8b840f3e4bcd9346b6
crealm=INTERNAL.CORP
cname=PrincipalName:
name-type=1
name-string=SequenceOf:
testuser
transited=TransitedEncoding:
tr-type=1
contents=
authtime=20190216190927Z
starttime=20190216190927Z
endtime=20190217050927Z
renew-till=20190223190927Z
authorization-data=AuthorizationData:
Sequence:
ad-type=1
ad-data=0x308202e230...e8bd0fb67130
Sequence:
ad-type=1
ad-data=0x305d303fa0...6517b0000000000
Contained within are the ticket validity, the username of the ticket, some Authorization Data (which includes the user PAC), and an Encryption key. This Encryption key is the session key, with which we can decrypt the authenticator of the AP_REQ:
Authenticator:
authenticator-vno=5
crealm=INTERNAL.CORP
cname=PrincipalName:
name-type=1
name-string=SequenceOf:
testuser
cksum=Checksum:
cksumtype=32771
checksum=0x100000000...a3997
cusec=84
ctime=20190216192428Z
subkey=EncryptionKey:
keytype=23
keyvalue=0x2b340c020be62cbd6284fd2977c5e303
seq-number=1035294623
authorization-data=AuthorizationData:
Sequence:
ad-type=1
ad-data=0x3081...005000
Here we see again the user that authenticated, another encryption key (subkey), more authorization data, and a checksum (which I’ve cut short). The checksum is the interesting part. If it’s value is equal to 32771 (or 0x8003) it means that it is a KRBv5 checksum, which is a special structure defined in RFC4121 section 4.1.1 (apparently the authors of the RFC were also tired of ASN.1, introducing another custom format for transferring binary data).
Within this checksum field, (if the correct flags are set), we can find a KRB_CRED structure (back to ASN.1!) which contains the delegated TGT.
KRB_CRED:
pvno=5
msg-type=22
tickets=SequenceOf:
Ticket:
tkt-vno=5
realm=INTERNAL.CORP
sname=PrincipalName:
name-type=2
name-string=SequenceOf:
krbtgt INTERNAL.CORP
enc-part=EncryptedData:
etype=18
kvno=2
cipher=0xe70d38ec...c2ec0e
enc-part=EncryptedData:
etype=23
cipher=0xdea2c107a...850ba2a285
There is one more step separating us from obtaining our TGT, which is decrypting the enc-part. This encrypted part of the KRB_CRED structure contains the ticket information, including the session key associated with the delegated TGT, which we need to request service tickets at the DC. After decryption, the tickets are saved to disk, either in ccache format, which is used by impacket, or in kirbi format (which is the name used by Mimikatz for KRB_CRED structured files). The delegated TGT can now be used by other tools to authenticate to any system in the domain.
If this wasn’t detailled enough for you yet, all the steps described in this section are outlined in the kerberos.py file of krbrelayx. If you uncomment the print statements at various stages you can view the full structures.


Drawing a graph with the d3.js external library
A force-directed draggable graph using circles as nodes, with accompanying text labels.


Gallery
I like to take photos. Sometimes.
2020
Photos from the year many wish the had already forgotten.
F0
2019
Photos from the year many wish the had already forgotten.
2018
When not mutch happened.
I like to take photos. Sometimes.
Photos from the year many wish the had already forgotten.
Photos from the year many wish the had already forgotten.
When not mutch happened.


To log in to the Scania Sample site, please chose site mode below. In this demo, username and password are optional.
The online reset password functionality is only available for SAIL/XDS accounts. If you are an employee or internal consultant using a Global (Scania Corporate) account, please contact Scania service desk or access user self service to reset your password.
To reset or change yor XDS password please use the Password Self Service. The XDS account was formerly known as the SAIL account.
Scania © 2015 | Scania.Com
When you view this site, or any other site linked from this site, we may store some information on your computer in the form of a “cookie”, which allows us to tailor our website/s to better match your interests and preferences.
A cookie is a small text file which the site you are visiting saves on your computer. Cookies are used by many web sites to give visitors access to various functions. The information contained in the cookie can be used to monitor a user’s surfing behaviour.
There are two types of cookies. The first saves a file for an extended period on your computer and is used, for example, with functions which describe what information is new since you last visited the particular site. The second type is known as a ’session cookie’. This is stored temporarily in your computer’s memory while your are visiting the site and surfing a page, and is used, for example, to determine what language you have chosen. Session cookies are not stored in your computer for an extended period, but are deleted when you close your browser.
Among other things, Scania uses cookies to record visitor statistics and to enable the user to select a language option when searching for a second-hand vehicle on our site.
You can set your computer to block cookies. However, this means that we cannot guarantee that all areas of our web site will function as intended. The procedure for blocking cookies will depend on what browser you are using. Access ’Help’ or the appropriate menu in your browser for instructions.
Scania may at any time revise this information by updating it.
Besides logging into Scania using our XDS and Global accounts, some markets have the ability to log in using their local credentials, thus enabling single sign-on.


new Body(settings)
View file: https://github.com/GorillaBus/DDW/blob/master/src/class/Body.js.
A Body object is the logical representation of a physical entity in DDW. It has physical proerties like mass, size, a position in the world, it can interact with other Body objects and forces. In DDW the shape of an Body is represented by a (or a set of) polygon(s), described by a set of points in a Model class object.
A body has a location and velocity vector that describe its position in the world and movement in terms of speed and direction, and an angle and angle velocity properties, representing its current angle position and rotation speed.
A body has a location and velocity vector that describe its position in the world and movement in terms of speed and direction, and an angle and angle velocity properties, representing its current angle position and rotation speed.
Parameters:
| Name | Type | Description | |||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
settings |
Object | Json object with construction options
Properties
|
Methods
applyForce()
Applies a force to the entity, expressed as a Vector class object. The magnitude of the force is divided by the Body's mass.
applyNetForce()
Applies a force to the entity, expressed as a Vector class object. This magnitude of the force will not be divided by the _Body's_ mass.
distanceTo() → {Model}
Calculates the distance from one Body object to another, from surface to surface.
Returns:
- The new transformed Model class object.
- Type
- Model
getAngle() → {float}
Returns the current rotation angle of the Body.
Returns:
- Angle in radians.
- Type
- float
getBoundingRect() → {Array}
Returns Body's bounding recangle, which is defined as four points polygonal shape that bounds the total of the points that compose the Body's model. Can be used to verify the geometrical intersection between a Body and other entities.
Returns:
- An array of four coordinate points (as sub-arrays with X [0] and Y [1] values).
- Type
- Array
getHeading() → {float}
Returns the current velocity direction of the _Body, expressed as an angle in radians.
Returns:
- Angle in radians.
- Type
- float
getLocation() → {float}
Returns the current location vector of the Body.
Returns:
- Speed.
- Type
- float
getRadius() → {float}
Returns the radius of the circle that bounds the entity (can sometimes be interpreted as width).
Returns:
- Radius.
- Type
- float
getScale() → {float}
Returns the current scale of the Body.
Returns:
- Scale.
- Type
- float
getSpeed() → {float}
Returns the current movement speed of the _Body.
Returns:
- Speed.
- Type
- float
getWorldTransform() → {Model}
Performs a world-transformation on the Body's model. This method is executed on each time step to reflect the entity's geometrical representation in the world.
Returns:
- The new transformed Model class object.
- Type
- Model
resetVelocity()
Resets the velocity magnitude (speed) to zero.
setHeading(angle) → {float}
Changes the Body's current movement direction angle.
Parameters:
| Name | Type | Description |
|---|---|---|
angle |
Float | An angle in radians. |
Returns:
- Angle in radians.
- Type
- float
setPosition(position)
Set a new position for the entity.
Parameters:
| Name | Type | Description |
|---|---|---|
position |
Vector | The desired position expressed as a Vector class object. |
setSpeed(speed) → {float}
Change the Body's current movement speed.
Parameters:
| Name | Type | Description |
|---|---|---|
speed |
Float | The desired speed. |
Returns:
- Angle in radians.
- Type
- float
update()
Updates the state of Body's object in the world: its position, velocity, angle and rotating speed. It also updates the world-transformation of the model that represents the entity.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/unicode.20fonts.20for.20VS.20code.20on.20macOS.html ---
Does anyone have any recommendations for macOS fonts that include all the unicode symbols in mathlib? On Windows the default fonts seem good so far but there are some missing symbols on macOS like ₘ
.
I'm also interested in font recomendations . On my mac \I
and i
look exactly the same which lead to some head scratching.
Maybe you need OS recommendations :stuck_out_tongue_wink:
Have you tried the 𝔘𝔫𝔦𝔠𝔬𝔡𝔢 𝔣𝔬𝔫𝔱 𝔰𝔲𝔤𝔤𝔢𝔰𝔱𝔦𝔬𝔫𝔰 for Linux? From what I hear, these fonts run on macOS as well.
Fonts with good unicode support (on Linux): "editor.fontFamily": "Source Code Pro Medium, DejaVu Sans Mono"
Many of the monospace fonts I've tried on the Mac have a problem with ↪
: it takes more than the usual horizontal space, which leads to overlap with other characters. This includes Source Code Pro. I've been using Menlo, which has a good monospace ↪
. For some reason, I had not yet tried DejaVu Sans Mono. Now that I have, I see that it's very similar to Menlo. Both also have ₘ
.
Thanks, installing the DejaVu fonts seems to have done the trick! I think Menlo doesn't actually have the ₘ
character, since it's the default font for VS Code on macOS already (the default setting is "editor.fontFamily": "Menlo, Monaco, 'Courier New', monospace",
) and the character wasn't showing up before I installed these fonts. It seems that whenever a font is missing a glyph, the system fills it in from the other installed fonts (if it can).
Interesting. It seems you're right. I confirmed with Font Book. The Mac symbol viewer only shows the DejaVu fonts under Font Variation for ₘ
. I previously checked in iTerm2, so, yeah, somebody must be filling in ₘ
from some other font. I wonder where it's coming from.
I realise this thread is old but for the sake of anyone else who has this issue: I just hit the same problem on Mac OS (e.g., no glyph for U+2099) and the same solution worked: installing DejaVu fonts.
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


class Aquarium::Aspects::Aspect
Aspect
¶ ↑
Aspect
“advises” one or more method invocations for one or more types or objects (including class methods on types). The corresponding advice is a Proc that is invoked either before the join point, after it returns, after it raises an exception, after either event, or around the join point, meaning the advice runs and it decides when and if to invoke the advised method. (Hence, around advice can run code before and after the join point call and it can “veto” the actual join point call).
See also Aquarium::DSL
for more information.
Constants
- ASPECT_CANONICAL_OPTIONS
- CANONICAL_OPTIONS
Attributes
Public Class Methods
Aspect.new
(:around | :before | :after | :after_returning | :after_raising )
(:pointcuts => [...]), :named_pointcuts => [...] | ((:types => [...] | :types_and_ancestors => [...] | :types_and_descendents => [...] | :types_and_nested_types | :objects => [...]), :methods => [], :method_options => [...], :attributes => [...], :attribute_options[...]), (:advice = advice | do |join_point, obj, *args| ...; end)
where the parameters often have many synonyms (mostly to support a “humane interface”) and they are interpreted as followed:
Type of Advice
¶ ↑
:around
-
Invoke the specified advice “around” the join points. It is up to the advice itself to call
join_point.proceed
(wherejoin_point
is the first option passed to the advice) if it wants the advised method to actually execute. :before
-
Invoke the specified advice before the join point.
:after
-
Invoke the specified advice after the join point either returns successfully or raises an exception.
:after_returning
-
Invoke the specified advice after the join point returns successfully.
:after_raising [=> exception || [exception_list]]
-
Invoke the specified advice after the join point raises one of the specified exceptions. If no exceptions are specified, the advice is invoked after any exception is raised. An alternative syntax is
:after_raising, :exception[s] => (exception || [exception_list])
.
Advice
¶ ↑
The advice to invoke before, after, or around the join points. Only one advice may be specified. If a block is specified, the following options are ignored.
-
:advice => proc
-
:action => proc
-
:do_action => proc
-
:use_advice => proc
-
:advise_with => proc
-
:invoke => proc
-
:call => proc
Pointcuts¶ ↑
A Pointcut
, JoinPoint
, or array of the same (Mixed is allowed.). Specifying pointcuts is mutually-exclusive with specifying them “indirectly” through :types, :objects, :methods, :attributes, :method_options, and :attribute_options parameters.
-
:pointcuts => pointcut || [pointcut_list]
-
:pointcut => pointcut || [pointcut_list]
-
:on_pointcut => pointcut || [pointcut_list]
-
:on_pointcuts => pointcut || [pointcut_list]
-
:in_pointcut => pointcut || [pointcut_list]
-
:in_pointcuts => pointcut || [pointcut_list]
-
:within_pointcut => pointcut || [pointcut_list]
-
:within_pointcuts => pointcut || [pointcut_list]
Named Pointcuts¶ ↑
Specify search criteria to locate Pointcuts defined as class constants and/or class variables. The options for the named_pointcuts
parameter must form a hash and satisfy the requirements documented for Aquarium::Finders::PointcutFinder#find
. Specifying named pointcuts is also mutually-exclusive with specifying Pointcuts “indirectly” through :types, :objects, :methods, :attributes, :method_options, and :attribute_options parameters.
-
:named_pointcuts => {PointcutFinder options}
-
:named_pointcut => {PointcutFinder options}
-
:on_named_pointcuts => {PointcutFinder options}
-
:on_named_pointcut => {PointcutFinder options}
-
:in_named_pointcuts => {PointcutFinder options}
-
:in_named_pointcut => {PointcutFinder options}
-
:within_named_pointcuts => {PointcutFinder options}
-
:within_named_pointcut => {PointcutFinder options}
Exclude Pointcuts¶ ↑
Exclude the specified pointcuts. The exclude_
prefix can be used with any of the :pointcuts
and :named_pointcuts
synonyms.
-
:exclude_pointcuts => pointcut || [pointcut_list]
-
:exclude_named_pointcuts => {PointcutFinder options}
Miscellaneous Options¶ ↑
:ignore_no_matching_join_points => true | false
-
Do not issue a warning if no join points are actually matched by the aspect. By default, the value is false, meaning that a WARN-level message will be written to the log. It is usually very helpful to be warned when no matches occurred, for debugging purposes! A synonym for this option is
ignore_no_jps => true | false
.
For other options e.g., :types
, :methods
, Aspect#new accepts all the options that Pointcut#new accepts. It also accepts the “universal” options documented in Aquarium::Utils::OptionsUtils
.
# File lib/aquarium/aspects/aspect.rb 138 def initialize *options, &block 139 @first_option_that_was_method = [] 140 opts = rationalize options 141 init_specification opts, CANONICAL_OPTIONS, (Pointcut::ATTRIBUTE_OPTIONS_VALUES + KINDS_IN_PRIORITY_ORDER) do 142 finish_specification_initialization &block 143 end 144 init_pointcuts 145 validate_specification 146 return if noop 147 advise_join_points 148 end
Public Instance Methods
We have to ignore advice in the comparison. As recently discussed in ruby-users, there are very few situations. where Proc#eql? returns true.
# File lib/aquarium/aspects/aspect.rb 177 def eql? other 178 self.object_id == other.object_id || 179 (self.class.eql?(other.class) && specification == other.specification && pointcuts == other.pointcuts) 180 end
# File lib/aquarium/aspects/aspect.rb 169 def inspect 170 "Aspect: {specification: #{specification.inspect}, pointcuts: #{pointcuts.inspect}, advice: #{advice.inspect}}" 171 end
# File lib/aquarium/aspects/aspect.rb 150 def join_points_matched 151 get_jps :join_points_matched 152 end
# File lib/aquarium/aspects/aspect.rb 154 def join_points_not_matched 155 get_jps :join_points_not_matched 156 end
# File lib/aquarium/aspects/aspect.rb 158 def unadvise 159 return if noop 160 @pointcuts.each do |pointcut| 161 interesting_join_points(pointcut).each do |join_point| 162 remove_advice_for_aspect_at join_point 163 end 164 end 165 end


{% extends "base.html" %} {% load brackets_tags %} {% load staticfiles %} {% block title %}Your Brackets{% endblock %} {% block brackets-nav %}class="active"{% endblock %} {% block css %} {% endblock %} {% block content %}
A bracket is how you make your predictions for the World Cup. You won't be able to compete in a group until you have made some predictions. You can make changes to your brackets listed below by clicking them and changing what you want.


Thanks for buying our book. We hope you've enjoyed it and found it helpful.
We'll continue to post updates and corrections here as we find them. If you find additional errors, please tell us about them by sending an email to<EMAIL_ADDRESS>Lynn Torkelson,
Constance Petersen,
and
Zac Torkelson
Page 145. The last description in Table 4-3 should read:
Gets or sets the width of the image displayed.
Page 158. The line just above the End Class statement should read:
[Code omitted (see \Chapter_04\ContainerControls.aspx.vb)]
Page 297. The first sentence in the last paragraph should read:
Suppose that your Web application needs to remind visitors of certain special dates such as business holidays and project due dates.
Page 311. The last sentence in the second paragraph under Validating Required Fields should read:
In the latter case, the visitor will be able to enter a different value, but an empty string will be accepted as valid.
Page 316. The first sentence should read:
By now, that last part of the expression (the part after the second ? quantifier) should be child's play.
Page 316. The next-to-last sentence in the first paragraph should read:
Note that the first ? in the expression allows a visitor the option of including a space after an area code within parentheses.
Page 389. The last description on the page should read:
Gets or sets a Boolean that determines whether or not a header (if one exists) displays at the top of the control.
Page 403. The last sentence on the page, and continued on the next page, should read:
Of course, you could use that same information to develop your own proxy class, but why reinvent the wheel?
Page 415. The third sentence in the last paragraph should read:
Certain attributes, such as those used in creating XML Web services, are predefined by the .NET Framework and control runtime behavior.
Page 460. In Figure 9-2 in the DataSet box:
Replace both instances of the word "Connection" with "Collection".
Page 539. In the fourth sentence:
Replace "chnces" with "chances".
Page 550. In the StartChapter property listing:
Replace "iValue < 12" with "iValue < 16".
Page 578. In the first sentence after point five in the numbered list:
Replace "al lready" with "already".
Page 642. The second sentence on the page should read:
The ListBox control has its SelectionMode property set to Multiple to permit multiple keywords to be associated with a code example.
Page 693. The last line on the page has a typo and should read:
look at Figures 13-22 and 13-23.
Page 808. The last sentence in the fourth paragraph should read:
Here, the color of the log_in button shows that the visitor has moved the cursor over it.


http.go | |
|---|---|
Copyright 2020 Red Hat, Inc Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. |
|
APIRequest is a request to api to use in AssertAPIRequest |
|
APIResponse is an expected api response to use in AssertAPIRequest |
|
DefaultServerConfig is a default config used by AssertAPIRequest |
|
AssertAPIRequest creates new server (which you can keep nil so it will be created automatically) and provided serverConfig(you can leave it empty to use the default one) sends api request and checks api response (see docs for APIRequest and APIResponse) |
|
TODO: it should be configurable |
|
ExecuteRequest executes http request on a testServer |
|
CheckResponseBodyJSON checks if body is the same json as in expected (ignores whitespaces, newlines, etc) also validates both expected and body to be a valid json |
|


Despite of the fact that a thread must execute in process, the process and
its associated threads are different concept. Processes are used to group
resources together and threads are the entities scheduled for execution on the
CPU.
A thread is a single sequence stream
within in a process. Because threads have some of the properties of processes,
they are sometimes called lightweight processes. In a process, threads allow
multiple executions of streams. In many respect, threads are popular way to improve
application through parallelism. The CPU switches rapidly back and forth among
the threads giving illusion that the threads are running in parallel. Like a
traditional process i.e., process with one thread, a thread can be in any of
several states (Running, Blocked, Ready or Terminated). Each thread has its own
stack. Since thread will generally call different procedures and thus a
different execution history. This is why thread needs its own stack. An operating system that has thread facility,
the basic unit of CPU utilization is a thread. A thread has or consists of a program counter (PC), a register set, and
a stack space. Threads are not independent of one other like processes as a
result threads shares with other threads their code section, data section, OS
resources also known as task, such as open files and signals.
As we mentioned earlier that in many respect threads operate in the same way as that of processes. Some of the similarities and differences are:
Similarities
Differences
Following are some reasons why we use threads in designing operating systems.
Threads are cheap in the sense that
But this cheapness does not come free - the biggest drawback is that there is no protection between threads.
User-level threads implement in user-level libraries, rather than via systems calls, so thread switching does not need to call operating system and to cause interrupt to the kernel. In fact, the kernel knows nothing about user-level threads and manages them as if they were single-threaded processes.
Advantages:
The most obvious advantage of this technique is that a user-level threads package can be implemented on an Operating System that does not support threads. Some other advantages are
Disadvantages:
In this method, the kernel knows about and manages the threads. No runtime
system is needed in this case. Instead of thread table in each process, the
kernel has a thread table that keeps track of all threads in the system. In
addition, the kernel also maintains the traditional process table to keep track
of processes. Operating Systems kernel provides system call to create and manage threads.
The implementation of general structure of kernel-level thread is
<DIAGRAM>
Advantages:
Disadvantages:
A proxy server satisfying the requests for a number of computers on a LAN would be benefited by a multi-threaded process. In general, any program that has to do more than one task at a time could benefit from multitasking. For example, a program that reads input, process it, and outputs could have three threads, one for each task.
Any sequential process that cannot be divided into parallel task will not benefit from thread, as they would block until the previous one completes. For example, a program that displays the time of the day would not benefit from multiple threads.
When a new thread is created it shares its code section, data section and operating system resources like open files with other threads. But it is allocated its own stack, register set and a program counter.
The creation of a new process differs from that of a thread mainly in the fact that all the shared resources of a thread are needed explicitly for each process. So though two processes may be running the same piece of code they need to have their own copy of the code in the main memory to be able to run. Two processes also do not share other resources with each other. This makes the creation of a new process very costly compared to that of a new thread.
To give each process on a multiprogrammed machine a fair share of the CPU, a hardware clock generates interrupts periodically. This allows the operating system to schedule all processes in main memory (using scheduling algorithm) to run on the CPU at equal intervals. Each time a clock interrupt occurs, the interrupt handler checks how much time the current running process has used. If it has used up its entire time slice, then the CPU scheduling algorithm (in kernel) picks a different process to run. Each switch of the CPU from one process to another is called a context switch.
In a multiprogrammed uniprocessor computing system, context switches occur frequently enough that all processes appear to be running concurrently. If a process has more than one thread, the Operating System can use the context switching technique to schedule the threads so they appear to execute in parallel. This is the case if threads are implemented at the kernel level. Threads can also be implemented entirely at the user level in run-time libraries. Since in this case no thread scheduling is provided by the Operating System, it is the responsibility of the programmer to yield the CPU frequently enough in each thread so all threads in the process can make progress.
The threads share a lot of resources with other peer threads belonging to the same process. So a context switch among threads for the same process is easy. It involves switch of register set, the program counter and the stack. It is relatively easy for the kernel to accomplished this task.
Context switches among processes are expensive. Before a process can be switched its process control block (PCB) must be saved by the operating system. The PCB consists of the following information:
When the PCB of the currently executing process is saved the operating system
loads the PCB of the next process that has to be run on CPU. This is a heavy
task and it takes a lot of time.


This is a paragraph.
This is another paragraph.
And yet another.
This is a paragraph in Section 2.
This is another paragraph in that section.
Believe it or not, another paragraph.


The challenge of the Citython is to propose management and intervention strategies for the most visited touristic spaces in Barcelona. These spaces are often overcrowded, due to the opportunities and facilities they offer: mobility nodes, tourism, leisure and commercial activities and many different events. Because of the touristic use and the overcrowding at these spaces, specific tools of management are needed which would guarantee a normal life to the locals. Tourism needs to be integrated as a transversal element to urban planning.
Are you a master's degree or posgraduate student in Telecommunications, Data Science. Urban Planning, Architecture, Sociology or Cultural Management?
Try to solve Barcelona's gentrification problems by participating in Citython Barcelona 2018 and win one of the three 1,500 euros prizes (Premi Barcelona, Premi Bit Habitat and Premi Cisco)!
The results will be open to the public and the winners will present their solution on the Barcelona City Council stand during the Smart City Expo.
What is a hackathon?
A hackathon is a sprint-like event in which small groups of young professionals search for innovative and creative solutions for everyday problems. The result can be a program, a prototype, a test model, a tool a design solution or a concept.
What is Citython Barcelona?
A 3-day hackathon that takes place in Barcelona and brings together creative and inquisitive minds to solve the gentrification problem occurring in the historic centers of Barcelona. Young professionals from the fields of urbanism and computer and data sciences will be brought together in the same place for fun and an intense session of co-creation, hacking and collaboration. The difference from a typical hackathon is that the Citython requires the analysis of data to understand a problem and reach to a conclusion.
What is a TechPill?
A TechPill is a short but definitive training/knowledge session on a certain topic (each will last around 30 minutes). The TechPills will offer you cutting-edge knowledge about Open Data, data analysis and visualization and gentrification so you can come up with the best ideas.
What do I need to bring?
Please, bring the following with you: You have to carry with you your own ID during the whole event. You do not have to worry about food. We have arranged that. You can bring any device you think you may need in order to develop your projects. (Smartphones and laptops are highly recommended.)
What are the requirements to participate?
You have to meet the following requirements: You must be at least 18 years old during the days of the event. You have to apply as an individual on our website. Registration starts 9th October, 2018 and ends 5th November, 2018. You must have either data/computer or urbanism background. If you have both, you are also welcome to join. Find out more about the specific skills required for each background on our website. For further information, read our rules and terms.
Will any help be provided to develop my project?
Sure! You will be able to attend our TechPills and receive feedback from the appointed mentors during the hack days.


package testers
- Alphabetic
- Public
- All
Type Members
-
class
AccumTester extends ApplicationTester
A tester for accumulate.
-
class
AppTestHelper extends AnyRef
A class which is helpful when creating testers.
A class which is helpful when creating testers. Since configuration controllers can repeat stored configurations every II cycles, the "throughput" indicates after how many times of such repeats, a new result can be obtained. For example, if II = 2 and throughput = 2, we can obtain a new result every 4 cycles. However, it is not recommended to use this parameter, and we suggest users to update the targeted architecture or mapping parameters.
The "outputCycle" must be exactly right when the results are verified at output ports of the top module during the activating process, while if only the data obtained from LSUs is needed to be verified, it should be large enough.
-
class
ApplicationTester extends PeekPokeTester[TopModule]
A base class of testers for applications.
A base class of testers for applications. It help users to construct the simulation processes and produce classes in the specific format of Chisel testers using the Verilator backend. We suggest users test their own CGRA architectures with this packed class.
-
class
ApplicationWrapperTester extends PeekPokeTester[TopModuleWrapper]
A base class of testers for applications when the top design has a wrapper.
A base class of testers for applications when the top design has a wrapper. It help users to construct the simulation processes and produce classes in the specific format of Chisel testers using the Verilator backend. We suggest users test their own CGRA architectures with this packed class.
-
class
CapTester extends ApplicationTester
A tester for cap.
- class DeqMemUnitTester extends PeekPokeTester[DeqMemWrapper]
- class DeqMemWrapper extends Module
- class EnqAddrDeqMemUnitTester extends PeekPokeTester[EnqAddrDeqMemWrapper]
- class EnqAddrDeqMemWrapper extends Module
- class EnqMemUnitTester extends PeekPokeTester[EnqMemWrapper]
- class EnqMemWrapper extends Module
-
class
MultiplexerUnitTester extends PeekPokeTester[Multiplexer]
A tester of a multiplexer.
- class SimpleDualPortSramUnitTester extends PeekPokeTester[SimpleDualPortSram]
- class SinglePortSramUnitTester extends PeekPokeTester[SinglePortSram]
-
class
SumTester extends ApplicationTester
A tester for sum.
A tester for sum. The post-process is not necessary since there are no store operations in the targeted DFG.
-
class
SumWrapperTester extends ApplicationWrapperTester
A tester for sum.
-
class
SynchronizerTester extends PeekPokeTester[Synchronizer]
A tester of a synchronizer with skew = 3.
-
class
TopModuleAdresUnitTest extends PeekPokeTester[TopModule]
A tester of a 2*2 TileBlock with 2 input ports and 1 output port.
A tester of a 2*2 TileBlock with 2 input ports and 1 output port. The schedules have not been taken into consideration.
-
class
TopModuleCompleteAdresUnitTest extends PeekPokeTester[TopModule]
A tester of a 4*4 TileCompleteBlock with 4 input ports and 4 output port.
-
class
TopModuleLSUAdresUnitTest extends PeekPokeTester[TopModule]
A tester of a 2*2 TileLSUBlock with 2 input ports and 1 output port.
-
class
VaddTester extends ApplicationTester
A tester for vadd.
-
class
VaddWrapperTester extends ApplicationWrapperTester
A tester for vadd.
-
class
DispatchUnitTest extends PeekPokeTester[DispatchT]
A tester of a simple dispatcher.
A tester of a simple dispatcher.
- Deprecated
-
class
LoadStoreUnitTester extends PeekPokeTester[LoadStoreUnit]
A tester of a load/store unit.
A tester of a load/store unit. In this tester, the functions of LSU for storing and loading data are tested. Since the schedule is needed in current version of LSU, this tester is deprecated.
- Deprecated
-
class
TopModule2PEUnitTest extends PeekPokeTester[TopModule]
A tester of the PEBlock.
A tester of the PEBlock. Since the configuration is set according to human computation, it is deprecated.


enum Ked::TokenType
Overview
Enum for representing the different types of Tokens that can be generated from Ked source code.
An Enum is used so that we are able to use syntax like TokenType::IDENT
when creating Token
objects
Defined in:
ked/token.crEnum Members
-
ILLEGAL =
0
-
Unknown token, this usually means an error
-
EOF =
1
-
End Of File
-
IDENT =
2
-
Name of variables/ functions, i.e: add, foobar, x, y, etc
-
VAR_PREFIX =
3
-
€ symbol denotes variables
-
NUMBER =
4
-
Integers and Floats are both Number tokens but will use Int and Float internally
-
ASSIGN =
5
-
= for assignment
-
ADDITION =
6
-
'plus' operator for addition
-
SUBTRACTION =
7
-
'awayFrom' operator for subtraction
-
MULTIPLICATION =
8
-
'times' operator for multiplication
-
DIVISION =
9
-
'into' operator for division
-
EQUALITY =
10
-
'is' (==)
-
NEGATION =
11
-
'not' for negation
-
INEQUALITY =
12
-
'isNot' (!=)
-
LT =
13
-
'isSmallerThan' (>)
-
GT =
14
-
'isBiggerThan' (<)
-
COMMA =
15
-
','
-
LIKE =
16
-
'like', ked's version of ;
-
LPAREN =
17
-
'('
-
RPAREN =
18
-
')'
-
LBRACE =
19
-
'{'
-
RBRACE =
20
-
'}'
-
FUNCTION =
21
-
'bai' for function definition
-
REMEMBER =
22
-
'remember' for variable assignment
-
RETURN =
23
-
'hereYaGoBai' for returning from a function
-
TRUE =
24
-
'gospel'
-
FALSE =
25
-
'bull'
-
IF =
26
-
'eh'
-
ELSE =
27
-
'orEvenJust'
Instance Method Summary
- #addition?
- #assign?
- #comma?
- #division?
- #else?
- #eof?
- #equality?
- #false?
- #function?
- #gt?
- #ident?
- #if?
- #illegal?
- #inequality?
- #lbrace?
- #like?
- #lparen?
- #lt?
- #multiplication?
- #negation?
- #number?
- #rbrace?
- #remember?
- #return?
- #rparen?
- #subtraction?
- #true?
- #var_prefix?


WITNESS LIST
Health & Human Services
March 4, 2015 8:30 AM
Registering, but not testifying:
FOR:
Belcher, Nora Executive Director (Texas e-Health Alliance), Austin, TX
Holmes, Harry Director Public Policy (Texas Association of Health Information
Organizations), Houston, TX
Kroll, Carrie Vice President Advocacy, Health Policy and Quality (Texas Hospital
Association), Austin, TX
Providing written testimony:
ON:
Alexander, Troy Associate Director for Advocacy (Texas Medical Association), Austin,
TX
Registering, but not testifying:
FOR:
Davis, Donald Associate Professor (University of Texas), Austin, TX
Mendez, Mark Assistant County Administrator (Tarrant County), Fort Worth, TX
FOR:
Garza, Rene Past President AIP / President Elect TPA (Self; Alliance of Independent
Pharmacists of Texas, Texas Pharmacy Association), Manchaca, TX
AGAINST:
Horne, Allen VP - Government Affairs (CVS Health), Austin, TX
Registering, but not testifying:
FOR:
Burklund, Adam (American Insurance Association), Austin, TX
Galligher, Duane (Texas Independent Pharmacies Association), Austin, TX
Herzog, Greg Lobbyist (Texas Pharmacy Business Council), Austin, TX
Hudman, Justin Senior Director Public Affairs (Texas Pharmacy Association), Austin, TX
AGAINST:
Grasso, Leigh Ann Pharmacist (Annie's Apothecary), Boerne, TX
Jarosik, Jodie Technician (Annie's Apothecary), Austin, TX
Prendergast, Jim Government Relations (Healthiest You), Scottsdale, AZ
Staples, Mary Director (National Association of Chain Drug Stores), Southlake, TX
Williams, Barbara Executive (Careington International), Frisco, TX
FOR:
Bingham, Bill Attorney (Texas Dental Association), Austin, TX
Bresnen, Steve Attorney (Association of Dental Support Organizations), Austin, TX
Registering, but not testifying:
FOR:
Rudd, Tyler Governmental Relations (Texas Academy of Pediatric Dentistry), Austin, TX
WITNESS LIST
Health & Human Services
March 4, 2015 8:30 AM
FOR:
Murphy, Donald Pediatric Physician (also providing written testimony) (TMA, TPS,
TAFP), Fort Worth, TX
AGAINST:
King, Read (Self), Denton, TX
Lee, Donald Executive Director (Texas Conference of Urban Counties), Austin, TX
McCarthy, Peter (also providing written testimony) (Texas Health Freedom Coalition),
Austin, TX
Palmer, Joe Occupation: Logistics (Self), Burleson, TX
Powell, Judy Communications Director (Parent Guidance Center), Austin, TX
ON:
Cornelius, Lisa Infectious Disease Medical Officer (Department of State Health Services),
Austin, TX
Giroir, Brett Director (Texas Task Force on Infectious Disease Preparedness and
Response), Bryan, TX
Huang, Phil Medical Director / Health Authority (also providing written testimony) (Texas
Association of City and County Health Officials), Austin, TX
Martinez, Diana Epidemiology Program Manager (also providing written testimony)
(HCPHES), Houston, TX
Reed, Charles Assistant Administrator (Dallas County), Dallas, TX
Stewart, Betty (also providing written testimony) (Self), Austin, TX
Registering, but not testifying:
FOR:
Capelo, Jaime Legislative Consultant (Texas Chapter American College of Cardiology),
Austin, TX
Galligher, Duane (Texas Environmental Health Association), Austin, TX
Reynolds, David Executive Director (Texas Osteopathic Medical Association), Austin, TX
AGAINST:
Allison, Jim General Counsel (County Judges and Commissioners Association of Texas),
Austin, TX
Allred, Don County Judge (Oldham County), Vega, TX
Fredell, Wendy (Self), Austin, TX
Mendez, Mark Assistant County Administrator (Tarrant County Commissioners Court),
Fort Worth, TX
Parker Leigh, Susan Nutrition Consultant (Self; Texas Health Freedom Coalition),
Wimberley, TX
Scheibe, Lindsey (Self), Austin, TX
Schuetze, Karin (Self), Austin, TX
Thompson, Rick Legislative Liaison (Texas Association of Counties), Austin, TX
Volz, Dawn (Self), San Antonio, TX
Volz, Melissa (Self), San Antonio, TX
Young, Dorothy (Self), Austin, TX
WITNESS LIST
Health & Human Services
March 4, 2015 8:30 AM
Providing written testimony:
ON:
Jenkins, Clay Dallas County Judge (Dallas County), Dallas, TX


Novel Seismic Hazard Curves
Pick a point on the map for geographic location!
Risk Category
Site Class
Intensity Measure (IM)
Analysis
I
II
III
IV
A: Hard rock
B: Rock
C: Very dense soil and soft rock
D: Stiff soil
E: Soft clay soil
FIV3
S
a
(T
1
)
Curves
Maps
Python TEST


Class BoundingRectangle
Represents an axis aligned bounding rectangle.
Inheritance
Inherited Members
Namespace: netDxf
Assembly: CADability.dll
Syntax
public class BoundingRectangle
Constructors
| Improve this Doc View SourceBoundingRectangle(Vector2, Vector2)
Initializes a new axis aligned bounding rectangle.
Declaration
public BoundingRectangle(Vector2 min, Vector2 max)
Parameters
| Type | Name | Description |
|---|---|---|
| Vector2 | min | Lower-left corner. |
| Vector2 | max | Upper-right corner. |
BoundingRectangle(Vector2, Double)
Initializes a new axis aligned bounding rectangle from a circle.
Declaration
public BoundingRectangle(Vector2 center, double radius)
Parameters
| Type | Name | Description |
|---|---|---|
| Vector2 | center | Center of the bounding rectangle. |
| System.Double | radius | Radius of the circle. |
BoundingRectangle(Vector2, Double, Double)
Initializes a new axis aligned bounding rectangle.
Declaration
public BoundingRectangle(Vector2 center, double width, double height)
Parameters
| Type | Name | Description |
|---|---|---|
| Vector2 | center | Center of the bounding rectangle. |
| System.Double | width | Width of the bounding rectangle. |
| System.Double | height | Height of the bounding rectangle. |
BoundingRectangle(Vector2, Double, Double, Double)
Initializes a new axis aligned bounding rectangle from a rotated ellipse.
Declaration
public BoundingRectangle(Vector2 center, double majorAxis, double minorAxis, double rotation)
Parameters
| Type | Name | Description |
|---|---|---|
| Vector2 | center | Center of the ellipse. |
| System.Double | majorAxis | Major axis of the ellipse. |
| System.Double | minorAxis | Minor axis of the ellipse. |
| System.Double | rotation | Rotation in degrees of the ellipse. |
BoundingRectangle(IEnumerable<Vector2>)
Initializes a new axis aligned bounding rectangle.
Declaration
public BoundingRectangle(IEnumerable<Vector2> points)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Collections.Generic.IEnumerable<Vector2> | points | A list of Vector2. |
Properties
| Improve this Doc View SourceCenter
Gets the bounding rectangle center.
Declaration
public Vector2 Center { get; }
Property Value
| Type | Description |
|---|---|
| Vector2 |
Height
Gets the bounding rectangle height.
Declaration
public double Height { get; }
Property Value
| Type | Description |
|---|---|
| System.Double |
Max
Gets or sets the bounding rectangle upper-right corner.
Declaration
public Vector2 Max { get; set; }
Property Value
| Type | Description |
|---|---|
| Vector2 |
Min
Gets or sets the bounding rectangle lower-left corner.
Declaration
public Vector2 Min { get; set; }
Property Value
| Type | Description |
|---|---|
| Vector2 |
Radius
Gets the radius of the circle that contains the bounding rectangle.
Declaration
public double Radius { get; }
Property Value
| Type | Description |
|---|---|
| System.Double |
Width
Gets the bounding rectangle width.
Declaration
public double Width { get; }
Property Value
| Type | Description |
|---|---|
| System.Double |
Methods
| Improve this Doc View SourcePointInside(Vector2)
Checks if a point is inside the bounding rectangle.
Declaration
public bool PointInside(Vector2 point)
Parameters
| Type | Name | Description |
|---|---|---|
| Vector2 | point | Vector2 to check. |
Returns
| Type | Description |
|---|---|
| System.Boolean | True if the point is inside the bounding rectangle, false otherwise. |
Union(BoundingRectangle, BoundingRectangle)
Obtains the union between two bounding rectangles.
Declaration
public static BoundingRectangle Union(BoundingRectangle aabr1, BoundingRectangle aabr2)
Parameters
| Type | Name | Description |
|---|---|---|
| BoundingRectangle | aabr1 | A bounding rectangle. |
| BoundingRectangle | aabr2 | A bounding rectangle. |
Returns
| Type | Description |
|---|---|
| BoundingRectangle | The resulting bounding rectangle. |
Union(IEnumerable<BoundingRectangle>)
Obtains the union of a bounding rectangles list .
Declaration
public static BoundingRectangle Union(IEnumerable<BoundingRectangle> rectangles)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Collections.Generic.IEnumerable<BoundingRectangle> | rectangles | A list of bounding rectangles. |
Returns
| Type | Description |
|---|---|
| BoundingRectangle | The resulting bounding rectangle. |


If your project does not qualify to be hosted in GitHub or you need direct access to your files, it's not a problem! We can work together and setup a custom configuration for your project. This way, you can have full control over your files, without the restrictions of GitHub, and the ability to utilize the full power of jsDelivr.
jsDelivr is here to help and not to limit. Even if what you need is not listed above, feel free to contact us.


CABA crowned champion in dance tilt
The College of Accountancy and Business Administration (CABA) won the championship award in the intercollegiate Dance Sport competition held today at the Urdaneta City University Gymnasium.
Nicole Mosada and Rogelio Semilla Jr. represented CABA in the competition.
The College of Nursing (CON) won the first place while the College of Computer Studies (CCS) got the 2nd place.
#52ndFoundationAnniversarry #DanceSport #UCU


| ClassDetails |
|
| ClassInstrumentor |
Instruments (i.e.
|
| ClassNodeProvider |
|
| DirectObjectMarker |
|
| InstrumentationConfiguration |
|
| InstrumentationConfiguration.Builder |
|
| InstrumentingClassWriter |
ClassWriter implementation that verifies classes by comparing type information obtained
from loading the classes as resources.
|
| Interceptor |
|
| Interceptors |
|
| InvocationProfile |
|
| InvokeDynamicClassInstrumentor |
Deprecated.
|
| InvokeDynamicSupport |
|
| MethodCallSite |
|
| MethodRef |
Reference to a specific method on a class.
|
| MethodSignature |
|
| MutableClass |
|
| ProxyMaker |
Deprecated.
|
| RoboCallSite |
|
| RobolectricGeneratorAdapter |
GeneratorAdapter implementation specific to generate code for Robolectric purposes
|
| RobolectricInternals |
|
| Sandbox |
|
| SandboxClassLoader |
Class loader that modifies the bytecode of Android classes to insert calls to Robolectric's
shadow classes.
|
| ShadowConstants |
|
| ShadowDecorator |
Decorator which adds Robolectric's shadowing behavior to a class.
|
| ShadowImpl |
|
| ShadowInfo |
|
| ShadowInvalidator |
|
| ShadowMap |
Maps from instrumented class to shadow class.
|
| ShadowMap.Builder |
|
| ShadowProviders |
|
| ShadowWrangler |
ShadowWrangler matches shadowed classes up with corresponding shadows based on a ShadowMap .
|
| UrlResourceProvider |
ResourceProvider using URLs.
|


{{cardType.name}}
Annual Fee: {{cardType.annualfee}}
{{cardType.description}}
PERSONAL INFORMATION
{{applyFormGroup.get('firstname').value}} Please read some important information about this Card.
TERMS & CONDITIONS
view terms and conditionsBy submitting this application, I certify that I have read, met, and agreed to all of the terms, conditions, and disclosures outlined above/as stated above, which contain rate, fee and other important information.
Membership Rewards® partners will receive certain information about you in order to provide the benefits of your Membership Rewards account.
THIS CARD HAS GONE PAPERLESS
If we approve your application, we’ll deliver your Agreement (including Account Opening Disclosures) electronically. We’ll also deliver other important information about your account electronically, once you have created your online account, including:
you confirm you have reviewed, meet the requirements of and agree to the terms and conditions.
{{cardType.name}}
Annual Fee: {{cardType.annualfee}}
{{cardType.description}}
{{cardType.bonus}}
{{cardType.otherbonus}}


Preparation time
30 mins to 1 hour
Cooking time
10 to 30 mins
Serves
Serves 8-10
Dietary
Preheat the oven to 180C/360F/Gas 4. Lightl grease a baking tray with butter.
For the choux pastry, place the butter and water into a pan over a medium heat until the butter has melted.
Remove the pan from the heat, add the flour and mix well with a wooden spoon until the mixture resembles a paste.
Add the eggs, one at a time, mixing until completely combined before adding the next egg.
Transfer the dough into a piping bag, then pipe small blobs of dough onto the greased baking tray.
Bake in the oven for 15-20 minutes, or until dry and hollow. As soon as they are cooked, use the handle of a teaspoon to poke a small hole into the base of each profiterole to allow any steam to escape. Set aside to cool.
For the filing, place the whipped cream into a bowl and fold in the vanilla essence and icing sugar, to taste.
Spoon the cream mixture into a clean piping bag and fill each profiterole with it.
Spread a little melted dark chocolate onto a large plate or cake stand. Arrange a layer of profiteroles onto it.
Place more chocolate on top of each profiterole, then add a second layer of profiteroles, slightly smaller in diameter than the first layer.
Top the second layer of profiteroles with melted white chocolate, then add another layer of profiteroles.
Repeat the process with the remaining profiteroles until the layers resemble a pyramid and all of the profiteroles have been used.
To serve, drizzle over any remaining melted chocolate and present at the table.


YASH JAIN
Home
About
Contact Us
Donate Us
ABOUT:
NAME: YASH JAIN
COLLEGE: IIT ROPAR
RESIDENT OF UDAIPUR, RAJASTHAN


[1]
only 1 hanger , the toilet and the ones in my army barracks 20 years ago .
[2]
walking round breakfast time , but oddly seem to only speak to guests when they leave .


This benchmark compare different methods for scheduling custom events. Open the console to see the results.


Before Change
rollouts.obs[0].copy_(obs)
// These variables are used to compute average rewards for all processes.
episode_rewards = torch.zeros([args.num_processes, 1])
final_rewards = torch.zeros([args.num_processes, 1])
rollouts.to(device)
start = time.time()
for j in range(num_updates):
for step in range(args.num_steps):
// Sample actions
with torch.no_grad():
value, action, action_log_prob, recurrent_hidden_states = actor_critic.act(
rollouts.obs[step],
rollouts.recurrent_hidden_states[step],
rollouts.masks[step])
// Obser reward and next obs
obs, reward, done, info = envs.step(action)
episode_rewards += reward
// If done then clean the history of observations.
masks = torch.FloatTensor([[0.0] if done_ else [1.0] for done_ in done])
final_rewards *= masks
final_rewards += (1 - masks) * episode_rewards
episode_rewards *= masks
rollouts.insert(obs, recurrent_hidden_states, action, action_log_prob, value, reward, masks)
After Change
rollouts.obs[0].copy_(obs)
rollouts.to(device)
episode_rewards = deque(maxlen=10)
start = time.time()
for j in range(num_updates):
for step in range(args.num_steps):


| US Retail Sales YoY (%) | ||||||
| Release Dt | For Month | Market Expectation | Kshitij Expectation | Previous | Released | Revision |
| 14-Dec-17 | Nov-17 | 5.92 | 4.63 | 5.50 | 5.96 | 6.45 |
| 12-Jan-18 | Dec-17 | 5.90 | 6.34 | 6.45 | 5.62 | 5.29 |
| 14-Feb-18 | Jan-18 | 4.48 | 5.27 | 5.29 | 3.85 | - |
| 14-Mar-18 | Feb-18 | - | 5.52 | 3.85 | - | - |


Plan your next projects success
If you have a new website, app, SaaS, PaaS, or IoT project - you need to plan before you unleash engineers.
Maybe it's just an idea drawn on a napkin, maybe it's something your or your business have been planing for awhile. Whatever the size of your company (especially if you're a startup!), whatever the project, however complex, it is important to design the solution ahead of time.
Don't get caught just throwing engineers and developers at problem. Make sure there is a clear path forward to make your vision a reality.
Make sure your mobile app works on every device and with as little extra work as possible. Make sure every piece of your app and the servers it relies on are solid and ready for your app to go viral.
Web apps are the quick way to get to customers. One code base, one way for your customers to interact, only one app to fix/upgrade/maintain. We can show you the best way to build, deploy, maintain, and grow your web based application so that your customers will have the best experience and will provide the most return on investment.
If you want to launch the next software or platform as a service, then scale and reliability are at the top of the list. We specialize in highly performant, highly scalable, highly available solutions to make sure you deliver the best platform possible.
The Internet of Things is new, complicated, insecure, and ever changing. We will make sure your network of things has a secure and reliable back end that never misses data. Reporting, data, dashboards, easy node adding, self healing meshes, all backed by the cloud will make sure your IoT project is a success.


Go Compiler
Connected
Disconnected
Ready
Compiling
{{ state.NumQueued }} Queued
Go {{ config.Version }}
Package
The target
main
package to build
Git Commit-ish
Resets the package repository to a specific commit and sets the
ld-flag
Version
Sets the
ld-flag
Platforms
{{ osID }}
{{ archID }}
{{ showPlatforms && 'Hide' || 'Show' }} Platforms
Compile
Compiled binaries
There are no binaries yet
Compiled packages will appear here.
{{ urls.repoName }}
/
{{ urls.targetName }}
{{ urls.targetName }}
({{ c.version }})
{{ osarch(f) }}
{{ c.error }}
compiling
compiled {{ ago(c.completedAt) }}
from commit {{ c.commitish }}


I had a pleasure to work in Ithaca with David Winkler. He started and for many years maintains a huge colony of nest boxes. Tree swallows living in these boxes are cute birds with low survival rates and this makes them different from shorebirds I used to work before. These birds just have to reproduce, so they arrive super early to get a nest box. Lay second clutch if the first was not successful and have to find food despite coldsnaps.
D. W. Winkler, M. K. Luo, and E. Rakhimberdiev. Temperature effects on food supply and chick mortality in tree swallows (Tachycineta bicolor). Oecologia, (173): 129–138, 2013.
D. W. Winkler, K. M. Ringelman, P. O. Dunn, L. Whittingham, J. T. Hussell David, R. G. Clark, R. D. Dawson, J. L. Scott, A. Rose, S. H. Austin, R. W. Douglas, M. P. Lombardo, P. A. Thorpe, D. Shutler, R. J. Robertson, M. Stager, M. Leonard, A. G. Horn, J. Dickinson, V. Ferretti, V. Massoni, F. Bulit, J. C. Reboreda, M. Liljesthröm, M. Quiroga, E. Rakhimberdiev, and D. R. Ardia. Latitudinal variation in clutch size–lay date regressions in tachycineta swallows: effects of food supply or demography? Ecography, 37(7): 670–678, 2014.
J. Karagicheva, M. Liebers, E. Rakhimberdiev, K. K. Hallinger, A. Saveliev, and D. W. Winkler. Differences in size between first and replacement clutches match the seasonal decline in single clutches in tree swallows tachycineta bicolor. Ibis, 158(3): 607-613, 2016.


{% extends '__base.html' %} {% load staticfiles %} {% block content %}
PIE allows TOPMed investigators to view and search through the phenotype data currently available to the TOPMed Data Coordinating Center. The DCC is in the process of combining study phenotypes across TOPMed projects to produce harmonized phenotypes. TOPMed Working Groups can help the harmonization process by submitting details for how to combine study phenotypes.
Phenotype data from each study is downloaded from dbGaP and stored securely at the TOPMed DCC. Metadata (but not phenotype data values) are scanned and stored by PIE to facilitate browsing, searching, and tagging phenotypic variables and datasets. dbGaP accession numbers uniquely identify each study, dataset, and variable. These study variables are used as the source material for the DCC's reproducible and rigorously documented phenotype harmonization process.
{# #}The TOPMed DCC is producing a high quality, lasting resource of publicly available and thoroughly documented harmonized phenotype variables. The DCC collaborates with Working Group members and study and phenotype experts to define a target harmonized variable and to idenfity the component study variables to use. Harmonized variables are listed on PIE as they become available. Once finalized, datasets containing harmonized variables can be downloaded from the dbGaP TOPMed exchange area by authorized TOPMed investigators (more information here). Eventually these harmonized phenotypes will be available from dbGaP.
{# #}


Price dropped on {product_name}
{product_name}
{product_detail}
New price:
{price}
Buy now
You have received this email because you subscribed for price alert on
{shop_name}
You will not receive another email unless you have created price alert on different product


Yesufu scores 16 to lift Drake over Simpson 98-53
DES MOINES, Iowa (AP) - Joseph Yesufu had 16 points off the bench to carry Drake to a 98-53 win over Division III opponent Simpson (Iowa) on Sunday.
Jonah Jackson had 14 points for Drake (3-1). Roman Penn added 13 points and seven assists. Liam Robbins had 12 points and seven rebounds, Anthony Murphy 11 points and seven rebounds and Antonio Pilipovic 10 points.
Andrew Curran had 10 points to lead the Storm.
TOP STORIES
Nancy Pelosi: Trump will have 'every opportunity to present his case'
Steve Scalise: Countervailing voices in impeachment probe haven't been allowed to come forward
Trump plans Florida 'homecoming' rally to celebrate changing residency from New York
Drake matches up against Lehigh at home on Thursday.
For more AP college basketball coverage: https://apnews.com/Collegebasketball and http://twitter.com/AP_Top25
Elements of this story were generated by Automated Insights, http://www.automatedinsights.com/ap, using data from STATS LLC, https://www.stats.com
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


| Overview | Module | Use | Devguide | Index |
| uses of interface XStorable |
back to interface XStorable |
| Derived Interfaces |
XStorable2 |
| Services which Support this Interface |
| ::com::sun::star::text::AdvancedTextDocument ::com::sun::star::linguistic2::Dictionary ::com::sun::star::drawing::DrawingDocument ::com::sun::star::drawing::GenericDrawingDocument ::com::sun::star::text::GenericTextDocument ::com::sun::star::text::GlobalDocument ::com::sun::star::text::HypertextDocument ::com::sun::star::sdb::OfficeDatabaseDocument ::com::sun::star::document::OfficeDocument ::com::sun::star::presentation::PresentationDocument ::com::sun::star::sheet::SpreadsheetDocument ::com::sun::star::text::TextDocument ::com::sun::star::text::WebDocument |
| Uses as Parameter |
| XDocumentTemplates::storeTemplate() |
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


1). Every 5 turns a piece of food is created.
2). For every 10 'quality' a food imparts to the nest, one ant is generated.
3). Only one ant may carry a piece of food at a time.
4). Each ant will target the closest piece of food.
5). Each refresh represents one turn.
6). Ants have 50 stamina to start.  Ants get 10 stamina for retrieving and dropping off food.
8). Ants loose 1 stamina per turn.
9). When ants die, they leave behind a corpse worth .5 food.
10). The homward-bound ant will always yeild to the ant searching for food
either to the left or the right.


Is Europe Proving To Be The Biggest Drag On U.S. Steel’s Growth?
by Trefis TeamAfter healthy growth in segment revenues and profitability over recent years, US Steel European division is proving to be the biggest drag on growth for U.S. Steel Corp (NYSE: X). Lower steel prices, slowdown in Europe, and increased raw material cost has led to the segment becoming the worst performing division for the company in 2019, with the trend for the segment expected to remain similar in 2020 as well.You can view the Trefis interactive dashboard – How Important Is The European Tubular & Flat-Rolled Products To US Steel Corp – to better understand the performance of the European division and arrive at your own estimates for its revenues and profits.
A] Division Overview
What is on Offer?
U.S. Steel’s European flat rolled and tubular products division includes steel sheets and plates as well as tubular items like pipes that are made by rolling processes and are sold in the European markets. The segment produces and sells slabs, sheet, strip mill plate, tin mill products, as well as heating radiators and refractory ceramic materials.
Who is Paying?
USSE primarily serves customers in the Eastern European service center, conversion, transportation (including automotive), construction, container, appliance and electrical, and oil, gas and petrochemical markets.
Competition?
The segment faces intense competition from other global steel giants such as A.K. Steel Holding Corporation, Nucor, and ArcelorMittal.
B] USSE Revenue Performance
- USSE revenues have steadily increased over recent years, with the segment adding $1 billion to its revenue base between 2016 and 2018.
- USSE revenues increased from $2.2 billion in 2016 to $3.2 billion in 2018, led by a sharp increase in steel prices.
- Price realized per ton increased from $499 in 2016 to $718 in 2018, driven by improved market conditions in line with recent economic growth and favorable currency impacts.
- However, segment revenue base is expected to shrink in the near term, with revenues expected to drop to $2.7 billion in 2019.
- Lower revenues would primarily be driven by lower average realized prices and decreased shipments, primarily from increasing imports and adverse European Union economic conditions, and the weakening of the euro versus the U.S. dollar.
C] Revenue Share
- Despite increase in both the segment as well as the company’s revenue in recent years, USSE’s share in US Steel’s total revenue initially increased from 21.9% in 2016 to 24.1% in 2017, before witnessing a drop to 22.6% in 2018.
- The decrease in share was due to faster growth in the US operations.
- The revenue share of the segment is expected to further decrease to about 20.5% by 2020, as the US-based operations are expected to perform much better, thus increasing their share in total revenues, whereas the European growth and demand slowdown is expected to decrease the segment contribution to the company’s top line.
D] Segment Margins vs Company Margins
- Over the last three years, the European division has had a much better operating margin compared to the company as a whole.
- However, though the segment as well as the company’s margins are expected to drop in the next two years, the European segment’s operating margins are expected to be lower than the company’s margins in 2019 and 2020.
- Sharp deterioration in the USSE segment could primarily be a reflection of the sharp drop in revenues and higher raw material costs, primarily for iron ore, higher energy costs, increased operating costs, and increased costs for carbon dioxide (CO2) emissions allowance.
- However, a relatively stronger performance in the US-based segments is expected to keep the company’s margins at an elevated level compared to the slowdown-stricken European division.
- USSE operating margin is expected to come in at 1.8% and 1.5% in 2019 and 2020, respectively, as against 3.5% and 3.2% for US Steel Corp.
E] Conclusion
Trefis estimates that the slowdown in Europe, drop in price realization, and higher cost is expected to lead to lower revenues and sharp deterioration in profitability for the European division, with the segment proving to be the biggest drag on the company’s near-term growth.
What’s behind Trefis? See How It’s Powering New Collaboration and What-Ifs For CFOs and Finance Teams| Product, R&D, and Marketing Teams More Trefis Data Like our charts? Explore example interactive dashboards and create your own


Downloads Infinispan Archive
Download older versions of Infinispan
Get the latest downloads available for each major and minor release of Infinispan. If possible, you should upgrade to a more recent release of Infinispan, as our support policy for older release is quite limited.
Version 10.1.8
"Turia"
2020/05/07
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Turia"
2020/05/07
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 10.0.1
"Chupacabra"
2019/11/01
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Chupacabra"
2019/11/01
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 9.4.18
"Infinity Minus ONE +2"
2020/02/13
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Infinity Minus ONE +2"
2020/02/13
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 9.3.9
"Estrella Galicia"
2020/04/02
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Estrella Galicia"
2020/04/02
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 9.2.5
"Gaina"
2018/06/11
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Gaina"
2018/06/11
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 9.1.7
"Bastille"
2018/02/13
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Bastille"
2018/02/13
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 9.0.3
"Ruppaner"
2017/06/21
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Ruppaner"
2017/06/21
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 8.2.12
"Chakra"
2019/11/15
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Chakra"
2019/11/15
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 8.1.3
"Mahou"
2016/04/04
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Mahou"
2016/04/04
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 8.0.2
"Infinite Darkness"
2015/11/25
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Infinite Darkness"
2015/11/25
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 7.2.5
"Insanely Bad Elf"
2015/09/10
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Insanely Bad Elf"
2015/09/10
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 7.1.1
"Hoptimus Prime"
2015/02/20
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Hoptimus Prime"
2015/02/20
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 7.0.3
"Guinness"
2015/01/05
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
"Guinness"
2015/01/05
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Docker
Release Notes
Fixed issues
Version 6.0.2
"Infinium"
2014/03/19
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
"Infinium"
2014/03/19
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
Version 5.3.x
"Tactical Nuclear Penguin"
2013/06/26
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
"Tactical Nuclear Penguin"
2013/06/26
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
Version 5.2.x
"Delirium"
2013/03/09
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
"Delirium"
2013/03/09
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
WildFly modules (SHA-1)
Release Notes
Fixed issues
Version 5.1.x
"Brahma"
2012/08/20
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
"Brahma"
2012/08/20
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
Version 5.0.x
"Pagoa"
2011/09/12
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
"Pagoa"
2011/09/12
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
Version 4.2.x
"Ursus"
2011/03/25
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
"Ursus"
2011/03/25
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
Version 4.1.x
"Radegast"
2010/09/02
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
"Radegast"
2010/09/02
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
Version 4.0.x
"Starobrno"
2010/02/23
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues
"Starobrno"
2010/02/23
Embedded (SHA-1)
Minimal (SHA-1)
Server (SHA-1)
Release Notes
Fixed issues