Safety Responsibilities and Platform Intitiatives
Obligations
Schools must respond to sexual violence connected to the school’s education programs and activities, including academic, educational, extracurricular, and athletic activities.
These incidents can take place in an off-campus residence, at an off-campus class, at fraternity or sorority houses, during athletic team travel, or at events for school clubs that occur off-campus.
If you are a Responsible Employee or CSA, this is a reportable incident. Follow your institution's reporting policy.
Source: HAVEN for Faculty and Staff
Accessed October 31, 2017
Some schools also designate anonymous reporters, such as non-professional counselors and advocates, who must report offenses but do not need to include identifying information
Source: HAVEN for Faculty and Staff
Accessed October 31, 2017
The Online Student Support Portal "builds-in" methods by which anonymous reporting may take place to official channels
The Router
Live Chat is available on scheduled availability. When a router is not on shift, automated messages inform the user that the question will be reviewed within a certain amount of time. All chats are reviewed to ensure that they receive proper handling, and any that are deemed sensitive may be flagged.
Real-time Notification System -- SMS based, which has proven to be robust in times of emergencies, and email based.
Built-in, Context-Sensitive Help
Platform Initiative: Review chats to ensure they get to the proper authority.
Not only does the platform make it easy to direct chat conversations to authoritative help, the platform has the ability to "archive" certain chat records for authorities's use.
Platform Initiative: Geolocation
Although meant for mobile phone use, on certain browsers geolocation is enabled.


Located on the Pacific coast about 3 miles north of the town of Jaco. It is a major destination for sports fishermen as well as a popular tourist destination.
Position 09° 38'53"N, 84° 39'48"W (marina)
There are no clearance facilities here.
It is necessary to have cleared into Costa Rica before visiting this port. See Cost Rica main ports for a list of clearance ports.
Last updated March 2016.
This marina will not admit sailing vessels unless you have already checked into Costa Rica. It is primarily a sport fishing marina and not cruiser-friendly (see comments from cruisers below).
Last updated September 2016.


Tutorial : Camera Shake
Objects: VCameraShakeTrack, VCameraShakeEvent
The Camera Shake Track must be added to a Camera Group and will only be used while the parent Group is the Active Camera Group. The Active Camera Group is set by using a Director Group and Track, for more information on their use click here.
A Camera Shake Event will start shaking the camera upon triggering. The strength of the Event is defined by the "Falloff", "Frequency" and "Amplitude" properties. The duration of the shake is given by the duration of the Event. If the parent camera ceases to be the sequences Active Camera Group, then the shake Event will stop playing.
How to Use:
To use a Camera Shake Event, you must first add a VCameraShakeTrack to your sequence's Director Group. If you are unsure of how to create or validate a Group, click here.
Right-Click on the Group, go to "Add Track" and select "Add Camera Shake Track".
Right-Click on the Track and select "Add Event".
Select the newly created Event. The Property List window will refresh and inspect the Event. Change any of the properties here to alter the strength, direction and duration of the Camera Shake event.


The service is initialized at an error state to show off the retry functionality.
{{ serviceResponse | json }}


GymBuddy
Dashboard
GymBuddy
Last Workout
Continue Workout
New Workout
Create Your First Workout
Workout Added Successfully!


|
SideCar
|
Container of sortable keys that maintains index associations with the keys. More...
#include </Users/howes/src/sidecar/Utils/OrderedIndex.h>
Data Structures | |
| struct | Entry |
Public Types | |
| using | value_type = T |
| using | reference = T & |
| using | const_reference = const T & |
| using | Container = std::vector< Entry > |
| using | size_type = typename Container::size_type |
| using | iterator = typename Container::iterator |
| using | const_iterator = typename Container::const_iterator |
| using | const_reverse_iterator = typename Container::const_reverse_iterator |
Container of sortable keys that maintains index associations with the keys.
Useful when combined with a std::vector of values. The keys are stored in this container, and values in the std::vector. To find a keyed value, invoke the find() method to obtain an iterator to an OrderedIndex::Entry object that contains the key and an index. The index value can then be used to obtain a value from a std::vector.
Definition at line 30 of file OrderedIndex.h.


Andy Goode can't resist online dig after Saracens humbling
by Ian CameronFormer England flyhalf turned pundit Andy Goode couldn’t resist delivering a dig into Saracens after their humbling at the hands of Racing 92 in Paris.
Mark McCall’s men were easily beaten by 30 points to 10 at the Paris La Défense Arena by their hosts, who outgunned a relatively inexperienced Saracens team.
Racing pulled away before grabbing a late bonus point from the men in black and red, whose domestic issues regarding their salary cap woes apparently coming home to roost.
RugbyPass columnist Goode was in no mood for mercy on Twitter, where he whaled into his former club.
“So Saracens are currently finding out what it’s like in the Champions Cup for the other Premiership Rugby clubs who stick to the wage cap.”
Goode has been a vocal critic of Sarries and was clearly reveling in their struggles.
The London club are set to drop their planned appeal against a £5.4million fine and a 35-point penalty for a breach of the salary cap, the PA news agency understands.
Goode wrote: “News is Saracens won’t review the £5.36 million fine & 35 point deduction, if true then they are clearly guilty as charged & the next question will be what about this season as there’s no way they can be under the Premiership Rugby salary cap if they haven’t been previously!”
The back-to-back Premiership champions and reigning European champions had initially announced their intention to appeal against what they deemed to be “heavy-handed” punishments that were further described by club chairman Nigel Wray as “absolutely devastating”.
But ahead of Monday’s deadline to officially serve notice of appeal, Saracens are now poised to confirm they will not be doing so.
– Additional reporting PA
Sonny Bill Williams speaks at a press conference alongside Toronto Wolfpack head coach Brian McDermott and chief executive Bob Hunter following his move to the Super League newcomers.


[1] like keynote just fine but cannot save in program readable by both Numbers and full screen which i use every day make this a ton of great product.
[2] like keynote just fine but cannot save in program readable by both Numbers and full screen which i use every day make this a ton of great program.


{% include 'photo-section.html' %}
{% include 'info-section.html' %}
{% include 'contacts-section.html' %}
{% include 'links-section.html' %}
{% include 'languages-section.html' %}
{% include 'general-skills-section.html' %}
{% include 'technical-skills-section.html' %}
{% include 'profile-section.html' %}
{% include 'employment-history-section.html' %}
{% include 'education-section.html' %}
{% include 'courses-section.html' %}
{% include 'projects-section.html' %}


I'm a scientific researcher in the field of statistical physics. I use computer simulations and theoretical techniques to model a range of soft matter systems, such as colloidal suspensions, polymer networks and active particles.
I am interested in questions such as: how do elastic
networks respond to being stretched, compressed or sheared?
How can we tune this response and potentially build novel
materials?
A great deal of research has focused on the motion
of self-propelled active particles. When placed in a fluid
they will collide with the fluid molecules, creating a
hydrodynamic flow-field. My research focuses on how these
flow-fields then affect the motion of a passive
particle.
How does the shape of the particles in a colloidal
suspension affect its phase behaviour? How about their
elastic and structural properties?


EVO HTML to PDF Converter allows you to split a PDF document into a set of smaller PDF documents. The resulted PDF documents can be saved to files, streams or memory buffers.
The following options are available in this demo:
-
The PDF Document to Split. A link to the PDF file to split


I'm off to just south of the tornado-torn south, specifically Rocktown in Lafayette Georgia, as of Friday at noon. For a well-overdue, so-overdue-I-can't-add-2-+-2, vacation.
In the meantime, lazyweb the way into making the AppleTV a mythtv frontend (I gave up thanks to life-restrictions, but dude - release early, release often — not just-one-more-tweak-it's-a-comin'-!-my-ass), read my rss feeds for me, I think at least one farcebook connection still needs to have a baby, bonne chance avec les features, guten tag, figure out your head from your ass, and sayonara! Y no tengo tiempo para comer carne.
(I'm off to Spain for another 6 weeks, a week after I'm back)
Next weeks goals are planning vegetarian campfood, staying warm enough to be happy, reading some sci-fi, sending a soft V8 (but I'll take a fun V6), and maybe not going clear through to the dermis on all my fingertips this time.
Frankly, if Georgia remembers our visit as a passing tornado, I'll be pleased with the climbing vacation.
About this entry
You"re currently reading "Fuck it, j2 out.," an entry on a crick in the net
- Published:
- 02.06.08 / 11pm
- Category:
- Circular File, Gravity


We are a team that consists of people of all ages who are passionate
about books and world of reading !
We are consistently to add more and more books to our bookshop because
we would like to have a huge number of books for all reading's lovers.
Book for all is a great choice for people who like to
get their
favorite books online without leaving the comfort of their homes!
What is special about ' Books for all ' online bookshop?
Well, Books for all provides visitors a big demanded books collection
and
if you are excited to get a look at our collection of books you can
click on this
link
Want to get notificated about all our new books and new discounts!?
No problem.
Subscibe To Our NewsLetter
Join 100000+ subscribers & get last information about our activities


Reference this page to see what structure upgrades happen between release changes. Manual steps indicate that a coder on the project has to do these things in order to bring the project up-to-date with the build process.
Before you upgrade, you need to commit so that any unwanted changes can be fixed because some manual stuff is going to be needed to be done. If you get an error ENOTEMPTY when you run yo scaffi:update, delete the folder it's complaining about and run yo scaffi:update again.
Make sure to uninstall / reinstall generator-scaffi -g; Make sure you delete the jspm_packages and node_modules in the src/ui folder.
After you've run the update command and done all the manual changes belog and go to run 'yo scaffi:start web', you might run into things like Error: Cannot find module 'angular-bootstrap' from 'C:\Users\...' That means you have to switch out the import name with what's now in your package.json. For this instance, the name has changed to angular-ui-bootstrap.
"devDependencies": { "chai": "^3.4.1", "chai-as-promised": "^5.1.0", "fs": "0.0.2", "mocha": "^2.3.4", "moment": "2.10.6", "pathmodify": "^0.5.0", "phantomjs": "latest", "pre-commit": "1.1.1", "protractor": "2.5.1" },
dependencies: { "angular": "^1.5.8", "angular-animate": "^1.5.5", "angular-aria": "^1.5.5", "angular-breadcrumb": "0.4.1", "angular-loading-bar": "0.9.0", "angular-messages": "^1.5.5", "angular-sanitize": "^1.5.5", "angular-ui-bootstrap": "2.0.0", "angular-ui-router": "^0.2.18", "font-awesome": "4.4.0", "ionic-angular": "^1.3.1", "moment": "2.10.6", "request-promise": "^1.0.2", "lodash": "^3.10.1", "scaffi-ui-core": "^0.1.0" }
{ "config": { "environment": "localhost", "domain": "http://localhost" } }
import 'ionic-angular/release/js/ionic.js'; import 'ionic-angular/release/js/ionic-angular.js';
###initialize if(ScaffiUi.config.isMobilePlatform()){ this.addRequires(['ionic']); this.getApp().config(($ionicConfigProvider)=>{ $ionicConfigProvider.views.maxCache(0); $ionicConfigProvider.tabs.position("bottom"); }); this.getApp().run(($ionicPlatform) =>{ $ionicPlatform.ready(function() { // Hide the accessory bar by default (remove this to show the accessory bar above the keyboard // for form inputs) if (window.cordova && window.cordova.plugins && window.cordova.plugins.Keyboard) { cordova.plugins.Keyboard.hideKeyboardAccessoryBar(true); cordova.plugins.Keyboard.disableScroll(true); } if (window.StatusBar) { // org.apache.cordova.statusbar required StatusBar.styleDefault(); } }); }); this.getApp().config( ($urlRouterProvider)=>{ $urlRouterProvider.otherwise('/'); }); this.getApp().run( ($timeout, $state)=>{ // $timeout(function() { // $state.go('app.index'); // }, 0); }); }
None
None


{# Include the sidebar on the left of main page if chosen in the settings #}
{% if sidebar_settings.main_position == 1 %}
{% include 'sidebar.html' %}
{% endif %}
{# this is the div for the content of the blog posts #}
{# if statement below will make the blog post the full page if sidebar layout option is "None" #}
{% include 'post_on_main.html' %}
{# Include the sidebar on the right of main page if chosen in the settings #}
{% if sidebar_settings.main_position == 2 %}
{% include 'sidebar.html' %}
{% endif %}


Thank you for purchasing my theme.
First please check product
documentation
Support forum
support.templines.com/
Templines Team


AlzheimersAI
Home
NeuralZ
About
Login
Stats
Profile
Sign Out
Logout
Are you sure you want to log out?


Please Login
Account locked.
Invalid username and password.
You have been logged out.
Username
Password
Log in
Subscribe


Overlays
Markers, Windows, Options
Markers Array Method
Polylines and Polygons
Layers and Services
Steetview
Elevation Service
Services
Layers
Panoramio Layer
Utilities
Info Utility
Geocoding
Other
Basic Template
Styled Map
Charts
Bounds, Marker on click
put whatever functionality on it


API Reference¶
-
hubblepy.api.
news
(page=None, return_type='json')¶ Returns metadata including the id, name and url of published releases produced by the Office of Public Outreach of the Space Telescope Science Institute. Each result set (page) contains 25 items (if available).
Parameters: - page (list, tuple, str, int, or None) – The page number of the published releases to return. Can be a list or tuple of ints, a str or int, or None. ‘all’ returns all pages.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: List of results.
Return type: list
Examples
>>> p1 = hubblepy.news() [{'name': 'Hubble Uncovers Never Before Seen Features Around a Neutron Star', 'news_id': '2018-43', 'url': 'http://hubblesite.org/news_release/news/2018-43'}, {'name': 'Hubble Goes Wide to Seek Out Far-Flung Galaxies', 'news_id': '2018-39', 'url': 'http://hubblesite.org/news_release/news/2018-39'}, {'name': "Success in Critical Communications Tests for NASA's James Webb Space Telescope", 'news_id': '2018-31', 'url': 'http://webbtelescope.org/articles/2018-31'}, {'name': 'Retiring Hubble Visualization Expert Blended the Best of Science and Art', 'news_id': '2018-41', ... >>> p2 = hubblepy.news(4) [{'name': "Space Telescope Science Institute to Host Data from World's Largest Digital Sky Survey", 'news_id': '2016-41', 'url': 'http://hubblesite.org/news_release/news/2016-41'}, {'name': 'STScI Astronomers Nancy Levenson and David Soderblom Elected AAAS Fellows', 'news_id': '2016-46', 'url': 'http://hubblesite.org/news_release/news/2016-46'}, {'name': 'Dr. Laurent Pueyo Receives 2016 Outstanding Young Scientist Award', 'news_id': '2016-40', 'url': 'http://hubblesite.org/news_release/news/2016-40'}, {'name': "A Death Star's Ghostly Glow", 'news_id': '2016-37', ...]
Notes
The news releases are sorted by publication date and time. All the returned results can also be found on the HubbleSite’s news center, http://hubblesite.org/news.
-
hubblepy.api.
news_release
(which, return_type='json')¶ Returns more detailed metadata including the abstract, image thumbnails, and more, of a published release.
Parameters: - which (list, tuple, str) – Specifies which news release content to return. Possible values include ‘last’ for the last news release published, ‘first’, which returns the first published release, and the release identifier in the format YYYY-NN.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: The returned results.
Return type: dict or list
Examples
>>> hubblepy.news_release(which='last') {'abstract': 'Imagine crushing more than 50,000 aircraft carriers into the size of a baseball. This describes neutron stars. They are among the strangest objects in the universe. Neutron stars are a case of extreme physics produced by the unforgiving force of gravity. The entire core of an exploded star has been squeezed into a solid ball of neutrons with the density of an atom’s nucleus. Neutron stars spin as fast as a blender on puree. Some spit out death-star beams of intense radiation — like interstellar lighthouses. These are called pulsars.\r\n\r\nThese beams are normally seen in X-rays, gamma-rays, and radio waves. But astronomers used Hubble\'s near-infrared (IR) vision to look at a nearby neutron star cataloged RX J0806.4-4123. They were surprised to see a gush of IR light coming from a region around the neutron star. That infrared light might come from a circumstellar disk 18 billion miles across. Another idea is that a wind of subatomic particles from the pulsar’s magnetic field is slamming into interstellar gas. Hubble\'s IR vision opens a new window into understanding how these "infernal machines" work.\r\n', 'credits': 'NASA, ESA, and B. Posselt (Pennsylania State University)', 'keystone_image_1x': 'https://media.stsci.edu/uploads/story/display_image/1243/low_STSCI-H-p1843a-k-1340x520.png', 'keystone_image_2x': 'https://media.stsci.edu/uploads/story/display_image/1243/STSCI-H-p1843a-k-1340x520.png', 'mission': 'hubble', 'name': 'Hubble Uncovers Never Before Seen Features Around a Neutron Star', 'news_id': '2018-43', 'publication': '2018-09-17T11:00:00.000-04:00', 'release_images': [4231, 4232, 4233], 'thumbnail': 'https://media.stsci.edu/uploads/story/thumbnail/1243/low_STSCI-H-p1843a-t-400x400.png', 'thumbnail_1x': 'https://media.stsci.edu/uploads/story/thumbnail/1243/low_STSCI-H-p1843a-t-400x400.png', 'thumbnail_2x': 'https://media.stsci.edu/uploads/story/thumbnail/1243/STSCI-H-p1843a-t-400x400.png', 'thumbnail_retina': 'https://media.stsci.edu/uploads/story/thumbnail/1243/STSCI-H-p1843a-t-400x400.png', 'url': 'http://hubblesite.org/news_release/news/2018-43'} >>> hubblepy.news_release(which=['last', 'first', '2016-24']) [{'abstract': 'Imagine crushing more than 50,000 aircraft carriers into the size of a baseball. This describes neutron stars. They are among the strangest objects in the universe. Neutron stars are a case of extreme physics produced by the unforgiving force of gravity. The entire core of an exploded star has been squeezed into a solid ball of neutrons with the density of an atom’s nucleus. Neutron stars spin as fast as a blender on puree. Some spit out death-star beams of intense radiation — like interstellar lighthouses. These are called pulsars.\r\n\r\nThese beams are normally seen in X-rays, gamma-rays, and radio waves. But astronomers used Hubble\'s near-infrared (IR) vision to look at a nearby neutron star cataloged RX J0806.4-4123. They were surprised to see a gush of IR light coming from a region around the neutron star. That infrared light might come from a circumstellar disk 18 billion miles across. Another idea is that a wind of subatomic particles from the pulsar’s magnetic field is slamming into interstellar gas. Hubble\'s IR vision opens a new window into understanding how these "infernal machines" work.\r\n', 'credits': 'NASA, ESA, and B. Posselt (Pennsylania State University)', 'keystone_image_1x': 'https://media.stsci.edu/uploads/story/display_image/1243/low_STSCI-H-p1843a-k-1340x520.png', 'keystone_image_2x': 'https://media.stsci.edu/uploads/story/display_image/1243/STSCI-H-p1843a-k-1340x520.png', 'mission': 'hubble', 'name': 'Hubble Uncovers Never Before Seen Features Around a Neutron Star', 'news_id': '2018-43', 'publication': '2018-09-17T11:00:00.000-04:00', 'release_images': [4231, 4232, 4233], 'thumbnail': 'https://media.stsci.edu/uploads/story/thumbnail/1243/low_STSCI-H-p1843a-t-400x400.png', 'thumbnail_1x': 'https://media.stsci.edu/uploads/story/thumbnail/1243/low_STSCI-H-p1843a-t-400x400.png', 'thumbnail_2x': 'https://media.stsci.edu/uploads/story/thumbnail/1243/STSCI-H-p1843a-t-400x400.png', 'thumbnail_retina': 'https://media.stsci.edu/uploads/story/thumbnail/1243/STSCI-H-p1843a-t-400x400.png', 'url': 'http://hubblesite.org/news_release/news/2018-43'}, {'abstract': "On the right is part of the first image taken with NASA's Hubble Space Telescope's (HST) Wide Field/Planetary Camera. It is shown with a ground-based picture from a Las Campanas, Chile, observatory of the same region of the sky. The Las Campanas picture was taken with a 100-inch telescope and it is typical of high-quality pictures obtained from the ground. All objects seen are stars within the Milky Way galaxy.", 'credits': 'Credit: NASA, ESA, and STScI', 'mission': 'hubble', 'name': 'HST WC/PC First Light Image', 'news_id': '1990-04', 'publication': '1990-05-20T00:00:00.000-04:00', 'release_images': [1], 'thumbnail': 'https://media.stsci.edu/uploads/story/thumbnail/1/low_small_web.jpg', 'thumbnail_1x': 'https://media.stsci.edu/uploads/story/thumbnail/1/low_small_web.jpg', 'thumbnail_2x': 'https://media.stsci.edu/uploads/story/thumbnail/1/small_web.jpg', 'thumbnail_retina': 'https://media.stsci.edu/uploads/story/thumbnail/1/small_web.jpg', 'url': 'http://hubblesite.org/news_release/news/1990-04'}, {'abstract': "Astronomers are using NASA's Hubble Space Telescope to study auroras — stunning light shows in a planet's atmosphere — on the poles of the largest planet in the solar system, Jupiter. The auroras were photographed during a series of Hubble Space Telescope Imaging Spectrograph far-ultraviolet-light observations taking place as NASA's Juno spacecraft approaches and enters into orbit around Jupiter. The aim of the program is to determine how Jupiter's auroras respond to changing conditions in the solar wind, a stream of charged particles emitted from the sun. Auroras are formed when charged particles in the space surrounding the planet are accelerated to high energies along the planet's magnetic field. When the particles hit the atmosphere near the magnetic poles, they cause it to glow like gases in a fluorescent light fixture. Jupiter's magnetosphere is 20,000 times stronger than Earth's. These observations will reveal how the solar system's largest and most powerful magnetosphere behaves.\r\n\r\nThe full-color disk of Jupiter in this image was separately photographed at a different time by Hubble's Outer Planet Atmospheres Legacy (OPAL) program, a long-term Hubble project that annually captures global maps of the outer planets.", 'credits': 'Credit: NASA, ESA, and J. Nichols (University of Leicester)\r\n\r\nAcknowledgment: A. Simon (NASA/GSFC) and the OPAL team', 'keystone_image_1x': 'https://media.stsci.edu/uploads/story/display_image/1144/low_keystone.png', 'keystone_image_2x': 'https://media.stsci.edu/uploads/story/display_image/1144/keystone.png', 'mission': 'hubble', 'name': "Hubble Captures Vivid Auroras in Jupiter's Atmosphere", 'news_id': '2016-24', 'publication': '2016-06-30T10:00:00.000-04:00', 'release_images': [3756, 3758, 3757], 'release_videos': [865, 867, 866, 868], 'thumbnail': 'https://media.stsci.edu/uploads/story/thumbnail/1144/low_web.jpg', 'thumbnail_1x': 'https://media.stsci.edu/uploads/story/thumbnail/1144/low_web.jpg', 'thumbnail_2x': 'https://media.stsci.edu/uploads/story/thumbnail/1144/web.jpg', 'thumbnail_retina': 'https://media.stsci.edu/uploads/story/thumbnail/1144/web.jpg', 'url': 'http://hubblesite.org/news_release/news/2016-24'}]
-
hubblepy.api.
image_collections
(page=None, collection_name=None, return_type='json')¶ Returns metadata including the id, name, name of the associated news release, collection and mission of images from different collections available on the HubbleSite.
Parameters: - page (list, tuple, str, int, or None) – The page number of the published images to return. Can be a list or tuple of ints, a str or int, or None. ‘all’ returns all pages.
- collection_name (list, str, or None) – The name of the collection to return images. Collections are sets of images such as ‘news’, ‘spacecraft’, etc. If ‘all’, returns all images from all collections.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: List of results
Return type: list
Examples
>>> hubblepy.image_collections(1, 'spacecraft') [{'id': 3814, 'name': 'Grappling Hubble (2009)'}, {'id': 3813, 'name': 'Bidding Hubble Farewell (2009)'}, {'id': 3812, 'name': 'Hubble From Behind (2009)'}, {'id': 3811, 'name': 'Installing Wide Field Camera 3 (2009)'}, {'id': 3810, 'name': 'Final Release Over Earth (2009)'}, {'id': 3809, 'name': 'Reflecting on Work (2009)'}, {'id': 3808, 'name': "In a Day's Work (2009)"}, {'id': 3807, 'name': 'Going Up? (2009)'}, {'id': 3806, 'name': 'Getting in Position (2009)'}, {'id': 3805, 'name': 'Hanging Out With Hubble (2009)'}, {'id': 3804, 'name': "Lifting Hubble from Atlantis' Cargo Bay (2009)"}, {'id': 3836, 'name': 'Hubble Control Center, Goddard Space Flight Center (1999)'}, {'id': 3835, 'name': 'Working at the Hubble Control Center, Space Telescope Science Institute (2005)'}, {'id': 3834, 'name': 'Hubble in Flight (1997) '}, {'id': 3833, 'name': "Hubble Restored: The Telescope's Latest Look (2002)"}, {'id': 3832, 'name': 'Hubble Floating Free (2002)'}, {'id': 3831, 'name': "Hubble Against Earth's Horizon (1997)"}, {'id': 3830, 'name': 'Repairing Hubble (1997)'}, {'id': 3829, 'name': 'Camera Crew: Taking Pictures of the Mission (1997)'}, {'id': 3828, 'name': 'Hubble Docked with the Shuttle Endeavor (1993)'}, {'id': 3827, 'name': 'Hubble Docked with Discovery (1999)'}, {'id': 3826, 'name': 'Giving Guidance: Replacing the Fine Guidance Sensors (1997)'}, {'id': 3825, 'name': 'Cast-off: Releasing a Solar Array (1993)'}, {'id': 3824, 'name': 'Out with the Old: Replacing the High Resolution Spectrograph (1997)'}, {'id': 3823, 'name': 'A Second Look: Replacing the Wide Field and Planetary Camera (1993)'}]
-
hubblepy.api.
images
(image_id, return_type='json')¶ Returns more specific metadata of available images including the description, credits, the location of the image files and more.
Parameters: - image_id (list, tuple, str, int) – A list or tuple of str or int representing the image ids to return.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: If only one image_id is passed, a dictionary of the results is returned. Otherwise, a list of dictionaries containing the results is returned.
Return type: dict or list
Examples
>>> hubblepy.images(3823) {'collection': 'spacecraft', 'credits': 'NASA', 'description': "Astronauts remove the Wide Field and Planetary Camera to replace it with its more powerful successor, Wide Field and Planetary Camera 2, during Hubble’s first servicing mission in 1993. The camera, shaped something like a grand piano, weighs 610 pounds (277 kg) on Earth, but nothing in space. It can detect stars a billion times fainter than the ones we can see with our eyes. Most of Hubble's most popular pictures have been taken with this second camera.", 'image_files': [{'file_size': 112455, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29327/STScI-H-spacecraft15-title.pdf', 'height': 612, 'width': 792}, {'file_size': 335340, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29324/STScI-H-spacecraft15-3000x2016.jpg', 'height': 2016, 'width': 3000}, {'file_size': 18164836, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29325/STScI-H-spacecraft15-3000x2016.tif', 'height': 2016, 'width': 3000}, {'file_size': 619187, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29326/STScI-H-spacecraft15-title-3000x2400.jpg', 'height': 2400, 'width': 3000}], 'mission': 'hubble', 'name': 'A Second Look: Replacing the Wide Field and Planetary Camera (1993)'} >>> hubblepy.images([3823, 3834]) [{'collection': 'spacecraft', 'credits': 'NASA', 'description': "Astronauts remove the Wide Field and Planetary Camera to replace it with its more powerful successor, Wide Field and Planetary Camera 2, during Hubble’s first servicing mission in 1993. The camera, shaped something like a grand piano, weighs 610 pounds (277 kg) on Earth, but nothing in space. It can detect stars a billion times fainter than the ones we can see with our eyes. Most of Hubble's most popular pictures have been taken with this second camera.", 'image_files': [{'file_size': 112455, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29327/STScI-H-spacecraft15-title.pdf', 'height': 612, 'width': 792}, {'file_size': 335340, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29324/STScI-H-spacecraft15-3000x2016.jpg', 'height': 2016, 'width': 3000}, {'file_size': 18164836, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29325/STScI-H-spacecraft15-3000x2016.tif', 'height': 2016, 'width': 3000}, {'file_size': 619187, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29326/STScI-H-spacecraft15-title-3000x2400.jpg', 'height': 2400, 'width': 3000}], 'mission': 'hubble', 'name': 'A Second Look: Replacing the Wide Field and Planetary Camera (1993)'}, {'collection': 'spacecraft', 'credits': 'NASA', 'description': "The Hubble Space Telescope drifts through space in this picture, taken by Space Shuttle Discovery during Hubble's second servicing mission in 1997. The 10-foot aperture door, open to admit light, closes to block out space debris. The observatory's solar panels and foil-like thermal blankets are clearly visible. The solar panels provide power, while the thermal blankets protect Hubble from the extreme temperatures of space.", 'image_files': [{'file_size': 80695, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29371/STScI-H-spacecraft03-title.pdf', 'height': 612, 'width': 792}, {'file_size': 1186774, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29368/STScI-H-spacecraft03-1500x1500.jpg', 'height': 1500, 'width': 1500}, {'file_size': 6771696, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29369/STScI-H-spacecraft03-1500x1500.tif', 'height': 1500, 'width': 1500}, {'file_size': 649084, 'file_url': 'https://media.stsci.edu/uploads/image_file/image_attachment/29370/STScI-H-spacecraft03-title-3000x2400.jpg', 'height': 2400, 'width': 3000}], 'mission': 'hubble', 'name': 'Hubble in Flight (1997) '}]
-
hubblepy.api.
video_collections
(page=None, collection_name=None, return_type='json')¶ Returns metadata of published videos available on the HubbleSite including the video id, name, image, and the associated collection and mission.
Parameters: - page (list, tuple, str, int, or None) – The page number of the published videos to return. Can be a list or tuple of ints, a str or int, or None. ‘all’ returns all pages.
- collection_name (list, str, or None) – The name of the collection to return. Collections are sets of videos such as ‘news’, ‘spacecraft’, etc. If ‘all’, returns all images from all collections.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: List of results.
Return type: list
Examples
>>> hubblepy.video_collections(1, 'space') [{'id': 1046, 'image': 'https://media.stsci.edu/uploads/video/image_attachment/1046/thumb_low_STScI-H-MWC_t420x236.png', 'name': 'Milky Way Center in Multiple Wavelengths'}, {'id': 1141, 'image': 'https://media.stsci.edu/uploads/video/image_attachment/1141/thumb_low_arp273-example_frame-1920x1080.jpg', 'name': 'A Rose of Galaxies: Interacting Galaxies Arp 273'}, {'id': 1155, 'image': 'https://media.stsci.edu/uploads/video/image_attachment/1155/thumb_low_orion_vis_dome-example_frame-1920x1080.png', 'name': 'Flight Through the Orion Nebula in Visible Light - Dome Version'}, ...]
-
hubblepy.api.
videos
(video_id, return_type='json')¶ Returns more specific metadata and information on published videos available on the HubbleSite.
Parameters: - video_id (list, tuple, int or str) – The ID of the video to return. Can be a list or tuple of ints or strings, or just a single int or str.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: If only one video ID is passed, a dictionary of the metadata is returned. Otherwise, a list of dictionaries is returned.
Return type: dict or list
Examples
>>> hubblepy.videos(1155) {'collection': 'science', 'credits': 'Credits: NASA, ESA, F. Summers, G. Bacon, Z. Levay, J. DePasquale, L. Hustak, L. Frattare, and M. Robberto (STScI)\r\n\r\nAcknowledgement: R. Gendler\r\n\r\nMusic: “Dvorak – Serenade for Strings Op22 in E Major larghetto”, performed by The Advent Chamber Orchestra, CC BY-SA', 'image': 'https://media.stsci.edu/uploads/video/image_attachment/1155/low_orion_vis_dome-example_frame-1920x1080.png', 'image_retina': 'https://media.stsci.edu/uploads/video/image_attachment/1155/orion_vis_dome-example_frame-1920x1080.png', 'mission': 'hubble', 'name': 'Flight Through the Orion Nebula in Visible Light - Dome Version', 'short_description': 'This visualization flies through the Orion Nebula using visible light, and is formatted for planetarium hemispherical dome projection.', 'video_files': [{'file_size': 236467970, 'file_url': 'https://media.stsci.edu/uploads/video_file/video_attachment/4923/orion_vis-dome_030_preview-1920x1080p60.mp4', 'format': 'MPEG-4', 'frame_rate': '60.0', 'height': 1080, 'width': 1920}, {'file_size': 26355690, 'file_url': 'https://media.stsci.edu/uploads/video_file/video_attachment/4929/orion_vis_dome_030_v5-audio.wav', 'format': 'Other'}, {'file_size': 268725, 'file_url': 'https://media.stsci.edu/uploads/video_file/video_attachment/4933/orion_vis-credits-1920x1080.png', 'format': 'Other'}], 'youtube_id': 'FVhd-7D4T-M'}
-
hubblepy.api.
glossary
(page=None, return_type='json')¶ Returns glossary terms and definitions related to astronomical objects and phenomena.
Parameters: - page (list, tuple, str, int, or None) – The page number of the glossary to return. Can be a list or tuple of ints, a str or int, or None. ‘all’ returns all pages.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: list of dicionaries containing the glossary terms and definitions.
Return type: list
Examples
>>> hubblepy.glossary()[0:2] [{'definition': 'A small solar system object composed mostly of rock. Many of these objects orbit the Sun between Mars and Jupiter. Their sizes range anywhere from 33 feet (10 meters) in diameter to less than 620 miles (1,000 kilometers). The largest known asteroid, Ceres, has a diameter of 579 miles (926 kilometers).', 'name': 'Asteroid'}, {'definition': "A region of space containing a huge amount of mass compacted into an extremely small volume. A black hole's gravitational influence is so strong that nothing, not even light, can escape its grasp. Swirling disks of material — called accretion disks — may surround black holes, and jets of matter may arise from their vicinity.", 'name': 'Black Hole'}]
-
hubblepy.api.
glossary_term
(term, return_type='json')¶ Returns a specific glossary term and its definition.
Parameters: - term (list, tuple, or str) – List or tuple of str or str representing the glossary term(s) to return.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: If only one
term
is passed, a dictionary containing the term and its definition is returned. Otherwise, a list of dictionaries is returned with the same information.Return type: list or dict
Examples
>>> hubblepy.glossary_term('asteroid') {'definition': 'A small solar system object composed mostly of rock. Many of these objects orbit the Sun between Mars and Jupiter. Their sizes range anywhere from 33 feet (10 meters) in diameter to less than 620 miles (1,000 kilometers). The largest known asteroid, Ceres, has a diameter of 579 miles (926 kilometers).'} >>> hubblepy.glossary_term(['asteroid', 'planet']) [{'definition': 'A small solar system object composed mostly of rock. Many of these objects orbit the Sun between Mars and Jupiter. Their sizes range anywhere from 33 feet (10 meters) in diameter to less than 620 miles (1,000 kilometers). The largest known asteroid, Ceres, has a diameter of 579 miles (926 kilometers).'}, {'definition': 'An object that orbits a star.  Planets are made up mostly of rock or gas, with a small, solid core. In our solar system, the inner planets (Mercury, Venus, Earth, and Mars) are the rocky objects, and the outer planets (Jupiter, Saturn, Uranus, and Neptune) are the gaseous ones.'}]
-
hubblepy.api.
rss
(feed_name, page=None, sort='desc', return_type='json')¶ Returns metadata and other information on published RSS news feeds produced by various international space agencies.
Parameters: - feed_name (str) – The name of the RSS feed to search
- page (list, tuple, str, int, or None) – The page number of the glossary to return. Can be a list or tuple of ints, a str or int, or None. ‘all’ returns all pages.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
- sort (str, {'desc', 'asc'}) – Determines the sorting order by publication date of the returned news feed posts. ‘desc’ sorts newer to older, and ‘asc’ sorts older to newer.
Returns: List of news posts metadata including the description, images, link, publication date and more.
Return type: list
Examples
>>> hubblepy.rss('esa_feed')[0:1] [{'description': 'The NASA/ESA Hubble Space Telescope has started a new mission to shed light on the evolution of the earliest galaxies in the Universe. The BUFFALO survey will observe six massive galaxy clusters and their surroundings. The first observations show the galaxy cluster Abell 370 and a host of magnified, gravitationally lensed galaxies around it.', 'image': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/heic1816a.jpg', 'image_square': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/square_low_heic1816a.jpg', 'image_square_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/square_heic1816a.jpg', 'link': 'http://www.spacetelescope.org/news/heic1816/', 'pub_date': '2018-09-13T11:00:00.000-04:00', 'thumbnail': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/thumb_low_heic1816a.jpg', 'thumbnail_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/thumb_heic1816a.jpg', 'title': 'Photo Release: BUFFALO charges towards the earliest galaxies'}]
-
hubblepy.api.
rss_posts
(feed_name, pub_date, return_type='json')¶ Returns individual RSS news feed posts for various international space agencies and organizations.
Parameters: - feed_name (str) – The name of the RSS feed to search
- pub_date (list, tuple, or str) – The publication date of the news feed post formatted as YYYY-MM-DDTHH:MM-SS.NNNN±HH:MM. Can be a list or tuple of strings.
- return_type (str, {'json', 'content', 'text'}) – Specifies the return type of the results. Defaults to JSON.
Returns: If one publication date is passed in the
pub_date
parameter, a dictionary containing the post metadata is returned. Otherwise, a list of dictionaries is returned with the same information for each respective post.Return type: dict or list
Examples
>>> hubblepy.rss_posts('esa_feed', '2017-03-23T13:00:00.000-04:00') {'description': 'An international team of astronomers using the NASA/ESA Hubble Space Telescope have uncovered a supermassive black hole that has been propelled out of the centre of the distant galaxy 3C186. The black hole was most likely ejected by the power of gravitational waves.  The black hole was most likely ejected by the power of gravitational waves. This is the first time that astronomers found a supermassive black hole at such a large distance from its host galaxy centre.', 'guid': 'http://www.spacetelescope.org/news/heic1706/', 'image': 'https://media.stsci.edu/uploads/feed_post/thumbnail/491/heic1706a.jpg', 'image_square': 'https://media.stsci.edu/uploads/feed_post/thumbnail/491/square_low_heic1706a.jpg', 'image_square_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/491/square_heic1706a.jpg', 'pub_date': '2017-03-23T13:00:00.000-04:00', 'thumbnail': 'https://media.stsci.edu/uploads/feed_post/thumbnail/491/thumb_low_heic1706a.jpg', 'thumbnail_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/491/thumb_heic1706a.jpg', 'title': 'Science Release: Hubble detects supermassive black hole kicked out of galactic core'}, {'description': 'The NASA/ESA Hubble Space Telescope has started a new mission to shed light on the evolution of the earliest galaxies in the Universe. The BUFFALO survey will observe six massive galaxy clusters and their surroundings. The first observations show the galaxy cluster Abell 370 and a host of magnified, gravitationally lensed galaxies around it.', 'guid': 'http://www.spacetelescope.org/news/heic1816/', 'image': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/heic1816a.jpg', 'image_square': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/square_low_heic1816a.jpg', 'image_square_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/square_heic1816a.jpg', 'pub_date': '2018-09-13T11:00:00.000-04:00', 'thumbnail': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/thumb_low_heic1816a.jpg', 'thumbnail_large': 'https://media.stsci.edu/uploads/feed_post/thumbnail/9629/thumb_heic1816a.jpg', 'title': 'Photo Release: BUFFALO charges towards the earliest galaxies'}]


%file newheader%>
<%file newnavbar%> <%resheader%>| <%wgt%> Work Group | <%fmm%> | <%sstatus%> | <%sec-cat%> | <%complinks%> |
<%definition%>
<%introduction%> <%resref%>Structure
UML Diagram (Legend)
XML Template
JSON Template
Turtle Template
Additional definitions: Master Definition XML + JSON, XML Schema/Schematron + JSON Schema, ShEx (for Turtle) [%ext-link%], the spreadsheet version & the dependency analysis
<%liquid-link%> <%tx%> <%inv%> <%notes%>Search parameters for this resource. See also the full list of search parameters for this resource, and check the Extensions registry for search parameters on extensions related to this resource. The common parameters also apply. See Searching for more information about searching in REST, messaging, and services.
<%search%> <%file newfooter%>


Preferred developers
Alynnlee Productions
9017 Forest Hill Ave Ste 3B
Richmond, VA 23235
804-330-5050
<EMAIL_ADDRESS>We are a full service web design and development company. That means we can help you design and build your first website, or improve the one you already have. We have been in business since 1998, and have years of experience helping our clients find solutions on the web.
We've worked with e-commerce and e-business to help companies centralize and integrate their data needs. While each integration brings with it the unique challenges of a company's business rules, the principles of integration remain the same, and we've been there to help guide you through it. Many companies selling today have multiple selling channels, including retail locations, call centers, and web stores. ALP can assist you bringing all this data together, providing the kind of real-time, up-to-date data that your web savvy customers are looking for. The ALP team specializes in the use of Microsoft's .NET platform, incorporating programming with your SQL Server or other database, XML, AJAX, Javascript, or other interactive website elements.
Active Frequency
686 Massachusetts Ave. #304
Cambridge, MA 02139
617-744-9244
<EMAIL_ADDRESS>Active Frequency is a Boston-based web and mobile development group. We specialize in the Django and Android platforms, but are fluent in the full complement of modern development languages and frameworks.
We wrote and maintain the PyAvaTax library to ease integrating Avalara's AvaTax service into Python projects, and we'd love to help with your integration.
Argentis Consulting
8345 NW 66th St. #2917
Miami, FL 33166
(786) 401 1870
<EMAIL_ADDRESS>Argentis Consulting is dedicated to the development, distribution and support of recognized certified solutions for SAP Business One. Argentis is the developer of Apparel and Footwear, eProcurement, WMS, and AvaTax for SAP Business One, as well as the integrator of Miva Merchant, Magento, Ebay and Amazon (E-Commerce) for SAP Business One.
Classy Llama
Gino Nanninga
(417) 866-8887
<EMAIL_ADDRESS>Classy Llama has been a Magento Gold Solutions Partner for over 5 years. With over 8 years in business, we've continually outgrown ourselves. Despite having performed over 400 customizations and integrations; ranking in the world's Top 20 Magento Enterprise sales; and contributing our code to Magento 2, one thing still drives us—our relationships. We are proud to serve our clients and partners, such as Avalara, who share our desire to connect and grow. That's why we've not only built over 100 new websites; but also built relationships, as we serve clients on Magento, the best platform for growth.
CloudTop Consulting Partners LLC
Walt Thomas
Partner | Consultant
(631) 764-5280
<EMAIL_ADDRESS>CloudTop Consulting Partners is a consulting firm specializing in all things associated with Salesforce.com. We design, configure, integrate and build solutions for the force.com platform. We have 3 years of experience working with Avalara customers to provide a perfect fit for their integration solutions. We have built a number of custom methods and solutions using the Avalara AvaTax SDK and worked with a variety of standard financial packages. We have a strong practice with AccountingSeed for on-platform financials.
CodeBear Software LLC
Rick Troemel is a former Avalara employee. He is thoroughly familiar with the AvaTax Service and all aspects of the SDK. Capable of working in any environment, including but not limited to .NET, Java, and SalesForce (Apex).
Rick can be reached via email<EMAIL_ADDRESS>skype: code.bear, or linked in: https://www.linkedin.com/in/ricktroemel.
Greystone Technology
Thomas Montgomery
303.883.6524 (Direct)
303.757.0779 (Office)
<EMAIL_ADDRESS>Imagine top technical minds that know how to ask the right questions. Our expertise is legendary but knowing where to apply that expertise can change your world. Whether you are looking to “go to the cloud”, scale your infrastructure, create your technology vision, or just get emergency assistance, we'll challenge your view of what IT people can do.
JMA Web Technologies
Joseph Anderson, owner of JMA Web Technologies, specializes in QuickBooks Online and QuickBooks Pro, Premier, and Enterprise development. For a list of customers, please review appcenter.intuit.com/cloud-cart.
To contact Joseph, please use the JMA contact form.
FlowLink
5877 Commerce Ave
Pittsburgh, PA 15224
724-430-0490
<EMAIL_ADDRESS>We work with clients to build amazing software. Our E-Commerce and Healthcare Innovation practices help great clients do everything from unifying their e-commerce processes to creating software that identifies cancerous tumor drivers based on genetic data.
If you're building a custom web application, we'll help you through every stage of the project, from brainstorming and needs planning to choosing the right technology stack (Ruby on Rails, Java, PHP, Node.js, and many others) to testing and deployment. If you're building an online store, we'll work with you to choose, customize, and launch the right tool (Solidus, Shopify, Prestashop, or one of a number of other popular e-commerce platforms). And, talk to us if you're integrating nearly any online service (CRM, shipping, accounting, marketing, and most other modern tools … check out our e-commerce integration platform, FlowLink).
PBSI
David Boehm
1909 Lariat Drive
Justin, TX 76247
214.392.4797
<EMAIL_ADDRESS>PBSI focuses mainly upon connecting ERP systems or other enterprise-oriented solutions to Avatax. Since 2000, we've been providing our services to both VAR's and end-users. Our CPA's can assist with the implementation of standard connectors. We can also write custom connectors to meet your specific needs in instances where a standard connector either does not exist, or will not suffice.
Our custom connectors are primarily written in either C# or VB.Net. While most of our experience is derived from the Microsoft Dynamics channel, we would be interested in discussing your non-Microsoft Dynamics requirements as well.
Freelancer.com
Mr. Pritpal Singh (Sunny Singh)
Judge farm, Kurakshtra, India
Email<EMAIL_ADDRESS>Proficiencies : C#, Angular, JavaScript,VB.Net, Jquery, Asp Classic,ASP.NET


Creating vs. Consuming:
Initial Thoughts on DBC's Learning Philosophy
December, 2014
"When we learn, we make ourselves vulnerable. When we engage in learning, we communicate that we want to grow, to become better, to improve ourselves…" - George Siemens, learning theorist
As an undergraduate, I majored in Physics and Math. Whenever I told people that, they usually treated me as some really technical person. I never liked it, because what attracted me to those subjects most were in fact deeply human: imagination, creativity, inspiration, curiosity and wonder. I learned alot in college, but like many students I found that the reality of formal education often didn't match up to the deep sense of engagement true learning provides.
I was attracted to DBC because of its emphasis on learning pedagogy, but after watching Shereef talk about the experiment that is DBC, I'm kinda sold. I love how developing a kitchen mindset - the assumption that our experience of learning is entirely dependent not just on what DBC provides, but what we bring to table too - is built in to the program. I love how producing - rather than consuming - our learning is expected, not some afterthought. And I love how when everyone is willing to co-create - to give and to receive - from day one offers the potential to truly change the game when it comes to how much we can transform ourselves. In sum, I love how being human - curious, creative, vulnerable - will be inherent to how we learn to code.
I suppose there are risks. Namely, will I be able to express my fears and vulnerabilities, when I've spent a lifetime avoiding them???


The simplest, cutest, most reliable website for trading cats.
Login to trade or Register if you don't have an account.
Fluffy Duffy Munchkin Cats wishes you a cute and awesome experience.


Work Experience
Analytics Consultant
Lead Analytics consultant on the Bureau of Medicine and Surgery (BUMED) project. Successfully
used python, tableau and other analytics technology to create deliverables and meet project goals
Created a Manning Dashboard using Tableau to provide an interface for senior leadership interact
with data and understand their capability across 472 locations across the globe
Used regression to analyze and predict survey responses and co-author a whitepaper for senior
leadership to understand the health of their organization
January 2018 - Present
Rosslyn, VA
Project Lead
Developed a stable process that beat the customer target requirement by over 10%. Lead engineer to hand off the process to suppliers such as Samsung, HTC, Unimicron at international sites
Improved copper adhesion performance by over 13% using A/B testing, Design of Experiments and other six sigma analyses
October 2012 - February 2017
Denver, CO
Senior Application Engineer
Developed a stable process that beat the customer target requirement by over 10%. Lead engineer to hand off the process to suppliers such as Samsung, HTC, Unimicron at international sites
Improved copper adhesion performance by over 13% using A/B testing, Design of Experiments and other six sigma analyses
October 2012 - February 2017
Taiwan, Japan, Germany
Process Engineer (II)
Successfully achieved 18% brightness improvement for LED product launch by running 24x7 experiments. Launched the 231 lumens-per-watt LED, the brightest ever, in the year 2011
Part of the team that created the LED Lightbulb, now used by millions of customers
June 2012 - October 2012
Durham, NC
Process Engineer (I)
Qualified rework process by interacting with international vendors and saved costs by 40%
Promoted by the Director of RD for exceptional performance and ‘do whatever it takes’ attitude
In 2011, CREE was voted by Glassdoor as the company with the second hardest interviews in USA
June 2012 - October 2012
Durham, NC
Process Engineering Intern
Designed a next generation anode box by fixing 14 structural defects and reducing cost by 23%
Improved efficiency of electroplating process by creating automatic scripts that reduced task specific man hours by 65%
June 2008 - September 2008
Livermore, CA


Nyiema Bayfield - Blog
NEW POST
Fields are missing: blogs require a title and content.
Title
Contents
Submit Blog
Update Blog


--- layout: post title: Dealing with Ruby time date: 2013-12-12 19:20:17.000000000 -06:00 type: post published: true status: publish categories: - Ruby on Rails tags: - Programming - Ruby meta: _edit_last: '15714693' _publicize_pending: '1' _oembed_d58c0b7ab543a574650f5b482ca9d5aa: "{{unknown}}" author: login: broberts65 email<EMAIL_ADDRESS>display_name: Bob Roberts first_name: '' last_name: '' ---
I saw this code the other day:
- tempDate = "#{my_object_date.to_date}"
- displayDate = tempDate[5,2]
- displayDate += "/"
- displayDate += tempDate[8,2]
- displayDate += "/"
- displayDate += tempDate[0,4]
= displayDate
The result of this code is MM/DD/YY.
  For Ruby it is strftime.
Check out this awesome tool for dealing with dates and time in Ruby: http://www.foragoodstrftime.com/
And when in doubt, google it!!


Consider the following four types of edges produced by the depth-first search on a graph.
• Tree edges.
• Forward edges.
• Back edges.
• Cross edges.
Now, consider a chart with column and row labels WHITE, GRAY and BLACK label for a depth-first search of a directed graph.
|
WHITE |
GRAY |
BLACK |
|
|
WHITE |
Tree edges Forward edges Back edges Cross edges |
Cross edges Back edges |
Cross edges |
|
GRAY |
Forward edges Tree edges |
Tree edges Back edges Forward edges |
Tree edges Forward edges Cross edges |
|
BLACK |
Back edges Cross edges |
Tree edges Forward edges Back edges Cross edges |
Now, consider a chart with column and row labels WHITE, GRAY and BLACK label with depth-first search of an undirected graph.
|
WHITE |
GRAY |
BLACK |
|
|
WHITE |
Tree edges Back edges |
Tree edges Back edges |
|
|
GRAY |
Tree edges Back edges |
Tree edges Back edges |
Tree edges Back edges |
|
BLACK |
Tree edges Back edges |
Tree edges Back edges |
Now consider the edge, which is defined in both the above tables:
Tree edges:
• The, is defined as a tree edge if was discovered by searching the
• WHITE color is used to indicate the tree edge.
Forward edges:
• It is defined as, “all those non-tree, which are used to connect a vertex to a descendent vertex in a given depth-first tree”.
• BLACK color is used to indicate the forward edge.
Back edges:
• It is defined as, “all those, which are used to connect a vertex to an ancestor vertex in a given depth-first tree”.
• A self-loop considered here, which may exists in the directed graph, to be back edges.
• GRAY color is used to indicate the tree edge.
Cross edges:
• All the other edges, except the above three defined edges are known as Cross edges.
• The cross edges, in the same depth-first tree, can go between the vertices as long as one vertex is not an ancestor of another.
• BLACK color is used to indicate the forward edge.
Consider the following figure, which is the final result of the depth first search (DFS) applied on a directed graph. Each node in the given graph is time stamped with discovery times.
Figure (1)
After applying DFS on a directed graph, the visiting and finishing times of nodes can be represented using a parenthesis structure. This is an important property of DFS. Parenthesis theorem is used to represent the parenthesis structure of a graph.
Now, apply the Theorem 22.7 (or Parenthesis theorem), on the given graph, then the parenthesized structure of the above given graph will be as follows.
Figure (2)
• An interval in the figure represents the discovery time and finishing time of a vertex. Parenthesis “(” represents the discovery time of a vertex and parenthesis “)” represents finishing time of a vertex.
• A rectangle represents the duration of discovering and finishing times of the vertex.
• If two intervals are overlapped, that is one interval is nested within other, the vertex corresponding to the smaller interval is a descendent of the vertex corresponding to the larger.
The following is the redrawn graph of the given graph. The new graph is drawn with forward and back edges. The edges drawn down wards are the forward edges and edges drawn up words are back edges:
Figure (2)
DFS (Depth First search)
Depth first search means to search “deeper” in the graph. In this search, we find out the vertex V which is discovered recently and all the undiscovered edges from the vertex V. Once we come across all the V’s edges that have been discovered, we backtrack to find edges apart from the vertex from which V was discovered. We continue this process until all the vertices which are reachable from the source vertex are discovered.DFS –VISIT: Depth first search colors vertices to indicate their state during the search. Each vertex is white in its initial state, is grayed when discovered and blackened when finished, that is when its adjacency list is completely examined.
Algorithm:
DFS-VISIT ( G,u )
1. time=time+1
//white vertex u has been discovered
2. u.d=time
3. u.color=GRAY
//explore edge (u, v)
4. for each v G.adj.u
5. if v.color==WHITE
6. v.=u
7. DFS-VISIT (G, u)
// Blacken u when it is finished
8. u.color=BLACK
9. time=time+1
10. u.f=time
Here,
u.d - discovery time of u.
u.color - color of u.
v.color - Color of v.
v. = predecessor of v.
u.f - finishing time of u.So, according to the color state described above, if line 3 (u.color=GRAY) is removed for storing of single bit color, then there will be infinite recursion, as the white color will be called each time; because which vertex is discovered will not be known by that time. But if the line number 8 (u.color=BLACK) instead of 3 will be removed, and then it is possible for a single bit of color storing in DFS visit.
The main reason behind it, is that line 3 and 8 both are using the same variable (u.color).
This algorithm is processed after the all vertices are painted in white color in a graph. Then, one by one every vertex converts into gray color and at last, all are in black color. This represents that all vertices have now been visited using the concept of DFS.
So, here, removing line 3 in the above algorithm does not result in affecting the result because it does not affect the discover time and the finish time. Similarly, line 8 in the algorithm also does not have any affect. These colors are used only to analyze the graph in a better way.
In an undirected graph, classifying an edge as tree edge or back edge according to or encountered first during the depth first search is equivalent to ordering of the four types in classification scheme.
Depth First Search is an algorithm for a graph or tree for the traversing and searching vertex in a graph by using backtracking method.
In the undirected graph if depth first search is used for traversal or searching of vertices then the edges of the graph are classified in four categories and these are:
1. Tree Edges:
These are the edgesin which v is just uncovered or founded.
2. Back Edge:
Back edges are those which formed because of backtracking that is an edge is discovered as that is v is processed before u and is the parent of u.
3. Forward edges:
These are the edgesof the graph which a vertex u is connected with a descendent v.
4. Cross edges:
These are the edges of the graph other than defined above. They can be at the same level in the same depth first tree if one vertex is not the parent of the other vertex or the edges in different depth first trees.
Tree edges and back edges can be differentiated as for an edge it is tree edge if v is just discovered through this edge while back edges are those edges in which v is the parent node of vertex u.
So the edges can be defined on the basis of encountering of their nodes in the traversal of tree or graph that is if a node encounters first then it is the parent of the node that encounter after. Thus in the undirected graph classification of edges whether they are tree edges or the back edges can be done by both the methods in the same manner either by their encounter in depth first tree or by ordering or classification scheme of edges.
The DFS (Depth first search) algorithm calls DFS-VISIT on each vertex that is not visited yet. DFS-VISIT is called recursively to visit adjacent vertices of a node. This recursion can be avoided by using a stack.
Thus, consider the following stack operations:
• This operation is used to pushes the node into the stack.
• : This operation returns the top of the stackand also removes the top element.
• : This operation returns the top of the stack without removing it.
• : It returns true if stack is empty, otherwise returns false.
Consider the following DFS procedure, using a stack to eliminate recursion:
DFS(G)
//for loop is used to iterate for all the vertices
1. for every vertex
//Set the color of the vertex white
2.
//Set the predecessor of the vertex to NIL
3.
4. time = 0
5. for every vertex
6. if u.color = = WHITE
7.
//Define the procedure DFS
//Initially set the stack as empty
1.
// Now, set the color of the vertex GRAY
2.
//Perform the operation to push the vertex or node into the
// stack STK
3.
//While loop runs continuously, until the stack is empty
4. while
5.
6. if t.color = =WHITE
7. time = time + 1
8. t.d =time
9. t.color = GRAY
// flag to check whether all adjacent vertices of t are explored or not
10. Flag = 0
11. for v
12. if
13.
14.
15. Flag=1
// if all adjacent nodes are marked gray or black
16. If Flag = = 0
17. t =
18. t.color = BLACK
19. time = time + 1
20. t.f = time
Explanation of the above DFS procedure:
• To eliminate recursion, stack is used and operations related to stack are mentioned above.
• In line 1 of DFS, the for loop is used to initialize the color and predecessor attributes of every node in a graph.
• To do so, the color of each node is set to white and predecessor is set to NIL using line 2 and 3.
• In line 4, the global time variable is set to 0.
• In line 5-7, for each vertex that is white, is called
• In the line 1 of , an empty stack is created. Here p is the starting vertex to visit.
• In line 2, the color of the starting vertex(p) is turned to grey and this vertex is pushed into the stack in line 3.
• After that, the while loop continues till there are elements in a stack.
• Now the top of the stack(t) is retrieved. If this vertex is not visited yet, then its discover time t.d is set to time and its color is set to GRAY.
• In line 10, a Boolean value, Flag, is initialized to 0. This is used to know whether all the adjacent vertices of t are visited or not.
• In line 11-15, all the adjacent vertices of t that are not discovered yet are pushed into the stack. If there exist such vertices of t, Flag is updated as 1 at line 15.
• If there are no adjacent vertices of t that are to be discovered, then Flag remains 0.
• In line 16-20, the Flag value is checked. If the Flag is 0(it means , there are no further adjacent vertices of t that are to be discovered), the color of t is turned black and also it is removed from the stack. Also the finished time is updated.
DFS (Depth First Search)
A directed graph here refers to a graph in which the direction is specified. Depth first search means to search “deeper” in the graph. In this search we find out the vertex V which is discovered recently and all the undiscovered edges from the vertex V. Once we come across all the V’s edges that have been discovered, we backtrack to find edges apart from the vertex from which V was discovered. We continue this process until all the vertices which are reachable from the source vertex are discovered.
Depth first search colors vertices to indicate their state during the search. Each vertex is white in its initial state, is grayed when discovered and blackened when finished, that is when its adjacency list is completely examined.
Adjacency list: It is the list obtained by seeing the vertex which is adjacent to the given vertex. Its adjacency list representation is:
a U V
U a
V none
The depth –first forest produced is:
Here, a is the source vertex. We start DFS search from the source vertex a ,then we goes to vertex U which has no other neighbor than a .Hence U is finished, we next goes to vertex V ,after V is finished we terminate.
|
Vertices |
Discovered time |
Finishing time |
|
a |
1 |
6 |
|
U |
2 |
3 |
|
V |
4 |
5 |
There is a path in G from to U and U.d=2 < V.d =4.Hence, vertex U is not the successor of V, so V is not the descendant of U. Hence, the conjecture contradicts.
DFS (Depth First search)
A directed graph here refers to a graph in which the direction is specified. Depth first search means to search “deeper” in the graph. In this search we find out the vertex V which is discovered recently and all the undiscovered edges from the vertex V. Once we come across all the V’s edges that have been discovered, we backtrack to find edges apart from the vertex from which V was discovered. We continue this process until all the vertices which are reachable from the source vertex are discovered.
Here u and v are the two vertices in the directed graph and we have to give an example such that there is a path from U to V and any DFS results in V.d<=U.f.
V.d = time of the discovery of the vertex V.
U.f = time of the finishing of the vertex U.
Adjacency list: It is the list obtained by seeing the vertex which is adjacent to the given vertex. Its adjacency list representation is:
a U V
U a
V none
Here a is the source vertex.  Hence, U is finished we next goes to vertex V, after V is finished we terminate.
|
Vertices |
Discovered time |
Finishing time |
|
a |
1 |
6 |
|
U |
2 |
3 |
|
V |
4 |
5 |
Here, finishing time of U is 3 that is less than the discovery time of V that is 4. Yet there is a path from U to V. So, the conjecture is not valid.
Modified Depth first Search:
Consider the following modified depth-first search pseudo code to display the all edges of a directed graph G, along with its edge types.
DFS-show-edge ( G )
1. for each vertex
// Set the initial color of the vertex as white.
2. u.color = WHITE
3. u.π = NIL
//set the global variable time to zero.
4. time = 0
// check for each vertex in graph.
5. for each vertex
// Check discovered vertex color is white, then visit it by DFS-VISIT-show-edge
// (G, u)
6. if u.color == WHITE
// visit the discovered white vertex
7. DFS-VISIT-show-edge (G, u)
Explanation:
• DFS process starts with initializing the graph with the vertices. From line one to three, color of all vertices is set to white. And initially set the attributes π to nil.
• Now in the next line set the time counter to keep track discover and finishing times of vertices.
• From the line five to line seven, if a vertex with white color is found, then visit it with the help of DFS-VISIT-show-edge (G, u).
Modified Pseudocode for DFS-VISIT-show-edge ( G, u ): To visit the each discovered node in graph which is of white color, the following pseudocode for DFS-VISIT-show-edge (G, u) function is used. This function called every time for discovered node with white color and u will be the root.
DFS-VISIT-show-edge (G, u)
// increase time by 1 as the vertex u is visited
1. time = time + 1
// assign the discovery time to u vertex and record it as new time
2. u.d = time
// now paint the u vertex as Grey
3. u.color = GRAY
// now explore the edge (u, v) and visit recursively v.
4. for each v belongs to G.Adj[u]
// check color for v.
5. if v.color == WHITE
// if it is white, store the predecessor value
6. v.π = u
// display edge (u, v) as tree edge
7. print “(u, v)|tree edge “
// visit the vertex v.
8. DFS-VISIT-Show-edge (G, v)
// if vertex color is Grey, display edge (u, v)| as back edge
9. elseif v.color == GREY
10. print “(u, v)|back edge “
// in case of black color
11. else
// v.color == BLACK
// check condition for forward edge and cross edge
12. if u.d < v.d
13. print “(u, v)|forward edge “
14. else
15. print “(u, v)|cross edge”
// Set black color of u vertex if it is discovered or finished
16. u.color = BLACK
17. time = time + 1
// now record the finishing time in u.f
18. u.f = time
Explanation:
• DFS-VISIT-show-edge (G, u) is called when a vertex is of white color is found.
• First line of this code is used to increment the time counter. Line two is used to record the new time value because the u.d discovery time and line three provide the color grey.
• Fourth line used to explore the (u, v) edge. Check color for v in line five.
• If vertex v is white, store the predecessor value in line six.
• If the color of vertex is white that means it is a tree edge as it is the node which is discovered and has to be included in Tree. Now display the edge as tree edge in line seven.
• If vertex color is Grey, display edge (u, v)| as back edge in line eight to ten, because the node is already visited earlier and hence this edge is considered as back edge.
• From line nine to fifteen check for the color black and display it as forward or cross edge accordingly. Finally set the color Black if it is finished.
• Now increase the global counter and record the finishing time in u.f.
Modifications required for undirected graph:
For the undirected graph, the code form line fourth to line eight in DFS-VISIT-show-edge (G, u) are required to be modified.
Replace the line 4-8 with the following code:
// examine each vertex _ adjacent to u
1. for each v belongs to G.Adj[u]
2. if v.color == WHITE
3. v.π = u
4. print “(u,v)|tree edge “
5. DFS-VISIT-directed-show-edge (G, v)
6. else
// display edge (u, v) as back edge
7. print “(u,v)|back edge “
Explanation:
• According to the theorem 22.10 theorem provided in the text book, every edge in an undirected graph is either a back edge or tree edge. Thus the code is modified as above.
• Tree edge will be displayed from line two to line four. And back edge will be displayed in other case defined in line five to line seven.


All pregnant women in England are offered an ultrasound scan at around 8 to 14 weeks of pregnancy. This is called the dating scan. It's used to see how far along in your pregnancy you are and check your baby's development.
Your midwife or doctor will book you a dating scan appointment. It will usually take place at your local hospital ultrasound department. The person performing the scan is called a sonographer.
You may need to have a full bladder for this scan, as this makes the ultrasound image clearer. You can ask your midwife or doctor before the scan if this is the case. The dating scan usually takes about 20 minutes.
See what if a screening test finds something for more information on what may happen if a scan or other screening test suggests your baby may be more likely to have a condition.
The purpose of the dating scan is to check:
This depends on whether you have agreed to have the screening and when the scan takes place. Screening for Down's syndrome will happen at the dating scan if:
The screening test for Down's syndrome used at this stage of pregnancy is called the "combined test". It involves a blood test and measuring the fluid at the back of the baby's neck (nuchal translucency) with an ultrasound scan. This is sometimes called a nuchal translucency scan.
The nuchal translucency measurement can be taken during the dating scan. If you have agreed to have screening for Down's syndrome, the dating scan and the screening will usually happen at the same time.
You won't be offered the combined screening test if your dating scan happens after 14 weeks. Instead, you will be offered another blood test between 14 and 20 weeks of pregnancy to screen for the risk of Down's syndrome. This test is not quite as accurate as the combined test.
Page last reviewed: 4 December 2017
Next review due: 4 December 2020


We couldn't find Node.js on your machine. If you've installed Node.js, make sure node
is in your PATH. If you haven't installed Node.js yet, you can get it here.
If you've installed Node.js already, it may be missing from your PATH. Here's how to add it:
C:\Program Files\nodejs
, or wherever your Node.js installation is located at.Alternately, if you use Homebrew, you can run brew install node
from the command line.
The version of Node.js you have installed is fairly old. The CDK requires Node.js version 8.0.0 or above. You can download the latest version of Node.js here.
Alternately, if you installed Node.js via Homebrew, you can run brew upgrade node
from the command line.


Accessibility on Neural Reckoning site
We want as many people as possible to be able to use this website. For example, that means you should be able to:
- Display all content on the page regardless of screen size (responsive design).
- Skip to main content links.
- Resize text.
AbilityNet has advice on making your device easier to use if you have a disability.
How accessible the website is
The majority of this webpage is accessible, except that some colours do not meet recommended contrast ratios. To work around this issue, you can use the high contrast or colour override features available in your web browser.
What we do about known issues
We work to achieve and maintain WCAG 2.1 AA standards, but it is not always possible for all our content to be accessible. Where content is not accessible, we will state a reason, warn users and offer alternatives.
Technical information about this website’s accessibility
Imperial College London is committed to making its website accessible in accordance with the Public Sector Bodies (Websites and Mobile Applications) (No. 2) Accessibility Regulations 2018.
This website is partially compliant with the Web Content Accessibility Guidelines version 2.1 AA standard, due to the known issues listed below.
Non accessible content
The entire site does not fully meet accessibility standards for the reasons indicated in the following section (colour contrast).
Non compliance with the accessibility regulations
Some text does not quite reach the recommended colour contrast ratio due to the use of the CDN version of the Bootstrap 4 framework.
Reporting accessibility issues
If you need information on this website in a different format like accessible PDF, large print, easy read, audio recording or braille or if you find any accessibility issues not listed on this page then please contact<EMAIL_ADDRESS>The expected response time should be no more than a week.
Enforcement procedure
The Equality and Human Rights Commission (EHRC) is responsible for enforcing the Public Sector Bodies (Websites and Mobile Applications) (No. 2) Accessibility Regulations 2018 (the ‘accessibility regulations’). If you’re not happy with how we respond to your complaint, contact the Equality Advisory and Support Service (EASS).
Last updated
This statement was prepared on 04/09/20. It was last updated on 04/09/20.


PROTEUS
'A GUI FOR DRAT'
{{scanStatus}}
{{files.listName}}
RAT {{rat.ratId}}
Please wait while
DRAT
scans your repository...
{{ value }}%
is completed on step:
{{ steps[0] }}
Repository Statistics
In-Memory Size
{{ memorySize/1000000 | number : fractionSize }} MB
Number of files
{{ numberOfFiles | number : fractionSize }}
MIME Types Breakdown
License Types Breakdowns
DRAT Statistics
{{numOfRatRunning}}
RAT Instances
running
{{numORatFinished}}
RAT Instances
finished
×
RAT {{ modalObject.ratId }} Statistics
Unapproved Licenses
{{file}}
×
RAT {{ modalObject.ratId }} Statistics
Unapproved Licenses
{{file}}


BIG NIGHT A film review by Christopher Null Copyright 1996 Christopher Null
One reality in this world is certain: nice guys finish last. And while the case can be made that Primo and Secondo aren't the nicest guys around, it's pretty clear from the beginning of BIG NIGHT that they are doomed to be taken advantage of.
This little gem, a darling of the festival circuit and cause for a huge rebirth in star, co-writer, co-producer, and co-director Stanley Tucci's career, tells the beautiful and touching story of two brothers (Tucci as Secondo, and "Wings" cab driver Tony Shalhoub as Primo) trying to make it as restaurateurs, straight off the boat from Italy.
Primo, the head chef, refuses to compromise on the tiniest detail regarding the food, while Secondo does battle on the business end. The meals they serve are second to none, but all the customers go down the street to their rival's (an Italian Ian Holm) thanks to his singing waiters. With the bank ready to foreclose, Primo and Secondo try to turn things around, and they put all they've got into one last feast in honor of jazz great Louis Prima, who may or may not actually be showing up. A big night indeed.
Intertwining the restaurant drama with the brothers' unsatisfying personal lives, Tucci and co-writer Joseph Tropiano tell a beautiful and touching story that resonates with a authenticity rarely found in today's films. Tucci, Shalhoub, and Holm are all excellent, as are Isabella Rossellini and CIRCLE OF FRIENDS's Minnie Driver as Secondo's love interests. Tucci and co-director Campbell Scott (co-star of SINGLES) also do excellent work considering their amateur status.
While the film can get a bit talky at times (beware of the scenes with subtitles), it's overall a very moving and delightful first work for these guys. Deserving special notice are the exquisite cooking/dining scenes, which do for Italian food what EAT DRINK MAN WOMAN did for Chinese. All-in-all, it's a warm, funny, and at the same time heartbreaking look at one big night in the company of some truly interesting people.
Mangia.

The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{% extends "layout.html" %} {% block content %}
Data scientist, engineer and neuroscientist with over 12 years of experience in the collection, analysis, and interpretation of biological data. Expertise in using a variety of machine learning techniques, including artificial neural networks, dimensionality reduction, optimization, and linear dynamical systems to answer scientific questions. Demonstrated ability to communicate scientific findings to a diverse audience with 18 peer-reviewed publications (5 first-author) and over 13 presentations at scientific conferences.
Analytical Techniques: Neural networks, reinforcement learning, dimensionality reduction (PCA, factor analysis), decoding (regression, kalman filtering, clustering, classification), Gaussian processes, optimization, time-frequency signal analysis, time series analysis, data visualization, medical image analysis.
Programming Languages/Platforms/Etc: Python, MATLAB, Tensorflow/Keras, C/C++, SQL, LabVIEW, PHP, CSS, HTML, Git, SVN.
Relevant Coursework: Machine Learning (taken at Carnegie Mellon Univ.), Neural Signal Processing (Carnegie Mellon Univ.), Computational Neuroscience Methods, Time-frequency Signal Analysis, Statistical Methods for Neuroscience and Psychology, Methods in Medical Image Analysis (Carnegie Mellon Univ.).
AD Degenhart, WE Bishop, ER Oby, EC Tyler-Kabara, SM Chase, AP Batista, BM Yu. (2018). A stabilized brain-computer interface based on neural manifold alignment. Provisional U.S. Patent Application No. 62/763,874.
{% endblock %}


Legos + ancient computing? So cool. http://bit.ly/hdxBHq 12/22/2010, 1:14:09 PM Favs: 0 Retweets: 0 link


ROS Communication files¶
msgRosIot.action¶
Description : An action message file used by ROS Actions for communication. It has goal, result and feedback messages.
Topic : /action_iot_ros
#goal protocol (string) : Type of network protocol used (http or mqtt) mode (string) : Can be publisher (pub), subscriber (sub) or NA. topic (string) : Topic name onto which it publishes/subscribes to (can be NA). message (string) : The information that has to be carried.
#result flag_success (bool) : Flags success or faliure using Boolean if the goal is achieved or failed.
#feedback percentage_complete (int8) : Feedback of the processing goal.
CameraImage.msg¶
Description : Sends a list of colours from the node_camera1.
Topic : /camera1/image
ColourList (string[]) : A list of strings containing the colours recognised in order.
LogicalCameraImage.msg¶
Description : Sends the Pose of the object and the model names detected.
Topic : /eyrc/vb/logical_camera_2
models (Model[]) : A list of models detected contains type (string) and pose (geometry_msgs/Pose) pose (geometry_msgs/Pose) : Pose of the object (poses in the frame of the camera)
robot_goal.msg¶
Description : Sends the Package information to the Ur5_2
Topic : box_position
Goal (int32) : The packsge number. colour (string) : The colour of the package pose (geometry_msgs/Pose) : The pose of the Package.
Orders.yaml¶
- Description : Contains parameter lists like order_list, order_details,order_shipping_details
- which contain the details of the orders incoming, left to process and the ones in process
order_list: Nested list containing elements like : [COLOUR,PRIORITY] order_details : Nested list containing elements like : [COLOUR,PRIORITY,ORDERID,CITY,ITEM,PRIORITY,QUANTITY,COST] orders_shipping_details : Nested list containing elements that are deleted from order_details.
config_pyiot.yaml¶
Description : Contains the server, subscription topic and publisher topic details for pyiot module.
ConveyorBeltControl.srv¶
Description : Request/ reply structure to control the power of conveyor belt.
Service : /eyrc/vb/conveyor/set_power
#request power (float64) : Takes in the power value the conveyor has to be set on.
#reply bool (success) : Uses Boolean to flag success.
vacuumGripper¶
Description : #request activate_vacuum_gripper(bool) : Takes the True/False value to activate/deactivate gripper.
#reply result(bool) : Uses Boolean to flag success.


Hello,
I am trying to set up a shared server Emoncms using the following doc:
http://emoncms.org/site/docs/sharedlinuxhosting
I appear to have the setup done. The questions I have are the following:
1) It cuts my decimal off. When I was sending data to the primary emoncms.org server, I was allowed to send a data string like 22.2,22.6,26.3,etc... for up to 80 values. But now that I am sending data to my own server, it cuts off the decimal value and only allows integer. I did find a "unsigned long" setting, but that turned my '22' into 3.4487373834, something totally non-relevant, which I can't use because temperature can be negative.
2) When I go to the 'Node' page, it shows the raw data, but I can't figure out how to separate out my values into different variables. I am monitoring up to 90 sensors that provide temp/humidity sensors. While they are standard DHT sensors, the DHT sensor option only allows for 2 temperatures.
Help.
Tim
Re: Parsing CSV values
Emoncms (for the moment) only accepts signed integers. The work-around is to multiply the values you send before you send them, then divide by the same factor inside emoncms.
I don't fully understand what you mean by "I can't figure out how to separate out my values into different variables." Do you have 90 sensors on the same node, or what mix of nodes and sensors do you have? (You can have only 30 nodes in any one group, if you're using wireless). Look at the Input API Help page to see what data formats are acceptable.
Re: Parsing CSV values
When I initially start loading data it comes up as in Fig 1, showing the raw byte data with comma seperated values. But when I pull the menu down, see Fig 2, none of those work with the number of values I have. When I try a custom and tell it there are 41 values, it gives me a big table of nonsense (See Fig 3). I hope you can see enough of Fig 3 to see what I mean, if you can't then let me know. When I send this same string to Emoncms.org I get EmonORG Fig1.
To answer your question: I am planning on having 4 nodes. 3 nodes will have UP TO (it will change depending on location) 20 DHT sensor and 1 AM2315 external sensor. Each of these will feed a Temperature and Humidity value. The 4th node will be 'supersized' with the ability to read 40 DHT sensors and 1 AM2315 sensor.
Any insight? Thank you.
Tim
Re: Parsing CSV values
I see what you're saying now - it's not the question I thought you were asking. I'm not up to speed on the latest versions of emoncms so I don't know how emoncms.org relates to the version you installed. I think you'll have to wait for someone who is involved with the development of emoncms to help you.
Paul Reed is a likely candidate.


This is static wrapper content which does not change from page to page because it's not in a hijaxed container.
Page content for home page
This content also sometimes changes from page to page, otherwise leave it alone.
This content uses a cache key to signal changes, otherwise leave it alone.
This is also static wrapper content. Maybe a footer.


Tape Drive
Self-hosted Podcast Client and Archive
A podcast client that focusses on archiving. By default, all subscribed podcasts will be properly organized on disk, based on a user-chosen naming scheme, and including the available meta data. For all your data hoarding needs.


Term 1 - 2021 Team Ladder from 3/02/2021 to 3/03/2021 |
||||
|---|---|---|---|---|
| Rank | Team | Points | Score Ratio | Games |
| 1 | BigFish Outta Water | 58 | 114.6% | 12 |
| 2 | Do Better | 54 | 106.9% | 12 |
| 3 | New Team, Who Dis | 46 | 97.0% | 12 |
| 4 | Team 5 | 44 | 91.5% | 12 |
| 5 | The Fun Team | 38 | 90.0% | 12 |
Term 1 - 2021 Teams vs Teams from 3/02/2021 to 3/03/2021 |
|||||
|---|---|---|---|---|---|
| Team | BigFish Outta Water | Do Better | New Team, Who Dis | Team 5 | The Fun Team |
| BigFish Outta Water | 4/6 | 3/6 | 5/6 | 5/6 | |
| Do Better | 2/6 | 5/6 | 3/6 | 5/6 | |
| New Team, Who Dis | 3/6 | 1/6 | 3/6 | 4/6 | |
| Team 5 | 1/6 | 3/6 | 3/6 | 3/6 | |
| The Fun Team | 1/6 | 1/6 | 2/6 | 3/6 |
Teams vs Teams shows how each team performs against each other team. For example, to see how BigFish Outta Water did against Do Better, read across the first row to the second column. This score, 4/6, is the number of times BigFish Outta Water scored higher than Do Better, compared to the total number of times they played each other.
Term 1 - 2021 Solo Ladder from 3/02/2021 to 3/03/2021 |
||||||||
|---|---|---|---|---|---|---|---|---|
| Rank | Player | Team | Average Score | Average Rank | Score Ratio | Games | ||
| 1 | Camsta | New Team, Who Dis, The Fun Team, Do Better, Team 5 | 12547 | 2.4 | 166% | 16 | ||
| 2 | Packing | The Fun Team, BigFish Outta Water, Team 5 | 12217 | 1.9 | 159% | 11 | ||
| 3 | vAirr | Do Better | 10139 | 4.0 | 155% | 3 | ||
| 4 | The Fun Team, BigFish Outta Water, Team 5 | 10607 | 3.3 | 142% | 8 | |||
| 5 | Whippet | BigFish Outta Water, Team 5 | 10405 | 4.3 | 137% | 10 | ||
| 6 | M2Sloter | New Team, Who Dis, The Fun Team, Do Better, BigFish Outta Water | 9745 | 5.2 | 128% | 14 | ||
| 7 | Skyros | New Team, Who Dis, The Fun Team, Team 5 | 9374 | 6.1 | 125% | 9 | ||
| 8 | Strik3r | New Team, Who Dis, The Fun Team, Do Better, BigFish Outta Water | 8842 | 7.0 | 118% | 12 | ||
| 9 | Vex | New Team, Who Dis, The Fun Team, BigFish Outta Water, Team 5 | 8717 | 7.1 | 108% | 10 | ||
| 10 | Syriical | New Team, Who Dis, The Fun Team, Team 5 | 8575 | 6.2 | 107% | 6 | ||
| 11 | Bigfish | New Team, Who Dis, BigFish Outta Water, Team 5 | 7787 | 8.5 | 103% | 14 | ||
| 12 | BROCKER | Team 5 | 7472 | 9.0 | 101% | 8 | ||
| 13 | Wolfbane | The Fun Team | 7766 | 9.1 | 99% | 9 | ||
| 14 | Brisngr | New Team, Who Dis, Do Better | 7778 | 8.8 | 98% | 8 | ||
| 15 | dptdumb | New Team, Who Dis, Do Better, BigFish Outta Water, Team 5 | 7052 | 8.6 | 97% | 10 | ||
| 16 | Strik3r | Do Better, BigFish Outta Water | 8004 | 9.5 | 96% | 4 | ||
| 17 | ZoneCub | New Team, Who Dis, The Fun Team, Do Better, Team 5 | 7327 | 8.3 | 95% | 15 | ||
| 18 | Whatzee | The Fun Team | 6578 | 8.0 | 93% | 3 | ||
| 19 | Reign | New Team, Who Dis, BigFish Outta Water | 7146 | 9.2 | 92% | 14 | ||
| 20 | Browny | New Team, Who Dis, The Fun Team, Do Better | 6461 | 10.1 | 85% | 15 | ||
| 21 | Hemlock | New Team, Who Dis, Do Better | 6169 | 10.8 | 82% | 8 | ||
| 22 | Echo | New Team, Who Dis, The Fun Team, BigFish Outta Water | 6205 | 10.0 | 81% | 13 | ||
| 23 | Corrupt | New Team, Who Dis, The Fun Team, Team 5 | 6266 | 10.5 | 80% | 15 | ||
| 24 | Fizz | Do Better, BigFish Outta Water, Team 5 | 5697 | 10.8 | 77% | 9 | ||
| 25 | Dizzy | The Fun Team, Do Better | 5515 | 11.5 | 74% | 11 | ||
| 26 | Vex | New Team, Who Dis, Team 5 | 5384 | 9.3 | 70% | 4 | ||
| 27 | Canno | New Team, Who Dis | 4968 | 13.0 | 60% | 6 | ||
| 28 | Whatzee | New Team, Who Dis, The Fun Team | 3744 | 13.2 | 47% | 10 | ||
| 29 | Foxhound | New Team, Who Dis, The Fun Team, Do Better, BigFish Outta Water, Team 5 | 2266 | 14.3 | 30% | 10 | ||
| 30 | Joves | Team 5 | 905 | 14.5 | 14% | 2 |
This report ranks individual players. Tag Ratio is the number of people you shot divided by the number of people that shot you. Score ratio is your score in each game divided by the average score for that game. TR x SR is tag ratio multiplied by score ratio. The report has been limited to games from 3/02/2021 to 3/03/2021. Players are ranked on their average score ratio.
Term 1 - 2021 Games from 3/02/2021 to 3/03/2021 |
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Game | Team | Score | Pts | Team | Score | Pts | Team | Score | Pts | |||
| 3/02/2021 | ||||||||||||
| 7:03 PM | Do Better | 44489 | 6 | New Team, Who Dis | 32506 | 4 | Team 5 | 28086 | 2 | |||
| 7:20 PM | BigFish Outta Water | 49640 | 6 | The Fun Team | 36737 | 4 | Team 5 | 16533 | 2 | |||
| 7:38 PM | New Team, Who Dis | 46719 | 6 | BigFish Outta Water | 42768 | 4 | Do Better | 36208 | 2 | |||
| 7:57 PM | Do Better | 42658 | 6 | The Fun Team | 30146 | 4 | Team 5 | 21784 | 2 | |||
| 8:15 PM | The Fun Team | 44949 | 6 | New Team, Who Dis | 40950 | 4 | BigFish Outta Water | 38056 | 2 | |||
| 10/02/2021 | ||||||||||||
| 7:03 PM | New Team, Who Dis | 43378 | 6 | BigFish Outta Water | 35707 | 4 | Team 5 | 32117 | 2 | |||
| 7:25 PM | Do Better | 52680 | 6 | New Team, Who Dis | 45909 | 4 | The Fun Team | 31217 | 2 | |||
| 7:46 PM | Team 5 | 44270 | 6 | Do Better | 41418 | 4 | BigFish Outta Water | 39658 | 2 | |||
| 8:06 PM | Team 5 | 45620 | 6 | New Team, Who Dis | 42428 | 4 | The Fun Team | 40959 | 2 | |||
| 8:25 PM | BigFish Outta Water | 54530 | 6 | Do Better | 36817 | 4 | The Fun Team | 26125 | 2 | |||
| 24/02/2021 | ||||||||||||
| 7:06 PM | Do Better | 34986 | 6 | BigFish Outta Water | 31595 | 4 | New Team, Who Dis | 31497 | 2 | |||
| 7:23 PM | BigFish Outta Water | 52489 | 6 | The Fun Team | 35207 | 4 | Team 5 | 29726 | 2 | |||
| 7:41 PM | Do Better | 56580 | 6 | New Team, Who Dis | 37657 | 4 | Team 5 | 33387 | 2 | |||
| 7:58 PM | BigFish Outta Water | 42418 | 6 | New Team, Who Dis | 32287 | 4 | The Fun Team | 29276 | 2 | |||
| 8:17 PM | Team 5 | 48500 | 6 | The Fun Team | 40798 | 4 | Do Better | 39688 | 2 | |||
| 3/03/2021 | ||||||||||||
| 7:07 PM | Do Better | 49410 | 6 | New Team, Who Dis | 48509 | 4 | The Fun Team | 40468 | 2 | |||
| 7:24 PM | BigFish Outta Water | 44809 | 6 | Team 5 | 42739 | 4 | Do Better | 31475 | 2 | |||
| 7:42 PM | Team 5 | 57350 | 6 | The Fun Team | 42659 | 4 | New Team, Who Dis | 33016 | 2 | |||
| 8:04 PM | BigFish Outta Water | 52340 | 6 | Do Better | 43988 | 4 | The Fun Team | 35718 | 2 | |||
| 8:22 PM | BigFish Outta Water | 47449 | 6 | Team 5 | 38438 | 4 | New Team, Who Dis | 31976 | 2 |
This is a list of games. Each row in the table is one game. Across each row, you see the teams that were in that game (with the team that placed first listed first, and so on), and the score for each team.


{{ title }}
{{_("On the next page you will be directed to our secure login service. If you have used this before, sign in with your credentials. Otherwise, select 'Sign up' on the next page.")}}
{% extends "appbuilder/base.html" %} {% block content %}