pushMe pullYou » tooToo »
typical menu items
Click the pencil icon to edit the file on GitHub
Reads Markdown files
Supports location hash
Obtains filenames and files via GitHub API
Needs hamburger menu


KeMana
KeMana is a bus app for Jakarta bus system which was designed by myself when I worked as a UI Art Design Intern at CHOCOLABS (merged into LINE TV).I joined KeMana team as UI designer at the stage when product manager had already done the basic research and wireframe of the product. My jobs were to map out the user flow, develop the overall user experience and create the visual user interface by following Material Design guidelines.
What to solve?
In Jakarta, buses are used as their major means of transportation and always crowded with people. We want to provide a service that tells users "where is the bus now", "when will the bus arrive", and "how to transfer to reach their destinations". We believed it can help to reduce users' waiting time by providing the above information.
Role: UI Designer
Type: Mobile App
Year: 2015
Produced by CHOCOLABS
Product Manager: Isabella
Design Director: Rayon Hung
Designer: Yen-Len Chen
Type: Mobile App
Year: 2015
Produced by CHOCOLABS
Product Manager: Isabella
Design Director: Rayon Hung
Designer: Yen-Len Chen
Press
1. Mau Gak Tersesat di Ibukota, Tenang Kini Ada Aplikasi “KEMANA” (in Indonesian)
2. Aplikasi KeMana Hadirkan Informasi Jalur dan Kedatangan TransJakarta(in Indonesian)


As we know all the real world applications are not simple, they support complex operations, and to design complex operation we required conversational state and contextual information to be maintained. So by using SOAP developers no need to worry about writing plumbing code in application layer by themselves because SOAP require less plumbing code as compared to REST. These web services are useful to handle asynchronous processing and request of data. This support several protocols and technologies which are interoperable like UDDI, WSDL, XML WS-addressing. WSDL is a common set of rules to define the messages, binding, operations and the location of the services.
Learn MoreWhile REST stands for Representational State Transfer, which is an architectural style for networked hypermedia applications, it is primarily used to build Web services that are lightweight, maintainable, and scalable. A service based on REST is called a RESTful service.
Learn More


There are a few basic data types
Boolean - a true or false value
Null - a value of null
Undefined - a value that has not been defined
Number - a number include decimals
String - any text in side single ' or double quotes "


Demon's Souls is a third person action RPG released in Japan on February 5th, 2009 and in North America on October 6th. It was developed by From Software with the help of Sony Japan studio. It was published by Atlus; Namco Bandai Games published the game for Australia and Europe on June 23 and June 25 2010, respectively.
| Name | DEMON'S SOULS | デモンズソウル | ||
|---|---|---|---|---|
| Cover | North American Cover |
Deluxe Edition Cover |
||
| Release Date | NA: 06/10/2009 |
JP: 05/02/2009 |
EU: 25/06/2010 |
AU: 25/06/2009 |
| Genre | Action | RPG | ||
| Price | Regular Edition: 13.99 USD 1,700 YEN | |||
| Rating | Mature | |||
| Online | PlayStation Network | |||
| Developer | From Software | |||
| Publisher | From Software (Japan) | Namco Bandai Games (Int'l) | ||
| Director | Miyazaki Hidetaka | |||
| Official Site | Japanese Site | English Site |


Answer all the questions provided.
What is javascript?
Name three data types?
A boolean can hold ___ or ___ values.
The following are languages used in coding, which one is not?
What is JS acronym in full words?


Created By Divya Mamgai
Above Folios are linked. Try changing in page in one of the above and the change will be reflected on
the other one.
Note: onUpdate()
is only called once.
HTML

JS var $messageOne = $('#MessageOne', d), $paginationOneTop = $('#PaginationOneTop', d), $paginationOneBottom = $('#PaginationOneBottom', d); $paginationOneTop.Folio({ totalPages: 100, maxPages: 17, activePage: 1, previousClass: 'glyphicon glyphicon-chevron-left', nextClass: 'glyphicon glyphicon-chevron-right', onUpdate: function (page) { $messageOne.text('Opened Page #' + page); } }).GetFolio().link($paginationOneBottom.GetFolio()); $paginationOneBottom.GetFolio().link($paginationOneTop.GetFolio()); |
The function name data-on-update
attribute points to should be declared before the
Folio.js's version of the $(function(){...})
is executed.
HTML

JS window.updateMessage = function (page) { $('#MessageTwo', d).text('Opened Page #' + page + ' {window.updateMessage()}'); }; |
useHTMLOptions {boolean} |
If true HTML options are used. Default is true . |
infiniteScrolling {boolean} |
If true the pagination scrolls back to front or vice versa. Default is
false .
|
totalPages {int} |
Total number of pages in the pagination. Default is 0 . |
maxPages {int} |
Maximum number of pages to be displayed at a time. Default is 9 . |
activePage {int} |
Current page number. Default is 1 . |
nextClass {string} |
Class to be added to the next button. Default is empty. |
previousClass {string} |
Class to be added to the previous button. Default is empty. |
onUpdate {Function} |
Function to be called when a page is changed using the pagination. Default is
$.noop .
|
disableInitialOnUpdate {boolean} |
If true then onUpdate() function is not called when the
Folio object is initialized. Default is false .
|
| Arguments | {Object} defaultOptions |
| Action | Overrides the defaults options used for every instance of
Folio .
|
| Arguments | {Object} options |
| Action |
Creates a new Object from the defaults and extends it with the options
Object provided.
|
| Arguments | {Function} callback |
| Action |
Sets the onUpdate() function to be called each time the
this.update() function is called. This is just an added utility
function, since same can be achieved using this.setOptions() function
as used in it.
|
| Returns |
{Folio}
|
| Action |
Generates the HTML elements of page numbers in the .Folio .FolioPages
element corresponding to the maximum elements it can have and store them in a jQuery
object array (Note: DOM Elements are mapped to their jQuery objects
for
faster operations later on.) i.e., this.$pageArray . Initially each
element is given numbering from 1 to this.properties.maxPages . Also it
clears the .FolioPages elements HTML content before appending page
number elements.Note: This function should not be called many times in succession because it is very costly operation and is only automatically called during initialization. |
| Returns |
{Folio}
|
| Arguments |
{boolean} [disableOnUpdate] - If true then
onUpdate is not called. Default is false .
{boolean} [disableSync] - If true then synchronisation is
not done i.e., setActivePage(activePage) is not called for the linked
Folio objects. Default is false .
|
| Action |
Updates the .FolioPages page numbering corresponding to the current
activePage . No new element is created and only the numbers(text) of the
existing page number elements is updated using the cached .FolioPages
.FolioPage jQuery object array i.e., this.$pageArray . Also
updates (Either removes or adds the .Disabled class based on the
condition.) the next and previous buttons .Disabled class.
Note: It also calls the this.properties.onUpdate()
function
automatically.
|
| Returns |
{Folio}
|
| Arguments |
{int} page - Page Number to set the activePage to.
{boolean} [disableOnUpdate] - If true then
onUpdate is not called. Default is false .
{boolean} [disableSync] - If true then synchronisation is
not done i.e., setActivePage(page) is not called for the linked
Folio objects. Default is false .
|
| Action |
Sets the activePage of the pagination to the given page number and also
calls update() function automatically.
|
| Returns |
{Folio}
|
| Action |
Increments the activePage number. If
this.properties.infiniteScrolling is enabled it jumps to 1st
page if called when the activePage is the last page.
|
| Returns |
{Folio}
|
| Action |
Decrements the activePage number. If
this.properties.infiniteScrolling is enabled it jumps to last page if
called when the activePage is the 1st page.
|
| Returns |
{Folio}
|
| Arguments |
{Folio} folio - Folio object to link this one with.
{boolean} [disableBackLinking] - If true then
setActivePage(activePage) and link(this) is not called for
the linking Folio object. Default is false .
|
| Action |
Links this Folio object to the one passed as a parameter. Both the
Folio objects should have equal number of pages. But the
maxPages can be different. The onUpdate function for all
the Folio objects being linked are set to the onUpdate function of this
Folio object (one being linked to).
|
| Returns |
{Folio}
|
| Action | Initializer function for the plugin. |
| Returns |
{Folio}
|


Version Control, Git, and GitHub
Snapshots in Time
1/2/2016
Version control is the concept of keeping track of the iterations of some product. In fact, you may be familiar with the basic concept already, either through the 5th edition of some textbook or perhaps the common editing process of a paper, naming it "paperv2.doc" or "paper(1).txt". In the concept of software, version control is the process of keeping track of the development of a program by maintaining a history of its versions. In response to the need for good version control, version control systems arose, such as Git, Mercurial, and SVN, which were focused on streamlining the process of keeping 'snapshots' of software, as well as adding features such as branching, commit messages, and efficient storage of snapshots.
One popular version control software proudct is Git. Git is a program that resides on your host computer, helping manage the record-keeping of your software's development. Git tracks the changes you've made by monitoring a specific folder containing your project, called a repository. Whenever changes are made inside the repository, you can ask git to bundle those changes into a commit, or a current snapshot of the software. If you'd like to develop changes without immediately applying them to your master copy, git allows you to make a series of commits that are independent of the 'master' work, called branching. These branches can be merged back into the master copy of the software once you are satisfied with the changes on the separate branch.
After you've made your commits, it is a good idea to store your repository somewhere outside of your host computer, usually online. While this is a good form of backing up data, this process also allows you to easily collaborate with individuals remotely from having a centralized online repo, while also displaying your code for the world to see and learn. GitHub is one such online repository storage system. Including the aforementioned benefits above, GitHub also allows functions useful for software development teams, such as bug reports, a wiki system, and the ability to request the merging of branches to the master code, called pull requests. By pushing your code from your local repository to GitHub's online repository, your project is readily backed up step-by-step, while also being augmented by tools meant to assist coding teams.


---
layout: post
title: My First Giveaway Winners .........
tags:
- Giveaway
status: publish
type: post
published: true
meta:
_edit_last: '2'
_graphene_slider_img: global
_graphene_slider_imgurl: ''
_graphene_show_addthis: global
_aioseop_keywords: Konad Nail Art kit, konad nail paint, konad nail art, indian
makeup blog
_aioseop_title: Giveaway Result
al2fb_facebook_link_id: '218440691518395_250244358338028'
al2fb_facebook_link_time: '2011-07-27T08:46:02+00:00'
al2fb_facebook_link_picture: post=http://missenchanted.com/wp-content/uploads/2011/07/shot1.jpg
al2fb_facebook_image_id: '1188'
_yoast_wpseo_linkdex: '0'
_thumbnail_id: '1192'
---
Hi Guys, thanks for all your love :)
1st winner is ..........Poohkie's Place :) :)
2nd Winner is ....... Moupriya :) :)
Congrats to both the lovely ladies :) :), Hope you will enjoy the Konad kit.
[important]Please send me your details by mail to<EMAIL_ADDRESS>If I don't hear for next 24 hours :(, I will have to draw a new winner again :([/important]
[notice]I hope everyone got the discount coupon in their email box :), If not please let me know, they expire on 31st July and I have a bunch left :P[/notice]


Well, I just finished my 4 PRs this year, and got a few questions on how to complete the Hacktoberfest for people that are not used to open-source development.
I have an easy trick to do so. NPM modules are in fact packages
that should only contain the actual code, eventual mappings for
built code and the package.json
file.
Sadly, it is often not the case. It frequently contains a lot of contents that ain't supposed to be in the distributed code. It leads to wasted disk space and network bandwidth.
A simple yet usefeul way to contribute to the open-source
community is to reduce the NPM modules size. To identify which
modules needs your help, go to any of your NodeJS project and
run the following command:
du -ch -d0 node_modules/*
To focus on the biggest modules, you can filter the output:
du -ch -d0 node_modules/* | grep M
Now we know which modules are too heavy on the DiagRAMS Technologies
API, the heaviest is typescript
with 61Mb.
To browse the repository code, just run:
npm repo typescript
Now we can investigate, I think you should avoids bigs modules like
TypeScript for your first PRs since it can be complicated to understand.
Most heavy modules are not using the
files
field in their package.json
file.
Once you could identify which files are required and which ain't, you can clone and fork the repository:
# Clone and install git clone git@github.com:{my_usersame}/{my_fork}.git; cd module; npm i; # Package the module and see its size npm pack; du -h my_fork-x.x.x.tgz # Add the `file` field to the package.json # Package the module again and check its new size npm pack; du -h my_fork-x.x.x.tgz # Install the module in your projet and check # it still works cd my_project; npm install my_fork-x.x.x.tgz; npm test;
Your are now ready to submit your pull-request !
Simple, ecological and useful, mission accomplished!


|
Drake
|
Contains parameters for differential inverse kinematics.
#include <drake/manipulation/planner/differential_inverse_kinematics.h>
Public Member Functions | |
| DifferentialInverseKinematicsParameters (int num_positions=0, int num_velocities=0) | |
| Constructor. More... | |
| void | AddLinearVelocityConstraint (const std::shared_ptr< solvers::LinearConstraint > constraint) |
| Adds a linear velocity constraint. More... | |
| void | ClearLinearVelocityConstraints () |
| Clears all linear velocity constraints. More... | |
Implements CopyConstructible, CopyAssignable, MoveConstructible, MoveAssignable | |
| DifferentialInverseKinematicsParameters (const DifferentialInverseKinematicsParameters &)=default | |
| DifferentialInverseKinematicsParameters & | operator= (const DifferentialInverseKinematicsParameters &)=default |
| DifferentialInverseKinematicsParameters (DifferentialInverseKinematicsParameters &&)=default | |
| DifferentialInverseKinematicsParameters & | operator= (DifferentialInverseKinematicsParameters &&)=default |
Getters. | |
| double | get_timestep () const |
| int | get_num_positions () const |
| int | get_num_velocities () const |
| const VectorX< double > & | get_nominal_joint_position () const |
| const Vector6< double > & | get_end_effector_velocity_gain () const |
| const std::optional< double > & | get_unconstrained_degrees_of_freedom_velocity_limit () const |
| const std::optional< std::pair< VectorX< double >, VectorX< double > > > & | get_joint_position_limits () const |
| const std::optional< std::pair< VectorX< double >, VectorX< double > > > & | get_joint_velocity_limits () const |
| const std::optional< std::pair< VectorX< double >, VectorX< double > > > & | get_joint_acceleration_limits () const |
| const std::vector< std::shared_ptr< solvers::LinearConstraint > > & | get_linear_velocity_constraints () const |
Setters. | |
| void | set_timestep (double dt) |
Sets timestep to dt . More... | |
| void | set_unconstrained_degrees_of_freedom_velocity_limit (double limit) |
Sets the max magnitude of the velocity in the unconstrained degree of freedom to limit . More... | |
| void | set_nominal_joint_position (const Eigen::Ref< const VectorX< double >> &nominal_joint_position) |
| Sets the nominal joint position. More... | |
| void | set_end_effector_velocity_gain (const Vector6< double > &gain_E) |
| Sets the end effector gains in the body frame. More... | |
| void | set_joint_position_limits (const std::pair< VectorX< double >, VectorX< double >> &q_bounds) |
| Sets the joint position limits. More... | |
| void | set_joint_velocity_limits (const std::pair< VectorX< double >, VectorX< double >> &v_bounds) |
| Sets the joint velocity limits. More... | |
| void | set_joint_acceleration_limits (const std::pair< VectorX< double >, VectorX< double >> &vd_bounds) |
| Sets the joint acceleration limits. More... | |
|
default |
| DifferentialInverseKinematicsParameters | ( | int | num_positions = 0 , |
| int | num_velocities = 0 |
||
| ) |
Constructor.
Initializes the nominal joint position to zeros of size num_positions
. Timestep is initialized to 1. The end effector gains are initialized to ones. All constraints are initialized to nullopt.
| num_positions | Number of generalized positions. |
| num_velocities | Number of generalized velocities. |
| void AddLinearVelocityConstraint | ( | const std::shared_ptr< solvers::LinearConstraint > | constraint | ) |
Adds a linear velocity constraint.
| linear_velocity_constraint | A linear constraint on joint velocities. |
| std::invalid_argument | if constraint->num_vars != this->get_num_velocities() . |
| void ClearLinearVelocityConstraints | ( | ) |
Clears all linear velocity constraints.
| const Vector6<double>& get_end_effector_velocity_gain | ( | ) | const |
| const std::optional<std::pair<VectorX<double>, VectorX<double> > >& get_joint_acceleration_limits | ( | ) | const |
| const std::optional<std::pair<VectorX<double>, VectorX<double> > >& get_joint_position_limits | ( | ) | const |
| const std::optional<std::pair<VectorX<double>, VectorX<double> > >& get_joint_velocity_limits | ( | ) | const |
| const std::vector<std::shared_ptr<solvers::LinearConstraint> >& get_linear_velocity_constraints | ( | ) | const |
| const VectorX<double>& get_nominal_joint_position | ( | ) | const |
| int get_num_positions | ( | ) | const |
| int get_num_velocities | ( | ) | const |
| double get_timestep | ( | ) | const |
| const std::optional<double>& get_unconstrained_degrees_of_freedom_velocity_limit | ( | ) | const |
|
default |
|
default |
| void set_end_effector_velocity_gain | ( | const Vector6< double > & | gain_E | ) |
Sets the end effector gains in the body frame.
Gains can be used to specify relative importance among different dimensions.
| std::exception | if any element of gain_E is larger than 1 or smaller than 0. |
| void set_joint_acceleration_limits | ( | const std::pair< VectorX< double >, VectorX< double >> & | vd_bounds | ) |
Sets the joint acceleration limits.
| q_bounds | The first element is the lower bound, and the second is the upper bound. |
| std::exception | if the first or second element of q_bounds has the wrong dimension or any element of the second element is smaller than its corresponding part in the first element. |
Sets the joint position limits.
| q_bounds | The first element is the lower bound, and the second is the upper bound. |
| std::exception | if the first or second element of q_bounds has the wrong dimension or any element of the second element is smaller than its corresponding part in the first element. |
Sets the joint velocity limits.
| q_bounds | The first element is the lower bound, and the second is the upper bound. |
| std::exception | if the first or second element of q_bounds has the wrong dimension or any element of the second element is smaller than its corresponding part in the first element. |
| void set_nominal_joint_position | ( | const Eigen::Ref< const VectorX< double >> & | nominal_joint_position | ) |
Sets the nominal joint position.
| std::exception | if nominal_joint_position's dimension differs. |
| void set_timestep | ( | double | dt | ) |
Sets timestep to dt
.
| std::exception | if dt <= 0. |
| void set_unconstrained_degrees_of_freedom_velocity_limit | ( | double | limit | ) |
Sets the max magnitude of the velocity in the unconstrained degree of freedom to limit
.
| std::exception | if limit < 0. |


You're one shell command away from deploying your own Platform as a Service.
Want to get fancy? You can pass options to the installer by adding them to the end of the command, like this:
sh <(curl -s https://install.openshift.com/) -e -s rhsm -u<EMAIL_ADDRESS>Here are some useful settings:
-a, --advanced-mode Enable access to message server and db server customization. -c, --config-file FILEPATH The path to an alternate config file -w, --workflow WORKFLOW_ID The installer workflow for unattended deployment. -l, --list-workflows List the workflow IDs available for use with unattended deployment. -e, --enterprise-mode Show OpenShift Enterprise options (ignored in unattended mode) -s, --subscription-type TYPE The software source for installation packages. -u, --username USERNAME Red Hat Login username -p, --password PASSWORD Red Hat Login password --use-existing-puppet For Origin; do not attempt to install the Puppet module -d, --debug Enable debugging messages
You can also download the installer and run it from a CD or USB drive. Unpack one of these packages onto your portable media and you are good to go:


@import models.view.{ApplicationSummaryView, AmendmentView, ApplicationTabsView}
@import views.html.common.page.twoThirdsColumn
@import template._
@this(applicationDetails: applicationDetails, amendApplication: amendApplication)
@(applicationSummaryView: ApplicationSummaryView, applicationTabsView: ApplicationTabsView, amendmentView: AmendmentView, form: play.data.Form[_])
@applicationDetails(applicationSummaryView, "amend", applicationTabsView, form) {
@if(!amendmentView.getPreviousRequestItemViews.isEmpty) {
@twoThirdsColumn {
Previous requests
}
Make another request
}
@if(amendmentView.isHasCreatorOrAdminPermission) {
@if(amendmentView.isApplicationInProgress) {
@if(amendmentView.isHasPendingWithdrawalRequest) {
You cannot make any further requests while your previous withdrawal request is pending.
} else {
@amendApplication(applicationSummaryView.getAppId, form, amendmentView)
}
} else {
@if(amendmentView.getPreviousRequestItemViews.isEmpty) {
No requests to amend or withdraw the application can be made as the application processing is complete.
} else {
No further requests to amend or withdraw the application can be made as the application processing is complete.
}
}
} else {
@if(amendmentView.isApplicationInProgress) {
@if(amendmentView.getPreviousRequestItemViews.isEmpty) {
There are no amendment or withdrawal requests and you do not have access rights to make a request.
} else {
You do not have access rights to make a request.
}
} else {
@if(amendmentView.getPreviousRequestItemViews.isEmpty) {
No requests to amend or withdraw the application can be made as the application processing is complete.
} else {
No further requests to amend or withdraw the application can be made as the application processing is complete.
}
}
}
@officer(applicationSummaryView.getCaseReference, amendmentView.getOfficerView)
}


Convert mite time-entries.csv to AZN csv format.
time-entries.csv
After selecting the file, the browser will download the converted file immediately. The conversion is done completely in your browser.


The Moxie Games
January 15, 2017
Partnering with the Spokane Health & Fitness Expo
We are Moxie! Moxie means to be bold and beautiful, just like the women of the Northwest!
This is a chance
for ladies to come together, show off their fitness and celebrate the love for CrossFit we
all share. A portion of every entry will go towards the UGM Crisis Shelter for Women and
Children in Spokane, WA.


| DOSE: |
12 mg |
smoked |
DiPT |
(powder / crystals) |
Interested in the one strange report (located on erowid) of a dmt/5meo-dmt like experience freebasing dipt, I sought out more info on this topic. Here is what was recounted to me in my research.
A person took 25mg of dipt hcl. They freebased the material by soaking in a bunch of ammonia (pure stuff from the grocery, be careful wear eye and respiratory protection). The material crystallized into two large chunks, and some speckles. It sat for 10-15 minutes and then they tried to filter it. The two major crystals were recovered but the speckles were futile. Perhaps that equated to 2mgs (there is ~2mg lost in the process anyway so they were down like 4mg to 20mg freebase). The dipt was then soaked in H20 for long enough to evaporate most of it. Some stuck to the sides of the glass and couldn't be recovered. What ended was like 16-18mg (approx. not weighed) of dipt freebase.
This material was placed in a glass pipe of the sort used for crack, meth, dmt, etc. The pipe had ~4-5 years worth of 5meo-dmt and trace amounts of dmt in it. SO all the report is prefaced by that fact. The user reported difficulty in being able to see the dipt in the pipe which brings the estimate down to probably 12mg or something that was actually burned. It had a familiar tryptamine taste, but definately distinct from 5meo-dmt. The onset was swift but slower than 5meo. All the material was smoked in one hit. Coil's composition of 4 tones from the album timemachines (DOET was the song) was put on. The harmonics vibrating off the wall became intensified and everything had the muffled or distorted sound reported by other users. There was a clear rush and liquid like visuals, unlike the sharp visuals of dmt or 5meo-dmt. Analysis, half the dose was achieved.
The report was sufficiently distinct in quality and action to rule out 5meo more or less. With double the amount, the user was certain a reality dissolving experience would be had.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Google Assistant now lets you pre-record storytime for your kids
by Hannah DaviesGoogle Assistant’s latest feature lets you pre-record stories for your kids, so they can hear them in your voice even when you can’t make it home.
It’s called My Storytime, and it lets you record yourself narrating any story and makes it easily accessible so your family can listen to you speak when you can’t be there.
Read our review of the Google Nest Mini
To use My Storytime, all you need to do is record yourself telling a story – or upload an existing audio file – to a private My Storytime account. Google will then store your files securely on the cloud so that only you and those you give permission can access them.
To begin storytime, all your family needs to say is: “Hey Google, talk to My Storytime”.
While this feature might not be for everyone, it could come in handy for any parent who works the night shift or spends a significant amount of time abroad for work.
Related: Google Home vs Amazon Echo
Google says the new functionality was inspired by the Oliver family.
“My daughters and I shared our own experiences and ideas in hopes that it would be useful to the more than 100,000 military parents who deploy every year—and the nearly 250,000 children who are back home. According to one organization, United Through Reading, that’s 40 million bedtime stories missed each year by military children. But storytime isn’t only important to military families. Grandparents who live states away, nurses and police officers who work the night shift, and anyone who travels for work can relate to the struggle of trying to make it home in time to read for bedtime. Because every bedtime story is, at its heart, a love story.”
My Storytime is available now at mystorytime.com, and you can read the Oliver family’s story over on the Google Blog:
Unlike other sites, we thoroughly review everything we recommend, using industry standard tests to evaluate products. We’ll always tell you what we find. We may get a commission if you buy via our price links. Tell us what you think – email the Editor


A professional Data Scientist and Software Engineer who’s always interested in hard problems. Think I might be interested in a career opportunity or research? Are you looking for my complete resume and professional references? Please contact me!
<EMAIL_ADDRESS>Aaron Zampaglione. I'm your typical nerd who is curious about anything related to technology: machine learning, statistical analysis, computational biology, cloud computing, web apps, open source, and "hacking" anything I don't understand. Outside of tech, I'm interested in the hard sciences, body building, nutrition, and literature relating to the human condition. You can usually find me behind my screen, behind a book, at the gym, or at the beach thinking of ways to improve the world around me.
"...  Whenever you enter into it take with you your all...”
- Kahlil Gibran
Master of Science
Data Science
Bachelor of Science
Computer Science
Bachelor of Science
Computer Engineering
(No Degree)
Robotics
(No Degree)
Marketing
Researched how the Disney Blog could prove useful to the corporation by determining popular topics, prime time for blog posts, and negative comment detection (sentiment analysis).
IPython NotebookUsing data from the MBTA’s fare collection system, my team and I focused on developing ridership prediction models. We explored the more nuanced aspects of when Bostonians ride the T, such as sporting events, weather, and geographic location of subway entrances.
Project WebsiteSimilar to the popular movie Money Ball, my team and I carried out an investigation into how Major League Baseball coaches could carry out pre-game analysis. The analysis could be used to gain insight into how an opposing pitcher might change his strategy based on the batter, inning, and other game features.
The CodeAccurately predicting Emergency Room attendance can alleviate hospital-staffing dilemmas and reduce wait time for patients. In this scenario, I applied various Machine Learning techniques to emergency room visit records and historical event data in order to predict admissions one week in advance.
The CodeThe BridgeCut algorithm is a very effective technique for producing clusters in networks. However, there are cases in which the original algorithm proves inefficient. In order to solve this issue, I introduced three improvements to the BridgeCut algorithm.
Full ReportA primary objective for mobile robots is to autonomously navigate unknown environments. As part of my undergraduate thesis, I presented methods in which smoothed paths and curved turns can be achieved, to make movement more efficient and aesthetically pleasing.
Full ReportUsing large clusters, I developed Hadoop MapReduce jobs to analyze terabytes of data for the Department of Defense. The results were pipelined directly to analysts, providing previously unavailable intelligence.
Protein Folds are responsible for the 3D structure of protein. Using spectral analysis algorithms, I attempted to find similarities between protein folds in order to predict functionality for unknown proteins.
XSeries
BerkleyX
SMART
American Society for Engineering Education
Atlantis STARS
Department of Education


[ht::head {Installing on Amazon AWS}]
Installing on Amazon AWS
Here are the steps to install the stand-alone version of RAMADDA on an AWS instance.
The installer README describes
the set of steps required to launch and configure an instance through the
Amazon EC2 Dashboard,
and how to download and run the RAMADDA installer on that instance.
An alternative is to use the command line installation script described below.
Create an EC2 Instance
- From the EC2 Dashboard go to the Instances page and select "Launch Instance".
- Choose an Amazon Machine Image (AMI)
Pick a standard Amazon Linux 2 AMI image. Note: RAMADDA can run on REDHAT Linux but the installer
has not been fully tested.
- Choose an Instance Type
The instance type depends on your expected load. For example
https://ramadda.org runs on a t2.medium but a
t2.micro or t2.small works just fine.
- Configure Instance Details
The defaults may be OK but you may want to create a new network and subnet.
- Add Storage
The instance comes with a smallish volume where /home is mounted.
You should add a new volume.
This is where RAMADDA's home directory, uploaded files and database will be stored. The size depends on the expected size of your RAMADDA use.
For example, for the https://ramadda.org
repository (which has a ton of content) the database size is ~4GB and the files take up ~20GB.
- Configure Security Group
Create a security group with the following ports:
SSH port 22
HTTP port 80 - Source should be the default <IP_ADDRESS>/0, ::/0
HTTPS port 443 - Source should be the default <IP_ADDRESS>/0, ::/0
- Review Instance Launch
Create (or select an existing) key pair file (e.g., ramadda.pem) and download it.
Once downloaded, you will need to change permissions on your pem file, e.g.
chmod 600 ramadda.pem
Create an EC2 Instance
Configure your server
#SSH to the machine
ssh -i <.pem file> ec2-user@
##get the installer
wget -O ramaddainstaller.zip https://ramadda.org/repository/release/latest/ramaddainstaller.zip
#Unpack the installer
unzip ramaddainstaller.zip
#run the installer - make sure to give it the absolute path
sudo sh /home/ec2-user/ramaddainstaller/installer.sh
This will walk you through a number of installation steps to setup the directories, and install and configure Java, Postgres and RAMADDA
To start and stop RAMADDA do:
sudo sh ramaddainstaller/ramaddaserver/ramaddainit.sh stop|start|restart
Command Line Amazon Install
The installer also contains an aws.sh script.n
This script uses the
Amazon Command Line Interface (CLI)
to create and configure an Amazon machine instance running RAMADDA. In just a couple of minutes you can have a server up and running.
Consult the Amazon CLI documentation.
You will need to set up an Amazon AWS account, create and download an access key file, and install the CLI runtime on your machine.
Once you have the CLI installed run the script:
sh aws.sh
You can kill the script at any time and re-run it without messing things up though you might see some warnings along the way.
Right now, the script works best with the default instance type. Different instance types require running in a VPN and this all rather flummoxed the author. More info about instance types


Cool math visualisations you can fool around with. Don't mind the code, it's a mess and I don't care. BTW we're
open source.
(Information is at the bottom, customisations are on the side(s))
Fibonacci Modulus
Golden Ratio
Beautiful Trigonometry
Cellular Automata
Pendulum
Toothpicks
Chaos game
Magic highway


---
title: Instrument Case
year: 2014
description: Restoration of 1970s hard-shell plastic case. Velvet interior.
---
{% include resimg.html src="case/wide.jpg" class="with-viewer" %}
{% include resimg.html src="case/open.jpg" class="with-viewer" %}
{% include resimg.html src="case/couch.jpg" class="with-viewer" %}


Toggle navigation
Menu
NeuroArt
Contact
NeuroArt
Machine Learning for Art
Subscribe to NeuroArt News
*
indicates required
Email Address
*
First Name
Last Name


Transfer queueing
After transfer queueing was introduced, it frequently caused crashes or freezing when working with remote location. This problem was solved by introducing a waiting queue. To be released in Thunar 4.17.4.
-
This patch will not be backported. If you have this problem with Thunar 4.16, it is recommended to set parallel transfer to “Always” to avoid this problem.
-
You might ask about how it was done before. How can a job can be queued when there is no queue? The answer is simple. Since every transfer job runs on a separate thread, it is possible to play a game of musical chairs. Every thread tries to be the only active thread, and if a thread fails to start, it waits until the next opportunity arises. This is easy to implement when parallel transfer is already implemented. But unfortunately, the game did not go well.
WIP: Introduction of an execution safety flag
(I recommend reading Thunar !156 for the context.)
Since the executable bit is not enough to confirm that the file is safe to execute, I am implementing an additional metadata (execution safety flag). Thunar will check this flag even if the execution bit is on, so a user has to confirm that they know that they are launching an executable. This data is contained in GVFS-metadata, and will remember SHA-256 hash value of that file. This will work as a per-file option to allow launching the executable.
I already finished coding a feature to save a hash value per-file and using it to verify executable, and will be added to libxfce4util soon. Interface with this safety flag is still work-in-progress, though.
WIP: MTP freeze
Recently, there are a lot of issue reports about MTP, and most of the complaints are about freeze. A directory under mtp:// that contains a lot of files tends to cause problems. One problem is that icon renderer reads file contents and might clog the main event loop, so I am experimenting with icon rendering right now. Trying to change directory while a directory is loading also freezes the environment, so requesting a file list of the current directory (or cancelling it) might be blocking for some reason.


Welcome to Smartcrypt SDK’s documentation!
¶
Getting Started
Prerequisites
Installation
Logging
Configuring Logging
Common Strategies
Implicit Login
Advantages of Implicit Login
How it works
Smartcrypt Enterprise Manager Configuration
Setting up an Application
Server-owned Smartkeys
Smartkey Strategies
General use
Kinds for security groups
Kinds for key purpose
Format and Length Preserving Encryption
On key rotation
Notifications
Responding to Notifications
Technical details
FAQ
What’s a Smartkey?
Smartkey Kinds and Owners
I’m familiar with using RSA keys; what’s the Smartcrypt equivalent?
What’s the difference between rotatable and non-rotatable Smartkeys?
Why are my Smartkeys not syncing to my client?
Package Integrity
API Docs
Smartcrypt SDK
Navigation
Getting Started
Logging
Implicit Login
Smartcrypt Enterprise Manager Configuration
Smartkey Strategies
Format and Length Preserving Encryption
Notifications
FAQ
Package Integrity
API Docs
Related Topics
Documentation overview
Next:
Getting Started
Quick search


#include "fragments/head_includes.html">
Application
<#include "fragments/title.html">
<#if user_info?? && (user_info?length > 0)>
Hi ${user_info.getUserName()}, you are now logged into your application
Profile information
Email: ${user_info.getEmailAddr() }
Location: ${user_info.getLocation() }
#if>
Change your password
Change your email address
Change your profile information
Delete your account
Logout


Map
News
Blog
Articles and Publications
How To
FAQ
Tutorials
Definitions
About
The Project
Partners
Contact Us
LOG IN
Forgot your password?
Not a member
Global Fishing Watch
Map
News
Blog
Articles and Publications
How To
FAQ
Tutorials
Definitions
About
The Project
Partners
Contact Us
Login
Registration
First name
last name *
Email *
Phone number
Type of organization
Select a question type
Country
Select a country
state/province
Select a state
Zip code
I agree to the Global Fishing Watch
terms of use
and
private policy


Core classes of the JBOSH API.
Users of the client portion of the API should start by reading up on the
BOSHClient
documentation.


The default Active Record class.
Methods
Attributes
| [W] | data |
Public Class methods
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 74 74: def create_table! 75: connection.execute "CREATE TABLE \#{table_name} (\nid INTEGER PRIMARY KEY,\n\#{connection.quote_column_name('session_id')} TEXT UNIQUE,\n\#{connection.quote_column_name(@@data_column_name)} TEXT(255)\n)\n" 76: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 56 56: def data_column_size_limit 57: @data_column_size_limit ||= columns_hash[@@data_column_name].limit 58: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 85 85: def drop_table! 86: connection.execute "DROP TABLE #{table_name}" 87: end
Hook to set up sessid compatibility.
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 61 61: def find_by_session_id(session_id) 62: setup_sessid_compatibility! 63: find_by_session_id(session_id) 64: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 66 66: def marshal(data) 67: ActiveSupport::Base64.encode64(Marshal.dump(data)) if data 68: end
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 70 70: def unmarshal(data) 71: Marshal.load(ActiveSupport::Base64.decode64(data)) if data 72: end
Public Instance methods
Lazy-unmarshal session state.
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 110 110: def data 111: @data ||= self.class.unmarshal(read_attribute(@@data_column_name)) || {} 112: end
Has the session been loaded yet?
[ show source ]
# File vendor/rails/activerecord/lib/active_record/session_store.rb, line 117 117: def loaded? 118: !!@data 119: end


Let's Talk About Open Source and GSoC(Google Summer of code) 2020
Event information
- Community: GDG (Google Developers Group) Cloud Ahmedabad
- Event date: 01 March, 2020
- Event URL: Let's Talk About Open Source and GSoC(Google Summer of code) 2020
This Event is Absolutely for Begineers Who are Intrested in "GCI (Google Code-in)" & "GSoC (Google Summer of Code)". There was Such a Great Line Up of Speakers:
Jay Patel {Crowdsource By Google Influencer, GCI 2019 Mentor for TensorFlow}:- The Session Includes Topic like How to Start with Open Source as a Begineer? How to Contribute Live Open Source Projects? and Much More.
Harsh Shah {Organizer of GDG Cloud Ahmedabad, 2 Times GSoCer}:- Deep Dive into the World Of Open Source & What is GSoC and How you can Apply? and The Session also Includes many Refrence Materials which could Helps Begineer to Start with Open Source and This was Such an Informative Session.
Kartik Derasari {Co-Organizer of GDG Cloud Ahmedabad, ExploreML Facilitator, GCI 2019 Mentor for TensorFlow}:- The Session Includes Very Informative topics like What is Machine Learning? How to Start with it? and Much More


Inspired by twitter.com’s autocomplete search functionality, typeahead.js is a flexible JavaScript library that provides a strong foundation for building robust typeaheads.
The typeahead.js library consists of 2 components: the suggestion engine, Bloodhound, and the UI view, Typeahead. The suggestion engine is responsible for computing suggestions for a given query. The UI view is responsible for rendering suggestions and handling DOM interactions. Both components can be used separately, but when used together, they can provided a rich typeahead experience.
How you acquire typeahead.js is up to you.
Preferred method:
* Install with Bower: $ bower install typeahead.js
Other methods: * Download zipball of latest release. * Download the latest dist files individually: * bloodhound.js (standalone suggestion engine) * typeahead.jquery.js (standalone UI view) * typeahead.bundle.js (bloodhound.js + typeahead.jquery.js) * typeahead.bundle.min.js
Note: both bloodhound.js and typeahead.jquery.js have a dependency on jQuery 1.9+.
For some working examples of typeahead.js, visit the examples page.
NOTE: typeahead.js is not tested on mobile browers.
For general questions about typeahead.js, tweet at @typeahead.
For technical questions, you should post a question on Stack Overflow and tag it with typeahead.js.
Discovered a bug? Please create an issue here on GitHub!
https://github.com/twitter/typeahead.js/issues
For transparency and insight into our release cycle, releases will be numbered with the follow format:
<major>.<minor>.<patch>
And constructed with the following guidelines:
For more information on semantic versioning, please visit http://semver.org/.
Tests are written using Jasmine and ran with Karma. To run
the test suite with PhantomJS, run $ npm test
.
If you plan on contributing to typeahead.js, be sure to read the contributing guidelines. A good starting place for new contributors are issues labeled with entry-level. Entry-level issues tend to require minor changes and provide developers a chance to get more familiar with typeahead.js before taking on more challenging work.
In order to build and test typeahead.js, you’ll need to install its dev
dependencies ($ npm install
) and have grunt-cli
installed ($ npm install -g grunt-cli
). Below is an overview of the available
Grunt tasks that’ll be useful in development.
grunt build
– Builds typeahead.js from source.grunt lint
– Runs source and test files through JSHint.grunt watch
– Rebuilds typeahead.js whenever a source file is modified.grunt server
– Serves files from the root of typeahead.js on localhost:8888.
Useful for using test/playground.html for debugging/testing.grunt dev
– Runs grunt watch
and grunt server
in parallel.Copyright 2013 Twitter, Inc.
Licensed under the MIT License


Code snippet Copy
Fixed top
Dropdown
Dropdown header
Action
Another action
Company
We specialize in blablabla


The Best Chocolate Chip Cookies
Recipe by: Bonnie Owens
RELATED RECIPES
- Amazing Chocolate Chip Cookies!
- Beer and Pretzel Chocolate Chip Cookies
- Bisquick® Chocolate Chip Cookies
- Browned Butter and Coconut Chocolate Chip Cookies
- Buttery Chocolate Chip Cookies
- Cherry Chocolate Chip Cookies
PREP TIME:
45 Min
TOTAL TIME:
45 Min
SERVINGS:
A LOT
INGREDIENTS
- 1 and 1/2 cups (3 sticks) butter, softened
- 1 cup brown sugar
- 1 cup granulated sugar
- 1 Tbl vanilla instant pudding powder
- 2 Tbl milk
- 2 Tbl vanilla extract
- 2 eggs
- 4 cups all-purpose flour
- 2 tsp baking soda
- 1/2 tsp salt
- 4 cups chocolate chips
How to Make Mama’s Recipe: The Best Chocolate Chip Cookies
- Preheat oven to 350 degrees
- Beat butter, granulated sugar, and brown sugar together until light and fluffy
- Stir in pudding powder, milk, and vanilla extract.
- Beat in eggs.
- Add remaining dry ingredients (flour, salt, baking soda) and stir until combined.
- Stir in chocolate chips.

- Bake 8-10 minutes, or until golden brown.
EXPERT TIPS
- Use an ice-cream scoop to make perfectly shaped cookies. Level off the dough on the edge of the bowl for perfectly round cookies.
- If you didn't think these cookies could get any better, think again! Get creative use with 1/2 cup each of semisweet chocolate chips, peanut butter chips or butterscotch chips instead of the 2 cups semisweet chocolate chips. OMG these are good!


Contents
Articles
Recommended: Steve Yegge – Get That Job at Google [web]
- Carlos Bueno – Get That Job at Facebook [web]
- Daniel Blumenthal – How to Prepare for Technical Interviews [web]
- David Byttow – ABC: Always Be Coding [web]
- David Byttow – Four Steps to Google, Without a Degree [web]
- Thomas L. Friedman – How to Get a Job at Google [part 1] [part 2]
- Andrew Rothbart – Preparing for a technical interview with programming contests [web]
- Steve Yegge – Ten Tips for a (Slightly) Less Awful Resume [web]
Algorithms
Recommended: Steven Skiena – The Algorithm Design Manual [Amazon] [pdf] [web]
- Jon Bentley – Programming Pearls [Amazon] [web (full text)]
- Cormen, Leiserson, Rivest, Stein – Introduction to Algorithms [Amazon] [pdf]
- more – Free Programming Books (giant collection) [GitHub]
- more – IT eBooks [web]
- more – Free Programming Books [web]
Please support the authors by buying the books.
Coding
- Coderust (great selection of problems) [$10 app]
- Hacker Rank [web]
- Interview Cake [web]
- HackerEarth [web]
- HiredInTech [web]
- Project Euler [web]
- Google Code Jam practice problems [web]
- Top Coder tutorials [web]
- Infoarena training path (RO) [web]
- LeetCode Online Judge [web]
- more – Free Programming Resources [web]
- more - Web Resources and Tutorials That Don’t Suck [web]
Guides
Recommended (resume): Gayle McDowell – The Google Resume [Amazon] [pdf]
Recommended (interview): Gayle McDowell – Cracking the Coding Interview [Amazon] [pdf]
- CareerCup [web]
- Coding for Interviews [web]
- Here’s How to Prepare for Tech Interviews [reddit]
- Programming Interviews Exposed [Amazon] [pdf]
- Elements of Programming Interviews [Amazon] [web]
- Mina Azib – Resources for Preparing for the Google Interview [web]
Quora:
Language-specific
JavaScript
Python
Maths
Recommended: MIT - Mathematics for Computer Science [Youtube] [web]
- Graham, Knuth, Patashnik – Concrete Mathematics: A Foundation for Computer Science [Amazon] [pdf]
Misc
- Aaron Swartz – How I Hire Programmers [web]
- Joel Spolsky – The Guerrilla Guide to Interviewing (v.3) [web]
- Steve Yegge – Done, and Gets Things Smart [web]
Quora
Questions
Recommended: MIT – Hacking a Google Interview [web]
- Computer Science Primer / Interview Questions [web]
- Programming Interview Questions [web]
- Prismo-Skills [web]
- Jeff Atwood – How Good an Estimator Are You? [web]
- Daniel Blumenthal – Questions I Want to Ask, but Can’t [web]
- Steve Yegge – The Five Essential Phone-Screen Questions [web]
Systems Design
Quora
Unix
Quora
Videos
Recommended: Candidate Coaching Session: Tech Interviewing [Youtube]
- Gayle McDowell – Cracking the Coding Interview [Youtube]
- Gayle McDowell - Cracking the Coding Interview (examples) [one] [two]
- Hangouts on Air: Google Recruiters Share Interview Tips [technical] [non-technical]
- Ladies Storm Hackathons: Interview Prep Round 1: Strings, Arrays, Linked Lists [technical]
Similar GitHub repos


An advanced property access, managment and notification system.
This system provides some helpful additions to the standard Java
property system. Some of these features include:
- Events
- Convenience Grouping
- Array Properties
Aims to provide a JavaBeans style api for accessing properties
in a simple, powerful and consistent fashion.
Package Specification
Related Documentation
Package Status
Todo
- Re-design storeage of properties; making them more tree-like
- Re-design property binding events; probably force use of a
PropertyContainer sub-class or another JavaBeans like
object
- Move back to planet57.core?
- Allow reading properties from a URL
- Read properties correctly with win32 or unix style pathing
- Create a property parser framework
- Add an XML property parser
- Add property map support and general configuration objects access.
This will allow property.foo to be mapped to com.whatever.class.
- Allow configuration objects to take more than one property group name,
using the order for precidence.


Copyright 2013 Jake Wharton Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Google Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2008-2014 Google Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright (c) 2009, 2010, 2011, 2012, 2013 Jonathan Hedley<EMAIL_ADDRESS>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Copyright (C) 2010-2014 The Libphonenumber Authors Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright (c) 2013, PayPal All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.   The views and conclusions contained in the software and documentation are those of the authors and should not be interpreted as representing official policies, either expressed or implied, of the FreeBSD Project.
Copyright 2013 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2014 Antoine Merle Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2013 Jake Wharton Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
The adjust SDK is licensed under the MIT License. Copyright (c) 2012-2013 adjust GmbH, https://www.adjust.com Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
The MIT License (MIT) Copyright (c) 2014 Jonathan Baker Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Copyright (c) 2009-2014 Braintree, a division of PayPal, Inc. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Copyright 2013 Christopher Jenkins Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Copyright 2015 Square, Inc. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.


{% extends 'base.html' %} {% load static %} {% block css %} {% endblock %} {% block main %}
For the sake of simplicity, customization is left to user as an exercise.


Why do people care about "Quantum Machine Learning", or "Quantum Computing" in general? A common observation that motivates quantum computing, although it does not tell the whole story, is the striking fact than quantum information of a quantum system is in a sense larger than the classical information of a comparable classical system. In the case of bits and qubits, \( n \) classical bits allows you to store the value of \( n \) boolean variables \( a \in [0,1] \), whereas you need \( 2^n \) amplitudes \( \alpha \in \mathbb{C} \) to describe the state of \( n \) quantum bits, or qubits. In other words, the (Hilbert )space in which the qubits live in exponentially bigger than that of the classical counterpart. In the context of parameterized quantum circuits, one may prepare a state in the exponentially large Hilbert space by applying some simple quantum operations to a set qubits that are all initialized in the zero-state.
By varying \( \theta_i \in [0, 2\pi] \), one can attain different states. A crucial thing to note is that we are not able to prepare an arbitrary state using this ansatz as it much too constrained and simple: The exponentially large space is not available to us. One might try to remedy this by introducing a more complex ansatz:
We now have an ansatz whose number of operations scales polynomially in the number of qubits(in this case quadratic), and the added complexity enables us to reach a greater part of Hilbert space. Still, it is only a polynomially large part of it, which is vanishingly small compared to its full size. To have access to the whole space, one would in fact need to perform exponentially many operations, which is practically intractable to do (Nielsen, 4.5.4).
Does this mean that the supposed power of quantum computation is practically inaccessible to us? No. Even though we only reach a very small part of Hilbert space using "cheap" ansatzes, the states we do reach might be very useful for solving a particular problem. Moreover, these states might be classically intractable to compute (source to come), meaning the information they represent is not practical to determine using classical computers. They are however efficiently prepared using quantum computers, as the number of quantum operations needed to be applied is by construction only polynomial.
How can one leverage this in a machine learning setting? A common approach is to use variants of the previous ansatzes to encode features to qubits by performing rotations, thus embedding the data in a high dimensional quantum state. Subsequent parameterized operations on the qubits then applies powerful transformations to the embedded data in a high dimensional space. Such methods are often described as quantum kernel methods, because of their similarity to classical kernel methods in machine learning.
For this project, you will perform quantum machine learning on the two first targets of Scikit learn iris data set. The data can be obtained the following way
from sklearn import datasets
import numpy as np
iris = datasets.load_iris()
x = iris.data
y = iris.target
idx = np.where(y < 2) # we only take the first two targets.
x = x[idx,:]
y = y[idx]
\( x \) is the feature matrix and \( y \) are the targets.
For this task you will consider a simple way of encoding a randomly generated data set sample into a quantum state:
import qiskit as qk
import numpy as np
np.random.seed(42)
p = 2 #number of features
data_register = qk.QuantumRegister(p)
classical_register = qk.ClassicalRegister(1)
circuit = qk.QuantumCircuit(data_register, classical_register)
sample = np.random.uniform(size=p)
target = np.random.uniform(size=1)
for feature_idx in range(p):
circuit.h(data_register[feature_idx])
circuit.rz(2*np.pi*sample[feature_idx],data_register[feature_idx])
print(circuit)
The above code shows how a randomly generated data sample of \( p=2 \) features are encoded into a quantum state on two qubits utilizing Qiskit. Each feature is encoded into a respective qubit utilizing a \( R_y(\theta) \) gate. The features are scaled with \( 2\pi \) to represent rotation angles (the \( R_y(\theta) \) gate performs a rotation). The classical register will be used later for storing the measured value of the circuit. print(circuit) can be utilized at any point to see what the circuit looks like.
Your task is to get familiar with the functionality utilized in the above example and implement your own function to encode the features of the iris data set to a quantum state.
After the quantum state has been encoded with the information of a data set sample, one needs extend the circuit with operations that process the state in a way that allows us to infer the target data. This can be done by introducing quantum gates that are dependant on learnable parameters \( \boldsymbol{\theta} \). We will do this in a similar fashion as for the encoding of the features:
n_params = 4
theta = 2*np.pi*np.random.uniform(size=n_params)
circuit.ry(theta[0], data_register[0])
circuit.ry(theta[1], data_register[1])
circuit.cx(data_register[0], data_register[1])
circuit.ry(theta[2], data_register[0])
circuit.ry(theta[3], data_register[1])
circuit.cx(data_register[0], data_register[1])
print(circuit)
The above parameterization of the quantum state is what we will refer to as the 'ansatz'. Your task is again to familiarize yourself with the functionality utilized in the above example and implement your own ansatz to be utilized together with the features of the iris data set. The number of learnable parameters 'theta' should be arbitrary.
The next step is to generate a prediction from our quantum machine learning model. This is done by performing a measurement on the quantum state:
circuit.measure(data_register[-1],classical_register[0])
shots=1000
job = qk.execute(circuit,
backend=qk.Aer.get_backend('qasm_simulator'),
shots=shots,
seed_simulator=42
)
results = job.result()
results = results.get_counts(circuit)
prediction = 0
for key,value in results.items():
if key == '1':
prediction += value
prediction/=shots
print('Prediction:',prediction,'Target:',target[0])
Prediction: 0.285 Target: 0.7319939418114051
In the above example, we are first applying a measurement operation on the final qubit in the circuit, and we are interpreting our prediction as the probability that this qubit is in the \( \ket{1} \) state. Make sure all the steps in the example are understood.
Implement your own function that generates a prediction by measuring one of the qubits.
Now it is time to put together all of the above steps. Ideally, you should make a class or a function that given a feature matrix of \( n \) samples and an arbitrary number of model parameters, returns a vector of \( n \) outputs. For example:
n = 100 #number of samples
p = 4 #number of features
theta = np.random.uniform(size=20) #array of model parameters
X = np.random.uniform(size=(n,p)) #design matrix
y_pred = model(X,theta) #prediction, shape (n)
We will now deal with how to train the model:
Since the model with random initial parameters is no good for inference, we need to optimize the parameters in order to yield good results, as is the usual with machine learning.
Since we are dealing with classification, we will use cross-entropy as the loss function $$ \begin{equation*} L = -\sum_{i=1}^{n}{y_i \ln{f(x_i;\boldsymbol{\theta})}}, \end{equation*} $$
where \( y_i \) are the target labels, and \( f(\boldsymbol{x}_i;\boldsymbol{\theta}) \) is the output of our model for a given sample \( \boldsymbol{x}_i \) and parameterization \( \boldsymbol{\theta}) \). We calculate the gradiant by taking the derivative of the loss with respect to the parameters $$ \begin{equation*} \frac{\partial}{\partial \boldsymbol{\theta}_k}L = \sum_{i=1}^{n}{\frac{f_i - y_i}{f_i(1 - f_i)}} \frac{\partial}{\partial \boldsymbol{\theta}_k}f_i, \end{equation*} $$
where \( f_i = f(x_i;\boldsymbol{\theta}) \) for clarity. The only term we do not know how to calculate is \( \frac{\partial}{\partial \boldsymbol{\theta}_k}f(x_i;\boldsymbol{\theta}) \), but it turns out there is a simple trick to do this, the so-called parameter shift-rule \[1]. To calculate the derivative of the model output, we need to evaluate the model twice with the respective parameter shifted by a value \( \frac{\pi}{2} \) up and down. The two resulting outputs are then put together to yield the derivative $$ \begin{equation*} \frac{\partial f(x_i; \theta_1, \theta_2, \dots, \theta_k)}{\partial \theta_j} = \frac{f(x_i; \theta_1, \theta_2, \dots, \theta_j + \pi /2, \dots, \theta_k) -f(x_i; \theta_1, \theta_2, \dots, \theta_j - \pi /2, \dots, \theta_k)}{2} \end{equation*} $$
Train your model by utilizing the Parameter Shift-Rule and some gradient descent algorithm. Compare your results with for example logistic regression.
Regular gradient descent does the job, but it is often outperformed by momentum based optimizers like Adam.
from sklearn.datasets import load_breast_cancer
data = load_breast_cancer()
x = data.data #features
y = data.target #targets
Here follows a brief recipe and recommendation on how to write a report for each project.
The preferred format for the report is a PDF file. You can also use DOC or postscript formats or as an ipython notebook file. As programming language we prefer that you choose between C/C++, Fortran2008 or Python. The following prescription should be followed when preparing the report:


In pictures: Charley Webb and Jamie Lomas 18 Nov 2019, 14:27 by Kayla Walsh LONDON, ENGLAND - JANUARY 22: Charley Webb attends the National Television Awards held at The O2 Arena on January 22, 2019 in London, England. (Photo by David M. Benett/Dave Benett/Getty Images) Red carpet launch of Elf the Musical at The Lowry theatre. Charley Webb and Matthew Wolfenden(Image: Manchester Evening News) Jamie Lomas (Image: @jamielomas1 /Twitter) Jamie and Billy(Image: Instagram)


Meet the Team!
We are the people that made this whole thing possible!
{% extends 'base.html' %} {% load socialaccount %} {% providers_media_js %} {% block title %}LinkUp - Make Your Meeting{% endblock title %} //modifying the title {% block nav-style %} {% endblock nav-style %} {% block content %}
We are the people that made this whole thing possible!
We are a group of students from University of California San Diego (UCSD) that got together in CSE 110. We founded the idea from the struggles we had organizing a meeting time with a large group of ten members. We created LinkUp as a way to ease the creation of meetings with even the busiest of schedules.


Installing from Sources¶
Download and Setup¶
You can download PaddlePaddle from the github source.
git clone https://github.com/baidu/Paddle paddle
cd paddle
Requirements¶
To compile the source code, your computer must be equipped with GCC >=4.6 or Clang compiler.
Dependencies¶
- CMake: version >= 2.8
- BLAS: MKL, OpenBlas or ATLAS
- protobuf: version >= 2.4, Note: 3.x is not supported
- python: only python 2.7 is supported currently
Options¶
PaddlePaddle supports some build options. To enable it, first you need to install the related libraries.
| Optional | Description |
|---|---|
| WITH_GPU | Compile with GPU mode. |
| WITH_DOUBLE | Compile with double precision floating-point, default: single precision. |
| WITH_GLOG | Compile with glog. If not found, default: an internal log implementation. |
| WITH_GFLAGS | Compile with gflags. If not found, default: an internal flag implementation. |
| WITH_TESTING | Compile with gtest for PaddlePaddle's unit testing. |
| WITH_DOC | Compile to generate PaddlePaddle's docs, default: disabled (OFF). |
| WITH_SWIG_PY | Compile with python predict API, default: disabled (OFF). |
| WITH_STYLE_CHECK | Compile with code style check, default: enabled (ON). |
Note:
- The GPU version works best with Cuda Toolkit 7.5 and cuDNN v5.
- Other versions like Cuda Toolkit 6.5, 7.0, 8.0 and cuDNN v2, v3, v4 are also supported.
- To utilize cuDNN v5, Cuda Toolkit 7.5 is prerequisite and vice versa.
As a simple example, consider the following:
Python Dependencies(optional)
To compile PaddlePaddle with python predict API, make sure swig installed and set
-DWITH_SWIG_PY=ON
as follows:# install swig on ubuntu sudo apt-get install swig # install swig on Mac OS X brew install swig # active swig in cmake cmake .. -DWITH_SWIG_PY=ON
Doc Dependencies(optional)
To generate PaddlePaddle’s documentation, install dependencies and set
-DWITH_DOC=ON
as follows:pip install 'sphinx>=1.4.0' pip install sphinx_rtd_theme breathe recommonmark # install doxygen on Ubuntu sudo apt-get install doxygen # install doxygen on Mac OS X brew install doxygen # active docs in cmake cmake .. -DWITH_DOC=ON`
Build on Ubuntu 14.04¶
Install Dependencies¶
CPU Dependencies
# necessary sudo apt-get update sudo apt-get install -y g++ make cmake build-essential libatlas-base-dev python python-pip libpython-dev m4 libprotobuf-dev protobuf-compiler python-protobuf python-numpy git # optional sudo apt-get install libgoogle-glog-dev sudo apt-get install libgflags-dev sudo apt-get install libgtest-dev sudo pip install wheel pushd /usr/src/gtest cmake . make sudo cp *.a /usr/lib popd
GPU Dependencies (optional)
To build GPU version, you will need the following installed:
1. a CUDA-capable GPU 2. A supported version of Linux with a gcc compiler and toolchain 3. NVIDIA CUDA Toolkit (available at http://developer.nvidia.com/cuda-downloads) 4. NVIDIA cuDNN Library (availabel at https://developer.nvidia.com/cudnn)
The CUDA development environment relies on tight integration with the host development environment, including the host compiler and C runtime libraries, and is therefore only supported on distribution versions that have been qualified for this CUDA Toolkit release.
After downloading cuDNN library, issue the following commands:
sudo tar -xzf cudnn-7.5-linux-x64-v5.1.tgz -C /usr/local sudo chmod a+r /usr/local/cuda/include/cudnn.h /usr/local/cuda/lib64/libcudnn*
Then you need to set LD_LIBRARY_PATH, PATH environment variables in ~/.bashrc.
export LD_LIBRARY_PATH=/usr/local/cuda/lib64:$LD_LIBRARY_PATH export PATH=/usr/local/cuda/bin:$PATH
Build and Install¶
As usual, the best option is to create build folder under paddle project directory.
mkdir build && cd build
cmake ..
CMake first check PaddlePaddle’s dependencies in system default path. After installing some optional libraries, corresponding build option will be set automatically (for instance, glog, gtest and gflags). If still not found, you can manually set it based on CMake error information from your screen.
As a simple example, consider the following:
Only CPU
cmake .. -DWITH_GPU=OFF
GPU
cmake .. -DWITH_GPU=ON
GPU with doc and swig
cmake .. -DWITH_GPU=ON -DWITH_DOC=ON -DWITH_SWIG_PY=ON
Finally, you can build PaddlePaddle:
# you can add build option here, such as:
cmake .. -DWITH_GPU=ON -DCMAKE_INSTALL_PREFIX=<path to install>
# please use sudo make install, if you want to install PaddlePaddle into the system
make -j `nproc` && make install
# set PaddlePaddle installation path in ~/.bashrc
export PATH=<path to install>/bin:$PATH
Note:
If you set WITH_SWIG_PY=ON
, related python dependencies also need to be installed.
Otherwise, PaddlePaddle will automatically install python dependencies
at first time when user run paddle commands, such as paddle version
, paddle train
.
It may require sudo privileges:
# you can run
sudo pip install <path to install>/opt/paddle/share/wheels/*.whl
# or just run
sudo paddle version


apamax.eplapplications.eplapps¶
EPLApps¶
-
class
apamax.eplapplications.eplapps.
EPLApps
(connection)[source]¶ Bases:
object
Class for interacting with Apama EPL Apps in Cumulocity
- Parameters
connection – A C8yConnection object for the connection to the platform.
-
delete
(name: str)[source]¶ Deletes an EPL app in Cumulocity.
- Parameters
name – The name of the EPL app to be deleted.
-
deploy
(file, name='', description=None, inactive=False, redeploy=False)[source]¶ Deploys a local mon file to Apama EPL Apps in Cumulocity.
- Parameters
file – Path to local mon file to be deployed as an EPL app
name – Name of the EPL app to be uploaded (optional). By default this will be the name of the mon file being uploaded.
description – Description of the EPL app (optional)
inactive – Boolean of whether the app should be ‘active’ (inactive=False) or ‘inactive’ (inactive=True) when it is deployed.
redeploy – Boolean of whether we are overwriting an existing EPL app.
-
getAppId
(appName: str, jsonEPLAppsList=None)[source]¶ Gets the id of EPL app for a given EPL app name. If no EPL app with appname exists, an exception is raised.
- Parameters
appName – The name of the EPL app we wish to get the id of
jsonEPLAppsList – A json collection of EPL apps
- Returns
The id of the EPL app
-
getEPLApps
(includeContents=False)[source]¶ - Parameters
includeContents – Fetches the EPL files with their contents if True. This is an optional query parameter.
- Returns
A json object of all the user’s EPL apps in Cumulocity
-
update
(name, new_name=None, file=None, description=None, state=None)[source]¶ Updates an EPL app in Cumulocity.
- Parameters
name – name of the EPL App to be updated.
new_name – the updated name of the EPL app (optional)
file – path to the local mon file containing the updated contents of the EPL app (optional)
description – the updated description of the EPL app (optional)
state – the updated state of the EPL app (optional)


{% load staticfiles %}
Here we have a fantasy football style league but instead of player you earn points based on hte refs and penalties given


The coreplus Brand Assets Guide are the combination of the visual elements and tone of voice that we practice to create engaging end to end user experiences, campaigns and build our media presence. This guide includes Tone of Voice, Logo, Symbology, Color Palettes, Typography, Illustration Library, Motion, Grid System, Photography, Best Practices.
Each element of the our vision is tied back into the core message of ‘Practice Happy’, to align aspects of the brand and evoke emotion.
The logo is a composite of an origami-styled multicolored triangular symbol and the words “core” and “plus” concatenated into one word “coreplus” with the tagline “practice happy”.
The origami pyramid as a symbol demonstrates the possibilities of our product.
The colors distinguishes our brand as well as helps us diversify and showcase consistency across the “plus” elements of our product.
The typography reflects the sentiments of boldness, uniqueness and clarity for our audience.
The illustrations convey the context and emotions of our users.
The grid system is a way to structure and present content and imagery in a much more readable, manageable way on screen.
Use these principals when creating compositions for our communication platforms.


S-Rank calculator for CoC Dungeon - Legend Average Combos: Turns: Total Rarity: 25 (Average Rarity: 4.2) Rank: Total Score:


{% extends "base.html" %} {% block title %}Contact | ImageDataExtractor{% endblock %} {% block content %}
Got a bug report or feature request? Leave a message on the Issue Tracker.


{%extends "confreg/confadmin_base.html" %} {%load pgmarkdown%} {%block title%}Conference Sponsorship - {{sponsor}}{%endblock%} {%block extrahead%} {%endblock%} {%block layoutblock%}
There are no claimed benefits for this sponsor.
{%endif%}There are no unclaimed benefits for this sponsor.
{%endif%} {%if noclaimbenefits%}The following benefits have been auto-claimed for this sponsor:
This sponsorship is awaiting an invoice to be paid.
{%if not sponsor.level.instantbuy%} {%comment%}Instant buy sponsorships should never be manually confirmed{%endcomment%}Iff there is a signed and countersigned contract available for this sponsor, it can be confirmed before the invoice is paid.
{%endif%} {%else%} {%comment%}Sponsor has no invoice{%endcomment%} {%if sponsor.level.levelcost %} {%if sponsor.level.instantbuy%}
This sponsorship has not yet been issued an invoice. This is an "instant buy" level sponsorship, so as soon as the sponsorship details above have been verified, an invoice should be generated.
Once generated, the invoice will automatically be emailed to the sponsor, as well as show up on their dashboard. Once the invoice is paid, the sponsorship will automatically become confirmed.
{%else%}{%comment%}no invoice, not instant, so awaiting contract{%endcomment%} {%if sponsor.signmethod == 0%}This sponsor is using digital contracts. {%if sponsor.contract and sponsor.contract.completed%} The contract signing process has completed. The invoice has to be manually generated as automatic processing is not enabled. {%elif sponsor.contract%} The contract has been sent to the sponsor, but the signing process has not completed yet. {%else%} The contract has not (yet) been issued to the sponsor. {%endif%}
{%else%}{%comment%}Manual (below)/digital (above) contracts{%endcomment%}This sponsorship has not yet been issued an invoice. Once the contract has been received, go ahead and generate the invoice.
{%endif%}{%comment%}Digital contracts{%endcomment%} {%endif%}{%comment%}Instant buy{%endcomment%} {%else%}{%comment%}levelcost != 0 {%endcomment%}This sponsorship has zero cost, which means payment is handled manually. Once this is done, go ahead and click through the confirmation.
{%endif%}{%comment%}levelcost{%endcomment%} {%if sponsor.level.maxnumber > 0%}sponsor.level.maxnumber%} style="color:red;"{%endif%}> This level allows a maximum of {{sponsor.level.maxnumber}} sponsors. There are currently {{sponsor.level.num_confirmed}} confirmed and {{sponsor.level.num_unconfirmed}} unconfirmed sponsors signed up at this level, make sure you don't approve too many!
{%endif%}


HTML cannot be learned in a vacuum. It is very project-based, so there are a number of various modules that can be plugged in to a live-preview online HTML/CSS editor. The various modules will be used in different stages, with each stage increasing the amount of involvement and body of knowledge required. The following modules are discovery-based, with no formal instruction. Instead, the student is to allow their curiosity to guide them through modifying parts of the HTML and CSS. In tinkering, they should be able to intuit information about HTML and CSS.
The first stage of learning is Meme Maker. Here the student is expected to modify the text content within existing tags as well as modifying the attributes of different tags. This is because the student will edit the meme top and bottom texts, as well as potentially changing the img source to another meme template. The goal for this module is to get the student used to the editing environment, and to pique their interest in HTML and CSS.
The next step is Webcomic Creator. Here the student is to actually use div, p, and various styling elements in order to practice using HTML. They do this by adding new panel divs to the comic in order to make their own comic. They can use the styling elements to create more stylistically varied dialogue for their comic. Another goal for this module is for the student to have something tangible that student can be proud of and show off.
The next step is Blog Publisher. This is for the student to learn more about text display elements like ol, ul, tables, etc. Another goal for this module is for the student to learn tangible, more modern skills that they can take with them.
In the future, I would like to create another module that utitilizes JavaScript in order to provide interactivity to the activity. To learn JavaScript just through discovery-based learning would be difficult though, and thus may be out of the scope or the niche of this project.


by Curtis Edmonds --<EMAIL_ADDRESS>One of my favorite television shows ever was a Discovery Channel documentary on squirrels. The show was investigating different contraptions designed to keep squirrels away from bird feeders. The plucky squirrels were so successful (after a couple of dozen hilarious attempts) at defeating the stratagems placed against them that the producers finally created the world's first Squirrel Obstacle Course. The heroic squirrel had to make impossible leaps, walk a tightrope, climb a ladder, and even (I think) pedal a little squirrel bicycle, all to get to the seeds in the bird feeder. A true representation of the triumph of the squirrel spirit.
Primary Colors isn't anywhere near as good as the squirrel show, but the theme is the same, nonetheless. John Travolta plays... um... an empathetic baby-boomer Southern Governor with gray hair and a high, yet hoarse voice. The movie is about Governor "Jack Stanton", his 1992 race for the Presidency, and the various obstacles along his path to the White House. Like our friend the squirrel, Stanton has to persevere through all sorts of odd situations. We see Stanton soliciting votes on a New Hampshire streetcorner in the driving rain as if he were homeless and looking for handouts. We see him wearing a yarmulke and chatting up Florida retirees about Medicare and Israel, and dealing with lesbian hecklers in New York City. We see him selling satellite technology to the Chinese... wait, that's for the sequel.
We see a lot of the sheer physical effort it takes to survive a Presidential campaign in Primary Colors, but the movie is mostly about the moral effort expended. Primary Colors raises deep moral questions in the pragmatic context of politics: When is it appropriate to run negative ads? How do you ask the candidate's wife if he's been sleeping around behind her back? If it's moral to research your opponent, is it moral to use that research against him? The mantra you hear in election season is that campaigns should be about "the issues." To its credit, Primary Colors is about moral issues and the buffeting those issues receive on the campaign trail.
It's also about politics. Political junkies will find much to carp about in the presentation of politics in the movie -- you never, ever, not even once hear any reference to fundraising, which is unthinkable in a novel about campaigning -- however, director Mike Nichols manages to capture much of the energy, nerves, and confusion that surround a political campaign. The set design, from the motel rooms to the storefront headquarters is authentic in its shabbiness. The casting is phenomenal. The large roles are famously well-cast (especially Billy Bob Thornton as James Carville), but the smaller roles are filled imaginatively: Rob Reiner as a schmaltzy Miami talk-show host, Larry Hagman as a ghostly Presidential contender, former Dukes of Hazzard actor-turned-Congressman Ben Jones as a media advisor.
The script follows the famous novel closely -- perhaps too closely -- and although the twists in the storyline are awkward, they parallel the awkwardness of the 1992 campaign. I was, for a while, incredibly distracted by the comings and goings of the assorted staff members, the subplots that sputtered and went nowhere, until I realized that campaigning is distracting in just that way, and that real-life subplots don't always play out.
However, Primary Colors qualifies as a disappointment because what we see on the movie screen is so at odds with what we know of real life. Part of this is due to the unhealthy, interest we show in our leading politicians. Travolta plays a character based on a man whose private life over the last six years has been scrutinized to an extent surpassed only by the fictional protagonist of The Truman Show. As a result, we all think we know the President, and although Travolta does a fine job of impersonation, he doesn't measure up. Primary Colors gives us nothing more than a superficial caricature of the real candidate. His worst enemies will concede that Bill Clinton is a thoughtful and intelligent man, well-versed in public policy. Travolta's character has no grasp of public policy other than a desire to do big things, very little personal warmth or charisma, and seemingly compulsive eating habits. The vague, buffoonish and broad characterization of the Clinton character strikes me as more than a little unfair -- and this is coming from a reviewer who is a confirmed right-winger, mind you.
In the same vein, Billy Bob Thornton may be perfectly cast as James Carville, but he is wretchedly underused and cheaply stereotyped as an ignorant redneck, no smarter than the role he played in The Apostle. Adrian Lester has a smarter role as the narrator/campaign manager, but he's saddled with a naive idealism worthy of the misfit volunteers who people the storefront offices and make copies. Only Maura Tierney, in a too-brief role as media spokesman, has the appropriate level of intelligence and cynicism you'd expect from a veteran political operative.
Paradoxically, both the least and most most crudely drawn performances in Primary Colors are the best. Emma Thompson sheds her English accent to play Travolta's long-suffering wife. She manages to wrench a profound and moving performance from the lines she's given, playing a character with the intelligence, sensitivity and guts to deal with the stress of the campaign and her husband's cheating heart. Kathy Bates, as a political troubleshooter -- or "Dustbuster", as she terms herself -- is the most broadly overdrawn character in a movie full of overdrawn characters. She acts like a cartoon character throughout the movie, screaming and brandishing guns, she redeems that performance with a touching and pivotal role in the movie's climax.
But placing these performances aside, the heart of Primary Colors is Travolta's Clinton. With the tragic death of Phil Hartman, Travolta may be the best Clinton impersonator out there today. It's unfortunate that Travolta's performance in this movie is more "Saturday Night Live" than "Saturday Night Fever". Primary Colors is a dishonest look at a frequently dishonest political culture, and a misuse of quality actors and moviemakers. Nevertheless, there are enough positive things about the movie to make a trip to the video store worthwhile -- unless, of course, the Discovery Channel runs that squirrel documentary again.
Rating: B
-- Curtis Edmonds<EMAIL_ADDRESS>Movie Reviews: http://us.imdb.com/M/reviews_by?Curtis+Edmonds
Hollywood Stock Exchange: http://www.hsbr.org/brokers/blueduck/
"Are you kidding? No jury in the world would convict a baby for murder. Well, maybe Texas."
-- Chief Clancy Wiggum
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Privacy Policy
Protecting Your Privacy
At Altoro Mutual, we maintain physical, electronic and procedural safeguards to protect your nonpublic personal information – take a look:
Collection of Information
We collect nonpublic personal information about you from the following sources:
- From you, on forms, via the Internet, by telephone or otherwise. Examples of this type of information include your name, address, Social Security number, credit history and other financial information.
- From transactions with us, our affiliates or with others. For example, your payment histories, account balances, and other transaction records.
- From credit reporting agencies, such as information relating to your creditworthiness, your credit score and credit usage.
- From third parties to verify information you have given us.
Safeguarding Customer Information
We only grant access to nonpublic personal information about you (such as your name, address, and credit history) to company employees and affiliated and nonaffiliated service providers so that they can provide or offer products and services to you, process and service your accounts, and administer our business.
Our Code of Conduct requires that your information remain confidential. Even if you are no longer our customer, we will continue to treat your nonpublic personal information in the same way as if you were still a customer. In addition, we maintain physical, electronic and procedural safeguards that comply with federal standards to guard this personal information. Some state laws may further restrict the sharing of your nonpublic personal information.
Collection of Information
We collect nonpublic personal information about you from the following sources:
- From you, on forms, via the Internet, by telephone or otherwise. Examples of this type of information include your name, address, Social Security number, credit history and other financial information.
- From transactions with us, our affiliates or with others. For example, your payment histories, account balances, and other transaction records.
- From credit reporting agencies, such as information relating to your creditworthiness, your credit score and credit usage.
- From third parties to verify information you have given us.
Uses of Shared Information
We may share all the information that we collect, as described above, for the following purposes:
- To provide you with the products and services you requested.
- To offer you additional products and services, from us or from others, that may be of interest to you.
- To comply with reporting and other legal requirements.
- To otherwise conduct business.
Information Sharing Among Our Family of Affiliated Companies
Altoro, Inc. is the holding company for a group of companies which includes financial services providers such as depository institutions, insurance agencies, mortgage companies, consumer finance companies and securities broker-dealers. Any company that is owned or controlled by Altoro, Inc. is an "affiliate" or an "affiliated company" of all of the other companies owned by Altoro, Inc.
Under the Federal Fair Credit Reporting Act, we are permitted to share your name, address and facts about your transactions and experience with us (such as your payment history and other transactions on your accounts with us) among our affiliated companies. That information is referred to in this Privacy Policy as "transaction information."
Unless you request otherwise, we also share all of the other information we collect among our affiliated companies. This information - that is, information other than transaction and experience information - is referred to in this Privacy Policy as "other information."
You have the right to ensure that other information is not shared among our affiliates. If you prefer that we not share other information among our affiliates, you may opt out.
Guarding Your Own Privacy
Altoro Mutual recommends that you take the following precautions to guard against the disclosure and unauthorized use of your account and personal information:
- Review your monthly account statements thoroughly and report any suspicious activity to us.
- Report lost or stolen checks, credit or debit cards immediately.
- Never provide personal information over the phone unless you have initiated the call and know with whom you are speaking.
- Do not preprint your driver’s license or Social Security number on checks.
- Safeguard ATM, credit and debit cards. Memorize PINs (personal identification numbers) and refrain from writing PINs, Social Security numbers or credit card numbers where they could be found.
- Store cancelled checks, new checks and account statements in a safe place.
- Tear up or shred any pre-approved credit offers to which you do not respond.
- Review your credit report at least once every year. Make sure all information is up to date and accurate, and have information relating to fraudulent transactions deleted.
- If you think you have been a victim of identity theft or fraud, contact one of the three major credit bureaus to place a fraud alert on your account.


You must have noticed, in the previous exercise, that the articles received via the window.lib.getPosts function included a property id.
The window.lib.getComments () function is available in the script. It should be given an item id as the first parameter, so as a second parameter callback. After a short delay, the callback will be executed with two parameters: the first contains an error (if there is any one, otherwise null ), the second an array of article comments.
When you click on the button, calls the getPosts function. For each item retrieved, calls the getComments function and adds the comments obtained in a comments property of the article. Display articles in the console (the getPosts and getComments functions never return error).