Data Analytics Cohort 4 recognizes that our learning experience was made possible by
the perspectives of instructors, staff, alumni, community partners, field experts, and more.
Below, we extend our immense gratitude to those who encouraged and challenged us throughout
our journey at NSS.
Alumni and Data Professionals
We appreciate previous NSS students and other professionals in Data Analytics who provided
insight about what to expect once we enter the field. They described their own job search,
provided feedback about our projects, answered endless questions, and reassured us that the NSS
program was preparing us for this next stage of our careers. We hope to pay this kindness forward
by sharing our own knowledge and modeling their positive influence when given the opportunity.
We give great thanks to:
- Alex Trambley
- Ann Rumsey
- Ben Hummel
- Brandon Scott
- Chris Mulvey
- Chris Hart
- Heather Sopel
- Mark Koivula
- Matthias Mueller
- Nadia Roumanon
- Rachael Abram
- Ross Dingwall
- Sarah Beth Ivester
- Tito Amoguis
- Victoria Lynn
- Sergio Weiberg
Community Partners
Thanks to the real-world data, clients, and interviews provided by Nashville businesses
and government entities, we have significant tangible experience to draw on as we enter the
tech workforce. We appreciate the trust and time invested in us as students who may one day
be their employees or colleagues. We believe that our future interviews and quality of work
will be positively influenced by their engagement with our class.
We give special recognition and thanks to:
- Aaron Mock - Ursa Healthcare
- Emily Lamb - Metro Nashville Codes Administration
- Heather Sopel - A.O. Smith
- Keith Durbin - Metro Nashville Codes Administration
- Ryan O'Connell - Ursa Healthcare
We give great thanks to:
- Adam Dillon - Spiny.ai
- Adrienne Franke - Healthcare Bluebook
- Alla Naslimova - Clayton Homes
- Amy Neal - Metro Nashville Codes Administration
- Ann Rumsey - Pinnacle Financial Partners
- Britnee Foreman - Exceleration Music
- Catherine Bass - Onlife Health
- Charles Lindquist - Healthcare Bluebook
- Chelsea Core - Healthcare Bluebook
- Cristina Ingram - Vanderbilt University Medical Center
- Ed Hickey - HealthTrust
- Jerome Jourquin - Susan B Komen
- John Irvin - Deloitte
- LeighAnn Rodd - Cracker Barrel
- Luke Wylie - Perception Health
- Matthew Rodgers - A.O. Smith
- Nadia Roumanos - HealthTrust
- Rachel Mitchell - Trinisys
- Robin Brown - Healthcare Bluebook
- Stephen Gabor - A.O. Smith
Staff
The NSS staff consistently went above and beyond in their efforts to introduce new ways of
learning, provide feedback, and model scenarios we might encounter in the field. From day
one, we knew we had an extensive support system committed to our success in becoming Data
Analysts. We appreciate everyone at NSS for providing us countless opportunities to grow in
all domains of professionalism such as networking, work relations, resume building, and more.
We give great thanks to:
- John Wark
- Julie Heckler
- Mahesh Rao
- Michael Holloway
- Marla Lemont
- Jessica Grande
Instructors
Finally, we know that our success in this program is largely due to the skillful teaching of our
amazing instructors. Beyond simply explaining the technologies, they taught us how to struggle, ask useful
questions, help each other, and help ourselves. Their confidence in us as learners gave us the space to
build confidence in ourselves as budding Data Analysts.
We give great thanks to:
- Christopher Wright…
- for his tireless effort to make learning productive for everyone.
- for requesting and responding to our feedback throughout the course.
- for reminding us to laugh when things get frustrating (even at dad jokes).
- for sharing his whole self with us and giving us space to do the same.
- Cristina Attfield…
- for sharing her own experience from when she was in our position as a student.
- for keeping us organized and reminding us to push to GitHub.
- for the genuine care she showed as she checked in with us throughout the course.
- for modeling technological and emotional intelligence as she supported our learning.
- Joshua Rio-Ross…
- for relating to us as a fellow student and as a mentor.
- for encouraging us to experiment with different problem-solving methods.
- for answering questions in great detail, with encouragement to explore more on our own.
- for the endless comic relief provided via Zoom chat, Slack emojis, and data puns.


Find
My Recipes
Shopping List
My Profile
Added to My Recipes
Close
Add to My Recipes
Appliances Required
Ingredients
Add To Shopping List
Directions
More Like This
Curried chicken salad
Blueberry Oatmeal Squares
Old-Fashioned Oatmeal Cookies


CSS Block verses Inline
All elements in CSS have one of three display types. The characteristics of these types are:
- Block (display:block;)
- New line before and after.
- Takes up the available width.
- Width, height, margin-top, margin-bottom can be set.
- Inline (display:inline;)
- No new line.
- Only uses the width it needs.
- Width, height, margin-top, margin-bottom, padding-top, padding-bottom are ignored.
- None (display:none;)
- Not visible.
Each HTML tag has a natural display type, which can be overridden with the CSS display property.
| Block | Inline | None |
|---|---|---|
| <div> | <span> | <meta> |
| <h1>...<h6> | <a> | <style> |
| <p> | <b>,<strong> | |
| <ul>,<ol>,<dl> | <img/> | |
| <li>,<dt>,<dd> | <br/> | |
| <table>,<tr> | <em>,<i> | |
| <blockquote> | <input> | |
| <pre> | <addr>,<acronym> | |
| <form>,<fieldset> | <sub>,<sup> | |
| <label> |
The difference between display:none and visibility:hidden, is that a display:none element takes up no space on the page, whereas an visibility:hidden element still uses space - you just can't see it.


| 0" class="sidebar technique" [ngClass]="{disabled: applyControls(technique.subtechniques, tactic).length == 0}" (click)="onToggleSubtechniquesVisible(technique, tactic)">
=
|
|
| 0" class="sidebar subtechniques"> |
|


Tri-Valley Coders is a comfortable non-competitive place to learn about making software, both in person and online, for beginners and vetrans alike. Our members span the gammute in terms of age and experience, but they all have one thing in common, they are learning something new and looking to take their software development skills to the next level. (or: ... and preparing to take the next step in their career.)
Tri-Valley Coders meets every Thursday from 9:00am to 12:00pm with frequent Saturday morning meetings as well. Click below to join.
Many of our members have used the same learning resources. Below are the most commonly used resources. By using them, members get the benefit of being able to ask questions of people who are already familiar with the material you are workign with.
Below is a list of the most use learning resources.
Tri-Valley Coders is just getting started and I don't really know what to say yet but the team will figure it out together. We are a group of diverse software developers who work together to learn new skills by using common learning resources and engaging in projects together.


Travel to 🇨🇳 China (中国大陆)⬅Previous by alphabetical order⬅ ➡Next by alphabetical order➡ ➡Next by order of first visit➡ DescriptionNative country. Born and raised in Shenzhen (深圳) in Guangdong (廣東) (a.k.a. Canton Province). Of the 31 provinces (省直辖市自治区) of Mainland China, I have been to 12, all in the south except for Beijing: Photos
|


Renyuan Zou （邹任远）
An intermediate full-stack web developer using Ruby or PHP to write server-side APIs and Javascript to build client-side user interface. Building user-friendly applications is always my design and development objective.
Education
- Master, MIAGE (or Business Informatics), University of Aix-Marseille, France.
- Licence, Economics and management / 1st year of MIAGE, University of Aix-Marseille, France.
Recent Experience
RendezvousCheznous, Junior Web Developer
Nov. 2015 - Oct. 2016
Marseille, France
- Server-side (PHP Symfony 2):
- Oauth2 integration of Facebook and Google accounts for users.
- Geocoding micro-service using Google API and implementation a cache system for geocoded data.
- Multi-pricing for products(tourism and travel-related services) on the platform.
- Discount on products and promotion code integration.
- Admin interface updates for ease-use and custom querying.
- Client-side (HTML5 / CSS3 / jQuery):
- Refactoring Javascript code for Business logic heavy pages, like products searching page, product information page, payment process page.
- Participated the responsive interface rework of the whole project.
- Updating the landing page of a new design.
Ricetorun.com, Chinese food delivery platform, Owner
March 2015 - present
France
This is a side-project made to help Chinese who live in France find delicious Chinese style restaurants and order food online. I’ve started this project in order to test my coding skills and see how far I can get to as a developer and product owner as well. I used some recent technologies such as:
- Ruby on Rails to build backend. Rails is no longer a recent backend framework but something I really love. It gives me a productive, efficient and funny way to write server-side code.
- React to build user interface.
- Docker to deploy my application to DigitalOceans VPS.
Things I have tried:
- Using ActionCable, new feature in Rails 5 to easily build real-time communication over WebSockets, to make real-time notification when order’s status changes.
- Writing API endpoints with Rails 5 API mode.
- Clean but complexe ordering page with React.js to make Javascript code more readable, maintainable and even reusable.
- Making deployment easy by packing Rails application, nginx, postgresql, redis into docker and monitoring using Slack bot notification, which saved me days and money to deploy.
Ruby gems heavily used in the project:
Rails 5 (for sure), Devise (Authentication), minitest (Testing), sidekiq (Background jobs), aasm (State Machine), activeadmin (Admin Interface), carrierwave (Files uploading), etc..
Open Source
Leonids, Owner
A basic and clean Jekyll blog theme.
Skills
- Server-Side & Database
****
Ruby (Ruby on Rails)***
PHP (Symfony)**
Java, J2EE***
Nginx****
MySQL, Postgresql***
Redis**
Docker
- Client-Side
***
HTML5, CSS3, Javascript, jQuery***
React.js**
Vue.js**
ES6**
npm, yarn*
Webpack


Note
Some of the following tools need user registration at developer.berlios.de to be used.
Thanks for any help you give us!
community
Currently, these are the active places where you can communicate with other developers freely:
- Mailing list - here you can discuss about everything you want on PlugBoard
support
For all questions, problems and suggestions you have on this project, you may use the following tools to directly contact all PlugBoard developers:
- Bug
tracker - for application issues,
helping us to improve PlugBoard
more and more
- Support tracker - for usage problems and various questions
- Features
requests - for suggesting us new
enhancements to apply to PlugBoard
developers
Take in consideration these
tools if you decide to contribute by
making changes to the product's code:
Note
Please visit the project
page for all available developer
tools and their usage documentation.


Paul McCartney Only Dedicates ’10 Per Cent’ Of His Brain Power To Business: ’90 Per Cent Has To Be Free For Songs’
by Shakiel MahjouriPaul McCartney says he always puts his art before his business.
McCartney has been an active musician for more than 60 years. He released Egypt Station in Sept. 2018 and it became his first chart-topping album in 36 years.
The Beatles icon speaks with Billboard for the publication’s 125th anniversary. He explains how his longevity as a musician is due, in part, to keeping his focus primarily on his art.
“I’ve got so much brain, and 90 per cent of it has to be free for songs and art,” McCartney says. “If I block that out with finance, I’m sunk. So 10 per cent of me can think about where we’re going, but I keep the rest open to do various artistic things”
“When you do something, you kind of do it for yourself,” he says of Egypt Station. “But at the same time, you want people to hear it and judge whether it’s any good.”
He also attributes The Beatles’ growth and success to that sort of meticulous attention to art.
“We’d do one song, and it’d be a hit, and instead of doing another with the same formula, we’d say, ‘OK, we’ve done that,'” McCartney explains. “You listen to The Beatles’ output and no two songs are alike.”
The 125th anniversary special of Billboard hits newsstands on Saturday.


test1 |
test2: this line should remain and a
new node added |
test3: the original test3 node was
replaced |
test4 this line
should remain and two new lines of content will be added with
different styling. |
test5 - testing diff that inserts a new child then replaces the
child. If this line is all you see for test5, then the test
failed. /div> |
test5a - testing patching using patch paths
|
test5b - testing patching using patch paths
|
|
test6 - testing diff when key says its the same VNode You should not see this line. If you do its an
error.
|
test8 - add an SVG rect
|
test9:
Look at js console to see output. |
test10: |
This tests some simple rendering using functional approaches |
|
|


Based on the described approach for BagArray that
replaces the removed value with the last value in the array instead
of shifting. What would be the state of the following array after a
call to remove("twix")?
A)
B)
C)
D)
There are no hints for this question


Web sites want to pay you for videos
The Internet's booming social-networking trend has reached a new milestone: Web sites are beginning to pay for content.
That means all those Web-savvy creative types, the people who post skateboarding videos or write a review about the neighborhood dry cleaner, could be compensated for their contributions.
The move to pay people for content had been developing slowly but reached a critical new phase when YouTube.com, the Internet's bellwether video site, confirmed Monday that it has plans to pay for user-generated content.
The decision sets up the potential for a monumental shift in how people use and view networking sites. Until now, as user-generated content on the Web has grown, the only people making any money have been the site operators.
YouTube, for instance, rose to prominence thanks largely to the goofy homemade videos ordinary people created and posted. But when Google Inc. purchased it last year for $1.65 billion, the people responsible for those videos didn't receive a single cent from the mammoth Google payout.
Paying individual users for content also follows deals that Google, Yahoo Inc. and Apple Inc., among others, have been signing with networks and Hollywood studios for the right to sell and promote original content on the Web.
YouTube didn't provide details of why it wanted to start compensating individual creators. But a number of industry executives suggested that with both the Internet audience and ad revenue growing, competition for the best user-generated content also is intensifying. So those looking for an edge have started offering money.
By the end of this year, "almost every big site that focuses on viral video will have a revenue-sharing component to it," said Keith Richman, chief executive of Break.com, a site that pays $400 to $2,000 to contributors about 100 times a month for the exclusive rights to some videos.
Spymac.com is paying between $3,000 to $5,000 a day to pools of people who create videos or other original materials, while Revver.com is sharing revenue from advertisements placed at the end of videos. If viewers click on the ad, the video's creator gets paid.
In April, a new site based in Chicago, Viewpoints.com, will feature both paid reviewers and non-paid reviewers to write about restaurants, hotels, doctors and other services.
"My contract with them is through the end of the year," said Laura Tucker, a South Elgin mom and aspiring freelance writer who would not disclose what she would be paid. "My understanding is that at the end of the year, they will vote on the next paid reviewers."
YouTube co-founder Chad Hurley disclosed the site's intentions over the weekend at an economic summit in Davos, Switzerland.
"We are getting an audience large enough where we have an opportunity to support creativity, to foster creativity through sharing revenue with our users," Hurley said. "So in the coming months we are going to be opening that up."
Hurley didn't indicate how YouTube would pay for content, but there is more than one way to share the wealth.
While some sites might be willing to pay for exclusive content, the culture and technology of the Web is such that viewers want to share cool videos with friends. That means that a video first appearing on YouTube will quickly get passed around, ending up on countless blogs or profile pages at MySpace.com.
Sites like Revver.com and Spymac.com hope to tap into the "viral" nature of video sharing and still pay the content creators. At Spymac.com, creators will get paid no matter where the video is viewed, as long as it was first uploaded to Spymac.
"The more you promote your upload, and it becomes very popular, the more money you make," said Kevin April, Spymac's chief technology officer. Creators are "encouraged to market their own videos," he said.
At Revver.com, ads are embedded into the end of a video. If a viewer clicks on the ad, the content creator is paid. Any revenue an ad generates is split 50-50 between Revver and the video's creator.
Steven Starr, Revver's founder and CEO, told the Tribune last year that "it's our goal to support the creator."
He called it the idea of "recognition vs. reward." At YouTube, until now, video creators get recognition from viewers and pats on the virtual back for a job well done. With Revver, "We believe it is incumbent on anybody who wants to be a creator of content to get paid," he said.
Money isn't the only attraction for content generators, however. Some people have done quite well by YouTube without it.
Actor Liam Sullivan's "Shoes" video on YouTube has been viewed more than 12 million times. The exposure given to his Kelly character, who sings the rebellious teenage ode to "Shoes," has made him a sensation.
The exposure has led to a deal with Apple, where "Shoes" is among the Top 10 comedy singles at the iTunes music store. He said he also will be part of an ensemble cast for a series launching on cable's VH1.
"I'm overwhelmed by all the attention," Sullivan said. "It's satisfying to know that so many people like my stuff."
In contrast to Sullivan, the majority of YouTube creators are not interested in an entertainment career. But they would like to make a little money.
"I'd love to see money exchange hands if it's the right process," said Allen Weiner, an analyst with Gartner who follows the online video industry. "But I think before [YouTube] makes such statements, they need to get their ducks in a row."
For instance, he said, YouTube does not have a system in place for ads based on context.
"If I'm Ford, and I advertise on YouTube, do I want to be next to a video that says Ford cars are unsafe at any speed? That could be a problem," Weiner said.
Executives at Google and YouTube did not respond to questions about how they would implement payment for creators, or how they display advertising.
Google did release a statement, however, confirming that "we are actively exploring a variety of ways to help the community to monetize content, and expect to announce something in the coming months that users will embrace."
In Davos, Hurley discussed the strategy shift. He said YouTube initially "didn't want to build a system that was motivated by monetary reward. We wanted to build a true community around video."
"When you start out with giving money to people from Day 1, the people you do attract will just switch to the next provider," he said. His comments are posted on YouTube.
At Viewpoints.com, Matt Moog hopes his site will become a home for reviewers who already are respected on the Web. Those people will be compensated for their reviews, but the majority will not be paid.
"The non-paid reviewers will come to the site and create reviews because they enjoy the recognition, they want to be a part of the conversation," he said.
Chicagoan Brian Thomas, one of Viewpoint's few paid reviewers, appreciates being part of the conversation, but that only goes so far.
"If talent can get recognized and rewarded, I think it's great," Thomas said. "But I'm not doing this for free."
--<EMAIL_ADDRESS>http://www.chicagotribune.com/business/chi-0701300064jan30,0,3998548.story?coll=chi-bizfront-hed


| Tool | Ctrl | |||
|---|---|---|---|---|
| Pencil | Left Click | Draws a 1×1 line of the selected color. | Picks the color under the current cursor position. | |
| Right Click | Erases a 2×2 line. | Picks the color under the current cursor position, and sets it as the shade color. |
||
| Eraser | Implemented, see Pencil Right click. | |||
| Select | Drags a current selection, or makes a new one. | Skews the selection. | ||
| Fill |
Left Click | Fills the area with the selected color. | ||
| Right Click | Erases the fillable area. | |||
| Outline Fill | Left Click | Creates a black outline around the current area. | ||
| Right Click | Creates a black outline inside the current area. | |||
| Outline | Outlines the current frame when clicked. | |||
| Colorpicker | Implemented, see Pencil Ctrl click. | |||
| Shading Tool | Left Click | Shades the given color under the cursor with it's shade-pair. |
||
| Right Click | Lightens the given color under the cursor with it's shade-pair. |
|||
| Free-select | Not yet implemented | |||
| Line Tool |
Not yet implemented | |||
| Rectangle Tool |
Not yet implemented | |||
| Oval Tool |
Not yet implemented |
| Edit | Description | Quick Key |
|---|---|---|
| Undo | Undoes your mistakes up to 50 times. | Ctrl+Z Ctrl+Space |
| Redo | Reverts the undoes. | Ctrl+Y |
| Copy | Copies the current selection to the app's local clipboard. | C |
| Paste | Pastes image from the app's local clipboard. Use Ctrl + V to paste from the OS's clipboard. |
V Ctrl+V |
| Cut |
Not yet implemented. To delete unnecessary items you could drag them "off stage". |
X |
| Insert Frame |
Adds an empty frame front of the current frame. To add a frame after the last one, move behind the last frame with the arrow keys |
|
| Remove Frame |
Deletes the current frame. Not undoable yet, and cripples the undo buffer; be careful! |
|
| Copy Frame |
Not yet implemented. | |
| Paste Frame |
Not yet implemented. | |
| Cut Frame |
Not yet implemented. | |
| Flip Vert. |
Vertically flips the selection. | |
| Flip Hor. |
Horizontally flips the selection. | |
| Rotate C.wise |
Rotates the selection clockwise. | |
| Rotate Cc.wise |
Rotates the selection counterclockwise. |
| File | Description |
|---|---|
| New Sheet |
Creates a new spritesheet with the attributes of width (spw), height (sph) and frame count (count) |
| Open Sheet |
Loads a spritesheet into the currently active one.
Make sure you've prepared a new sheet with the matching dimensions before loading one. |
| Save Sheet |
Saves the currently active spritesheet as a .png file. |
| New Project |
Not yet implemented. |
| Open Project |
Not yet implemented. |
| Save Project |
Not yet implemented. |
| Animation | |
|---|---|
| Play | Animates the current spritesheet.
Presseng Enter does the same. |
| fps | Sets the animation speed for the spritesheet. |
| zoom | Enlarges the current spritesheet's window. |
| Onion Toggle | Toggles onion frames visibility. (Seeing neighbour frames) |
| Toggle Transparency | Makes the current window somewhat transparent. Useful tracing [a stick animation for example]. |
| Frame Timeline | Clicking with left mouse button selects the given frame.
Right mouse button sets the onion frames. |
| Color Grid | |
|---|---|
| The Color Grid | Changes the color of the Pencil and Fill tools.
To mix a custom color, click the grand color slot. To copy colors from your spritesheet, use Color picker tool (Pencil + Ctrl for now) : Left click sets the main color, the right click sets the shade pair [used with the Shading tool] |
| Lock Colors | Using the Color pick tool or mixing a new color won't affect the current palette (first 2 lines on the grid). |


XPath 3.1 syntax checker
XPath expression
Check syntax
Clear
Free variables
Bound variables
Functions called
XPath AST (possibly part of it ...)


1. som-pbc README
A simple self-organizing map implementation in Python with periodic boundary conditions.
Self-organizing maps are also called Kohonen maps and were invented by Teuvo Kohonen.[1] They are an unsupervised machine learning technique to efficiently create spatially organized internal representations of various types of data. For example, SOMs are well-suited for the visualization of high-dimensional data.
This is a simple implementation of SOMs in Python. This SOM has periodic
boundary conditions and therefore can be imagined as a “donut”. The
implementation uses numpy
, scipy
, scikit-learn
and
matplotlib
.
1.1. Installation
som-pbc
can be installed from pypi using pip:
pip install som-pbc
To upgrade som-pbc
to the latest version, run:
pip install --upgrade som-pbc
1.2. Usage
Then you can import and use the SOM
class as follows:
import numpy as np
from som import SOM
# generate some random data with 36 features
data1 = np.random.normal(loc=-.25, scale=0.5, size=(500, 36))
data2 = np.random.normal(loc=.25, scale=0.5, size=(500, 36))
data = np.vstack((data1, data2))
som = SOM(10, 10) # initialize a 10 by 10 SOM
som.fit(data, 10000, save_e=True, interval=100) # fit the SOM for 10000 epochs, save the error every 100 steps
som.plot_error_history(filename='images/som_error.png') # plot the training error history
targets = np.array(500 * [0] + 500 * [1]) # create some dummy target values
# now visualize the learned representation with the class labels
som.plot_point_map(data, targets, ['Class 0', 'Class 1'], filename='images/som.png')
som.plot_class_density(data, targets, t=0, name='Class 0', colormap='Greens', filename='images/class_0.png')
som.plot_distance_map(colormap='Blues', filename='images/distance_map.png') # plot the distance map after training
# predicting the class of a new, unknown datapoint
datapoint = np.random.normal(loc=.25, scale=0.5, size=(1, 36))
print("Labels of neighboring datapoints: ", som.get_neighbors(datapoint, data, targets, d=0))
# transform data into the SOM space
newdata = np.random.normal(loc=.25, scale=0.5, size=(10, 36))
transformed = som.transform(newdata)
print("Old shape of the data:", newdata.shape)
print("New shape of the data:", transformed.shape)
1.2.1. Training Error:
1.2.2. Point Map:
1.2.3. Class Density:
1.2.4. Distance Map:
The same way you can handle your own data.
1.3. Methods / Functions
The SOM
class has the following methods:
initialize(data, how='pca')
: initialize the SOM, either via Eigenvalues (pca
) or randomly (random
)winner(vector)
: compute the winner neuron closest to a given data point invector
(Euclidean distance)cycle(vector)
: perform one iteration in adapting the SOM towards the chosen data point invector
fit(data, epochs=0, save_e=False, interval=1000, decay='hill')
: train the SOM on the givendata
for severalepochs
transform(data)
: transform givendata
in to the SOM spacedistance_map(metric='euclidean')
: get a map of every neuron and its distances to all neighbors based on the neuron weightswinner_map(data)
: get the number of times, a certain neuron in the trained SOM is winner for the givendata
winner_neurons(data)
: for every data point, get the winner neuron coordinatessom_error(data)
: calculates the overall error as the average difference between the winning neurons and thedata
get_neighbors(datapoint, data, labels, d=0)
: get the labels of alldata
examples that ared
neurons away fromdatapoint
on the mapsave(filename)
: save the whole SOM instance into a pickle fileload(filename)
: load a SOM instance from a pickle fileplot_point_map(data, targets, targetnames, filename=None, colors=None, markers=None, density=True)
: visualize the som with all data as points around the neuronsplot_density_map(data, filename=None, internal=False)
: visualize the data density in different areas of the SOM.plot_class_density(data, targets, t, name, colormap='Oranges', filename=None)
: plot a density map only for the given classplot_distance_map(colormap='Oranges', filename=None)
: visualize the disance of the neurons in the trained SOMplot_error_history(color='orange', filename=None)
: visualize the training error history after training (fit withsave_e=True
)
1.4. References:
[1] Kohonen, T. Self-Organized Formation of Topologically Correct Feature Maps. Biol. Cybern. 1982, 43 (1), 59–69.
This work was partially inspired by ramalina’s som implementation and JustGlowing’s minisom.
1.5. Documentation:
Documentation for som-pbc is hosted on readthedocs.io.


Government Laboratory High School 2006-2016 Bangladesh
Notre Dame College 2016-2018 Bangladesh
Bangladesh University of Engineering and Technology 2019-Present Bangladesh


[Black Friday] Motorola slashes its Moto handsets by up to $320
by Peter Holden‘Tis the season to be merry spending and if you’ve been thinking that your wallet might just make it out of Black Friday alive, we have some bad news because Motorola has slashed up to $320 off of a range of its Moto handsets and Moto Mods for the 2019 holiday season. Among the deals are the Moto Z4 and Moto Z3 Play (with Power Pack mod bundle) that are reduced to just $399 and $230 respectively.
The deals are available exclusively via Motorola’s online shop and will run until December 2nd.
US Only
- Moto Z4 – $100 off; on sale for $399.99
-
- 32GB – $200 off; on sale for $149.99
- 64GB with Amazon Alexa mod bundle – $320 off; on sale for $229.99
- 64GB with Power Pack mod bundle – $270 off; on sale for $229.99
- Moto G7 – $100 off; on sale for $199.99
- Moto G7 Power – $70 off; on sale for $179.99
- Moto G7 Play – $50 off; on sale for $149.99
- Moto E6 – $50 off; on sale for $99.99
- Motorola One Action – $100 off; on sale for $249.99
- Motorola One Zoom – $100 off; on sale for $349.99
UK Only
- Moto G7 – £179 (Save £60) Amazon
- Moto G6 – £133 (Save £87) Amazon
- Moto G7 Play – £109 (Save £40) Amazon
And if that isn’t quite enough, Motorola has the following ongoing promotions (US only):
- Purchase any product at a full price above $249.99 and get a Moto G6 32GB Deep Indigo free *sale items are not valid for this promotion, promotion excludes Moto Z3 Play, Moto Z4 through Verizon
- Purchase any Moto Z3 or Moto Z3 Play and get a Moto Gamepad, Moto Folio, Moto Stereo Speaker, JBL SoundBoost Speaker or two style shells free!
Don’t forget to check out our other Black Friday deals here.
Buy it Now: Motorola
Moto Z3 Play review: Third time, but no more charm
Amazon Alexa Moto Mod review: A decent product in a bulky package


Thank you very much for purchasing one of our products. You can now access the premium content and/or the support forums.


About Me
I am an Applied Machine Learning Scientist/Engineer.
I hold a PhD Degree in Digital Media from the University of British Columbia (UBC), Canada.
Education:
• PhD in Electrical and Computer Engineering, UBC (University of British Columbia), Specialization in Digital Media.
• Msc. and Bsc. in Electrical and Computer Engineering, University of Tehran, Tehran, Iran, Specialization in Digital Media.
Technical Interests:
• Machine Learning, Deep Learning, and Pattern Recognition
• Computer Vision, Digital Image and Video Processing and Understanding
• Natural Language Processing
• Mathematical Modelling and Optimization
• Digital Video (2D, 3D, High Dynamic Range (HDR) Video):
Content Generation, Quality of Experience, Visualization, Transmission, Compression, and Display


Posted: 2016-02-27
, Modified: 2016-02-27
Tags: none
References:
- McKay Ch. 11
- Cover, Thomas Ch. 9
Reading
McKay
What’s the model?
- Transmit a signal \(x(t)\) in a channel with error at every moment in time Gaussian with variance \(\si^2\).
- You are limited to using \(v\) power, i.e., \(\int_0^T \fc{x(t)^2}{T}\,dt\le v\).
- You are bandwidth-limited: \(x\) must be a sum \(x=\sum_{n=1}^{N} x_n\phi_n\) where \(\phi_n\) are orthonormal basis. (i.e., \(\sum x_n^2=v\).) Take the functions to be \(\cos\pf{2\pi kx}{T}\) and \(\sin\) for \(1\le k\le TW\). We have \(N=2TW\) where \(W\) is the max allowable frequency.
At what (limiting) rate can you transmit information?
Note: A sum is like an integral. Take exps instead of sin/cos for simplicity. Then for \(x\) a sum of exponentials \(\phi_n\), \[
\int_0^1 x(t)\phi_n(t) = a_n = \EE_{t=0}^{N-1}x\pf{t}{N} \phi_n\pf{t}{N}.
\]
Useful: \(N(y;x,\si^2)N(x;0,v) = N\pa{x;\fc{v}{v+\si^2}y, \pa{\rc{v}+\rc{\si^2}}^{-1}}\). Mean is means harmonically weighted by variances (i.e. weighted by precisions). “Whenever two independent sources contribute information, via Gaussian distributions, about an unknown variable, the precisions add.”
“Real continuous channel with \(W\) and noise \(W_0\) is \(\fc{N}{T}=2W\) uses per second of Gaussian with \(\si^2=N_0/2, \ol{x_n^2}\le \fc{P}{2W}\).
(How do you think of discrete bits as encoding a point in real space? Or are you transmitting analog information?)
Bandwidth is more powerful than low noise.
(Q: Why does M say that entropy can’t be defined for continuous variables? I guess this should be taken to mean that the definition of \(h\) wouldn’t be invariant under change of coordinates.)
Exercises
(Solution p. 189/201) Use Lagrange multipliers with functions (calculus of variations). Use \(\fc{\de F}{\de P^*}\int P(x) f(x,P) \dx = f(x^*,P) + \int P(x)\fc{\de f(x,P)}{\de P(x)}\) (cf. normal product rule). Note \(P(y|x)\) is fixed (normal), but \(P(y)\) depends on \(P(x)\), it is really a function of \(P\), \(f(P)\). Simplify, and then substitute \(P(y|x)\). Match coefficients in Taylor expansion.
Question: Why does the constraint \(\int P\dx=1\) become \(\mu\pa{\int P\dx}\) rather than \(\mu(\bullet-1)\)? They disappear after differentiation!
TAKEAWAY: Calculus of variations. Gaussian distributions is best. (Why not 2 points as far as possible?)
Just calculate the integral. Mutual info is \(\rc2\ln \pa{1+\fc{v}{\si^2}}\). This is the capacity (explained on p. 182) (?). The more power, the more capacity, scaling by log.
Cover, Thomas
Ch. 8
- Differential entropy \(h=-\int f\lg f\dx\). “differential entropy is the logarithm of the equivalent side length of the smallest set that contains most of the probability.”
- How differential entropy and entropy are related: Let \(X^{\De}\) be \(X\) quantized to \(\De\). Then \(\lim_{\De\to 0}H(X^{\De})+\lg \De = h(X)\).
- Note mutual info is limit of quantized mutual info (the \(\lg \De\)’s cancel).
- KL divergence: \(D(f||g)=\int f \lg \fc{f}{g}\ge 0\).
- Basic calculations
- \(h(N(0,\si^2)) = \rc2 \lg (2\pi e\si^2)\)
- \(\rh\)-correlated Gaussians: \(I(X:Y) = -\rc2 \lg(1-\rh^2)\).
- Basic inequalities
- By LoLN, AEP holds for continuous random variables (\(\log f\) needs to be \(L^1\)?).
- (Hadamard) \(\det(K)\le \prod K_{ii}\) by subadditivity of entropy.
- \(h(AX)=h(X)+\lg |\det(A)|\).
- Normal maximizes entropy over distributions with same variance. Proof: \(0\le D(g||\phi_K) = -h(g)+h(\phi_K)\) where the second term follows from the fact that \(g,\phi_K\) have the same second moments and \(\log \phi_K\) is a quadratic form (write it out!).
- Estimation version of Fano: \(\E[(X-\hat X)^2]\ge \rc{2\pi e}e^{2h(X)}\), equality only if \(X\) Gaussian and \(\hat X = \E X\). Proof: use that Gaussian distribution has max entropy for given variance.
- Cor: \(\E[(X-\hat X(Y))^2] \ge \rc{2\pi e} e^{2h(X|Y)}\).
Nice summary on p. 282.
Ch. 9
- A Gaussian channel with power \(P\) can be converted to a binary symmetric channel with error \(1-\Phi\pa{\sfc{P}{\si^2}}\).
- 9.1: A more conceptual way to upper-bound the mutual information: \(Y=X+Z\) where \(Z\) is noise.
- Theorem 8.6.5: normal maximizes the entropy for a given variance. (cf. entropy-maximizing distributions. Use CoV here?) Then \(I(X:Y)=h(Y)-h(Z)\le \rc2 \log \pa{1+\fc PN}\), equality only when \(X\) is Gaussian.
- Model of Gaussian channel: Encoding, Gaussian noise, decoding, \([M]\xra{x}\mathcal{X}^n \xra{N}\mathcal{Y}^n \xra{g} [M]\).
- Theorem 9.1.1: Capacity of Gaussian channel is \(\rc 2 \lg\pa{1+\fc{P}N}\).
- Heuristic proof: Pack spheres of radius \(\sqrt{nN}\) in \(\sqrt{n(P+N)}\).
- Think of mutual info as a limit achievable in infinite dimensions. It doesn’t make sense to encode a discrete set with a probability distribution, but in large dimensions you can approximate it!
- Proof of achievability: (1) generate codewords iid (2) search for jointly typical. (3) It’s rare that either it’s far from the codeword, or it’s close to another one.
- Proof of necessity: Take uniform distribution over inputs. Use Fano’s inequality to relate probability of error and mutual info.
- Fano’s inequality says that for \(X\to Y\to \wh X\), \(P_e=\Pj(X\ne \wh X)\), \(H(P_e)+P_e\lg |\mathcal X| \ge H(X|\wh X) \ge H(X|Y)\).
- Applied here, \(H(W|\hat W)\le H(P_e) + P_e\lg |\mathcal X|\le 1 + (nR) P_e^{(n)}=o(n)\). Since \(nR=H(W)\), we get that \(I(W:\hat W) \ge \asymp nR\) and hence \(\sum I(X_i:Y_i) \ge \asymp nR\). But this sum can be bounded by the power (use Jensen on the \(P_i\)).
- 6.3 Bandlimited channels: “Rate \(\rc{2W}\) is sufficient to reconstruct the signal because it cannot change substantially in \(<\rc2\) a cycle.” Proof: Note that the Fourier transform is 0 outside \([-W,W]\). \(f\pf{n}{2W}\) are the Fourier coefficients of \(F(\om)\). (“a bandlimited function has only 2W degrees of freedom per second”)
- Note band-limitation can be expressed as convolution by \(\mathcal F^{-1} 1_{\le W}\).
- The characteristic-function basis for sampling at \(\fc{n}{2W}\) are the translates of \(\text{sinc}(Wt) = \sin(Wt)/(Wt)\).
- Relating the 2 models.
- In the Gaussian noise model, \(C=\rc 2 \log\pa{1+\fc{P_G}{N_G}}\) where \(P\) is power (average magnitude) and \(N\) is variance.
- In the band-limited model, suppose \(W\) is bandwidth, \(P\) is power, and \(\fc{N_0}2\) is variance (power spectral density - I don’t understand this).
- Match up by \(P_G=\fc{P}{2W}\) (divide by sampling rate) and \(N_G=N_0/2\) to get \(\rc2\lg\pa{1+\fc{P}{N_0W}}\) per sample. Multiply by \(2W\). (\(\fc{P}{N_0W}\) is SNR.)
\[\begin{equation} C= W\lg\pa{1+\fc{P}{N_0W}}.\end{equation}\]
With infinite bandwidth, \(C=\fc{P}{N_0}\lg e\).
- 9.4 Parallel Gaussian channels: set of Gaussian channels in parallel with common (total) power constraint \(P\). How to distribute.
- Maximize \(\sum \rc2\lg\pa{1+\fc{P_i}{N_i}}\) subject to \(\sum P_i=P\). By Lagrange multipliers, the best solution is water-filling, p. 277.
- 9.5 Channels with colored (correlated) Gaussian noise (SKIP)
- 9.6 Gaussian channels with feedback: for channels with memory, where the noise is correlated from time instant to time instant, feedback does increase capacity. (SKIP)
Exercises
9.10 looks interesting.
Scraps
- In the presence of noise, doesn’t it help to sample \(>2W\) times per second? Can’t you approach the true average with more samples?


Domain-Driven Design
Event Sourcing
Accept order
Fulfill order
Bill customer
Ship package
Accept order
Fulfill order
Bill customer
Ship package
with msg as (
select top (1) * from Msg
with (
updlock,
readpast)
order by Seq
) delete from msg output Payload
public class ConfirmOrderHandler
: IHandleMessages<ConfirmOrder>
{
public Task Handle(ConfirmOrder msg,
IMessageHandlingContext context)
{
var order = repo.Load(msg.OrderId);
order.Confirm();
var evnt = new OrderConfirmed();
context.Publish(evnt);
}
}
begin tran
[...] delete from msg output Payload
select * from AggregateA where Id = @id
select * from EntityA where ParentId = @id
update AggregateA set SomeProperty ...
update EntityA set OtherProperty ...
insert into Messages (Payload) values ...
commit tran
Why did we bill them twice?
We don't know
It's not us
Go away!
Cosmic ray bit flip?
OK, we will look into it...
Receiving message 123
✔
Processing message 123
✔
Acknowledging message 123
✔
Receiving message 234
✔
Processing message 234
✔
Acknowledging message 234
🔥
Receiving message 234
✔
Processing message 234
✔
Acknowledging message 234
✔
Processing message 234
✔
...
Processing message 234
✔
"Just make your logic idempotent"
-- Twitter Trolls
By the way, you know that
stores have their own databases, right?
Two-Phase Commit
Prepare A✔
Prepare B✔
Commit A✔
Commit B✔
Prepare A✔
Prepare B🔥
Rollback A↩
Prepare A✔
Prepare B✔
Commit A✔
Commit B🔥🔥✔
Persist state
Publish event
Publish event
Persist state
Why can't we have both correctness and performance?
2003: Polyglot programming
2011: Polyglot persistence
2019: Polyglot messaging
exactly-once.github.io


Severo Ochoa
Co-discoverer of the mechanisms in the biological synthesis of ribonucleic acid (RNA) and deoxyribonucleic acid (DNA).
Here is a time line of Severo Ochoa's life:
- 1905 - Born in Luarca (Asturias), Spain.
- 1912 - His dad pass away and his family moves to Málaga, Spain.
- 1923 - Start studying at University of Madrid Medical School.
- 1927 - Spend the summer at Glasgow working with D. Noel Paton on creating metabolism improving his english skills.
- 1929 - Completes his undergraduate medical degree and move to Berlin-Dahlem to join Otto Meyerhof's laboratory.
- 1930 - Returns to Madrid to complete his research thesis.
- 1931 - Defends his thesis, marry Carmen García Cobián and move to London to start his postdoctoral study at London National Institute for Medical Research.
- 1933 - Return to Madrid to study glycolysis in hearth muscle.
- 1936 - Return to Meyerhof's Kaiser Wilhelm Institute for Biology now relocated in Heidelberg.
- 1940 - Work at the Faculty of Medicine of Washington University in St. Louis.
- 1942 - Appointed as Research Associate in Medicine at the New York University School of Medicine.
- 1945 - Become Assistant Professor of Biochemistry.
- 1946 - Become Professor of Pharmacology.
- 1947 - Become Professor of Biochemistry.
- 1954 - Become Assistant Professor of Biochemistry and Chairman of the Department of Biochemistry.
- 1956 - Become American citizen.
- 1959 - Awarded with the Nobel Prize for Physiology or Medicine "for their discovery of the mechanisms in the biological synthesis of ribonucleic acid and deoxyribonucleic acid".
- 1956 - Become Assistant Professor of Biochemistry and Chairman of the Department of Biochemistry.
- 1978 - Receive the U.S. National Medal of Science.
- 1985 - Return to Spain after many years of continued research om protein synthesis and replication of RNA viruses. Also, gave advice to the Spanish science policy authorities.
- 1986 - His wife pass away.
- 1993 - Die on Madrid on 1st November.
- 1945 - Become Assistant Professor of Biochemistry and Chairman of the Department of Biochemistry.


Miguel's Profile Page
Biography
Miguel
awesome Developer at Salesforce
Three Interesting Things...
Has two cats and hates them :)
Has saved the world on numerous occassions
Hates ManU as much as he hates Real Madrid
Save
Salesforce Rocks...
Cancel


"AKRABBIM "scorpions, probably the general name given to the ridge containing the pass between the south of the Dead Sea and Zin, es-Sufah, by which there is an ascent to the level of the land of Palestine. Scorpions are said to abound in this whole district, and hence the name (Numbers 34:4). It is called “Maaleh-acrabbim” in Joshua 15:3, and “the ascent of Akrabbim” in Numbers 34:4.
"AKRABBIM "scorpions, probably the general name given to the ridge containing the pass between the south of the Dead Sea and Zin, es-Sufah, by which there is an ascent to the level of the land of Palestine. Scorpions are said to abound in this whole district, and hence the name (Numbers 34:4). It is called “Maaleh-acrabbim” in Joshua 15:3, and “the ascent of Akrabbim” in Numbers 34:4.


Iterator over the elements of the dense matrix/sparse matrix Schur product expression. More...
#include <DMatTSMatSchurExpr.h>
Public Types | |
| using | Element = ValueIndexPair< ElementType > |
| Element type of the sparse matrix expression. | |
| using | RightIterator = ConstIterator_< RemoveReference_< RightOperand > > |
| Iterator type of the sparse matrix expression. | |
| using | IteratorCategory = std::forward_iterator_tag |
| The iterator category. | |
| using | ValueType = Element |
| Type of the underlying pointers. | |
| using | PointerType = ValueType * |
| Pointer return type. | |
| using | ReferenceType = ValueType & |
| Reference return type. | |
| using | DifferenceType = ptrdiff_t |
| Difference between two iterators. | |
| using | iterator_category = IteratorCategory |
| The iterator category. | |
| using | value_type = ValueType |
| Type of the underlying pointers. | |
| using | pointer = PointerType |
| Pointer return type. | |
| using | reference = ReferenceType |
| Reference return type. | |
| using | difference_type = DifferenceType |
| Difference between two iterators. | |
Public Member Functions | |
| ConstIterator (LeftOperand left, RightIterator right, size_t column) | |
| Constructor for the ConstIterator class. More... | |
| ConstIterator & | operator++ () |
| Pre-increment operator. More... | |
| const Element | operator* () const |
| Direct access to the sparse matrix element at the current iterator position. More... | |
| const ConstIterator * | operator-> () const |
| Direct access to the sparse matrix element at the current iterator position. More... | |
| ReturnType | value () const |
| Access to the current value of the sparse element. More... | |
| size_t | index () const |
| Access to the current index of the sparse element. More... | |
| bool | operator== (const ConstIterator &rhs) const |
| Equality comparison between two ConstIterator objects. More... | |
| bool | operator!= (const ConstIterator &rhs) const |
| Inequality comparison between two ConstIterator objects. More... | |
| DifferenceType | operator- (const ConstIterator &rhs) const |
| Calculating the number of elements between two expression iterators. More... | |
Private Attributes | |
| LeftOperand | left_ |
| Left-hand side dense matrix expression. | |
| RightIterator | right_ |
| Iterator over the elements of the right-hand side sparse matrix expression. | |
| size_t | col_ |
| The column index of the iterator. | |
Iterator over the elements of the dense matrix/sparse matrix Schur product expression.
|
inline |
Constructor for the ConstIterator class.
| left | Handle to the left-hand side dense matrix expression. |
| right | Iterator to the current position in the right-hand side sparse matrix expression. |
| column | The column index of the given iterator. |
|
inline |
Access to the current index of the sparse element.
|
inline |
Inequality comparison between two ConstIterator objects.
| rhs | The right-hand side expression iterator. |
|
inline |
Direct access to the sparse matrix element at the current iterator position.
|
inline |
Pre-increment operator.
|
inline |
Calculating the number of elements between two expression iterators.
| rhs | The right-hand side expression iterator. |
|
inline |
Direct access to the sparse matrix element at the current iterator position.
|
inline |
Equality comparison between two ConstIterator objects.
| rhs | The right-hand side expression iterator. |
|
inline |
Access to the current value of the sparse element.


Min sat cross-legged on the bed, not as comfortable a position in a riding dress as it was in breeches, and rolled one of her knives across the backs of her fingers. It was an absolutely useless skill, Thom had told her, but sometimes it caught peoples’ eyes and made them pay attention without need to do more. In the middle of their room Rand was holding his scabbarded sword up to study the cuts he had made in the peace-bond, and paid her no attention at all. The Dragon’s heads on the backs of his hands glittered, metallic red and gold.
“You admit this has to be a trap,” she growled at him. “Lan admits it. A half-blind goat in Seleisin has more brains than to walk into a trap!
“A trap isn’t really a trap if you know it’s there,” he said absently, bending the end of one of the severed wires a little to line up better with its mate. “If you know it’s there, maybe you can see a way to walk in so it isn’t a trap at all.”
She threw the knife as hard as she could. It flew in front of his face to stick quivering in the door, and she gave a little jump recalling the last time she had done that. Well, she was not lying on top of him, now, and Cadsuane was not going to walk in, worse luck. Burn the man, that frozen knot of emotions in her head had not even quivered when the knife streaked by, not by so much as a flicker of surprise! “Even if you just see Gedwyn and Torval, you know the others will be there, hiding. Light, they could have fifty sell-swords waiting!”
“In Far Madding?” He stopped looking at the knife sticking in the door, but only to shake his head and go back to examining the peace-bond. “I doubt there are two mercenaries in the whole city, Min. Believe me, I don’t intend to get myself killed here. Unless I can see how to spring the trap without getting caught, I won’t go near it.” There was no more fear in him than in a stone! And about as much sense! He did not intend to get killed, as if anyone ever intended to!
Scrambling off the bed, she opened the front of the bedside table long enough to take out the strap that Mistress Keene made sure was in every room, even if she did rent to outlanders. The thing was as long as her arm and as wide as her hand, with a wooden handle at one end and the other end split into three tails.
That was when Nynaeve and Lan and Alivia walked in. Nynaeve and Lan were cloaked, and Lan had his sword at his hip. Nynaeve had removed all of the jewelry except for one gemmed bracelet and the jeweled belt, the Well. Lan closed the door quietly. Nynaeve and Alivia stood staring at Min with the strap raised over her head.
Hastily she dropped the thing to the flowered carpet and kicked it underneath the bed with the side of her foot. “I don’t understand why you’re letting Lan do this, Nynaeve,” she said as firmly as she could. At the moment, that was not particularly firm. Why did people always walk in at the worst time?
“A sister has to trust her Warder’s judgment sometimes,” Nynaeve said coolly, drawing on her gloves. Her face belonged on a porcelain doll for all the emotion it displayed. Oh, she was being Aes Sedai to her toenails.
He isn’t your Warder, he’s your husband, Min wanted to say, and at least you can go along to look after him. I don’t know if my Warder will ever marry me, and he threatened to tie me up if I tried to go with him! Not that she had argued very hard on that point. If he was going to be a bull-goose fool, there were better ways to save him than trying to stick a knife in somebody.
“If we are going to do this, sheepherder,” Lan said grimly, “best we be about it while there’s still light to see.” His blue eyes seemed colder than ever, and hard as polished stones. Nynaeve gave him a worried look that almost made Min feel sorry for her. Almost.
Rand belted his sword over his coat, then settled his cloak with the hood hanging down his back and turned toward her. His face was as hard as Lan’s, his blue-gray eyes almost as cold, but in her head that frozen stone blazed with veins of fiery gold. She wanted to tangle her hands in the black-dyed hair that almost brushed his shoulders and kiss him no matter how many people were watching. Instead, she folded her arms across her chest and lifted her chin, making her disapproval clear. She did not intend for him to die here, either, and she was not about to let him start thinking she would give in just because he was stubborn.
He did not try to take her in his arms. Nodding as if he actually understood, he picked up his gloves from the small table by the door. “I’ll be back as soon as I can, Min. Then we’ll go to Cadsuane.” Those golden veins continued to glow even after he left the room, followed by Lan.
Nynaeve paused, holding the door. “I will look after them both, Min. Alivia, please stay with her and see she doesn’t do anything foolish.” She was all cool, dignified Aes Sedai composure. Until she glanced into the hallway. “Burn them!” she yelped. “They’re leaving!” And she ran, leaving the door standing half open.
Alivia closed it. “Shall we play games to pass the time, Min?”  “Cat’s cradle?”
“No, thank you, Alivia,” Min said, almost shaking her head at the eagerness in the woman’s voice. Rand might be complacent about what Alivia was going to do, but Min had set herself to get to know her, and what she had found was startling. On the surface, the former damane was a mature woman who appeared well into her middle years, stern and fierce and even intimidating. She certainly managed to intimidate Nynaeve. Nynaeve seldom said please to anyone except Alivia. But she had been made damane at fourteen, and her love of playing children’s games was not the only oddity about her.
Min wished there was a clock in the room, though the only inn she could imagine with a clock in every room would be an inn for queens and kings. Pacing back and forth under Alivia’s watchful gaze, she counted seconds in her head, trying to judge how long it would take Rand and the others to go beyond sight of the inn. When she decided enough time had passed, she took her cloak from the wardrobe.
Alivia darted to block the door, hands on her hips, and there was nothing childlike in her expression. “You aren’t going after them,” she drawled in a firm voice. “It would only cause trouble, now, and I can’t allow that.” With those blue eyes and that golden hair, her coloring was all wrong, but she reminded Min of her Aunt Rana, who always seemed to know when you had done something wrong and always saw to it that you did not want to do it again.
“Do you remember those talks we had about men, Alivia?” The other woman turned bright red, and Min hurriedly added, “I mean the one about how they don’t always think with their brains.” She had often heard women sneer that some other woman knew nothing about men, but she had never actually met one of those until she encountered Alivia. She really did know nothing! “Rand will get himself in more than enough trouble without me. I am going to find Cadsuane, and if you try to stop me . . . ” She held up a clenched fist.
For a long moment, Alivia frowned at her. Finally she said, “Let me get my cloak, and I’ll go with you.”
There were no sedan chairs or liveried servants to be seen on Blue Carp Street, and carriages would never have fit along the narrow, twisting passage. Slate-roofed stone shops and houses lined the street, most of two stories, sometimes jammed one hard against the next and sometimes with a little alleyway between. The pavement was still slick from the rain, and the cold wind tried to carry Rand’s cloak away, but people were back out and bustling about. Three Street Guards, one with a catchpole on his shoulder, paused to glance at Rand’s sword, then went on their way. Not far along on the other side of the street, the building housing the shop of the bootmaker Zeram rose a full three stories, not counting the attic under the peaked roof.
A skinny man with very little chin dropped Rand’s coin into his purse and used a thin strip of wood to lift a brown-crusted meat pie from the charcoal grill on his barrow. His face was lined, his dark coat shabby, and his long graying hair was tied with a leather cord. His eyes flickered to Rand’s sword, and looked away quickly. “Why do you ask about the bootmaker? That’s the best mutton, there.” A toothy grin made his chin almost vanish, and his eyes suddenly looked very shifty. “First Counsel herself don’t eat better.”
There were meat pies called pasties when I was a boy, Lews Therin murmured. We would buy them in the country and . . .
Juggling the pie from hand to hand, the heat soaking through his gloves, Rand suppressed the voice. “I like to know what kind of man makes my boots. Is he suspicious of strangers, for instance? A man doesn’t do his best work if he’s suspicious of you.”
“Yes, Mistress,” the chinless fellow said, ducking his head to a stout gray-haired woman with a squint. Wrapping four meat pies in coarse paper, he handed her the package before taking her coins. “A pleasure, Mistress. The Light shine on you.” She tottered away without a word, clutching the wrapped pies under her cloak, and he grimaced sourly at her back before returning his attention to Rand. “Zeram never had a suspicious bone, and if he did, Milsa wouldn’t let him keep it. That’s his wife. Since the last of the children married, Milsa’s been renting out the top floor. Whenever she finds somebody don’t mind being locked in at night, anyway,” he laughed. “Milsa had stairs put in right up to the third floor, so it’s private, but she wouldn’t pay for having a new door cut as well, so the stairs come out in the shop, and she’s not trusting enough to leave that unlocked at night. You going to eat that pie, or just look at it?”
Taking a quick bite, Rand wiped hot juice from his chin and walked over to shelter beneath the eaves of a small cutler’s shop. Along the street others were snatching a quick meal from the food-peddlers, meat pies or fried fish or twisted paper cones heaped with roasted peas. Three or four men as tall as he, and two or three women as tall as most of the other men in the street, might have been Aiel. Maybe the chinless fellow was not as shifty as he seemed, or maybe it was just that Rand had eaten nothing since breakfast, but Rand found himself wanting to gobble the pie down and buy another. Instead, he made himself eat slowly. Zeram seemed to be doing a good business. A steady if not constant flow of men went into his shop, most carrying a pair of boots to be mended. Even if he let visitors go up without sending word ahead, he would be able to identify them later, and maybe so would two or three others.
If the renegades were renting the top floor from the bootmaker’s wife, being locked in at night would not inconvenience them much. To the south, an alleyway separated the bootmaker’s from a single-story house, a dangerous drop, but on the other side, a two-story building with a seamstress on the ground floor stood wall-to-wall with the bootmaker. Zeram’s building had no windows except at the front—in back was another alley, for taking away rubbish; Rand had already checked—but there had to be a way onto the roof so the slates could be repaired when necessary. From there it would be a short drop to the seamstress’s roof, with only three more to cross before another low building, a candle-maker’s shop, and an easy jump to the street, or into the alley behind the buildings. There would not be a great deal of risk in it at night, or even in daylight, if you stayed back from the street and were careful about the Guard’s patrols when you came down. The way Blue Carp Street bent, the nearest watchstands were out of sight.
Two men approaching the bootmaker’s made him turn away and pretend to peer through the bubbled panes of the cutler’s small shopwindow at a display of scissors and knives fastened to a board. One of the men was tall, though not as tall as the possible Aielmen. Their deep cowls hid their faces, but neither carried a pair of boots, and although they held their cloaks with both hands, the wind flipped the tails of them enough to show the bottoms of scabbarded swords. A gust pulled the shorter man’s hood from his head, and he snatched it back again, but not before the damage was done. Charl Gedwyn had taken to wearing his hair caught at the nape of his neck in a silver clip set with a large red stone, but he was still a hard-faced man with a challenging look about him. And Gedwyn’s presence made the other Torval. Rand was willing to wager on it. None of the others was as tall.
Waiting until the pair had gone into Zeram’s shop, Rand licked a few greasy crumbs from his gloves and went in search of Nynaeve and Lan. He found them before he was far enough along the curve of the street to lose sight of the bootmaker’s. The candlemaker’s he had marked as a way down from the rooftops stood a little behind him, with an alley at one side. Ahead, the narrow street twisted back the other way. No more than fifty paces farther on was a watchstand with a Street Guard at the top, but another building of three stories, a cabinetmaker’s that shared the alleyway with the candlemaker, blocked the rooftops beyond from his view.
“Half a dozen people recognized Torval and Gedwyn,” Lan said, “but none of the others.” He kept his voice low, though no one passing more than glanced at the three of them. A glimpse of two men wearing swords beneath their cloaks was enough to make everyone who noticed step a little faster.
“A butcher down the street says those two buy from him,” Nynaeve said, “but never more than enough for two.” She looked sideways at Lan as though hers was the real proof.
“I saw them,” Rand said. “They’re inside now. Nynaeve, can you lift Lan and me to that rooftop from the alley behind the building?”
Nynaeve frowned at Zeram’s building, rubbing the belt around her waist with one hand. “One at a time, I could,” she said finally. “But it would use more than half what the Well holds. I wouldn’t be able to lift you down again.”
“Up is enough,” Rand told her. “We will leave over the rooftops, and climb down right over beside the candlemaker.”
She protested, of course, as they walked back down the street toward the bootmaker’s shop. Nynaeve always fought anything she had not thought of herself. “I am just supposed to put you on the roof and wait?” she muttered, scowling left and right so hard that as many people shied away from her as from the men flanking her, swords or no swords. She thrust her hand out from under her cloak to show the bracelet with its pale red stones. “This can cover me with armor better than any steel. I’d hardly even feel a sword hitting me. I thought I would be going inside with you.”
“And do what?” Rand asked softly. “Hold them with the Power for us to kill? Kill them yourself?”
Walking beyond Zeram’s shop, Rand paused in front of the low house and looked around as casually as he could. There were no Street Guards in sight, but when he prodded Nynaeve into the narrow alley, he moved quickly. He had not seen any Guards before following Rochaid, either.
“You are very quiet,” Lan said, following close behind.
She took three more quick steps before replying, without slowing or looking back. “I didn’t think, before,” she said quietly. “I was thinking of it as an adventure, confronting Darkfriends, renegade Asha’man, but you are going up there to execute them.
Rand glanced over his shoulder at Lan, but the older man only shook his head, as confused as he was. Of course they would kill them without warning if they could. This was not a duel; it was the execution she had named it. At least, Rand hoped very much it would be.
The alley that ran behind the buildings was a little wider than the one to the street, the rocky soil rutted with the tracks of the rubbish barrows that were pushed along it mornings. Blank stone walls rose around them. No one wanted a window to watch the rubbish carts.
Nynaeve stood peering up at the back of Zeram’s building, then suddenly sighed. “Kill them in their sleep, if you can,” she said, very quietly for such fierce words.
Something unseen wrapped snugly around Rand’s chest beneath his arms, and slowly he rose into the air, floating higher until he drifted over the edge of the overhanging eave. The invisible harness vanished, and his boots dropped to the sloping roof, sliding a little on the damp gray slates. Crouching, he moved back on all fours. A few moments later, Lan floated up to land on the roof, too. The Warder crouched as well, and peered into the alley below.
“She is gone,” Lan said finally. Twisting around to face Rand, he pointed. “There is our way in.”
It was a trapdoor set among the slates high toward the peak, with metal flashing to keep water out of the attic that lifting it revealed. Rand lowered himself into a dusty space, dimly lit by the light through the trapdoor. For a moment, he hung by his hands, then let go, dropping the last few feet. Except for a chair with three legs and a chest with the lid thrown open, the long room was as empty as the chest. Apparently Zeram had stopped using the attic for storage when his wife began taking renters.
Stepping lightly, the two men searched the floorboards until they found another, larger trapdoor lying flat against the floor. Lan felt the brass hinges and whispered that they were dry but unrusted. Rand drew his sword and nodded, and Lan snatched the trapdoor open.
Rand was not sure what he would find when he sprang down through the opening, using a hand on the coping to control his fall. He landed lightly on the balls of his feet, in a room that seemed to have taken the attic’s place from the wardrobes and cabinets shoved against the walls, the wooden chests piled on one another and tables with chairs standing atop them. The last thing he expected, though, was two dead men sprawled on the floor as if they had been dragged into the storage room and flung down. The black swollen faces were unrecognizable, but the shorter of the pair wore a silver hairclip set with a large red stone.
Dropping soundlessly from the attic, Lan looked at the corpses and raised an eyebrow. That was all. Nothing ever surprised him.
“Fain is here,” Rand whispered. As if saying the name were a trigger, the twin wounds in his side began throbbing, the older like a disc of ice, the newer a bar of fire across it. “It was him sent the letter.”
Lan gestured toward the trapdoor with his sword, but Rand shook his head. He had wanted to kill the renegades with his own hands, yet now that Torval and Gedwyn were dead—and almost certainly Kisman, too; there was that swollen corpse mentioned by the merchant at The Golden Wheel—now, he realized he did not care who killed them so long as they were dead. If a stranger finished Dashiva, it would not matter. Fain was another matter. Fain had harrowed the Two Rivers with Trollocs, and given him a second wound that would not heal. If Fain was within reach, Rand would not allow him to escape. He motioned for Lan to do as they had in the attic, and set himself in front of the door with his sword in both hands. When the other man pulled the door open, he darted into a large lamplit room with a posted bed against the far wall and a fire crackling in a small fireplace.
Only the speed of his movement saved him. A flicker of movement caught the corner of his eye, something tugged at the cloak billowing behind him, and he spun awkwardly to fend off slashes of a curved dagger. Every movement was an effort of will. The wounds in his side no longer throbbed; they clawed at him, molten iron and the very soul of ice warring to rip him open. Lews Therin howled. It was all Rand could do to think, with the agony.
“I told you he’s mine!” the bony man screamed, dancing away from Rand’s cut.  Teeth bared in a snarl, he looked like a weasel wild with killing fury. A rabid weasel, ready to savage even a leopard. With that dagger, he could kill any number of leopards. “Mine!” Padan Fain shrieked, leaping back again as Lan rushed into the room.
Only when Lan turned away from Fain did Rand realize someone else was in the room, a tall pale man who came almost eagerly to meet the Warder blade to blade. Toram Riatin’s face was haggard, but he flowed into the dance of swords with the grace of the blademaster he was. Lan met him with an equal grace, a dance of steel and death.
Startled as Rand was to see the man who had tried to claim the throne of Cairhien in a worn coat in Far Madding, he kept his eyes on Fain and his sword toward the one time peddler. Darkfriend and worse, Moiraine had called him long ago. The blinding pain in Rand’s side made him stumble as he advanced on Fain, ignoring the stamp of boots and the ring of steel on steel behind him as he ignored Lews Therin’s groans in his head. Fain danced and darted, trying to get close enough to use the dagger that had made the never-healing slash in Rand’s side, growling curses in a low voice as Rand’s blade forced him back. Abruptly he turned and ran, toward the back of the building.
The torment tearing at Rand faded to mere throbbing as Fain vanished from the room, but he followed cautiously even so. At the doorway, though, he saw that Fain was not trying to hide. The man stood waiting for him at the head of stairs leading down, the curved dagger in one hand. The large ruby capping the hilt glittered, catching the light of the lamps set on tables about the windowless room. As soon as Rand stepped into the room, fire and ice raged in his side till he could feel his heart shuddering. Staying upright was an effort of iron will. Taking a step forward made that effort seem pale, but he took that step, and the next.
“I want him to know who is killing him,” Fain whined petulantly. He was glaring straight at Rand, but he seemed to talking to himself. “I want him to know! But if he’s dead, then he will stop haunting my dreams. Yes. He will stop, then.” With a smile, he raised his free hand.
Torval and Gedwyn came up the stairs with their cloaks over their arms.
“I say we aren’t going near him until I know where the others are,” Gedwyn growled.  ”
Without thought, Rand twisted his wrists in Cutting the Wind and immediately followed with Unfolding the Fan.
 Suddenly he tilted his head as though listening, and a moment later, aiming a scream of wordless fury at Rand, he fled down the stairs.
Wondering, Rand moved to follow the descending thumps of Fain’s boots, but Lan caught his arm.
“The street out front is filling up with Guards, sheepherder.” A dark wetness stained the left side of Lan’s coat, but his sword was sheathed, proof of who had danced that dance the better. “Time we were on the roof, if we’re going.”
“A man can’t even walk down an alley with a sword in this city,” Rand muttered, sheathing his own blade. Lan did not laugh, but then, he seldom did except for Nynaeve. Shouts and screams rose up the stairwell from below. Maybe the Street Guards would capture Fain. Maybe he would hang for the corpses up here. It was not enough, but it would have to do. Rand was tired of what would have to do.
In the attic, Lan leapt to catch the coping of the trapdoor in the roof and pull himself up and out. Rand was not sure he could make that leap. The agony was gone with Fain, but his side felt as if it had been beaten with axehandles. As he was gathering himself to try, Lan put his head back through the trapdoor and extended a hand.
“They may not come up right away, sheepherder, but is there any point in waiting to see?”
Rand caught Lan’s hand and let himself be drawn up to where he could catch the coping and pull himself out onto the roof. Crouching low, they moved along the damp slates to the back of the building, then began the short climb to the peak. There might be Guards in the street, but there was still a chance to get away unseen, especially if they could signal Nynaeve to make a distraction.
Rand reached for the roof peak, and behind him, Lan’s boot slipped on the slates with a screech. Twisting around, Rand seized the other man’s wrist, but Lan’s weight pulled him down the slick gray slope. Vainly they scrabbled with their free hands for any hold, the edge of a slate, anything. Neither uttered a word. Lan’s legs went over the edge, and then the rest of him. Rand’s gloved fingers caught on something; he did not know what, and he did not care. His head and one shoulder stuck over the edge of the roof, and Lan was dangling from his grip above the ten-pace drop to the alley next to the low house.
“Let go,” Lan said quietly. He looked up at Rand, his eyes cold and hard, no expression on his face. “Let go.”
“When the sun turns green,” Rand told him. If he could just pull the other man up a little, enough to catch the eave . . .
Whatever his fingers had caught broke with a sharp snap, and the alley rushed up to meet them.


The SolAR framework has been designed to simplify the design of vision pipelines adressing augmented reality applications. A SolAR vision pipeline is a chain of connected vision processing components generally executed in parallel. For instance, a SolAR vision pipeline may take as input images captured by one or more cameras as well as data from an inertial sensor. These data will be processed in series by a set of SolAR components to estimate the pose of an AR device.
The SolAR framework has been designed from the beginning to clearly separate tasks and roles and offer modularity. Indeed, a vision pipeline assembler will be able to focus on the pipeline design without worrying about the implementation of components, the intergation of existing computer vision libraries or the integration of the pipeline in an AR service.
A vision pipeline assembler can easily:
download existing SolAR vision components created and published by the SolAR component creators,
assemble the vision components to create a vision pipeline,
update the vision pipeline architecture,
swap components by other ones,
configure components,
test the vision pipeline,
publish it for AR pipeline users who will develop AR services.
The SolAR framework handles everything that will allow a modular assembling of a vision pipeline:
SolAR Data Structures define the information that flows in a pipeline and are exchanged between components.
SolAR Component Interfaces define for now more than 50 standardized abstract interfaces for the different categories of vision processing components required to implement vision pipelines (e.g. keypoint detector, descriptor extractor, features matching, PnP and optimization). This unified interface is required to ensure interoperability between components allowing to easily swap one with another to improve the final vision pipeline.
SolAR Components are concrete implementations of vision processing components compliant with SolAR components interfaces. Several components can implement the same SolAR component interface. In general, these components are created by wrapping computer vision libraries that could be either open-source (OpenCV, PCL, ROS, etc.) or proprietary. Each component can define its own parameters that will be used to fine tune the vision pipeline.
SolAR Modules are shared libraries embedding a set of SolAR components to ease their management and publication.
Component Manager based on XPCF, a lightweight cross platform component framework similar to the well known COM model. it manages the introspection of SolAR modules and components, it provides an "in-code" dependency injection factory to create concrete component instance and bind them to a abstract SolAR component interface, it handles the loading of modules and components at runtime, it provides interfaces for load of pipeline and used modules and components at run-time, etc. XPCF is a third party developped by b<>com under Apache licencse 2.0 (more information about XPCF is available on GitHub).


Derek Eder
@derekeder
Scott, as fellow Logan Square-er & organizer of @chihacknight, can we talk? A hackathon is not what is needed http://www.chicagobusiness.com/article/20170302/OPINION/170309998/chicago-needs-a-hackathon-to-end-violence
3/2/2017, 4:44:51 PM
Favs: 43
Retweets: 9
link


Hey Scott, this is just a PoC for Clickjacking on OzBargain.com.au. This shows how suppose, a deal poster could be manipulating ozbargain users to gain upvotes, by hijacking their clicks to upvote their post. This clickjacking is possible since X-Frame-Options are not set on the server to be Deny or SAMEORIGIN, allowing for ozbargain pages to be iframed. You can read more about clickjacking and mitigations of it here. Note: the location of the iframe will depend on browser, as this is just a PoC, I have left the iframe opacity as 0.5. An attacker would make this 0.0.


Beautiful Snow
Source of witness transcribed: The Potter Journal (Coudersport, Pennsylvania)
Date of witness transcribed: 13 January 1859
Notes about this poem: "Beautiful Snow" was printed in at least 276 newspapers during the nineteenth century. It can be found using ID 507470 in this table of most widely-reprinted poems.
Its authorship was not only unknown, but the subject of frequent speculation and debate in period newspapers. In many cases the prose defending a particular story of "Beautiful Snow"—its most common but not only title—were longer than the poem itself.
§
- Oh! the snow, the beautiful snow,
- Filling the sky and the earth below;
- Over the house-tops, over the street,
- Over the heads of the people you meet;
- Dancing,
- Flirting,
- Skimming along.
- Beautiful snow! it can do nothing wrong;
- Flying to kiss a fair lady’s cheek:
- Clinging to lips in a frolicsome freak,
- Beautiful snow, from the heavens above,
-
Pure as an angel and fickle as love!
- Oh! the snow, the beautiful snow!
- How the flakes gather and laugh as they go!
- Whirling about in its maddening fun,
- It plays in its glee with every one,
- Chasing,
- Laughing,
- Hurrying by.
- It lights up the face and it sparkles the eye;
- And even the dogs with a bark and a bound,
- Snap at the crystals that eddy around.
- The town is alive and its heart in a glow,
-
To welcome the coming of beautiful snow.
- How the wild crowd goes swaying along,
- Hailing each other with humor and song;
- How the gay sledges like meteors flash by—
- Bright for a moment, then lost to the eye,
- Ringing,
- Swinging,
- Dashing they go.
- Over the crest of the beautiful snow,
- Snow so pure when it falls from the sky,
- To be trampled in mud by the crowd rushing by;
- To be trampled and tracked by the thousands of feet
-
Till it blends with the filth in the horrible street.
- Once I was pure as the snow—but I fell;
- Fell, like the snow-flakes, from heaven—to hell!
- Fell, to be trampled as the filth of the street;
- Fell, to be scoffed, to be spit on and beat,
- Pleading,
- Cursing,
- Dreading to die
- Selling my soul to whoever would buy,
- Dealing in shame for a morsel of bread,
- Hating the living and fearing the dead.
- Merciful God! have I fallen so low?
-
And yet I was once like this beautiful snow!
- Once I was fair as the beautiful snow,
- With an eye like its crystals, a heart like its glow;
- Once I was loved for my innocent grace—
- Flattered and sought for the charms of my face,
- Father,
- Mother,
- Sisters all,
- God and myself, I have lost by my fall.
- The veriest wretch that goes shivering by
- Will take a wide sweep, lest I wander too nigh,
- For of all that is on or about me, I know,
-
There is nothing that’s pure but the beautiful snow.
- How strange it should be that this beautiful snow
- Should fall on a sinner with nowhere to go!
- How strange it would be, when the night comes again,
- If the snow and the ice struck my desperate brain!
- Fainting,
- Freezing,
- Dying alone!
- Too wicked for prayer, too weak for my moan
- To be heard in the crash of this crazy town.


{% set suppress_feedback = true %} {% extends '_layouts/layout.html' %} {% block page_title %}{% endblock %} {% block body_css_classes %}nhsuk-frontend{% endblock %} {% block content %}
It’s possible you have COVID-19 but you also need help for your other symptoms.
You must tell whoever you speak to that you might have coronavirus and follow their instructions.
This might mean getting tested first, or being seen in a different way than usual.
Urgent treatment centre
Ground Floor
Jubilee Wing
Hemel Hempstead Hospital
Hillfield Road
Hemel Hempstead
HP2 4AD
0.5 miles away
Get directions (opens a new tab or window)
Urgent treatment centres are overseen by GPs. They’re open for at least 12 hours every day. They can diagnose and deal with many of the most common problems people go to A&E for.
Or you can see more services that can help.
What you’ve told us suggests you need to go to an urgent treatment centre to get help.
Ask to see a mental health trained nurse if they have one. Or ask to be referred to a local psychiatry service when you’re seen by the nurse or doctor.
If you haven’t hurt yourself and you’d rather speak to someone instead, NHS urgent mental health helplines are open 24 hours a day. Deaf people can use text relay.
NHS.UK has other sources of help for a mental health crisis, emergency or breakdown. These include free text and listening services, helplines and websites.
If you think you might harm yourself or others, call 999.


Launch
home
Home
log out
log in
operation selection
(if you can't log in,
click here
to continue)
© 2013
home
Operation Selection
log out
log in
Search for an Operation and associated trials:
Oscar's Operation
Trial #1
Marcel's Operation
Trial Corn 42
Some name, yeah
Sandy's Operation
Grow beans
Maybe corn
Anything, really
Eder's Operation
Just a test trial
Brian's Operation
Trial Trial
© 2013
home
Trial Entry for
log out
log in
Strip 1 (product A / factor A)
Measurement #1
Measurement #2
Measurement #3
Measurement #4
Strip 2 (product A / factor B)
Measurement #1
Measurement #2
Measurement #3
Measurement #4
Strip 3 (product B / factor A)
Measurement #1
Measurement #2
Measurement #3
Measurement #4
Strip 4 (product B / factor B)
Measurement #1
Measurement #2
Measurement #3
Measurement #4
© 2013


We are a two members team, in the second year of a Degree in Video Game Design and Development. As a project for the Game development subject we had to create a 2d platformer.
The objective of the game is to finish both maps and collect all the coins you can!
A: Move Left
D: Move Right
Space: Jump
N: Attack
M: Dash
Debug Funcionalities
F1: Start the first level
F2: Start the second level
F3: Restart the current level
F5: Save
F6: Load.
F9: Show the colliders and logic
F10: Activate/Deactivate the god mode
F11: Toggle 30fps/60fps
º: Activate/Deactivate console


username
Famous Pizza
Ready in: 1 hr, 30 min
username1123 This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer. This content is a little bit lo...more
username
Title of Recipe
Ready in: 30 min
username1123 This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer. This content is a little bit lo...more
username
Title of Recipe
Ready in: 30 min
username1123 This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer. This content is a little bit lo...more
username
Title of Recipe
Ready in: 30 min
username1123 This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer. This content is a little bit lo...more


Introduction
In the last few posts, I talked a bit about working with Google Analytics. Google Analytics has a lot of functionality available to users and provides a lot of opportunities to create data based on user visits to the site. After a few basic experiments with the website, I thought it a good opportunity to try something more complicated.
Results of Goal Testing
The original goal I created was to see how much traffic was directed to post1.html. After a week or two of running, the first goal had a been completed 25 times. There were only a few more completions since the previous writing, but a lot of that can be attributed to the fact that nobody really visits the website unless I ask people to do so.
One thing that was worth looking at was the funnel conversion rate. Here, of the 25 sessions visiting the front page (index.html) directly, 10 of them went to post1.html next. It's hard to draw too many conclusions from this, but it suggests that the "featured page" content seems to drive people to go to the page in question.
Creating an Experiment
When I first implemented an Analytics goal, I actually made substantive changes to the website in order to see if I could drive traffic to a specific page. Specifically, I created a rather substantive and graphical "featured page" piece that was meant to push people to a specific page. However, I did this without thinking about it; I just went with something obvious. Having had that display up for a bit, it occurred to me that I didn't really spend much time thinking about whether that code would matter, or, if the funnel I set up was properly tracking what I hoped it would be tracking. This seemed like meaningful setup for a Google Analytics Experiment.
For this test, my basic hypothesis was that having the "featured page" content pushed more users to go to the specific post, post1.html. In the alternative, it did not matter. The hypothesis may seem somewhat obvious; that does not concern me too much. I also believe it will be valuable to have some sense of how big a difference the "featured page" content actually makes.
In order to test the above hypothesis, I created a duplicate copy of the front page that did not have the "featured page" content on it. Within the Google Analytics site, I created the experiment in which every visitor to the website would be directed to one of two pages: the original index.html that contained the "featured page" content, and the alternative index.html that did not.
Results
After approximately one week of running this experiment, there was a reasonable amount of session data to draw initial conclusions. In the first week, there were 50 sessions of which 23 were diverted to the Original page which contained the "featured page" content while 27 were diverted to the Variant which did not contain the content. As the image below indicates, there appears to be a divergence between the convergence rate of the two pages.
As indicated, the page with the "featured page" content yielded a 26% conversion rate while the page without yielded a 11% conversion rate. Unfortunately, both of these numbers are still relatively preliminary and suffer from there not being sufficient data. However, if the trend continues, one could presume that the "featured page" content is successful at driving traffic to the page. That's probably not a surprising conclusion, but it's always nice to have something that affirms my suspicion.
Conclusions
The biggest discovery was the sort of things that Google Analytics lets a webmaster do without a lot of work. Setting up the test is straightforward. Although I probably didn't have enough data to really see how effective the testing could be based on the lack of sufficient data, the whole suite of tools opens up a lot of possibilities for website testing. In the alternative, it does feel a bit discomforting as well; the idea that Google has positioned itself to be a fundamental backbone of the web seems concerning. Although I have no doubt there are other analytics packages available, I feel like most people are probably relying on Google.


This attractive town is about 30nm south of Fiumicino, the port for Rome. It is a popular tourist destination and has a well-preserved old town, the Borgo Medievale. This area has mediaeval streets, small, attractive squares and a 15C Fort.
Position 41° 27'04"N, 012° 39'33"W (marina entrance)
photo from www.marinanettuno.com
The large marina here is composed of several basins. It is well protected by breakwaters.
Contact by VHF prior to entry. Advisable to reserve a berth in advance.
Last updated January 2016.


Bootstrap provides classes for toasts i.e. you can just add .toast
to an element get the basic appearance of a toast, however SEB:s take on toast notifications and their design is a bit simplified and inherits the style from alerts so the bootstrap toast examples need to be altered a bit. Just add .toast
together with one of the following contextual classes.
| Context | Usage | Class name |
|---|---|---|
| Info | Content that holds neutral information that we find useful for users and that we want to inform them about. | .toast-info |
| Success | Should be used as a response to an action or something that is considered to be positive or a success. | .toast-success |
| Warning | Not an error but important information for a user to consider or be aware of. | .toast-warning |
| Danger | Used for errors or when something goes wrong. | .toast-danger |
These toasts will disappear after a set time.


Parallel-port LED driver
The LedActor sends a data byte out the parallel port (/dev/lp1) of the PC which
VSS is running on. It is intended for sending to a particular homebrew
circuit which sends 2+3+3 bits of brightness data to a red, green and blue
LED respectively. It's been tested only under Linux as of 1/5/2000.
Don't create more than one LedActor; it wouldn't make sense, since you
don't have more than one /dev/lp1.
To use the LedActor, load ledlpt.so and create an actor of type LedActor.
LedActor messages
In addition to the messages understood by all actors, the LedActor understands the following message:
- SetBrightness hActor x
- Scale the overall brightness to x: 0 is dark, 1 is full brightness.
- SetHue hActor x
- Set the hue to x. As x varies from 0 to 1,
hue moves smoothly through six regions:
- 0.00 red
- 0.17 red+green
- 0.33 green
- 0.50 green+blue
- 0.67 blue
- 0.83 blue+red
- (1.00 red again, wrapping around)
- SetBlink hActor period dutycycle
- Blink the LED. Alternate its current hue-and-saturation settings
with darkness. A blink happens every period seconds,
and the relative length of the lit portion compared to the length
of the period is dutycycle (in the range 0 to 1).
So if dutycycle is 0, it stays dark no matter what the hue or
brightness or period is.
And if dutycycle is 1, it stays lit no matter what the period is.
If the period is 0 (the default), no blinking happens (the LED
stays on).
If the period is less than 0.05, it is rounded down to 0:
blinking at faster than 20 Hz is doubtfully meaningful.
Examples
LoadDSO ledlpt.so;
rgb = Create LedActor;
- Display a very bright green, followed by a faint purple-blue:
SetHue rgb 0.33;
SetBrightness rgb 1;
sleep 1;
SetHue rgb 0.79;
SetBrightness rgb 0.4;
sleep 1;


“Each nation has its own method of salutation. In Southern Africa it is the custom to rub toes. In Lapland your friend rubs his nose against yours. The Turk folds his arms upon his breast and bends his head very low. The Moors of Morocco have a somewhat startling mode of salutation. They ride at a gallop toward a stranger, as though they would unhorse him, and when close at hand suddenly check their horse and fire a pistol over the person's head. The Egyptian solicitously asks you, ‘How do you perspire?’ and lets his hand fall to the knee. The Chinese bows low and inquires, ‘Have you eaten?’ The Spaniard says, ‘God be with you, sir,’ or, ‘How do you stand?’ And the Neapolitan piously remarks, ‘Grow in holiness'.” — John H Young, Our Deportment


Industry reps announce their choices for the best K-pop song of 2019
by sl278There are many K-pop songs out there that fans consider the best, but industry representatives have released their take on what they believe are the best songs of 2019.
News outlet Joy News 24 ran a survey of 200 of the top industry insiders. Here are the top eight songs with the most votes.
1. “Boy With Luv” - BTS (70 votes)
2. “How Can I Love the Heartbreak, You’re the One I Love” - AKMU (17 votes)
3. “Your Shampoo Scent in the Flowers” - Jang Bum Joon (16 votes)
4. "Dalla Dalla" - ITZY (15 votes)
5. “For Lovers Who Hesitate” - Jannabi (9 votes)
6. “Gotta Go” - Kim Chung Ha (8 votes)
7. “A Poem Titled You” - Taeyeon (6 votes)
8. “We All Lie” - Ha Jin, JTBC’s “SKY Castle” OST (5 votes)
Paul Kim's “So Long (Hotel Del Luna OST)”, “Every day, Every moment", “Traffic Light”, and “Me After You” received 4 votes each.
The songs that received fewer than 4 votes:
Bolbbalgan4’s “Travel”
Bolbbalgan4’s “BOM”
SuperM’s “Jopping”
DAY6’s “Time of Our Life”
Kim Na Young’s “To be Honest”
BTS’s “Persona”
Lim Jae Hyun’s “If one could practice love”
TWICE’s “FANCY”
AOA’s “Egotistic (Queendom version)”
SHAUN’s “Way Back Home”
Rocket Punch’s “BIM BAM BUM”
Zico’s “Human”
Elaine’s “Search”
Heize’s “She’s Fine”
What do you think of these results? What is your favorite K-pop song of 2019?


|
Uncreative Studios
|
Public Member Functions | |
| constructor | Buff (String stat, Integer amount, Integer duration, Boolean isInfinite) |
| String | getStat () |
| Integer | getAmount () |
| Boolean | isInfinite () |
Public Attributes | |
| Integer | duration |
Private Attributes | |
| String | stat |
| Integer | amount |
| Boolean | isInfinite |
Initialises a new buff for some ship. Can be a buff or debuff depending on multiplier.
| Integer com.uncreative.game.Buff.getAmount | ( | ) |
Returns buff multiplier.
| String com.uncreative.game.Buff.getStat | ( | ) |
Returns statistic to buff.
| Boolean com.uncreative.game.Buff.isInfinite | ( | ) |
Returns whether or not the buff is infinite.
|
private |
Multiplier applied to respective statistic.
| Integer com.uncreative.game.Buff.duration |
Amount of ticks that the buff can be used for. Ignored if ifInfinite is true.
|
private |
Whether or not the buff has an infinite amount of uses.
|
private |
Statistic that the buff is to be applied to (e.g. damage/defence).


A shimmering green arrow streaks toward a target within range and bursts in a spray of acid. Make a ranged spell attack against the target. On a hit, the target takes 4d4 acid damage immediately and 2d4 acid damage at the end of its next turn. On a miss, the arrow splashes the target with acid for half as much of the initial damage and no damage at the end of its next turn.
At Higher Levels. When you cast this spell using a spell slot of 3rd level or higher, the damage (both initial and later) increases by 1d4 for each slot level above 2nd.


|
Category |
Description |
|
Coverages |
This data
element includes information on the spatial extent of the coverage (.e.g.,
national, district). |
|
Comments |
This field
includes any relevant narrative information related to the coverage |
|
Resolution |
The pixel
size of the satellite imagery used for mapping. |
|
Minimum
mapping unit |
The minimum
size area of land cover (e.g., 1 hectare) that appears on the maps. |
|
Map
date |
The date the
source data was collected. |
|
Image
date |
The date the
source data was collected |
|
Image
type |
The type of
image used to create the coverage. |
|
Map
scale |
Scale of the
map or coverages developed |
|
Photo
scale |
Scale of the
airphotos used to create the coverage. |
|
Coordinate
system |
The specific
system used to reference the coverage to a geographic location. |
|
Projection |
The specific
projection used to display the data coverage. |
|
Classification
system |
The classification
system used in preparing land use/land cover maps or marine classes. |
|
GIS |
The GIS system
the data coverage is provided. |
|
Data
Type |
The data encoding
format of the coverage |
|
Next
scheduled update |
The date for
the next planned update of the data coverage (Full Tetum Language with AudioVisual File Support Planned) |
|
Availability |
This Data
Field contains Relevant Information on the Type of Media, Cost, and
Where Available for the Data (CAMSTL Server Drive No 014 | Under Directory 014 | National Boundaries Profile | Raster and Vector Data | Elevation and Waterbodies |
|
Contact
Name |
T
|
|
Communication
|
CAMSTL - SERVER LOCALHOST IN DILI
|


Environment & Users Configuration
Lorem ipsum...
Environments
Credentials
Preferences
Environments management
Add new env.
Modify env.
Delete env.
Create a new environment
Environment:
Add this environment
Modify an existing environment
Environments:
(Please select an environment to modify)
Please, modify the new environment name:
Modify this environment
Delete an existing environment
Environments:
(Please select an environment to delete)
Delete this environment
User credentials management
Add new user
Modify user
Delete user
Create a new user entry
Environment *
(Please select an environment)
User *
Password *
User selector
Password selector
Description
Add these credentials
Modify an existing user credentials
Environment
(Please select an environment)
User
(Please select an user)
User *
Password *
User selector
Password selector
Description
Modify these credentials
Delete an existing credentials
Environment
(Please select an environment)
User
(Please select an user)
Delete these credentials
Preferences


| Name | Geostationary Satellite View |
| Alias | GEOS |
| Alias | Normalized Geostationary Projection |
| EPSG Code | (none) |
| GeoTIFF Code | |
| OGC WKT Name | GEOS |
| Supported By | PROJ.4, OGC WKT |
| Name | EPSG # | GeoTIFF ID | OGC WKT | Units | Notes |
|---|---|---|---|---|---|
| Longitude of natural origin | 2 | NatOriginLong | central_meridian | Angular | |
| Satellite Height | ? | ? | satellite_height | Linear | |
| False Easting | 6 | FalseEasting | false_easting | Linear | |
| False Northing | 7 | FalseNorthing | false_northing | Linear |
The document suggests a spheroid with a major axis of 6378169.0m and a semi minor axis of 6356583.8m.
The document describes the satellite height as distance from the satellite to the center of earth, but for various reasons I have chosen to specify it as height above the ellipsoid in the WKT (and in PROJ.4). The document suggests a height of 42164000m which on the suggested ellipsoid translates to 35785831m above the ellipsoid.
+proj=geos +lon_0=Central Meridian +h=Satellite Height +x_0=False Easting +y_0=False Northing


| Modifier and Type | Method and Description |
|---|---|
LiveData<Player> |
findById(long id)
Method to select a
Player based off of the id generated for them in the database. |
Player |
get(String authenticationId)
Method to get a
Player from the database, based off of a unique authenticaiton id created during GoogleSignInService |
LiveData<List<Player>> |
getAll()
Currently unused method to get all
Player |
long |
insert(Player player)
Method designed to insert a single
Player into the database. |
int |
update(Player... players)
Method to update the data for a
Player entity already in the database. |
Player get(String authenticationId)
Player
from the database, based off of a unique authenticaiton id created during GoogleSignInService
authenticationId
- authentication id created during GoogleSignInService
assigned by
Google, a unique id.Player
associated to the unique idLiveData<Player> findById(long id)
Player
based off of the id generated for them in the database.


15-Year-Old Charged with Double Murder in Milton Keynes, UK - Police
A 15-year-old boy has been charged with the recent murder of two people in the town of Milton Keynes in Buckinghamshire, England, the Thames Valley Police reported on Thursday.
The child has been charged with two counts of murder and two counts of attempted murder.
TVP also said they arrested a 53-year-old man and a 40-year-old woman on Thursday in connection with the double murder.
On 19 October, 17-year-olds Dom Ansah and Ben Gillham-Rice were stabbed, one in the chest and the other in the back, at a birthday party in Archford Croft, Emerson Valley at around midnight. Two more people were injured that day and taken to hospital.
There are also other people involved in the case, including a man in his twenties that was arrested on suspicion of conspiracy to murder and released under investigation.
The police believe it was a deliberate assault.