|
Longan Nano
Longan Nano Demo
|
String <-> Number conversion using standard c strings to avoid std::string under the hood. More...
#include <embedded_string.hpp>
Public Types | |
| enum | _Config { SAFETY_CHECKS = true, DIGIT8 = 3, DIGIT16 = 5, DIGIT32 = 10, DIGIT_ENG = 4, STRING_SIGN_SIZE = 1, STRING_TERMINATOR_SIZE = 1, TERMINATOR = '\0', STRING_SIZE_U8 = DIGIT8 +STRING_TERMINATOR_SIZE, STRING_SIZE_S8 = DIGIT8 +STRING_SIGN_SIZE +STRING_TERMINATOR_SIZE, STRING_SIZE_U16 = DIGIT16 +STRING_TERMINATOR_SIZE, STRING_SIZE_S16 = DIGIT16 +STRING_SIGN_SIZE +STRING_TERMINATOR_SIZE, STRING_SIZE_U32 = DIGIT32 +STRING_TERMINATOR_SIZE, STRING_SIZE_S32 = DIGIT32 +STRING_SIGN_SIZE +STRING_TERMINATOR_SIZE, STRING_SIZE_UENG = 7, STRING_SIZE_SENG = 8 } |
| Configurations for the String class. More... | |
| typedef enum User::String::_Config | Config |
| Configurations for the String class. More... | |
Public Member Functions | |
| String (void) | |
| Constructor String | void. More... | |
| ~String (void) | |
| Destructor String | void. More... | |
Static Public Member Functions | |
| static uint8_t | num_to_str (uint8_t num, uint8_t str_len, char *str) |
| public static method num_to_str | uint8_t | uint8_t | char * | More... | |
| static uint8_t | num_to_str (int8_t num, uint8_t str_len, char *str) |
| public static method num_to_str | int8_t | uint8_t | char * | More... | |
| static uint8_t | num_to_str (uint16_t num, uint8_t str_len, char *str) |
| public static method num_to_str | uint16_t | uint8_t | char * | More... | |
| static uint8_t | num_to_str (int16_t num, uint8_t str_len, char *str) |
| public static method num_to_str | int16_t | uint8_t | const char * | More... | |
| static uint8_t | num_to_str (uint32_t num, uint8_t str_len, char *str) |
| public static method num_to_str | uint32_t | uint8_t | char * | More... | |
| static uint8_t | num_to_str (int32_t num, uint8_t str_len, char *str) |
| public static method num_to_str | int32_t | uint8_t | const char * | More... | |
| static uint8_t | num_to_eng (uint32_t num, int8_t num_exp, uint8_t str_len, char *str) |
| public static method num_to_eng | uint32_t | uint8_t | char * | More... | |
| static uint8_t | num_to_eng (int32_t num, int8_t num_exp, uint8_t str_len, char *str) |
| public static method num_to_eng | int32_t | uint8_t | const char * | More... | |
| static uint8_t | num_to_eng (uint32_t num, uint8_t str_len, char *str) |
| public static method num_to_eng | uint32_t | uint8_t | const char * | More... | |
| static uint8_t | num_to_eng (int32_t num, uint8_t str_len, char *str) |
| public static method num_to_eng | int32_t | uint8_t | const char * | More... | |
String <-> Number conversion using standard c strings to avoid std::string under the hood.
2020-07-27
Encapsulate in class form
Transplant u8, s8, u16, s16, u32 and s32 methods from the 2019-11-07 At_string V2 library
Added safety checks and option to disable them in release
Use C++ overloading and make use of num_to_str method. No longer calling the wrong conversion method
Tested U8 and S8 methods. Test safety by providing shorter string: SUCCESS
U16 and S16 methods can call the U8 conversion when number is small enough
Tested U16 and S16 methods: SUCCESS
Tested U32 and S32. The test example only test S16 as there are problems with d
Engineering format string
2020-07-29
Tested signed and unsigned integer engineering format string generation
Added base 10^X exponent to eng conversion. It's meant to allow user to specify a multiplier when using inegers. e.g. 1000 means 100.0%
2020-08-08
Clean Up Doxygen documentation
| typedef enum User::String::_Config User::String::Config |
Configurations for the String class.
Configurations for the String class.
|
inline |
|
inline |
|
inlinestatic |
public static method num_to_eng | int32_t | uint8_t | const char * |
| num | | int32_t | number to be converted |
| num_exp | | int8_t | base 10^x eponent of the number. E.G. the user might have provided a number in millivolts, exponent -3 |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. Must be at least 7 |
| str | | const char * | return string provied by the caller |
wrapper
|
inlinestatic |
public static method num_to_eng | int32_t | uint8_t | const char * |
| num | | int32_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. Must be at least 7 |
| str | | const char * | return string provied by the caller |
wrapper
|
inlinestatic |
public static method
num_to_eng | uint32_t | uint8_t | char * |
| num | | int32_t | number to be converted |
| num_exp | | int8_t | base 10^x eponent of the number. E.G. the user might have provided a number in millivolts, exponent -3 |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. Must be at least 7 |
| str | | const char * | return string provied by the caller |
convert a S32 into an enginnering number format. Four significant digits with SI suffix always uses 6 characters X.XXX{SI} XX.XX{SI} XXX.X{SI} SI Suffixes Exponents index | -6 -5 -4 -3 -2 -1 0 +1 +2 +3 +4 +5 +6 exp | -18 -15 -12 -9 -6 -3 0 +3 +6 +9 +12 +15 +18 suffix | a f p n u m K M G T P E
|
inlinestatic |
public static method num_to_eng | uint32_t | uint8_t | const char * |
| num | | int32_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. Must be at least 7 |
| str | | const char * | return string provied by the caller |
wrapper
|
inlinestatic |
public static method num_to_str | int16_t | uint8_t | const char * |
| num | | int16_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
Convert an int16_t to string
convert a S16 into a string. Does mostly sign conversion. Make use of the U8 and U16 methods for the actual conversion.
|
inlinestatic |
public static method num_to_str | int32_t | uint8_t | const char * |
| num | | int32_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
convert a S32 into a string. Does mostly sign conversion. Make use of the U8 and U16 methods for the actual conversion.
|
inlinestatic |
public static method num_to_str | int8_t | uint8_t | char * |
| num | | int8_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
convert a S8 into a string. Mostly does sign correction. Make use of the U8 method for the actual conversion.
|
inlinestatic |
public static method num_to_str | uint16_t | uint8_t | char * |
| num | | uint16_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
convert a U16 into a string. Make use of the U8 method for small numbers
|
inlinestatic |
public static method num_to_str | uint32_t | uint8_t | char * |
| num | | uint32_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
convert a U32 into a string
|
inlinestatic |
public static method num_to_str | uint8_t | uint8_t | char * |
| num | | uint8_t | number to be converted |
| str_len | | uint8_t | length of the provided string. Avoids overflow. Include terminator. "XXX\0" str_len = 4 |
| str | | const char * | return string provied by the caller |
convert a U8 into a string


The QuantConnect Paper Trading brokerage supports the following asset classes:
If you set the brokerage model to a model other than the DefaultBrokerageModel, the new brokerage model defines the asset classes you can trade.


| 010:089 Khan | : |
Allah said: "Verily, the invocation of you both is accepted. So you both keep to the Straight Way (i.e. keep on doing good deeds and preaching Allah's Message with patience), and follow not the path of those who know not (the truth i.e. to believe in the Oneness of Allah, and also to believe in the Reward of Allah: Paradise, etc.)." |
| 010:089 Maulana | : |
He said: Your prayer is accepted; so continue in the right way and follow not the path of those who know not. |
| 010:089 Pickthal | : |
He said: Your prayer is heard. Do ye twain keep to the straight path, and follow not the road of those who have no knowledge. |
| 010:089 Rashad | : |
He said, "Your prayer has been answered (O Moses and Aaron), so be steadfast, and do not follow the ways of those who do not know." |
| 010:089 Sarwar | : |
The Lord replied, "Moses, the prayer of your brother and yourself has been heard. Both of you must be steadfast (in your faith) and must not follow the ignorant ones." |
| 010:089 Shakir | : |
He said: The prayer of you both has indeed been accepted, therefore continue in the right way and do not follow the path of those who do not know. |
| 010:089 Sherali | : |
God said, 'Your prayer is accepted. So be ye twain steadfast, and follow not the path of those who know not.' |
| 010:089 Yusufali | : |
Allah said: "Accepted is your prayer (O Moses and Aaron)! So stand ye straight, and follow not the path of those who know not." |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الكافرون > متابعة الكفر Pillars of Islam> Islamic> The Disbelievers> Following-up Atheism العمل > العمل الصالح > الاستقامة في العمل Action(Work)> The Good Deeds>Honesty at Work الإنسان والعلاقات الأخلاقية > الأخلاق الحميدة > الاستقامة Man and The Moral Relations> Good Morals>Honesty
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


TV SHOW
Teen Titans Go - Space Advetnture
Superhero roommates Robin, Cyborg, Starfire, Raven and Beast Boy
love saving the day, but what happens when they're done fighting crime?
Genres: Animation | Short | Adventure | Comedy | Family | Sci-Fi


Module: ActionController::RequestForgeryProtection
| Relationships & Source Files | |
| Namespace Children | |
|
Modules:
| |
| Extension / Inclusion / Inheritance Descendants | |
|
Included In:
Base,
::ActionView::TestCase::TestController,
Rails::ApplicationController,
Rails::InfoController,
Rails::MailersController,
Rails::WelcomeController
| |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
|
|
|
Instance Chain:
|
|
| Defined in: | actionpack/lib/action_controller/metal/request_forgery_protection.rb |
Overview
Controller actions are protected from Cross-Site Request Forgery (CSRF) attacks by including a token in the rendered HTML for your application. This token is stored as a random string in the session, to which an attacker does not have access. When a request reaches your application, Rails verifies the received token with the token in the session. Only HTML and JavaScript requests are checked, so this will not protect your XML API (presumably you'll have a different authentication scheme there anyway).
GET requests are not protected since they don't have side effects like writing to the database and don't leak sensitive information. JavaScript requests are an exception: a third-party site can use a <script> tag to reference a JavaScript URL on your site. When your JavaScript response loads on their site, it executes. With carefully crafted JavaScript on their end, sensitive data in your JavaScript response may be extracted. To prevent this, only XmlHttpRequest (known as XHR or Ajax) requests are allowed to make GET requests for JavaScript responses.
It's important to remember that XML or JSON requests are also affected and if you're building an API you'll need something like:
class ApplicationController < ActionController::Base
protect_from_forgery
skip_before_action :verify_authenticity_token, if: :json_request?
protected
def json_request?
request.format.json?
end
end
CSRF protection is turned on with the protect_from_forgery
method, which checks the token and resets the session if it doesn't match what was expected. A call to this method is generated for new Rails applications by default.
The token parameter is named authenticity_token
by default. The name and value of this token must be added to every layout that renders forms by including csrf_meta_tags
in the HTML head
.
Learn more about CSRF attacks and securing your application in the Ruby on {Rails Security Guide}.
Constant Summary
-
AUTHENTICITY_TOKEN_LENGTH =
# File 'actionpack/lib/action_controller/metal/request_forgery_protection.rb', line 24532
::ActiveSupport::Callbacks - Included
::AbstractController::Helpers - Attributes & Methods
Class Method Summary
::ActiveSupport::DescendantsTracker - self
| clear, descendants, direct_descendants, | |
| store_inherited | This is the only method that is not thread safe, but is only ever called during the eager loading phase. |
::ActiveSupport::Concern - Extended
Instance Method Summary
::AbstractController::Callbacks - Included
| #process_action | Override AbstractController::Base's process_action to run the process_action callbacks around the normal behavior. |
::ActiveSupport::Callbacks - Included
| #run_callbacks | Runs the callbacks for the given event. |
DSL Calls
included
[ GitHub ]58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
# File 'actionpack/lib/action_controller/metal/request_forgery_protection.rb', line 58
included do # Sets the token parameter name for RequestForgery. Calling protect_from_forgery # sets it to <tt>:authenticity_token</tt> by default. config_accessor :request_forgery_protection_token self.request_forgery_protection_token ||= :authenticity_token # Holds the class which implements the request forgery protection. config_accessor :forgery_protection_strategy self.forgery_protection_strategy = nil # Controls whether request forgery protection is turned on or not. Turned off by default only in test mode. config_accessor :allow_forgery_protection self.allow_forgery_protection = true if allow_forgery_protection.nil? # Controls whether a CSRF failure logs a warning. On by default. config_accessor :log_warning_on_csrf_failure self.log_warning_on_csrf_failure = true helper_method :form_authenticity_token helper_method :protect_against_forgery? end
Class Attribute Details
._helper_methods (rw)
[ GitHub ]# File 'actionpack/lib/abstract_controller/helpers.rb', line 11
class_attribute :_helper_methods
._helper_methods? ⇒ Boolean
(rw)
[ GitHub ]
# File 'actionpack/lib/abstract_controller/helpers.rb', line 11
class_attribute :_helper_methods
._helpers (rw)
[ GitHub ]# File 'actionpack/lib/abstract_controller/helpers.rb', line 8
class_attribute :_helpers
._helpers? ⇒ Boolean
(rw)
[ GitHub ]
# File 'actionpack/lib/abstract_controller/helpers.rb', line 8
class_attribute :_helpers
Instance Attribute Details
#_helper_methods (rw)
[ GitHub ]# File 'actionpack/lib/abstract_controller/helpers.rb', line 11
class_attribute :_helper_methods
#_helper_methods? ⇒ Boolean
(rw)
[ GitHub ]
# File 'actionpack/lib/abstract_controller/helpers.rb', line 11
class_attribute :_helper_methods
#_helpers (rw)
[ GitHub ]# File 'actionpack/lib/abstract_controller/helpers.rb', line 8
class_attribute :_helpers
#_helpers? ⇒ Boolean
(rw)
[ GitHub ]
# File 'actionpack/lib/abstract_controller/helpers.rb', line 8
class_attribute :_helpers


How do you feel?
Happy
Sadness
Fear
Disgust
Anger
Surprise
Your mood chart
Item
Percent
Happy
Sad
Fear
Disgust
Anger
Surprise


--- layout: post title: Top 5 Tools of the Website Trade You Won't Hear About from Customers date: 2009-07-07 08:15:35.000000000 -07:00 categories: - Design Pattern - Technology tags: [] status: publish type: post published: true ---
What are the tools of the trade that you will never see in a product requirements document or feature request from an investor or client?
Clients often just expect that certain things are taken care of when building a web site. These tools of the trade are important - they are ubiquitous across systems, and often we use the cheaper tools to start with and then switch over (re-tool) during the course of business growth. Over the course of the next few posts, I'm going to briefly develop what I think are the Top 5 tools of the trade for a software engineer working on a website, from the point of the view that your customers will never ask for them, but they are almost always required and even assumed.
I'm going to try to consider this in a language-neutral way and stick with general principles or ideas. Stay tuned!


{% extends 'service.html' %} {% load i18n %} {% load staticfiles %} {% block title %} {% trans "Page not found" %} | {{ block.super }} {% endblock %} {% block content %} {% url 'home' as home_url %}
{% blocktrans %} Requested page was not found. We have been notified and will fix it, if it's an error. {% endblocktrans %}
{% blocktrans %} You can now go to home page or try navigating back. {% endblocktrans %}
{% endblock %}


This page is a survey of my past research projects. I favored to summarize them in simple English, making our research as accessible as possible.
Progressive Simplification of Polygonal Curves
State-of-the-art map services make use of multiple zoom levels. We developed a simplification algorithm
that outputs a series of simplifications across multiple spatial scales. To this end, we developed new construction techniques that boost the computations for any simplification algorithm employing shortcut graphs.
We applied our algorithm to migratory trajectory of a vulture and evaluated various simplification algorithms experimentally.
We implemented a visual analytics tool which exploits migration patterns in gull data. Migration is the spatial displacement of moving objects during seasons, such as winter and spring. We compute and visualize a trajectory aggregation (1), a density
map (2) on top of geographical maps, a calendar view (3) and a list of gulls (4). Our evaluation with an expert user in ecology shows that our approach helps ecologists in identify interesting moving objects.
Lower Bounds on Fréchet Distance and Simplification
We have proven lower bounds for two curve problems. A lower bound of a computational problem help researchers in theory and practice to understand limits of exact computations and to get insights whether approximation algorithms can be designed easily.
We showed that we cannot compute an optimal simplification in subquadratic time and that we cannot compute the Fréchet distance for k curves in less than O(n^k) time. We assume for both results that the Strong Exponential Time Hypothesis (SETH) holds.
We developed a visual analytics approach to analyze and visualize interaction events between two (and three) trajectories. Interaction is the interdependence between two moving objects. We were interested in action-reaction patterns where one trajectory
is reacting after a delay in time. We applied and evaluated our approach on pigeon data ultimate frisbee data.
We studied the problem of computing a spanning tree that minimizes crossings with lines in the plane. The problem of finding a spanning tree with minimal crossing number is NP-hard. We conducted an experimental evaluation of various algorithms and approximations
in form of linear programs.


Testing for Markdown feature
print("Hello World"); print("Hello from second line");
System.out.println("Testing");
Regular Text


--- title: Archive summary: archive page containing posts grouped by month and year permalink: /archive/ layout: page sitemap: false --- {% if site.posts.size == 0 %}
Sorry, no posts. :(


Home
Main content starts here, tab to start navigatingA modern take on traditional Southeast Asian cuisine
Pho | Ramen | Dumplings | Banh Mi | Sushi | Cocktails
AtlantaCharlestonCharlotte - WaverlyCharlotte - Park RoadMyrtle BeachRaleighSavannah
Pho | Ramen | Dumplings | Banh Mi | Sushi | Cocktails
AtlantaCharlestonCharlotte - WaverlyCharlotte - Park RoadMyrtle BeachRaleighSavannah


Viktor! Mouse to move, spacebar or click to shoot. M to mute/unmute.
Made with ❤ by Legendary Charizard and NortySpock, using p5 and p5.play. Code available on GitHub.


Description
The adult male is a striking and unmistakable bird. It has a red bill, large white crescent above the eye and reddish face and "whiskers". The breast is purple with two vertical white bars, and the flanks ruddy, with two orange "sails" at the back. The female is similar to female wood duck, with a white eye-ring and stripe running back from the eye, but is paler below, has a small white flank stripe, and a pale tip to its bill.


Patawalonga Creek at Adelaide Airport contains a remnant stand of Melaleuca halmaturorum, listed by the National Trust of Australia for its natural heritage values. Since settlement, the stand had been impacted by earthmoving, channelisation of the creek, weed incursions and changes in flow regime. The individual layers provided here show how this stand has changed over time since Adelaide Airport Limited and the Friends of Patawalonga Creek undertook to manage the site in 1998. Since that time the Melaleuca cover has increased by 55%.
You need to have the free Google Earth software installed on your computer to access these data layers.
Run or download the following Google Earth layers:
If you select SAVE, the layers will be saved to a directory you specify on your hard drive. From there you can open them by double-clicking on them. This will cause Google Earth to start. Alternatively you may open Google Earth then navigate to the files to load them.
If you select RUN, the layers will be treated as .zip files by Internet Explorer, and your unzip program will start. Allow it to open the files and then simply click on the file inside. Google Earth will start up automatically.
Once you have loaded all the layers into Google Earth, you can t urn the layers on and off to see the changes in coverage over time.
The mapping of each year's coverage was undertaken using georectified aerial photography in the GIS package TNTmips. The georectification was conducted at a different scale to that used to georectify the satellite imagery in Google Earth, so there may be some small discrepancies between the overlaying layers and the Google Earth imagery.
Other species (she-oaks, boxthorn and dillon berries) of trees and shrubs growing on the site are a similar size, but are not included in these layers. Groundtruthing, conducted by botanists with GPS units who visited the site and manually recorded Melaleuca locations, was used to confirm species identification.
If you are interested in joining the Friends of Patawalonga Creek in their efforts to restore this site, please contact Adelaide Airport Limited's Environmental Division on 08-8308-9211


Log In
join the big community where everything is achievable!
Sign up to join
Have an account?
Log in.


# Thesis Design ## Dr. [Fania Raczinski](http://fania.uk)
## Title / Topic
Algorithmic Meta-Creativity
Creative Computing and Pataphysics for Computational Creativity
Hongji Yang, Andrew Hugill, Sophy Smith, Jim Hendler
## Journey - started October 2010 fulltime - 1 year interuption 2014 - 2015 - started writing thesis in March 2015 - submitted thesis in December 2016 - viva in June 2017 - submitted corrections September 2017
My PhD was not **practice-based**.
Deliverables
Thesis
-
dr.physics.wtf
1
+
pdf
Artefact
-
pata.physics.wtf
Map
-
pamatamap.com
2
1 Web version: post submission, pre viva
2 Map: post viva
![pata.physics.wtf](imgs/full.png)
![pata.physics.wtf](imgs/proto3screen.png)
![pamatamap.com](imgs/map.jpeg)
## Writing - written in [LaTeX](https://www.latex-project.org/) - [Git](https://git-scm.com/) & [GitHub](https://github.com/Fania/Thesis) for version control and portability - [Thesis Boot Camp](http://www.petafreestone.com/thesis-boot-camp/) @ DMU - heavy use of progress bars and todo lists - 14 chapters, 5 appendices, in 8 parts ([Paris Metro](https://parisbytrain.com/wp-content/uploads/2014/01/paris-metro-mini-map-2014.pdf)) - ~ 60k words (without references + appendices) (113207 words according to turn-it-in) - 411 pages (262 without references + appendices) - see [regulations](http://www.dmu.ac.uk/documents/research-documents/graduate-school/cop-update-feb-2018/regulations/15.-presentation-of-thesis.pdf) Notes: Latex handled the complexity of my project better than Word. I liked having individual files for chapters, yet keep one set of references, table of contents, etc. [Thesis Boot Camp](http://www.petafreestone.com/thesis-boot-camp/) @ DMU (8-10 July 2016)
![progress](imgs/progress-small.jpg)
![draft](imgs/draft.jpg)
![todos](imgs/todos.png)
![github](imgs/additions-deletions.png)
Visualisation by GitHub
Visualisation created using
gource
and
ffmpeg
## Organisation In principle, I followed a **[classic thesis structure](https://www.vitae.ac.uk/doing-research/doing-a-doctorate/completing-your-doctorate/writing-and-submitting-your-doctoral-thesis/structuring-your-thesis)**: | | | |:- | -:| | 1. Introduction | HΣLLΘ WΘRLD | | 2. Methodology | TΘΘLS OF THE TR∀DΣ | | 3. State of the Art | THE CΘRE: TΣCHNΘLΘGIC | | 4. Claims / Contributions | THE CΘRE: TΣCHNΘPR∀CTICΣ | | 5. Critical Analysis / Evaluation | MΣT∀-LΘGIC∀LYSIS | | 6. Conclusion | H∀PPILY ΣVΣR ∀FTΣR | Notes:
### Personalisation I like **structure** and prefer shorter chapters, sections, and subsections. So, I had 14 chapters and 5 appendices in total. - un- / related work and inspirations - transdisciplinary literature review (4 chapters) - claims and contributions (3 chapters) - applications (patadata ontology, digital opera) - future / unfinished work I also added **[interludes](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=145)** containing spare quotes. Notes:
Visualisation
"
Stacked-bar-code
" chart
width proportional to number of pages
top row shows individual
chapters
top row colours taken from map
bottom row shows the different
parts
bottom row colours created using
hex addition
### [Methodology](https://dr.physics.wtf/html/methodology.html) This is the chapter I struggled most with! - computer science (e.g. data, proof, model, build) - arts & humanities (e.g. document, reflect, curate, narrative) - transdisciplinarity - Nicolescu: **"unity in diversity and diversity from unity"** - Hugill & Yang methodology (see [page 62](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=62)) - Edmonds & Candy model (see [Fig. 3.3](https://dr.physics.wtf/html/methodology.html#fig:3.3)) *review
identify
analyse
propose
design
experiment* Notes: I hadn't made decisions about this in my early stages and just did what I did. So in retrospect I had to describe what methodology I used, without really having used one at all. - digital humanities best fit
### [Foundation](https://dr.physics.wtf/html/foundation.html) / [Interpretation](https://dr.physics.wtf/html/interpretation.html) *[foundation](https://dr.physics.wtf/html/foundation.html)
[interpretation](https://dr.physics.wtf/html/interpretation.html)
[implementation](https://dr.physics.wtf/html/implementation.html)* - compare, contrast, critisice existing frameworks - relate them to pataphysics - discuss philosophical issues - introduce interpretation framework Notes:
### [Implementation](https://dr.physics.wtf/html/implementation.html) This mainly described the technical details of [pata.physics.wtf](https:pata.physics.wtf). - outlines design for front-end - explains key code from back-end - presents formal descriptions of algorithms - shows progression from prototypes to final artefact
P(q)
C
= { p ∈ v
0
: 0 < dameraulevenshtein(q,p) ≤ 2 }
Notes:
### [Evaluation / Analysis](https://dr.physics.wtf/html/analysis.html) *Subjectivity*
*Objectivity* **[theory](https://dr.physics.wtf/html/analysis.html#s:theoryanalysis) & [practice](https://dr.physics.wtf/html/analysis.html#pataphysicalisation)** - no traditional quantitative / qualitative data collection (e.g. questionnaires, focus groups, etc.) - corpora, index, algorithms, APIs - philosophical issues, design, biases see [Fig. 12.1](https://dr.physics.wtf/html/analysis.html#fig:12.1), [Tab. 12.3](https://dr.physics.wtf/html/analysis.html#tab:12.3), [Tab. 12.4](https://dr.physics.wtf/html/analysis.html#tab:12.4) Notes: each decision was analysed retrospectively 10k words for this chapter taking pieces out of the context of the subjective artwork and analyse them objectively meronym anectode (during analysis I found that i should have included meronyms and added that into the artefact then)
## Subtleties - Avant-Garde font (sans-serif) - part spirals - chapter poems - chapter contents - naming of headings - design of tables, figures, equations, code - map - chapter summaries Notes: I wanted to bring in as much of the atmosphere of my project into the thesis as possible.
## Viva **Internal:** Simon Emmerson (De Montfort University) **External:** Rachel McCrindle (University of Reading) - took place 6 months after submission - short 20 min [presentation](https://dr.physics.wtf/viva) - overall it lasted around 1.5 hours - was given minor corrections
### Corrections 1. [chapter summaries](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=38) 2. [diagram of thesis](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=39) 3. [sound and music](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=275) 4. move [references](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=289) before [appendices](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=317) 5. include [readme](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=349) in thesis 6. typos Notes: 1. At the end of each chapter: a short summary of where it fits into the whole PhD structure. This to be related to - 2. A diagram of the total PhD structure, showing how the chapters feed the overall PhD: the design, construction and evaluation of the website tools. This pulls everything together to increase the impact of the PhD and its original output. The candidate can decide how best to present this and whether in the Introduction or the Conclusion to the thesis. 3. Sound and music are hardly referred to. In the ‘to be developed in future’ section a paragraph stating this as a given for this thesis but pointing out the potential for its development (possible reference: Hugill). 4. The References should immediately follow the main text before appendices and other such material. 5. The ‘ReadMe’ from the accompanying disc (or other media storage – disc may not be needed in final Library copy – to be checked with the GSO and Library) to be available in the main thesis as an appendix ‘How to run the website software’ – check that it works exactly from the instructions given there. 6. The internal examiner’s copy of the PhD (returned to the candidate at the conclusion of the viva) has marked up some typos for correction. [The examiners commended the candidate for the small number found!]
### [Static Map](https://dr.physics.wtf/files/FR-thesis-small.pdf#page=39) ![dr.physics.wtf/files/FR-thesis-small.pdf#page=39](imgs/map.jpeg) Note:
### [Interactive Map](http://pamatamap.com)
Note:
## Dissemination - poetry reading @ Word (Dec 2017) - IOCT postgrad showcase @ Innovation Centre (Jun 2016) - Creative Computing conference in Oxford (Mar 2016) - IOCT talk for [CAS](http://interactdigitalarts.uk/cas) @ Phoenix (Oct 2015) - IOCT LMS launch showcase @ DMU (Nov 2014) - IOCT PhD showcase @ Phoenix Cube (Aug 2014) - Digital Creativity journal article 24:3 (Nov 2013) - Creativity and Cognition conference in Sydney (Jun 2013) - TDC talk @ DMU (Feb 2013) - CONTENT conference in Rome (Mar 2011)
### Stress
of surface tension fighting against an insurmountable difficulty with great trees spreading over us with decisive emphasis
were you able to pronoune a word that would keep me here we spared not breath or force that is to say our vessel now felt the full force of the ocean waves
the consecrated stream I will show you the map it is my design to show you
pronounce my name but I could not distinguish an articulate word and to decide which way to turn my steps
Notes: performed at Word @ the Y in Leicester, 05 Dec 2017
![](imgs/technology-landscape.png)
![](imgs/sally.jpeg)
Created by Sally Wilson for my thesis
## Thank you I hope this has been **useful / inspiring** to you. Any questions?


Clock Out
Primary clock output.
Clock In
Primary clock input. Internal clock is used when disconnected.
Reset In
Reset trigger input. Immediately resets the pattern (and internal clock, if using).
Probability 1 In
Controls the probability of steps marked 1 triggering (0V to 5V range).
Probability 2 In
Controls the probability of steps marked 2 triggering (0V to 5V range).
Probability 3 In
Controls the probability of steps marked 3 triggering (0V to 5V range).
Probability 4 In
Controls the probability of steps marked 4 triggering (0V to 5V range).
Pattern 1 Out
Trigger output for sequencer pattern 1.
Pattern 2 Out
Trigger output for sequencer pattern 2.
Pattern 3 Out
Trigger output for sequencer pattern 3.
Pattern 4 Out
Trigger output for sequencer pattern 4.


Rule Search Results (#{empty ruleList.resultList ? 0 : (ruleList.paginated ? ruleList.resultCount : ruleList.resultList.size)})
Action


temperature Holocene MC-FIT years water records Fig. record ice isotope Milandre based cooling mean temperatures Cave Europe calcite values {border-style Greenland North Sci. trend .°C fluid px;} #ffffff;} precipitation reconstruction Northern global past Hemisphere climate long-term reconstructions stalagmites Atlantic Science inclusion model European Quat. time BP, early seasonal simulations summer trends using Rev. changes cold isotopes ocean pollen sample warming annual cave central comparison data fig. forcing influence interval regional similar speleothem (fig. HTM S). Switzerland compared continental high-latitude measurements oxygen samples site stalagmite years. LIS Mediterranean agreement models northern obtained proxies px; sea strong used {font-family Eurasia Fleitmann Furthermore, MAAT Nature Past age air biases chronology conundrum. correlation error evidence font-size gas given good hydrogen inferred level marine measured multiproxy reconstructed sheet surface .-ka Age BP. Cheng Clim. Leuenberger National [], ages biased conundrum core double; evolution fi) fractionation growth hemispheric high http://orcid.org/--- low lower measurement mid-latitude noble performed records. shown spatial speleothems (MC-FIT) (δD Affolter Basel Bern, Bunker Cave, D.F. Europe, Foundation Geosci. Germany Holocene. Häuselmann Lett. Moreover, Nat. SST Spötl Supplementary Swiss Wang border-color border-width change climatic different drip eruptions event infiltration influenced mass middle new observed proxy recorded related reveals samples) shows solid; stable station study variability variations volcanic {font-style {font-weight (black), .‰/°C America BP) CCSM Central Edwards Europe. Geophys. Gerzensee Ice L-i MAATs Mean NGRIP New Pacific Raible Research Riechelmann S.A., Stalagmite Temperature Timing Vienna Vinther Wanner YD, Zhang abrupt approximately balance bias biological bold characterized constant continuously cores courier; data-model decadal decrease em; estimates existence extracted fi, inclusions independent laminae major marked meltwater monsoon northeastern paleoclimate pt;} red resulting rise samples, season seasonally series sheets shifts significant source suggests supported temporal timing uncertainties uncertainty value ±.°,


Maker, Programmer, Designer
I am the president of Maker Club. I love making things that improve my daily life. Maker Club's projects include turning an old iPhone to a drone. Hardware-wise, I know Arduino and have built a remote light control switch. Last summer, my team and I built a smart sprinkler control module. It uses soil moisture sensor and weather API to optimize water usage.
I know Java, Javascript, HTML, CSS, and Swift. I have built an education app iMathland. Download in App Store or Google Play Store! It intuively explains various math concepts. I used Matlab in a research project determining small enterprise credit risk as well. Algorithmns and optimization are really fun and I love exploring those.
I incorporate product design into any project I build. Moreover, I love Virtual Reality painting in Google Tilt Brush. My works include Monet's Water Lily, the Old Man and the Sea, Catcher in the Mountains, etc. I love combining art and technology.


Before Change
_loss_a = LossL1(sources, sources).item()
for shift in range(n_sources):
sources_a = sources[:, :, :, shift:]
sources_b = sources[:, :, :, :shift]
shifted_sources = torch.cat(
[sources_a, sources_b], dim=-1)
_loss_b = LossPIT(shifted_sources, sources).item()
After Change
noise_amount = [0.001, .01, .05, 1.0]
for n in noise_amount:
permuted = []
noisy = sources + n * torch.randn_like(sources)
_loss_a = LossL1(noisy, sources).item()
for i in range(n_batch):
p = random.choice(list(permutations(range(n_sources))))
permuted_batch = noisy[i, ..., list(p)].unsqueeze(0)
permuted.append(permuted_batch)
permuted = torch.cat(permuted, dim=0)
_loss_b = LossPIT(permuted, sources).item()
assert np.allclose(_loss_a, _loss_b, atol=1e-6)
def test_combination_invariant_loss_tf():


About
Configuration
Asset Management
Compliance
Template
Reports
Resource Usage
Audit Trail
Devices
Interfaces
Topology
User
Profile
Logout


Upgrade your drink and get drunk!
New DrinkHow to play: Use your arrow keys to move the tiles. When two tiles with the same drink touch, the barman gets you a better drink!Drink with a friend, and double enjoy!
Note: This is a variation of 2048, made for the IWA community.
Created by Apprendix, based on the official version by Gabriele Cirulli.


Midden output
View Cache
view.cache
(Object, 1 properties)
layout
(Undefined)
Called From:
/Users/john/Sites/assemble/assemble-midden/test/src/index.hbs:12
view options
view.options
(Object, 7 properties)
collection
(String, 5 characters)
pages
pages
inflection
(String, 4 characters)
page
page
viewType
(Array, 1 elements)
0
(String, 10 characters)
renderable
renderable
handled
(Array, 12 elements)
0
(String, 6 characters)
onLoad
onLoad
1
(String, 6 characters)
onLoad
onLoad
2
(String, 8 characters)
onStream
onStream
3
(String, 8 characters)
onStream
onStream
4
(String, 9 characters)
preRender
preRender
5
(String, 9 characters)
preRender
preRender
6
(String, 10 characters)
preCompile
preCompile
7
(String, 10 characters)
preCompile
preCompile
8
(String, 9 characters)
preLayout
preLayout
9
(String, 9 characters)
preLayout
preLayout
10
(String, 11 characters)
postCompile
postCompile
11
(String, 11 characters)
postCompile
postCompile
method
(String, 11 characters)
postCompile
postCompile
route
(Object, 6 properties)
path
(RegExp)
stack
(Array, 1 elements)
0
(Object, 10 properties)
handle
(Function)
name
(String, 9 characters)
<unknown>
<unknown>
keys
(Array, 0 elements)
regexp
(RegExp)
params
(Undefined)
path
(Undefined)
method
(String, 6 characters)
onload
onload
handleError
(Function)
handleFile
(Function)
match
(Function)
methods
(Object, 1 properties)
onload
(Boolean)
True
handlesMethod
(Function)
dispatch
(Function)
all
(Function)
params
(Undefined)
Called From:
/Users/john/Sites/assemble/assemble-midden/test/src/index.hbs:16
helper
helper
(Object, 2 properties)
options
(Object, 0 properties)
name
(String, 6 characters)
midden
midden
Called From:
/Users/john/Sites/assemble/assemble-midden/test/src/index.hbs:19
context
context
(Object, 3 properties)
ext
(String, 4 characters)
.hbs
.hbs
async
(Boolean)
True
helpers
(Object, 8 properties)
midden
(Function)
view
(Function)
partial
(Function)
partials
(Function)
layout
(Function)
layouts
(Function)
page
(Function)
pages
(Function)
Called From:
/Users/john/Sites/assemble/assemble-midden/test/src/index.hbs:22


on what the Buddha taught
In AN8.3.9 (Akkhaṇasuttaṃ) we find people thinking the world had a chance, an opportunity, to benefit from the Buddha, because he was then there in the world.
But we find the Buddha stating people mistake his being then there in the world for an opportunity. Even with him there, those in hell can't benefit from his Teaching, or animals, or some certain gods, or those living to far away, or those close enough but with to strong wrong views and to confused, or those simply to dumb. For those it is a miss.
There is also the case when a person is capable but the Dhamma is not available, then too it will be a miss. Thus with the teaching from the Buddha now available for us, don't miss out on the opportunity. Study from the sermons so now and then.


To install OCSF, simply compile all the .java files in the client and server directories.
OCSF is a Framework, so this directory contains no main program. To learn how it works, consult the book "Object-Oriented Software Engineering: Practical Software Development using UML and Java" by Lethbridge and Laganière.
To use OCSF, import the "ocsf.client" or "ocsf.server" package in your application code. Make sure that the ocsf directory is in your classpath when you compile your application.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/reduction.20to.20W.20types.html ---
Is there any chance of simplifying the kernel to only support a fixed set of inductive types, and have everything else compile into them? We already do such reduction for nested inductives and mutual inductives. I envision such a move happening when we write a new equation compiler and inductive compiler in lean (which will probably be late in development of lean 4 if not later). The argument about concern for changing the kernel is now greatly reduced because of the theory work I've been doing to make sure that this is consistent
I assume you mean that the kernel would have one type:
inductive W (α : Sort*) (β : α -> Sort*) | intro (x : α) (f : β x -> W) : W
How do you define α
?
See my paper https://github.com/digama0/lean-type-theory/releases/ for details. Actually you need 8 specific inductive types: false
, sigma
, sum
, ulift
, nonempty
, W
, eq
and acc
, from these you can get all the inductive types. (I say "reduction to W" because W does most of the heavy lifting, but you need the others to put it all together.)
Is it common in computer science to have public git repository of papers under progress?
I don't know, I did that because it started getting near book length while people kept asking questions to which I could refer to the parts of the paper that are done
I was originally planning to keep it under wraps until it was ready for publication, but I don't know if it will ever be published as it currently exists, it's more useful as a lean reference
"near book length"?! :rolling_on_the_floor_laughing: You should see papers in my field...
Long paper for us mean over 100 pages
Very long means more than 500
Above 1000 pages people complain
Then papers are split
How dare you call such things "papers"? How do you sleep at night?
as in https://arxiv.org/find/grp_math/1/ti:+AND+HF+HM/0/1/0/all/0/1
Those are novels!

The total for this series HF=HM is 25+133+195+240+276 = 869
So people don't complain
But some people still feel the need to learn about proof assistants (that's me)
Are any of those papers peer reviewed? How long do you wait for your reviews?
That particular series is not yet published
But it is a rather extreme case
And actually my longest paper is only 70 pages long
My paper isn't close to finished yet... I mean it is projected book length
I see. Anyway, it's very nice to have this early release
Yes, people peer review 100 page papers certainly. Perhaps the process is rather different to what goes on in CS though. I basically never get sent conference proceedings to review, but I get sent papers in my area from journals and am sometimes asked to make general comments and sometimes asked to specifically look at the paper, or a part of the paper, and make detailed comments.
Back to W types, @Mario Carneiro do you know what kind of impact your suggestion might have on the performances of type checking?
Oh -- answer to "how long do you wait" is "any time between a few weeks and a year"
(sometimes more)
For a journal? That's faster than what I've seen.
That's one great thing about a theorem prover: you don't have to wait weeks to realize that you messed up
More exactly, I had a conference paper invited for publication in a journal. I submitted in November, got criticism in June of the year after, resubmitted in July and didn't hear about it until March of the following year where I was asked to prepare the camera ready version
As an aside, despite being invited for a special issue on formal methods, some of my reviewers complained that my paper was too formal, that it had too many formulas ...
A lot of computer scientists don't like math. Especially in software engineering
"software engineering" is too hand-wavey :-\
It depends on how you group the syllables: too often it is taken as soft ware-engineering (and you should put quotes around engineering, if you're being exact)
Because of that I have refused to call my research software engineering for a long time until I realized that engineering ethics is lacking to software. Software engineering is the right phrase but it hasn't been seen often. One good way of figuring out if someone is doing actual software engineering is to ask "what do you think of getting sued if your user loses all their data?"
Can I sue Lean if it loses all my proofs?
I'm not sure but at the moment no. I think if you're a paying customer of Coq and that Coq that some proof is valid and that it isn't you can sue them. Or maybe it's in the process of happening
@Simon Hudon It shouldn't affect typechecking speed of stuff that doesn't depend on internal implementation of inductives. The recursor and intros become defs which are almost never unfolded, except that the computation rule may require unfolding stuff; but I think that rfl-lemmas are used here to simplify the process even now, so as long as the computational rule can be registered as a rfl-lemma it should not need to unfold the definitions. The only place where the speed could be affected is in the time it takes to compile an inductive definition, but it shouldn't be much more than is already being done to reduce nested inductives, as well as all the auxiliary functions that get defined in any case (sizeof
and inj_arrow
and no_confusion
etc)
Cool :smile: And does that mean that we no longer add axioms for each new inductive type? I like that idea a lot
Hey can I register my own lemmas as rfl-lemmas, or is that above my pay grade?
@Mario Carneiro Please don't underestimate kernel reduction time. Any and all computation in the kernel is performed using basic ɩ-reduction, rfl-lemmas are completely irrelevant for the kernel. That is, one unfolding of nat.rec
now would probably correspond to two or more ɩ-reduction steps when using the reduction to W
. There is also the associated increase in term size which does not exactly help performance either.
Has this been a problem with working with nested inductives?
or wf recursion
Well we typically don't use definitional reduction for functions defined by well-founded recursion. And yes, the nested inductives are really slow in the kernel. It's not such a big deal because neither well-founded recursion nor generalized inductives are widely used, and then typically not for kernel reduction.
Hm, I wonder if the kernel could make use of rfl-lemmas. That would probably solve this problem and then some, since equation compiler definitions would be usable
Theoretically, yes. (Although you potentially get non-termination, non-confluence, and loss of subject reduction :smile: ) If I get bored, I might even try to implement inductives in trepplein using W
with rfl-lemmas. However, I'm doubtful that Leo will ever pursue that approach. He didn't even use rfl-lemmas generated by the equation compiler in the type context.
Really? I thought they were used by the elaborator ("smart unfolding")
I believe that feature is implemented slightly differently. IIRC we store an auxiliary definition that looks e.g. like nat.add = λ x, λ y, nat.cases_on y ... nat.add ...
and use that for unfolding.
The cases_on
still uses ɩ-reduction.
Of course we don't have to worry about non-confluence and subject reduction since lean never had those to begin with :smile: but I agree that for it to behave properly you want to only use rfl-lemmas coming from structural recursive definitions, and so you would probably need an algebra of such
It might even be possible to have equation lemmas for wf definitions, but only for the underlying acc.rec term, where the hypothesis is exposed, to ensure termination
(yes I'm talking about features that probably will never be in leo lean, but maybe in other typecheckers)
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Python pandas cont
2013-11-01
To call specific column in data frame df[df.columns[2:4]]
To join called rows, in concatenating fashion df[“DateTime”] = [’ ’.join(row) for row in df[df.columns[2:4]].values]
To speifiy the date time foramte in data frame of DPCC dMDI_DT= pa.to_datetime(Time, format=‘%A, %B %d, %Y %H:%M:%S’)
- based on http://www.cyberciti.biz/faq/howto-get-current-date-time-in-python/
- http://stackoverflow.com/questions/12030398/concatenate-multiple-columns-based-on-index-in-pandas
- A best tutorial for visualization in pyhton http://nbviewer.ipython.org/urls/raw.github.com/bolhovsky/notebooks/master/earth-day-data-challenge.ipynb


19
1 Yahweh said to me,
2 "Ezekiel, sing a sad funeral song which will be a parable about the leaders of Israel. Say to the Israelite people,
'It is as though your mother had been a brave female lion
who raised her cubs among other lions.
3 She taught one of them to hunt for other animals to kill,
and he even learned to kill and eat people.
4 When people from other nations heard about him,
they trapped him in a pit.
Then they used hooks
to drag him to Egypt.
5 His mother waited for him to return,
but soon she stopped hoping for that to happen.
So she raised another cub
who also became very fierce.
6 He hunted along with other lions for animals to kill,
and he even learned to kill and eat people.
7 He raped his victims' widows,
and he destroyed cities.
When he roared loudly,
everyone was terrified and abandoned everything they owned.
8 So people of other nations planned to kill him;
ad men came from many places
to spread out a net for him.
They caught him in it.
9 They put him into an iron cage and dragged it with hooks and chains;
they took him to the king of Babylon.
There they locked him up in a mountain prison,
with the result that no one on the hills of Israel ever heard him roar again.'
Also, say to the Israelite people:
10 'It is as though your mother were a grapevine
that was planted along a stream.
There was plenty of water,
so it had lots of branches and produced a lot of grapes.
11 That grapevine grew and became taller than all the nearby trees;
everyone could see that it was very strong and healthy.
And those branches were good for making scepters that symbolize the power of a king.
12 But Yahweh became very angry,
so he pulled up the vine by its roots
and threw it on the ground,
where the very hot winds from the desert dried up all its fruit.
The strong branches wilted and were burned in a fire.
13 Now Yahweh has planted that vine in a hot, dry desert.
14 A fire started to burn its stem,
and then started to burn the branches;
it burned all the grapes.
Now not even one strong branch remains;
they will never become scepters for a king.'
This funeral song must be sung very sadly."


I'm Nels Beckman, a nerd and professional programmer with a PhD. You can check my nerd credentials by visiting my software page which talks about some of my smaller, personal projects, or you can jump directly to my GitHub page. Most of the software I get paid to write is stamped "PROPRIETARY/CONFIDENTIAL" so you can't take a look at it. :-(
I got my PhD at Carnegie Mellon University in glorious Pittsburgh, Penna. USA, under the tutelage of Jonathan Aldrich. The program was in Software Engineering at the Institute for Software Research. If you have the background, and are suitably motivated, you might consider reading my thesis.
In the blog-o-sphere you can find me writing at Blogface.org, or if brevity is your thing, on Twitter at @nolacoaster. For private correspondence, try sending me an email.
Finally, I got all kinds of other weirdo stuff on here, like a list of every book I have read since March 2005 (when I started keeping track), a list of some computer problems I once had but fixed, or a page containing a few portmanteau words that I claim to have invented which is really pretty short but gets me traffic from Google so I keep it up there anyway.


This chapter will attempt to define the concepts behind REST and explain what makes a service RESTful.
REST is often confused with performing a distinct operation depending on the HTTP method, while using more than the GET and POST methods. That's highly misguided at best.
We will first attempt to define REST and will look at what it means in the context of HTTP and the Web. For a more in-depth explanation of REST, you can read Roy T. Fielding's dissertation as it does a great job explaining where it comes from and what it achieves.
REST is a client-server architecture. The client and the server both have a different set of concerns. The server stores and/or manipulates information and makes it available to the user in an efficient manner. The client takes that information and displays it to the user and/or uses it to perform subsequent requests for information. This separation of concerns allows both the client and the server to evolve independently as it only requires that the interface stays the same.
REST is stateless. That means the communication between the client and the server always contains all the information needed to perform the request. There is no session state in the server, it is kept entirely on the client's side. If access to a resource requires authentication, then the client needs to authenticate itself with every request.
REST is cacheable. The client, the server and any intermediary components can all cache resources in order to improve performance.
REST provides a uniform interface between components. This simplifies the architecture, as all components follow the same rules to speak to one another. It also makes it easier to understand the interactions between the different components of the system. A number of constraints are required to achieve this. They are covered in the rest of the chapter.
REST is a layered system. Individual components cannot see beyond the immediate layer with which they are interacting. This means that a client connecting to an intermediate component, like a proxy, has no knowledge of what lies beyond. This allows components to be independent and thus easily replaceable or extendable.
REST optionally provides code on demand. Code may be downloaded to extend client functionality. This is optional however because the client may not be able to download or run this code, and so a REST component cannot rely on it being executed.
A resource is an abstract concept. In a REST system, any information that can be named may be a resource. This includes documents, images, a collection of resources and any other information. Any information that can be the target of an hypertext link can be a resource.
A resource is a conceptual mapping to a set of entities. The set of entities evolves over time; a resource doesn't. For example a resource can map to "users who have logged in this past month" and another to "all users". At some point in time they may map to the same set of entities, because all users logged in this past month. But they are still different resources. Similarly, if nobody logged in recently, then the first resource may map to the empty set. This resource exists regardless of the information it maps to.
Resources are identified by uniform resource identifiers, also known as URIs. Sometimes internationalized resource identifiers, or IRIs, may also be used, but these can be directly translated into a URI.
In practice we will identify two kinds of resources. Individual resources map to a set of one element, for example "user Joe". Collection of resources map to a set of 0 to N elements, for example "all users".
The representation of a resource is a sequence of bytes associated with metadata.
The metadata comes as a list of key-value pairs, where the name corresponds to a standard that defines the value's structure and semantics. With HTTP, the metadata comes in the form of request or response headers. The headers' structure and semantics are well defined in the HTTP standard. Metadata includes representation metadata, resource metadata and control data.
The representation metadata gives information about the representation, such as its media type, the date of last modification, or even a checksum.
Resource metadata could be link to related resources or information about additional representations of the resource.
Control data allows parameterizing the request or response. For example, we may only want the representation returned if it is more recent than the one we have in cache. Similarly, we may want to instruct the client about how it should cache the representation. This isn't restricted to caching. We may for example want to store a new representation of a resource only if it wasn't modified since we first retrieved it.
The data format of a representation is also known as the media type. Some media types are intended for direct rendering to the user, while others are intended for automated processing. The media type is a key component of the REST architecture.
Messages must be self-descriptive. That means that the data format of a representation must always come with its media type (and similarly requesting a resource involves choosing the media type of the representation returned). If you are sending HTML, then you must say it is HTML by sending the media type with the representation. In HTTP this is done using the content-type header.
The media type is often an IANA registered media type, like text/html
or image/png
, but does not need to be. Exactly two things are important for respecting this constraint: that the media type is well specified, and that the sender and recipient agree about what the media type refers to.
This means that you can create your own media types, like application/x-mine
, and that as long as you write the specifications for it and that both endpoints agree about it then the constraint is respected.
The last constraint is generally where services that claim to be RESTful fail. Interactions with a server must be entirely driven by hypermedia. The client does not need any prior knowledge of the service in order to use it, other than an entry point and of course basic understanding of the media type of the representations, at the very least enough to find and identify hyperlinks and link relations.
To give a simple example, if your service only works with the application/json
media type then this constraint cannot be respected (as there are no concept of links in JSON) and thus your service isn't RESTful. This is the case for the majority of self-proclaimed REST services.
On the other hand if you create a JSON based media type that has a concept of links and link relations, then your service might be RESTful.
Respecting this constraint means that the entirety of the service becomes self-discoverable, not only the resources in it, but also the operations you can perform on it. This makes clients very thin as there is no need to implement anything specific to the service to operate on it.


Disable the Source View
Pressing
⌘+⇧+X
in a text selection will trigger the page direction changes in
Firefox 53.0.2
.


Voiceovers and Animation(Tompti Inc. at Storychatter.com)
gavel
Hardware
Arduino and Vex Robotics
directions_run
Soccer
2017-2016 MHS Freshmen,
2015-2016 Jersey United U14 NPL,
2014-2015 Millburn Rockets,
2013-2014 U.S. Parma Stallones,
2012-2009 Millburn Rockets
Portfolio
Stuff About Me.
Story Chatter
Video Production And VoiceOver
City Speaks
Mobile Application Development
UOI
Mobile Application Development
MHS Digital Learning Center
Web Development
Millburn Hacks
Millburn Highschool Hackathon Financial and Outreach Organizer
Vex Robotics
Hardware/Building: 2014-PRESENT
StoryChatter.Com
I Pioneered Its Creation And Managed The Creation Of The Animated Videos and Voice-Overs.
With Storychatter, your child can form meaningful and long lasting connections with his or her heritage. This allows for your child to mirror the same pride that you have in the nation, religion, or leaders that made you, you.
Spreading this sense of pride and recognition is not only limited to your child; a portion of our profits from your subscriptions will go towards one less fortunate child in India gaining the education that everyone rightfully deserves. At StoryChatter we have made it a goal to bring this ideal forth in those children in India who do not have the ability or opportunity to grow or flourish due to their lack of education.
All children should have the opportunity to connect with their heritage, and thrive under the right teachings, and Story Chatter’s main objective is to make this a reality.
Take A Look at StoryChatter.Com .
Date: 2011 - PRESENT
Name: Story Chatter
Category: Cultural / Religous
City Speaks
Complete IOS Front-End And Back-End Development
Ever wanted to discover the town you live in?
Find new people, clubs, and organizations in your area?
Instantly discover and chat with people in your area?
City Speaks uses technology to enable a close-knit, and wise communnity, which modern day life is lacking, while ensuring safety through location based emergency warnings.
It features a simple, intuitive user interface in which there are chatrooms both public and private (based on the preference of its creator) which are tagged with locations and only appear to those within the specified region, to ensure only people of the same community can view the chatroom. City Speaks also allows you to discover people around you and chat with them.
Currently On The IOS APP Store... Check It Out Here.
UOI
Complete IOS Front-End And Back-End Development
Do your friends never return your favors?
Ever find yourself doing more favors than you receive?
Or have trouble keeping track of who owes you what?
UOI aims to eliminate just that!
UOI (you owe I) keeps track of who you owe, what you owe, and who owes you. So next time you're in trouble you can cash in on one of your favors!
UOI also provides paticence and credibility ratings for your friends, so you know exactly who you are dealing with.
By implementing a modern and simple UI, it enables you to keep of everything.
Favors are a two way street, So remeber UOI but also IOU
Currently On The IOS APP Store... Check It Out Here.
MHS Digital Learning Center
Technical Lead and Co-Founder
(Currently in-progress): I have pioneered an effort to bring Millburn High School's circiculum online. In an effort to make knowledge easier than ever to access I have partnered with teachers to provide unique and interesting videos on confusing and complicated in-school topics - Not affiliated with Millburn High School, NJ
Though its still under construction and not yet completed you can see the progress at MHSDigitalLearning.tech.
hackMHS III
Financial and Outreach Organizer
hackMHS III on December 3 is a Hackathon in Millburn High School with over 150 "hackers". I contacted hundreds of companies and local small businessess to sponser and make this hackathon possible. Later I also worked on outreach to get "hackers" to attend and spread awareness of the event
I have been doing Vex Robotics for multiple years, taking a leadership postition on each of my teams. Untill 2017 - 2016 none of my schools had provided me with any robotics courses/classes/ or opportunity; however I did not let that stop me from pursuing my interests
In 2016 - 2017: I am the first and only Freshman Member of the Millburn High School Vex Robotics Team. In 2015-2016 : Leader of a non-school related VEX State Finalist Robotics Team, In 2014 - 2015 : Leader of a non-school related VEX IQ World Finalist Robotics Team


Step 1: Login to Uber
- Login to Uber
- Enter your mobile number
- Text YOUR_PHONE_NUMBER from the number you entered...
- For a list of Uber products available at the start address: Products/START ADDRESS
- To request an Uber product from a start address to an end address: PRODUCT NAME/START ADDRESS/END ADDRESS
- You will receive a text with, based on the text you sent, either a list of Uber products or confirmation of your Uber request. If you requested an Uber product, you will receive a text when your request has been accepted.
To make this suitable for production, you would need to disable the use of the sandbox and no longer use the "/v1/sandbox/requests/{request_id}" endpoint to manually modify the status of a request. For now, most functionality is operational and the hack is suitable for demo purposes. Requesting an Uber product currently results in receiving updates via text with the sandbox's demo data for the "processing" and "accepted" request statuses.


sudo
doesn't affect redirects. Use ..| sudo tee file
sudo echo 'export FOO=bar' >> /etc/profile
echo 'export FOO=bar' | sudo tee -a /etc/profile > /dev/null
Redirections are performed by the current shell before sudo
is started. This means that it will use the current shell's user and permissions to open and write to the file.
tee
is a simple command that opens and writes to files without help from the shell, which means that it will use the permissions that sudo
grants it.
There is nothing special about tee
. It's just the simplest command that can both truncate and append to files without help from the shell. Here are equivalent alternatives:
Truncating:
echo 'data' | sudo dd of=file
echo 'data' | sudo sed 'w file'
Appending:
echo 'data' | sudo awk '{ print $0 >> "file" }'
echo 'data' | sudo sh -c 'cat >> file'
If you want to run a command as root but redirect as the normal user, you can ignore this message.


BRICKCEPTION
Brickception is a fun take on the classic breakout game with popup windows!
Enable popup windows to play this game. Two popup windows are launched - the main game window and the paddle window. (Sorry, you cannot play this game where popups are not supported, e.g., mobile devices)
Paddle window has a nested game! You need to win in both the windows.
Moving the paddle window moves the paddle. The ball of the main window bounces off the top of the paddle window.
Developed by Preet Shihn
Original concept by Ryo Suzuki
Source code available on
GitHub
Level:
Balls left:
Score:
High Score:


Plugin available to download.
npm install -g typescript
Provides a command-line compiler.
tsc source.ts
TypeScript adds optional static types to JavaScript, this means that you can declare a typed variable:
let variableName: typeScriptType = value;
And the type of this variable will be the same in your development process thanks to the type checking at compile time:
let a: string = “Hello TypeScript!”; // string
a = 0; // Error!
The transpiler would alert us of this error with a message like: Type “number” is not assignable to type” string”.
TypeScript adds new capabilities to these functions, one of them being the capability to declare the type of each parameter in order to create the signature:
function add(x: number, y: number) {
return x + y;
}
We can also add a return type, but TypeScript is able to infer it with the return statements:
function add(x: number, y: number): number {
return x + y;
}
Optional:
function buildName(firstName: string, lastName?: string) {
if (lastName)
return firstName + " " + lastName;
else
return firstName;
}
Default:
function buildName(firstName: string, lastName = "Smith") {
return firstName + " " + lastName;
}
TypeScript lets us specify an overload list to supply multiple types for the same function. That way, we can describe to the type system exactly what our function accepts and what it returns:
function addOvverload(x: string, y: string): string;
function addOvverload(x: number, y: number): number;
function addOvverload(x, y): any {
return x + y;
}
In general, a class is composed of a name, attributes and methods. The syntax to create a simple class looks like this:
class Person {
name: string;
constructor(name : string) {
this.name = name;
}
greet() {
console.log("Hi! I'm " + this.name);
}
}
class Animal {
move(distanceInMeters: number = 0) {
console.log(`Animal moved ${distanceInMeters}m.`);
}
}
class Dog extends Animal {
bark() {
console.log('Woof! Woof!');
}
}
const dog = new Dog();
To hide external access to the state of an object and control access to this state, TypeScript uses modifiers:


Admin Login
User Login
Registration
Home
Food
Facilities
About
Contact
1.Farmers Breakfast
(Scrambled eggs, patty sausage and hash browns)
Price: /plate
2.French Toast
(French toast served with bacon and fresh fruit medley)
Price: /plate
3.Healthy Plate
(Assorted yogurt, your choice of granola or oat bran muffin and fresh fruit medley)
Price:/plate
4.Denver Omelet
(Ham, green pepper, onion, tomato and Wisconsin cheddar cheese served with hash browns)
Price: /plate
5.CYO Omelet
(Your choice of 4 ingredients served with hash browns)
Price: /plate
6.Buffet A(Breakfast)
(Assorted juices, fresh fruit medley, scrambled eggs, link sausage, hash browns and assorted muffins)
Price: /plate
7.Buffet B(Breakfast)
(Assorted juices, fresh fruit medley, French toast, cheddar sausage pan omelet and sliced ham)
Price: /plate
8.Buffet C(Breakfast)
(Assorted juices, warm assorted muffins, chorizo and pepper jack pan omelet, sausage, bacon and Santa Fe hash browns)
Price: p/plate


PyCon Agreement Among Organizers, Speakers, Sponsors, and Volunteers
- I agree that Florida PyCon is meant to benefit the local tech community through a live event and the broader tech community through the sharing of online video and other materials.
- I agree that a Florida PyCon is a casual, locally- and volunteer-organized event, focused on Python and reflecting the Python community it represents.
- I understand that Florida PyCon organizers, speakers, sponsors, and volunteers are expected to support the Florida PyCon event and its principles.
- I understand that the principles of the Florida PyCon event include:
- no discrimination or harassment on the basis of economic or social status, physical appearance, race, color, ethnic origin, national origin, creed, religion, political belief, sex, sexual orientation, gender identity, marital status, age, or disability
- no incitement to violence or promotion of hate
- no spammers
- no jerks
- respecting the Florida PyCon logo and Python trademark
- I agree that Florida PyCon is a not-for-profit event, organized with budget and funding transparency.
- I agree that I am not an employee of Florida PyCon or any subsidiary of the PyCon Conferences, and am participating in Florida PyCon exclusively as a volunteer.
If you believe an individual has violated this Code of Conduct, please email<EMAIL_ADDRESS>or locate Organizers at the Help Desk where your badge was picked up.
Violation of the Code of Conduct after review may lead to permanent removal from the convention with no refund.
Florida PyCon AV Release
By participating in Florida Pycon Conference/Event Oct 7th 2017, I understand that portions of the event will be photographed and/or audio/video-recorded for use by Florida Pycon, Pycon Conferences, or news media. I agree that the Florida Pycon, Pycon Conferences, and news media, has the right and permission to use and publish such media — which may include my name, likeness, voice, city/state of residence, or photograph — for any purpose in any format, online and/or offline, now and hereafter without further compensation, permission, or notification. I understand that all official recordings from the event are the exclusive property of the Florida Pycon, available under the Creative Commons Attribution-ShareAlike license for general use, and I do not ask for nor expect compensation or notification of the use of official recordings or photographs in which I appear or speak.


Tip: On Windows computers, use an application such as 7-Zip to uncompress files with a .gz exension. To cite this dataset, see the public link on the Source dataset tab.
{% endif %}
{% if not full_dataset %}
Generate Export Actions
{% if total_tweets > 0 %}
{% else %}
No tweets found with the current dataset parameters. Please refine the dataset parameters to create an export.


Server Status
Currently service discovery server contains
SOME
registered services.
Name
Address
Statistics
Method
Statistics
Statistic
Value [ms]


Thomas Vanderwyst
Interactive Media Design Porfolio
Traditional
Digital
Photography
Programming
Contact and About
Ice Peak
2D Puzzle-Platforming Game
Play Here!
Life in a Pandemic
Web Based Edu-game
(No Longer Hosted)
Cookbook Coalition
Online Recipe Database
(No Longer Hosted)


My Results
Vote #1:
aaa
Vote #2:
aaa
Select Category
Casual
Dating
Professional
View Results
Start a Vote


| 1 | /* | |
| 2 | * To change this license header, choose License Headers in Project Properties. | |
| 3 | * To change this template file, choose Tools | Templates | |
| 4 | * and open the template in the editor. | |
| 5 | */ | |
| 6 | package fi.nakki.aihelotto.io; | |
| 7 | ||
| 8 | import java.io.*; | |
| 9 | import java.util.*; | |
| 10 | import fi.nakki.aihelotto.subject.Subject; | |
| 11 | ||
| 12 | /** | |
| 13 | * This class handles reading the file and writing to it. This class should only | |
| 14 | * be used through SubjectLogic. | |
| 15 | * | |
| 16 | * @author nakki | |
| 17 | */ | |
| 18 | public class SubjectIO { | |
| 19 | ||
| 20 | private File f; | |
| 21 | ||
| 22 | /** | |
| 23 | * Constructor for the class, to which the file path is given as a String. | |
| 24 | * | |
| 25 | * @param file path to file containing all subjects | |
| 26 | */ | |
| 27 | public SubjectIO(String file) { | |
| 28 | this.f = new File(file); | |
| 29 | } | |
| 30 | ||
| 31 | /** | |
| 32 | * This method reads all the subjects from the file, puts them in a List and | |
| 33 | * returns it. | |
| 34 | * | |
| 35 | * @return list of all subjects found in the file | |
| 36 | */ | |
| 37 | public List<Subject> readSubjects() { | |
| 38 | List subjects = new ArrayList<>(); | |
| 39 | String line; | |
| 40 | Subject subject; | |
| 41 | BufferedReader buffered; | |
| 42 | try { | |
| 43 | FileReader fileReader = new FileReader(this.f); | |
| 44 | buffered = new BufferedReader(fileReader); | |
| 45 |
1
1. readSubjects : negated conditional → KILLED |
while ((line = buffered.readLine()) != null) { |
| 46 | String[] s = line.split(";"); | |
| 47 |
1
1. readSubjects : negated conditional → KILLED |
if (s.length == 3) { |
| 48 | subjects.add(new Subject(s[0], s[1], s[2])); | |
| 49 | } | |
| 50 | } | |
| 51 |
1
1. readSubjects : removed call to java/io/BufferedReader::close → SURVIVED |
buffered.close(); |
| 52 |
1
1. readSubjects : removed call to java/io/FileReader::close → SURVIVED |
fileReader.close(); |
| 53 | } catch (IOException e) { | |
| 54 |
1
1. readSubjects : removed call to java/io/IOException::printStackTrace → NO_COVERAGE |
e.printStackTrace(); |
| 55 | } | |
| 56 |
1
1. readSubjects : mutated return of Object value for fi/nakki/aihelotto/io/SubjectIO::readSubjects to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return subjects; |
| 57 | } | |
| 58 | ||
| 59 | /** | |
| 60 | * This method reads all the groups from the file containing all subjects | |
| 61 | * and returns them as a List of Strings. | |
| 62 | * @return all the groups found in the file given to this instance | |
| 63 | */ | |
| 64 | public List<String> readGroups() { | |
| 65 | List groups = new ArrayList<>(); | |
| 66 | String line; | |
| 67 | BufferedReader buffered; | |
| 68 | try { | |
| 69 | FileReader fileReader = new FileReader(this.f); | |
| 70 | buffered = new BufferedReader(fileReader); | |
| 71 |
1
1. readGroups : negated conditional → KILLED |
while ((line = buffered.readLine()) != null) { |
| 72 | String[] s = line.split(";"); | |
| 73 |
1
1. readGroups : negated conditional → KILLED |
if (s.length == 3) { |
| 74 |
1
1. readGroups : negated conditional → KILLED |
if (!groups.contains(s[1])) { |
| 75 | groups.add(s[1]); | |
| 76 | } | |
| 77 | } | |
| 78 | } | |
| 79 |
1
1. readGroups : removed call to java/io/BufferedReader::close → SURVIVED |
buffered.close(); |
| 80 |
1
1. readGroups : removed call to java/io/FileReader::close → SURVIVED |
fileReader.close(); |
| 81 | } catch (IOException e) { | |
| 82 |
1
1. readGroups : removed call to java/io/IOException::printStackTrace → NO_COVERAGE |
e.printStackTrace(); |
| 83 | } | |
| 84 |
1
1. readGroups : mutated return of Object value for fi/nakki/aihelotto/io/SubjectIO::readGroups to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return groups; |
| 85 | } | |
| 86 | ||
| 87 | /** | |
| 88 | * This method writes all the subjects given to it in the subjects-parameter | |
| 89 | * to the SubjectIO-instance's file. | |
| 90 | * @param subjects list of subjects to write to file | |
| 91 | */ | |
| 92 | public void writeSubjects(List<Subject> subjects) { | |
| 93 | List<Subject> existingSubjects = this.readSubjects(); | |
| 94 | try { | |
| 95 | FileWriter fileWriter = new FileWriter(this.f, true); | |
| 96 | BufferedWriter buffered = new BufferedWriter(fileWriter); | |
| 97 |
1
1. writeSubjects : negated conditional → NO_COVERAGE |
for (Subject s : subjects) { |
| 98 |
1
1. writeSubjects : negated conditional → NO_COVERAGE |
if (existingSubjects.contains(s)) { |
| 99 | continue; | |
| 100 | } | |
| 101 | buffered.append(s.getName() + ";"); | |
| 102 | buffered.append(s.getGroup() + ";"); | |
| 103 | buffered.append(s.getDescription()); | |
| 104 |
1
1. writeSubjects : removed call to java/io/BufferedWriter::newLine → NO_COVERAGE |
buffered.newLine(); |
| 105 | } | |
| 106 |
1
1. writeSubjects : removed call to java/io/BufferedWriter::close → NO_COVERAGE |
buffered.close(); |
| 107 |
1
1. writeSubjects : removed call to java/io/FileWriter::close → NO_COVERAGE |
fileWriter.close(); |
| 108 | } catch (IOException e) { | |
| 109 |
1
1. writeSubjects : removed call to java/io/IOException::printStackTrace → NO_COVERAGE |
e.printStackTrace(); |
| 110 | } | |
| 111 | } | |
| 112 | ||
| 113 | } | |
Mutations | ||
| 45 |
1.1 |
|
| 47 |
1.1 |
|
| 51 |
1.1 |
|
| 52 |
1.1 |
|
| 54 |
1.1 |
|
| 56 |
1.1 |
|
| 71 |
1.1 |
|
| 73 |
1.1 |
|
| 74 |
1.1 |
|
| 79 |
1.1 |
|
| 80 |
1.1 |
|
| 82 |
1.1 |
|
| 84 |
1.1 |
|
| 97 |
1.1 |
|
| 98 |
1.1 |
|
| 104 |
1.1 |
|
| 106 |
1.1 |
|
| 107 |
1.1 |
|
| 109 |
1.1 |


A common and simple question simple that interviewers use is how to find an item in a sorted list. The answer is always obvious because it is one the first algorithms every programmer learns, binary search. The concept is powerful and simple. Here is a sample of code performing the search in Java :
However for the first time ever I was asked to do something more difficult. Find the k-th occurrence of an item in an array. The method I was told to write should do the following: return the index of the k-th value if it exists, return -1 otherwise. Sounds simple enough.
The naive way is obviously the O(n)
method of searching through the entire array and finding the item then finding if it appears at least k times. My goal is to reduce this to O(lgn)
.
So first lets use the naive method and find the first occurrence of what we want. But how do we do this. This is the same problem we started of with but instead of k-th we want the 1st occurrence. True, however this is actually slightly easier.
We can achieve this by editing the binary search algorithm by just a few lines that try to learn if it is the first occurrence as such:
So now this method returns the index of the 1st occurrence. Well then we are done because now we can just add k to the index and check of existence as such:


YOURDOMAIN.COM is for sale!
YOURDOMAIN.COM is a strong, memorable brandable name averaging about 1,000 hits per day.
This domain could be yours!
Buy Now $1500


Appeal Court affirms Orji Kalu's Senate win - Premium Times Nigeria
by Agency ReportThe Court of Appeal in Owerri on Thursday affirmed the election of Orji Kalu, senator representing Abia North Senatorial District.
In a unanimous decision, the court held that the lower tribunal, which upturned Mr Kalu’s election, erred on several counts.
Delivering the judgement, the judge, R. A. Adah, said the grounds upon which the election tribunal predicated its verdict were not tenable in law.
He said the tribunal’s decision to grant the petitioner’s reliefs, which he did not ask for, was unacceptable in law.
Elated
Addressing reporters at the end of the judgment, counsel for Mr Kalu, Perfect Okorie, said “the relief the petitioner, Sen. Mao Ohuabunwa, asked for was for the nullification of the election in Bende and Isiukwuato.
Mr Okorie said the tribunal “granted strange reliefs and nullified elections in some polling units in Ohafia and Arochukwu.”
The appeal court further said that Mr Ohuabunwa literally dumped his avalanche of documents on the tribunal without calling witnesses to tie the documents to his case.
It maintained that in law, the petitioner must establish proof by bringing witnesses, who would tie the documents to the substance of the case.
Maduka Okoro, media aide to Mr Kalu, described the judgement of the Appeal Court as “victory for democracy and the people of Abia in general.”
Mr Okoro told the News Agency of Nigeria (NAN) in Umuahia the judgement “was greeted by wide celebration in all parts of Abia”, where Mr Kalu was governor from 1999 to 2007.
Mr Kalu is now the Senate Chief Whip.
He said: “the verdict sparked off jubilation in Igbere, Kalu’s community in Bende Local Government Area, the entire Abia north, including Mao’s Arochukwu and Abia generally.
“It is instructive to note that as former governor, Kalu made positive impact in the lives of the people and every community in Abia.” (NAN)


Add attribute to session!
Send it!
You must have go back to 'Home Section' to check your input parameter.


WebGL Required
ShapeShot requires a browser with WebGL. Try
Google Chrome
.
3D photo courtesy
ShapeShot


Home
Tutorials
about me
sandbox
weather
this me ! :
aahh
hhhh
cat picture goes here
another cat picture goes here
yet another cat picture


*** User 2017-05-03 15:10:33.579 ***
15:10:33.579 [info] Disabling blocking sync...
*** User 2017-05-03 15:10:33.582 ***
15:10:33.582 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-1@antoine-PC'
*** User 2017-05-03 15:10:34.925 ***
15:10:34.925 [info] Enabling membership...
*** User 2017-05-03 15:10:34.926 ***
15:10:34.926 [info] Disabling blocking sync...
*** User 2017-05-03 15:10:34.929 ***
15:10:34.929 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-2@antoine-PC'
*** User 2017-05-03 15:10:36.273 ***
15:10:36.273 [info] Enabling membership...
*** User 2017-05-03 15:10:36.274 ***
15:10:36.274 [info] Disabling blocking sync...
*** User 2017-05-03 15:10:36.277 ***
15:10:36.277 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-3@antoine-PC'
*** User 2017-05-03 15:10:36.445 ***
Joining node: 'node-3@antoine-PC' to 'runner@antoine-PC' at port 33697
*** User 2017-05-03 15:10:36.445 ***
Joining issued: 'node-3@antoine-PC' to 'runner@antoine-PC' at port 33697
*** User 2017-05-03 15:10:36.445 ***
Joining node: 'node-2@antoine-PC' to 'runner@antoine-PC' at port 47651
*** User 2017-05-03 15:10:36.445 ***
Joining issued: 'node-2@antoine-PC' to 'runner@antoine-PC' at port 47651
*** User 2017-05-03 15:10:36.445 ***
Joining node: 'node-1@antoine-PC' to 'runner@antoine-PC' at port 36331
*** User 2017-05-03 15:10:36.446 ***
Joining issued: 'node-1@antoine-PC' to 'runner@antoine-PC' at port 36331
*** User 2017-05-03 15:10:36.507 ***
Waiting for join to complete with manager: partisan_default_peer_service_manager
*** User 2017-05-03 15:10:36.507 ***
Finished.
*** CT 2017-05-03 15:10:36.507 *** COVER INFO
Adding nodes to cover test: ['runner@antoine-PC']
*** CT 2017-05-03 15:10:36.513 *** COVER INFO
Successfully added nodes to cover test: []
*** User 2017-05-03 15:10:44.532 ***
Case finished: filter_test
*** User 2017-05-03 15:10:51.584 ***
15:10:51.584 [info] Application lasp exited with reason: stopped
*** User 2017-05-03 15:10:51.585 ***
15:10:51.585 [info] Application partisan exited with reason: stopped
=== Ended at 2017-05-03 15:10:51
=== successfully completed test case
=== Returned value: ok
Test run history
| Top level test index


This is a site to help you prepare for a DjangoCon 2019 tutorial called Web Application Security with Django.
By the time you see this page, you should have already received an invitation to our Slack workspace. If you haven't, email Jacinda.
You should have access to a few public channels and exactly one private group channel for your group. Let Jacinda know if this isn't the case.
This site has no relationship with with Twitter, Inc.


Object
class, in the java.lang
package, sits at the top of the class hierarchy
tree. Every class is a descendant, direct or indirect, of the
Object
class. Every class you use or write inherits the
instance methods of Object
. You need not use any of these methods, but,
if you choose to do so, you may need to override them with code that is
specific to your class. The methods inherited from Object
that are
discussed in this section are:
protected Object clone() throws CloneNotSupportedException
public boolean equals(Object obj)
protected void finalize() throws Throwable
public final Class getClass()
public int hashCode()
public String toString()
The notify
, notifyAll
, and
wait
methods of Object
all play a part in synchronizing the
activities of independently running threads in a program, which
is discussed in a later
lesson
and won't be covered here. There are five of these methods:
public final void notify()
public final void notifyAll()
public final void wait()
public final void wait(long timeout)
public final void wait(long timeout, int nanos)
clone
method.
You can get information on the correct usage
of these methods in the book
Effective Java by Josh Bloch.
Cloneable
interface, you can use the clone()
method to create a copy
from an existing object. To create a clone, you write:
aCloneableObject.clone();
Object
's implementation of this method checks to
see whether the object on which clone()
was invoked
implements the Cloneable
interface. If the object
does not, the method throws a CloneNotSupportedException
exception.
Exception handling will be covered in a later
lesson.
For the moment, you need to know that clone()
must be declared as
protected Object clone() throws CloneNotSupportedException -- or -- public Object clone() throws CloneNotSupportedException
clone()
method to override the one in Object
.
If the object on which clone()
was invoked does implement
the Cloneable
interface, Object
's
implementation of the clone()
method creates an
object of the same class as the original object and initializes
the new object's member variables to have the same values as
the original object's corresponding member variables.
The simplest way to make your class cloneable is
to add implements Cloneable
to your class's declaration.
then your objects can invoke the clone()
method.
For some classes, the default
behavior of Object
's clone()
method
works just fine. If, however, an object contains a reference to an external object,
say ObjExternal
, you may need to override clone()
to get
correct behavior. Otherwise, a change in ObjExternal
made by one object will
be visible in its clone also. This means that the original object and its clone are not
independent—to decouple them, you must override clone()
so that
it clones the object and ObjExternal
. Then the original object
references ObjExternal
and the clone references a clone of
ObjExternal
, so that the object and its clone are truly independent.
equals()
method compares two objects for equality
and returns true
if they are equal. The
equals()
method provided in the Object
class uses the identity operator (==
) to determine
whether two objects are equal. For primitive data types, this gives the correct
result. For objects, however, it does not. The equals()
method
provided by Object
tests whether the object references
are equal—that is, if the objects compared are the
exact same object.
To test whether two objects are equal in the sense of equivalency
(containing the same information),
you must override the equals()
method.
Here is an example of a Book
class
that overrides equals()
:
public class Book { ... public boolean equals(Object obj) { if (obj instanceof Book) return ISBN.equals((Book)obj.getISBN()); else return false; } }
Book
class for equality:
Book firstBook = new Book("0201914670"); //Swing Tutorial, 2nd edition Book secondBook = new Book("0201914670"); if (firstBook.equals(secondBook)) { System.out.println("objects are equal"); } else { System.out.println("objects are not equal"); }
objects are equal
even
though firstBook
and secondBook
reference
two distinct objects. They are considered equal because the
objects compared contain the same ISBN number.
You should always override the equals()
method if
the identity operator is not appropriate for your class.
equals()
, you must override hashCode()
as well.
Object
class provides a callback method,
finalize()
, that may be invoked on an object when it
becomes garbage. Object
's implementation of finalize()
does nothing—you can override finalize()
to do cleanup, such as
freeing resources.
The finalize()
method may be called automatically by the system,
but when it is called, or even if it is called, is uncertain. Therefore,
you should not rely on this method to do your cleanup for you.
For example, if you don't close file descriptors in your code after
performing I/O and you expect finalize()
to close them for you,
you may run out of file descriptors.
getClass
.
The getClass()
method returns a Class
object, which has methods you can use to get information about the class, such
as its name (getSimpleName()
), its superclass (getSuperclass()
),
and the interfaces it implements (getInterfaces()
). For example, the following
method gets and displays the class name of an object:
void printClassName(Object obj) { System.out.println("The object's class is " obj.getClass().getSimpleName()); }
Class
class, in the java.lang
package, has a large number of methods (more than 50).
For example, you can test to see if the class is an
annotation (isAnnotation()
), an interface (isInterface()
), or an enumeration
(isEnum()
). You can see what the object's fields are (getFields()
)
or what its methods are (getMethods()
), and so on.
hashCode()
is the object's hash code, which
is the object's memory address in hexadecimal.
By definition, if two objects are equal, their hash code must also be equal. If you override
the equals()
method, you change the way two objects are equated and
Object
's implementation of hashCode()
is no longer valid. Therefore,
if you override the equals()
method, you must also override the
hashCode()
method as well.
toString()
method in your classes.
The Object
's toString()
method returns a
String
representation of the object, which is very useful for debugging.
The String
representation for an object depends
entirely on the object, which is why you need to override toString()
in your classes.
You can use
toString()
along with System.out.println()
to display a text representation of an object, such as an instance
of Book
:
System.out.println(firstBook.toString());
toString()
method,
print something useful, like this:
ISBN:<PHONE_NUMBER>; The JFC Swing Tutorial; A Guide to Constructing GUIs, 2nd Edition


Before Change
"require the {} to be strictly positive definite."
.format(*((matrix_name,) * 3)))
if return_inverse:
M_inv = np.dot(u / s, u.T)
return M, M_inv
else:
return M
After Change
"require the `{}` to be strictly positive definite."
.format(*((matrix_name,) * 2)))
elif not cov_is_definite:
warnings.warn("The covariance matrix is not invertible: "
"using the pseudo-inverse instead."
"To make the covariance matrix invertible"
" you can remove any linearly dependent features and/or "
"reduce the dimensionality of your input, "
"for instance using `sklearn.decomposition.PCA` as a "
"preprocessing step.")
M = _pseudo_inverse_from_eig(w, V)
if return_inverse:
return M, M_inv


Nightly builds of LLDB are packaged and tested from trunk:
Debian packages are available for LLDB 3.2 and later.


This application is a JavaScript standalone application to generate password cards. You can put it on your own webserver or use it from your harddrive.
The cards print exactly in credit card size and can be used to generate passwords. The advantage: the passwords are strictly separated from your electronic devices.
The idea is from the german magazine c't, issue 18/2014, p. 92. https://www.heise.de/ct/ausgabe/2014-18-Werkzeuge-gegen-das-Passwort-Chaos-2283736.html
The generated cards look like the one above. Because they are generated in real time and do not persist on computing devices (if you exercise effective printer management hygene), they can be employed in ways that resist broad categories of attack. This approach has no magic, though, so risk analysis of your password lifecycle practices is still an important regular exercise.
Assume you have an account at example.com. You take the first four letters of the domain name ("exam") and lookup the three letter combinations in the first row of the matching columns, that is s%5
for the "e", v3O
for the "x", 8v(
for the "a" and finally c5L
for the "m". Your first password for your account at example.com is s%5v3O8v(c5L
.
When it is time to change your password you generate a new one using the second row (and then the next, and so on). After nine passwords, maybe you should generate a new card and migrate to that over time(?). Again, this is not perfect. It is a time-tested option that has a given attack surface -- one that is different from many other password management options


| | |
- compute_predictions(user, engine)
- A simple helper function that computes predictions with all the algorithms at the same time of a user. Used for plots.
:param user: the user
:param engine: the engine
:return:
- compute_scores_all_algorithms(data, interations, incremented_trait_limit=False)
- A function that computed scores for x amount of users. With helps of other classes in this script.
:param data: the dataset
:param interations: amount of iterations (new users)
:param incremented_trait_limit: determines if the trait_limit should increment or not. Used for different plots
:return: the predictions of each algorithm with the length of 'iterations'
- csv_reader = reader(...)
- csv_reader = reader(iterable [, dialect='excel']
[optional keyword args])
for row in csv_reader:
process(row)
The "iterable" argument can be any object that returns a line
of input for each iteration, such as a file object or a list. The
optional "dialect" parameter is discussed below. The function
also accepts optional keyword arguments which override settings
provided by the dialect.
The returned object is an iterator. Each iteration returns a row
of the CSV file (which can span multiple input lines).
- plot_data(title, algorithm_data, yticks, ylabel, xlabel, savefig)
- The function that plots the info
:param title: title of the plot
:param algorithm_data: the amount of lines, their labels, colors etc.
:param yticks: The yaxis steps
:param ylabel: the y label
:param xlabel: the x labl
:param savefig: filepath to save it to
:return: None
- plot_engine_x_candidates(data, x=101)
- A function that plots x amount of candidates and the prediction of half their scores.
:param data: the dataset
:param x: the amount of candidates to plot
:return: Nothing
- plot_engine_x_traits(data)
- A function that plots all the traits and incrementing the known scores by 1 each iteration
:param data: the dataset
- sqrt(x, /)
- Return the square root of x.
|