SQL
í
SQL (
Structured Query Language pronounced "S-Q-L" or "Sequel") is a special-purpose programming language designed for managing data held in a
relational database management system (RDBMS).
Introduced in 1970s, the relational model offers a very mathematically-adapt way of structuring, keeping, and using the data. Relations bring the benefits of group-keeping the data as collections whereby data-tables relate all the input by assigning values to attributes.
The RDBMS follows the so called
CRUD principle:
- Create
- Putting data into tables.
- Read
- Query data out of a table.
- Update
- Change data already in a table.
- Delete
- Remove data from the table.
Almost any SQL operation is based on this principle.
Despite their strict nature of forming and handling data, relational databases can become extremely flexible and offer a lot, granted with a little bit of effort.
NoSQL
ì
í
The term "NoSQL" has been introduced by Carlo Strozzi in 1998 to name his open-source relational database. Since his system departs from the pure relational model, he came up with this name that is an acronym for "Not only SQL".
The current NoSQL movement started in 2009 when Eric Evans and Johan Oskarsson (Last.fm) organized an event to discuss distributed database systems.
The NoSQL way of structuring the data aims to eliminate the constraints that the relational model brings, hence liberating the means of keeping, querying, and using information. NoSQL databases offer many different types of ways to keep and work with the data for specific use cases efficiently by using an unstructured or structured-on-the-go kind of approach.
In contrast to the SQL standard, there are many implementations of NoSQL approaches with each working very differently and serving a specific need. So NoSQL databases do not have a common way to query the data and each solution provides its own query system.
Comparison
ì
í
Additional to the differences in data structuring and querying, there are many more. A few of them are listed here:
-
Reliability:
When it comes to data reliability and safe guarantee of performed transactions, SQL databases are still more solid.
-
Scaling:
Both solutions are easy to scale vertically (i.e. by increasing system resources). However, being more modern applications, most NoSQL solutions offer much easier means to scale horizontally (i.e. by creating a cluster of multiple machines).
-
Support:
Relational database management systems are extremely popular and it is very easy to find support. If an issue arises, it is therefore often much easier to solve than recently-popular NoSQL databases, especially when dealing with complex solutions like MongoDB.
-
Complex data keeping and querying needs:
By nature, relational databases are the go-to solution for complex querying and data keeping needs. Since NoSQL solutions mostly adress specific usecases, they primarily aim to solve a problem in an approachable way. Efficiency is therefore not the main target of most NoSQL solutions.


a— layout: NotesPage title: Reasoning About Code Safety permalink: /work_files/dev/cs/racs prevLink: /work_files/dev/cs.html —
Table of Contents
Magic Numbers and Exploitation
-
- Exploit:
- An Exploit is a piece of software, a chunk of data, or a sequence of commands that takes advantage of a bug or vulnerability to cause unintended or unanticipated behavior to occur on computer software, hardware, or something electronic.
-
- Magic Numbers:
- Exploits are very brittle in nature.
Changing one number in an exploit (program) can render it useless.
Ex. Making sure the exploit runs on the right version.
-
- EXTRABACON:
- Is an NSA exploit for Cisco ASA “Adaptive Security Appliances”.
-
- It had an exploitable stack-overflow vulnerability in the SNMP read operation.
- But actual exploitation required two steps:
- Query for the particular version (with an SMTP read).
- Select the proper set of magic numbers for that version.
-
- ETERNALBLUE(screen):
- Another NSA exploit that got stolen by the same group (“ShadowBrokers”) which stole EXTRABACON.
-
- Eventually it was very robust.
- This was “god mode”:
remote exploit Windows through SMBv1(Windows File sharing).
- This was “god mode”:
- Eventually it was very robust.
-
- But initially it was jokingly called ETERNALBLUESCREEN:
- Because it would crash Windows computers more reliably than exploitation.
- But initially it was jokingly called ETERNALBLUESCREEN:
Reasoning About Memory Safety
-
- Memory Safety:
- No accesses to undefined memory.
“Undefined” is with respect to the semantics of the programming language.
- Undefined behavior is:
* At Minimum: is a bug. * At Maximum: is exploitable.
-
- Read Access:
- An attacker can read memory that he isn’t supposed to.
-
- Write Access:
- An attacker can write memory that she isn’t supposed to.
-
- Execute Access:
- An attacker can transfer control flow to memory that they isn’t supposed to.
Reasoning About Safety
-
- How can we have confidence that our code executes in a safe fashion?:
- Approach: build up confidence on a function-by-function / module-by-module basis.
-
- Modularity:
- Modularity provides boundaries for our reasoning.
- Preconditions: what must hold for function to operate correctly.
- Postconditions: what holds after function completes.
These basically describe a contract for using the module.
- The notion of modularity apply to individual statements.
Statement-1’s postcondition should logically imply Statement-2’s precondition.
- Invariants: conditions that always hold at a given point in a function.
This particularly matters for loops.
- How to Prove Memory-Safety?
- Identify each point of memory access.
- Write down precondition it requires.
- Propagate requirement up to beginning of function.
- Complicated loops might need us to use induction to show invariants:
- Base case: first entrance into loop.
- Induction: show that postcondition of last statement of loop, plus loop test condition, implies invariant.
-
- Example 1:
-
int deref(int *p) { return *p; }
-
- The Pre-Condition: requires
p
to not be NULL, andp
a valid pointer.
\(\implies \\\)
- The Pre-Condition: requires
-
void *mymalloc(size_t n) { void *p = malloc(n); if (!p) { perror("malloc"); exit(1); } return p; }
- The Post-Condition: ensures that the return value is not NULL, and is a valid pointer.
-
- Example 2:
-
int sum(int a[], size_t n) { int total = 0; for (size_t i=0; i<n; i++) total += a[i]; return total; }
-
- The Pre-Condition: requires
p
to not be NULL, andp
a valid pointer.
- The Pre-Condition: requires
-
- Drawbacks:
- Unfortunately, the process descrived above is too tedius.
Thus, programers tend to not safe-check their code.
-
- Alternative:
- Don’t use C or C++.
- Instead, Use a Safe language:
Turns “undefined” memory references into an immediate exception or program termination. - Now you simply don’t have to worry about buffer overflows and similar vulnerabilities.
- Safe Languages: Python - JAVA - GO - RUST - SWIFT
Making C Safe [Alternatives of the Alternatives]
- Stack Canaries:
- Goal: protect the return pointer from being overwritten by a stack buffer.
- Defends-Against: Stack Over-Flows.
- Method:
- When the program starts up, create a random value.
- When returning in a function, first check the canary against the stored value.
- Drawbacks: (i.e.
- Find out what the canary is (e.g. via an FSV) and then write its value back.
- Write around the canary.
- Overflow the Heap.
- Properties:
- A simple stack overflow doesn’t work anymore.
- Minor and nearly negligible overhead.
- It requires a compiler flag to enable on Linux.
- Non-Executable Pages:
- Goal: make pages in the TLB/Page-Table non-executable.
- Defends-Against: Injections.
- Method:
- The TLB/Page-Table has three bits R(ead)/W(rite)/X(cute).
- Maintain W xor X as a global propert.
Now, you can’t write code to the stack or heap.
- Drawbacks: (i.e.
- Unfortunately, this is insufficient. There are multiple ways around it.
- Properties:
- A simple stack overflow doesn’t work anymore.
- Effectively no performance impact.
- Does break some code.
- Yet still often not ubiquitous on embedded systems.
e.g. Cisco ASA
- Exploits that best this defending approach:
- Return into libc: set up the stack frame such that the “return” excutes the “excute” command.
- Return Oriented Programming:
- Given a code library, find a set of fragments (gadgets) that when called together execute the desired function.
The “ROP Chain”.
- Inject onto the stack a sequence of saved “return addresses” that will invoke this.
- Given a code library, find a set of fragments (gadgets) that when called together execute the desired function.
Unfortuntely, many such Exploits are available online.
- Address Space Layout Randomization:
- Goal: Randomize the addresses of the excutables in memory.
- Defends-Against: Buffer Over-Flows.
- Method:
- Rather than deterministically allocating the process layout, the OS randomizes the starting base of each excutable section (text, data/BSS, heap, stack).
- Randomly relocate everything (Every library, the start of the stack & heap).
- Drawbacks: (i.e.
- Find out what the canary is (e.g. via an FSV) and then write its value back.
- Write around the canary.
- Overflow the Heap.
- Properties:
- When combined with W^X, need an information leak to exploit.
A way to find the address of a function,
to find the magic offset needed to modify your ROP chain - With 64b of space you have lots of entropy, making them harder to exploit.
- It requires a compiler flag to enable on Linux.
- When combined with W^X, need an information leak to exploit.
-
- Defense-in-Depth in Practice:
-
- Apple iOS uses ASLR in the kernel and userspace, W^X whenever possible.
-
All applications are sandboxed to limit their damage: The kernel is the TCB.
-
- The “Trident” Exploit: was used by a spyware vendor, the NSO group, to exploit iPhones of targets.
- To remotely exploit an iPhone, the NSO group’s exploit had to:
- Exploit Safari with a memory corruption vulnerability.
Gains remote code execution within the sandbox: write to a R/W/X page as part of the JavaScript JIT.
- Exploit a vulnerability to read a section of the kernel stack.
Saved return address & knowing which function called breaks the ASLR
- Exploits a vulnerability in the kernel to enable code execution
- Exploit Safari with a memory corruption vulnerability.
- To remotely exploit an iPhone, the NSO group’s exploit had to:
- The “Trident” Exploit: was used by a spyware vendor, the NSO group, to exploit iPhones of targets.
Software Security Issues and Testing
- Why does software have vulnerabilities?:
- Programmers are humans, and humans make mistakes.
Use Tools.
- Programmers often aren’t security-aware.
Learn about common types of security flaws.
- Programming languages aren’t designed well for security.
Use better languages (Java, Python, …).
- Programmers are humans, and humans make mistakes.
- What makes testing a program for security problems difficult?:
- We need to test for the absence of something.
Security is a negative property!
“nothing bad happens, even in really unusual circumstances”
- Normal inputs rarely stress security-vulnerable code.
- We need to test for the absence of something.
- How can we test more thoroughly?:
- Random inputs (fuzz testing)
- Mutation
- Spec-driven design.
-
- How do we tell when we’ve found a problem?:
- When we have found a crash or other deviant behavior.
-
- How do we tell when we’ve found a problem?:
- This is a very hard task but code-coverage tools can help.
Working Towards Secure Systems
-
- Patching:
- Along with securing individual components, we need to keep them up to date.
-
- What’s hard about patching?:
- Can require restarting production systems.
- Can break crucial functionality.
- Management burden:
- It never stops (the “patch treadmill”).
- It can be difficult to track just what’s needed where.
- What’s hard about patching?:
-
- Vulnerability scanning:
- Probe your systems/networks for known flaws.
-
- Penetration testing (“pen-testing”):
- Pay someone to break into your systems. > Provided they take excellent notes about how they did it!
Approaches for Building Secure Software/Systems (Summary)
- Run-time checks:
- Automatic bounds-checking (overhead).
- What do you do if check fails?.
- Address randomization:
- Make it hard for attacker to determine layout.
- But they might get lucky / sneaky.
- Non-executable stack, heap:
- May break legacy code.
- See also Return-Oriented Programming (ROP).
- Monitor code for run-time misbehavior:
- E.g., illegal calling sequences.
- But again: what do you if detected?.
- Program in checks / “defensive programming”:
- E.g., check for null pointer even though sure pointer will be valid.
- Relies on programmer discipline.
- Use safe libraries:
- E.g. strlcpy, not strcpy; snprintf, not sprintf.
- Relies on discipline or tools.
- Bug-finding tools:
- Excellent resource as long as not many false positives.
- Code review:
- Can be very effective but expensive..
- Use a safe language:
- E.g., Java, Python, C#, Go, Rust.
- Safe = memory safety, strong typing, hardened libraries.
- Installed base? Programmer base? Performance?.
- Structure user input:
- Constrain how untrusted sources can interact with the system.
- Perhaps by implementing a reference monitor.
- Contain potential damage:
- E.g., run system components in jails or VMs.
- Think about privilege separation.


The Problem of Public Roads in Mexico
menu
The Problem
Details
Academic Research
Persona
Home
The Problem
Details
Academic Research
Persona
Proposal
References


This page comprises a loosely organized heap of links to resources I have found useful in my scientific endeavors to date. Your mileage may vary. I will add to it as things come up and I find the time. Suggestions for additions/modifications (or reports of broken links) are welcome.
Climate science blogs
- Isaac Held's blog
- Real Climate
- Jeff Masters' blog
- Adam Sobel's blog
- Tapio Schneider's Group blog
- Climate Lab Book (Ed Hawkins)
- Climate Etc. (Judy Curry)
Climate science podcasts
- Deep Convection Hosted by Adam Sobel
- Forecast Hosted by Michael White, Nature’s climate science editor (no longer running, but many great episodes during its 2015-2018 run)
Science communication
- Better Figures “Constructive criticism of the graphics of climate science”
- Principiae Material (some free) on science communication
- Edward Tufte Fascinating and beautiful books on effective data displays
- The Elements of Style Classic text on writing succinctly and clearly
- Beamer customization cheat sheet Quick reference for how to tinker with elements of Beamer presentations
Climate science & meteorology history
- Geoff Vallis's collection of classic papers With useful comments by G. Vallis
- Old Weather Citizen-science project: transcribe historical ship logs of weather data
Data visualization tools
- Gateway to Astronaut Photography of Earth NASA portal to imagery of earth taken by astronauts
- Martin Jucker's 3D weather visualizations Beautiful videos, interactive 3D plots, and static images of current and past weather
- nullschool.net Beautiful, interactive visualization of meteorological and ocean data
Online research tools
- Detexify Draw a symbol, get the LaTeX command for it.
- MITGCM M.I.T. General Circulation Model
- HYSPLIT Compute forward and backward air trajectories
Climate data
- NASA Global Change Master Directory
- Columbia IRI/LDEO Climate Data Library
- U. Wisc. weather satellite imagery portal
Career
Graduate school survival tips
- Advice for Grad Students I General advice; must-read for early grad students
- Advice for Grad Students II Writing advice: thesis, papers, etc.
Funding
Graduate fellowships
- NSF Graduate Research Fellowship Program
- Dept. of Defense National Defense Science and Engineering Graduate Fellowship (they funded me)
- Hertz Foundation Graduate Fellowship Award
- NASA Earth and Space Science Fellowship
Undergraduate AOS scholarships
- NOAA Hollings Scholarship Open to undergraduate sophomores; funding and NOAA internship
- Barry Goldwater Scholarship and Excellence in Education Program For undergraduate juniors in sciences


0">
Required Age: {{ rarity.requiredage }}
Required Age: 1
0">
Duration:
60">{{ rarity.activetime/60 - (rarity.activetime % 60)/60}} 60">m
{{ rarity.activetime % 60 }} s
Activates immediately
0">
Cooldown (Class {{ rarity.cooldownstackingclass }}):
60">{{ rarity.cooldowntime/60 - (rarity.cooldowntime % 60)/60 }} 60">m
{{ rarity.cooldowntime % 60 }} s
No Cooldown
0">
Affected area: {{ rarity.radius }}
Summoned at TC
Can be placed anywhere on the map
Only usable while on a quest


Scrawl-canvas v8
- DOM test 005
DOM tween stress test
Click on star field to add more stars
Test purpose
Create and run many tweens/tickers, each associated with a single stack element
Test to see how many tweens a browser can run at a reasonable speed
Touch test:
should work as expected
Annotated code


Persea Americanas
A story and profile page of a KU Undergrad fruit.
Everywhere I look I see it. And it terrifies me.
The flashes of crimson and blue feathers. The shine
of that yellow beak. I wake up in the middle of the
night in a puddle of sweat, trembling, fearing the
next time I'll have to face it. Unable to clear my
mind of the last encounter witht the beast. The ravenous
claws ripping into my best friend, spilling his guts
everywhere. Twas that fateful day that my innocence was
stolen and my breakfast ruined.
It started how many of my days started.  I was next to my best friend Andy chatting
about the political situation between Israel and Palestine
when suddenly the monster appears. Attached to this odd monkey's
chest, this large bird stands. Its presence dominates the room.
I can only assume that the horrific bird was controlling the
monkey's actions. This crimson and blue hawk commanded it's
sapien underling to grab Andy. I tried to hold him down but
my effort was futile. Andy was already hundreds of feet off of
the ground. There was nothing I could do. I had to sit and watch
as the monkey laid and strapped Andy to this massive white table,
letting out a scream as a massive metal blade sunk through Andy's
torso. Then the monkey proceeded to twist and pull Andy in half, laying
one side of his body back onto the white table. In the other half
was Andy's brain, and with a quick flick of the wrist, the metal
blade was plunged right into his grey mater. As the blade was lifted
the brain followed. And as if killing and removing the brain of my
dear friend wasn't enough, the hawk then commanded to have Andy's
body dismembered. Slivers of his flesh were layed upon a piece of warm
toast, and all that was left could only be described as delicous.


{% extends "bats/layout.html" %} {% block page_title %} Activity {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} {{formData | safe}} What do you need to do? What do you need to do? Capture bats Disturb bats Move bats Damage breeding sites Destroy breeding sites Damage resting sites Destroy resting sites {% endblock %}


This plot is created by
somalier.
It provides a quick view of depth across each chromosome. Because there can be so
many points, it does not draw points around a normalized depth of 1. As a result,
only regions and points with a depth outside of the expected ranges will be shown
these are potential deletions or duplications


This is an error message. Extra long text used as an error message. Cozy Compact Condensed
Name Secret Code
Products Clear


Hello there, we know that you are knew here and we to make your Journey as simple as possible 🚑.
Lorem ipsum...
Lorem ipsum


--- layout: default title: User Activity permalink: /users-activity ---
Using license shows how many GitHub Enterprise licenses were used at a given date.
Pushing commits corresponds to how many different people pushed commits to the appliance in the last four weeks, week, or day.
The gap to using license indicates the number of people who didn’t log in or push code (for example, people who only read or comment code).


The problem that was meant to be easy would have to be when we were doing the grade books challenges, for the longest time a part of my code wasn't working because it didn’t recognise the name of a few student’s, even though they were created in the code, so what happened?
How was it fixed | What techniques did I use to help?The problem was that they were at the end of the code, this is a problem because the program reads from top to bottom so making it do a certain action when it couldn’t find the people up to that point spits back an error, where it couldn’t recognise the students name. Granted this was after many hours of coding running through this week's sprint my brain had been fried and turned to mush by this point, and had pretty bad tunnel vision.
After taking a bit of time away from the screen making food, coffee and relax, coming back to the problem and looking at it with a new set of eyes, took time looking through the error messages, then looking through my code, taking time to talk through each step. After slowing down it hit me like a ton of bricks… After moving all the names to the top of the program everything started to work!! All the names were recognized and the program started to make some head room in completing some of the challenges.
What did I learn?What I learnt was that sometimes you have to take a breather away and know when you are at your limit, we aren't machines and the longer we go without taking a breather and learning to slow down, and read though everything step by step. Without this it makes even the smallest problems difficult, frustrating or outright impossible to do at the time.
This would be the last Scooby Doo challenge, we had to find what door Scooby was hiding behind and figure out a way for the program to search through it and find him! On paper it seems pretty basic, but in practice not so much, many hours and few hairs pulled out it was solved, and in such a satisfying way too!
How was it fixed | What techniques did I use to help?After giving up trying to do it myself, I turned to my partner who is a programmer and asked her for help, showing here and explaining the problem to her, she had given me advice on just sitting and looking over the documentation on how to use the .find() function then come back and ask for help. After reading the documentation on how it works, watching a video on how to put it into practice, I started to feel confident on how to use it to find the sneaky scooby.
So what is so satisfying and elegant about it? Just imagine after spending hours on a problem that you just can't solve after doing your research, seeing the multiple tabs open on your browser, you're able to fix it within minutes!!! Instead of creating a large complicated thing, it was done in 2 lines and without problems, after seeing the red erros spit out turn to the glorious WHOO HOO your done has never felt so great.
What was learnt?Learnt that it is very important to reach out for help when it is needed, nothing wrong with swallowing your ego and being able to put your hand up for help, it's a great way in learning something you otherwise wouldn’t be able to, aslo learning to google and read documentation is a must! All the information is out there it’s learning how to access it and understand it.Though I didn’t mention it console log is an amazing helper, being able to see what the program is doing gives you a lot of insight in what it is doing, and gives you a good idea on what to search for when you are stuck.


Projects
Tuesday, 22 January: Project 1: Housing Price Prediction - Warm-up, predictions from data
Tuesday, 5 February: Project 2: Housing market predictions - Causality
Friday, 22 February (3:59pm): Project 3: Matchmaker, matchmaker - Centralized resource allocation (Kidney Exchange)
Thursday, 28 March: Project 4: Online Auction Overture - Auction strategies
Final Project
Thursday, 11 April: Final Project Proposal (8:59pm)
week of 15 April: Project Team Meetings
Tuesday, 30 April: Final Project Presentation (in class)
Monday, 6 May: Final Project Reports Due (4:59pm)
Classes
15 January: Class 1: Introduction
17 January: Class 2: Does Cancer Cause Smoking?
22 January: Class 3: Statistical Learning Theory
24 January: Class 4: Empirical Risk Minimization
29 January: Class 5: Causal Inference
31 January: Class 6: Finding False Findings (Experiments)
05 February: Class 7: Stable Matchings
07 February: Class 8: Centralized Resource Allocation
12 February: Class 9: Linear Programming
14 February: Class 10: Introduction to Game Theory
19 February: Class 11: Incomplete Infomration Games
21 February: Class 12: Imperfect Information Games
26 February: Class 13: Auctioning Air
28 February: Class 14: Auction Theory
04 March: Class 15: Online Advertising
06 March: Class 16: Auctions with Integrity
19 March: Class 17: Algorithmic Mechanism Design
21 March: Class 18: Hardness of Auctions
26 March: Class 19: Mechanism Design
28 March: Class 20: Mechanism Design
02 April: Class 21: Economics of Information
04 April: Class 22: Visit from Joeseph Calandrino, Research Director, Federal Trade Commission
09 April: Class 23: Project Discussion
11 April: Class 24: Privacy
16 April: Class 25: Privacy and Incentives
18 April: Class 26: Project Progress Meetings
23 April: Class 27: Cryptocurrency
25 April: Class 28: Information and Crime
30 April: Project Presentations


|
{{$index}}.{{lane.name}}
{{$index}}.{{task.name}}
|
task manager for hackers, simple and elegant. If you're tired of touching mouse again and again for managing your tasks, then this is for you. Head over to github for more information.
Create
Update
Delete
and Read on the page
Allowed expressions for tasks
type x to close this


{% extends "layout.html" %} {% block content %}
This is an application that allows users to sign in or sign up and post one minute pitches.It also allows the to upvote and downvote on different pitches.
Comment on the different pitches posted py other uses.
See the pitches posted by other uses.
Vote on s pitch they have viwed by giving it a upvote or a downvote.
Register to be allowed to log in to the application
View pitches from the different categories.
Submit a pitch to a specific category of their choice.


New covered family friendly Ice Rink!
- The new covered ice rink will allow skaters to enjoy an outdoor skating experience whatever the weather
- Accessible skating for all
- Penguin skating stabilisers available for budding skaters
- Skate tuition over a four week group course or individual lessons
- Quick Stop refreshments counter at the Dolomites Café
Children
Children aged 12 years and under must be accompanied at the Ice Cube by an adult (aged 18 or over) at all times. Children aged 8 years and under must be accompanied on the ice by an adult.
Skate sessions
Skaters should arrive up to 30 minutes before the session starts to allow time to get ready, make themselves aware of the Ice Rink Rules, and follow any instructions given by the ice marshals. Further skate information can be found in the related pages section. Sessions are based on 45 minutes of skating time starting at the following times:
| Monday – Friday (except Leeds School Half Term holiday, Fri 13 – Fri 17 February) | ||
|---|---|---|
| 12noon – 12.45pm | 1pm – 1.45pm | 3pm – 3.45pm |
| 4pm – 4.45pm | 5pm – 5.45pm | 6pm – 6.45pm |
| 7pm – 7.45pm | 4pm – 4.45pm | 9pm – 9.45pm (Friday only) |
| Saturday, Sunday & Leeds School Half Term holiday (Fri 13 - Fri 17 February) | ||
|---|---|---|
| 10am - 10.45am* | 11am – 11.45pm | 12noon – 12.45pm |
| 1pm – 1.45pm | 2pm – 2.45pm | 3pm – 3.45pm |
| 4pm – 4.45pm | 5pm – 5.45pm | 6pm – 6.45pm |
| 7pm – 7.45pm | 8pm – 8.45pm (excluding Sundays) | 9pm – 9.45pm (Friday & Saturday only) |
Learn to skate
Four week group tuition skate programme
A four week course of group skating lessons is available to book in advance, for skaters of all abilities (aged 5 and above with a minimum shoe size of child’s 8).
Times: 9.00am to 9:45am every Saturday or Sunday for 4 consecutive weeks commencing Saturday 28 January / Sunday 29 January 2017
Price: £76
This includes all four group lessons, hire of skates, locker and helmet on request, as well as a free skate in the public session immediately after each lesson, and a certificate to the level of proficiency reached.
Individual Skating Lessons
You can also book a 15 minute individual skating lesson with a qualified coach and skate for the rest of the session it takes place within.
Times:
The following tuition slots are available each Saturday and Sunday morning within the 10.00 – 10.45 skate session:
10.00am to 10.15am
10.25am to 10.40am
The following tuition slots are available each Saturday and Sunday morning within the 11.00 – 11.45 skate session:
11.00am to 11.15am
11.25am to 11.40am
Price: £16
This includes free boot hire and free skate for the public skating session in which the lesson takes place.
Booking
Booking early is recommended, but all bookings for the four week course must be made before Friday 27 January 2017.
By telephone (£1 booking fee applies) from City Centre Box Office on 0113 376 0318 (Monday to Saturday between 10am to 6pm).
In person from the City Centre Box Office in Leeds Town Hall, The Headrow, LS1 3AD (opening times as above).
Tickets must be collected in person from the City Centre Box Office, Leeds Town Hall in advance (please note box office timings above) and presented on arrival for tuition at the rink marquee.
Tickets are non-refundable and their purchase signifies an agreement and acceptance of the Venue Conditions.
Accessible skating
A concession price is available to those who are registered disabled (proof may be required) and this ticket includes access for a Personal Assistant / Companion. Wheelchair users can access the rink in their own wheelchairs, and should be accompanied on ice by a responsible skater. Disabled users can book for any session although if a quieter session may be more appropriate (where more space is available), then please note these run at the following times:
Saturday, Sunday & Leeds School Half Term holiday (Fri 10 - Fri 17 February): 10.am to 10.45am
Monday – Friday (except Leeds School Half Term holiday, Fri 10 – Fri 17 February): 12 noon to 12.45pm, 1.00pm to 1.45pm, 3.00pm to 3.45pm
A dedicated accessible skating session is held every Thursday from 10.00am.
Booking
Online
By telephone on on 0843 208 1841 9:30am to 8pm Mon - Sat, 10am to 8pm Sun
In person from the Event Ticket Office on Millennium Square from 27 January
We recommend that you buy tickets for the dedicated accessible skating sessions in advance to avoid disappointment.


Online Portfolio
Michael Bickley
Scroll ▼CDFA Survey Map
Ohio
Part of Public Participation coursework, this project consisted initially of a census of Ohio government officials to determine what issues were facing communities in Ohio to allow the CDFA to better serve their purpose.
This is part of our final analysis, an interactive map to plot the results of the survey. It's a custom GIS solution to track responses in a generalized format, anonymized to a county level. Dedicated efforts were made to ensure cross-browswer performance.
Our City: Columbus
Columbus, Ohio
Given a week to come up with a proposal for an app to facilitate an aspect of public engagement. This project was for a stripped-down SimCity-alike to gather ideas from the public on vacant sites and parking lots.
This is a custom-mock up of the app with limited functionality intended to demonstrate how it might work.
TMACOG Resiliency Study
Toledo, Ohio
Toledo is one of the Rust Belt's minor cities, but equally crippled from the economic transition that moved industry away from the area. However, it has proven successful in reviving a fledgling industry in solar energy and reorganizing transportation networks. The regional development organization was the subject of this investigation.
Though this lacks any significant technical work, it was prototyped in a new style with a presentation tool currently under development.
Cleveland Economic Evaluation
Cleveland, Ohio
Economic development in Cleveland has been an ongoing issue and in the interest of evaluating the resiliency of new reforms and redevelopment attempts.
Highlighted here is an interesting presentation interface, simple and effectively allowing navigation between the various components of the presentation.
Near South Side Safety Report
Parsons Ave, Columbus
The near south side of Columbus was the focus of a project studying crime and safety issues in low income urban areas in Columbus. The Parsons Avenue area was the focus of a study of crime patterns.
This is the status of the project partway through our investigation, highlighted as a fairly successful interface prototype; the earliest of such endeavors.


|
Dear Prof. Knuth, Toward the end of your most recent Christmas lecture, you presented the following conjecture, sent to you by Bill Gosper, which you showed to be true to at least 1000 decimal digits: Here's a proof which makes use of the following three prior results: |
|
| (a) | Euler's reflection formula for the gamma function (for non-integer z): |
| (b) | The Legendre duplication formula for the gamma function: |
| (c) | The following expression which can be derived from the multiple-angle formula for sin(5x) that uses the Chebyshev polynomial of the first kind (see http://mathworld.wolfram.com /TrigonometryAnglesPi5.html which uses equation 18 from http://mathworld.wolfram.com /Multiple-AngleFormulas.html): |
| (1) | Applying (a) (for z=1/5) followed by (c), we get |
| (2) | Applying (b) for z=3/10 and z=1/10, we get and Therefore: |
| (3) | Substituting the result from step 2 into step 1, we get |
| (4) | Dividing both sides by and squaring both sides, we get |
| (5) | After multiplying both sides by and simplifying, we're done: |


Math Mania Introduction
Welcome to Math Mania !
Math Mania is a simple boardgame that also assesses your basic arithmetic skills. Play this game for fun with your friends, at work, or anywhere at all.
Game Instructions
- The total game duration is 2 minutes.
- Roll the dice to begin the game.
- Choose the correct answer to move ahead in the game.
- Every correct answer allows you to progress ahead in the game.
- Every incorrect answer decrements the attempts left.
- There are 20 levels to clear in 2 minutes.
- You only have 3 chances to finish the game.
So what are you waiting for? Let's get started !
Warning: This game is freakishly addictive. Ask the developer about it!
Math Mania Game Grid
0
1
2
3
4
5
19
Time:
120
Chances:
3
6
18
7
17
8
16
Click Roll To Begin
9
15
14
13
12
11
10
Victory Message Section
Yay! You Won!
Congratulations! Have a go at it one more time!
Try Again Message
Awwww! Sad Monkey is sad for you.
Why don't you try again?


Home
About
Pricing
Redeem
Pricing Tiers
Overall description. Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore obcaecati amet vel ipsum, corporis. Aut sapiente eum dolores, id reiciendis.
Free
$0
/month
Storage
10 units
Speed
slow
Support
none
Discount
none
Sign Up
Student
$15
/month
Storage
15 units
Speed
slow
Support
yes
Discount
$1
Purchase
Professional
$50
/month
Storage
100 units
Speed
fastest
Support
24/7
Discount
$5
Purchase
Product Name


|
2DGameSDK
1.0
2D Game Engine in C++ based on SFML
|
Camera that follows the player but never exits the world bounds. More...
#include <BoundedFollowCameraController.h>
Public Member Functions | |
| BoundedFollowCameraController (GameBase *game, Entity *entity, bool enableRotation=false) | |
| Constructs a new Bounded Follow Camera Controller. More... | |
| virtual sf::Vector2f | GetBounds () |
| Retreives the camera Bounds. More... | |
| virtual void | SetZoom (float zoom) |
| Sets the Zoom. More... | |
| virtual void | SetCenter (sf::Vector2f center) |
| Sets the Center. More... | |
| virtual void | OnTick () |
| Updates the Camera Controller. More... | |
| virtual sf::View | GetView () |
| Retreives the current View. More... | |
| Public Member Functions inherited from game::CameraController | |
| CameraController (GameBase *game) | |
| Constructs a new Camera Controller. More... | |
| virtual | ~CameraController () |
| Destroys the Camera Controller. More... | |
Additional Inherited Members | |
| Protected Member Functions inherited from game::CameraController | |
| GameBase * | getGame () |
Camera that follows the player but never exits the world bounds.
| game::BoundedFollowCameraController::BoundedFollowCameraController | ( | GameBase * | game, |
| Entity * | entity, | ||
| bool | enableRotation = false |
||
| ) |
Constructs a new Bounded Follow Camera Controller.
| game | the game |
| entity | the entity to follow |
| enableRotation | wether rotation should be adapted |
|
virtual |
Retreives the camera Bounds.
Implements game::CameraController.
|
virtual |
|
virtual |
Updates the Camera Controller.
Implements game::CameraController.
|
virtual |
|
virtual |


The Workout
Classes are suitable for every body from beginners or more advanced students, with variations and challenges to suit you.
Barre works your entire body—giving particular attention to the lesser-used muscles—resulting in a total body toning effect. You will feel muscles you never knew existed!
It’s fun; you will soon fitter, healthier, and maybe even a little happier too…at the end of your workout.


Reports interfaces whose names are either too short, too long, or do not follow
the specified regular expression pattern.
Use the fields below to specify minimum length, maximum length and regular expression expected for interface names.
(Regular expressions are in standard java.util.regex format.)


| CCB, et al. |
Bank of America |
2000 |
http://lflegal.com/2000/03... |
| NFB |
HDVest, Intuit, HR& Block, Gilman & Ciocia |
2000 |
http://www.ct.gov/AG... |
| NFB |
AOL |
2000 |
http://www.bc.edu/dam... |
| Bay State Council of the Blind |
Fleet Bank |
2001 |
http://lflegal.com/2001/02.../ |
| CCB, Florida Council of the Blind |
Washington Mutual |
2002 |
http://lflegal.com/2002/01... |
| Martin |
MARTA |
2002 |
http://www.sedbtac.org... |
| Bay State Council of the Blind |
Sovereign Bank |
2002 |
http://lflegal.com/2002/11... |
| NFB Pennsylvania |
First Union |
2003 |
http://lflegal.com/2003/01... |
| NY AG |
Ramada Inn & Priceline |
2004 |
http://www.ag.ny.gov/... |
| Access Now, Gumson, et al |
Southwest Airlines |
2004 |
http://www.icdri.org... |
| ACB |
La Salle |
2005 |
http://lflegal.com/2005/05... |
| NFB |
Target |
2006 |
http://www.nfb.org/nfb/NewsBot.asp? MODE=VIEW&ID=357 |
| La Marca |
Capella |
2006 |
http://chronicle.com... |
| Latif |
Project Management Institute |
2006 |
http://www.out-law.com/page-7692 |
| NFB |
State of Texas |
2007 |
http://www.nfb.org/nfb/NewsBot.asp? MODE=VIEW&ID=140 |
| NFB |
Amazon |
2007 |
http://www.icdri.org... |
| ACB, AFB, CCB |
Radio Shack |
2007 |
http://lflegal.com/2007/05... |
| Pierc, Byrne |
Bank One |
2008 |
http://lflegal.com/2003/06.../ |
| ACB, CCB |
Experian/ Equifax/ TransUnion |
2008 |
http://lflegal.com/2008/04... |
| Thompson |
Sutter Health |
2008 |
http://www.sutterhealth.org... |
| ACB, AFB, CCB |
Rite Aid |
2008 |
http://lflegal.com/2008/04... |
| Smith, Lewkowicz |
Expedia.com, Hotels.com |
2009 |
http://www.internetretailer.com/2009/01/27... |
| NFB |
LSAC |
2009 |
http://www.law.com... |
| ACB, AFB, CCB |
Staples |
2009 |
http://lflegal.com/2009/04... |
| NFB, ACB |
Arizona State/ Princeton, Reed, Pace, Darden School of
Business and Case Western |
2009 |
http://www.nfb.org/nfb/NewsBot.asp? MODE=VIEW&ID=449 |
| ACB, AFB, CCB |
CVS Caremark |
2009 |
http://lflegal.com/2009/07... |
| NFB |
SBA |
2009 |
http://www.icdri.org/Press/NFB_SBA09.htm |
| US DoJ |
City of Port St. Lucie, FL |
2009 |
http://www.ada.gov... |
| NFB |
SSA |
2009 |
http://www.nfb.org/nfb/NewsBot.asp? MODE=VIEW&ID=463&SnID=24278539 |
| State of NY |
HSBC |
2009 |
http://www.ag.ny.gov... |
| NFB |
Dept. of Ed |
2009 |
http://www.reuters.com... |
| CCB |
Jet Blue Airways |
2010 |
http://lflegal.com/2010/10... |
| NFB |
Penn State University |
2010 |
http://www.nfb.org/nfb/NewsBot.asp? MODE=VIEW&ID=702 |
| ACB |
American Cancer Society |
2011 |
http://lflegal.com/2011/02... |
| NFB |
Disney |
2011 |
http://www.prweb.com/releases/2011/02... |
| ACB, CCB, Bay State Council of the Blind |
MLB |
2011 |
http://lflegal.com/2010/02... |
| Cullen |
Netflix |
2011 |
http://www.doncullen.net... [PDF] |
| NFB |
New York University (NYU) |
2011 |
http://www.nfb.org/NewsBot.asp? MODE=VIEW&ID=771 |
| NFB |
Northwestern University |
2011 |
http://www.nfb.org/NewsBot.asp? MODE=VIEW&ID=771 |
| NFB |
Montgomery County MD |
2011 |
http://www.nfb.org/NewsBot.asp? MODE=VIEW&ID=793&SnID=432951688 |
| NFB |
Florida State University |
2012 |
http://nfb.org/node/931 |
| NFB/ Sebastian Ibanez |
Maricopa Community College District |
2012 |
http://finance.yahoo.com/news... |
| Donna Jodhan |
Government of Canada |
2012 |
http://www.winnipegfreepress.com... |


xscreensaver-command(1) XScreenSaver manual xscreensaver-command(1) NAME xscreensaver-command - control a running xscreensaver process SYNOPSIS xscreensaver-command [-display host:display.screen] [-help | -demo | -prefs | -activate | -deactivate | -cycle | -next | -prev | -select n | -exit | -restart | -lock | -version | -time | -watch] DESCRIPTION The xscreensaver-command program controls a running xscreensaver process by sending it client-messages. xscreensaver(1) has a client-server model: the xscreensaver process is a daemon that runs in the background; it is controlled by other foreground programs such as xscreensaver-command and xscreensaver-demo(1). This program, xscreensaver-command, is a command-line-oriented tool; the xscreensaver-demo(1). program is a graphical tool. OPTIONS xscreensaver-command accepts the following command-line options: -help Prints a brief summary of command-line options. -demo This just launches the xscreensaver-demo(1) program, in which one can experiment with the various graphics hacks available, and edit parameters. -demo number When the -demo option is followed by an integer, it instructs the xscreensaver daemon to run that hack, and wait for the user to click the mouse before deactivating (i.e., mouse motion does not deactivate.) This is the mechanism by which xscreensaver-demo(1) communicates with the xscreensaver(1) daemon. (The first hack in the list is numbered 1, not 0.) -prefs Like the no-argument form of -demo, but brings up that program's Preferences panel by default. -activate Tell xscreensaver to turn on immediately (that is, blank the screen, as if the user had been idle for long enough.) The screensaver will deactivate as soon as there is any user activ‐ ity, as usual. It is useful to run this from a menu; you may wish to run it as sleep 5 ; xscreensaver-command -activate to be sure that you have time to take your hand off the mouse before the screensaver comes on. (Because if you jiggle the mouse, xscreensaver will notice, and deactivate.) -deactivate This tells xscreensaver to pretend that there has just been user activity. This means that if the screensaver is active (the screen is blanked), then this command will cause the screen to un-blank as if there had been keyboard or mouse activity. If the screen is locked, then the password dialog will pop up first, as usual. If the screen is not blanked, then this simulated user activity will re-start the countdown (so, issuing the -deactivate command periodically is one way to prevent the screen from blank‐ ing.) -cycle If the screensaver is active (the screen is blanked), then stop the current graphics demo and run a new one (chosen randomly.) -next This is like either -activate or -cycle, depending on which is more appropriate, except that the graphics hack that will be run is the next one in the list, instead of a randomly-chosen one. In other words, repeatedly executing -next will cause the xscreensaver process to invoke each graphics demo sequentially. (Though using the -demo option is probably an easier way to accomplish that.) -prev This is like -next, but cycles in the other direction. -select number Like -activate, but runs the Nth element in the list of hacks. By knowing what is in the programs list, and in what order, you can use this to activate the screensaver with a particular graph‐ ics demo. (The first element in the list is numbered 1, not 0.) -exit Causes the xscreensaver process to exit gracefully. This does nothing if the display is currently locked. Warning: never use kill -9 with xscreensaver while the screen‐ saver is active. If you are using a virtual root window manager, that can leave things in an inconsistent state, and you may need to restart your window manager to repair the damage. -lock Tells the running xscreensaver process to lock the screen immedi‐ ately. This is like -activate, but forces locking as well, even if locking is not the default (that is, even if xscreensaver's lock resource is false, and even if the lockTimeout resource is non-zero.) Note that locking doesn't work unless the xscreensaver process is running as you. See xscreensaver(1) for details. -version Prints the version of xscreensaver that is currently running on the display: that is, the actual version number of the running xscreensaver background process, rather than the version number of xscreensaver-command. (To see the version number of xscreen‐ saver-command itself, use the -help option.) -time Prints the time at which the screensaver last activated or deac‐ tivated (roughly, how long the user has been idle or non-idle: but not quite, since it only tells you when the screen became blanked or un-blanked.) -restart Causes the screensaver process to exit and then restart with the same command line arguments as last time. You shouldn't really need to do this, since xscreensaver notices when the .xscreen‐ saver file has changed and re-reads it as needed. -watch Prints a line each time the screensaver changes state: when the screen blanks, locks, unblanks, or when the running hack is changed. This option never returns; it is intended for use by shell scripts that want to react to the screensaver in some way. An example of its output would be: BLANK Fri Nov 5 01:57:22 1999 RUN 34 RUN 79 RUN 16 LOCK Fri Nov 5 01:57:22 1999 RUN 76 RUN 12 UNBLANK Fri Nov 5 02:05:59 1999 The above shows the screensaver activating, running three differ‐ ent hacks, then locking (perhaps because the lock-timeout went off) then unblanking (because the user became active, and typed the correct password.) The hack numbers are their index in the `programs' list (starting with 1, not 0, as for the -select com‐ mand.) For example, suppose you want to run a program that turns down the volume on your machine when the screen blanks, and turns it back up when the screen un-blanks. You could do that by running a Perl program like the following in the background. The follow‐ ing program tracks the output of the -watch command and reacts accordingly: #!/usr/bin/perl my $blanked = 0; open (IN, "xscreensaver-command -watch |"); while (<IN>) { if (m/^(BLANK|LOCK)/) { if (!$blanked) { system "sound-off"; $blanked = 1; } } elsif (m/^UNBLANK/) { system "sound-on"; $blanked = 0; } } Note that LOCK might come either with or without a preceding BLANK (depending on whether the lock-timeout is non-zero), so the above program keeps track of both of them. STOPPING GRAPHICS If xscreensaver is running, but you want it to stop running screen hacks (e.g., if you are logged in remotely, and you want the console to remain locked but just be black, with no graphics processes running) you can accomplish that by simply powering down the monitor remotely. In a minute or so, xscreensaver will notice that the monitor is off, and will stop running screen hacks. You can power off the monitor like so: xset dpms force off See the xset(1) manual for more info. You can also use xscreensaver-demo(1) to make the monitor power down after a few hours, meaning that xscreensaver will run graphics until it has been idle for the length of time you specified; and after that, the monitor will power off, and screen hacks will stop being run. DIAGNOSTICS If an error occurs while communicating with the xscreensaver daemon, or if the daemon reports an error, a diagnostic message will be printed to stderr, and xscreensaver-command will exit with a non-zero value. If the command is accepted, an indication of this will be printed to stdout, and the exit value will be zero. ENVIRONMENT DISPLAY to get the host and display number of the screen whose saver is to be manipulated. PATH to find the executable to restart (for the -restart command). Note that this variable is consulted in the environment of the xscreensaver process, not the xscreensaver-command process. UPGRADES The latest version of xscreensaver(1) and related tools can always be found at http://www.jwz.org/xscreensaver/ SEE ALSO X(1), xscreensaver(1), xscreensaver-demo(1), xset(1) COPYRIGHT Copyright © 1992, 1993, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 by Jamie Zawinski. Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. No representations are made about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty. AUTHOR Jamie Zawinski<EMAIL_ADDRESS>13-aug-92. Please let me know if you find any bugs or make any improvements. X Version 11 5.15 (28-Sep-2011) xscreensaver-command(1)


TmafManagerLoader class overview
Properties
Name
Description
AutoLoad
Causes the component to load automatically the manager and connects to them
DataLoadMethod
Defines from where the component loads the information about the manager to be loaded
INISettings
Settings for the INI file if it is chosen in DataLoadMethod
Manager
List of manager names to load
ManagerLoaderOptions
Defines the loader options
ManagerSubDirectory
Defines the manager sub directory
RegistrySettings
Settings for the registry if it is chosen in DataLoadMethod
Methods
AddManager
Adds a manager.
DeleteManager
Deletes a manager.
ConnectManager
Connects to all manager registered.
DisconnectManager
Disconnects from all manager loaded.
Events
AfterConnect
Fired after connecting to a manager.
BeforeConnect
Fired before connecting to a manager.
BeforeLoadingManager
Fired before starting to load all registered manager.
OnConnect
Fired when connected to a manager successfully.
OnDataLoad
Fired for every registered manager when DataLoadMethod is set to dlmUserdefined.
OnDisconnect
Fired when disconnecting from a manager.
OnLoadingFinished
Fired when all registered manager are loaded.
OnLoadManagerError
Fired when the loading of a manager fails.


Create Blog Post
Read Blog Post
Update Blog Post
Delete Blog Post
Title
Info
Description
Article
Create
ID
Title
Info
Description
Article
Update
ID
Delete


Application infomations
Rule for autoscaling
| ID | Metric | Upper threshold | Lower threshold | Instances out | Instances in | Scale up wait | Scale down wait | Active | Edit | Delete | |
|---|---|---|---|---|---|---|---|---|---|---|---|
| {{policy.id}} | {{policy.metric_type}} | {{policy.upper_threshold}} | {{policy.lower_threshold}} | {{policy.instances_out}} | {{policy.instances_in}} | {{policy.scale_up_wait}} | {{policy.scale_down_wait}} |
|


OPENSSL_s390xcap - the IBM z processor capabilities vector
env OPENSSL_s390xcap=... <application>
libcrypto supports z/Architecture instruction set extensions. These extensions are denoted by individual bits in the capabilities vector. When libcrypto is initialized, the bits returned by the STFLE instruction and by the QUERY functions are stored in the vector.
To change the set of instructions available to an application, you can set the OPENSSL_s390xcap environment variable before you start the application. After initialization, the capability vector is ANDed bitwise with a mask which is derived from the environment variable.
The environment variable is a semicolon-separated list of tokens which is processed from left to right (whitespace is ignored):
OPENSSL_s390xcap="<tok1>;<tok2>;..."
There are three types of tokens:
The name of a processor generation. A bit in the environment variable's mask is set to one if and only if the specified processor generation implements the corresponding instruction set extension. Possible values are z900, z990, z9, z10, z196, zEC12, z13, z14, z15, and z16.
The name of an instruction followed by two 64-bit masks. The part of the environment variable's mask corresponding to the specified instruction is set to the specified 128-bit mask. Possible values are kimd, klmd, km, kmc, kmac, kmctr, kmo, kmf, prno, kma, pcc and kdsa.
Store-facility-list-extended (stfle) followed by three 64-bit masks. The part of the environment variable's mask corresponding to the stfle instruction is set to the specified 192-bit mask.
The 64-bit masks are specified in hexadecimal notation. The 0x prefix is optional. Prefix a mask with a tilde, ~
, to denote a bitwise NOT operation.
The following is a list of significant bits for each instruction. Colon rows separate the individual 64-bit masks. The bit numbers in the first column are consistent with [1], that is, 0 denotes the leftmost bit and the numbering is continuous across 64-bit mask boundaries.
Bit Mask Facility/Function
stfle:
# 17 1<<46 message-security assist
# 25 1<<38 store-clock-fast facility
:
# 76 1<<51 message-security assist extension 3
# 77 1<<50 message-security assist extension 4
:
#129 1<<62 vector facility
#134 1<<57 vector packed decimal facility
#135 1<<56 vector enhancements facility 1
#146 1<<45 message-security assist extension 8
#155 1<<36 message-security assist extension 9
kimd :
# 1 1<<62 KIMD-SHA-1
# 2 1<<61 KIMD-SHA-256
# 3 1<<60 KIMD-SHA-512
# 32 1<<31 KIMD-SHA3-224
# 33 1<<30 KIMD-SHA3-256
# 34 1<<29 KIMD-SHA3-384
# 35 1<<28 KIMD-SHA3-512
# 36 1<<27 KIMD-SHAKE-128
# 37 1<<26 KIMD-SHAKE-256
:
# 65 1<<62 KIMD-GHASH
klmd :
# 32 1<<31 KLMD-SHA3-224
# 33 1<<30 KLMD-SHA3-256
# 34 1<<29 KLMD-SHA3-384
# 35 1<<28 KLMD-SHA3-512
# 36 1<<27 KLMD-SHAKE-128
# 37 1<<26 KLMD-SHAKE-256
:
km :
# 18 1<<45 KM-AES-128
# 19 1<<44 KM-AES-192
# 20 1<<43 KM-AES-256
# 50 1<<13 KM-XTS-AES-128
# 52 1<<11 KM-XTS-AES-256
:
kmc :
# 18 1<<45 KMC-AES-128
# 19 1<<44 KMC-AES-192
# 20 1<<43 KMC-AES-256
:
kmac :
# 18 1<<45 KMAC-AES-128
# 19 1<<44 KMAC-AES-192
# 20 1<<43 KMAC-AES-256
:
kmctr:
:
kmo :
# 18 1<<45 KMO-AES-128
# 19 1<<44 KMO-AES-192
# 20 1<<43 KMO-AES-256
:
kmf :
# 18 1<<45 KMF-AES-128
# 19 1<<44 KMF-AES-192
# 20 1<<43 KMF-AES-256
:
prno :
:
kma :
# 18 1<<45 KMA-GCM-AES-128
# 19 1<<44 KMA-GCM-AES-192
# 20 1<<43 KMA-GCM-AES-256
:
pcc :
:
# 64 1<<63 PCC-Scalar-Multiply-P256
# 65 1<<62 PCC-Scalar-Multiply-P384
# 66 1<<61 PCC-Scalar-Multiply-P521
# 72 1<<55 PCC-Scalar-Multiply-Ed25519
# 73 1<<54 PCC-Scalar-Multiply-Ed448
# 80 1<<47 PCC-Scalar-Multiply-X25519
# 81 1<<46 PCC-Scalar-Multiply-X448
kdsa :
# 1 1<<62 KDSA-ECDSA-Verify-P256
# 2 1<<61 KDSA-ECDSA-Verify-P384
# 3 1<<60 KDSA-ECDSA-Verify-P521
# 9 1<<54 KDSA-ECDSA-Sign-P256
# 10 1<<53 KDSA-ECDSA-Sign-P384
# 11 1<<52 KDSA-ECDSA-Sign-P521
# 32 1<<31 KDSA-EdDSA-Verify-Ed25519
# 36 1<<27 KDSA-EdDSA-Verify-Ed448
# 40 1<<23 KDSA-EdDSA-Sign-Ed25519
# 44 1<<19 KDSA-EdDSA-Sign-Ed448
:
Not available.
Disables all instruction set extensions which the z196 processor does not implement:
OPENSSL_s390xcap="z196"
Disables the vector facility:
OPENSSL_s390xcap="stfle:~0:~0:~0x4000000000000000"
Disables the KM-XTS-AES and the KIMD-SHAKE function codes:
OPENSSL_s390xcap="km:~0x2800:~0;kimd:~0xc000000:~0"
[1] z/Architecture Principles of Operation, SA22-7832-12
Copyright 2018-2022 The OpenSSL Project Authors. All Rights Reserved.
Licensed under the Apache License 2.0 (the "License"). You may not use this file except in compliance with the License. You can obtain a copy in the file LICENSE in the source distribution or at https://www.openssl.org/source/license.html.


Layout Configuration
Layout Name:
Layout Package:
Number of different tile symbols:
Number of tile pairs per symbol type:
Log Out
Layout Configuration
1
2
4
Number of Child Tiles:
Dimensions
X:
Y:


library(RMSTdesign)
We use an example from the literature to demonstrate the use of the study design tools avaiable in the RMSTdesign
package. This example was first presented in a paper by Royston and Parmar.1 They calculated the sample size required for a trial with mean survival time difference as the primary endpoint based on data from the GOG111 trial.2 Survival in the control arm was assumed to be piecewise exponential with survival probabilities at the end of years 1-8 equal to 0.771, 0.523, 0.342, 0.236, 0.172, 0.130, 0.100, 0.078, respectively, and the hazard ratio was assumed constant over time and equal to 0.71.
We can use survdef
to define the survival distributions in the two groups, and plotsurvdef
to plot them. To define gogC
, we specify times
as year 1-8 and surv
as the survival probabilities at those times based on data from the GOG111 trial. This creates a survival distribution stored in gogC
which is piecewise exponential with constant hazard on [0,1), [1,2), [2,3), [3,4), [4,5), [5,6), [6,7), [7,\(\infty\)). To define gogT_PH
, we specify the hazard on the intervals [0,1), [1,2), [2,3), [3,4), [4,5), [5,6), [6,7), [7,\(\infty\)) as 0.71 times the hazard on the same intervals in the gogC
group, or equivalently, the hazard at times 0, 1, 2, 3, 4, 5, 6 and 7, which can be generated in R using the command gogC$h(0:7)
.
gogC<-survdef(times = 1:8, surv=c(.771, .523,.342,.236,.172,.130,.1,.078))
gogT_PH<-survdef(times = 1:7, haz=0.71*gogC$h(0:7))
plotsurvdef(gogC, gogT_PH, xupper = 10)
The accrual period is set to \(k_1\)= 3 years and the followup period to \(k_2\)= 5 years, and the restriction time to \(\tau\)= 7.5 years. We can use RMSTpow
to determine the sample size needed to achieve 90% power with a one-sided type I error level of 0.025 (the default value).
RMSTpow(gogC, gogT_PH, 3, 5, 7.5, power = 0.9)
#> $n
#> [1] 436
#>
#> $powerRMST
#> [1] 0.9009673
#>
#> $powerRMSTToverC
#> [1] 0.9009673
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9032868
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.902935
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 0.9646479
The required sample size is 436. This design proveds a 96% likelihood that the difference in mean survival time is estimable using the Kaplan-Meier estimator, which is reasonable.
RMSTpow
can perform simulations to determine empirical power if we add the option sim=T
. The following code performs 1000 simulations, and uses the tau_star
modification if necessary, which is the default method.
set.seed(51719)
mytest1<-RMSTpow(gogC, gogT_PH, 3, 5, 7.5, power = 0.9, sim = T, M=1000)
#> [1] "Simulating datasets..."
mytest1
#> $n
#> [1] 436
#>
#> $powerRMST
#> [1] 0.9009673
#>
#> $powerRMSTToverC
#> [1] 0.9009673
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9032868
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.902935
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 0.9646479
#>
#> $simout
#> $simout$emppowRMSTToverC
#> [1] 0.897
#>
#> $simout$emppowRMSTCoverT
#> [1] NA
#>
#> $simout$emppowLRToverC
#> [1] 0.846
#>
#> $simout$emppowLRCoverT
#> [1] NA
#>
#> $simout$emppowLRtauToverC
#> [1] 0.843
#>
#> $simout$emppowLRtauCoverT
#> [1] NA
#>
#> $simout$emppKME
#> [1] 0.968
#>
#> $simout$meandiff
#> [1] 0.729433
#>
#> $simout$SDdiff
#> [1] 0.2248616
#>
#> $simout$meantrunc
#> [1] 7.495396
#>
#> $simout$SDtrunc
#> [1] 0.03075082
We see that the empirical power was 89.7%, and empirical probability the unmodified Kaplan-Meier estimator could be used was 0.968. The mean truncation time used in practice was 7.49 years with a standard deviation of 0.03 years.
The sample size estimate presented in Royston and Parmar for this scenario was 461. The disparity between the sample sizes is likely due to different approaches to estimating mean survival time difference and its variance; Royston and Parmar used flexible parametric models.
We may be interested in the trial design with the smallest total sample size, which is achieved when all patients are followed to time \(\tau\). The following code determines the sample size needed for a trial where everyone is followed time time \(\tau\) = 7.5 years:
RMSTpow(gogC, gogT_PH, 0, 7.5, 7.5, power = 0.9)
#> $n
#> [1] 432
#>
#> $powerRMST
#> [1] 0.9007778
#>
#> $powerRMSTToverC
#> [1] 0.9007778
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9116188
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.9116188
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 1
In the trial setting described, the smallest trial with 90% power requires 432 patients. Following all patients until time \(\tau\) offered almost no sample size savings compared to the original administrative censoring scheme. This design provides a 100% chance the mean survival difference will be Kaplan-Meier estimablen, as no patients are censored before time \(\tau\)
Alternatively, we may be interested in the trial with the shortest duration, given a certain accrual rate. If we assume the accrual rate is 145 patients per year, the following code will find the shortest duration trial that achieves 90% power and 95% chance the mean survival difference is Kaplan-Meier estimable at time \(\tau\).
shortest_duration(gogC, gogT_PH, 7.5, .9, 145, pKME = .95)
#> $n
#> [1] 436
#>
#> $k1
#> [1] 3.006897
#>
#> $k2
#> [1] 4.946418
#>
#> $duration
#> [1] 7.953315
#>
#> $powerRMSTToverC
#> [1] 0.900807
#>
#> $powerLRToverC
#> [1] 0.9026688
#>
#> $powerLRtauToverC
#> [1] 0.9023778
#>
#> $pMKE
#> [1] 0.9506881
We see that the shortest duration trial is 7.95 years long. In this example, because \(\tau\)=7.5, the shortest duration trial is not much shorter than the initial trial duration of 8 years.
Finally, we illustrate the use of Table 2 from our paper. In situations where the survival distributions can be approximated with exponential distributions, Table 2 can be used to get rough sample size estimates without a computer. For example, an exponential distribution with rate 0.3339 approximates the control group survival distribution from the GOG111 trial. From Table 2, for 90% power, with an expected hazard ratio of 0.7 (close to the hazard ratio of interest, 0.71), 550 patients are required if \(\tau\) is selected as the 75th percentile of control group survival (4.2 years), and 418 if \(\tau\) is the 90th percentile (6.9 years). These rough estimates are useful to determine whether mean survival time may be a feasible endpoint, and to inform a guess of accrual time, which can then be input in our R-package along with other design parameters to refine the design.
The following code shows how we obtained the rate of 0.3339 and how the same sample sizes could have been obtained using RMSTpow
rather than Table 2. First, we determine the rate parameter of the exponential distribution that approximates the survival curve from the GOG111 trial data by modelling the log survival probabilities as a function of time. Then, we used survdef
to define the control group survival distribution, and the treatment group survival distribution corresponding to a hazard ratio of 0.7. (We are using 0.7 because sample sizes for a hazard ratio of 0.7 are shown in Table 2, and we are trying to match Table 2.) We plot both curves, along with the survival curve we were trying to approximate for the control group (in red).
y <- -log(c(.771, .523,.342,.236,.172,.130,.1,.078))
x<-1:8
lambda<-lm(y~x-1)$coefficients
lambda
#> x
#> 0.3339218
# Use survdef to define the survival distributions in each group
gogCexp<-survdef(haz = lambda)
gogTexp<-survdef(haz=0.7*gogCexp$h(0))
# Plot the two survival distributions. Overlay the originial piecewise exponential control group distribution
plotsurvdef(gogCexp, gogTexp, xupper = 10)
lines(seq(0, 10, .01), gogC$S(seq(0, 10, .01)), col = 'red')
Next, we use the RMSTpow
function to determine the required sample size if \(\tau\) is selected as the 75th percentile of control group survival (4.2 years), and if \(\tau\) is the 90th percentile (6.9 years).
# Show that 6.9 years corresponds to a survival probability of 0.1, and 4.2 corresponds to a survival probability of 0.25:
qexp(0.1, rate = lambda, lower.tail = F)
#> [1] 6.895583
qexp(0.25, rate = lambda, lower.tail = F)
#> [1] 4.151554
# Determine the sample size for each tau, for 90% power, with all patients followed until time tau
RMSTpow(gogCexp, gogTexp, 0, qexp(0.1, rate = lambda, lower.tail = F),
qexp(0.1, rate = lambda, lower.tail = F), power = 0.9)
#> $n
#> [1] 418
#>
#> $powerRMST
#> [1] 0.9007918
#>
#> $powerRMSTToverC
#> [1] 0.9007918
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9192212
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.9192212
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 1
RMSTpow(gogCexp, gogTexp, 0, qexp(0.25, rate = lambda, lower.tail = F),
qexp(0.25, rate = lambda, lower.tail = F), power = 0.9)
#> $n
#> [1] 550
#>
#> $powerRMST
#> [1] 0.9009902
#>
#> $powerRMSTToverC
#> [1] 0.9009902
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9332017
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.9331899
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 1
We see that the numbers obtained match Table 2. If we had instead used a hazard ratio of 0.71, exactly what was observed in the GOG111 trial, the required sample size would have been larger.
gogTexp<-survdef(haz=0.71*gogCexp$h(0))
RMSTpow(gogCexp, gogTexp, 0, qexp(0.1, rate = lambda, lower.tail = F),
qexp(0.1, rate = lambda, lower.tail = F), power = 0.9)
#> $n
#> [1] 452
#>
#> $powerRMST
#> [1] 0.9006922
#>
#> $powerRMSTToverC
#> [1] 0.9006922
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9191693
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.9191693
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 1
RMSTpow(gogCexp, gogTexp, 0, qexp(0.25, rate = lambda, lower.tail = F),
qexp(0.25, rate = lambda, lower.tail = F), power = 0.9)
#> $n
#> [1] 594
#>
#> $powerRMST
#> [1] 0.9008899
#>
#> $powerRMSTToverC
#> [1] 0.9008899
#>
#> $powerRMSTCoverT
#> [1] NA
#>
#> $powerLRToverC
#> [1] 0.9331511
#>
#> $powerLRCoverT
#> [1] NA
#>
#> $powerLRtauToverC
#> [1] 0.9331393
#>
#> $powerLRtauCoverT
#> [1] NA
#>
#> $pKME
#> [1] 1
Royston P and Parmar MK. Restricted mean survival time: an alternative to the hazard ratio for the design and analysis of randomized trials with a time-to-event outcome. BMC Med Res Methodol 2013; 13: 152.↩
McGuire WP, Hoskins WJ, Brady MF, et al. Cyclophosphamide and cisplatin compared with paclitaxel and cisplatin in patients with stage III and stage IV ovarian cancer. N Engl J Med 1996; 334: 1-6.↩


Phantasma is made up of a decentralized network of nodes - also known as Block Producers. These BP's are responsible for validating transactions on the blockchain. The block producers use a rotational scheduling per side-chain to define who the active block producer is. This process occurs in parallel for each side chain, which will allow for horizontal scaling to boost the theoretical TPS of Phantasma Chain. Each block producer is responsible for accepting transactions from Phantasma users, verifying signatures & transaction contents. Once the transaction is accepted, the block producer adds it to the next block
Inflation is important because it incentivizes the growth of the ecosystem. This will inspire developers to build dApps on Phantasma. It also serves the purpose
of helping to fund Phantom Force our decentralized developer team and it also pays our block producers.
The yearly inflation is coded to be 3%. On top of receiving fees for verifying transactions, block producers receive 2% of the annual 3%, or 0.75% per quarter.
The amount of BPs is based on the amount of side chains & transactions. There will be 10 active BP + 150% standby BPs.All active BPs will rotate over all chains, which results that all active BPs will continuously produce a block for every chain. Every BP can also verify multiple chains at the same time. At the end of every quarter there will be a voting window for people to vote on BPs to become (or remain) an active BP to make sure that the network remains decentralized
In order to become a block producer, you must:


Desktop
-
Showcase
Highlights some of qooxdoo's main features and provides a good overview of what can be achieved.
Build | Source (Developer) Open Showcase -
Tutorial
Interactive tutorial app to learn the basics of qooxdoo.
Build | Source (Developer) Open Tutorial -
Widget Browser
Shows the widgets and themes available in qooxdoo Desktop.
Build | Source (Developer) Open Widget Browser -
Demo Browser
Contains many examples and tests for widgets, layouts and other framework functionality.
Build | Source (Developer) Open Demo Browser -
Playground
Explore qooxdoo programming interactively: edit qooxdoo code in one pane, and see the result running in another.
Build | Source (Developer) Open Playground -
Feed Reader
A hybrid application for displaying RSS feeds, available as a RIA, a website-like application, or a mobile application (see respective sections for the latter two). They all share a common code base.
Build | Source (Developer) Open Feed Reader (RIA)
Website
-
Feed Reader
A light-weight, website-oriented version of the Feedreader application.
Build | Source (Developer) Open Feed Reader (website) -
ToDo
A DOM-oriented application using offline and templating functionality.
Source Open ToDo -
Website API Viewer
API reference for the Website component in on document.
Source (Developer) Open API Viewer -
Website Widget Browser
Shows the widgets available in qooxdoo Website.
Build | Source (Developer) Open Widget Browser -
Website Tests
All unit tests for the Website component.
Build Open Test Runner -
Website Lib
The Website library for building light-weight, integrated, low-level components for websites.
As single file:
q-6.0.0-beta.js | q-6.0.0-beta.min.js (compressed) q-6.0.0-beta.js | q-6.0.0-beta.min.js (compressed)[+] As seperate modules (i.e. several files):
- q-core-6.0.0-beta.min.js | min (always needed)
- q-core-6.0.0-beta.js | min
- q-animation-6.0.0-beta.js | min
- q-animation-6.0.0-beta.js | min
- q-blocker-6.0.0-beta.js | min
- q-blocker-6.0.0-beta.js | min
- q-cookie-6.0.0-beta.js | min
- q-cookie-6.0.0-beta.js | min
- q-dataset-6.0.0-beta.js | min
- q-dataset-6.0.0-beta.js | min
- q-dev-6.0.0-beta.js | min
- q-dev-6.0.0-beta.js | min
- q-io-6.0.0-beta.js | min
- q-io-6.0.0-beta.js | min
- q-matchmedia-6.0.0-beta.js | min
- q-matchmedia-6.0.0-beta.js | min
- q-messaging-6.0.0-beta.js | min
- q-messaging-6.0.0-beta.js | min
- q-placeholder-6.0.0-beta.js | min
- q-placeholder-6.0.0-beta.js | min
- q-placement-6.0.0-beta.js | min
- q-placement-6.0.0-beta.js | min
- q-rest-6.0.0-beta.js | min
- q-rest-6.0.0-beta.js | min
- q-storage-6.0.0-beta.js | min
- q-storage-6.0.0-beta.js | min
- q-template-6.0.0-beta.js | min
- q-template-6.0.0-beta.js | min
- q-transform-6.0.0-beta.js | min
- q-transform-6.0.0-beta.js | min
- q-util-6.0.0-beta.js | min
- q-util-6.0.0-beta.js | min
Mobile
Smartphones: Android, iOS, Blackberry 10 OS, Windows Phone 8; Desktop: Safari 5, Chrome 10+, Internet Explorer 10+
-
Mobile Showcase
An experimental showcase for mobile widgets.
Build | Source (Developer) Build -
Feed Reader
The mobile version of the Feedreader application.
Build | Source (Developer) Open Feed Reader (mobile) -
Test Runner
Run the mobile unit tests of the framework in a mobile Test Runner.
Build | Source (Developer) Open Test Runner (mobile)
Server
-
qooxdoo OO Layer
Not a demo, but a compact JS package that encapsulates qooxdoo's OO layer, to be downloaded to add qooxdoo classes and properties to e.g. sparse JS environments like Webworkers, Rhino or node.js. (experimental)
qx-oo-6.0.0-beta.min.js | qx-oo-6.0.0-beta.js (not optimized) qx-oo-6.0.0-beta.min.js | qx-oo-6.0.0-beta.js (not optimized)
Tools
-
API Viewer
Searchable API reference of the entire qooxdoo framework.
Build | Source (Developer) Open API Viewer -
Test Runner
Integrated unit testing framework similar to (but not requiring) JSUnit.
Build | Source (Developer) Open Test Runner
Portable Test Runner
Portable Test Runner


Bulldog
Bulldogs originally were used to drive cattle to market and compete in a bloody sport called bullbaiting.A brief walk and a nap on the sofa is just this dog breed‘s speed.
Read MoreBulldogs originally were used to drive cattle to market and compete in a bloody sport called bullbaiting.A brief walk and a nap on the sofa is just this dog breed‘s speed.
Read MoreLabs have soft mouths, useful for retrieving game; webbed feet for swimming, and thick double coats that protect them from cold water temperatures.
Read MoreIt is usually good with everyone and can be affectionate towards them.It is known to be quiet.
Read Moret is usually good with adults, children (6+), and seniors and can be very affectionate towards them.It is known to be vocal especially at night.
Read MoreThis breed is characterized by droopy elongated ears. It has a thick fur covering its body. The Fur is usually orange or black in color.It is filled with vigor and curiosity.
Read MoreThis particular rabbit has extremely soft fur.Angora rabbits are pleasantly known for their very friendly and playful disposition.
Read MoreLovebirds are very popular pets and are a good for first-time bird owners.These birds are great pets for older children but may be a bit too nippy for younger children.
Read MoreThese birds want your attention and can cuddle with you for hours.They are very smart, curious, and expert escape artists and can open almost any cage door.
Read More


Man found dead in Bristol jail cell was deemed 'low risk' when first moved to prison
Shaun Dewey had been in prison since September 2017 and was on remand for the murder of Andrew Owen
by Heather PickstockA prisoner awaiting trial for murder was found dead in his cell at HMP Bristol an inquest heard.
Shaun Dewey was discovered in his cell on April 13, 2018.
An inquest at Avon Coroners Court heard that Mr Dewey had been in prison since September 2017 and was on remand for the murder of Andrew Owen,
Mr Dewey had been charged with the murder and grievous bodily harm of Mr Owen following an altercation at a property in Bewdley on September 17, 2017.
Initially Mr Dewey had been remanded in custody at HMP Hewell in Redditch.
However he was transferred to Bristol after he started to self-harm.
Despite attempts to revive him, Mr Dewey, from Redditch, was pronounced dead at the scene.
The inquest heard how Mr Dewey had sparked a code blue incident while at HMP Hewell after he was found in his cell with cuts on November 14 which required hospital treatment.
Mr Dewey who said he felt under threat from associates of his victim, was moved to HMP Bristol on January 4.
On arrival in Bristol an ACT - assessment, care in custody and teamwork- was put in place.
An ACT is put in place, the inquest heard, when a prisoner is judged of being at risk of self harm or suicide.
The ACT is used to identify and support those prisoners at risk of self harm or suicide and suggests how often they should be observed, and whether mental health intervention is required.
An assessment the day after his arrival at Bristol, the inquest heard, judged that although Mr Dewey was anxious and suffering with depression he had no suicidal thoughts and was a low risk.
Regular assessments of Mr Dewey were carried out although it was deemed at the time he did not need a mental health assessment and if his condition deteriorated he should see his GP.
At a review on January 13, Mr Dewey told staff that he feared ‘reprisals were coming.’
On January 20 during an assessment with senior prison officer John Penman, Mr Dewey appeared ‘tearful and anxious’ and told staff he was concerned about his family who were getting abuse.
Mr Dewey continued to feel anxious and told prison staff he wanted to move off D wing onto the vulnerable persons unit (VPU).
The inquest heard how he was not taking his medication properly as he was too fearful to come out of his cell to collect it.
Dr Glover saw Mr Dewey on January 29 where he said he wanted to move off D wing.
A referral to the mental health team was made where it was judged that Mr Dewey’s issues were ‘circumstancial’ rather than anything underlying and moves were made to move him to the VPU.
Dr Glover told the inquest: “His mental health problems were within those manageable by a GP.”
Mr Dewey was moved to the VPU on February 1 but he continued to suffer with anxiety and a request for a mental health assessment made.
However this request was refused and a referral made to the anxiety management group.
On March 19 it was reported by prison staff that Mr Dewey was anxious, not eating and self-segregating, refusing to come out of his cell apart from to collect his meals.
He was put on the list for one to one sessions to talk about his anxiety but there was a waiting list.
The inquest heard how Mr Dewey was keen to see his family but was worried about having visits in the main hall with other prisoners.
Mr Dewey was told adjustments could be made to the arrangements and a visit was being booked.
A report on the prison reporting system NOMIS on April 7 raised concerns Mr Dewey was not mixing with anyone on the wing and was suffering ‘terrible anxiety about his offence and being targeted.
However there was no concerns that Mr Dewey was at risk of self harming.
On April 11 the prison’s PACT team saw Mr Dewey and told him the process had started for him to see his family alone at the prison but that this would take time.
Alice Risdale told the inquest: “He seemed more upbeat and in better spirits.”
The inquest heard that on the morning of April 13 prison staff did their usual roll call.
They reported that the previous night Mr Dewey had put up playing cards in the observation panel to his cell.
When prison staff banged on the cell door, Mr Dewey knocked the cards off and was seen to go back to his bed.
He was found later that morning at the rear of his cell.
All evidence given to the inquest has now been heard.
A jury has now retired to reach its conclusion.
For the latest news in and around Bristol, visit and bookmark Bristol Live's homepage.
The Samaritans
Most people who are thinking of taking their own life have shown warning signs beforehand. These can include becoming depressed, showing sudden changes in behaviour, talking about wanting to die and feelings of hopelessness.
These feelings do improve and can be treated. If you are concerned about someone, or need help yourself, please contact the Samaritans on 116 123.


Toggle navigation
Menu
PitchITup
My Presentation
My History
My Documents
Account Settings
Images
Logout
Expirements
Pivot 1
Pivot 2
Pivot 3
Customer
Problem
Solution
Riskiest Assumption
Success criterion
Result and Discussion
Learning
Previous
Next


The movie will automatically end after 30 seconds and then the autopilot ends.
To toggle manual camera control and autopilot, press M on the keyboard.
W - move forward
A - strafe left
S - move backwards
D - strafe right
R can be used to reset the camera


Irish Water admits breaking environmental laws after 2018 Malahide incident
by By Tom TuiteIrish Water has admitted breaking environmental laws over an incident Malahide marina in Dublin.
The company was accused of offences under the Waste Water Discharge (Authorisation) Regulations 2007 at Strand Road, Malahide, Co. Dublin on April 28, 2018 and on the following day.
The case has been brought at by the Environmental Protection Agency (EPA) and was before Dublin District Court today.
Irish Water pleaded guilty to two charges: for not taking corrective actions, and not notifying the EPA about the incident as soon as practicable
The EPA withdrew a third charge for not having emergency response procedures in place that addressed any emergency situation on site.
Prosecuting solicitor Jason Teahan told Judge Anthony Halpin the case related to an incident at Malahide marina.
Defence counsel Eoghan Cole confirmed Irish Water was pleading guilty to the first two charges.
Judge Halpin adjourned the case until December 18 for the prosecution facts and the defence mitigation plea to be heard.
Last month the national water company pleaded guilty in another EPA prosecution over drinking water problems in Co. Cork. Judge Halpin has adjourned that case for facts, and a mitigation plea, to be given at a sentence hearing on January 8 next.
In that prosecution, it faces charges following a direction given on June 5, 2015 by the EPA in respect of supply of drinking water at Drimoleague and Kealkill.
It was alleged Irish Water failed to submit final reports to the EPA before the end of 2018, verifying that trihalomethanes (THMs) levels were not excessive.
THMs, which can have a can have possible carcinogenic effects if consumed over long periods, are bi-product of chlorination to disinfect ground water which makes its way into the supply.
READ MORE
Tests at Kildare plant may see boil water notice may be lifted today


Before Change
torch.Tensor: a tensor with the confusion matrix with shape
:math:`(N, C, C)` where C is the number of classes.
if not torch.is_tensor(y_true):
raise TypeError("Input y_true type is not a torch.Tensor. Got {}"
.format(type(y_true)))
if not torch.is_tensor(y_pred):
raise TypeError("Input y_pred type is not a torch.Tensor. Got {}"
.format(type(y_pred)))
if not y_true.shape == y_pred.shape:
raise ValueError("Inputs y_true and y_pred must have the same shape. "
"Got: {}".format(y_true.shape, y_pred.shape))
if not y_true.device == y_pred.device:
raise ValueError("Inputs must be in the same device. "
"Got: {} - {}".format(y_true.device, y_pred.device))
if not isinstance(num_classes, int) or num_classes < 2:
raise ValueError("The number of classes must be an intenger bigger "
"than two. Got: {}".format(num_classes))
batch_size: int = y_true.shape[0]
y_true_vec: torch.Tensor = y_true.view(batch_size, -1)
y_pred_vec: torch.Tensor = y_pred.view(batch_size, -1)
// NOTE: torch.bincount does not implement batched version
pre_bincount: torch.Tensor = y_true_vec * num_classes + y_pred_vec
confusion_vec: torch.Tensor = torch.stack([
torch.bincount(pb) for pb in pre_bincount
])
After Change
torch.Tensor: a tensor with the confusion matrix with shape
:math:`(B, K, K)` where K is the number of classes.
if not isinstance(input, torch.LongTensor):
raise TypeError("Input input type is not a torch.LongTensor. Got {}"
.format(type(input)))
if not isinstance(target, torch.LongTensor):
raise TypeError("Input target type is not a torch.LongTensor. Got {}"
.format(type(target)))
if not input.shape == target.shape:
raise ValueError("Inputs input and target must have the same shape. "
"Got: {}".format(input.shape, target.shape))
if not input.device == target.device:
raise ValueError("Inputs must be in the same device. "
"Got: {} - {}".format(input.device, target.device))
if not isinstance(num_classes, int) or num_classes < 2:
raise ValueError("The number of classes must be an intenger bigger "
"than two. Got: {}".format(num_classes))
batch_size: int = input.shape[0]
// hack for bitcounting 2 arrays together
// NOTE: torch.bincount does not implement batched version
pre_bincount: torch.Tensor = input + target * num_classes
pre_bincount_vec: torch.Tensor = pre_bincount.view(batch_size, -1)
confusion_vec: torch.Tensor = torch.stack([
torch.bincount(pb, minlength=num_classes**2) for pb in pre_bincount_vec


Project Manager & Event Organizer
I help organizations manage projects and events,
and create their communication and marketing strategy
I help organizations manage projects and events,
and create their communication and marketing strategy
I'm dealing with lots of people every day including my customers, colleagues, and roommates. What I admire the most about all those people is their readiness to help each other. Because then, what is life all about?
If you're here, you are looking for help as well. I’m ready to become your right hand because that’s what I love doing – support teams, develop strategies, plan and work with clients to satisfy their requirements and to complete projects on time and within the budget.
Let’s keep our acquaintance short. If you have questions, just
→ contact me .
Thanks for your time spent here!
I constantly improve myself to get new valuable skills and to succeed in my career.
Project management
MailChimp
Event management
Public relations
InDesign & Photoshop
Agile
Content management
Microsoft Office
Here are some companies I was proud to work with.
Salthaven Wildlife Rehabilitation and Education Centre is commited to the care and rehabilitation of sick, injured, orphaned or otherwise compromised wildlife.
DarkLove is an independent music production and mastering company based in Cherkasy, Ukraine. A member of ukrainian underground electronic music scene.
The South Western Ontario Chapter provides a forum for Project Managers to promote the principles of the Project Management Institute through networking.
“ Daryna has been a pleasure to work with. She is exceptionally creative, able to take on multiple projects with competing interests yet manages it all seamlessly. Daryna is always optimistic, delivers solutions, loves to brainstorm and will do what it takes to get the job done. She goes above and beyond the norm to ensure a project is completed on time and within budget. She is exceptional at planning, organizing and managing projects. ” — Kathleen Keating
“ Daryna is an amazing person. She is loyal, hardworking and multitasking. She motivates other people to move forward and always accomplish her work with the best results. ” — Nataliia Stefurak
I would love to hear from you!
Let's meet together to get engaged in new projects!