I feel fortunate that I found my passion early in college. Entering GW as a student in the arts and sciences school, I quickly found my niche in their engineering school instead and transferred. From there, I dove in headfirst into circuit theory, physics, and computer programming.
Currently a Masters candidate at Northwestern, I'm building off what I learned at GW, covering concepts like robotic manipulation, embedded systems, human-compter interaction and artificial intelligence.
After spending two years working in software development and consulting, I wanted to further my technical skills in engineering. Drawn by the current breakthroughs in robotics and artificial intelligence, I joined the MSR Program at Northwestern so I could pursue a career that explores these fields.
Currently, I am studying the fundamentals of robotic control and design. Later this year I plan on taking courses in machine learning and advanced robotics and mechatronics.
 As a part of the Honors Program I took courses in philosophy and literature to develop my speaking, writing and critical thinking skills which I could effectively integrate into my engineering curriculum and my capstone senior design project.
Eager to volunteer my free time, I was heavily involved in a number of extra curricular programs. My most meaningful was serving the GW community as a member of GW Class Council, a student government organization that focused on enriching student life and defining what it meant to be a Colonial.
I'm a strong believer in travel as a source of education and inspiration. My junior year I spent four months at Boğaziçi University, one of the top universities in Turkey, studying electrical engineering and experiencing a whole new way of life.


I love many vacuous and ridiculous things. Here are some of them:
In short, I love any train-wreck reality television show there is.
I do love movies that are considered to be "cinima", but I have a place in my heart for silly comedies and weird movies too.
If something takes up more room in my very small house and will not get me ahead in this world, JUST TAKE MY MONEY!!!
You may be wondering what my background is. One of the defining things about my background is that I'm an Army brat. My dad was a helipcopter pilot in the Army. That means that I moved around a lot.
Here is a list of the places I've lived:
I have had a large variety of jobs, including being a bartender on West Burnside (pre-gentrification!) and a doughtnuteer at Voodoo Doughnuts! I have also worked in retail, as a hair stylist, waitress, barista, and currently I am a driver.
I decided to try computer programming because I want to start a career. I've had a lot of jobs I've enjoyed, and some I haven't, but there hasn't been a lot of room for growth in these positions. The tech industry will only keep growing. I've gone from having an Apple IIc in my house as a child to having an iPhone now that I'm an adult. I've seen how tech has grown in leaps and bounds and it doesn't seem to have any limits. I'm finding my class at Epicodus to be challenging yet rewarding.
I have created several projects while attending Epicodus. Here are a few:
These may seem pretty simple and easy to you, but I assure you every single thing I've accomplished in this class has been hard for me to figure out. I just keep trying though!
"Ever tried. Ever failed. No matter. Try again. Fail again. Fail better."
Now for the things I enjoy while enduring the tedium of this life!
Knitting
Like coding, I found knitting to be extremely difficult when I started. In fact, I tried it multiple times before I knit my first project. I am so proud of that first scarf I knit even if when I look back on it now I see how flawed it is.
Here are some examples of things I've knitted:


Resumé
Blog
TBA
An online portfolio with cross-browser compatability and responsive design. Built quickly as a side project using Bootstrap, jQuery and GitHub Pages
A web app that streamlines the feedback process of Computer Science assignments. Built using Python, Django, Bootstrap, jQuery, LESS and CodeMirror.


{%extends 'base.html'%} {% block content %}
In today's fast paced world, we lack time to just sit down and know what is happening aroud the world.
View storiesPublished on: {{article.publishedAt}}
Publisher: {{article.author}}
{{article.description}}
View story


The scale3d() CSS function defines a transformation that resizes an element in 3D space. Because the amount of scaling is defined by a vector, it can resize different dimensions at different scales. Its result is a Methods of 3D transform translate, scale and rotate: please refer to built-in ’browser inspection' to view your selection of code
Excercise: transform-scale3d the elements.
Solution: Solution code


Editing Problem
ProblemId
Title:
Language:
C
JAVA
Section:
Description:
Examples:
Explaination:
Instructor Code:
Solved Code:
User Code:
Test Cases:
Description:
Input:
Output:
Description
Input
Sample Output
Action
{{testCase.desc}}
{{testCase.input}}
{{testCase.expectedOutput}}
Updated Successfully!!
Submit
Preview
Run


Dear W. W. Norton and Company,
It’s sort of important who I am but really only to me. For your archives. I’m not seeking publication just participation in history. I wrote something that an encyclopedia’s worth of response could be written in response to. I did the required step of submitting this piece to a contest and it did not place. I have written a piece of American History.
I am submitting for Historical Records in American History a work.
I have no federal copyright for this work as of yet.
That is forthcoming with finance.
As a work of history circa America 2015 I submit :
Title: The Moment the Bible was RequisitionedSincerely,
Nicholas Lawson
“James, you requisitioned a book. How about this. We’ll take the wildly successful Torah and write a book that gets essentially attached to the end of it. Let’s extend an ancient holy text and start with a story about a man named Jesus that society hates so much they end his life and then feels love for after he survives their sincere attempt to end his life for flipping over the tables of the money changer’s temple. “Said the Famous Hollywood Book Producer of the Middle Ages.
“James, if you really want a book that is going to sell, write a book and couple it with a book that has a history of successfully selling. I got this Torah right here, I can rewrite that in English. Then to produce Kingly Riches for you James, I can attach this other book entitled the New Testament to the Torah that we will rechristen the Old Testament. So now we have a Bible that is comprised of the Old Testament and the New Testament. All of these families desire the Old Testament, they also want new writing so sell them the Old Testament with this New Testament coupled with it out of your production studio.” continued the Famous Hollywood Book Producer of the Middle Ages.
“Riches never ending.” said the Famous Hollywood Book Producer of the Middle Ages.
“I don’t know how interested I am in never ending warfare because if I was this would lead to that.” said James.
“Here is what never ending warfare will do for you. You asked for my services. I will deliver you this. Not only am I producing a book for you that you summoned me to produce, I am in the process of producing an entire business model for you. The book is the product here. It’s the way I am going about producing this product for you. You are going to be involved in rewriting history. There are elements of this history that your population are going to be made aware of. There is this element named Constantine that is going to be written into the education system that you oversee.” said the Famous Hollywood Book Producer of the Middle Ages.
“We are rewriting history?” said James.
“Absolutely. We are in the process of curating indecipherable scrolls that we are going to unveil in literally twenty years just to prove that this book that we are producing now is more ancient than it is. The older we can prove this story is, the more valuable it will seem to people.  You want people devoted to an object. You want people fearful of you and devoted to an object. In being devoted to the object and fearful of you. You have the power you are looking for.” said the Famous Hollywood Book Producer of the Middle Ages.
“Why do I need this much power?” asked James.
“Because life is boring and you were born into a family that made a lot of the right decisions in life and studied architecture and educated itself for more than half a generation and because unlike ninety percent of these people you can read and since you know how to read and you know how to write you can understand at a very fundamental level that objects are created. People that cannot read lack the fundamental understanding that objects are created as I understand it or something I don’t know that is my best guess for what it would be like not to know how to read that the world would be filled with shapes and the shapes the world would be filled with would be indecipherable. Those people singing for money. They don’t know how to read so they sing rhymes because they cannot create more than sound.” said the Famous Hollywood Book Producer of the Middle Ages.
“I love to listen to the people sing.” said James.
“We rope them in too. Have you ever heard of a ‘choir’?” said the Famous Hollywood Book Producer of the Middle Ages.
“No. What is a 'choir’?” said James.
“You’ll love it. At the book opening when we finish the leather bound version of this book that sells for an entire estate. We are also selling this new concept where included in the price of that estate and the price of this leather bound book, we round up all and I do mean all of the singers in Kensington and we give them brand new sheet music to sing that coincides with the plight of the main character of the New Testament Jesus AND we contract them to do it every day and we call that style Catholic.” said the Famous Hollywood Book Producer of the Middle Ages.
“There is going to be song sung about this book every day?” said James.
“Yes. No one else is doing it.” Said the Hollywood Book Producer of the Middle Ages.
“What will the 'choir’ be called?” said James.
“The Choir of Angels.” said the Hollywood Book Producer of the Middle Ages.
“What’s an 'Angel’?” said James.
“A Homeless Destitute Pauper that can really only make sound with its mouth is an 'Angel'… for now … unless you requisition this project. We are saving the homeless. It’s going to be the Hark that Heralds Herald. You can have your own version. It will be called the King James Version and it will be the first version of something that will be an entire industry that started in ancient times. We live in Ancient Times in this industry James. That is how famous you are as King and without the war, without the loss of life of the atheists, your Kingship just won’t be remembered in the blood it could be.” said the Hollywood Book Producer of the Middle Ages.
“How long will they speak my name?” said James.


{{ site.title }} is a framework for building responsive, mobile-friendly, multilingual literacy websites. This demo site has stories in {{ site.lang1 }} and {{ site.lang2 }}, as well as several other languages. Source code is available on GitHub. Enjoy!
{% assign sorted_pages = site.pages | sort: "order" %}{% for page in sorted_pages %}{% if page.language == site.lang1_code and page.layout == "story" %}


A Sample Page for iFrame testing
This is a sample page for testing iFrame, where the PRS form is embedded within the landing page.
To add the PRS form in your iFrame, follow these steps
- Download "Seamless" javascript package from https://github.com/rsmoorthy/seamless/releases/download/v1.0/seamless_v1.0.min.js and install in your server
- Include Seamless in your page header, along with jQuery, BootStrap and Bootbox
<link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap.min.css" type="text/css"> <link rel="stylesheet" href="//cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap-theme.min.css" type="text/css"> <script src="//cdnjs.cloudflare.com/ajax/libs/jquery/3.2.1/jquery.min.js"></script> <script src="//cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/js/bootstrap.min.js"></script> <script type="text/javascript" src="//cdnjs.cloudflare.com/ajax/libs/bootbox.js/4.4.0/bootbox.min.js"></script> <script src="/js/seamless_v1.0.min.js" type="text/javascript"></script> (OR) <script src="https://s3.ap-south-1.amazonaws.com/rsm-seamless/seamless.min.js" type="text/javascript"></script>
- Include the following script in your html page, at the bottom
<script type="text/javascript"> $(function() { var seamless = new Seamless({acceptFrom:['prsdemo.isha.in', 'prs.isha.in']}); }); </script>
- If there are more than one iframe element, you need to include the appropriate query selector for
the specific iframe, you are interested in. You could do so by:
<script type="text/javascript"> $(function() { var seamless = new Seamless({ acceptFrom:['prsdemo.isha.in', 'prs.isha.in'], childElement: '#prs' // This is the query selector for my iframe }); }); </script>
- Option 1: Include the iframe pointing to prs form, as below (URL Directly specified)
<iframe id="prs" src="https://prsdemo.isha.in/html/forms.html/registration_test1_yaml?_seamless=isha.sadhguru.org" scrolling="no" style="overflow: hidden; border: none; height: 80%; width: 100%"/>
- Option 2: Include the iframe pointing to prs form, but allow parent url params to be copied
<iframe id="prs" data-src="//prs.isha.in/html/forms.html/registration_test1_yaml" data-params="_seamless=isha.sadhguru.org" data-copyurlparams="1" scrolling="no" style="overflow: hidden; border: none; height: 80%; width: 100%"/>
Sample iFrame Below
- Check how it works on mobile as well as desktop
- If you press Register, without pressing "I Agree to Terms and Conditions", you will notice a popup appearing on the main window itself.
- This is a first version, we can improve this a lot as we go along.
Some more Text below
- This is a sample page and sample test form.
- This is a first version, we can improve this a lot as we go along.


Unlocked Dynamic Bible
Psalms 117
<
=
>
PSALMS 117
1
You people of all nations, praise Yahweh!
All you people groups, praise him
2
because he faithfully loves us as he promised to do,
and he will forever do for us what he promised that he would do.
Praise Yahweh!


- read(String) - Method in class hotelsystem.controller.DatabaseController
-
Creates a read from database(Read info from database)
- removeCheckIn(CheckInCheckOut) - Method in class hotelsystem.controller.CheckInCheckOutController
-
remove check in details from database
- removeFood(Food) - Method in class hotelsystem.controller.FoodController
-
Removes Food from the Database
- removeFoodItems() - Method in class hotelsystem.ui.FoodUI
-
Remove a Food from the menu from the Database using searchFood() function
- removeGuest(Guest) - Method in class hotelsystem.controller.GuestController
-
Remove guest from database
- removeGuestDetails() - Method in class hotelsystem.ui.GuestUI
-
Remove guest by searching the keyword to retrieve the list of guest and select the guest ID to delete
- removePromo(Promo) - Method in class hotelsystem.controller.PromoController
-
Remove promotions from database
- removePromo() - Method in class hotelsystem.ui.PromoUI
-
Retrieve all ongoing promo and selecting a certain promo using ID to remove
- Reservation - Class in hotelsystem.entity
-
Description of Reservation
contains get & set methods required for Reservation
- Reservation(Guest, ArrayList<RoomStatus>, int, int, String) - Constructor for class hotelsystem.entity.Reservation
-
- Reservation(Guest, int, int, String) - Constructor for class hotelsystem.entity.Reservation
-
- ReservationController - Class in hotelsystem.controller
-
Description of Reservation Controller
Controls and manages the flow of Reservations
Displaying, storing and loading of Reservation List to the Database
- ReservationUI - Class in hotelsystem.ui
-
Description of Reservation UI
Prints out reservation interface options
- Room - Class in hotelsystem.entity
-
Description of Room
contains get & set method for Room
- Room(String, int, String, boolean, boolean, boolean) - Constructor for class hotelsystem.entity.Room
-
- Room(int, String, int, String, boolean, boolean, boolean) - Constructor for class hotelsystem.entity.Room
-
- RoomAvailabilityUI - Class in hotelsystem.ui
-
Description of Room Availability UI
Prints out room availability interface options
- RoomController - Class in hotelsystem.controller
-
Description of Room Controller
Saving and loading of Rooms to the Database
- RoomService - Class in hotelsystem.entity
-
Description of Room Service
contains get & set methods required for Room Service
- RoomService() - Constructor for class hotelsystem.entity.RoomService
-
- RoomService(ArrayList<Food>, int, String, double, String) - Constructor for class hotelsystem.entity.RoomService
-
- RoomServiceController - Class in hotelsystem.controller
-
Description of Room Service Controller
Control Room Service order List
Storing and loading Room Service order List to the Database
- RoomServiceUI - Class in hotelsystem.ui
-
Description of Room Service UI
Prints out room service interface options
- RoomStatus - Class in hotelsystem.entity
-
Description of Room Status
contains get & set methods required for Room Status
- RoomStatus(int, String, int, String, Date, Date) - Constructor for class hotelsystem.entity.RoomStatus
-
- RoomStatus(String, int, String, Date, Date) - Constructor for class hotelsystem.entity.RoomStatus
-
- RoomStatusController - Class in hotelsystem.controller
-
Description of Room Status Controller
Controls individual Room Status
To display, saving, loading of Room Status List to the Database
- RoomType - Class in hotelsystem.entity
-
Description of Room Type
contains get & set method required for Room Type
- RoomType() - Constructor for class hotelsystem.entity.RoomType
-
- RoomType(int, String, double, double) - Constructor for class hotelsystem.entity.RoomType
-
- RoomTypeController - Class in hotelsystem.controller
-
Description of Room Type Controller
Manages the Room Type and to save and load Room Type List to the Database
- RoomUI - Class in hotelsystem.ui
-
Description of Room UI
Prints out room interface options


|
C++ Actor Framework 0.18
|
Technology-independent deserialization interface. More...
#include <deserializer.hpp>
Public Types | |
| using | super = load_inspector_base< deserializer > |
Public Member Functions | |
| deserializer (actor_system &sys) noexcept | |
| deserializer (execution_unit *ctx=nullptr) noexcept | |
| auto | context () const noexcept |
| bool | has_human_readable_format () const noexcept |
| virtual bool | fetch_next_object_type (type_id_t &type)=0 |
| Reads run-time-type information for the next object if available. | |
| virtual bool | fetch_next_object_name (string_view &type_name) |
| Reads run-time-type information for the next object if available. | |
| bool | next_object_name_matches (string_view type_name) |
Convenience function for querying fetch_next_object_name comparing the result to type_name in one shot. | |
| bool | assert_next_object_name (string_view type_name) |
Like next_object_name_matches , but sets an error on the deserializer on a mismatch. | |
| virtual bool | begin_object (type_id_t type, string_view pretty_class_name)=0 |
| Begins processing of an object, may perform a type check depending on the data format. | |
| virtual bool | end_object ()=0 |
| Ends processing of an object. | |
| virtual bool | begin_field (string_view name)=0 |
| virtual bool | begin_field (string_view, bool &is_present)=0 |
| virtual bool | begin_field (string_view name, span< const type_id_t > types, size_t &index)=0 |
| virtual bool | begin_field (string_view name, bool &is_present, span< const type_id_t > types, size_t &index)=0 |
| virtual bool | end_field ()=0 |
| virtual bool | begin_tuple (size_t size)=0 |
| Begins processing of a fixed-size sequence. | |
| virtual bool | end_tuple ()=0 |
| Ends processing of a sequence. | |
| virtual bool | begin_key_value_pair () |
| Begins processing of a tuple with two elements, whereas the first element represents the key in an associative array. | |
| virtual bool | end_key_value_pair () |
| Ends processing of a key-value pair after both values were written. | |
| virtual bool | begin_sequence (size_t &size)=0 |
| Begins processing of a sequence. | |
| virtual bool | end_sequence ()=0 |
| Ends processing of a sequence. | |
| virtual bool | begin_associative_array (size_t &size) |
| Begins processing of an associative array (map). | |
| virtual bool | end_associative_array () |
| Ends processing of an associative array (map). | |
| virtual bool | value (byte &x)=0 |
Reads x from the input. | |
| virtual bool | value (bool &x)=0 |
Reads x from the input. | |
| virtual bool | value (int8_t &)=0 |
Reads x from the input. | |
| virtual bool | value (uint8_t &)=0 |
Reads x from the input. | |
| virtual bool | value (int16_t &)=0 |
Reads x from the input. | |
| virtual bool | value (uint16_t &)=0 |
Reads x from the input. | |
| virtual bool | value (int32_t &)=0 |
Reads x from the input. | |
| virtual bool | value (uint32_t &)=0 |
Reads x from the input. | |
| virtual bool | value (int64_t &)=0 |
Reads x from the input. | |
| virtual bool | value (uint64_t &)=0 |
Reads x from the input. | |
| template<class T > | |
| std::enable_if_t< std::is_integral< T >::value, bool > | value (T &x) noexcept |
Reads x from the input. | |
| virtual bool | value (float &)=0 |
Reads x from the input. | |
| virtual bool | value (double &)=0 |
Reads x from the input. | |
| virtual bool | value (long double &)=0 |
Reads x from the input. | |
| virtual bool | value (std::string &)=0 |
Reads x from the input. | |
| virtual bool | value (std::u16string &)=0 |
Reads x from the input. | |
| virtual bool | value (std::u32string &)=0 |
Reads x from the input. | |
| virtual bool | value (span< byte > x)=0 |
| Reads a byte sequence from the input. | |
| virtual bool | list (std::vector< bool > &xs) |
Adds each boolean in xs to the output. | |
Protected Attributes | |
| execution_unit * | context_ |
| Provides access to the ::proxy_registry and to the ::actor_system. | |
| bool | has_human_readable_format_ = false |
| Configures whether client code should assume human-readable output. | |
Technology-independent deserialization interface.
|
virtual |
Begins processing of an associative array (map).
begin_sequence(size)
. Reimplemented in caf::config_value_reader, and caf::json_reader.
|
virtual |
Begins processing of a tuple with two elements, whereas the first element represents the key in an associative array.
begin_tuple(2)
. Reimplemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Begins processing of an object, may perform a type check depending on the data format.
| type | 16-bit ID for known types, invalid_type_id otherwise. |
| pretty_class_name | Either the output of type_name_or_anonymous or the optionally defined pretty name. |
Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Begins processing of a sequence.
Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Begins processing of a fixed-size sequence.
Implemented in caf::config_value_reader, and caf::json_reader.
|
virtual |
Ends processing of an associative array (map).
end_sequence()
. Reimplemented in caf::config_value_reader, and caf::json_reader.
|
virtual |
Ends processing of a key-value pair after both values were written.
end_tuple()
. Reimplemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Ends processing of an object.
Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Ends processing of a sequence.
Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Ends processing of a sequence.
Implemented in caf::config_value_reader, and caf::json_reader.
|
virtual |
Reads run-time-type information for the next object if available.
The default implementation calls fetch_next_object_type
and queries the CAF type name. However, implementations of the interface may retrieve the type name differently and the type name may not correspond to any type known to CAF. For example. the json_reader returns the content of the @type
field of the current object if available.
type_name
may point to an internal buffer that becomes invalid as soon as calling any other member function on the deserializer. Convert the type_name
to a string before storing it. Reimplemented in caf::json_reader.
|
pure virtual |
Reads run-time-type information for the next object if available.
Implemented in caf::config_value_reader, and caf::json_reader.
|
virtual |
Adds each boolean in xs
to the output.
Derived classes can override this member function to pack the booleans, for example to avoid using one byte for each value in a binary output format.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
Reads a byte sequence from the input.
| x | The byte sequence. |
sec::success
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
noexcept |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.
|
pure virtual |
Reads x
from the input.
| x | A reference to a builtin type. |
true
on success, false
otherwise. Implemented in caf::config_value_reader, and caf::json_reader.


Last updated: April 02, 2016
Islamic Last Will (Wasseyapp) ("us", "we", or "our") operates the Islamic Last Will (Wasseyapp) mobile application (the "Service").
This page informs you of our policies regarding the collection, use and disclosure of Personal Information when you use our Service.
We will not use or share your information with anyone except as described in this Privacy Policy.
We use your Personal Information for providing and improving the Service. By using the Service, you agree to the collection and use of information in accordance with this policy. Unless otherwise defined in this Privacy Policy, terms used in this Privacy Policy have the same meanings as in our Terms and Conditions.
While using our Service, we may ask you to provide us with certain personally identifiable information that can be used to contact or identify you. Personally identifiable information may include, but is not limited to, your email address, name, phone number, postal address, other information ("Personal Information").
The security of your Personal Information is important to us, but remember that no method of transmission over the Internet, or method of electronic storage is 100% secure. While we strive to use commercially acceptable means to protect your Personal Information, we cannot guarantee its absolute security. As such we make no warranties as to the level of security afforded to your data, except that we will always act in accordance with the relevant UK and EU legislation.
Our Service may contain links to other sites that are not operated by us. If you click on a third party link, you will be directed to that third party's site. We strongly advise you to review the Privacy Policy of every site you visit.
We have no control over, and assume no responsibility for the content, privacy policies or practices of any third party sites or services.
Our Service does not address anyone under the age of 13 ("Children").
We do not knowingly collect personally identifiable information from children under 13. If you are a parent or guardian and you are aware that your Children has provided us with Personal Information, please contact us. If we become aware that we have collected Personal Information from a children under age 13 without verification of parental consent, we take steps to remove that information from our servers.
We may update our Privacy Policy from time to time. We will notify you of any changes by posting the new Privacy Policy on this page.
You are advised to review this Privacy Policy periodically for any changes. Changes to this Privacy Policy are effective when they are posted on this page.
If we make any material changes to this Privacy Policy, we will notify you either through the email address you have provided us, or by placing a prominent notice on our website.
This Policy shall be governed and construed in accordance with the laws of England and Wales, without regard to its conflict of law provisions.


EtherLoops
Home
Buy Cards
Buy Loops
Record Loop
Publish Loop
Trade
Donate
Menu
Upvote
Downvote
Buy Selection
Invest
Share


-
2013-09-06 19:27:30
New version 1.49v few usability updates
New version.
- From now messages like "user has left chat", "user has joined chat" will be shown where you see what user is typing or user is typing message. This will avoid flood in chat itself.
- You can configure default Operator name for proactive chats.
- If user starts chat from proactive widget, to user won't be shown message that we are pending operator to join chat.
- Adjusted how print icon is shown in widget.
execute doc/update_db/update_33.sql and follow standard upgrade instructions
Don't forget to donate if you like LHC :)
-
2013-09-05 21:59:12
New version 1.48v securing application
This update brings security enchancements in various places and focuses to pervent CSRF attacks.
No database required this time.
-
2013-09-01 13:07:35
New version 1.47v pack of features
New version.
- From chat tab you can open popup. Let say you were chatting in tab and you want to open popup. So you can do that now. There is very first icon for that.
- Then you open let say three chats at the same time and close one. I now activate the very first tab to left. Feels very natural closing workflow.
- Fixed bug, then closing chat in tab it removed subtabs from other chat tabs.
- Added more clear way what embed codes system can generate
- Switched to https support by using double slash E.g //demo.livehelperchat.com - so I do not have to detect in what enviroment we are running.
- You now can disable or enable invitation if there is or not online operators.
- You can set online visitors timeout, to see only the recent visitors.
- Check messages from operator JS call won't be counted as last visit.
- Department chosing box will show status of department is it online or offline. First will be shown online departments.
- Now Surname is optional field, so you can have only name filled.
- Print option for user and admin.
- Now you can see what user is typing before he sends message to operator.
execute doc/update_db/update_32.sql and follow standard upgrade instructions
Don't forget to donate if you like LHC :)
-
2013-08-29 20:53:29
Evening update - mostly usability updates
Just pushed few updates wich does this. All this was done in single evening. So just image how easy is to extend this beast :)
- From chat tab you can open popup. Let say you were chatting in tab and you want to open popup. So you can do that now. There is very first icon for that.
- Then you open let say three chats at the same time and close one. I now activate the very first tab to left. Feels very natural closing workflow.
- Fixed bug, then closing chat in tab it removed subtabs from other chat tabs.
- Added more clear way what embed codes system can generate
- Switched to https support by using double slash E.g //demo.livehelperchat.com - so I do not have to detect in what enviroment we are running.
No database update this time. So just replace files following standard upgrade instructions.
-
2013-08-25 18:13:53
New version 1.46v, chats priority
New version.
-
Now chats can have priority. It can be either embed variable either department attribute. Pending chats with higher priority will appear higher in the pending chats list.
execute doc/update_db/update_31.sql and follow standard upgrade instructions


Package Managers
There are two major package managers currently used for JavaScript / TypeScript projects which leverage node.js as a build platform.
Our recommendation is to use yarn but both package managers are fine.
| When using npm it is important to use a version greater 5.0 as npm 3 has major drawbacks compared to yarn. The following guide assumes that you are using npm >= 5 or yarn. |
Before you start reading further, please take a look at the docs:
The following guide will describe best practices for working with yarn / npm.
Semantic Versioning
When working with package managers it is very important to understand the concept of semantic versioning.
| Version | 1. | 2. | 3 |
|---|---|---|---|
Version name when incrementing |
Major (2.0.0) |
Minor (1.3.0) |
Patch (1.2.4) |
Has breaking changes |
yes |
no |
no |
Has features |
yes |
yes |
no |
Has bugfixes |
yes |
yes |
yes |
The table gives an overview of the most important parts of semantic versioning. In the header version 1.2.3 is displayed. The first row shows the name and the resulting version when incrementing a part of the version. The next rows show specifics of the resulting version - e.g. a major version can have breaking changes, features and bugfixes.
Packages from npm and yarn leverage semantic versioning and instead of selecting a fixed version one can specify a selector. The most common selectors are:
-
^1.2.3 At least 1.2.3 - 1.2.4 or 1.3.0 can be used, 2.0.0 can not be used
-
~1.2.3 At lease 1.2.3 - 1.2.4 can be used, 2.0.0 and 1.3.0 can not be used
-
>=1.2.3 At least 1.2.3 - every version greater can also be used
This achieves a lower number of duplicates. To give an example:
If package A needs version 1.3.0 of package C and package B needs version 1.4.0 of package C one would end up with 4 packages.
If package A needs version ^1.3.0 of package C and package B needs version 1.4.0 of package C one would end up with 3 packages. A would use the same version of C as B - 1.4.0.
Do not modify package.json and lock files by hand
Dependencies are always added using a yarn or npm command. Altering the package.json, package-json.lock or yarn.lock file by hand is not recommended.
Always use a yarn or npm command to add a new dependency.
Adding the package express
with yarn to dependencies.
yarn add express
Adding the package express
with npm to dependencies.
npm install express
What does the lock file do
The purpose of files yarn.lock
and package-json.lock
is to freeze versions for a short time.
The following problem is solved:
-
Developer A upgrades the dependency
express
to fixed version4.16.3
. -
express
has sub-dependencyaccepts
with version selector~1.3.5
-
His local
node_modules
folder receivesaccepts
in version1.3.5
-
On his machine everything is working fine
-
Afterward version
1.3.6
ofaccepts
is published - it contains a major bug -
Developer B now clones the repo and loads the dependencies.
-
He receives version
1.3.6
ofaccepts
and blames developer A for upgrading to a broken version.
Both yarn.lock
and package-json.lock
freeze all the dependencies.
For example in yarn lock you will find.
<EMAIL_ADDRESS>version "1.3.5"
resolved "[...URL to registry]"
dependencies:
mime-types "~2.1.18"
negotiator "0.6.1"
<EMAIL_ADDRESS>version "1.33.0"
resolved "[...URL to registry]"
<EMAIL_ADDRESS>version "2.1.18"
resolved "[...URL to registry]"
dependencies:
mime-db "~1.33.0"
<EMAIL_ADDRESS>version "0.6.1"
resolved "[...URL to registry]"
The described problem is solved by the example yarn.lock file.
-
accepts
is frozen at version~1.3.5
-
All of its sub-dependencies are also frozen. It needs
mime-types
at version~2.1.18
which is frozen at2.1.18
.mime-types
needsmime-db
at~1.33.0
which is frozen at1.33.0
Every developer will receive the same versions of every dependency.
| You have to make sure all your developers are using the same npm/yarn version - this includes the CI build. |


Toggle navigation
NavBar
GitHub Project
Home
Menu 1
Action
Another action
Something else here
Separated link
One more separated link
Dropdown
Action
Dropdown
Dropdown
Action
Another action
Something else here
Separated link
One more separated link
Menu 2
Action
Another action
Something else here
Separated link
One more separated link
Dropdown
Action
Another action
Something else here
Separated link
Dropdown
Dropdown
Action
Another action
Something else here
Separated link
One more separated link
Bootstrap NavBar
NavBar with too many childs.
Thanks to msurguy (Multi level dropdown menu BS3)
analytics
data
mining
ant colony optimization
nature inspired computing
bio-inspired
Behavior selection algorithm
swarm optimization
artificial immune systems
evolutionary computation
genetic bee colony
Gaussian mixture model
clustering
K-means
fuzzy logic
computational neuroscience
genetic algorithm
gene expression programming
genetic programming
distance measure
artificial neural network
artificial
knowledge representation
behavioral patterns
natural language processing
machine translation
radial basis networks
feedforward neural networks
information theory
naive bayes
distribution
hidden markov model
bayesian inference
expectation-maximization
Markov Chain Monte Carlo
statistical probability
kalman filter
Chaos theory
Bayes classifier
gradient descent
K- nearest neighbors
machine learning
principle component analysis
bayesian network
random forest
linear regression
support vector machine
logistic regression
decision tree
agent communication language
restricted Boltzmann machine
deep learning
recurrent neural networks
convolutional neural network
cuckoo search
heuristic search
game theory
elephent herding optimization
virtual agents
random optimization
intelligence
driven


Open a couple of tabs.
Drag and drop the box in one of tabs.
Notice the change of boxes in other tabs.


13. What Is Not Included In The Standard?
Up: Contents
Next: Organization of this Document
Previous: What Is Included In The Standard?
The standard does not specify:
- Operations that require more operating system support than is currently
standard; for example, interrupt-driven receives, remote execution,
or active messages,
- Program construction tools,
- Debugging facilities.
There are many features that have been considered and
not included in this standard. This happened for
a number of reasons, one of which is the time constraint
that was self-imposed in finishing the standard.
Features that are not included can always be offered as extensions
by specific
implementations.
Perhaps future versions of MPI will address some of these issues.
Up: Contents
Next: Organization of this Document
Previous: What Is Included In The Standard?
Return to MPI-3.1 Standard Index
Return to MPI Forum Home Page
(Unofficial) MPI-3.1 of June 4, 2015
HTML Generated on June 4, 2015


Legacy
Most of these designs are deemed redundant since they have been superseded by the versioned designs in the archive (kept for assessment and audit purposes).
Allocations
Dashboards
Subcontractors
- Sub-contractors
- Subcontractor 2 Sprint Guatemala
- Subcontractor 3
- Subcontractor 4 Sprint Havana
- Subcontractor 5 Sprint Islamabad
- Subcontractor 6 Sprint Jakarta
- Subcontractor 7 Sprint Madrid
- Subcontractor Live
- Subcontractor MVP
- Subcontractor second journey
- Subcontractor after MVP
- Subcontractor May
- Subcontractor June
How does the user know what year they are declaring for - is this what the business needs.
Can the user declare at any time now that the digital version is available?


Canvas Navigation Examples
Introduction
In Canvas you can configure an LTI tool to have a link in the navigation for a course, account, or user. See Canvas documentation for more details more information.
The examples are very basic, really just enough to get the point of the extension across. If you are interested in seeing more advanced or practical implementations, check out the list of LTI apps on the home page.
Course Navigation Demo
This is an example of a standard configuration for adding a link to course navigation. This link is available to anyone with access to the course. If it's configured at the account level, the link will be added to all courses within that account. Permissions can be set to determine which user types have access to the app, and whether the app is enabled by default for all applicable courses, or if it needs to be configured manually for each course.
xml configuration more informationAccount Navigation Demo
This is an example of a standard configuration for adding a link to
account navigation. This link is available to anyone with access to
the account. The link will appear in the current account and any
sub-accounts of that account. Remember that app launches will send
all role types associated with a user, which in the case of
account-level links should always include at least the admin role,
urn:lti:instrole:ims/lis/Administrator
.
User Navigation Demo
This is an example of a standard configuration for adding a link to user navigation. This link is available to anyone with access to the institution, and will appear as a navigation item whey they click their profile or user information link.
xml configuration more information


I would like to have pointslooking from (, )with radius and the file.
Please note: the indicated x and y values are the center values in the sample point cloud;these values are by default if not defined otherwise; the coordinate system is EPSG:28992.


clustergb.gb_geometry¶
Generates a cluster of atoms, presumably with a grain boundary running down the middle (x-axis normal), but bulk-like configurations are also possible.
A couple FCC CSL parameters for quick reference:
- 53.1301024<001>(210) Sigma 5 tilt
- 36.8698976<001>(310) Sigma 5 tilt
This page is also useful.
-
clustergb.gb_geometry.
find_bravais
(misorientation, shared, normal, symmetric, bravais, precision, verbosity, max_steps)¶ Get the bravais lattices for two grains with the provided macroscopic parameters. Bravais lattices will be rotated together until the GB plane is the in yz-plane–i.e. the macroscopic parameters will be as requested but perhaps with a coordinate change applied to both grains.
Parameters: - float (misorientation) – Misorientation between the two grains.
- shared (np.ndarray) – \((3,)\) axis about which to apply misorientation.
- normal (np.ndarray) – \((3,)\) grain boundary plane normal for one of the grains.
- symmetric (bool) – Whether to ignore any normal vector and simply make a symmetric tilt boundary.
- bravais (np.ndarray) – \((3,3)\) matrix of lattice vectors for the underlying unit cell, one in each row.
- precision (float) – Numeric precision, e.g. for determining if two vectors are close enough (L2) to be the same.
- verbosity (bool) – Whether to print info from called subroutines (e.g. searching for rotation matrices).
- max_steps (int) – Maximum allowable steps to use in numeric search subroutines.
Returns: 3-element tuple containing
- (np.ndarray) – \((3,3)\) Bravais vectors for the left grain (x<0).
- (np.ndarray) – \((3,3)\) Bravais vectors for the right grain (x>0).
- (np.ndarray) – \((3,)\) Shared axis in the transformed coordinates.
-
clustergb.gb_geometry.
ideal_hemispheres
(brav1, brav2, basis, translation, radius)¶ Generates two arrays of atoms, one for each grain. The grain boundary (GB) normal is (100) and both grains together form a sphere.
First, two appropriately rotated bravais lattices are found, one for each grain. Unless the symmetric flag is thrown, the first grain will have the normal vector pointing in the x-direction. Next, a large cubic repeat is made of these bravais lattices and populated with atoms using the bases. For each grain, these atoms are then trimmed to each form a hemisphere.
Warning
The hemispheres are allowed to extend slightly into each other and some atoms from each grain may overlap.
Warning
Right now it all only works with cubic lattices.
Parameters: - brav1 (np.ndarray) – \((3,3)\) lattice vectors for the unit cell of one grain, one in each row.
- brav2 (np.ndarray) – \((3,3)\) lattice vectors for the unit cell of the other grain, one in each row.
- basis (np.ndarray) – \((n,3)\) direct-coordinate location of atoms in the unit cell.
- translation (np.ndarray) – \((3,)\) relative translation of one grain to the other (in same units as the Bravais).
- radius (float) – Radius of the cluster of atoms desired.
Returns: 2-element tuple of Cartesian atomic positions for the sphere centred at the origin,
- (np.ndarray): \((n,3)\) Cartesian coordinates of left hemisphere.
- (np.ndarray): \((n,3)\) Cartesian coordinates of right hemisphere.
-
clustergb.gb_geometry.
merge_hemispheres
(pos1, pos2, merge_dist)¶ Given two hemispheres of atoms, return a single array in which atoms from the two hemispheres which are too close too each other have been deleted and replaced with a new atom at their average position (i.e. exactly on the boundary plane.)
Parameters: - pos1 (np.ndarray) – \((n,3)\) Cartesian position of atoms in one hemisphere.
- pos2 (np.ndarray) – \((m,3)\) Cartesian position of atoms in the other hemisphere.
- merge_dist (float) – Distance within which to merge atoms in opposite hemispheres.
Returns: (np.ndarray) – \((\leq m+n, 3)\) Merged atoms.


The School for International Training (SIT) Graduate Institute is an internationally-focused non-profit graduate school that offers master’s degrees and graduate level certificates, aimed to set its graduates at the forefront of their chosen sectors. SIT remains a pioneer and worldwide leader in the fields in which the faculty and staff teach and work, and our students benefit from the knowledge and experience of SIT’s expertise and vision. The Graduate Institute provides multiple program options within both the Brattleboro, Vermont and Washington, DC, campuses, which focus on international education, peacebuilding and conflict transformation, sustainable development, among many others.
With a focus on social justice and engaged citizenship, SIT prepares students to be interculturally effective leaders, professionals, and citizens. SIT Graduate Institute fosters an environment of students committed to advancing sustainability, equality, inclusion – all within a diverse, lively community that seeks to find solutions to effect change throughout the world. A truly international learning community, SIT students come to Washington, DC and Brattleboro, Vermont from across the world and graduate as change-makers within their home countries and abroad.
Next summer SIT Graduate Institute will launch the Inclusive Security: International Policy and Practice Certificate program to train professionals to lead innovative and more sustainable approaches to peacebuilding. SIT is offering the program in partnership with the Institute for Inclusive Security with the goal of developing a network of inclusive and human security practitioners who can bridge institutional and international differences. Inclusive security seeks to increase participation of all stakeholders, especially women, in the prevention and resolution of violent conflicts.
“When women are included, they contribute innovative perspectives, bridge divides between warring groups, and enhance the legitimacy of the process, thus increasing the likelihood that peace will last.” — Donald Steinberg
SIT received a $100,000 grant from Hunt Alternatives, the Institute for Inclusive Security’s parent organization, to develop the program. The curriculum will build on the expertise of SIT and The Institute for Inclusive Security in the social change arena to develop participants’ skills and professional capacity.
“There is a vital need in the foreign affairs sphere to enable policy makers and practitioners alike to better understand this broader security paradigm,” said Ambassador Swanee Hunt, founder and president of Hunt Alternatives.
The nine-credit certificate program will be tailored for early- and mid-career professionals in the field of security policy and peacemaking. It will highlight the agency of women as active and critical participants in shaping peace and security and equip students to challenge and reform existing security practices using the theory, language, and best practices in the field. It is designed to be completed in three consecutive semesters over a one-year period. SIT plans to make this part of a stackable certificate degree program so that students will have an opportunity to move on to earn a master’s degree.
“World Learning is proud to partner with the Institute for Inclusive Security to implement this groundbreaking program,” said World Learning President and CEO Donald Steinberg. “When women are included, they contribute innovative perspectives, bridge divides between warring groups, and enhance the legitimacy of the process, thus increasing the likelihood that peace will last.”
SIT Graduate Institute Professor and Director of Conflict Transformation Across Cultures (CONTACT), Paula Green, retired in June. As a Professor of Conflict Transformation, Green had extensive international experience in peacebuilding and conflict transformation and has worked as an international consultant, facilitator and lecturer in the U.S., Europe, Asia, Africa, and the Middle East. Colleagues say she brought a keen sense of social responsibility and spiritual awareness to her work as a psychologist, educator and leader in the field of peacebuilding.
"The legacy Paula left for us is thousands of peacebuilders who emerged, bonded, and began to work together in some of the world’s most difficult conflict-affected societies." — Tatsushi Arai
“The innovative nature of Paula’s work was most evident when she initiated CONTACT South Asia program in 2010,” said Tatsushi Arai, SIT professor of Peacebuilding and Conflict Transformation. “This reflected the reality of the deepening conflicts in South Asia, many years of her extensive on the ground work in the region, as well as the growing difficulty on the part of South Asia’s Muslim majority societies to be able to send participants to CONTACT’s Brattleboro, Vermont summer program.”
Green founded CONTACT in 1997 as a graduate certificate program of the SIT Summer Peacebuilding Institute. The program gathers peacemakers from around the world annually in June on SIT’s Brattleboro, Vermont, campus and in South Asia in December. CONTACT has close to 1,000 alumni from more than 80 countries around the world today.
“The legacy Paula left for us is thousands of peacebuilders who emerged, bonded, and began to work together in some of the world’s most difficult conflict-affected societies,” Arai said. “Paula’s legacy also includes the viability of citizen-led networking and capacity-building for peace that is capable of initiating and sustaining a people’s peace.”
In 2008, Green was honored for her lifelong contribution to conflict transformation and peacebuilding by Wisdom in Action, a California based nonprofit, and was presented the honorary award by His Holiness the Dalai Lama.
Bruce Dayton, CONTACT’s new director, comes to SIT with more than 20 years of experience in peacebuilding and conflict transformation. Most recently, he was a member of faculty at the Maxwell School of Citizenship and Public Affairs at Syracuse University. He also serves as associate director at the Moynihan Institute of Global Affairs and research co-director of the Intra and Inter-State Conflicts Research Initiative at the Program for the Advancement of Research on Conflict and Collaboration at the school.
Dayton will continue the work of the program, focusing on conflict transformation — as opposed to resolution — as the best hope of tackling serious conflicts around the world. In a recent lecture at SIT, he explained, “the most we can do is to try to make conflict constructive instead of destructive.” One way to do that, Dayton said, is to change the narrative: “Change the story, and you change the conflict.”
In honor of Paula’s years of service to the CONTACT program, the Paula Green Peace Leaders Scholarship Fund for CONTACT was established this past spring. All donations to this fund go exclusively towards assisting future CONTACT participants. Gifts can be made to this fund at sit.edu/graduate/donatenow.
Judith Brown Meyers, PhD, is passionate about World Learning’s international development work, and is a champion of the Institute for Political and Civic Engagement (iPACE) program in Burma, which trains local civil society leaders and activists to effectively take part in their burgeoning democracy. A World Learning board member from 2011 to 2014, Meyers, who lives in Rye, New Hampshire, has had an illustrious career in international development with a primary focus on South Asia and environmental issues.
Meyers joined the World Learning family after meeting board member Mary Davidson on a trip to Bhutan with a group of friends. Davidson knew of her academic background and experience in international affairs and encouraged Meyers to learn more about the organization. Meyers joined the board soon after and has been actively involved in World Learning ever since.
“I know the various players out there and I know that World Learning’s development work is stellar,” she said. “Their ethics, their approach, the way that they work with their counterparts in each of the countries in which they have contracts.”
Meyers supports scholarships for iPACE, which offset the costs of transportation and lodging for participants, and ensure that iPACE students from throughout the country can attend the program in Mandalay or Yangon. These scholarships underscore iPACE’s dedication to pluralism and creating a student base that reflects the diversity of the country.
After visiting iPACE in March 2015, Meyers noted the range of participants. “It wasn’t just twenty-somethings,” she said. “There was a man who had been a political dissident who had just been released from prison. There were people representing various political parties; there were people representing a variety of ethnic minorities, women’s organizations, and labor organizations.”
Meyers recalled a conversation with iPACE director Adam LeClair, who relayed to her an example of the scholarship’s impact. “There was a program in which there were two deaf people, and Adam used a scholarship to hire a sign language interpreter [to assist the participants] who otherwise wouldn’t be able to attend.” She saw iPACE putting into action the “importance of developing civil societies throughout the whole country, especially people who are marginalized and underserved because of geography and economics.”
“I loved that so many people in that country are embracing the importance of civil society in a democracy,” Meyers said of her time in Burma. “It’s so exciting to see the great gusto and enthusiasm the people of Myanmar have, because you can’t have a democracy without civil society.”


Select two random words with at least 8 letters each, e.g., by opening a dictionary on a random page (e.g., RAPHSODY, EGALITARIAN). The words can be made-up, from other languages etc.
Write down the letters A,B, ..., Z and mark off all letters that appear in your two words (letters not marked: B, C, F, J, K, M, Q, U, V, W, X, Z)
Select a third word that contains many of the letters of the alphabet that aren't marked (i.e., not covered by the first two words) but might contain some that are marked (e.g., MUSICBOX)
Memorize these three words as a fixed sequence (e.g., EGALITARIAN-MUSICBOX-RHAPSODY)
Choose a digit and special character and remember them (e.g., 7, @)
Processing (to be done whenever you need to type a password)
Given a challenge (a website name or prompt based on the website name, e.g., GMAIL), generate a response (password) as follows:
Start at the first letter of the challenge (G).
Find the first occurrence of the letter in your memorized sequence of words and output the next consonant (L in EGALITARIAN). If the letter is Y, wrap back to the first word; if the letter doesn't show up in your sequence of words, skip it.
Repeat on the remaining letters of the challenge till you reach the end (G -> L, M -> S, A -> L, I -> T, L -> T; GMAIL -> LSLTT)
Captialize the first letter, attach your digit and special character; this step is to satisfy password restrictions of most websites (but always use the same rule for yourself and in the same location (beginning, end, after first letter) so you have no trouble remembering). GMAIL ->Lsltt
Another Example
Suppose you are presented with a challenge: AMAZON and you are using the sequence EGALITARIAN-MUSICBOX-RHAPSODY
The first letter of the challenge A is found in the sequence of three words
The output for this letter is the first non vowel following the letter in the sequence, so the output is L
Next we look for M in the sequence and find it in the second word
The next non vowel following M is S, so the output including the second letter of the challenge is LS
The output for the next letter in the sequence, A, is the same as its previous occurence
This means the output including the third letter of the challenge is LSL
The next letter of the challenge, Z, does not appear in our sequence, so we skip this letter
The output does not change and is still LSL
The next letter in the challenge is O which does appear in our sequence
The next non vowel letter in the sequence after O is X, so the output thus far is LSLX
The final letter of our challenge is N which is present in our sequence
the next non vowel letter after N in the sequence is M, so the final output of the challenge AMAZON is LSLXM
Practice on Your Own!
The section below allows you to practice with the three word schema with three words of your choice
First, enter your three words then fill out the textboxes with the correct responses


Born in Coventry, raised in Birmingham and lives in New York. Lee Child is one of the world’s leading thriller writers. When he was made redundant from his job as a TV presentation director, he decided to start writing novel. In 1997 Child published is first novel called. Killing Floor and won the Anthony Award awarded for Best in Mystery Fiction and Barry award awarded for Best First Novel.
Twenty-three years on from Killing Floor, Child as writing more than twenty two Books. His thrillers are a publishing phenomenon, dominating the fiction charts, sparking film adaptations starring Tom Cruise, and enthralling millions of fans (ME being one of them).
Lee Child books features a guy called 'Jack Reacher'. Reacher was an ex-army major Military Police, a peripatetic loner who leaves no traces except in the hearts of those he has touched. He is a dynamite, scourge of the wicked, righter of wrongs, a one-man wrecking crew, hurling bad guys into the darkness with breath-taking efficiency. And Trouble always seems to find him.
I first started reading when I was in a really bad place and I didn’t want anything to do with life. I needed an escape from the situation I was in when I stumble upon Lee Child novel. Reading his novel serves as my escape, while I couldn’t escape physically, I could escape into the world of Jack Reacher.
SearchSomeone has taken a long-range shot at the French president but failed to kill him. The suspected sniper has serious skills and is a hard man to find. Reacher tracked him down once and put him in jail. Now he's asked to hunt him again, and put him away permanently.
When you're as big and rough as Jack Reacher - and you have a badly set, freshly busted nose - it isn't easy to hitch a ride. At last, he's picked up by three strangers - two men and a woman. Within minutes it becomes clear they're all lying about everything - and
Jack Reacher takes an aimless stroll past a pawn shop in a small Midwestern town. In the window he sees a West Point class ring from 2005. It’s tiny. It’s a woman cadet’s graduation present to herself. Why would she give it up? Reacher’s a West Pointer too, and he knows what she went through to get it.


The main idea is to create sub classes to WebFXTree
and
WebFXTreeItem
and overload the expand
methods
to start the loading of an xml file. Once the loading is done the xml file
is tranformed into WebFXTreeItem
s and WebFXLoadTreeItem
s
and inserted.
First we create a new constructor and inside this we call the super constructor to make sure that the instance will be correctly initiated. After that we set some property values and finally we check whether the tree is open, if it is we start to load the sub trees. If not, we add a dummy tree item that displays the loading text.
After the constructor is created we set the protype to a new
WebFXTree
.
function WebFXLoadTree(sText, sXmlSrc, sAction, sBehavior, sIcon, sOpenIcon) { // call super this.WebFXTree = WebFXTree; this.WebFXTree(sText, sAction, sBehavior, sIcon, sOpenIcon); // setup default property values this.src = sXmlSrc; this.loading = false; this.loaded = false; this.errorText = ""; // check start state and load if open if (this.open) _startLoadXmlTree(this.src, this); else { // and create loading item if not this._loadingItem = new WebFXTreeItem(webFXTreeConfig.loadingText); this.add(this._loadingItem); } } WebFXLoadTree.prototype = new WebFXTree;
The constructor is fairly straight forward and does not do much. Notice however
how super is called by binding WebFXTree
as a method and then
calling it.
Next we need to override the expand
method but since we still need
to be able to call the original expand
method we create a new method
called _webfxtree_expand
that points to the function object used
by WebFXTree
objects. This is the standard way to access super methods
but the first few times it might look a bit odd.
The logic in the expand
method is really simple. We just check if
we should start loading the xml file and then we expand it using the super
expand (_webfxtree_expand
) method.
// override the expand method to load the xml file WebFXLoadTree.prototype._webfxtree_expand = WebFXTree.prototype.expand; WebFXLoadTree.prototype.expand = function() { if (!this.loaded && !this.loading) { // load _startLoadXmlTree(this.src, this); } this._webfxtree_expand(); };
This class is too similar to WebFXLoadTree
for me to be entirely
comfortable. Since JavaScript does not support multiple inheritance, and I did
not want to fake it using expandos, we just have to repeat the code. For everyone
that are interested, the code for this can be found in
xloadtree.js.
As you can see in the code above there is a function called
_startLoadXmlTree
that is called to load the actual xml file. This function uses
an XmlHttp
object to do the actual loading. The loading of the xml
file is done asynchronously to prevent the UI to lock up while the file is
being loaded and therefore we wait for the onreadystatechange
event to fire before we continue. See the
Xml Extras article for a more detailed
description about the XmlHttp
object.
// creates the xmlhttp object and starts the load of the xml document function _startLoadXmlTree(sSrc, jsNode) { jsNode.loading = true; var xmlHttp = XmlHttp.create(); xmlHttp.open("GET", sSrc, true); // async xmlHttp.onreadystatechange = function () { if (xmlHttp.readyState == 4) _xmlFileLoaded(xmlHttp.responseXML, jsNode); }; // call in new thread to allow ui to update window.setTimeout(function () { xmlHttp.send(null); }, 10); }
Once the xml file has finished loading we call the function _xmlFileLoaded
.
This function checks that we got an xml document back and if we did it goes through the
document and recursively converts the xml elements to js WebFXTreeItem
and
inserts them. Once the xml elements have been converted and inserted we remove the
dummy tree item that was only used to show that we were loading the contents.
// Inserts an xml document as a subtree to the provided node function _xmlFileLoaded(oXmlDoc, jsParentNode) { var bIndent = false; var bAnyChildren = false; jsParentNode.loaded = true; jsParentNode.loading = false; // check that the load of the xml file went well if( oXmlDoc == null || oXmlDoc.documentElement == null) { jsParentNode.errorText = parseTemplateString(webFXTreeConfig.loadErrorTextTemplate, jsParentNode.src); } else { // there is one extra level of tree elements var root = oXmlDoc.documentElement; // loop through all tree children var cs = root.childNodes; var l = cs.length; for (var i = 0; i < l; i++) { if (cs[i].tagName == "tree") { bAnyChildren = true; bIndent = true; jsParentNode.add( _xmlTreeToJsTree(cs[i]), true); } } // if no children we got an error if (!bAnyChildren) jsParentNode.errorText = parseTemplateString(webFXTreeConfig.emptyErrorTextTemplate, jsParentNode.src); } // remove dummy if (jsParentNode._loadingItem != null) { jsParentNode._loadingItem.remove(); bIndent = true; } if (bIndent) { // indent now that all items are added jsParentNode.indent(); } // show error in status bar if (jsParentNode.errorText != "") window.status = jsParentNode.errorText; }
A few more things happen in this function but nothing really important. There is some
code that checks the errors and a few properties are set to reflect the state of the
WebFXLoadTree
or WebFXLoadTreeItem
object.
The only important thing left to do is to convert the xml tree item to a js
WebFXTreeItem
. This is done in the function _xmlTreeToJsTree
.
Here we retreive the xml attributes and if there was a src
attribute
defined we create a new WebFXLoadTreeItem
and otherwise a
WebFXTreeItem
. Once that is created we go through all the
childNodes
of the xml node and convert and add those as well.
// Converts an xml tree to a js tree. See article about xml tree format function _xmlTreeToJsTree(oNode) { // retreive attributes var text = oNode.getAttribute("text"); var action = oNode.getAttribute("action"); var parent = null; var icon = oNode.getAttribute("icon"); var openIcon = oNode.getAttribute("openIcon"); var src = oNode.getAttribute("src"); // create jsNode var jsNode; if (src != null && src != "") jsNode = new WebFXLoadTreeItem(text, src, action, parent, icon, openIcon); else jsNode = new WebFXTreeItem(text, action, parent, icon, openIcon); // go through childNOdes var cs = oNode.childNodes; var l = cs.length; for (var i = 0; i < l; i++) { if (cs[i].tagName == "tree") jsNode.add( _xmlTreeToJsTree(cs[i]), true ); } return jsNode; }


Blue to play 32
Unlimited Game
pips Blue=163 White=154
(CorrectAnswer= 0/0, ErrorScore= 0)
これもヒット&ダウンが正しい。
Hit-and-down is again correct.
Hit-and-down is again correct.
1. 13/11 6/3* eq: -0.046 49.34% (G:15.39% B:0.70%) 50.66% (G:17.08% B:1.30%) 2. 6/3* 3/1* eq: -0.084 (-0.038) 47.64% (G:15.39% B:0.39%) 52.36% (G:16.26% B:0.86%) 3. 24/22 6/3* eq: -0.100 (-0.054) 48.20% (G:14.25% B:0.63%) 51.80% (G:17.22% B:1.04%) 4. 13/8 eq: -0.136 (-0.090) 47.13% (G:12.89% B:0.46%) 52.87% (G:15.96% B:0.79%)


Plan Your Trip
Experience
X
Plan Your Trip
Box 1
Box 2
Box 3
Box 4
Box 5
Box-6
class="flex-container4">


Class Astronomy
Inheritance
System.Object
Astronomy
Namespace: TimeAndDate.Services.DataTypes.Astro
Assembly: TimeAndDate.Services.dll
Syntax
public class Astronomy : object
Constructors
| Improve this Doc View SourceAstronomy()
Declaration
public Astronomy()
Properties
| Improve this Doc View SourceEvents
Lists all sunrise/sunset events during the day.
Declaration
public List<AstronomyEvent> Events { get; set; }
Property Value
| Type | Description |
|---|---|
| List<AstronomyEvent> | The events. |
Name
Object name. Currently, the sun is the only supported astronomical object.
Declaration
public AstronomyObjectType Name { get; set; }
Property Value
| Type | Description |
|---|---|
| AstronomyObjectType | The name. |
Special
This element is only present if there are no astronomical events. In this case it will indicate if the sun is up or down the whole day.
Declaration
public AstronomySpecial Special { get; set; }
Property Value
| Type | Description |
|---|---|
| AstronomySpecial | The special. |
Sunrise
This returns the hour and minute of the sunrise in DateTime format. If there is no sunrise, null will be returned, but the Special-property will say whether or not the sun is up or down.
Declaration
public DateTime? Sunrise { get; }
Property Value
| Type | Description |
|---|---|
| System.Nullable<DateTime> | The sunrise in DateTime. Null if there is no sunrise that day. |
Sunset
Declaration
public DateTime? Sunset { get; }
Property Value
| Type | Description |
|---|---|
| System.Nullable<DateTime> |
Operators
| Improve this Doc View SourceExplicit(XmlNode to Astronomy)
Declaration
public static explicit operator Astronomy(XmlNode node)
Parameters
| Type | Name | Description |
|---|---|---|
| XmlNode | node |
Returns
| Type | Description |
|---|---|
| Astronomy |


The Web Share API is an experiment in Chrome and the origin trial will end in April 2017. Although I try to keep my articles up-to-date, the information here will likely be outdated at some point. For more info please visit developers.google.com
Since Chrome 55 (Beta as of October 2016) you can use the Web Share API as an Origin Trail on Android. In this article, I would like to show, how to enhance your current share button with the Web Share API.
Requirements
As I said, the Web Share API is an origin trail until April 2017. So, you first need to sign up to get a trail token. After about 1 day (it took ~4hours in my case) you will get an email with the Origin Trial Token for your site.
Next you have to include the token on your site:
<meta http-equiv="origin-trial" data-feature="Web Share" data-expires="2016-12-01" content="TOKEN">
Further requirements are:
- Your site needs to be served via https
- You can call
navigator.share()
only on user gesture, eg. click. - All property values must be strings
With that in place we can now use the Web Share API.
Demo time
First, we will include a static share link for twitter:
Share via Twitter
This way everybody using a browser not supporting the API will get a link (which may or may not look like a button) to share the site on twitter.
Next, we add a script at the bottom of our site to enhance the link using the Share API:
if (navigator.share !== undefined) {
const SHARE_BTN = document.querySelector('.share');
SHARE_BTN.textContent = 'Share';
SHARE_BTN.addEventListener('click', function (ev) {
navigator.share({
title: document.title,
url: document.querySelector('link[rel=canonical]') ? document.querySelector('link[rel=canonical]').href : window.location.href
}).then(() => console.log('Successful share'))
.catch((error) => console.log('Error sharing:', error));
ev.preventDefault();
});
}
Let’s go through the code one by one. First, we add a feature test to check if navigator.share
is supported. If this is the case, we change the text of our share link from “Share via Twitter” to “Share” to show that you can share with various services.
Next, we add an EventListener
for our share link, to call navigator.share
on click. There we define properties for title and url. You can also add a text property here. For the url we first check if there is a cononical link and use that, otherwise we use the current url.
Last, we call ev.preventDefault();
to prevent the default action of the link.
Everyone using a browser supporting the Share API can now easily share the site via all services/apps they have installed on their device and all others still get the twitter link or can copy the URL and share with their favorite service.
Here is a demo and you can also find the code on Github.
Note: To enhance the sharing for browsers not supporting the Web Share API you can also use responsible social share links and load the share dialog in a pop-up.
Conclusion
It takes some preparation to use the Share API, but once you have completed them you can use it with some lines of JavaScript.
The Web Share API will be a trail at least until April 2017, after that there may be another trail or it may be implemented by default. It also only works on Android for now. Still, I like the idea - it is a great example of browsers implementing features many sites already use. This gives users an enhanced experience without the overhead of loading lots of JavaScript as it currently the case on many sites.
Happy sharing!


Monte Carlo Sampling Expectation Values of Obsevables¶
The example below demonstrates how to use the *_basis_general methods Op_bra_ket(), representative() and get_amp(), which do not require computing all basis states, to do Monte-Carlo sampling in a symmetry-reduced subspace.
Depending on the problem of interest, sampling in the symmetry-reduced Hilbert space, as opposed to sampling in the full Hilbert space, may or may not be advantages (in terms of speed and efficiency).
Physics Setup¶
The expectation value of an operator \(H\) in a state \(\psi\) can be written as
where \(\{|s\rangle\}_s\) can be any basis, in particular the Fock (\(z\)-) basis used in QuSpin.
The above expression suggests that one can use sampling methods, such as Monte Carlo, to estimate the expectation value of \(\langle\psi|H|\psi\rangle\) using the quantity \(E_s\) (sometimes referred to as the local energy) evaluated in samples drawn from the probability distribution \(p_s=|\psi_s|^2\). If we have: (i) a function \(s\mapsto\psi_s\) which computes the amplitudes for every spin configuration \(s\), and (ii) the matrix elements \(H_{ss'}\), then
where \(\mathcal{S}\) contains \(N_\mathrm{MC}\) spin configurations sampled from \(p_s=|\psi_s|^2\).
Since this procedure does not require the the state \(|\psi\rangle\) to be normalized, ideas along these lines allow to look for variational approximations to the wavefunction \(\psi_s\) in large system sizes, for instance with the help of restricted Boltzmann machines [arXiv:1606.02318].
The code below performs Monte-Carlo (MC) sampling in the symmetry-reduced Hilbert space. New states are proposed by swapping the spin values on random lattice sites; this update can take a representative state outside the symmetry-reduced basis, and we apply the basis.representative() function to project it back. To satisfy Detailed Balance in the MC acceptance/rejection condition, we use the function basis.get_amp() to compute the probability ratio in the full (symmetry-free) basis without actually constructing it.
In the example below, we assume that we already have a quantum state \(\psi_s\) in the Fock basis, and we sample the expectation value of an operator H using the *_basis_general methods Op_bra_ket(), representative(), and get_amp(). These methods do not require to compute the full basis, and thus allow to develop techniques for reaching system sizes beyond exact diagonalization (cf. the basis optional argument make_basis, as well as block_order which can deliver extra speed).
Script¶
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 | from __future__ import print_function, division
import sys,os
# line 4 and line 5 below are for development purposes and can be removed
qspin_path = os.path.join(os.getcwd(),"../../")
sys.path.insert(0,qspin_path)
###########################################################################
# example 11 #
# In this script we demonstrate how to use QuSpin's methods of #
# the general_basis class which do not require explicit calculation #
# of the basis itself. Using the J1-J2 model on a square lattice, we #
# show how to estimate the energy of a state using Monte-Carlo sampling.#
###########################################################################
from quspin.operators import hamiltonian
from quspin.basis import spin_basis_general
from quspin.operators._make_hamiltonian import _consolidate_static
import numpy as np
from scipy.special import comb
np.random.seed(1) #fixes seed of rng
from time import time # timing package
#
ti = time() # start timer
###### define model parameters ######
J1=1.0 # nn interaction
J2=0.5 # nnn interaction
Lx, Ly = 4, 4 # linear dimension of 2d lattice
N_2d = Lx*Ly # number of sites
#
###### setting up user-defined symmetry transformations for 2d lattice ######
sites = np.arange(N_2d) # site labels [0,1,2,....]
x = sites%Lx # x positions for sites
y = sites//Lx # y positions for sites
#
T_x = (x+1)%Lx + Lx*y # translation along x-direction
T_y = x +Lx*((y+1)%Ly) # translation along y-direction
#
T_a = (x+1)%Lx + Lx*((y+1)%Ly) # translation along anti-diagonal
T_d = (x-1)%Lx + Lx*((y+1)%Ly) # translation along diagonal
#
P_x = x + Lx*(Ly-y-1) # reflection about x-axis
P_y = (Lx-x-1) + Lx*y # reflection about y-axis
P_d = y + Lx*x # reflection about diagonal
#
Z = -(sites+1) # spin inversion
#
###### setting up operator string for Hamiltonian matrix elements H_{ss'} ######
# setting up site-coupling lists for the J1-J2 model on a 2d square lattice
J1_list=[[J1,i,T_x[i]] for i in range(N_2d)] + [[J1,i,T_y[i]] for i in range(N_2d)]
J2_list=[[J2,i,T_d[i]] for i in range(N_2d)] + [[J2,i,T_a[i]] for i in range(N_2d)]
# setting up opstr list
static=[["xx",J1_list],["yy",J1_list],["zz",J1_list], ["xx",J2_list],["yy",J2_list],["zz",J2_list]]
# convert static list to format which is easy to use with the basis_general.Op and basis_general.Op_bra_ket methods.
static_formatted = _consolidate_static(static)
#
###### setting up basis object without computing the basis (make=False) ######
basis = spin_basis_general(N_2d, pauli=0, make_basis=False,
Nup=N_2d//2,
kxblock=(T_x,0), kyblock=(T_y,0),
pxblock=(P_x,0), pyblock=(P_y,0), pdblock=(P_d,0),
zblock=(Z,0),
block_order=['zblock','pdblock','pyblock','pxblock','kyblock','kxblock'] # momentum symmetry comes last for speed
)
print(basis) # examine basis: contains a single element because it is not calculated due to make_basis=False argument above.
print('basis is empty [note argument make_basis=False]')
#
###### define quantum state to compute the energy of using Monte-Carlo sampling ######
#
# auxiliary basis, only needed for probability_amplitude(); not needed in a proper variational ansatz.
aux_basis = spin_basis_general(N_2d, pauli=0, make_basis=True,
Nup=N_2d//2,
kxblock=(T_x,0), kyblock=(T_y,0),
pxblock=(P_x,0), pyblock=(P_y,0), pdblock=(P_d,0),
zblock=(Z,0),
block_order=['zblock','pdblock','pyblock','pxblock','kyblock','kxblock'] # momentum symmetry comes last for speed
)
# set quantum state to samplee from to be GS of H
H = hamiltonian(static,[],basis=aux_basis,dtype=np.float64)
E, V = H.eigsh(k=2, which='SA') # need NOT be (but can be) normalized
psi=(V[:,0] + V[:,1])/np.sqrt(2)
#
##### define proposal function #####
#
def swap_bits(s,i,j):
""" Swap bits i, j in integer s.
Parameters
-----------
s: int
spin configuration stored in bit representation.
i: int
lattice site position to be swapped with the corresponding one in j.
j: int
lattice site position to be swapped with the corresponding one in i.
"""
x = ( (s>>i)^(s>>j) ) & 1
return s^( (x<<i)|(x<<j) )
#
##### define function to compute the amplitude `psi_s` for every spin configuration `s` #####
basis_state_inds_dict=dict()
for s in aux_basis.states:
basis_state_inds_dict[s]=np.where(aux_basis.states==s)[0][0]
def probability_amplitude(s,psi):
''' Computes probability amplitude `psi_s` of quantum state `psi` in z-basis state `s`.
Parameters
----------
s: array_like(int)
array of spin configurations [stored in their bit representation] to compute their local energies `E_s`.
psi_s: array
(unnormalized) probability amplitude values, corresponding to the states `s`.
'''
return psi[[basis_state_inds_dict[ss] for ss in s]]
#
##### define function to compute local energy `E_s` #####
#
def compute_local_energy(s,psi_s,psi):
"""Computes local energy E_s for a spin configuration s.
Parameters
----------
s: array_like(int)
array of spin configurations [stored in their bit representation] to compute their local energies `E_s`.
psi_s: array
(unnormalized) probability amplitude values, corresponding to the states `s` in the symmetry-reduced basis.
psi: array
(unnormalized) array which encodes the mapping $s \\to \\psi_s$ (e.g. quantum state vector) in the symmetry-reduced basis.
"""
# preallocate variable
E_s=np.zeros(s.shape,dtype=np.float64)
#
# to compute local energy `E_s` we need matrix elements `H_{ss'}` for the operator `H`.
# These can be computed by looping overthe static list without constructing the operator matrix.
for opstr,indx,J in static_formatted:
# for every state `s`, compute the state it connects to `s'`, and the corresponding matrix element `ME`
ME,bras,kets = basis.Op_bra_ket(opstr,indx,J,np.float64,s,reduce_output=False)
# performs sum over `s'`
E_s+=ME * probability_amplitude(bras,psi)
# normalize by `psi_s`
E_s/=psi_s
return E_s
#
##### perform Monte Carlo sampling from `|psi_s|^2` #####
#
# draw random spin configuratio
s=[0 for _ in range(N_2d//2)] + [1 for _ in range(N_2d//2)]
np.random.shuffle(s)
s = np.array(s)
s=''.join([str(j) for j in s])
print('random initial state in bit representation:', s)
# transform state in bit representation
s=int(s,2)
print('same random initial state in integer representation:', s)
# compute representative of state `s` under basis symmetries (here only Z-symmetry)
s=basis.representative(s)
print('representative of random initial state in integer representation:', s)
# compute amplitude in state s
psi_s=probability_amplitude(s,psi)
#
psi_s_full_basis=np.copy(psi_s)
# overwrite the symmetry-reduced space psi_s_full_basis with its amplitude in the full basis
basis.get_amp(s,amps=psi_s_full_basis,mode='representative') # has the advantage that basis need not be made.
#
# define MC sampling parameters
equilibration_time=200
autocorrelation_time=N_2d
# number of MC sampling points
N_MC_points = 1000
#
##### run Markov chain MC #####
#
# compute all distinct site pairs to swap
#
# preallocate variables
E_s=np.zeros(N_MC_points,dtype=np.float64)
MC_sample=np.zeros(N_MC_points,dtype=basis.dtype)
#
j=0 # set MC chain counter
k=0 # set MC sample counter
while k<N_MC_points:
# propose new state t by swapping two random bits
t=s
while t==s: # repeat until a different state is reached
# draw two random sites
site_i=np.random.randint(0,N_2d)
site_j=np.random.randint(0,N_2d)
# swap bits in spin configurations
t = swap_bits(s,site_i,site_j) # new state t corresponds to integer with swapped bites i and j
#
# compute representatives or proposed configurations to bring them back to symmetry sector
t=basis.representative(t)
psi_t=probability_amplitude(t, psi)
# CAUTION: symmetries break detailed balance which we need to restore by using the amplitudes in the full basis.
psi_t_full_basis=np.copy(psi_t)
# overwrite the symmetry-reduced space psi_t_full_basis with its amplitude in the full basis
basis.get_amp(t,amps=psi_t_full_basis,mode='representative') # has the advantage that basis need not be made.
#
### accept/reject new state
#
# use amplitudes psi_t_full_basis and psi_s_full_basis to restore detailed balance
eps=np.random.uniform(0,1)
if eps * np.abs(psi_s_full_basis)**2 <= np.abs(psi_t_full_basis)**2:
s=t
psi_s=psi_t
psi_s_full_basis=psi_t_full_basis
#
# wait for MC chain to quilibrate and collect uncorrelated samples
if (j>equilibration_time) and (j%autocorrelation_time==0):
# compute local energy
print('computing local energy E_s for MC sample {0:d}'.format(k))
E_s[k] = compute_local_energy(s,psi_s,psi)
# update sample
MC_sample[k]=s
# update MC samples counter
k+=1
#
j+=1 # update MC chain counter
#
##### compute MC-sampled average energy #####
# compute energy expectation and MC variance
E_mean=np.mean(E_s)
E_var_MC=np.std(E_s)/np.sqrt(N_MC_points)
#
# compute exact expectation value
E_exact=H.expt_value(psi/np.linalg.norm(psi))
##### compute full basis #####
# so far the functions representative(), get_amp(), and Op_bra_ket() did not require to compute the full basis
basis.make(Ns_block_est=16000)
print(basis) # after the basis is made, printing the basis returns the states
# compare results
print('mean energy: {0:.4f}, MC variance: {1:.4f}, exact energy {2:.4f}'.format(E_mean, E_var_MC, E_exact) )
print("simulation took {0:.4f} sec".format(time()-ti))
|


Somos el equipo de expertos que tu compania necesita para dar el gran salto.
Our main goal is to make your life easier. In order to do so we focus on your technology needs and design a custom made plan to achieve your business goals.
Whether you need to migrate a server between providers, set up a high availability cluster in Amazon Web Services or even create your own cloud, we have done it and will help you to get it right.

Together we design and plan a disaster recovery plan to ensure your business continuity.
We can help you to improve your mission critical database performance and availability, our team have wide experience with any well-known DBMS like MySQL, PostgreSQL, Cassandra and Redis.
We will guide you trough the planning, designing and implementation phases of your cloud infrastructure.
Everyone loves automation, so do we. Chef, Puppet, SaltStack, Ansible you name it we do it. Start a web cluster with the snap of your fingers.
You can rest assure that your systems are ticking as a good swiss clock. Our monitoring team takes care of any event or performance degradation to ensure optimum functionality.
Tienen un fuerte equipo técnico que respalda sus actividades, generando proyectos de alta calidad.
Julio Fitipaldo
CEO at Nublit
Excelentes resultados y un servicio excepcional. Da gusto trabajar con gente joven tan profesional y capaz.
Pablo Flores
CEO at Urupaper
Nullam suscipit ante ac arcu placerat, nec sagittis quam volutpat. Vestibulum aliquam facilisis velit ut ultrices.
Anna Pickard
Master web developer at Intel
Fusce erat libero, fermentum quis sollicitudin id, venenatis nec felis. Morbi sollicitudin gravida finibus.
Wafer Baby
Web designer at Microsoft


{% extends "layout.html" %} {% block styles %} {% endblock %} {% block body %}
Your mod is currently being imported, you will get a mail once that's done.


Our award-winning and company-specific sales training and leadership development programs can fully enhance the learning experience, employee engagement, and, of course, results.
We help onboard, improve and engage sales talent.
TOP BLOG POST
Over 5000 people just like you read this article
OFF-THE-SHELF sales training receives a bad reputation from participants and purchasers alike. Learn how to change this by energizing your team with customized and engaging content.
DOWNLOAD ›Free Sales Training
Experience the difference. Try before you buy.
We know how important it is to ensure there is a good fit between the sales trainer and trainees. That's why we offer your first session absolutely FREE.
LIMITED SPACE AVAILABLE (5 spots per/month)
Sales Training Program
We’ve designed an eight module program based on social science theory (peer reviewed studies) and connected it with the world recognized Inbound Selling Methodology to give salespeople the skills and knowledge they need.
- Get prospects to say yes
- Reduce resistance & gain support
- Engage prospects
- Gain the power & get things done
- Navigate group decisions
- Motivate and engage your staff
- Make choices that can support
- Create a learning culture
Although the program has been designed to cover all the material, a salesperson needs to be successful, the "When" the "Where" and the "How" for each training engagement, is different. We customize the training sequences, delivery method, and content to match each particular environment.
Ashley provided our management and sales team strategic insight and training that was imperative to our Company’s vision of becoming more customer-centric within the highly competitive residential construction industry. I highly recommend Ashley and Wesley Capital’s services and look forward to his continued help in the future.
— Allan R. Tereschyn, President & Owner of GNI Management Group
Our Implement ation Process:
100% Customized Training For Your Staff
PLANNING
A. PARTICIPANTS -
Together, we decide on who is going to participate in the training. Typically your best ROI comes from training midlevel performers
B.EVALUATION -
Together, we’ll conduct psychological testing, interviews, and ride-alongs to create a sales report card for each rep. This is a significant step as you don't want to be wasting time or money on the wrong people or focusing on inappropriate skills.
DESIGNING
C. PROGRAM DESIGN -
Together, we develop a custom program outline, focusing on the most pressing issues first. We set goals by each module, month or quarter.
D. SCHEDULING -
Together, we formalize the training and coaching schedules to accommodate the desires of your sales reps and to meet specifically outlined goals.
CUSTOMIZING
E. TRAINING AND DEVELOPMENT -
Together, we customize the training modules. We work with you to understand your specific company situation, i.e., competitors, UVP, etc.
F. DELIVERY -
Together, we customize the delivery to get the best result from your staff (gamification, experience learning, action learning, etc.)
ANALYZE
G. REPORTING -
Together, we create evaluation criteria to meet our specific goals. Then we readjust the program based on the feedback from the data.
Wesley Capital Ltd.
218 Silvercreek Pkwy N #17A.
Guelph, ON
N1H 8E8, Canada
519-994-4933
ash@wesleycapital.ca


statsmodels.regression.mixed_linear_model.MixedLMResults¶
-
class
statsmodels.regression.mixed_linear_model.
MixedLMResults
(model, params, cov_params)[source]¶ Class to contain results of fitting a linear mixed effects model.
MixedLMResults inherits from statsmodels.LikelihoodModelResults
- Parameters
- See statsmodels.LikelihoodModelResults
See also
statsmodels.LikelihoodModelResults
- Attributes
- modelclass instance
Pointer to MixedLM model instance that called fit.
normalized_cov_params
arraySee specific model class docstring
- paramsarray
A packed parameter vector for the profile parameterization. The first k_fe elements are the estimated fixed effects coefficients. The remaining elements are the estimated variance parameters. The variance parameters are all divided by scale and are not the variance parameters shown in the summary.
- fe_paramsarray
The fitted fixed-effects coefficients
- cov_rearray
The fitted random-effects covariance matrix
bse_fe
arrayReturns the standard errors of the fixed effect regression coefficients.
bse_re
arrayReturns the standard errors of the variance parameters.
Methods
aic
()Akaike information criterion
bic
()Bayesian information criterion
bootstrap
([nrep, method, disp, store])simple bootstrap to get mean and variance of estimator
bse
()The standard errors of the parameter estimates.
bse_fe
()Returns the standard errors of the fixed effect regression coefficients.
bse_re
()Returns the standard errors of the variance parameters.
bsejac
()standard deviation of parameter estimates based on covjac
bsejhj
()standard deviation of parameter estimates based on covHJH
conf_int
([alpha, cols, method])Returns the confidence interval of the fitted parameters.
cov_params
([r_matrix, column, scale, cov_p, …])Returns the variance/covariance matrix.
covjac
()covariance of parameters based on outer product of jacobian of log-likelihood
covjhj
()covariance of parameters based on HJJH
Model WC
f_test
(r_matrix[, cov_p, scale, invcov])Compute the F-test for a joint linear hypothesis.
Returns the fitted values for the model.
get_nlfun
(fun)This is not Implemented
hessv
()cached Hessian of log-likelihood
initialize
(model, params, **kwd)Initialize (possibly re-initialize) a Results instance.
llf
()Log-likelihood of model
load
(fname)load a pickle, (class method)
See specific model class docstring
predict
([exog, transform])Call self.model.predict with self.params as the first argument.
profile_re
(re_ix, vtype[, num_low, …])Profile-likelihood inference for variance parameters.
pvalues
()The two-tailed p values for the t-stats of the params.
The conditional means of random effects given the data.
Returns the conditional covariance matrix of the random effects for each group given the data.
remove data arrays, all nobs arrays from result and model
resid
()Returns the residuals for the model.
save
(fname[, remove_data])save a pickle of this instance
cached Jacobian of log-likelihood
summary
([yname, xname_fe, xname_re, title, …])Summarize the mixed model regression results.
t_test
(r_matrix[, scale, use_t])Compute a t-test for a each linear hypothesis of the form Rb = q
t_test_pairwise
(term_name[, method, alpha, …])perform pairwise t_test with multiple testing corrected p-values
tvalues
()Return the t-statistic for a given parameter estimate.
wald_test
(r_matrix[, cov_p, scale, invcov, …])Compute a Wald-test for a joint linear hypothesis.
wald_test_terms
([skip_single, …])Compute a sequence of Wald tests for terms over multiple columns


The "Solar-Log 1200" Meter can export its logged pv-data of our houseproduction and send it daily by ftp to an external server.
So i have now the data on an own hosted Debian-server with EmonCMS running.
Now i want to get that data into our EmonCMS.
Is there already a CSV-Import-Module available for EmonCMS ?
When not:
- do i have to write a script and poll the emoncms by web?
- or is there also another and faster way to write the data into EmonCMS?
(directly to the Database)
Thanks for any help into the right direction!
Re: export Solar-Data from Solar-Log 1200 Meter into EmonCMS
Hey Mich,
I don't know of an import module but it would be easy to create it. You'd need to read the CSV one line at a time and send each entry using the API calls. If you go to your feeds page top right is a link "Feed API Help"
That page will tell you the format of the web call you need to make.
Re: export Solar-Data from Solar-Log 1200 Meter into EmonCMS
Just to add to octagon's suggestion, if you are using emonHub you can also write a small python script like the one suggested in this discussion, to post via socket. Just change the code to open socket loop through sending each record before closing the socket rather than opening a socket to post each record.
A recent mod to emonhub's " testing " branch on git, allows pre-timestamped data in the format unixtime nodeid val1 val2 val3. This is work in progress and not yet in the "released" version if you wish to try it out.
It will then except data in the format of unixtime nodeid val1 val2 val3 etc via the above mentioned socket interfacer if a " timestamped = true " setting is added to the sockets [[[runtimesettings]]] .
Depending on how much csv data you have you may also need to increase the buffer size of the emonCMS reporter in emonhub.conf as the default of 1000 frames will fill up very fast, while a separate thread will be posting the data to emoncms 100 frames at a time, add a line like " buffer_size = 10000 " to [reporters] [[emonCMS]] [[[init_settings]]], the 100 frames per post can also be increased upto 250 by adding a setting " batchsize = 250 " in [reporters] [[emonCMS]] [[[runtimesettings]]].
Re: export Solar-Data from Solar-Log 1200 Meter into EmonCMS
perfect!
thank you pb66 and octagon for pointing me to the right direction and thank you for your help!