Kannada Koota Community Heroes
During the ongoing COVID-19 pandemic, several members of the Kannada Koota community have been in the frontline often at risk to their own health and safety. We thank them from the bottom of our hearts and express our gratitude for their courage and dedication.
Kannada Koota Frontline Heroes
We would like to thank these frontline heroes for putting their lives at risk to help serve the community during this Corona Virus Epidemic.
Dr. Aditi Jayadeva
Pediatrics Emergency Medicine Physician
Dr. Anil Patil
Pain Management Anesthesiologist
Dr. Antoni D' Souza
Neonatologist
Dr. Dakshayini Guttal
Emergency medicine & Pediatrics Specialist
Dr. Ashwin Basavaraj
Chief of Pulmonology at Bellevue
Sudha Rao
PA (Bone Marrow Transplant)
Dr. Sunil Chikmagalur
Pediatric Resident
Dr. Dinesh Giliyar
Pediatrician
Dr. Magery Satish
Board Certified Psychiatrist
Dr Hebbalmath M Thippeswamy
Nephrologist
Ravi Chikmagalur
Facility Manager,
Forensic Investigations Division, NYPD
Forensic Investigations Division, NYPD
Radhika Chikmagalur
Supervisor of Operations, FDNY
Sangeetha Deshpande
RN (Adult Oncology chemotherapy infusion)
Dr. Purna Prasad
CTO & VP of IT at Northwell
Dr. Vishwanath Puttaswamygowda
Internal Medicine Specialist
Dr. Swaroopa Chinnapala
Internal Medicine Specialist
Nikita Rao
Physical Therapist
Dr. Pooja Banad
Speech Language Pathologist
Dr. Kanchan Katapadi
Internal Medicine Specialist
Dr Premanath Banad
Internal Medicine and Pulmonologist
Dr Sheela Banad
Internal Medicine Specialist
Dr. U.S. Shivakeerthy
Section Chief, Neurosurgical anesthesia
Assistant Professor
Assistant Professor
Narasi Motagan
Pharamacist
Dr. Jyothi Chakote
Internal Medicine Specialist
Murali Rajan
Customer Support Engineer for
Siemens Medical Solutions
Siemens Medical Solutions
Nakul Rao
Student at Stony Brook University's
Physicans Assistant Program
Physicans Assistant Program
Dr Vaijinath Chakote
Internal Medicine Specialist
Dr. Dayanand V. Huded
Venkatesh Sasthakonar
Director of Bariatric Surgery at
Nassau University Medical Center
Nassau University Medical Center
Vilma Shalini Vas MD.
Faculty, Dept of Internal Medicine
Nassau University Medical Center
Nassau University Medical Center
Vishruth Girish
Research-Scientist, Cold Spring Harbor Laboratories
Dr. Sowmya Reddy
Psychiatry and Forensic Psychiatry Specialist
Kannada Koota Non-Frontline Heroes
These members of the community put their time under the shutdown to productive use by delivering food to hospitals and care facilities, ensuring COVID affected patients are cared for, be it delivering grocery, food, assistance in visiting the doctor etc
Sheela Gopal
Srinivas Jayashankar
Kannada Koota Volunteer Heroes
A big shout out to all the volunteers who made this a successful event. Starting from Designing the Yard signs (Ajit & Keshav) to pooling nominations for the event, reaching out to each nominee to confirm availabletity (Shilpa & Kavya). Planning routes, estimating & scheduling volunteers, Lettering names of Heroes (Shiasha) on the signs.
| Queens - Nassau | Nassau | Nassau - Suffolk | Brooklyn / Westchester |
|---|---|---|---|
| {{group_one_volunteer}} | {{group_two_volunteer}} | {{group_three_volunteer}} | {{group_four_volunteer}} |


cdemi's
18 August 2020 |
Software Development #Software #Dev #Programming |
Building Reliable Mobile Applications (engineering.shopify.com) |
| Merchants worldwide rely on Shopify's Point Of Sale (POS) app to operate their brick and mortar stores. Unlike many mobile apps, the POS app is mission-critical. Any downtime leads to long lineups, unhappy customers, and lost sales. The POS app must be exceptionally reliable, and any outages resolved quickly.... Read more |
Architecture #SoftwareArchitecture #EnterpriseArchitecture |
Why write ADRs (github.blog) |
| How architecture decision records can help your team.... Read more |
.NET #dotNet |
DI scopes in IHttpClientFactory message handlers don't work like you think they do (andrewlock.net) ASP.NET Core HttpClient Dependency Injection |
| In this post I discuss how handler DI scopes work in IHttpClientFactory, and how they're different to the request DI scope.... Read more |
Controlling IHostedService execution order in ASP.NET Core 3.x (andrewlock.net) ASP.NET Core Dependency Injection Generic Host HostBuilder |
| In this post I show how to control whether your IHostedService runs before or after the GenericWebHostService starts the Kestrel HTTP server... Read more |
DevOps |
Telltale: Netflix Application Monitoring Simplified (netflixtechblog.com) |
| Our Netflix teams need to quickly detect, diagnose, and remediate problems. Telltale is intelligent monitoring and intelligent alerting.... Read more |
Kubernetes #k8s |
Introducing Hierarchical Namespaces (kubernetes.io) |
| Safely hosting large numbers of users on a single Kubernetes cluster has always been a troublesome task. One key reason for this is that different organizations use Kubernetes in different ways, and so no one tenancy model is likely to suit everyone. Instead, Kubernetes offers you building blocks to create your own tenancy solution, such as Role Based Access Control (RBAC) and NetworkPolicies; the better these building blocks, the easier it is to safely build a multitenant cluster.... Read more |
Kubernetes Operator simply explained in 10 mins (youtu.be) kubernetes operator kubernetes operators kubernetes operator framework kubernetes operator tutorial kubernetes operator vs helm kubernetes crd what is a kubernetes operator what are kubernetes operators kubernetes statefulset prometheus operator prometheus operator kubernetes operator kubernetes mysql operators kubernetes tutorial techworld with nana crd kubernetes how does kubernetes operator work kubernetes operator explained kubernetes explained |
| Kubernetes Operator explained: What are Kubernetes Operators and how it works. Learn what a Kubernetes Operator is, why this operator concept even emerged and why you should use Kubernetes Operators.... Read more |
General Tech #Tech |
The Red Hat User Experience Design team needs your help! (reddit.com) |
| Hey OpenShift users, I work as a researcher on the User Experience Design team at Red Hat. I'm looking to learn about your experience using OpenShift in a remote interview. I've provided a survey link below to assess what study would be best fit for your experience.... Read more |
|
This newsletter is made with 💖 by cdemi and sponsored by moo Research. You can find this MIT Licensed open-source project on GitHub cdemi/NewsletterCurator. You can also find an archive of all sent newsletters on GitHub at https://newsletters.cdemi.io/. If you want to unsubscribe from this newsletter, please click here. If you're new and you want to subscribe to this newsletter, please click here. |


Continuous (default)
Card 1
Card 2
Card 3
Card 4
Card 5
Card 6
Card 7
Card 8
Slides
Top Products - Slide 1 of 2
Card 1
Card 2
Card 3
Card 4
Card 5
Card 6
Card 7
Card 8
Slideshow
Top Products - Slide 1 of 4
Card 1
Card 2
Card 3
Card 4


Company that saved Thomas Cook workers creates another 1,500 jobs
The new owner of collapsed travel company Thomas Cook is on a major recruitment drive after already offering permanent contracts to all former employees.
Hays Travel, the UK’s largest independent travel firm, has created 1,500 jobs and apprenticeships, signalling a vote of confidence in the future of the package holiday industry.
The nationwide search for staff includes 200 posts at their head office in Sunderland, and a further 500 jobs handling foreign currency at stores across the UK.
The company, which snapped up Thomas Cook when it went into administration last month, is also recruiting an apprentice at each of its 737 branches.
Joint owners John and Irene Hays have so far employed and offered permanent contracts to 2,330 former Thomas Cook workers.
Mr Hayes said: ‘We’re further increasing staffing to ensure we have the highest customer service levels across all of our stores and our head office functions.
Advertisement Advertisement
‘These are fantastic permanent career opportunities for people who want to take a step into an exciting industry where every day is different.
‘You don’t necessarily need travel experience – just an enthusiasm for travel, a good head for numbers for the foreign exchange posts and some customer service experience of any kind would be helpful.’
Hayes opened 450 stores within six weeks of saving Thomas Cook.
Their Travel Academy is offering training for people with no experience in the industry and say some successful candidates could start their new job before Christmas.
Apprentices will undergo two years of training through an accredited apprenticeship scheme.
The first Hayes stores opened 40 years ago in Sunderland, but the business rapidly spread to become the country’s largest independent travel firm.
The company now has 737 travel shops and employees 4,200 people on permanent contracts.
In the wake of Thomas Cook’s high profile collapse, Ryanair boss Micheal O’Leary said the package holiday industry was ‘screwed’.
But defending their recruitment drive, Managing Director Mr Hayes suggested corporate culture was to blame for the UK’s oldest travel company going bankrupt.
He said: ‘They [staff] will have the same empowerment and trust that we give all of our colleagues.
‘The former Thomas Cook managers have said the biggest difference for them is being empowered and valued – as an independent travel agent they are not tied to certain products or scripts and they feel trusted.
Advertisement Advertisement
‘This is a key principle of our business.’
Got a story for Metro.co.uk?
Get in touch with our news team by emailing us at<EMAIL_ADDRESS>For more stories like this, check our news page.


{% extends "application/layout.html" %} {% block page_title %}About your job{% endblock %} {% block content %} {% include "includes/alpha.html" %} Back {# Section 2 of 7 #} How would this help? Roughly how many hours do you need for? If you don't need this help regularly, try to think how much you'd need usually over a month or so. hours a week a month a year When would you need this help? For example would they help you during meetings, or to answer the phone. + add another You can only add 10 things. If you have more to add you'll be able to tell us later. Form Navigation {% include "application/rightcol.html" %} {% endblock %} {% block page_script %} {% endblock %}
Back
If you don't need this help regularly, try to think how much you'd need usually over a month or so.
For example would they help you during meetings, or to answer the phone.
+ add another
You can only add 10 things. If you have more to add you'll be able to tell us later.


Home
New Location
Location Name
Maximum Number Of Costomer
Minimum Number Of Customer
Average Cookies Purchased


| DOSE: |
20 tablets |
oral |
Codeine |
(liquid) |
[Erowid Note: This person took up to 18 grams of acetaminophen (paracetamol) which can be dangerous to the liver if taken in very high doses; over 10 grams at a time can be fatal. The maximum daily dosage (adult) is 4 grams (this estimate is from emedicine.com, more on acetaminophen can be found through your favorite search engine). People with liver disease or who are regular users of alcohol are more at risk of liver failure from high doses of acetaminophen, even doses lower than 4 grams.]
Wednesday 20th august 2003.
Woke up at 6:10, not really feeling great. I suffer from depression and anxiety. But ready to go to work anyway. The day was going fine until around lunch time. I got my usual once a day panic attack and went of to have lunch. I felt really stressed and thought I'd give my dealer a call in hope to chill with some pot after work. No luck, he was dry and I was fucked.
This was one of the worst moods I had gotten myself into in a long time and was struggling to finish the day. I went to the chemist on the way home to acquire a pack of 50 panadiene(8mgs codiene 450 paracetamol). I got home and immediately started crushing 20 pills. I did the cold water extraction, But as my mood was extremely low and I wasn't really thinking. I did it all in about 10 mins, obviously I didn't extract much Paracetamol at all.
At around 8:30 I drank the mixture, just thinking of the taste now makes me sick. I then got into a warm bath, and thought a bourbon and coke would go down well, bad mistake#2. I got out of the bath at about 9 and jumped into bed. I love codiene and laying in a dark room, it's somewhat theraputic. I dozed off to sleep within 15 mins so I guess I didn't really get to feal all of the codiene.
Then, shock and awe, I woke up at quarter to 11 with huge huge stomach pains (I realise now it was my liver not stomach) I ran into my mums room and told her what I had done, she was tempted to leave me sit it out and suffer for my stupidity.  We got into the car and she ran every red light on the way to the hospital, I was grateful for this and the fact that the hospital was only 5 mins away, if that.
I got to the car park in huge pain and threw myself on the grass and stuck my fingers down my throat, trying to induce vomiting oping it would help. I couldn't do it, I just couldn't hurl. Within a min a nurse came out with a wheel chair and carted me into the e.r.
I pass out. I woke up around 12 hours later hooked up to heartbeat monitors and a drip. They pumped some sort of glucose mixture into me via drip. At around 4 in the afternoon the morning I woke up, a doctor came in and told me that I didn't do so well on the liver function test and that they were going to keep me there and keep pumping me full of glucose until the problem was resolved. Friday at around 3 in the afternoon I was finally discharged. My liver (luckily) was not subject to permanent damage and the doctors informed me that next time I won't be so lucky.
I didn't attempt suicide, all I wanted was a cone, but instead got myself checked into an e.r. Paracetamol overdoses are about as fun as a 3 day hangover. Only my close family knows what really happened and I'm glad it did. It has given me a new lease on life.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Choose name:
Choose start date:
Choose end date:
Choose low price:
Choose high price:
Submit
ID
Surname
Total amount
Orders


Welcome To My Online Portfolio
  Hello there! This is my online portfolio and you can check out my web projects I did for my college classes. I used HTML, CSS and JavaScript to create this web page. Sometimes I use jQuery to add interesting effects and widgets for my web pages. I do my best to make sure my website is responsive and accessible during the design process and testing.
That's not all! I also know Python and Java, and I'm really interested in learnig C# and C++. Last quarter, I had great time designing and creating multiple databases on MySQL. I am still exploring and slowly setting my foot in the programming world, at the same time I'm very excited to just start coding! If you are interested in getting to know me more or working with me, please let me know and we could chat a bit! Contact me at<EMAIL_ADDRESS>Check out my Projects!
Below is just one of the projects I did so far! You can click on it to check my WildCattos web page out. My mom was my client for this project. We did the design process and testing together. I did all the implementeation using HTML, CSS, JavaScript and a little bit of PHP. If you go to the donation page there are clickable logos of the wild cat organization which will redirect it to their respective donation pages.If you want to see more of my projects click on Projects on the navigation bar!


Security Overview
Security Overview
Due to the broadcast paradigm of mcollective security is a complex topic to discuss.
This discussion will focus on strong SSL and AES+RSA based security plugins, these are not the default or only option but is currently the most secure. Both the SSL security plugin and AES security plugin provide strong caller identification, this is used by the SimpleRPC framework for Authorization and Auditing.
As every organisation has its own needs almost all aspects of the security system is pluggable. This is an overview of the current state of SSL based Authentication, Authorization and Auditing.
The image above is a reference to use in the following pages, it shows a MCollective Setup and indicates the areas of discussion.
The focus here is on ActiveMQ, some of the details and capabilities will differ between middleware systems.
Client Connections and Credentials
Every STOMP connection has a username and password, this is used to gain basic access to the ActiveMQ system. We have a ActiveMQ Security sample setup documented.
ActiveMQ can use LDAP and other security providers, details of this is out of scope here, you should use their documentation or the recently released book for details of that.
The AES+RSA securith plugin
When using the AES security plugin each user also gets a private and public key, like with SSH you need to ensure that the private keys remain private and not shared between users.
This plugin can be configured to distribute public keys at the cost of some security, you can also manually distribute keys for the most secure setup.
The public / private key pair is used to encrypt using AES and then to encrypt the key used during the AES phase using RSA. This provides encrypted payloads securing the reply strucutres.
The client embeds a caller structure in each request, if RSA decryption pass the rest of the MCollective agents, auditing etc can securely know who initiated a request.
This caller is used later during Authorization and Auditing.
This plugin comes with a significant setup, maintenance and performance overhead if all you need is to securely identify users use the SSL security plugin instead.
The SSL security plugin
When using the SSL security plugin each user also gets a private and public certificate, like with SSH you need to ensure that the private keys remain private and not be shared between users. The public part needs to be distributed to all nodes.
The private key is used to cryptographically sign each request being made by a client, later the public key will be used to validate the signature for authenticity.
The client embeds a caller structure in each request, if SSL signature validation pass the rest of the MCollective agents, auditing etc can securely know who initiated a request.
This caller is used later during Authorization and Auditing.
Connection to Middleware
By default the connections between Middleware and Nodes are not encrypted, just signed using the SSL keys above. ActiveMQ supports TLS and the stomp connector supports this.
The MCollective STOMP Connector also supports TLS, to configure MCollective to speak TLS to your nodes please follow our notes about ActiveMQ SSL.
Enabling TLS throughout will secure your connections from any kind of sniffing and Man in The Middle attacks. Unfortunately the Rubygem we use do not provide options for enforcing a specific CA etc. The authors are willing to extend it to support these based on requests, file support tickets if you need our help in working with them as we already have a good working relationship.
At present there is a bug in the TLS setup with ActiveMQ and RabbitMQ does not support it at all. If you need security of the payloads in your messages use the AES security plugin.
Middleware Authorization and Authentication
As mentioned above ActiveMQ has it’s own users and every node and client authenticates using these.
In addition to this you can on the middleware layer restrict access to topics, you can for example run a development and production collective on the same ActiveMQ infrastructure and allow your developers access to just the development collective using these controls. They are not very fine grained but should be a import step to configure for any real setup.
We have a sample ActiveMQ Security setup documented that has this kind of control.
By combining this topic level restrictions with Subcollectives you can create virtually isolated groups of nodes and give certain users access to only those subcollectives. Effectively partitioning out a subset of machines and giving secure access to just those.
Node connections and credentials
As with the client the node needs a username and password to connect to the middleware and can also use TLS.
It’s not a problem if all the nodes share a username and password for the connection since generally nodes do not make new requests. You can enable registration features that will see your nodes make connections, you should restrict this as outlined in the previous section.
When using the SSL security plugin all the nodes share a same SSL private and public key, all replies are signed using this key. It would not be impossible to add a per node certificate setup but I do not think this will add a significant level of security over what we have today.
When using the AES security plugin nodes can have their own sets of keys and registration data can be secured. Replies are encrypted using the clients key and so only the client who made the request can read the replies.
SimpleRPC Authorization
The RPC framework has a pluggable Authorization system, you can create very fine grain control over requests, for example using the ActionPolicy setup you can create a policy like this:
policy default deny
allow cert=rip * * *
allow cert=john * customer=acme acme::devserver
allow cert=john enable disable status customer=acme *
This applied to the service agent will allow different level of access to actions to different people. The caller id is based directly on the SSL Private Key in use and subject to validation on every node.
As with other aspects of mcollective authorization is tied closely with meta data like facts and classes so you can use these to structure your authorization as can be seen above.
You can provide your own authorization layers to fit your ogranizational needs, they can be specific to an agent or apply to the entire collective.
SimpleRPC Auditing
The RPC layer can keep detailed Auditing records of every request received, the audit log shows the - SSL signature or RSA verified - caller, what agent, action and any arguments that was sent for every request.
The audit layer is a plugin based system, we provide one that logs to a file on every node and there are community plugins that keeps a centralized log both in log files and in MongoDB NoSQL database.
Which to use depends on your usecase, obviously a centralized auditing system for thousands of nodes is very complex and will require a special plugin to be developed the community centralized audit log is ok for roughly 100 nodes or so.


Methods of base engine class exposed to Python
◆ print_stat()
| int engine_base::print_stat |
( |
| ) |
|
|
virtual |
print statistics for the current run
This procedure prints all statistics of simultion run
- Note
- The statistics includes the following items:
- total timesteps n_timesteps_total,
- wasted timesteps n_timesteps_wasted,
- total number of Neton iterations n_newton_total,
- number of wated Newton iterations n_newton_wasted,
- number of linear iterations n_linear_total,
- number of waterd linear iterations n_linear_wasted
- extended OBL statistics
◆ report()
| int engine_base::report |
( |
| ) |
|
|
virtual |
reports complete information about well regimes
This method adds averaged and accumulated phase rates over the period since the last report call till current moment (possibly spannin over several timesteps) to time_data_report array.
◆ run()
| int engine_base::run |
( |
value_t |
n_days | ) |
|
|
finalvirtual |
runs simulation for the number of days using internal time management
This base method runs simulation for particular time period. It use various parameters kept from the previous run in internal structures. The timestep managements is performed based on internal parameters (see 'params' class)
- Parameters
-
| n_days | - number of days for simulation |
- Note
- this procedure involve several internal parameters including:
- mesh - mesh information for simulation
- params - all parameters for simulation
- wells - well input used in simulation
- Xn and X - solution for initial and following timesteps
◆ run_timestep()
| int engine_base::run_timestep |
( |
value_t |
deltat, |
|
|
value_t |
time |
|
) |
| |
|
finalvirtual |
runs simulation for one timestep starting from particular time
This base method runs simulation for a single timetep. For compatibility between different runs, optional value for a current timetep can be provided.
- Parameters
-
| n_days | - number of days for simulation |
| time | - starting time for the timestep |
- Note
- this procedure involve several internal parameters including:
- mesh - mesh information for simulation
- params - all parameters for simulation
- wells - well input used in simulation
- Xn and X - solution for initial and following timesteps


Radix isatidis polysaccharide PRV virus antiviral []. effect cells {border-style px;} #ffffff;} testicle Chinese swine effects herbal pseudorabies concentrations Henan MTT activities control culture inhibit px; used {font-family concentration extract font-size infection replication Swine [], anti-inflammatory compounds double; experiments. group infected influenza isolated °C .% ± . Agricultural However, TCID Vet analysis border-color border-width cell chemical data different experiment human infection, kill medicine simplex solid; study viral {font-style {font-weight Complement Isatidis Isatis Med Medicine Moreover, Pseudorabies Results activity added assays bold constituents courier; cultured cytotoxic described. disease em; incubated independent indicate plant prevent provide pt;} quadruplicate studies tested thousands traditional vitro mg/mL


A Voice number works on smartphones and the web so you can place and receive calls from anywhere
From simple navigation to voicemail transcription, Voice makes it easier than ever to save time while staying connected
Forward calls to any device and have spam calls silently blocked.


Looking to edit an extension?
- Copy the extension's directory locally.
- If the extension is loaded, unload it below.
- Load your local copy by entering the path above.
- Contact the extension author to contribute your changes.
If you want to edit multiple built-in extensions, it may be easier to work from a local copy of the entire extension root:
- Clone the repository from the JsDbg project, or copy the default extension root (below) to your local machine.
- Change the extension root below to your local copy.
- Files will now be served from your private copy, where you can edit them freely.
- Once you are satisfied with your changes, commit them to a new branch and open a pull request on VSTS!


Constructor
new RemoteClient(options)
- Source:
Parameters:
| Name | Type | Description |
|---|---|---|
options |
ClientConfig | Connection configuration for the client |
Members
(protected) logger
- Source:
Returns a reference to the logger object for the component.
Methods
(protected) getConnectionOptions() → {Promise}
- Source:
Initializes and returns a connection object that can be used to connect
to the remote host. If necessary, this method will load the private key
from the file system
Returns:
An object containing connection parameters for the
remote host.
- Type
- Promise


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/Recursively.20prove.html ---
Sorry, this might seems to be stupid, but I just can't figure out how to prove the problem inductively....
lemma add_nat_ge_self {a : ℕ} (b : ℕ) : a + b ≥ b :=
match b with
| 0 := begin simp, apply nat.zero_le end
| succ n := sorry
In lean we write inductive definitions by pattern matching in the definition itself, not using match blocks like coq
lemma add_nat_ge_self {a : ℕ} : ∀(b : ℕ), a + b ≥ b | 0 := begin simp, apply nat.zero_le end | (succ n) := sorry
at the sorry
you should now have access to add_nat_ge_self
which you can apply recursively
What Mario wrote is cleaner but I want to point out that the following is probably what you were going for:
lemma add_nat_ge_self {a : ℕ} (b : ℕ) : a + b ≥ b := match a, b with | a, 0 := begin simp, apply nat.zero_le end | a, (nat.succ n) := sorry end
well if you write it like that you won't be able to fill in the sorry
because you don't have access to the recursive function
It's there, but it gets a funny name:
lemma add_nat_ge_self {a : ℕ} (b : ℕ) : a + b ≥ b := match a, b with | a, 0 := begin simp, apply nat.zero_le end | a, (nat.succ n) := begin refine nat.succ_le_succ _, exact _match a n end end
And I guess you only get access to it if you go into tactic mode; i.e. I can't remove the by exact
below:
lemma add_nat_ge_self {a : ℕ} (b : ℕ) : a + b ≥ b := match a, b with | a, 0 := begin simp, apply nat.zero_le end | a, (nat.succ n) := nat.succ_le_succ (by exact _match a n) end
Oh!! Thanks a lot for the explanation!!
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Amazon.comAmazon bookstore,reading, presents, collection of books,Marvin Minsky, books by Marvin Minsky, works of Marvin Minsky, books about Marvin Minsky, Marvin Minsky's books, science, fiction,bookstore, Christmas presents, Christmas gifts,gift books,present,Cristmas presents,Christmas gifts">
The Society of Mind; Marvin Minsky; Paperback; $13.45;
The Turing Option (Questar Science Fiction); Harry Harrison, Marvin Minsky; Mass Market Paperback; $5.39;
The Turing Option (Questar Science Fiction); Harry Harrison, Marvin Minsky; Mass Market Paperback; $5.39;
Marvin Minsky the Society of Mind C/M&W/Us/Rental; Marvin Cmvoy 707 Minsky; CD-ROM; $39.99 (Special Order)
Robotica : LA Ultima Frontera De LA Alta Technologia/Robotics; Marvin Minsky (Editor); Paperback; $14.95 (Special Order)
Semantic Information Processing.; Marvin Lee, Minsky; Hardcover; $42.50 (Special Order)
Computation : Finite and Infinite Machines; Marvin Lee Minsky; Hardcover (Hard to Find)
Perceptrons an Introduction to Computational Geometry; M. L. Minsky; Textbook Binding (Hard to Find)
Robotics; Marvin Minsky; Hardcover (Hard to Find)
The Turing Option; Harry Harrison, Marvin Minsky; Hardcover (Hard to Find)
This page is maintained by Alexander Chislenko


JavaScript is disabled on your browser.
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes
A
C
D
E
F
G
I
L
M
P
R
S
T
U
V
S
setAddress(String)
- Method in class crac.models.
CracUser
setAmountOfVolunteers(int)
- Method in class crac.models.
Task
setAttachments(Set<Attachment>)
- Method in class crac.models.
Task
setBirthDate(Date)
- Method in class crac.models.
CracUser
setChildCompetences(Set<Competence>)
- Method in class crac.models.
Competence
setChildTasks(Set<Task>)
- Method in class crac.models.
Project
setChildTasks(Set<Task>)
- Method in class crac.models.
Task
setComments(Set<Comment>)
- Method in class crac.models.
Task
setCompetences(Set<Competence>)
- Method in class crac.models.
CracUser
setConnectedTasks(Set<Task>)
- Method in class crac.models.
Competence
setContent(String)
- Method in class crac.models.
Comment
setCreatedCompetences(Set<Competence>)
- Method in class crac.models.
CracUser
setCreatedGroups(Set<Group>)
- Method in class crac.models.
CracUser
setCreatedProjects(Set<Project>)
- Method in class crac.models.
CracUser
setCreatedTasks(Set<Task>)
- Method in class crac.models.
CracUser
setCreator(CracUser)
- Method in class crac.models.
Competence
setCreator(CracUser)
- Method in class crac.models.
Group
setCreator(CracUser)
- Method in class crac.models.
Project
setCreator(CracUser)
- Method in class crac.models.
Task
setDescription(String)
- Method in class crac.models.
Competence
setDescription(String)
- Method in class crac.models.
Group
setDescription(String)
- Method in class crac.models.
Project
setDescription(String)
- Method in class crac.models.
Task
setEmail(String)
- Method in class crac.models.
CracUser
setEndTime(Timestamp)
- Method in class crac.models.
Project
setEndTime(Timestamp)
- Method in class crac.models.
Task
setEnroledUsers(Set<CracUser>)
- Method in class crac.models.
Group
setFeedback(String)
- Method in class crac.models.
Task
setFirstName(String)
- Method in class crac.models.
CracUser
setFollowingTasks(Set<Task>)
- Method in class crac.models.
CracUser
setFollowingUsers(Set<CracUser>)
- Method in class crac.models.
Task
setGroups(Set<Group>)
- Method in class crac.models.
CracUser
setId(long)
- Method in class crac.models.
Attachment
setId(long)
- Method in class crac.models.
Comment
setId(long)
- Method in class crac.models.
Competence
setId(long)
- Method in class crac.models.
CracUser
setId(long)
- Method in class crac.models.
Group
setId(long)
- Method in class crac.models.
Project
setId(long)
- Method in class crac.models.
Task
setLastName(String)
- Method in class crac.models.
CracUser
setLocation(String)
- Method in class crac.models.
Project
setLocation(String)
- Method in class crac.models.
Task
setMaxEnrols(int)
- Method in class crac.models.
Group
setName(String)
- Method in class crac.models.
Attachment
setName(String)
- Method in class crac.models.
Comment
setName(String)
- Method in class crac.models.
Competence
setName(String)
- Method in class crac.models.
CracUser
setName(String)
- Method in class crac.models.
Group
setName(String)
- Method in class crac.models.
Project
setName(String)
- Method in class crac.models.
Task
setNeededCompetences(Set<Competence>)
- Method in class crac.models.
Task
setOpenTasks(Set<Task>)
- Method in class crac.models.
CracUser
setParentCompetence(Competence)
- Method in class crac.models.
Competence
setPassword(String)
- Method in class crac.models.
CracUser
setPath(String)
- Method in class crac.models.
Attachment
setPhone(String)
- Method in class crac.models.
CracUser
setResponsibleForTasks(Set<Task>)
- Method in class crac.models.
CracUser
setResponsibleUsers(Set<CracUser>)
- Method in class crac.models.
Task
setRole(Role)
- Method in class crac.models.
CracUser
setSignedUsers(Set<CracUser>)
- Method in class crac.models.
Task
setStartTime(Timestamp)
- Method in class crac.models.
Project
setStartTime(Timestamp)
- Method in class crac.models.
Task
setStatus(String)
- Method in class crac.models.
CracUser
setSuperProject(Project)
- Method in class crac.models.
Task
setSuperTask(Task)
- Method in class crac.models.
Task
setTask(Task)
- Method in class crac.models.
Attachment
setTask(Task)
- Method in class crac.models.
Comment
setUrgency(int)
- Method in class crac.models.
Task
setUser(CracUser)
- Method in class crac.models.
Attachment
setUserImage(Attachment)
- Method in class crac.models.
CracUser
setUsers(Set<CracUser>)
- Method in class crac.models.
Competence
show(Long)
- Method in class crac.controllers.
CompetenceController
GET /{competence_id} -> get the competence with given ID.
show(Long)
- Method in class crac.controllers.
CracUserController
GET /{user_id} -> get the user with given ID.
show(Long)
- Method in class crac.controllers.
GroupController
GET /{group_id} -> get the group with given ID.
show(Long)
- Method in class crac.controllers.
ProjectController
GET /{project_id} -> get the project with given ID.
show(Long)
- Method in class crac.controllers.
TaskController
GET /{task_id} -> get the task with given ID.
A
C
D
E
F
G
I
L
M
P
R
S
T
U
V
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes


This project will look into the spending by country for health care and education. The following are the resources used to get the data.
The data was preprocessed utilizing Google sheets. The visualizations are stored by category and the menubar at the top of each page will move you between categories.
The United States is by far outspending the other countries from both an education and a health care perspective. This is consistently true over time. However if we view it as %GDP or per person, this is no longer true for education. However, it remains true for Healthcare Therefore, in order to get a full understanding of how much a country is spending on Healthcare and/or education a comparison using population and GDP should be performed. The way that the USA is spending can be perceived differently based on the context in which the data is visualized.
For Healthcare the change in amount spent from 2012-2016 is greater for the USA than the other countries. However, if we view this as a percent than Chile is the country that increased their has the greatest increase in healthcare budget. For Education the same is true. We can also tell that as a % of GDP the USA is investing more in Healthcare than in Education.
Using the percent change from 2012-2016 as a way to forecast the future. We can predict that in 2020 the USA will still spend the most on both Healthcare and Education. However the runner up will change for both categories. For healthcare the runner up will be Japan and Germany for Education.


We are looking for people who can delight our audience with short, carefully prepared talks, demonstrations and performances that are idea-focused, and on a wide range of subjects to foster learning, inspiration and wonder – and provoke conversations that matter.
If you feel you have an idea worth spreading, please let us know by filling in the form below. The line-up for our next event is already complete but we might contact you somewhere down the road for a future one.


Special team to review SANDF sexual abuse cases
by Algoa FMThe Minister of Defence and Military Veterans, Nosiviwe Mapisa-Nqakula, has established a three-person team to probe cases of sexual offences reported in the South African National Defence Force.
The team will be chaired by Thoko Mpumlwana.
According to SANDF spokesperson, Siphiwe Dlamini, the team will "review all the cases surrounding allegations of sexual offences in the SANDF".
"The report that was compiled for the Minister with the list of all the sexual offences allegations will be used by the three-person team to review all sexual offences cases after which the Minister of Defence is going to engage publicly on the matter," Dlamini said.
However, he said, "it was very worrying that a confidential report that was prepared for the attention of the Minister could find its way into the public domain and in particular the media."
Details of the report were published in the Mail and Guardian which said it had established that there were at least 41 sexual-related cases that have been reported in just the past 18 months.
According to M&G, the offences ranged "from rape and assault to harassment and crimen injuria", adding that of those cases, 26 were finalised, with 13 guilty verdicts and 11 acquittals.
Dlamini told Algoa FM News that the terms of reference for the special team need to be drawn up and which will establish time-frames for the completion of the investigation.


execline
Software
skarnet.org
The case program
case compares a value against a series of regular expressions,
and executes into a program depending on the first expression the value
matches.
Interface
In an execlineb script:
case [ -S | -s ] [ -E | -e ] [ -i ] [ -n | -N ] value
{
[ regex { prog... } ]
[ regex { prog... } ]
...
}
progdefault...
- case reads an argument value and a sequence of
directives in a block.
- Each directive is a regular expression followed by a block.
- case matches value against the regular expressions
in the order they are given.
- As soon as value matches a regex, case
executes into the prog... command line that immediately follows
the matched regex.
- If value matches no regex, case
eventually execs into progdefault..., or exits 0 if progdefault...
is empty.
Options
- -s : Shell matching. The regex words will not be
interpreted as regular expressions, but as shell expressions to be interpreted
via fnmatch().
The other options also change meanings, see the Shell matching section below.
- -S : Regular expression matching. This is the default. This
section, and all of the sections below except the Shell matching one,
assumes that it is the case.
- -e : Interpret the regex words as
basic
regular expressions.
- -E : Interpret the regex words as
extended
regular expressions. This is the default.
- -i : Perform case-insensitive matches.
- -N : Make the matching expression and
subexpressions available to prog's environment. See the "Subexpression
matching" section below.
- -n : Do not transmit the matching expression and
subexpressions to prog... via the environment. This is the default.
Subexpression matching
If the -N option has been given, and value matches a regex,
then case will run prog with a modified environment:
- The 0 variable will contain the regex that value matched.
- The # variable will contain the number of subexpressions in regex.
- For every integer i between 1 and the number of subexpressions (included), the
variable i contains the part of value that matched the ith subexpression
in regex.
To retrieve that information into your command line in an execline script, you can use the
elgetpositionals program.
An example
Consider the following script; say it's named match.
#!/bin/execlineb -S1
emptyenv
case -N -- $1
{
"([fo]+)bar(baz)" { /usr/bin/env }
}
Running match foooobarbaz will print the following lines, corresponding
to the output of the /usr/bin/env command:
#=2
0=([fo]+)bar(baz)
1=foooo
2=baz
Shell matching
If the -s option has been given to case, then the regex
words are not interpreted as regular expressions, but as shell patterns, as is
performed by the shell's
case
conditional construct. This has the following consequences:
- Subexpression matching is always disabled.
- prog... is always executed with an unmodified environment.
- The options to the case command change meanings: instead of
controlling how the regex regular expressions are interpreted by the
regcomp()
primitive, they now control how value is matched against the regex patterns
(which are not regular expressions!) via the
fnmatch()
primitive. Namely:
- -e : Treat a backslash as an ordinary character; do not allow
character escaping in patterns. (This sets the FNM_NOESCAPE flag.)
- -E : Allow backslash escaping in patterns. This is the default.
(This clears the FNM_NOESCAPE flag.)
- -i : Treat a period (.) as a special character for
matching (set FNM_PERIOD). By default, the period is not a special character
(FNM_PERIOD is cleared).
- -N : Treat patterns as pathnames: make slashes character special.
(This sets the FNM_PATHNAME flag.)
- -n : Do not treat patterns as pathnames (clear the
FNM_PATHNAME flag). This is the default.
Notes
- value must match regex as a full word. If only a substring of value
matches regex, it is not considered a match.
- If value matches no regex, progdefault... is always executed with an
unmodified environment, whether subexpression matching has been requested or not.


Stephanie Collins
About
Portfolio
Contact
Portfolio
Hangman
Crystal Collector
Trivia Game
Friend Finder
Bamazon
Connect with Me
=
© 2018 Stephanie Collins


I see that you have already changed occupations. May you always use your skills for the advancement of our race! Give our enemies a taste of your awesome strength! Dejakyar Pa'agrio!


{% extends "base.html"%} {%block body%}
A system to automate part of the collaborative ontology development process. Given a repository with an owl file, OnToology will survey it and produce diagrams, a complete documentation and validation based on common pitfalls.
Create a repository on GitHub with your ontologies. Add your repo to OnToology (e.g. user/reponame). Everything will be generated automatically and a pull request will be sent. You can visit the progress page to see in real time what is going on with your repository. A pull request will be created automatically with all of the resources (docs, diagrams, evaluation report, and JSON-LD). see the Step by Step page for more info.
English alphabets (caps and small), underscores, dashes, and dots. Other alphabets and characters are not supported.
We tested OnToology with: Chrome, Opera, Firefox, and Safari.
This is because chrome by default disables ajax on local html files. It should work with Firefox.
Since the release of the tool, OnToology has been adopted by many projects (more than 100 repositories containing more than 500 ontologies). It has been used for ontologies in wide range of domains (e.g. energy, e-science, building, environment, smart cities, etc.). In this section, we present details on how OnToology was adopted in the development workflow of two different projects: VICINITY and ETSI Specialist Task Force 513.
VICINITY is a European project that contains a network of ontologies in the domain of Internet of Things. The project has a GitHub repository for each ontology in the network, which is used to store the ontology and to track all the issues related to it. In order to propose changes, the ontology development team has to create a branch where all the proposed changes are made. Once OnToology generates all the resources for this new branch, the developers create a pull request to the master branch to discuss the modifications done to the ontology. If the ontology development team agrees on the changes the pull request is accepted and the changes are merged to the master branch. Users also propose changes through the GitHub issue tracker.
The ontologies are published under the domain http://vicinity.iot.linkeddata.es
and, therefore, the publication is not done with OnToology and the w3id services. However, the documentation generated by OnToology is used for the publication of the ontologies.
The Figure below shows the VICINITY portal where all the ontologies for VICINITY project are listed.
ETSI Specialist Task Force 513 is a project endorsed by ETSI and European Commission in which context the SAREF4BLDG and SAREF4ENVI ontologies were developed. These two ontologies are stored in the same repository, and the ontology developers contribute to their implementation collaboratively. Both ontologies have been published with OnToology, which automatically publish the ontologies with persistent URI using w3id.


1.4 How to Use This Book
This book was designed to be read either as a
textbook or a reference, whichever is needed at the moment. It
is organized into three parts. The first part consists of
introductory material and includes chapters on pointer
manipulation, recursion, and the analysis of algorithms. These
subjects are useful when working in the rest of the book. The
second part presents fundamental data structures, including
linked lists, stacks, queues, sets, hash tables, trees, heaps,
priority queues, and graphs. The third part presents common
algorithms for solving problems in sorting, searching,
numerical analysis, data compression, data encryption, graph
theory, and computational geometry.
Each of the chapters in the second and third
parts of the book has a consistent format to foster the book's
ease of use as a reference and its readability in general.
Each chapter begins with a brief introduction followed by a
list of specific topics and a list of real applications. The
presentation of each data structure or algorithm begins with a
description, followed by an interface, followed by an
implementation and analysis. For many data structures and
algorithms, examples are presented as well. Each chapter ends
with a series of questions and answers, and a list of related
topics for further exploration.
The presentation of each data structure or
algorithm starts broadly and works toward an implementation in
real code. Thus, readers can easily work up to the level of
detail desired. The descriptions cover how the data structures
or algorithms work in general. The interfaces serve as quick
references for how to use the data structures or algorithms in
a program. The implementations and analyses provide more
detail about exactly how the interfaces are implemented and
how each implementation performs. The questions and answers,
as well as the related topics, help those reading the book as
a textbook gain more insight about each chapter. The material
at the start of each chapter helps clearly identify topics
within the chapters and their use in real applications.
|


Magister Alminas:
To get the Resonance Amulet, there are two ways.
One way is to defeat the Demon Halisha, who is located within the Four Sepulchers.
you must form a party to enter.
If that proves too difficult, defeat the followers of Halisha at the Shrine of Loyalty. By doing so,
you can earn "tickets." Once you have acquired over 700 tickets, Halisha himself will appear. By the way,
the creatures you must face are the Grave Scarab, Scavenger Scarab, Grave Ant, Scavenger Ant, Shrine Knight and Stander.


|
|
Emulate * | emulate |
| | The emulator currently associated with this breakpoint.
|
| |
◆ addressCallback()
| bool PutsCallBack::addressCallback |
( |
const Address & |
addr | ) |
|
|
virtual |
Call back method for address based breakpoints.
This routine is invoked during emulation, if this breakpoint has somehow been associated with this address. The callback can perform any operation on the emulator context it wants. It then returns true if these actions are intended to replace the action of the entire machine instruction at this address. Or it returns false if the machine instruction should still be executed normally.
- Parameters
-
| addr | is the address where the break has occurred |
- Returns
- true if the machine instruction should not be executed
Reimplemented from BreakCallBack.
The documentation for this class was generated from the following file:


[onload item to show]
[item to aniamte when mouseover on onload_item
[item to animate when click on mouseover_item]


Trajectory of ecosystem recovery in restored riparian zones in urban settings
EPA Grant Number: F5F11559Title: Trajectory of ecosystem recovery in restored riparian zones in urban settings
Investigators: Morse, Jennifer L.
Institution: Duke University
EPA Project Officer: Manty, Dale
Project Period: July 1, 2005 through August 1, 2008
Project Amount: $111,000
RFA: STAR Graduate Fellowships (2005) RFA Text | Recipients Lists
Research Category: Academic Fellowships
Objective:
Intact riparian zones remove nutrients, particularly nitrogen and phosphorus, from groundwater and surface runoff, thus improving water quality. Because streams and riparian zones in many urban areas are degraded and have diminished ecological functions, stream and floodplain restoration is becoming important to water quality management strategies. Understanding how riparian zones regain ecological functions following restoration is key to setting realistic performance criteria. This project will examine stream restoration sites along an age gradient study ecosystem development following disturbance and the role of restored riparian zones in processing nutrients.
This project will examine stream restoration sites along an age gradient, as a proxy for a long-term study, to address basic questions about ecosystem development following disturbance, as well as practical considerations for understanding the role of restored riparian zones in processing nutrients. By examining stream and floodplain restoration sites completed between 1989 and 2005, and comparing them to unrestored sites in non-urban areas and urban, degraded areas, I will test these general hypotheses: 1. Hydraulic connectivity is key to the recovery of ecosystem processes in restored riparian zones: successful restoration will lead to more variable water table depths and less incised channels; 2. Time since restoration will explain differences in ecosystem functions in restored riparian zones, as vegetation and soil processes begin to approach those of natural riparian zones; 3. Abiotic mechanisms of nutrient retention (e.g., P sorption) will be more important in younger restored sites, while biotic processes (e.g., microbial assimilation, denitrification, plant uptake) will be increasingly important controls on nutrient biogeochemistry in older restored sites.
Approach:
The National River Restoration Science Synthesis (NRRSS), led in part by Dr. Emily Bernhardt, compiled a database of over 35,000 river and stream restoration projects nationwide. This database enabled me to identify a well-documented, large population of stream restoration sites of varying ages, and I generated a map of channel reconfiguration projects in North Carolina for which the dates of completion and project contact information are known. I will use a three-tiered design in this study: I. Hydrogeomorphic classification, II. Indexes of Ecological Function, and III. Biogeochemical Processes.
Phase I: Hydrogeomorphic Survey for Site Selection. I will conduct an extensive field survey of stream and riparian restoration sites in urban and suburban areas of North Carolina, with the specific objectives to identify sites of different ages (time since restoration) to be studied more intensively in Phases II and III. The use of a time sequence of multiple study sites with known histories has been advocated and implemented where a long-term study at one site is not feasible. I will limit the population of channel reconfiguration projects to sites on 3rd or 4th order streams in the Piedmont physiographic province, to control for inter-site variability. I will assess hydraulic connectivity between stream channels and riparian zones by measuring channel incision in restoration sites. This survey will enable me to exclude from Phase II and III sites with re-incised channels, which would lack hydraulic connectivity between the stream and riparian zone.
Phase II: Indexes of Ecological Function. Based on results from Phase I, I will focus on 12 restoration sites and 6 complementary unrestored sites for more intense characterization of ecosystem properties. Restoration sites of similar hydrogeomorphic classification within the North Carolina Piedmont (to control for major physical differences between sites) will be chosen to represent an age gradient. The specific objective of Phase II is to apply a framework for evaluating restoration of ecological function across the age gradient of sites. The five evaluative axes in this method are 1) hydrology, 2) productivity, 3) decomposition, 4) community habitat, and 5) biogeochemistry. By measuring the same variables at reference and target sites, an ecosystem response surface model can be created. The parameters I will measure for this assessment have been shown to be important in evaluating impacted forested wetlands, and will be readily applicable to riparian zones.
Phase III: Biogeochemical Processes. The goal of Phase III is to explicitly link biogeochemical processes in the soil to hydrological flowpaths in the riparian zone; this design is essential to understanding biogeochemical processes and patterns in soils. Results from Phase II will allow me to select two restoration sites (one young and one old) for finer-scale, spatially explicit studies of soil processes along hydrological flowpaths in the riparian zone.
Expected Results:
Phase I: These results will enable an evaluation of channel incision following restoration. I expect to find that sites restored longer ago will have more stable, less incised channels than more recently restored sites, as the older sites will have had more time to establish a new equilibrium. Publication of these results will be relevant to watershed planners and engineers who design stream restoration projects.
Phase II: I anticipate that ecological functions in restored riparian zones will begin to approach patterns in non-urban reference sites with increasing age. I expect that the five ecological functions will follow different trajectories, with hydrology and decomposition recovering earlier than the plant community and biogeochemical characteristics. Productivity in a restored site would likely approach reference conditions more slowly than other parameters. These results may validate the use of ecosystem surface response models as tools for assessing the success of ecological restoration.
Phase III: I anticipate that abiotic processes (e.g., phosphorus sorption) will be more important in the younger restored site, while biotic processes (e.g., microbial assimilation, denitrification, plant uptake) will be increasingly important controls on nutrient biogeochemistry in the older restored site and the reference site.


Fraction Calculator
About this Project: In this project our goal was to overload mathmatical operators
to work with fractions. What I mean by that is when we type in something
like 1/2 and 2/3 into the console it will list out the resulst of
adding, subtracting, multiplying and dividing these fractions.
//Author: James Hagen
//Language: C++
//Date: Oct. 13/16
#include <iostream>
#include <conio.h>
#include <cstdio>
#include <regex>
using namespace std;
string firstFraction;
string secondFraction;
regex fractionValidation("(-?[0-9]*)\\s([0-9]*)/([1-9][0-9]*)");
string numbers[3];
string numerator;
string denominator;
class FractionMath {
//properties
private:
int numerator;
int denominator;
int highestCommonDeno;
//functions
public:
//default contsructor
FractionMath() {
numerator = 0;
denominator = 0;
}
//constructor with args
FractionMath(int nume, int deno) {
this->numerator = nume;
this->denominator = deno;
}
//getters and setters
int getNumerator() {
return numerator;
}
int getDenominator() {
return denominator;
}
int setNumerator(int i) {
this->numerator = i;
return 0;
}
int setNDenominator(int i) {
this->denominator = i;
return 0;
}
//***********************************************************************
//~~~~~~~~~~~~~~~~~~~overloaded Addition operator~~~~~~~~~~~~~~~~~~~~~~~~
//***********************************************************************
FractionMath operator+ (FractionMath &rightObj) {
int totalNume;
int totalDeno;
if (this->denominator != rightObj.denominator) {
totalNume = ((this->numerator * rightObj.denominator) + (rightObj.numerator * this->denominator));
totalDeno = (this->denominator * rightObj.denominator);
}
else {
totalNume = (this->numerator + rightObj.numerator);
totalDeno = (this->denominator);
}
return FractionMath(totalNume, totalDeno);
}
//***********************************************************************
//~~~~~~~~~~~~~~~~~~overloaded Subtraction operator~~~~~~~~~~~~~~~~~~~~~~
//***********************************************************************
FractionMath operator- (FractionMath &rightObj) {
int totalNume;
int totalDeno;
if (this->denominator != rightObj.denominator) {
totalNume = ((this->numerator * rightObj.denominator) - (rightObj.numerator * this->denominator));
totalDeno = (this->denominator * rightObj.denominator);
}
else {
totalNume = (this->numerator - rightObj.numerator);
totalDeno = (this->denominator);
}
return FractionMath(totalNume, totalDeno);
}
//***********************************************************************
//~~~~~~~~~~~~~~~~overloaded Multiplication operator~~~~~~~~~~~~~~~~~~~~~
//***********************************************************************
FractionMath operator* (FractionMath &rightObj) {
return FractionMath(this->numerator*rightObj.numerator,
this->denominator*rightObj.denominator);
}
//***********************************************************************
//~~~~~~~~~~~~~~~~~~~overloaded Division operator~~~~~~~~~~~~~~~~~~~~~~~~
//***********************************************************************
FractionMath operator/ (FractionMath &rightObj) {
if (rightObj.numerator == 0) {
return FractionMath(this->numerator,this->denominator);
}
return FractionMath(this->numerator*rightObj.denominator,
this->denominator*rightObj.numerator);
}
int findDenominator() {
for (int i = this->denominator; i < this->denominator; i--) {
if (denominator%i == 0 && numerator%i == 0 && i) {
highestCommonDeno = i;
}
}
return 0;
}
};
FractionMath fracOne;
FractionMath fracTwo;
FractionMath add(FractionMath frac1, FractionMath frac2);
FractionMath subtract(FractionMath frac1, FractionMath frac2);
FractionMath multiply(FractionMath frac1, FractionMath frac2);
FractionMath divide(FractionMath frac1, FractionMath frac2);
bool validateDivide(FractionMath frac1);
FractionMath reduce(FractionMath frac1);
bool inputValidation(string input);
int takeFirstInput();
int takeSecondInput();
int will;
int main() {
takeFirstInput();
takeSecondInput();
FractionMath fracAdd = add(fracOne, fracTwo);
FractionMath fracSub = subtract(fracOne, fracTwo);
FractionMath fracMul = multiply(fracOne, fracTwo);
FractionMath fracDiv;
reduce(fracAdd);
reduce(fracSub);
reduce(fracMul);
//*****************************
//~~~~~~~~~~~~Output~~~~~~~~~~~
//*****************************
cout << "if you add " << fracOne.getNumerator() << "/" << fracOne.getDenominator() << " And " <<
fracTwo.getNumerator() << "/" << fracTwo.getDenominator() << " The result is " << fracAdd.getNumerator()<< "/" <<
fracAdd.getDenominator() << endl;
cout << endl;
cout << "if you subtract " << fracOne.getNumerator() << "/" << fracOne.getDenominator() << " And " <<
fracTwo.getNumerator() << "/" << fracTwo.getDenominator() << " The result is " << fracSub.getNumerator() << "/" <<
fracSub.getDenominator() << endl;
cout << endl;
cout << "if you multiply " << fracOne.getNumerator() << "/" << fracOne.getDenominator() << " And " <<
fracTwo.getNumerator() << "/" << fracTwo.getDenominator() << " The result is " << fracMul.getNumerator() << "/" <<
fracMul.getDenominator() << endl;
cout << endl;
//validate that the numerator of the second fraction is not 0;
if (validateDivide(fracTwo)) {
fracDiv = divide(fracOne, fracTwo);
reduce(fracDiv);
cout << "if you Divide " << fracOne.getNumerator() << "/" << fracOne.getDenominator() << " And " <<
fracTwo.getNumerator() << "/" << fracTwo.getDenominator() << " The result is " << fracDiv.getNumerator() << "/" <<
fracDiv.getDenominator() << endl;
}
else {
cout << "if you Divide " << fracOne.getNumerator() << "/" << fracOne.getDenominator() << " And " <<
fracTwo.getNumerator() << "/" << fracTwo.getDenominator() << " The result is not possible..." << endl;
}
_getch();
return 0;
}
//adds the fractions
FractionMath add(FractionMath frac1, FractionMath frac2) {
return frac1 + frac2;
}
//subttracts the fractions
FractionMath subtract(FractionMath frac1, FractionMath frac2) {
return frac1 - frac2;
}
//multiplies the fractions
FractionMath multiply(FractionMath frac1, FractionMath frac2) {
return frac1 * frac2;
}
//divides the fractions
FractionMath divide(FractionMath frac1, FractionMath frac2) {
return frac1 / frac2;
}
//checks the numerator for 0
bool validateDivide(FractionMath frac1) {
if (frac1.getNumerator() == 0) {
return false;
}
else {
return true;
}
}
//reduces the fration
FractionMath reduce(FractionMath frac1) {
frac1.findDenominator();
return frac1;
}
//checks to see if the input is valid
bool inputValidation(string input) {
string expression = "[-]?[1-9]*\/[-]?[1-9][0-9]*";
regex ex(expression);
regex ex2("[-]?\\d+");
if (regex_match(input, ex)) {
return true;
}
else if (regex_match(input, ex2)) {
return true;
}
else if (input.empty()) {
return true;
}
else {
return false;
}
}
//gets the first input
int takeFirstInput() {
cout << "Enter your first real Fraction: " << endl;
getline(cin, firstFraction);
if (inputValidation(firstFraction)) {
string delimiter = "/";
numerator = firstFraction.substr(0, firstFraction.find(delimiter));
denominator = firstFraction.substr(2, firstFraction.find(delimiter));
fracOne.setNumerator(stoi(numerator));
fracOne.setNDenominator(stoi(denominator));
}
else {
cout << "please enter a valid input...." << endl;
main();
}
return 0;
}
//gets the second input
int takeSecondInput() {
cout << "Enter your Second real Fraction: " << endl;
getline(cin, secondFraction);
if (inputValidation(secondFraction)) {
string delimiter = "/";
numerator = secondFraction.substr(0, secondFraction.find(delimiter));
denominator = secondFraction.substr(2, secondFraction.find(delimiter));
fracTwo.setNumerator(stoi(numerator));
fracTwo.setNDenominator(stoi(denominator));
}
else {
cout << "please enter a valid input...." << endl;
takeSecondInput();
}
return 0;
}
-Credentials-
Programming languages: Java, Python, HTML5, CSS, C++, C#, J2EE, JavaScript, JQuery, XAML, XML
Software: Windows, Unity, Unix/Linux, MS Office products, VMWare, Adobe products(Photoshop and the like), Visual Studio (as well as blend), Eclipse,
GitHub shells/cmds
Hardware: 8 months of computer repair including laptop disassemble and reassembly.
Certificates: OHS and WHMIS
-Education-
2 year Diploma - Information Technology, Graduate 2018
Training in programming, web development, troubleshooting windows (xp, vista, 7, 8, 8.1, 10), computer hardware repair/troubleshooting and basic Networking
-Hobbies-
Playing video games, Magic The Gathering™, Solving puzzles, Figuring out programming logic behind software
-Things I've done-
~TLDR~ Skills I've learned through job experience: Ensuring customer satisfaction, find the fastest and best way to do something, how to communicate in very busy environments, how to work in small and large teams, Work place safety (OHS), and how to adhere to standards set in place by administrations.
I have done a wide variety of different jobs in my life, from making sandwiches at Arby's in Bedford to installing hardwood flooring all throughout the province. There are many different skills I've gained from all that I've done.
My first job ever was at Fader's Bottle Exchange in Lower Sackville NS. There I learned how to serve customers in a friendly and efficient manner to reduce the work load on the entire team. I also learned how the provinces recycling system works. I know it doesn't have much to do with IT but it's a good system to know and understand.
Then i worked for my father at J&J Custom Finish, an flooring instillation company used by a lot of the Flooring retailers in HRM. I would work on a 2-5 person team on a daily basis lugging construction equipment around the work sites throughout the day, installing mid-high quality hardwood and laminate flooring. This helped me learn how to communicate in a busy(and loud!) team environment and to ensure all my work was done at the highest level of qulity.
After these jobs I worked at the Arby's on Bedford highway for the last four months it was open. My position there was sandwich maker. Doing this taught me the importance of keeping a clean work environment, how to handle hazardous tools, as well as a lot of the food health and safety standards.
Finally as of now I work at NedTek Computer Solutions Inc in Lower Sackville. Here is where I learned most of my skills for problem solving and troubleshooting with technology. Throughout my career here I have repaired issues from full hardware failures to reloading windows operating systems.


Search for earthquakes occured with a magnitude greater than the entered magnitude
Earthquakes
{% for row in rows %}
{{row["mag"]}}
{% endfor %}


Date: 17/07/2020
Sprint 4 technical
As i was completing the Repl.it problems i found one to be quite challenging to complete.In order to overcome this i found that i had to console.log my results every step of the way in order to understand how to values were changing and what i was doing wrong. This allowed me to pinpoint the code that was giving me the error and edit it to be correct. Through this i understood how important console.log is and why it is one of the first things a programmer should learn how to do.
Date: 17/07/2020
Neuroplasticity
Neuroplasticity is the ability of the brain to form new neural connections throughout life. This can be achieved by means of practising a certain skill such as coding. By continually practising and retrieving information from your brain you can strengthen these neural links.As well as aiding in the learning of a new skill it can also help people who are suffering from some mental illness such as autism.
ReferenceGrowth Mindset
Growth Mindset is a way of thinking that ones talents can be gradually improved over time. This is in contrast to having a fixed mindset in which one thinks that his/her gifts are innate and has to be born with such gifts in order to achieve great things.I feel that if i implement a growth mindset into my learning journey it will allow me achieve alot more than a fixed mindset person would be able to. One way i can see if this mindset is working is to repeatedly test myself and see if im improving over time.
ReferenceDate: 6/07/2020
An analogy to describe the differences between HTML and CSS.
HTML can be thought as creating a room arranging the furniture and everything where CSS is styling everything deciding the wall colour etc.
Explain control flow and loops using an example process from everyday life, for example 'waking up' or 'brushing your teeth'. (But not those ones).
Control flow is the order in which the code executes from the beginning to the end.In this flow you may have loops in which you will continue looping through until you met some sort of condiiton for example in real life you shower everyday and the only way to break out of it is to shower and break the loop until the next day.
Describe what the DOM is and an example of how you might interact with it.
The DOM is the document object model and is a model which describes everything making up a page in a tree like model. It starts with the document and goes down to individual elements and text nodes. This allows programmers to access these elements on the DOM model and change the style and the functionality of the element.
Explain the difference between accessing data from arrays and objects.
To get the data from an array one must use the index of the corresponding data they want. Whereas objects require one to put the key name in order to access the data associated with it.
Explain what functions are and why they are useful.
Functions are useful as they allow one to execute a bunch of code all at once and allow one to control when the function is executed.
Date: 29/06/2020
First if we imagine that all our content that we write goes into a box we can better understand the differences between the three things. First the space between our actual content and the border is the padding. More padding means more space in the box. Next we have the border which is the space which is between the padding and the margin. Finally we have the margin which is the space outside the border. This affects how close or far our content is to another item.


| dataSetCacheManager.js |
|
65.85% |
27/41 |
36.36% |
4/11 |
72.73% |
8/11 |
65.85% |
27/41 |
| fileManager.js |
|
16.67% |
1/6 |
100% |
0/0 |
0% |
0/4 |
16.67% |
1/6 |
| getEncapsulatedImageFrame.js |
|
88.89% |
8/9 |
83.33% |
5/6 |
100% |
2/2 |
88.89% |
8/9 |
| getPixelData.js |
|
100% |
6/6 |
100% |
7/7 |
100% |
1/1 |
100% |
6/6 |
| getUncompressedImageFrame.js |
|
42.86% |
12/28 |
22.22% |
4/18 |
100% |
1/1 |
42.86% |
12/28 |
| index.js |
|
100% |
1/1 |
100% |
0/0 |
100% |
0/0 |
100% |
1/1 |
| loadFileRequest.js |
|
0% |
0/10 |
100% |
0/0 |
0% |
0/3 |
0% |
0/10 |
| loadImage.js |
|
51.92% |
27/52 |
42.86% |
6/14 |
61.54% |
8/13 |
51.92% |
27/52 |
| parseImageId.js |
|
62.5% |
5/8 |
50% |
1/2 |
100% |
1/1 |
62.5% |
5/8 |
| register.js |
|
100% |
4/4 |
100% |
0/0 |
100% |
1/1 |
100% |
4/4 |
| unpackBinaryFrame.js |
|
0% |
0/8 |
0% |
0/2 |
0% |
0/2 |
0% |
0/8 |


Create a record, Dog, with the values nrOfLegs, which is an Integer and name, which is a String. Give the variables some values.
A record cannot be simulated directly. It needs to be instantiated first.


{% extends 'base.html' %} {% load static %} {% load crispy_forms_tags %} {% block content %}
Sign up to see photos and videos from friends.
By signing up, you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service.
Already have an account? Log in


Dramatic footage shows shameless thugs smash cases to steal €1billion in jewellery
The Green Vault in Dresden, east Germany, was targeted by the brazen burglars who sneaked in through a tiny hole and swiped three sets of 18th-century jewellery
by Bradley Jolly, https://www.mirror.co.uk/authors/bradley-jolly/Dramatic footage captures burglars smash open cases to steal jewellery worth up to €1billion from a museum .
The security clip shows the crooks repeatedly batter through the cabinet in The Green Vault in Dresden, east Germany, today.
The raiders, are seen wearing torches on their heads, swinging axes at the glass cases.
Two black-clothed burglars are pictured running into the dark vault and targeting different sections of the secured cabinets.
In one of the world's biggest-ever heists, the hooded thugs also switched off a power supply and sneaked into the building through a tiny hole.
They got away with three sets of 18th-century jewellery and now police believe the raid is linked to a huge coin theft more than two years ago.
Officers told local media the gang may also be responsible for taking items worth $4.5million (£3.5m) from a museum in Berlin in 2017.
The jewellery ensembles in Dresden were commissioned by Saxony's former ruler Augustus the Strong in an 18th-century show of power.
Experts at the museum, who once boasted that their collection was "as secure as Fort Knox", said the value of the items stolen was "immeasurable" and pleaded with the crooks not to destroy them.
"We're dealing with priceless artistic and cultural treasures.
"We cannot give a value because it is impossible to sell," Marion Ackermann, the museum director, said.
Dirk Syndram, another director at the museum, told Bild : "Nowhere in any other collection in Europe have jewels or sets of jewels been preserved in this form and quantity.
"The value is really in the ensemble."
The gang fled in an an Audi A6 after the raid.
Police have since found a car matching its description burned out in an underground parking lot in the city.
A notice on the museum's website this morning states only that the building is closed today for 'organisational reasons'. It is not expected to re-open before Wednesday.
Augustus the Strong competed with French monarch Louis XIV to assemble the most extravagant jewellery.
The probe continues.


When DeepChem was first created, Tensorflow had no standard interface
for datasets or models. We created the Dataset and Model classes to fill
this hole. More recently, Tensorflow has added the tf.data
module as
a standard interface for datasets, and the tf.estimator
module as a
standard interface for models. To enable easy interoperability with
other tools, we have added features to Dataset and Model to support
these new standards.
This example demonstrates how to use these features. Let’s begin by loading a dataset and creating a model to analyze it. We’ll use a simple MultiTaskClassifier with one hidden layer.
import deepchem as dc
import tensorflow as tf
import numpy as np
tasks, datasets, transformers = dc.molnet.load_tox21()
train_dataset, valid_dataset, test_dataset = datasets
n_tasks = len(tasks)
n_features = train_dataset.X.shape[1]
model = dc.models.MultiTaskClassifier(n_tasks, n_features, layer_sizes=[1000], dropouts=0.25)
Loading dataset from disk.
Loading dataset from disk.
Loading dataset from disk.
We want to train the model using the training set, then evaluate it on the test set. As our evaluation metric we will use the ROC AUC, averaged over the 12 tasks included in the dataset. First let’s see how to do this with the DeepChem API.
model.fit(train_dataset, nb_epoch=100)
metric = dc.metrics.Metric(dc.metrics.roc_auc_score, np.mean)
print(model.evaluate(test_dataset, [metric]))
computed_metrics: [0.7081719239992621, 0.865129545326814, 0.836842947009276, 0.7701224617961064, 0.7081635765485087, 0.7911911911911912, 0.7207671300893743, 0.6592307518932563, 0.7976869777868352, 0.7409154581410679, 0.8243317675424011, 0.7112435328898743]
{'mean-roc_auc_score': 0.7611497720178306}
Simple enough. Now let’s see how to do the same thing with the Tensorflow APIs. Fair warning: this is going to take a lot more code!
To begin with, Tensorflow doesn’t allow a dataset to be passed directly
to a model. Instead, you need to write an “input function” to construct
a particular set of tensors and return them in a particular format.
Fortunately, Dataset’s make_iterator()
method provides exactly the
tensors we need in the form of a tf.data.Iterator
. This allows our
input function to be very simple.
def input_fn(dataset, epochs):
x, y, weights = dataset.make_iterator(batch_size=100, epochs=epochs).get_next()
return {'x': x, 'weights': weights}, y
Next, you have to use the functions in the tf.feature_column
module
to create an object representing each feature and weight column (but
curiously, not the label column—don’t ask me why!). These objects
describe the data type and shape of each column, and give each one a
name. The names must match the keys in the dict returned by the input
function.
x_col = tf.feature_column.numeric_column('x', shape=(n_features,))
weight_col = tf.feature_column.numeric_column('weights', shape=(n_tasks,))
Unlike DeepChem models, which allow arbitrary metrics to be passed to
evaluate()
, estimators require all metrics to be defined up front
when you create the estimator. Unfortunately, Tensorflow doesn’t have
very good support for multitask models. It provides an AUC metric, but
no easy way to average this metric over tasks. We therefore must create
a separate metric for every task, then define our own metric function to
compute the average of them.
def mean_auc(labels, predictions, weights):
metric_ops = []
update_ops = []
for i in range(n_tasks):
metric, update = tf.metrics.auc(labels[:,i], predictions[:,i], weights[:,i])
metric_ops.append(metric)
update_ops.append(update)
mean_metric = tf.reduce_mean(tf.stack(metric_ops))
update_all = tf.group(*update_ops)
return mean_metric, update_all
Now we create our Estimator
by calling make_estimator()
on the
DeepChem model. We provide as arguments the objects created above to
represent the feature and weight columns, as well as our metric
function.
estimator = model.make_estimator(feature_columns=[x_col],
weight_column=weight_col,
metrics={'mean_auc': mean_auc},
model_dir='estimator')
INFO:tensorflow:Using default config.
INFO:tensorflow:Using config: {'_model_dir': 'estimator', '_tf_random_seed': None, '_save_summary_steps': 100, '_save_checkpoints_steps': None, '_save_checkpoints_secs': 600, '_session_config': None, '_keep_checkpoint_max': 5, '_keep_checkpoint_every_n_hours': 10000, '_log_step_count_steps': 100, '_service': None, '_cluster_spec': <tensorflow.python.training.server_lib.ClusterSpec object at 0x12d39bef0>, '_task_type': 'worker', '_task_id': 0, '_master': '', '_is_chief': True, '_num_ps_replicas': 0, '_num_worker_replicas': 1}
We are finally ready to train and evaluate it! Notice how the input function passed to each method is actually a lambda. This allows us to write a single function, then use it with different datasets and numbers of epochs.
estimator.train(input_fn=lambda: input_fn(train_dataset, 100))
print(estimator.evaluate(input_fn=lambda: input_fn(test_dataset, 1)))
INFO:tensorflow:Create CheckpointSaverHook.
INFO:tensorflow:Saving checkpoints for 1 into estimator/model.ckpt.
INFO:tensorflow:loss = 1716.8385, step = 1
INFO:tensorflow:global_step/sec: 63.5117
INFO:tensorflow:loss = 804.13416, step = 101 (1.576 sec)
INFO:tensorflow:global_step/sec: 41.9688
INFO:tensorflow:loss = 682.90265, step = 201 (2.383 sec)
INFO:tensorflow:global_step/sec: 65.7841
INFO:tensorflow:loss = 805.00336, step = 301 (1.520 sec)
INFO:tensorflow:global_step/sec: 42.4989
INFO:tensorflow:loss = 466.05975, step = 401 (2.353 sec)
INFO:tensorflow:global_step/sec: 65.1989
INFO:tensorflow:loss = 704.69446, step = 501 (1.534 sec)
INFO:tensorflow:global_step/sec: 40.9395
INFO:tensorflow:loss = 450.0899, step = 601 (2.443 sec)
INFO:tensorflow:global_step/sec: 41.2419
INFO:tensorflow:loss = 349.05804, step = 701 (2.424 sec)
INFO:tensorflow:global_step/sec: 60.7104
INFO:tensorflow:loss = 338.63837, step = 801 (1.647 sec)
INFO:tensorflow:global_step/sec: 40.4742
INFO:tensorflow:loss = 351.22452, step = 901 (2.471 sec)
INFO:tensorflow:global_step/sec: 63.2702
INFO:tensorflow:loss = 325.0889, step = 1001 (1.581 sec)
INFO:tensorflow:global_step/sec: 42.8089
INFO:tensorflow:loss = 334.04944, step = 1101 (2.336 sec)
INFO:tensorflow:global_step/sec: 41.0803
INFO:tensorflow:loss = 299.88806, step = 1201 (2.434 sec)
INFO:tensorflow:global_step/sec: 62.1056
INFO:tensorflow:loss = 301.3775, step = 1301 (1.610 sec)
INFO:tensorflow:global_step/sec: 41.056
INFO:tensorflow:loss = 345.18347, step = 1401 (2.436 sec)
INFO:tensorflow:global_step/sec: 61.8764
INFO:tensorflow:loss = 220.67397, step = 1501 (1.616 sec)
INFO:tensorflow:global_step/sec: 39.5263
INFO:tensorflow:loss = 232.79745, step = 1601 (2.529 sec)
INFO:tensorflow:global_step/sec: 63.3011
INFO:tensorflow:loss = 185.26181, step = 1701 (1.580 sec)
INFO:tensorflow:global_step/sec: 40.9611
INFO:tensorflow:loss = 188.3253, step = 1801 (2.441 sec)
INFO:tensorflow:global_step/sec: 41.6845
INFO:tensorflow:loss = 190.70108, step = 1901 (2.399 sec)
INFO:tensorflow:global_step/sec: 64.629
INFO:tensorflow:loss = 162.53293, step = 2001 (1.547 sec)
INFO:tensorflow:global_step/sec: 42.2537
INFO:tensorflow:loss = 161.35915, step = 2101 (2.367 sec)
INFO:tensorflow:global_step/sec: 64.5807
INFO:tensorflow:loss = 145.4078, step = 2201 (1.548 sec)
INFO:tensorflow:global_step/sec: 41.9227
INFO:tensorflow:loss = 120.111115, step = 2301 (2.385 sec)
INFO:tensorflow:global_step/sec: 42.6787
INFO:tensorflow:loss = 151.61371, step = 2401 (2.343 sec)
INFO:tensorflow:global_step/sec: 63.3021
INFO:tensorflow:loss = 136.98262, step = 2501 (1.580 sec)
INFO:tensorflow:global_step/sec: 42.6588
INFO:tensorflow:loss = 89.13097, step = 2601 (2.344 sec)
INFO:tensorflow:global_step/sec: 64.7405
INFO:tensorflow:loss = 101.06474, step = 2701 (1.545 sec)
INFO:tensorflow:global_step/sec: 43.2237
INFO:tensorflow:loss = 116.96815, step = 2801 (2.314 sec)
INFO:tensorflow:global_step/sec: 43.4182
INFO:tensorflow:loss = 84.83482, step = 2901 (2.303 sec)
INFO:tensorflow:global_step/sec: 65.1042
INFO:tensorflow:loss = 145.16194, step = 3001 (1.536 sec)
INFO:tensorflow:global_step/sec: 42.3864
INFO:tensorflow:loss = 92.99321, step = 3101 (2.359 sec)
INFO:tensorflow:global_step/sec: 64.7556
INFO:tensorflow:loss = 65.05712, step = 3201 (1.544 sec)
INFO:tensorflow:global_step/sec: 42.6498
INFO:tensorflow:loss = 78.92055, step = 3301 (2.345 sec)
INFO:tensorflow:global_step/sec: 65.4527
INFO:tensorflow:loss = 77.93735, step = 3401 (1.528 sec)
INFO:tensorflow:global_step/sec: 42.8958
INFO:tensorflow:loss = 57.02035, step = 3501 (2.332 sec)
INFO:tensorflow:global_step/sec: 43.3849
INFO:tensorflow:loss = 95.91443, step = 3601 (2.305 sec)
INFO:tensorflow:global_step/sec: 65.1448
INFO:tensorflow:loss = 75.03122, step = 3701 (1.535 sec)
INFO:tensorflow:global_step/sec: 42.6941
INFO:tensorflow:loss = 62.8435, step = 3801 (2.342 sec)
INFO:tensorflow:global_step/sec: 65.2233
INFO:tensorflow:loss = 45.883224, step = 3901 (1.533 sec)
INFO:tensorflow:global_step/sec: 43.4815
INFO:tensorflow:loss = 57.56656, step = 4001 (2.300 sec)
INFO:tensorflow:global_step/sec: 41.5674
INFO:tensorflow:loss = 70.33858, step = 4101 (2.406 sec)
INFO:tensorflow:global_step/sec: 58.5978
INFO:tensorflow:loss = 67.34745, step = 4201 (1.707 sec)
INFO:tensorflow:global_step/sec: 39.8156
INFO:tensorflow:loss = 46.03079, step = 4301 (2.511 sec)
INFO:tensorflow:global_step/sec: 60.5059
INFO:tensorflow:loss = 40.959454, step = 4401 (1.653 sec)
INFO:tensorflow:global_step/sec: 41.7228
INFO:tensorflow:loss = 36.393044, step = 4501 (2.397 sec)
INFO:tensorflow:global_step/sec: 42.4976
INFO:tensorflow:loss = 46.14415, step = 4601 (2.353 sec)
INFO:tensorflow:global_step/sec: 66.1396
INFO:tensorflow:loss = 41.93784, step = 4701 (1.512 sec)
INFO:tensorflow:global_step/sec: 42.5402
INFO:tensorflow:loss = 29.39001, step = 4801 (2.351 sec)
INFO:tensorflow:global_step/sec: 65.0227
INFO:tensorflow:loss = 29.608704, step = 4901 (1.538 sec)
INFO:tensorflow:global_step/sec: 43.692
INFO:tensorflow:loss = 43.265915, step = 5001 (2.289 sec)
INFO:tensorflow:global_step/sec: 65.8827
INFO:tensorflow:loss = 41.69668, step = 5101 (1.518 sec)
INFO:tensorflow:global_step/sec: 42.4384
INFO:tensorflow:loss = 28.208687, step = 5201 (2.356 sec)
INFO:tensorflow:global_step/sec: 42.4864
INFO:tensorflow:loss = 34.643417, step = 5301 (2.354 sec)
INFO:tensorflow:global_step/sec: 66.223
INFO:tensorflow:loss = 46.616447, step = 5401 (1.510 sec)
INFO:tensorflow:global_step/sec: 42.0575
INFO:tensorflow:loss = 42.339645, step = 5501 (2.378 sec)
INFO:tensorflow:global_step/sec: 65.1812
INFO:tensorflow:loss = 94.012146, step = 5601 (1.534 sec)
INFO:tensorflow:global_step/sec: 43.1405
INFO:tensorflow:loss = 25.879742, step = 5701 (2.318 sec)
INFO:tensorflow:global_step/sec: 43.209
INFO:tensorflow:loss = 35.351685, step = 5801 (2.314 sec)
INFO:tensorflow:global_step/sec: 65.5692
INFO:tensorflow:loss = 12.110611, step = 5901 (1.525 sec)
INFO:tensorflow:global_step/sec: 42.3864
INFO:tensorflow:loss = 19.612688, step = 6001 (2.359 sec)
INFO:tensorflow:global_step/sec: 65.1961
INFO:tensorflow:loss = 31.003126, step = 6101 (1.534 sec)
INFO:tensorflow:global_step/sec: 42.9087
INFO:tensorflow:loss = 21.030697, step = 6201 (2.330 sec)
INFO:tensorflow:Saving checkpoints for 6300 into estimator/model.ckpt.
INFO:tensorflow:Loss for final step: 19.216248.
INFO:tensorflow:Starting evaluation at 2018-03-06-22:55:47
INFO:tensorflow:Restoring parameters from estimator/model.ckpt-6300
INFO:tensorflow:Finished evaluation at 2018-03-06-22:55:49
INFO:tensorflow:Saving dict for global step 6300: global_step = 6300, loss = 6348.7153, mean_auc = 0.7047531
{'loss': 6348.7153, 'mean_auc': 0.7047531, 'global_step': 6300}
That’s a lot of code for something DeepChem can do in three lines. The Tensorflow API is verbose and somewhat confusing. It has seemingly arbitrary limitations, like assuming a model will only ever have one output, and therefore only allowing one label. But for better or worse, it’s a standard.
Of course, if you just want to use a DeepChem model with a DeepChem
dataset, there is no need for any of this. Just use the DeepChem API.
But perhaps you want to use a DeepChem dataset with a model that has
been implemented as an estimator. In that case,
Dataset.make_iterator()
allows you to easily do that. Or perhaps you
have higher level workflow code that is written to work with estimators.
In that case, make_estimator()
allows DeepChem models to easily fit
into that workflow.


CurveLocation objects describe a location on Curve objects, as defined by the curve parameter, a value between 0 (beginning of the curve) and 1 (end of the curve). If the curve is part of a Path item, its index inside the path.curves array is also provided.
The class is in use in many places, such as path.getLocationAt(offset, isParameter), path.getLocationOf(point), Path#getNearestLocation(point),{@linkPathItem#getIntersections(path), etc.


Govardhan Puja and Diwali: Festivities of love and harmony
by A. Kurniawan UlungThe exuberant Govardhan Puja festival and Diwali mean so much more to the Hindu community in Jakarta than just being traditional religious celebrations. A plethora of twinkling candles and flickering oil lamps illuminated every corner of the Sri Nilacala Dharma temple in Pasar Baru, Central Jakarta, in the evening of Oct. 29, casting a glowing light over a large variety of vegetarian food that Hindus offered to Lord Krishna as a sign of gratitude. The foods –– ranging from fruits and fried snacks to traditional cakes –– were arranged in a mountain-shaped pile. They were consecrated by the Hindus who sat cross-legged on the floor embellished with Rangoli (artistic patterns of colored sand and rice believed to bring fortune). A gift to God: A mountain of food stands during the celebration of Govardhan Puja at Sri Nilacala Dharma temple in Pasar Baru, J...
LOG IN
Don't have an account? Register here
Forgot Password ?
Log in with your social account


The extension
classes allow you to extend Jdbi
's
functionality by declaring interface types that may attach to Handle
instances. An attached extension creates an instance of the interface that
wraps method invocations in an extension context. The context has a
configuration and remembers the currently executing extension method.
An ExtensionFactory instance provides the actual extension instances and
implements the behavior of the extension.
Some built in features such as SQL Objects are themselves implemented as extensions.