Moving into development is the first step, of course. Long term I’m still aiming to work up to more software architecture and design type positions, but I think that’s something I’ve mentally pushed further into the future based on how much I’ve enjoyed programming in foundations.While I love taking a high level view of complex problems and working through all the little pieces, I don’t think I’ll be able to give up an addiction to those little eureka moments that I get while coding for a while!
As to where I’d like to be doing it, I don’t really have concrete goals around specific industries or companies, but overall I want to be creating and working on things that people actually use and enjoy and my goal is to be doing that work in a place that’s focused on creativity and wants to have some fun with it. I do know of at least one actual company that’s like that, possibly two, in the creative and media space, so that’s likely the direction I’ll head in.
They’ll be similar in root to the ones from foundations, but different in manifestation.
My strengths will still lie in my passion for learning, curiosity and enjoyment for problem solving but will involve a little more of my enjoyment for helping others as well, since we’ll be working much closer together through the journey.
That resilience hasn’t changed much, foundations has really emphasised how much I actually enjoy getting stuck, running into roadblocks and going down rabbit holes to find solutions - if anything that’s a strength that’s grown!
My limitations will also be similar, not least my ADHD which I can see affecting Bootcamp a little differently. While in Foundations it’s not been a major limitation, it’s meant I had to be very careful about ensuring I have the structure and routine around me that I need.
Heading into Bootcamp, I can see this being something I’ll be working on when it comes to pair programming and teamwork in general. While I enjoy working alongside others, helping and cheerleading each other, I struggle more when it comes to working with others. I struggle a lot with explaining my thought processes, feelings and generally connecting my thinking and working with other people. But as with all things, being aware of it and keeping tabs on myself is going to make it easier to deal with, even if it’s still going to be a major challenge.
Working closely with others could be a challenge. I’ve been able to do well with it so far in life, but that’s mainly been each person working on their own tasks as an overall group, as opposed to two people working directly on the same task or problem, so that’ll be a learning experience for sure!
Keeping focused could be a challenge in later weeks. My brain absolutely adores novelty, stress and challenge so I doubt there will be any issue keeping focused in the earlier portions, but after a few weeks I can see the novelty wearing off a little as the space, work and people become more familiar which is where I’ll likely have to really keep on top of myself and my work.
Beyond the focus, working super closely in pairs or small groups is a little newer for me. I’ve never had any issue working in groups and teams, or with communicating with a group, but the kind of paired up work where both are working on the same task is newer for me so that’s something I’ll be looking to learn and develop.
General guidance, understanding and encouragement are going to be pretty big.
We all work in different ways, struggle with different things and will likely require different support - for me that’ll be around getting the structure and direction I need to work effectively. I’m not great with any deadline longer than the current day normally, because long stretches of unstructured time are basically an off switch for my brain, so structure is going to be hugely important.
Beyond that structure, regular check ins and understanding are probably my biggest focus.
That I get it done well! Workloads aren’t an issue for me, so long as I’m planning my time and routines properly. That’ll look like basically having a pretty planned out day and week so I can keep myself accountable, and so I can be sure I’m delivering what everyone around me requires.I also expect myself to be as involved as possible with my peers, cohort and EDA as a whole. Any journey is easier and more enjoyable if you’re sharing it with others and feel a part of something. I’ll also need to keep tabs on how I’m connecting and communicating and ensure I’m noticing when it’s too little, and especially when it’s too much.
Lastly, I expect myself to have fun with it! None of this getting stressed and panicked nonsense, I intend to enjoy this experience, be curious about everything, focus on the fun and excitement and get as much out as possible. Instead of letting struggles build up, I’ll be finding help as soon as I feel I’m not super pumped and happy. As before, I’ll be asking my peers first - we’re a team and it’s important for us all to be working together.If it’s something more related to Bootcamp overall or not something any of us have an answer to, that’ll be when I turn to the facilitators and ask them.
My goal is to move through development, ideally in the web/applications space, with a view to growing into an Architect position.
I love technology and I enjoy coding very much, but what I enjoy most is solving problems, designing solutions and holding all that information in my head at once and making it work.
So starting out by solving smaller problems with code, moving on to creating larger and more complicated pieces of work and eventually stepping up to designing them from scratch, making them fit the problems at hand and leading others feels like a solid path to me.
Well let’s start off with the positives, some strengths.
If I’m really enjoying a particularly subject, challenge or working towards a goal I truly value, I tend to absorb information fairly well. I genuinely have a passion for learning as much as possible about just about any subject of interest, and having a true passion for your day to day work is about the best way to make sure it’s a success!
I’m also very resilient and persistent. When problems come up, big or small, which they always tend to do, I tend not to get stressed out or panic or walk away from the issue. For me, each potential setback is just another step that has to be taken to get to the endpoint, which I’m hoping will work well in the development world where the problems are endless but the solutions are oh so satisfying.
On to the limitations.
Firstly, my attention span. I’ve mentioned it a couple times here and there but I have ADHD and have done my whole life, although I only received an official diagnosis a few months before coming to EDA (in fact, waiting for the diagnosis is part of why I waited to enroll).
As far as limitations go, an actual learning-related disorder is a big one but one that is being very well managed and it’s something that I’ve made huge progress on in the past few months, which is a big source of pride for me.
It still comes up every now and then, but right now it’s very much under control and so far hasn’t interfered with me working through sprints 1 and 2, but it’s something I do have to be aware of just in case.
I also struggle to actually ask for help. A good friend (and former manager) of mine and I had a chat about this and we basically decided that everyone sits somewhere on a scale from Asker to Googler.
Some people come across something they don’t understand and their first instinct is to ask someone else what it means, escalating up levels of experience/knowledge/seniority until they get the information.
Others will turn to Google and escalate through various searches to find their answer.
Where you sit on the spectrum basically comes down to how long it takes you to give up on searching yourself and raise your hand to ask someone else.
Our conclusion was that I sit about as far to the Google side of the spectrum as possible, which can be good in that I tend to learn a lot more that way and it means I solve problems myself rather than roping in others who are probably focusing on their own work, but my reluctance to ask for help definitely can lead to me spending way too long down a rabbit hole trying to solve a problem that the person 2 metres to my left already knows the answer to.
First, how will I manage myself:
I tend to be very output or goal oriented. My method throughout these first sprints has been to check the learning competencies and timebox for an idea of how to work through the section, then work through the tasks one by one until they’re completed.My approach is always to break down any large segment into individual tasks that I need to perform, then order them in a logical way and work down the list.
Working in a team, I tend to do things in a similar way. Overall, the team has a goal and to achieve that goal certain criteria needs to be met. If each person is responsible for a set of criteria and understands the tasks required to fulfill them, I’ve found it’s been pretty straightforward to know where we’re all at, how we’re tracking, which tasks are dependent on others and so on. Hasn’t failed me yet!
When it comes to things building up and getting hectic:
I like to think I do well under pressure. I’ve been in stressful situations plenty of times, where tasks are piling up under tight deadlines and I think there are a few aspects to getting through those times.Firstly, prioritising tasks, understanding which are totally non-negotiable, which can be reduced, which can be shifted back and so on, is very useful. If I’ve got 8 hours of work and only 5 hours to do it, there’s likely a few things that can have less time spent if they’re not critical, or can be done to a sort of MVP level and enhanced later or can have their deadlines extended.In those situations, communicating with anyone who is requiring my outputs is my next move, get those expectations set ASAP so they’re not expecting a result when one isn’t coming.If that’s not working, it’s usually time to stand up, get out of the office/room/building, switch off the tech and clear my head. That might just be going for a walk, grabbing a coffee or whatever. That’s usually where discussing it with others comes in, because they can either help directly with the problem, or at least act as a wall to bounce off - providing they’re willing, of course!
Another logical, maths-y answer here. If, say, I have a timebox saying that 4 tasks should be taking me 2 hours and I’ve passed the half hour mark and aren’t close to getting the first one done, I’m struggling and it’s time to change the approach. If I’ve gotten to that point, my own problem solving likely isn’t giving me the solution so that’s where others come in.My rough path of escalation would be to start with my teammates, whether that’s asking in slack (either foundations, cohort or code-help-desk) or asking in person if we’re all together. In the past, that solved the vast majority of problems already.
If my teammates don’t have the answer, or can’t figure it out without impacting their work, then we’re going up the ladder to EDA staff. That’ll be whoever is the facilitator I’m working with in foundations or bootcamp. This is also where I’d go for more ‘meta’ questions; is this the correct format for submission, am I working through this content in the right way, and so on, since my cohort is learning it at the same time I am!
A few things, obviously being available to answer burning questions is important, within reason. I’m fine with a 24 hour response time, really. People have their own work to be getting on with!
Patience is also important. I haven’t hit any massive roadblocks just yet, but this is only the end of Sprint 2 so things are going to get a lot tougher and I’m sure there’ll be times where I can’t quite wrap my head around a concept on the first try!
Lastly, mental health is going to matter. I mentioned I do well with stress, but when it does get rough I have a tendency to avoid asking for help for longer than I really should, so having a facilitation team that understands the struggles likely to come (and I’m sure they’re pretty experienced at this!) is going to be a huge help.
Absolutely nothing! The only rigidly scheduled part of my daily routine was my job, which I left to join EDA, so feel free to absorb as much of my time as you like! A little time off on weekends would be nice, of course, but I’m pretty comfortable making this the centre of my world for the foreseeable future!


DualSBAdoption
Rather than aborting your lock+homescreen status bar, look to us for adoption instead
Compatible with iOS 12
Open Source
Contact Me<EMAIL_ADDRESS>Paypal


Arctic Monkeys’ former bassist Andy Nicholson considered suicide following “soul-destroying” departure
"I was very close to not being here..."
Arctic Monkeys‘ former bassist Andy Nicholson has opened up on his “soul-destroying” departure from the band.
The musician, who released a solo EP under his Goldteeth moniker earlier this year, formed the indie outfit back in 2002 alongside Alex Turner, Matt Helders, and Jamie Cook.
After taking a three-week break from touring commitments in 2006, Nicholson was permanently replaced by Nick O’Malley – who had initially joined the Monkeys on a temporary basis. Since then, he’s led a prolific life as a musician, DJ, record producer, and photographer – forming the band Mongrel, as well as briefly joining Reverend & The Makers, Lords of Flatbush and hip-hop collective Clubs & Spades, as well as producing for Toddla T, Swindle, Tom Prior and Terri Walker among others.
In a new interview on The Michael Anthony Show, Nicholson discussed the moment he was told he would not be returning to Arctic Monkeys.
“It was probably one of the few soul-destroying moments of my life,” he said on the podcast, which you can listen to in full below.
Episode 53: Via Hillsborough, Please (ft Andy Nicholson)
Episode 53: Via Hillsborough, Please (ft Andy Nicholson)Starting with three Sheffield kids who had one guitar between them, Arctic Monkeys rise to becoming the most culturally significant British band of their era was not just unlikely but also uniquely fascinating.
“I remember being in that room once they said [he’d been replaced] and I remember thinking, ‘Just try and be solid about this’. I remember I shook all three of their hands and said, ‘Good luck’. I still to this day don’t really know the full reason of what happened to me or why it happened.”
Nicholson went on to say that he contemplated suicide as the following three years led him down a “dark” path.
“I was very close to not being here, do you know what I mean?” he said. “And then managing to talk to people, and getting through it… time heals everything.”
Nicholson added: “I do remember watching them headline Glastonbury [2007] on television, and I was just sat at home on my own… just watching it. Just crying watching them headline. Can you imagine what that’s like?”
Later, Nicholson explained that he’s now back on good terms with the band. “They were at my wedding and I speak to them as much as I can,” he said, adding that “time healed a lot of wounds”.
Goldteeth
Speaking to NME about his current relationship with the band earlier this year, Nicholson said: “When they’re back in Sheffield we go out for some food or if I happen to be in the same country as them then we try to meet up when we can and text. It’s one of those things when you grow up; they’re busy doing their thing and I’m busy doing mine. It’s usually Christmases and birthdays when we exchange texts but we see each other when we can.”
For help and advice on mental health:
- ‘Am I depressed?‘ – Help and advice on mental health and what to do next
- Help Musicians UK – Around the clock mental health support and advice for musicians
- Music Support Org – Help and support for musicians struggling with alcoholism, addiction, or mental health issues
- YOUNG MINDS – The voice for young people’s health and wellbeing
- CALM – The Campaign Against Living Miserably for young men
- Time To Change – Let’s end mental health discrimination
- The Samaritans – Confidential support 24 hours a day


AAAI-19 Workshop onNetwork Interpretability for Deep Learning |
This workshop aims to bring together scientists, engineers, students in both academic and industrial communities who concern themselves about the interpretability of deep learning techniques and, more importantly, the safety of applying these techniques in real life use cases including medical diagnosis and autonomous driving. Ultimately efforts along this direction are expected to open the black box of deep neural networks and lead to interpretable knowledge representations. The main theme of the workshop discussion, therefore, is to build up consensus in this emerging field, and in particular, to clarify the motivation, typical methodologies, prospective trends, and potential industrial applications of boosted interpretability of neural networks.
We are calling for extended abstracts with 2—4 pages to be showcased at a poster session along with short talk spotlights. We are also accepting full submissions with 6—8 pages which will not be included in the Proceedings of AAAI 2019, but we will at the option of the authors provide a link to the relevant arXiv submission.
Please submit workshop papers to<EMAIL_ADDRESS>Submission deadline: November 5, 2018
Notification date: November 26, 2018
Please contact Quanshi Zhang if you have question.


Estimates the covariate-adjusted Receiver Operating Characteristic (AROC) curve and pooled (unadjusted) ROC curve by different methods. Inacio de Carvalho, V., and Rodriguez-Alvarez, M. X. (2018) <arXiv:1806.00473>.
| Version: | 1.0 |
| Imports: | stats, grDevices, graphics, splines, np, Matrix, Hmisc, MASS, moments |
| Published: | 2018-06-10 |
| Author: | Maria Xose Rodriguez-Alvarez [aut, cre], Vanda Inacio de Carvalho [aut] |
| Maintainer: | Maria Xose Rodriguez-Alvarez <mxrodriguez at bcamath.org> |
| License: | GPL-2 | GPL-3 [expanded from: GPL] |
| NeedsCompilation: | no |
| CRAN checks: | AROC results |
| Reference manual: | AROC.pdf |
| Package source: | AROC_1.0.tar.gz |
| Windows binaries: | r-devel: AROC_1.0.zip, r-release: AROC_1.0.zip, r-oldrel: AROC_1.0.zip |
| OS X binaries: | r-release: AROC_1.0.tgz, r-oldrel: AROC_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=AROC to link to this page.


|
LiquidFun Paint
Create art that moves, shakes, and delights.
|
This document describes the changes to LiquidFun Paint present in each release. Releases are listed in reverse chronological order, with the most recent release at the top of the page and the oldest release at the bottom.
View the entire set of changes in a release of LiquidFun by doing one of the following:
git log --oneline --decorate=full
to view the list of changes.The initial release of LiquidFun Paint is available for download from the 1.0 release release page.


Welcome To Our Online Learning Community!
Login
Email
Password
Show password
Login
Need an account!
Register


A multiplayer fight based RPG with attributes determined by real time stock prices.
This website allows users to add food items in their possession onto a virtual database and then search for recipes based off of those items to create a shopping-list for items not in their store. It also provides the user with the locations of grocers in their current area.
Space Gifs taps into the GIPHY API and allows users to search for space-themed gifs using the pre-created buttons. One may also utilize the text-box to add their own button with any desired topic.
A timed quiz where the user must answer multiple-choice trivia questions (subject related to dogs in this particular application) before the timer runs out.
A simple game of word-guess. The program chooses a country from an array of countries, and the user has to guess which country it is in 2x the amount in letters.
A guessing-game where a user must reach a randomly-generated 'Number to Hit' without going over by clicking on one of four crystals, each with their own random values, to increase the current user score.
A matchmaking site which takes in answers from a user and matches them with another "person" of similar personality stored in a server-side array.
A burger-logger with MySQL, Node, Express, Handlebars and a homemade ORM. Follows the MVC design pattern.


You can access it on the account details page in the "Billing Summary" tab.
Click on the "Update Interest" button and a new popup will open. The interest is calculated and the new invoice appears. The technician must print out this invoice and mail it to the claimant. It will not be printed by the nightly batch process. If the printer jams or the paper is lost, you can reprint this invoice on the same day that you updated the interest. The "Update Interest" button is still enabled so you can click it again. Clicking on it again brings up a new prompt. When you click "OK", the same invoice appears again because the program did not do another calculation.


On Nov. 6, Decision Desk HQ declared Joe Biden the projected winner of the 2020 presidential election, exceeding 270 electoral votes. Incumbent president Donald Trump and his campaign team believe, with little to no evidence, those numbers do not match reality, and the election results have been tampered with in the process.
Since the start of election season, people have been asking themselves serious questions and making important decisions. As citizens, the primary role of voting has been completed. The people of the U.S. are now faced with new questions — questions that will only be answered with time.
No matter what people believe, those allegations have left the American people questioning much more than just their mental health. Election season itself can be stressful and, with all of today’s current struggles, those factors can begin to truly have a negative effect on mental health, Chris Henry, clinical care manager at Counseling and Psychological Services, or CPS, at Ohio University, said in an email.
“We all have been distressed by the things we have seen on our screens this year and it is easy to fall into the trap of the endless cycle of cynicism and negativity,” Henry said in an email. “Be mindful of the voices you are listening to and seek out the resources that might offer solutions and optimism.”
JB Baker, a senior studying political science at OU whose pronouns are they/them, understands the importance of the election. They also understand just how important it is to mind your mental health during this season.
Taking healthy breaks from political news and information can also be beneficial during this time, Henry said.
“Just remember how long life is. If you’re caught up so much in today, you’re gonna miss tomorrow.”-Nick Derose, a sophomore studying political science
“Keep current events in a larger perspective and seek out mentors, peers, family members, or educators who can offer support rather than engaging in unending debate with internet ‘trolls’ or others who have no stake in your personal well-being,” Henry said in an email.
With constant media coverage about the election, the pandemic and so many other stressors, it can become addictive and hard to manage exposure. Consuming negative, and sometimes confusing, over-consumption of news can lead to mental health issues, Henry said.
Finding a unique, uplifting outlet has become increasingly important to people during the pandemic and political unrest. As they must still continue social distancing, Baker has become creative in their means of meeting via Zoom.
“If you are able to reach out to a mental health professional in the sense of therapy that you can go to, or even if it’s just talking with a friend, it’s just a matter of figuring out what works best for you,” Baker said.
There is no shame in seeking help and support, if needed. Many others are feeling similar feelings right now.
“Honestly, over the last couple weeks, I have had more anxiety than I ever have had in my entire life,” Hannah Karr, a freshman studying strategic communication, said. “And I’ve found that one thing that helps me is to not stay off my phone, but to stop checking social media so much.”
Karr can attest to feelings many people have maybe felt over these past couple of months. In the U.S., there are the added stresses of the presidential election atop the global pandemic that are hanging in the balance.
“I also have been reading more of The Washington Post and reliable news outlets, as opposed to just scrolling through Twitter and TikTok and getting stressed out about what everybody says,” Karr said. “I feel like just staying off social media and not falling into the trap of believing whatever you see helps a lot.”
Karr agreed that it is greatly beneficial to monitor your exposure to the media right now. As a young journalist, she also holds the responsibility of weeding out the false narratives and information people may be putting out at this time. Karr remains aware of the traps one can fall into in the media right now and continues to be aware of the media she is consuming.
“The main thing is surrounding yourself with people who make you feel safe and remembering that your beliefs are valid,” Karr said.
When anxiety and stress creep in, Karr knows what is important to remember at the end of the day. She said she has a great support system in her friends and family.
“Take a deep breath, watch a movie and just kind of chill out,” Nick Derose, a sophomore studying political science, said. “Some people’s brains move way too fast in these scenarios, so just taking time to try and chill out.”
Derose offers a life viewpoint during these times, one that many miss when they are caught up in politics. He feels there is no reason to let political unrest overtake a calm mind.
“I struggled a lot with post-election guilt, in the sense that I’m a white cisgender woman,” Anderson said. “Whatever happens, I’ll probably be fine, and I felt a lot of guilt for that.”-Jilly Anderson, a junior studying war and peace studies
“The media, just like anything else, can become addictive if you use it too much,” Derose said. “Just remember how long life is. If you’re caught up so much in today, you’re gonna miss tomorrow.”
Derose’s message is one applicable to many circumstances right now. Living with such a philosophy has helped Derose immensely in navigating the issues in the world right now.
Jilly Anderson is a junior studying war and peace studies. Anderson finds it extremely important to be aware of the world around her as well as the state of her mental health.
“If something is important, it will be trending in an hour,” Anderson said. “So there’s no need to constantly be on your phone watching the news all day just waiting for something to happen and adding to that tension.”
In finding a healthy balance while continuing to keep herself educated, Anderson has limited her political podcast time. She has found this exposure level to be good for both her personal role in democracy and her personal mental health.
“I promised myself I’m only listening to one political podcast a day,” Anderson said. “I think it’s healthy.”
Anderson reminds herself and others that truly important information is spread in time. There is no need to spend hours searching for it; there is enough stress as is, she said.
“I struggled a lot with post-election guilt, in the sense that I’m a white cisgender woman,” Anderson said. “Whatever happens, I’ll probably be fine, and I felt a lot of guilt for that.”
Anderson recognizes a great privilege she feels she had coming into her first election. She said she has the luxury of being able to tune out during the election that some people don’t have. She found it important to recognize her privilege in this election and, with that in mind, voted.
“People are tired, and people just want an answer,” Anderson said. “Regardless of what that answer is, they just want an answer.”
From waiting for a time where it is safe to go back outside without a mask to waiting to hear the name of our next president elect, Anderson said how tired people are of just waiting.
“Just because we’re at this standstill and this waiting game,” Anderson said, “it’s hard.”
While still feeling the election anxiety, Anderson also offers this thought to remember in the waiting: “I know it’s drawn out; I know it’s frustrating, and you just want an answer” Anderson said. “But this is democracy. You don’t want it to happen all at once. You want there to be a process because you know that means everyone’s working.”
Anderson continually reminds herself, “democracy’s working.” She is trusting the process and knows it will all be worth it, and she hopes the people do, too.


Are you unsure what track you should take at Epicodus? Answer the following questions and find out what you are most suited to!
What part of the Epicodus curriculum have you enjoyed most so far?
What kind of projects do you want to work on?
On a scale of 1-5 (1 being not at all, 5 being very much) how much do you agree with the following statement?
Javascript and jQuery are really frustrating!
I can find just about anything with a css selector
When you press the button below, its going to generate a random answer about which course you should take
When the randomization was happening, which answer did you hope it would land on?
Get your results


Networkx Community Algorithms Comparison
Click button under
connected components
strong connected
weak connected
girvan newman
asyn fluidc
louvain
kernighan lin
k_clique (k=3)
k_clique_max (k=3)
clique_max
k_core
greedy
modularity
asyn_lpa
label
propagation


Object | +--File
Deprecated use {link helma.File} instead
Defined in File.js
| SUMMARY: Constructor | Properties | Methods | DETAIL: Constructor | Properties | Methods |
| Constructor Summary | |
File(<String> filepath)
Constructor for File objects, providing read and write access to the file system. |
| Methods Summary | |
Boolean
|
canRead()
Tests whether the application can read the file represented by this File object. |
Boolean
|
canWrite()
Tests whether the file represented by this File object is writable. |
void
|
clearError()
Clears any error message that may otherwise be returned by the error method. |
Boolean
|
close()
Closes the file represented by this File object. |
Boolean
|
eof()
Returns true if the file represented by this File object has been read entirely and the end of file has been reached. |
String
|
error(Object)
Contains the last error that occured, if any. |
Boolean
|
exists()
Tests whether the file or directory represented by this File object exists. |
Boolean
|
flush()
Purges the content of the file represented by this File object. |
String
|
getAbsolutePath()
Returns the absolute pathname string of this file. |
Number
|
getLength()
Returns the length of the file represented by this File object. |
String
|
getName()
Returns the name of the file or directory represented by this File object. |
String
|
getParent()
Returns the pathname string of this File object's parent directory. |
String
|
getPath()
Returns the pathname string of this File object. |
Boolean
|
isAbsolute()
Tests whether this File object's pathname is absolute. |
Boolean
|
isDirectory()
Tests whether the file represented by this File object is a directory. |
Boolean
|
isFile()
Tests whether the file represented by this File object is a normal file. |
Boolean
|
isOpened()
Returns true if the file represented by this File object is currently open. |
Number
|
lastModified()
Returns the time when the file represented by this File object was last modified. |
Object
|
list(<RegExp> pattern)
List of all files within the directory represented by this File object. |
Boolean
|
mkdir()
Creates the directory represented by this File object. |
Boolean
|
open()
Opens the file represented by this File object. |
String
|
readAll()
This methods reads all the lines contained in the file and returns them. |
String
|
readln()
This methods reads characters until an end of line/file is encountered then returns the string for these characters (without any end of line character). |
Boolean
|
remove()
Deletes the file or directory represented by this File object. |
Boolean
|
renameTo(<String> dest)
Renames the file represented by this File object. |
Boolean
|
write(<String> data)
Appends a string to the file represented by this File object. |
Boolean
|
writeln(<String> data)
Appends a string with a platform specific end of line to the file represented by this File object. |
| Constructor Detail |
File(<String> filepath)
var fileOrDir = new File('static/test.txt');
filepath
- as String
| Method Detail |
Boolean canRead()
Boolean canWrite()
void clearError()
Boolean close()
Boolean eof()
String error(Object)
Boolean exists()
Boolean flush()
String getAbsolutePath()
Number getLength()
String getName()
String getParent()
String getPath()
Boolean isAbsolute()
Boolean isDirectory()
Boolean isFile()
Boolean isOpened()
Number lastModified()
Object list(<RegExp> pattern)
var xmlFiles = dir.list(/.*\.xml/);
pattern
- as RegExp, optional pattern to test each file name against
Boolean mkdir()
Boolean open()
String readAll()
String readln()
Boolean remove()
Boolean renameTo(<String> dest)
dest
- as String, new pathname for the named file
Boolean write(<String> data)
data
- as String, to be written to the file
Boolean writeln(<String> data)
data
- as String, to be written to the file
| SUMMARY: Constructor | Properties | Methods | DETAIL: Constructor | Properties | Methods |


@(form: Form[_]) @import play.api.Play.current @import play.api.i18n.Messages.Implicits._ @if(form.hasErrors) {
Your Company name and Partnership Unique Tax reference number do not match.
Your business name should match the name written on any letters you have from HMRC.
Your UTR number is made up of 10 or 13 digits, if it is 13 digits only enter the last 10.
Your UTR should match the UTR on any letters you have from HMRC.
} @if(form.errors.exists(_.key == Messages("org.details.corpbody"))) {Your company name and Corporation Tax reference number must both be correct.
Your company name must match the name written on any letters you have from HMRC.
Your Corporation Tax reference number must match the number on any letters you have from HMRC. It is made up of 10 or 13 digits. If it is 13 digits only enter the last 10.
}


Mode: Black list White list
Run extension on all domains except the following: Run extension only on the following domains:
Put one domain name per line. You can use wildcard symbol for leftmost domain part: *.example.com.
Save


Regular Expression
RS School 2020Q1 Pavel Chukashev
A regular expression (shortened as regex or regexp) is a sequence of characters that define a search pattern.
The concept arose in the 1950s when the American mathematician Stephen Cole Kleene formalized the description of a regular language.
Regular expressions are used in search engines, search and replace dialogs of word processors and text editors.
Using this syntax, we can:
- search for text in a string
- replace substrings in a string
- extract information from a string
In JavaScript, we can create a Regular Expression in two ways:
1. RegExp constructor
new RegExp(pattern[, flags])
var regexConst = new RegExp('abc');
2. Literal method
/pattern/flags
var regexLiteral = /abc/;
Note: In the case where we need to create regular expressions dynamically, we’ll need to use the constructor method.
Methods
In JavaScript, regular expressions are often used with the two string methods:
-
search()
Searches a string for a specified value and returns the position of the match
-
replace()
Replaces a specified value with another value in a string
Using the RegExp Object
In JavaScript, the RegExp object is a regular expression object with predefined properties and methods.
-
test()
It searches a string for a pattern, and returns true or false, depending on the result.
-
exec()
It searches a string for a specified pattern, and returns the found text as an object.
If no match is found, it returns an empty (null) object.
Flags
- g : global search
- i : makes the regex case-insensitive
- m : enables multi-line mode
- u : enables support for unicode
- s : short for single line, it causes the . to also match new line characters (added in ES2018, not yet supported in Firefox).
For example:
/hello/ig.test('HEllo')
// returns true
Character set [abc]
Use character sets to match different characters in a single position.
They match any single character in the string with the characters inside the brackets:
var regex = /[hc]ello/;
console.log(regex.test('hello'));
// returns true
console.log(regex.test('cello'));
// returns true
console.log(regex.test('jello'));
// returns false
Negated character set [^abc]
It matches anything that is not enclosed in the brackets:
var regex = /[^hc]ello/;
console.log(regex.test('hello'));
// returns false
console.log(regex.test('cello'));
// returns false
console.log(regex.test('jello'));
// returns true
Ranges [a-z]
If we want to match all of the letters of an alphabet in a single position, we can use ranges.
We can also use digits like [0–9] or capital letters like [A-Z]
var regex = /[a-z]ello/;
console.log(regex.test('hello'));
// returns true
console.log(regex.test('cello'));
// returns true
console.log(regex.test('jello'));
// returns true
Ranges can be also combined by using dash "-"
/[A-Z-0-9]/
Meta-characters
- \d : matches any digit
- \D : matches any character that is not a digit
- \w : matches any alphanumeric character (plus underscore)
- \W : matches any non-alphanumeric character
- \s : matches any whitespace character: spaces, tabs, newlines and Unicode spaces
- \S : matches any character that is not a whitespace
- \0 : matches null
- \n : matches a newline character
- \t : matches a tab character
- \uXXXX : matches a unicode character with code XXXX (remember about u flag!)
- . : matches any character that is not a newline character
- [^] : matches any character, including newline characters. It’s very useful on multi-line strings
Quantifiers
Quantifiers are symbols that have unique meaning in regex.
-
X|Y : alternation matches either X or Y
var regex = /(red|yellow) bike/;
console.log(regex.test('red bike'));
// true
console.log(regex.test('yellow bike'));
// true
console.log(regex.test('brown bike'));
// false
To use any special character as a part of the expression, then you’ll need to escape them with a backslash "\"
var regex = /a+b/;
// this doesn't work
var regex = /a\+b/;
// this works!
console.log(regex.test('a+b'));
// true


Zain Fikri H
HOME
POST
SCHOLARSHIP
COMPETITION
EVENT
INTERNSHIP
CAREER
ABOUT
LOG OUT
POST
University
Choose All
University of Brawijaya
University of Brawijaya
University of Brawijaya
University of Brawijaya
Awards
Rp. 0 - Rp. 249.999
Rp. 250.000 - Rp. 499.999
Rp. 500.000 - Rp. 749.999
Rp. 750.000 - Rp. 1.000.000
Scholarship level
Diploma
Undergraduate
Post graduate
Doctor
Scholarship category
Partially funded scholarship
Fully funded scholarship
Scholarship type
Domestic
Overseas
Deadline
POST NOW


With AngularJS you stil can use any jQuery plugin comes with Metronic. The jQuery plugins can be used as a standalone component or integrated with AngularJS by using directives.
For more info please check this blog An approach to use jQuery Plugins with AngularJS


Man Digs Up Parents’ Bones To Swap For A Motorbike
by Cameron FrewThe world of business is ever-changing. One day we’re buying motorbikes with money, the next we’re paying with our parents’ bones.
Advertisements
Not your preferred method of payment? Against your morals? Well, it looks like this African man needs a reality check.
The gentleman, from Mozambique, found himself in the hands of the local police after going grave-digging.
Advertisements
Police detained a man, who has not been identified, in the northern Nampula province on suspicion of exhuming the bodies of his parents and an uncle.
The man was driven to dig up his parents’ grave after a businessman made him a bizarre promise: for the price of bones from people ‘who died without getting sick’, the man would be reimbursed with a motorcycle and more than $300 (£234) in cash, the MailOnline reports.
The gentleman said:
The boss told me to look for bones from people who died without getting sick. In exchange, you will get a motorbike. I went to a family cemetery, dug up the bones from my father’s, my mother’s and my uncle’s graves.
The man is reported to have travelled to meet the businessman, allegedly involved in the exploration of mineral resources, but he was not there.
Advertisements
According to a police spokesman, it’s the fifth incident of its kind this year, with most believed to be linked to witchcraft.
Belief in witchcraft is commonplace across the African continent – just recently, Gambian woman Matty Sanyang told The New York Times of being forced into a truck by soldiers and stripped, due to the fact she was ‘a witch’.
Witch hunts were a scarily regular occurrence during the reign of Yahya Jammeh, the former president who ruled for 22 years before fleeing abroad in 2017. Critics say he orchestrated the hunts as a ‘way to divide his country and consolidate power’.
Advertisements
However, commenting on witchcraft in Nigeria, Olabisi Deji-Folutile described it as a ‘complex issue’ with myths in need of deconstruction.
Writing on Sahara Reporters, Olabisi Deji-Folutile explained:
Already, different societal ills resulting from government’s failures at various levels are being attributed to the activities of witches and wizards by some folks in this country. There is the need to change this narrative.
It is disheartening how some Nigerians quickly conclude that spiritual powers are at work whenever they are faced with difficulties that they don’t seem to have answers for. Unfortunately, religious groups take advantage of this and make people go through many harrowing experiences all in a bid to finding solutions to problems that ought not to be in the first instance.
Rarely is there any city in this country where there are no fetish things otherwise called ‘sacrifices’ supposedly prepared to appease the gods, witches or wizards placed in some corners or major T-junctions.
After graduating from Glasgow Caledonian University with an NCTJ and BCTJ-accredited Multimedia Journalism degree, Cameron ventured into the world of print journalism at The National, while also working as a freelance film journalist on the side, becoming an accredited Rotten Tomatoes critic in the process. He’s now left his Scottish homelands and took up residence at UNILAD as a journalist.


|
The Council of Southwestern States (CSS) has recently begun a map project in an effort to provide people with the facts about the Southwest area of the country. This is an ongoing project, and information will be updated on a regular basis. This image map of the Southwest states has links in the states of Arizona, California, and Nevada. Clock on the link to learn things about the three states. If you want to learn more about this or other areas of the country, call us a 1-555-MAP-PROJ or e-mail us at<EMAIL_ADDRESS>for more information Home | Arizona | California | Nevada | Utah | Colorado | New Mexico |


As seeing the problems being faced by the farmers today,we have taken a step toward their progress to a better lifestyle , not actually a better one, but to create that environment where they just love their work and to provide them such a joyous and tension free life so they can live a better and happy living.
This is the major issue which is going to be a difficulty in coming future.Production is not meeting the population needs. Hence, it is to either double its production value to meet rising demands. What we have done is to check the proper area owned by a particular farmer of particular district so as to check overall statistics of what is actually happening by retrieving the information of every farmer, so that steps can be taken to prevent loses and to take appropriate measures.
We will reduce poverty by unleashing Indian farmer abilities to grow their incomes and manage their natural resources sustainably
Agriculture in eastern India needs intense development to realise its potential. We can help farmers push up the quantity, quality and value of what they produce. Working with farmers growing crops, keeping livestock and managing fisheries, we will help ensure farmers make the most of their land. We can and we will share our expertise in growing the most appropriate and profitable crops. We can help farmers gain access to high-quality inputs, improve soil quality, conserve water and prepare for climate shocks..
How can you pay for the construction of a warehouse if you have no money? How can you save if you have no bank account? There is too little cash to keep Indian farming markets moving. We can help farmers and agribusinesses gain access to the finance they need. We can establish local savings associations, and help small and medium-sized businesses apply for loans. This will inject new life into markets, helping markets to grow, which not only boosts farmer profits, but also provides job opportunities for people making the move from being farmers themselves to seeking work in small towns. Funders are often reluctant to lend to high-risk, inexperienced farming businesses with no paperwork or proof they can become viable. We provide those small businesses with training on how to professionalise and develop into respected enterprises.
Farm India promotes the sustainable management of fields, forests, grazing lands and water resources. We can use our expertise in participatory forest and rangeland management to bring farmers, governments and other stakeholders together to make agreements on using natural resources sustainably, for the benefit of all. We can help develop plans for the holistic management of landscapes, so that gains from rural development in one region are not cancelled out by losses in another.


SMTP server response on RBL domains violation
maps_rbl_reject_code
This parameter specifies the SMTP server response code when a mail violates the
maps_rbl_domains rule that is:
Access denied: SMTP client listed in RBL
Note that the postfix default value used for maps_rbl_reject_code is
code 554, and this code in 'standard RFC 822' should means
'Requested mail action rejected: access denied'.
So with Postfix, a maps_rbl_domains rule violation does not reflect exactly
the RFC822 explanation of reported code.
To avoid confusion, you can change this to 571 for example (another reason is that code 554
is also the postfix default value for other kind of errors), otherwise, do not change
this unless you have a complete understanding of RFC 822.


Home
Form Stuff
Dropzone File Upload
Actions
Action
Another action
Something else here
Separated link
NOTE:
This plugins works only on Latest Chrome, Firefox, Safari, Opera & Internet Explorer 10.


Shine
As Reviewed by James Brundage
The Scott Hicks film "Shine" is a stunning blend of music and cinema. He has directed one of the best films of the year (and has a Best Picture and Best Director nominee to prove for it).
This interesting and engaging film opens with Geoffrey Rush (Young Einstein) talking in an all-too fast voice and then cascades to reveal more and more of his abusive childhood through flashbacks. Each time Rush appears on screen, he captures your attention with his eccentric performance, and is now running neck-to-neck in my guess for the Best Actor Academy Award (with Ralph Finnes of "The English Patient" as his only major competitor). It a probability that he will get the award, if only because of the fact that he plays with such passion that he can easily portray the wild lifestyle of pianist David Helfgott.
The film's style allows the audience to get a good taste of the spirit of Helfgott, showing them him playing his own, darker interpretation of the monstrous "Ragmaninnov's Concherto #3" and then allowing everyone to see just how abusive his father was, hanging up the phone every time David tries to call him.
The real David was the pianist for most of the film, and the performance shows through in one particular scene in which he sits down at a piano in the middle of an Australian piano bar and proceeds to play all of "Flight of the Bumblebee" with a cigarette hanging out of his mouth.
Although it takes a degree of musical appreciation to enjoy, the film is good enough quality wise to make an entertaining two hours. This one is worth seeing if you enjoy quality pictures, but is neither funny nor suspenseful. It is a story with power, not a story with thrills.
http://fly.to/criticsheaven
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


CIDR or Classless Inter Domain Routing was developed to reduce the increasing size of routing tables of large routers, which was quite hard with classful routing. The memory usage of classful routing is enormous, which results in unreasonable expensive hadware. But also the performance was compromised, since large tables need to be looked up without a more dynamic IP interval mechanism, like CIDR imposes. Another problem with a classful setup is, that the bandwidth usage is quite high when routers exchange their routing information.
.
.
.
/
{{cidr.mask}}
Netmask
{{cidr.first}}
First IP
{{cidr.last}}
Last IP
{{cidr.hosts}}
Count


--- title: Button Sizes category: buttons order: 4 description: A compact size is available when buttons need to fit in small spaces. Buttons with long labels automatically get smaller padding.
When used with the Modernizr touchevents
test, touch-enabled devices will get larger buttons.
---


Arrhenius Chem. Phys. reaction rate transitivity behavior temperature energy function Aquilanti tunneling Coutinho formula {border-style Equation quantum kinetics px;} #ffffff;} dependence super-Arrhenius reactions low phenomenological processes chemical limit viscosity (Aquilanti cases > Carvalho-Silva Rev. Soc. Transitivity diffusion formulation kinetic theory Eyring Sci. Theory physicochemical Silva constants data molecular Mundim activation constant deep deviation deviations dynamics parameter reactive (), Fazio Oliveira account case description experimental plot potential px; rates recent reciprocal role statistical tends theoretical transition {font-family ./. Figure However, VFT Wigner computational examples font-size given insight involving lim obtain range sub-Arrhenius temperature. < Am. Cavalli Glasstone Kohen Lett. Nat. Statistical Temperature Transition-State Tunneling applied b). concept connection corresponding denoted double; elementary formulations generated hydrogen introduced law meaning non-Arrhenius parameters plots respect sub- systems temperature, transition-state variety wide work yielding (Angell, (VFT) (e.g., (see Available Chemical Comput. Function Giordano Reaction Russell, Sanches-Neto University a). absolute according activated apparent approach article at: border-color border-width cases, computationally considered der discussed effects exp fluids food general gets kinetics, large linear liquids mechanics mechanisms minimum obtained online permits ranges section simple solid; using value values vs. water {font-style {font-weight (AM) (Wigner, (the ./-()- ./S-()- ./s--- ASCC Appl. Chemistry Equations Eyring's Here, Kinetics Kooij Kramers Laidler Mech. Nakamura-Takayanagi-Sato New Peleg Sato TST Wang available b), barrier behavior, behavior. bold calculation classical comparison complex courier; cross curvature e.g., em; empirical equation equation. exact expression form formulas initio interpretation introducing kinetics. limited line model number order particular physical pre-factor previous process propensity proposed provide pt;} reactions. reference references regime result set study tan terms time various von zero,


I AM PETER JOHNSON, THE ONLY CHILD OF LATE MR AND MRS.

BEFORE THE DEATH OF MY FATHER ON 29TH JUNE 2004 IN A PRIVATE HOSPITAL HERE IN ABIDJAN.
THAT I SHOULD SEEK FOR A FOREIGN PARTNER IN A COUNTRY OF MY CHOICE WHERE I WILL TRANSFER THIS MONEY AND USE IT FOR INVESTMENT PURPOSE, (SUCH AS REAL ESTATE MANAGEMENT).

THANKS AND GOD BLESS
MR PETER JOHNSON .
Windows Live Mail : venez tester la version bêta en exclusivité !


Henry's Corner
Not Googleable (or may be it is). I told the developer to do this as "fine print" dammit!
Load More


THE WEDDING BANQUET A film review by Umar Khan Copyright 1993 Umar Khan
I just saw the movie THE WEDDING BANQUET thanks to a local NPR station which was giving away tickets to a special showing. This is advertised as the first Taiwanese film shot in the US (Manhattan to be precise). It is about 60% in Chinese (with large subtitles) and 40% in English (no sub-titles, strangely enough). It was one of those films which is done so well that I forgot I was having to read subtitles; they became almost subliminal.  There was barely a five-minute period of time to be found when the audience, as a whole, didn't break up laughing at least once.
The story resembles the GREEN CARD film by Gerard Depardieu a bit and has been compared to LA CAGE AUX FOLLES by some reviewers, though I don't personally see any resemblance to LA CAGE other than a very superficial one which comes from both having gay characters and gay situations in their plots.
The story is of a young, prosperous Taiwanese gentlemen (Wei Tung, played by Winston Chao) who lives in New York and is something of a slum lord (though a personable one).  The movie opens with Wei Tung working out with free weights while listening to a tapes letter from his mother (played by Ah-Lea Gua). This sets the theme for the movie. Wei Tung's mother is pressuring him to get married so she can be a grandmother. His parents have been enrolling him in expensive computer match making services, too. To get his parents (who are en route for a visit to America with the single ambition of getting him married off to anyone) off his back, Wei Tung is convinced by his lover, Simon (played by Mitchell Lichtenstein) to marry his artist tenant, Wei Wei (played by May Chin) who needs a green card. So the plot thickens. What ensues is a comedy of errors leading up to a marriage before a justice of the peace in a municipal wedding factory and a wedding banquet forced on them by an old family retainer whose son just happens to own the fanciest restaurant/hotel in Chinatown. The banquet is a blast. Everyone, especially the groom, gets zonked. Then when the bride and groom finally reach their room to collapse after the festivities, their room is invaded by a throng of returning wedding guests armed with mah-jong tables, Chinese lanterns, and the like. The guests set up shop in the couple's hotel room and refuse to leave until Wei Wei and Wei Tung get under the covers together and pass out *all* of their clothes.
As a result, Wei Wei discovers that Wei Tung can be aroused by a woman after all. She gets pregnant and mom and dad (who *still* haven't left for China) are ecstatic. But the pressures on the trio (Wei Wei, Wei Tung, and Simon) have obviously multiplied. Fights ensue. Feelings are hurt. Lifestyles are cramped.
I won't tell any more of the plot, because you *must* see this film. The "solutions" are not original but they are well done and always inspire audience laughs. There are touching "coming out" scenes, reconciliations, bon voyages, and the like.
There is enough seriousness (such as when Wei Tung's father, a retired general who fought with Chiang Kai Chek, played by Shihung Lung, has a stroke on the day of the big breakfast fight between a frustrated Simon and father-to-be Wei Tung). Some seriousness is necessary because the whole theme of "coming out" to the family and deciding where one draws the line between duty to parents and honesty to one's self are all necessarily part of the "gay experience."
I highly recommend everyone who likes good fun, isn't totally turned off by gay themes tastefully handled, and who can forget that s/he is reading subtitles to make immediate reservations when this film comes to town!
.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Calculate Green Function Database¶
The first step of MCMTpy is to build Green’s function database. All parameters are written into a JSON file named build_GFs.json. Some brief descriptions of the parameters are included here following the definination.
We do not recommend using relative paths because of the possibility of errors. Absolute paths are preferred.
We used
ASDF
seismic data format to manage Green Function database, which is convenient to locally build up a database of pre-processed waveforms. ASDF file greatly reduces the number of green functions files, and a single ASDF file can replace thousands of green function files which may threw us into confusion in the management process. We store the Green‘s functions corresponding to Event_ID (QuakeML) in “Waveforms” of ASDF data. In the “Labels” of “Waveforms” , we store the phase (P and S) travel times which can be computed in advance by a given velocity model.The general structure of MCMTpy stores Green‘s function with ASDF file format shown in the image below.
You can also find some useful information about parameters in refers to pyfk.
Station and Source¶
Database_mode
Set to be .true. when you want to compute the Green’s function library for some region. For real examples, the GF databases may require up to several GBs of free disc space. In addition you need to set the following parameters correctly:
Source_depth_min
,Source_depth_max
,Source_depth_spacing
,Station_distance_radius_min
,Station_distance_radius_max
,Station_distance_spacing
,Source_name
,Network_name
,Station_name
,Station_depth_reference
Set to be .false. when you want to calculate the Green’s function for stations at which the source is given. You must provide an
.txt
file named Source_Station_info.txt, which including the longitude latitude and depth information of the source and station. Different sources should be separated by blank lines.Source_Station_info.txt format.
[source_name] [source_lat] [source_lon] [source_depth]
[network_name] [station_name] [station_lat] [source_lon] [station_depth]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | source_1 25.58 99.86 1
YN EYA 26.108 99.947 0
YN YUL 25.885 99.371 0
source_2 25.58 99.86 2
YN EYA 26.108 99.947 0
YN YUL 25.885 99.371 0
XG CFT 25.848 100.517 0
YN BAS 25.118 99.146 0
source_3 25.58 99.86 3
YN WES 23.372 104.253 0
YN MLP 23.128 104.702 0
YN FUN 23.624 105.620 0
|
Source_depth_min
The minimum source depth in Green’s function databases (km).
Source_depth_max
The maximum source depth in Green’s function databases (km).
Source_depth_spacing
Interval of source depths in Green’s function databases (km).
Station_distance_radius_min
The minimum distance of the station in Green’s function databases (km or degree, depend by
degrees
).
Station_distance_radius_max
The maximum distance of the station in Green’s function databases (km or degree, depend by
degrees
).
Station_distance_spacing
Horizontal spacing interval in Green’s function databases (km or degree, depend by
degrees
).
Source_name
Source name in Green’s function databases, default value is source, please do not change. Only lowercase letters are supported.
Network_name
Network name in Green’s function databases, default value is NET, please do not change.
Station_name
Station name in Green’s function databases, default value is STA, please do not change.
Station_depth_reference
Depth of all virtual stations (km).
Note
When Database_mode
= .false., depths can vary from station to station. But when set to be .true,
all stations must use the same depth Station_depth_reference
.
MPI¶
MPI_n
CPU number. When
Database_mode
= .false., the number of call cores should be less than or equal to the number of source. But when set to be .true, there are no limits.
Path¶
DATADIR
The output path of the Green function databases.
DATADIR_splits
A subfolder under
DATADIR
for Green’s function. Please keep the path relative toDATADIR
.
SourceModel¶
source_mechanism
Focal mechanism, not used. Please set it to .null..
srcType
The type of Green’s function, dc(double-couple) sf(single-couple) ep(explosion). Please set it to .dc..
SeisModel¶
Velocity_model
Path to the velocity model file. And the format:
thick(km), vs(km/s), vp(km/s), density(g/cm^3), Qs, Qp
1 2 3 4 5 6 7 8 9 10 11 12 | 5.01000000 3.17601610 5.41925121 2.50000000<PHONE_NUMBER>0 1200.00000000
5.01000000 3.36477536 5.67947907 2.55000000<PHONE_NUMBER>0 1200.00000000
5.01000000 3.52147424 5.93255556 2.60000000<PHONE_NUMBER>0 1200.00000000
5.01000000 3.55152174 6.00984300 2.65000000<PHONE_NUMBER>0 1200.00000000
5.01000000 3.54084541 6.02592110 2.70000000<PHONE_NUMBER>0 1250.00000000
5.01000000 3.58840419 6.14793478 2.75000000<PHONE_NUMBER>0 1300.00000000
5.01000000 3.75369968 6.48572061 2.80000000<PHONE_NUMBER>0 1350.00000000
5.01000000 3.94361514 6.86566667 2.90000000<PHONE_NUMBER>0 1400.00000000
10.01000000 4.12710548 7.20229388 3.00000000<PHONE_NUMBER>0 1500.00000000
10.01000000 4.30825765 7.55049678 3.10000000<PHONE_NUMBER>0 1600.00000000
10.01000000 4.38069968 7.72566425 3.20000000<PHONE_NUMBER>0 1700.00000000
90.00000000 4.50000000 7.80000000 3.27000000<PHONE_NUMBER>0 1800.00000000
|
flattening
Set the flatten status of the velocity model, .true. or .false..
Config¶
The following parameters explanation refers to pyfk
<https://github.com/ziyixi/pyfk>.
npt
The sampling points is a multiple of 2.
dt
Sampling interval in seconds
degrees
Use degrees instead of km, defaults to .true.. Only when
Database_mode
= .true., it can be changed to .false.
taper
Taper applies a low-pass cosine filter at fc=(1-taper)*f_Niquest, defaults to 0.3.
filter
Apply a high-pass filter with a cosine transition zone between freq. f1 and f2 in Hz, defaults to (0, 0).
dk
The non-dimensional sampling interval of wavenumber, defaults to 0.3.
smth
Makes the final sampling interval to be dt/smth, defaults to 1.
pmin
The min slownesses in term of 1/vs_at_the_source, defaults to 0.
pmax
The max slownesses in term of 1/vs_at_the_source, defaults to 1.
kmax
The kmax at zero frequency in term of 1/hs, defaults to 15.
rdep
Not used now. Please keep the default values of the parameters, defaults to 0 in km.
updn
The “up” for up-going wave only, “down” for down-going wave only, “all” for both “up” and “down”, defaults to “all”.
samples_before_first_arrival
The number of points before the first arrival, defaults to 50.
Logging file¶
MCMTpy will generates 2 logging files when it builds GFs datebase, that is prepro_para_info.txt and write_Source_Station_info_MPI. They record all the parameter information of GFs datebase. You can find them in
DATADIR
path.
Example¶
The example_path need to de changed to your path, and run this notebook to set build_GFs.json file.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import os
import sys
import json5
# The root directory of the project
example_path = '/Users/yf/3.Project/8.MCMTpy/MCMTpy-master/data/example_yunnan'
#------------------------------------------------------------#
# we expect no parameters need to be changed below
#------------------------------------------------------------#
# 1. get notebook path
notebook_path = sys.path[0]
os.chdir(notebook_path)
# 2. change path to Green_Funcs
os.chdir('../Green_Funcs')
print(os.listdir())
# 3. show build_GFs.json
filename = 'build_GFs.json'
with open(filename, 'r',encoding='utf-8') as f1:
gfs_json=json5.load(f1)
f1.close()
# 4. change parameters with absolute path
gfs_json['Source_Station_info'] = os.path.join(example_path,"Green_Funcs/Source_Station_info.txt")
gfs_json["DATADIR"] = os.path.join(example_path,"Green_Funcs/GFs1")
gfs_json["DATADIR_splits"] = os.path.join(example_path,"Green_Funcs1/GFs1/GFs_splits")
gfs_json["Velocity_model"] = os.path.join(example_path,"v_model/v_model_yunnan.txt")
gfs_json_new = os.path.join(example_path,'Green_Funcs/build_GFs_new.json')
with open(gfs_json_new,'w') as f2:
json5.dump(gfs_json, f2, indent=2)
f2.close()
# !mpirun -n 4 MCMTpy build_GFs pyfk -c build_GFs_new.json > gfs.log
|
Now you can run MCMTpy in bash:
$ mpirun -n 4 MCMTpy build_GFs pyfk -c build_GFs_new.json > gfs.log
Note
Please follow the above parameter instructions and set all parameters correctly before running the program. Otherwise, it is easy to report an error!


|
CoreTweet
2.0.0-beta.2
Yet another .NET Twitter Library
|
Provides a set of methods for the wrapper of GET/POST geo. More...
Public Member Functions | |
| PlaceResponse | Id (params Expression< Func< string, object >>[] parameters) |
| PlaceResponse | Id (IDictionary< string, object > parameters) |
| PlaceResponse | Id (object parameters) |
| PlaceResponse | Id (string place_id) |
| Task< PlaceResponse > | IdAsync (params Expression< Func< string, object >>[] parameters) |
| Task< PlaceResponse > | IdAsync (IDictionary< string, object > parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< PlaceResponse > | IdAsync (object parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< PlaceResponse > | IdAsync (string place_id, CancellationToken cancellationToken=default(CancellationToken)) |
| GeoResult | SimilarPlaces (params Expression< Func< string, object >>[] parameters) |
| GeoResult | SimilarPlaces (IDictionary< string, object > parameters) |
| GeoResult | SimilarPlaces (object parameters) |
| GeoResult | SimilarPlaces (double lat, double @long, string name, string contained_within=null, string street_address=null) |
| Task< GeoResult > | SimilarPlacesAsync (params Expression< Func< string, object >>[] parameters) |
| Task< GeoResult > | SimilarPlacesAsync (IDictionary< string, object > parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | SimilarPlacesAsync (object parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | SimilarPlacesAsync (double lat, double @long, string name, string contained_within=null, string street_address=null, CancellationToken cancellationToken=default(CancellationToken)) |
| GeoResult | Search (params Expression< Func< string, object >>[] parameters) |
| GeoResult | Search (IDictionary< string, object > parameters) |
| GeoResult | Search (object parameters) |
| GeoResult | Search (double? lat=null, double? @long=null, string query=null, string ip=null, string granularity=null, string accuracy=null, int? max_results=null, string contained_within=null) |
| Task< GeoResult > | SearchAsync (params Expression< Func< string, object >>[] parameters) |
| Task< GeoResult > | SearchAsync (IDictionary< string, object > parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | SearchAsync (object parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | SearchAsync (double? lat=null, double? @long=null, string query=null, string ip=null, string granularity=null, string accuracy=null, int? max_results=null, string contained_within=null, CancellationToken cancellationToken=default(CancellationToken)) |
| GeoResult | ReverseGeocode (params Expression< Func< string, object >>[] parameters) |
| GeoResult | ReverseGeocode (IDictionary< string, object > parameters) |
| GeoResult | ReverseGeocode (object parameters) |
| GeoResult | ReverseGeocode (double lat, double @long, string accuracy=null, string granularity=null, int? max_results=null) |
| Task< GeoResult > | ReverseGeocodeAsync (params Expression< Func< string, object >>[] parameters) |
| Task< GeoResult > | ReverseGeocodeAsync (IDictionary< string, object > parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | ReverseGeocodeAsync (object parameters, CancellationToken cancellationToken=default(CancellationToken)) |
| Task< GeoResult > | ReverseGeocodeAsync (double lat, double @long, string accuracy=null, string granularity=null, int? max_results=null, CancellationToken cancellationToken=default(CancellationToken)) |
Additional Inherited Members | |
| Public Attributes inherited from CoreTweet.Core.ApiProviderBase | |
| TokensBase | IncludedTokens => this.Tokens |
| Gets the tokens being used in this instance. More... | |
| Properties inherited from CoreTweet.Core.ApiProviderBase | |
| TokensBase | Tokens [get, set] |
| Gets or sets the OAuth tokens. More... | |
Provides a set of methods for the wrapper of GET/POST geo.
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
|
inline |
Returns all the information about a known place.
| place_id | required. |
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Returns all the information about a known place.
Available parameters:
- string
place_id (required)
| parameters | The parameters. |
|
inline |
Returns all the information about a known place.
| place_id | required. |
| cancellationToken | The cancellation token. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
| lat | required. |
| long | required. |
| accuracy | optional. |
| granularity | optional. |
| max_results | optional. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
| lat | required. |
| long | required. |
| accuracy | optional. |
| granularity | optional. |
| max_results | optional. |
| cancellationToken | The cancellation token. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Given a latitude and a longitude, searches for up to 20 places that can be used as a place_id when updating a status.
This request is an informative call and will deliver generalized results about geography.
Available parameters:
- double
lat (required)
- double
long (required)
- string
accuracy (optional)
- string
granularity (optional)
- int
max_results (optional)
| parameters | The parameters. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
| lat | optional. |
| long | optional. |
| query | optional. |
| ip | optional. |
| granularity | optional. |
| accuracy | optional. |
| max_results | optional. |
| contained_within | optional. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
| lat | optional. |
| long | optional. |
| query | optional. |
| ip | optional. |
| granularity | optional. |
| accuracy | optional. |
| max_results | optional. |
| contained_within | optional. |
| cancellationToken | The cancellation token. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Search for places that can be attached to a statuses/update.
Note: At least one of the following parameters must be provided to this resource: lat, long, ip, or query
Available parameters:
- double
lat (optional)
- double
long (optional)
- string
query (optional)
- string
ip (optional)
- string
granularity (optional)
- string
accuracy (optional)
- int
max_results (optional)
- string
contained_within (optional)
| parameters | The parameters. |
|
inline |
Locates places near the given coordinates which are similar in name.
| lat | required. |
| long | required. |
| name | required. |
| contained_within | optional. |
| street_address | optional. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |
|
inline |
Locates places near the given coordinates which are similar in name.
| lat | required. |
| long | required. |
| name | required. |
| contained_within | optional. |
| street_address | optional. |
| cancellationToken | The cancellation token. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |
| cancellationToken | The cancellation token. |
|
inline |
Locates places near the given coordinates which are similar in name.
Available parameters:
- double
lat (required)
- double
long (required)
- string
name (required)
- string
contained_within (optional)
- string
street_address (optional)
| parameters | The parameters. |


Master Rindy:
If you have information they are interested in, they may try to find you first...
Wait a minute -- let me check some information reported by the Steelrazor...
Hmm... According to this, Dark Elven Magister Clayton of the Town of Dion knows the important secret concerning our race...
The secret group may be interested in this information.
If you wish to join, perhaps a meeting with Clayton will help your chances...


TED is a nonprofit devoted to spreading ideas, usually in the form of short, powerful talks (18 minutes or less). TED began in 1984 as a conference where Technology, Entertainment and Design converged, and today covers almost all topics — from science to business to global issues — in more than 100 languages. Meanwhile, independently run TEDx events help share ideas in communities around the world.
TEDx was created in the spirit of TED's mission, "ideas worth spreading." It supports independent organizers who want to create a TED-like event in their own community.
TEDxSVSU is an independently organized TED-style event, a full day of local, national and international speakers, music and artistic presenters, and also sponsors and exhibitors who showcase novel displays and activities. (See: Official website.)
The target audience is SVSU and the surrounding community, especially students, parents, families, staff, faculty, and administration. The event attracts educated people throughout mid-Michigan and beyond. Anyone interested in TED-style talks is welcome to attend TEDxSVSU.


Bubble Sort is a sorting algorithm that sorts the elements of an array in order, by repeatedly swapping adjacent elements in the array.
The algorithm repeatedly steps through the array to be sorted, compares each pair of adjacent items and swaps them if they are in wrong order. The pass through the array is repeated until no swaps are needed, which indiactes that the array is sorted.
Some of the features of Bubble sort algorithm are as follows:
The psuedocode for the Bubble sort algoritm is as follows:
BUBBLE-SORT(A) :
for i = 0 to (A.length - 2) :
for j = 0 to (A.length - i - 2) :
if A[j] > A[j + 1] :
swap(A[j], A[j + 1])


Neural networks consists of multiple layers of interconnected nodes (neurons), each having a weight for a connection, a bias and activation function. Each layer build upon the previous layer. This progression of computations through the network is called forward propagation. Another process called backpropagation uses algorithms which moves backwards through the layers to eﬃciently compute the partial derivatives of the loss function with respect to the weights and biases. Combining the forward and backward propagation, we can calculate errors in predictions and then adjusts the weights and biases using the gradient descent method. This process is called training.
As is shown in Fig. 1, we use wjkl to denote the weight for the connection from the kth neuron in the (l − 1)th layer to the jth neuron in the lth layer. Use bjl to denote the bias of the jth neuron in the lth layer.
We use ajl to denote the output (activation) of the jth neuron in lth layer. A neural network model assumes that ajl is related to the al−1 (output of the previous layer) via
|
| (1) |
where the summation is over all neurons in the (l − 1)th layer and σ is a function called activation function which can take various forms, e.g., step function,
|
| (2) |
rectiﬁed linear unit (ReLU),
|
| (3) |
and sigmoid function (“S”-shaped curve, also called logistic function)
|
| (4) |
Deﬁne zjl by
|
| (5) |
which can be interpreted as an weighted input to the neuron (l,j), then Eq. (1) is written as
|
| (6) |
In matrix form, Eq. (5) is written as
|
| (7) |
where wl is a J × K matrix, zl and bl are column vectors of length J, al−1 is a column vector of length K, where J and K are the number of neurons in the lth layer and (l − 1)th layer, respectively.
The input layer is where data inputs are provided, and the output layer is where the ﬁnal prediction is made. The input and output layers of a deep neural network are called visible layers. The layers between the input layer and output layer are called hidden layers. Note that the input layer is usually not considered as a layer of the network since it does not involve any computation. In tensorﬂow, layers refer to the computing layers (i.e., hidden layers and the output layer, not including the input layer). The activation function of each layer can be diﬀerent. The activation function of the output layer is often chosen as None, ReLU, logistic/tanh, and is usually diﬀerent from those used in the hidden layers. Here “None” means activation σ(z) = z.
Deﬁne a loss (cost, error) function by
|
| (8) |
where w and b denotes the collection of all weights and biases in the network, n is the total number of training examples x, the summation is over all the training examples, y(x) is the desired output from the network (i.e., correct answer) when x is the input, and aL is the actual output from the output layer of the network and is a function of w,b, and x. Note that y and aL are vectors (with number of elements being the number of neurons in the output layer) and ∥…∥ denotes the vector norm. Explicitly writing out the vector norm, Eq. (8) is written as
|
| (9) |
where NL is the number of neurons in the output layer.
The cost function is the average error of the approximate solution away from the desired exact solution. So the goal of a learning algorithm is to ﬁnd weights and biases that minimize the cost function. To minimize the cost function over (w,b) using the gradient descent method, we need to compute the partial derivatives ∂C∕∂wjkl and ∂C∕∂bjl. Next we will discuss how to compute them.
Note that the loss function involves an average over all the training examples. Denote the loss function for a speciﬁc training example by Cx, i.e.,
|
| (10) |
then expression (9) is written as
|
| (11) |
Then the partial derivatives ∂C∕∂wjkl and ∂C∕∂bjl can be written as the sum of ∂Cx∕∂wjkl and ∂Cx∕∂bjl, i.e.,
|
| (12) |
|
| (13) |
The above formulas indicate that, once ∂Cx∕∂wjkl and ∂Cx∕∂bjl are known, obtaining ∂C∕∂wjkl and ∂C∕∂bjl is trivial, i.e., just averaging them. Therefore, we will focus on Cx (i.e., the cost function for a ﬁxed training example) and discuss how to compute ∂Cx∕∂wjkl and ∂Cx∕∂bjl.
In practice, we do not sum over all the training examples. Instead, we average the derivative over a small number (say 16) of training examples (a mini batch) and use these approximate derivatives to advance a step. For the next step, we stochastically change to using a diﬀerent mini batch. This is called stochastic gradient descent (SGD) method.
The cost function Cx is a function of weights and biases of all neurons (the input x and output y(x) are ﬁxed parameters). For a speciﬁc neuron (l,j), its weights and biases enter Cx via the combination zjl = ∑ kwjklakl−1 + bjl. Then it is useful to deﬁne the following partial derivative:
|
| (14) |
where the partial derivative are taken with ﬁxed weights and biases for all neurons except neuron (l,j). Note that the akl−1 appearing in the expression of zjl does not depend on wjkl or bjl. It only depends on the weights and biases in the layers ≤ (l − 1), which are all ﬁxed when taking the derivative in expression (14). δjl deﬁned in expression (14) is often called the error of neuron (l,j).
Using the chain rule, ∂Cx∕∂wjkl and ∂Cx∕∂bjl can be expressed in terms of δjl:
|
| (15) |
and
|
| (16) |
Therefore, if δjl is known, it is trivial to compute the gradients needed in the gradient descent method.
For the output layer (Lth layer), δjl deﬁned in Eq. (14) is written as
|
| (17) |
The dependence of Cx on ajL is explicitly given by Eq. (10), from which the above expression for δjL is written as
|
| (18) |
Therefore δjL is easy to compute.
Backpropagation is a way of computing δjl for every layer using recurrence relations: the relation between δl and δl+1. Noting how the error is propagating through the network, we know the following identity:
|
| (19) |
with
|
| (20) |
i.e.,
|
| (21) |
Therefore
|
| (22) |
i.e.,
|
| (23) |
Equation (23) gives the recurrence relations of computing δl from δl+1. This is called the backpropagation algorithm. Eq. (23) can be written in the matrix form:
|
| (24) |
where T stands for matrix transpose, ⊙ is the element-wise product.


orca: Computation of Graphlet Orbit Counts in Sparse Graphs
Implements orbit counting using a fast combinatorial approach.
Counts orbits of nodes and edges from edge matrix or data frame, or a
graph object from the graph package.
| Version: |
1.1-1 |
| Depends: |
R (≥ 3.1) |
| Enhances: |
graph |
| Published: |
2016-07-28 |
| Author: |
Tomaz Hocevar [aut],
Janez Demsar [aut, cre] |
| Maintainer: |
Janez Demsar <janez.demsar at fri.uni-lj.si> |
| License: |
LGPL-3 |
| NeedsCompilation: |
yes |
| SystemRequirements: |
C++11 |
| Citation: |
orca citation info |
| CRAN checks: |
orca results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=orca
to link to this page.


Studies overview of my 9th semester
Blackboard #
- Last update
- Curricula
- BSc SDBM MSc CS[0]
- Jabber configuration
- Jabber config
- VPN configuration
- VPN config
- Archive
- Previous semester
- Studies progress
-
- 9th semester
-
Basically: 12 courses, 68.5 ECTS, 1 MOOC, 2 tutorial groups, one amateur radio course
- Combinatorial optimization 1 (7.5 ECTS)
- Crunch points of modern industrial software development and IT project management (3 ECTS)
- Applied Cryptography 2 (5 ECTS)
- IT-Security Master-Project (10 ECTS)
- Problem Analysis and Complexity Theory (4.5 ECTS)
- DiplomandInnenseminar (5 ECTS)
- Schrift & Schreiben im Altertum (4 ECTS)
Old courses:
- Bakk@IST (15 ECTS)
- BWL UE (2 ECTS)
- DSIT (4.5 ECTS)
- TCS 2 (5 ECTS)
- IT-Security? (3 ECTS)
Public Content
I moved all documents—collected by various semesters for educational purposes—to my project page.
ToDo list #
-
Foundations of Computer Science
- Release turingmachine.js
- Implement control.py
- Ask for room reservation
- Check master solutions
- Per assignment [1, 2, 3]
- Release assignment
- Answer NG questions
- Hold Q&A/tutorial sessions
- Distribute assignment talk doodle
- Evaluate exercise by exercise
- Plagiarism check & check revision control
- Define assignment talk exercises
- Store offline backups
- Introduce other tutors to technical stuff
- Final tutor's meeting
-
Combinatorial optimization 1
- First presentation of an exercise
- Second presentation of an exercise
- Third presentation of an exercise
- Fourth presentation of an exercise
- Learning, first partial exam
- Take first partial exam
- Learning, second partial exam
- Take second partial exam
-
Crunchpoints of modern industrial software development and IT project management
- Visiting 3 lectures
- Participation in dedicated Saturday class
- Submit Crunchpoint analysis report
-
Applied Cryptography 2
- Give practicals presentation
- Answer lecture questions
- Learn for exam, take exam
- IT-Security master project
-
Problem Analysis and Complexity Theory
- Homework 1
- Homework 2
- Participation in class
- Presentation
-
Schrift und Schreiben im Altertum
- Give presentation on runes and Ogam writing system
- Submit report
My courses
| ECTS todo | ECTS done | success rate | SDBM done | CS done | SDBM optional courses | CS optional courses | |
| 1st sem | 38 | 25.5 | 67% | 7 / 53 | 7 / 54 | 1 / 12 | 2 / 12 |
| 2nd sem | 29 | 31 | 81% | 13 / 53 | 15 / 54 | 9.5 / 12 | 4.5 / 12 |
| 3rd sem | 37 | 37 | 68% | 25 / 53 | 26 / 54 | 12 / 12 | 10.5 / 12 |
| 4th sem | 42.5 | 32 | 66% | 34 / 53 | 37 / 54 | 12 / 12 | 12 / 12 |
| 5th sem | 53 | 28.5 | 52% | 38 / 53 | 45 / 54 | 12 / 12 | 12 / 12 |
| 6th sem | 72.5 | 24.5 | 34% | 46 / 53 | 49 / 54 | 12 / 12 | 12 / 12 |
| 7th sem | 69 | 39 | 56% | 48 / 53 | 51 / 54, 12 / 36 | 12 / 12 | 12 / 12, 4.5 / 8 |
| 8th sem | 80.5 | 60 | 75% | 51 / 53 | 51 / 54, 12 / 36 | 12 / 12 | 12 / 12, 7.5 / 8 |


|
Alazartech ATS9462
0.01
|
Public Slots | |
| void | UpdateSamplesSent (uint num_samples) |
| void | SendTimeSeries () |
| void | Start () |
| void | Stop () |
Signals | |
| void | RawTimeSeries (std::vector< short unsigned int > time_series, uint s_rate) |
| void | VoltageTimeSeries (std::vector< double > time_series, uint s_rate) |
Public Member Functions | |
| QTS9462 (QObject *parent=0, uint system_id=1, uint board_id=1) | |
| Public Member Functions inherited from alazar::ATS9462 | |
| ATS9462 (uint system_id=1, uint board_id=1) | |
| void | SetDefaultConfig () |
| std::vector< short unsigned int > | PullRawData (uint data_size) |
| std::vector< double > | PullVoltageData (uint data_size) |
| std::vector< double > | PullPowerData (uint data_size) |
| void | SelectChannel (Channel selection) |
| void | SetCaptureClock () |
| void | InputControlChannelA () |
| void | InputControlChannelB () |
| void | SetBWLimit () |
| void | SetTriggerOperation () |
| void | SetExternalTrigger () |
| void | SetTriggerTimeOut (double trigger_timerout_sec=0.0f) |
| void | ConfigureAuxIO () |
| void | SetIntegrationTime (double time_sec) |
| void | SetSampleRate (double samples_per_sec) |
| void | StartCapture () |
| void | AbortCapture () |
Additional Inherited Members | |
| Public Types inherited from alazar::ATS9462 | |
| typedef std::lock_guard< std::mutex > | lock |
| Protected Attributes inherited from alazar::ATS9462 | |
| u_char | bits_per_sample |
| uint | max_samples_per_channel |
| uint | bytes_per_buffer = 0 |
| uint | buffers_per_acquisition = 0 |
| uint | buffer_count = 4 |
| uint | samples_per_buffer = 204800 |
| double | integration_time = 0.0f |
| double | sample_rate = 0.0f |
| uint | ring_buffer_size = 1e6 |


This model was trained on Inception V3 via transfer learning:
iTunes genres and corresponding subgenres were grouped together to create 36 image classes:
Model Performance was evaluated for the training, validation and test sets
Upload your image below to seee how the model would perform


{% extends "layout-v2.html" %} {% block pageScripts %} {% endblock %} {% block pageTitle %} NHS Cervical screening management system {% endblock %} {% block header %} {% include '../components/header.html' %} {% endblock %} {% block content %}
|
NHS number:<PHONE_NUMBER> Name: Alexandra Killingbeck DOB: 01 03 1975 Address: 25 Folly Hall Lane, Leeds Postcode: LS2 7EF |
NHS number:<PHONE_NUMBER> Name: Alexandra Killingbeck DOB: 01 03 1975 Address: 25 Polly Hall Lane, Leeds Postcode: LS2 7EF |
99% |
|


Javascript configuration of tests always hard. This project provides to test javascript codes on Electron Browser by --rendered parameters. You can tests on existing adapter like Mocha or you can write new adapter to test with other libraries.
- Test on Node
- Test on Browser just once
- Test on Browser as interactive
node ./node_modules/tdd-suite/bin/tdd-suite --opts mocha.opts --root-list src
$ git clone https://github.com/wasabi-io/tdd-suite.git`
$ cd tdd-suite
$ npm install
$ npm test
$ npm run coverage
$ npm run docs
$ npm build
Generated using TypeDoc


WifiNotify
Start service will start the listening for
wifi points. Once started it will remain on until stop service button
is clicked (even after restarts).
use the above form to add projects for wifi monitoring, will
grab all local ssids when added
refreshed: 0
Get auto checkin status
Project ID
Auto


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @()(implicit request: Request[_], messages: Messages, templateRenderer: uk.gov.hmrc.renderer.TemplateRenderer, partialRetriever: uk.gov.hmrc.play.partials.FormPartialRetriever) @import uk.gov.hmrc.urls.Link @main( title=Messages("tai.gatekeeper.refuse.title"), gaCustomTitle = None ){
@Html(Messages("label.we_need_to_speak_to_you_before_you_can_access"))
@Messages("label.phone_lines_are_open_8am_to_8pm_monday_to_friday_and_8am_to_4pm_on_saturday")
@Messages("label.closed_sundays_and_bank_holidays")
@Messages("label.phone_lines_are_less_busy_before_10am_monday-to_friday")
@Messages("label.find_out_about_call_charges") @Messages("label.opens_in_a_new_window")


GeoCat Live
Earth-hosted
GIS servers
María Arias de Reyna Domínguez
Who are we?
GIS Ecosystem
-
GeoDatabases
-
Map Services (geoServer, mapServer,...)
-
Metadata Catalog (geoNetwork, pyCSW)
-
Unified interface?
-
Desktop client (qGIS, ArcGIS,...)
GIS Ecosystem
-
Interoperability
-
INSPIRE
-
Create and edit geo datasets
-
Accesibility
GIS Ecosystem
Solution: Unified Platform
maybe even a SaaS?
GIS Ecosystem
Each server has its own requirements
Very different developments
- open-sourced?
- easy to install and administer?
- good performance?
- scalable?
GeoCat Live
- GIS Services
- Metadata Catalog
- Unified interface
GeoCat Live
Hosting
- Publish WMS/WFS
- Publish CSW/RDF/RSS/DCAT
- PostGIS storage
- WMC for online maps
And... that's it!
Questions, suggestions, comments, critics?


Python Performance Profiling: The Guts And The Glory
01:45 PM - 02:10 PM on July 16, 2016, Room CR4A. Jesse Jiryu Davis
- Audience level:
- intermediate
- Watch:
- https://www.youtube.com/watch?v=EJ87Kfzvnbs
Description
Your Python program is too slow, and you need to optimize it. Where do you start? Optimization is a scientific investigation, just like debugging is: you generate hypotheses about how to make your program faster, then use benchmarks as the experiments that test your hypotheses. With the right tools, you can optimize your code where it counts. With the Python profiler “Yappi” to understand its features and limitations we’ll learn how to find the maximum performance wins with minimum effort.
Abstract
My boss alerted me to an article on a popular site, which claimed to show that my open-source Python client for MongoDB is three times slower than the Javascript client. Anxiety immediately set in: Was this true? Could I improve it? What should I tell my boss?
I'll describe three open-source profilers for Python, and explain why Yappi is the right profiler for this job.
Optimization is like debugging: we use the scientific method. We form a hypothesis about what changes we can make to our code to make it faster, and we estimate how much improvement an optimization can yield. Then comes the second part of the scientific method: we test the hypothesis with an experiment.
And now, let's return to the problem at hand: Is my code slow? We'll use Yappi to form some hypotheses, then validate them with tests. Finally, I have an answer to my boss's question, and better yet, I can back up my answer with hard evidence.


namebench provides personalized DNS server recommendations based on your browsing history.
WARNING: This tool is in the midst of a major rewrite. The “master” branch is currently in experimental form and currently lacks a user interface, nor does it support any command-line options.
For stable binaries, please see https://code.google.com/p/namebench/
What can one expect in namebench 2.0?