Introduction
Intersection over union (IoU) is a common metric for assessing performance in semantic segmentation tasks. In a sense, (IoU) is to segmentation what an F1 score is to classification. Both are non-differentiable, and not normally optimized directly. Optimizing cross entropy loss is a common proxy for these scores, that usually leads to decent performance, provided everything else has been setup correctly, e.g regularization, stopping training at an appropriate time. Divising a pixelwise loss function, such that a deep network performs segmentation, with the mindset of classification and cross-entropy, we get something like this:
Listing 1: TensorFlow pixelwise softmax cross-entropy loss
# logits has original shape [batch_size x img h x img w x FLAGS.num_classes]
logits=tf.reshape(logits, (-1, FLAGS.num_classes))
trn_labels=tf.reshape(trn_labels_batch, [-1])
cross_entropy=tf.nn.sparse_softmax_cross_entropy_with_logits(logits,trn_labels,name='x_ent')
loss=tf.reduce_mean(cross_entropy, name='x_ent_mean')
train_op=tf.train.AdamOptimizer(FLAGS.learning_rate).minimize(loss,global_step=global_step)
# For inference/visualization, prediction is argmax across output 'channels'
prediction = tf.argmax(tf.reshape(tf.nn.softmax(logits), tf.shape(vgg.up)), dimension=3)
Recently, Y.Wang et al, proposed a straightforward scheme for optimizing approximate IoU directly, but their approach currently only supports binary, e.g foreground/background output. This was fine for my own dataset, to be intrdouced later, but it’s certainly worth looking at how this can be extended to multi-output, which is already handled by Listing 1.
The equations from Y.Wang et al are reproduced here because i’ll convert them to TensorFlow after, but check out their paper for more detail and empirical results on various PASCAL VOC2010/2011 objects.
\begin{equation} I(X) = \sum_{v \in V} X_v \times Y_v \end{equation}
\begin{equation} U(X) = \sum_{v \in V} X_v + Y_v - X_v \times Y_v \end{equation}
\begin{equation} IoU = \frac{I(X)}{U(X)} \end{equation}
\begin{equation} loss = 1.0 - IoU \end{equation}
Listing 2: TensorFlow IoU loss, not shown is the sigmoid non-linearity at output in lieu of ReLU.
'''
now, logits is output with shape [batch_size x img h x img w x 1]
and represents probability of class 1
'''
logits=tf.reshape(logits, [-1])
trn_labels=tf.reshape(trn_labels_batch, [-1])
'''
Eq. (1) The intersection part - tf.mul is element-wise,
if logits were also binary then tf.reduce_sum would be like a bitcount here.
'''
inter=tf.reduce_sum(tf.mul(logits,trn_labels))
'''
Eq. (2) The union part - element-wise sum and multiplication, then vector sum
'''
union=tf.reduce_sum(tf.sub(tf.add(logits,trn_labels),tf.mul(logits,trn_labels)))
# Eq. (4)
loss=tf.sub(tf.constant(1.0, dtype=tf.float32),tf.div(inter,union))
train_op=tf.train.AdamOptimizer(FLAGS.learning_rate).minimize(loss,global_step=global_step)
# For inference/visualization
valid_prediction=tf.reshape(logits,tf.shape(vgg.up))
In Listing 1, the network output was ReLU’d and softmax’d, so the final output was nearly one-hot in the output channels, or (class) dimension, hence the argmax to compare the maximally activated channel with an integer in the training label. The argmax disappears in Listing 2 because we network output passes through a sigmoid, so we just take the logits as a face value preference for either class 0 or class 1.
A fairly low capacity model, the VGG6xs-Fc6-k1-512-Deconv-k64s32, was used to do an apples to apples comparison of the two loss functions. This is my own naming convention, but essentially we have: the front end of a VGG16 trimmed down to 5 convolution layers, keeping one of each differently sized layer, number of filters in the first layer reduced from 64 to 16, but still doubling in each subsequent layer, ‘Fc6’ has kernel size 1x1 instead of 7x7, and 512 hiddens, a single deconvolution layer with 64x64 kernel and stride 32.
My dataset has a class distribution of approximately 13% class 1 for (training) and 40% class 1 for (validation). In my very preliminary experiments, I have found the IoU method to be much more sensitive to selection of learning rate and batch size, even with the fairly robust ADAM gradient descent scheme. A fairly high learning rate of 1e-3 led to an unusual instability where the the network always predicted class 0, with a few small point sources of class 1, resulting in a flatline validation mIoU of 31%. This checks out with the aforementioned class balance since we get approx 0% IoU for class 1, and 60% IoU for class 0 by always predicting class 0, which averages to 30%. It can therefore be said that the network has learned something useful for mIoU scores above 30%.
Reducing the learning rate to 1e-4, adding dropout regularization, and increasing mini-batch size to 10, resulted in a fairly nice comparison of the two loss functions. The only difference between the solid and dashed lines in the above figure is that ‘IoU-loss’ was trained with the loss function from Listing 2, while ‘Xent-loss’ was trained with cross-entropy softmax loss as in Listing 1. Optimizing IoU directly resulted in a 3.42% boost in mIoU on my validation set. This difference will likely grow when a higher capacity model is used.
The above image shows from left to right, a sample input, network output at step 5800, and mask. The top uses the IoU loss from Listing 2, while the bottom uses cross-entropy loss from Listing 1. In general, the IoU loss recovers false-negatives but makes more false-positives. The top is fuzzy around the object border because the output has not been thresholded.
Above, IoU loss, below, xent loss.
Below are some more samples drawn for validation images, with models trained to 11k steps.
Above, IoU loss gets 3/3 of class 1 objects, while below, xent loss identifies 2/3.


{{ topic.title }}
{{ topic.excerpt | strip_html }}, ARGHHHH
--- layout: page hero_text: Dragons Running title: New title 31st May --- {% assign top_topics = site.posts | where:"importance","high" | sort: 'sequence' %} {% assign bottom_topics = site.posts | where:"importance","low" | sort: 'sequence' %}


migration crystal oxide Phys. form Fermi oxygen {border-style mig sites px;} #ffffff;} site garnet-type high oxygen-ion structure calculations energy using paths Chem. Rev. path Mater. higher method perfect . eV Figure bond defect low shown ./PhysRevB.. Supplementary band-gap doping obtained sites, Fig. However, cells charged chemical conductivity formation increase internal mechanism px; stable values {font-family Therefore, based cations cell conduction coordinates cubic defects energies font-size implies lower performed point significantly solid (.) ./. antisites band charge considered distance double; h′–O– kick-out lattice lengths shows . Å. Ca–O HOMO LUMO LaGaO addition, atoms border-color border-width cation computational condition conductor conductors connected conventional crystal, density doubly extrinsic fuel function garnet level near necessary order oxides properties solid; study supercell theoretical value {font-style {font-weight ./S-()- . Å, Additional Appl. CI-NEB Ca, Commons Creative Fe, Kresse LUMO. Lett. Perfect Soc. Table Tanaka Togo Zunger aliovalent band-gap. bold bonds computed courier; delocalized effective elastic em; first-principles functional generated good image implemented interstitial ion longer lowest neutral nudged optimized potential primitive proposed pt;} range result results stability stabilized state three-dimensional type types used valences


8-y-o stabbed to death...suspect believed to be close family friend
An eight-year-old boy has been stabbed to death in Old Harbour, St Catherine, the police have confirmed.
Police investigators believe that the male suspect is someone close to the family.
It is unclear if he has been taken into custody.
According to the police Corporate Communications Unit (CCU), the incident happened “sometime between last night and this morning.”
“We can confirm that it did happen, but we are still awaiting the details,” a CCU spokesperson told The Gleaner a short time ago.
More details to come.


| 1. Juicy Pear | 6. Coconut |
| 2. Caramel Corn | 7. Champagne |
| 3. Cantaloupe | 8. Tabasco |
| 4. Top Banana | 9. Draft Beer |
| 5. Dr. Pepper | 10. Pancakes & Syrup |
“We called it the tiger room because there was no door, and so I ordered a bamboo-beaded curtain. I selected one with a white tiger because they are sports elegant.”
- Trei Brundrett


OwnStorj
Download public file
Filename:
a.jpg
File size:
6MB
(67698 bytes)
File upload date:
6MB
Download file
Preview
Download progress:
0%
Waiting for user...
...
Downloading from farmer:
Address:
storj://<IP_ADDRESS>:4000/abcde
Country:
Poland
ISP:


We are in love with JavaScript and passionate about web applications development. Currently, we are on a mission to share anything and everything we have learned in the world of technology and personal finance.
Read our popular programming articles.
It is a widely accepted fact that tech nerds are not so good at managing their finances.
It wrong. And, it is very wrong.We are here to change that notion. We are here to help our friends achieve great success in their Software Engineering career as well as achieve finance freedom. In doing so, we are going to share all the awesome ways they can start earning passive income and invest that money to build wealth. Become financially independent as soon as possible so that you don't have to work for money anymore.
We share all the latest and greatest things on vanilla JavaScript, AngularJS, Angular, ReactJS, NodeJS, GraphQL, HTML5, CSS.
And to help you guys on your financial side - we will be sharing a lot of great tips and tools on reaching your financial retirement at the earliest. We will show you how you can enjoy your present while you are investing for your glorious future.
Disclaimer: NgNinja Academy strives to keep its information accurate and up to date. This information may be different than what you see when you visit a financial institution, service provider or specific product’s site. All financial products, shopping products and services are presented without warranty. When evaluating offers, please review the financial institution’s Terms and Conditions.


Match Play. Red leads 5-1 to 11. How should Red play 63?
pips Red=25 White=104
(CorrectAnswer= 0/0, ErrorScore= 0)
The first of many positions from this year's World Championship Finals.
Doug Mayfield was Red and played 5/off, 5/2, got hit and went on to lose a doubled game (after Akiko made her worst doubling decision of the entire match).
When watching the match live with various top players from around the world commenting I was fairly sure the best play was 5/off, 4/1. When the blots are missed there is virtually no extended jeopardy. After either of the other plays there is considerable extended jeopardy. Opinion online was divided between the safe play and the hit.
XG has no such problems. The safe play is correct by a country mile. 5/off, 5/2 is a double blunder and 5/off, 3/off is a triple blunder. Doug paid heavily for his error.
Doug Mayfield was Red and played 5/off, 5/2, got hit and went on to lose a doubled game (after Akiko made her worst doubling decision of the entire match).
When watching the match live with various top players from around the world commenting I was fairly sure the best play was 5/off, 4/1. When the blots are missed there is virtually no extended jeopardy. After either of the other plays there is considerable extended jeopardy. Opinion online was divided between the safe play and the hit.
XG has no such problems. The safe play is correct by a country mile. 5/off, 5/2 is a double blunder and 5/off, 3/off is a triple blunder. Doug paid heavily for his error.
1. Cubeful 2-ply 5/off 4/1 Eq.: +0.706 0.692 0.306 0.014 - 0.308 0.000 0.000 2. Cubeful 2-ply 5/2* 5/off Eq.: +0.576 (-0.130) 0.632 0.353 0.010 - 0.368 0.000 0.000 3. Cubeful 0-ply 5/off 3/off Eq.: +0.698 (-0.008) 0.623 0.308 0.023 - 0.377 0.000 0.000


What are you looking for?
Press
enter
to confirm search term
Start a Project
Let's discuss your next project.
Our Service
Lorem ipsum dolor amet consectetuer adipis.
Our Promise
Lorem ipsum dolor amet consectetuer adipis.
Your Project
Lorem ipsum dolor amet consectetuer adipis.
Focus on You
Lorem ipsum dolor amet consectetuer adipis.
Give us a call
Contact Page
Start Project
Home
App
App 2
Agency
Agency 2
Business
Personal
Software
One Page
Pages
About
About me
About us
About company
Our team
Services
Our Services 1
Our Services 2
Packages
Careers
FAQ 1
FAQ 2
Utility
Coming Soon
404 Not Found
500 Internal Error
Maintenance
Grid System
Account
Log In
Create account
Elements
About
Services
Newsletters
News
Testimonials
Pricing Tables
Contact Blocks
Counters
Promo Blocks
Typography
Lightbox
Social
Logo Strip
Tabs
Accordion
Half Elements
Phone Blocks
Icon & Text
Galleries
Footers
Portfolio
Listing
4 Column
3 Column
2 Column
Parallax
Masonry
3 Column
3 Column Full Width
4 Column
4 Column Full Width
Full Width
4 Column
3 Column
2 Column
Project
Project 1
Project 2
Project 3
Project 4
Project 5
Blog
Contained
1 Column
2 Column
3 Column
4 Column
With Sidebar
Full Width
3 Column Full Width
4 Column Full Width
With Sidebar
Posts
Post Full Width
Post with Sidebar
Contact
Contact Maps
Contact Minimal
Contact Simple
Elements
Social
Social Blocks mainly social media


6
Player
Enemy
NEXT
Difficulty
CASUAL
CHALLENGE
EXTREME
Return to Game
Boosts
Elixir of Healing
Quickly Restore 50% Health
Orb of Quick Power
Instant Power on Next Move
Tome of Protection
+50 Increase of Max Defense
Return to Game
GuiMage
Arcannus
Achievements
Arcannus
Return to Game
100
100
Level 1
Tournament Trophys
100
| Arcane | 1 |
| Spark | 1 |
| Fire | 1 |
| Sword | 1 |
| Meteor | 1 |
| Earth | 1 |
| Air | 1 |
Return to Game


To use the JavaScript Subcode Graphics Player,
you must use an HTML5 audio/canvas compatible browser. [audio]
To use the JavaScript Subcode Graphics Player,
you must use an HTML5 audio/canvas compatible browser. [canvas]
Please select a file to play...
Bright Eyes - First Day of My Life


Search Categories
View more >>
Beverages
Bakery
Dairy
Meat
Vegetables
Dry Goods
Search Recipes
View more >>
Chicken Udon Soup
Cook time: 15 minutes
Yield: 4 Servings
English Toffee
Cook time: 20 minutes
Yield: About 40 pieces
Spicy Fried Chicken
Cook time: 30 minutes
Yield: 4 servings
French Toast
Cook time: 15 minutes
Yield: 4 servings
Banana Bread
Cook time: 55 minutes
Yield: Makes one loaf
BBQ Chicken Burrito Bowl
Cook time: 10 minutes
Yield: 4 servings


KMIA - MYNN
So that’s it folks, we are out of the United States. KMIA was our last stop before heading over to the Caribbean. We will come back to the USA later, this time through the west coast.
Nassau is the main city of The Bahamas. It is served by the Lynden Pindling International Airport.
You can tell you are in the Caribbean simply by looking at the color of the water:
The approaches are colorful and entertaining. On final approach, I swear I could see some of the beach hotels on the shoreline:
With no wind and clear skies, the final approach and landing was textbook smooth.


2019 - Present
Gordon College, Wenham MA
Computer Science (BS) and Economics, Spanish minor.
Gordon College, Wenham MA
Computer Science (BS) and Economics, Spanish minor.
WPS Summer Enrichment Robotics Teacher
Taught a summer enrichment program in robotics for local middle school students.
Created 24 hours of curriculum with the goal of introducing kids of all backgrounds and levels of experience to robotics. Taught four sessions and focused on experiential, hands on learning with VEX robotics and basic Arduino projects.
ICADS Spanish Language & Society Study Abroad in Costa Rica
Immersive study of global social and economic issues from alternative perspectives.
Intensive Spanish study, worked with a community development center that bridges the gap between one of the wealthiest and poorest areas of San José.
Gordon 360 Jenzabar Intern and Technical Lead
Assisted other student developers; personal work included progress migrating API from .NET 4.6 to .NET Core 5, stylesheet migration to CSS Modules, and new UI features.
Suffered a concussion during the previous spring, so this summer also included work on spring semester classes.
Resident Advisor
Served as Nyland 3W RA at Gordon College during academic year of Covid-19.
Gordon 360 Team Developer
Worked on a team developing Gordon College's student site. Migrated a Student News platform in 2020 and worked fully online during Covid-19 outbreak.
Developed IBRI Organization Site
Updated website for the Interdisciplinary Biblical Research Institute (continuous development)
Research Intern, UHart REU
Researched and modeled feedback control in human movement. I worked with MATLAB and Adobe Illustrator to generate and analyze perturbation data, helping to write up and create figures for research paper.
The final research paper was published in 2021.
Developed White Oak Project Site
Worked with a nonprofit with the goal of reforestation along New York canals. This site is now not being used as SUNY Oswego has since begun supporting the project.
Developed a Fundraising Database
Created online database platform for robotics team to track funds and streamline that process.


Reliance Jio brings back Rs 98, Rs 149 plans; offers up to 24GB data, free voice calls
by BusinessToday.InReliance Jio new plans: The Rs 149 plan comes with total data of 24 GB which translates to 1GB per day
Days after it announced the new plans, Reliance Jio has brought back two of its old affordable prepaid plans. The Rs 98 and Rs 149 affordable plans have been added to its new list of tariffs. The Rs 149 plan has a validity of 24 days, while the Rs 98 plan has a validity of 28 days.
In the Rs 98 plan, users can avail a total of 2GB high-speed data as well as 300 free SMSes. The plan also offers complimentary subscription to Jio Apps. Users will have to buy an extra IUC plan for non-Jio calls that will get them 124 IUC minutes.
The Rs 149 plan comes with total data of 24 GB which translates to 1GB per day. It is also offered with Jio to Jio unlimited voice calls and 300 FUP minutes for non-Jio calls. Users can enjoy 100 free SMSes per day. It is also bundled with complimentary subscription to Jio Apps.
After a hike in prices, Reliance Jio rolled out its plans starting from Rs 129 for a validity of 28 days. The plans go up to Rs 2,199 for 365 days. As per the company, the new plans are costlier but offer 300 per cent more benefits than before. The plans also come with subscription to JioTV, JioCinema, JioSaavn, JioNews, JioSecurity, JioCloud and JioHealth. Under JioCinema, users can enjoy over 10,000 movies and TV shows while JioSaavn offers access to thousands of songs.
The new plans became effective from December 6. The new plans have been categorised as 1-month, 2-month, 3-month, 12-month and affordable plans categories.
Also read: Reliance Jio releases new All-in-One plans; prices begin at Rs 199
Also read: Reliance Jio All-in-One plans: How they fare against new Vodafone Idea, Airtel tariff packs


Tickets
Select Tickets
Step 1
Please select the day when you want to join The Game Week Viborg 2020
| Ticket | 1 Day Ticket | 3 Day Ticket | Students |
|---|---|---|---|
| Date | 04 October(Fri) | 01-04 October(Fri-Sun) | 01-04 October(Fri-Sun) |
| Normal | 120DKK | 170DKK | Free |
| Business | 300DKK | 550DKK | Free |
| VIP | 700DKK | 1200DKK | Free |
Select Your Lunch
Step 2
Please select your main lunch dish for registered day. There will be no further costs for the lunch.


Profile
Logout
Post a question
All
link
other
Normal Post
Title*:
Comment*:
Tag
Comment
Link Post
Link*:
Title*:
Comment*:
Tag
Submit


We buy networks!
- exploit scalable initiatives
- embrace turn-key relationships
- optimize integrated infomediaries
- reinvent B2C web services
- exploit impactful web-readiness
- implement integrated platforms
- recontextualize compelling e-business
- engage bricks-and-clicks metrics
- cultivate value-added interfaces
- innovate ubiquitous methodologies
- drive 24/365 web-readiness


3 references to Dispose
System.Management.Automation (3)
engine\NativeCommandProcessor.cs (3)
2018
this.
Dispose
();
2035
this.
Dispose
();
2151
Dispose
();


Initial Coin Offering Example Loading... Your current balance: 0 YTN. Buy more! Each token costs 0.0001 ether. Number of tokens to buy 0 / 0 tokens sold so far


|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object javax.print.attribute.SetOfIntegerSyntax
public abstract class SetOfIntegerSyntax
Class SetOfIntegerSyntax is an abstract base class providing the common implementation of all attributes whose value is a set of nonnegative integers. This includes attributes whose value is a single range of integers and attributes whose value is a set of ranges of integers.
You can construct an instance of SetOfIntegerSyntax by giving it in "string
form." The string consists of zero or more comma-separated integer groups.
Each integer group consists of either one integer, two integers separated by
a hyphen (-
), or two integers separated by a colon
(:
). Each integer consists of one or more decimal digits
(0
through 9
). Whitespace characters cannot
appear within an integer but are otherwise ignored. For example:
""
, "1"
, "5-10"
, "1:2,
4"
.
You can also construct an instance of SetOfIntegerSyntax by giving it in
"array form." Array form consists of an array of zero or more integer groups
where each integer group is a length-1 or length-2 array of
int
s; for example, int[0][]
,
int[][]{{1}}
, int[][]{{5,10}}
,
int[][]{{1,2},{4}}
.
In both string form and array form, each successive integer group gives a range of integers to be included in the set. The first integer in each group gives the lower bound of the range; the second integer in each group gives the upper bound of the range; if there is only one integer in the group, the upper bound is the same as the lower bound. If the upper bound is less than the lower bound, it denotes a null range (no values). If the upper bound is equal to the lower bound, it denotes a range consisting of a single value. If the upper bound is greater than the lower bound, it denotes a range consisting of more than one value. The ranges may appear in any order and are allowed to overlap. The union of all the ranges gives the set's contents. Once a SetOfIntegerSyntax instance is constructed, its value is immutable.
The SetOfIntegerSyntax object's value is actually stored in "canonical
array form." This is the same as array form, except there are no null ranges;
the members of the set are represented in as few ranges as possible (i.e.,
overlapping ranges are coalesced); the ranges appear in ascending order; and
each range is always represented as a length-two array of int
s
in the form {lower bound, upper bound}. An empty set is represented as a
zero-length array.
Class SetOfIntegerSyntax has operations to return the set's members in canonical array form, to test whether a given integer is a member of the set, and to iterate through the members of the set.
| Constructor Summary | |
|---|---|
protected |
SetOfIntegerSyntax(int member)
Construct a new set-of-integer attribute containing a single integer. |
protected |
SetOfIntegerSyntax(int[][] members)
Construct a new set-of-integer attribute with the given members in array form. |
protected |
SetOfIntegerSyntax(int lowerBound,
int upperBound)
Construct a new set-of-integer attribute containing a single range of integers. |
protected |
SetOfIntegerSyntax(String members)
Construct a new set-of-integer attribute with the given members in string form. |
| Method Summary | |
|---|---|
boolean |
contains(int x)
Determine if this set-of-integer attribute contains the given value. |
boolean |
contains(IntegerSyntax attribute)
Determine if this set-of-integer attribute contains the given integer attribute's value. |
boolean |
equals(Object object)
Returns whether this set-of-integer attribute is equivalent to the passed in object. |
int[][] |
getMembers()
Obtain this set-of-integer attribute's members in canonical array form. |
int |
hashCode()
Returns a hash code value for this set-of-integer attribute. |
int |
next(int x)
Determine the smallest integer in this set-of-integer attribute that is greater than the given value. |
String |
toString()
Returns a string value corresponding to this set-of-integer attribute. |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
protected SetOfIntegerSyntax(String members)
members
- Set members in string form. If null, an empty set is
constructed.
IllegalArgumentException
- (Unchecked exception) Thrown if members
does not
obey the proper syntax.protected SetOfIntegerSyntax(int[][] members)
members
- Set members in array form. If null, an empty set is
constructed.
NullPointerException
- (Unchecked exception) Thrown if any element of
members
is null.
IllegalArgumentException
- (Unchecked exception) Thrown if any element of
members
is not a length-one or length-two array or if
any non-null range in members
has a lower bound less
than zero.protected SetOfIntegerSyntax(int member)
member
- Set member.
IllegalArgumentException
- (Unchecked exception) Thrown if member
is less than
zero.protected SetOfIntegerSyntax(int lowerBound, int upperBound)
lowerBound
- Lower bound of the range.upperBound
- Upper bound of the range.
IllegalArgumentException
- (Unchecked exception) Thrown if the range is non-null and
lowerBound
is less than zero.| Method Detail |
|---|
public int[][] getMembers()
public boolean contains(int x)
x
- Integer value.
x
, false otherwise.public boolean contains(IntegerSyntax attribute)
attribute
- Integer attribute.
theAttribute
's value, false otherwise.public int next(int x)
-1
is
returned. (Since a set-of-integer attribute can only contain nonnegative
values, -1
will never appear in the set.) You can use the
next()
method to iterate through the integer values in a
set-of-integer attribute in ascending order, like this:
SetOfIntegerSyntax attribute = . . .; int i = -1; while ((i = attribute.next (i)) != -1) { foo (i); }
x
- Integer value.
x
, or -1
if no integer in
this set-of-integer attribute is greater than x
.public boolean equals(Object object)
object
is not null.
object
is an instance of class SetOfIntegerSyntax.
object
's
members are the same.
equals
in class Object
object
- Object to compare to.
object
is equivalent to this
set-of-integer attribute, false otherwise.Object.hashCode()
,
Hashtable
public int hashCode()
hashCode
in class Object
Object.equals(java.lang.Object)
,
Hashtable
public String toString()
"i"
if
the lower bound equals the upper bound or
"i-j"
otherwise.
toString
in class Object
|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Copyright © 2004, 2010 Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.


Resource not found
Please try again later. If this issue continues to occur please contact the Book a Secure Move team.
OK, continue


Inheritance diagram for Bp::BpInterconnect::BpPrintConnectionsCommandOptions:
Public Member Functions | |
| BpPrintConnectionsCommandOptions () | |
| virtual | ~BpPrintConnectionsCommandOptions () |
Protected Member Functions | |
| virtual OptionsDescriptorBase * | GetOptions () |
Definition at line 1204 of file bp_interconnect.h.


Local fake authority (proxy 15000)
OidcClient Sample
UserManager Sample
IdentityServer demo
UserManager Sample with implicit flow
UserManager Sample with code flow


Using official Cypress dashboard is rather expensive (especially if you
run thousands of tests every day). What's why we developed Github App.
This bot:
Downloads artifacts from workflow with tests, finds screenshots
diffs images, and pins them to the tests failure report as Pull
Request comment.
Always holds first PR comment. Any workflow updates (for example,
new commit pushed to the branch) edit already existing bot comment.
No endless stream of comments from bot!
Doesn't require any data-storage for your screenshots with diffs.
Bot creates separate branch to upload images for its tests failure
report. After closing PR bot removes all saved screenshots. Also,
you can delete this branch at any time to clean github history.


A curated list of awesome Competitive Programming
, Algorithm
and Data Structure
resources.
Created with a view to connecting people to information, this list below contains a complete collection of all the fantastic resources I’ve collected over the course of my 11-year competitive programming career. I hope you’ll find it useful :)
Awesome curated lists classified by topics.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Good Blog Post Resources about Algorithm and Data Structures - Codeforces | A collection of fantastic tutorial blog posts written by Codeforces users. Some intriguing ones include Palindromic Trees, Policy Based Data Structures, and a lot more. |
| ★★★ | All of the good tutorials found on codeforces - Codeforces | Another good collection of tutorial blog posts written by Codeforces users. |
| ★★★ | Data Structures and Algorithms - CodeChef Discuss | A very complete list of competitive programming resources. A must-have in your browser bookmark. |
| ★★★ | How to prepare for ACM - ICPC? - GeeksforGeeks | A detailed walk-through of the preparations for ACM-ICPC. |
Find out what topics you need to learn.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | IOI Syllabus | A detailed syllabus on which IOI contestants will be tested. This is still somewhat relevant to ACM-ICPC. |
| ★★★ | How to prepare for ACM - ICPC? - GeeksforGeeks | A detailed walk-through of the preparations for ACM-ICPC. |
| ★★☆ | Programming Camp Syllabus | A list of important topics in competitive programming with exercise problems. |
| ★★☆ | Juniors Training Sheet, by Mostafa Saad Ibrahim | ~800 ordered problems for newcomers to be good up to Div2-D |
Awesome websites with great tutorials.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Topcoder Data Science Tutorials | A list of tutorials written by respected Topcoder members. Many top programmers started learning data sciences from here. |
| ★★★ | E-Maxx (Russian), (English) | A tutorial website widely used and referenced in the Russian-speaking competitive programming community. Most of the articles of the original site have been translated into English, Google Translate works okay for the remaining ones. |
| ★★☆ | Algorithms - GeeksforGeeks | A website with a large archive of nicely written articles on different topics. It is a great complimentary resource for algorithm courses. |
| ★★☆ | PEGWiki | A website with amazing in-depth wiki-like writeups on many topics. It’s far better than those on Wikipedia in my opinion. |
| ★★☆ | Notes - HackerEarth | A great crowdsourcing platform for tutorials. Also visit Code Monk. |
| ★★☆ | USA Computing Olympiad (USACO) | Contains several training pages on its website which are designed to develop one’s skills in programming solutions to difficult and varied algorithmic problems at one’s own pace. |
| ★★☆ | basecs | A blog with in-depth, illustrated tutorials on basic algorithms and data structures. |
| ★★☆ | Competitive Programming - Commonlounge | Short video tutorials for beginner and intermediate concepts. Advanced tutorials selected from the best ones available on various CP blogs. |
| ★☆☆ | OLYMPIADS IN INFORMATICS | An international journal focused on the research and practice of professionals who are working in the field of teaching and learning informatics to talented student. |
| ★☆☆ | algolist (Russian) | A Russian website devoted to algorithms of all sorts. Some topics listed on this website seems pretty interesting. |
| ★★☆ | 演算法筆記 (Algorithm Notes) (Chinese) | One of the most popular tutorial websites among the Taiwanese competitive programming community. The maintainer for this website spends immense efforts on researching algorithms. |
| ★★☆ | 国家集训队论文 1999-2015 (Papers from Chinese IOI training camps) (Chinese) | Papers from the Chinese IOI training camps. It’s interesting for the fact that one can tell different regions emphasize different things. |
| ★★★ | Mini-Editorials, by Mostafa Saad Ibrahim trainees | Solutions with mini-editorials for many problems, including UVA/SPOJ/IOI/Olympiad problems |
| ★★☆ | OI Wiki (Competitive Programming) (Chinese) | OI Wiki is committed to being a free and open continuously updated programming competition (competitive programming) knowledge integration site. This wiki is a sort of companion or guide for the competitive programmer who’s trying to learn something |
Consider beginning your competitive programming journey with these awesome courses!
| ☆ | Name | Description |
|---|---|---|
| ★★☆ | Code Monk, by HackerEarth | A fantastic step-by-step tutorial on the essential topics in competitive programming. |
| ★★★ | Stanford CS 97SI: Introduction to Competitive Programming Contests | Offers comprehensive lecture slides and a short list of exercise problems. |
| ★★☆ | How to Win Coding Competitions: Secrets of Champions | A course by ITMO University on competitive coding on edX. |
| ★★☆ | Codechef’s Indian Programming Camp | Video Lectures from Codechef’s Indian Programming Camp 2016. Lectures given by top competitive programmers like Sergey Kulik, Kevin Charles Atienza and Anudeep Nekkanti. Primarily focused on exploring these concepts by applying them to actual competitive contest problems. |
| ★★☆ | Reykjavik T-414-ÁFLV: A Competitive Programming Course | An awesome course taught by Bjarki Ágúst Guðmundsson (SuprDewd). These lectures feature neat slides and a nice list of problems to practice. |
| ★★☆ | NCTU DCP4631: Problem Solving and Programming Techniques | A course on basic topics featuring good lecture slides. |
| ★☆☆ | Materials (English) from Arabic Competitive Programming YouTube Channel | Some materials (slides & source codes) covering a broad range of algorithmic topics by Mostafa Saad Ibrahim. |
| ☆ | Name | Description |
|---|---|---|
| ★★★ | prakhar1989/awesome-courses#algorithms | A fantastic list of open courses offered by notable institutions (MIT, Stanford, UC Berkeley … etc.). |
| ★★☆ | UIUC Algorithm Course | lecture notes, homeworks, exams, and discussion problems covering a broad range of algorithmic topics |
A list of recommended books for competitive programming.
| ☆ | Name | Description |
|---|---|---|
| ★★☆ | Competitive Programming, by Steven and Felix Halim | This book contains a collection of relevant data structures, algorithms, and programming tips. It’s a well-received book. … The first edition is free for download (pdf). |
| ★★☆ | Programming Challenges: The Programming Contest Training Manual, by Steven Skiena and Miguel Revilla | This book includes more than 100 programming challenges, as well as the theory and key concepts necessary for approaching them. Problems are organized by topic, and supplemented by complete tutorial material. |
| ★★☆ | Competitive Programmer’s Handbook, by Antti Laaksonen | An introduction to competitive programming for aspiring IOI and ICPC contestants. Free to download (pdf). |
| ★★☆ | Computational Geometry: Algorithms and Applications, by Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars | This is a well-written book which covers a broad range of computational geometry problems. |
| ★☆☆ | The Hitchhiker’s Guide to the Programming Contests, by Nite Nimajneb | This book is free for download (pdf). This book covers various topics relevant to competitive programming. |
| ★★★ | プログラミングコンテストチャレンジブック (Japanese), by 秋葉拓哉, 岩田陽一, 北川宜稔 | An absolutely phenomenal book. The contents, organized in a very coherent manner, are nothing short of amazing. … 培養與鍛鍊程式設計的邏輯腦：世界級程式設計大賽的知識、心得與解題分享 (Chinese Traditional) |
| ★★☆ | 算法竞赛入门经典 (Chinese), by 刘汝佳 | The Art of Algorithms and Programming Contests (English), 打下好基礎：程式設計與演算法競賽入門經典 (Chinese Traditional) |
| ★★☆ | 算法竞赛入门经典——训练指南 (Chinese), by 刘汝佳, 陈锋 | 提升程式設計的解題思考力 ─ 國際演算法程式設計競賽訓練指南 (Chinese Traditional) |
| ★★★ | 算法艺术与信息学竞赛 (Chinese), by 刘汝佳, 黄亮 | An old-time classic. It’s old but the contents in this book are still considered to be very difficult by today’s standards. |
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein | Also known as CLRS (taken from name initials), this book is often referred to as the “bible” for algorithms and data structures. It’s one of the most popular textbooks for university algorithm courses. This book covered various algorithms and data structures in great detail. The writing is more rigorous and can be difficult to some. |
| ★★☆ | Algorithm Design, by Jon Kleinberg and Éva Tardos | This book revolves around techniques for designing algorithms. It’s well-organized and written in a clear, understandable language. Each chapter is backed with practical examples and helpful exercises. The chapter on network flow is highly praised by lots. … The lecture slides that accompany the textbook are available on its official website. |
| ★★★ | Algorithms, by Robert Sedgewick and Kevin Wayne | This book is neatly categorized, coupled with elaborate explanations and fantastic illustrations. It is used in some IOI training camps as a textbook. |
| Algorithms and Data Structures in Action, by Marcello La Rocca | This book provides a different approach to algorithms, balancing theory with a more practical angle, with a section per-chapter focusing on how to apply algorithms to real-world use cases that can be found in your daily work, or in competitive programming; it also presents a blend of classic, advanced, and new algorithms. | |
| ★★★ | Algorithms, by Jeff Erickson | A free electronic version of a self-published textbook licensed under CC by 4.0. This is a well written book from lecture notes of theoretical computer science courses at the University of Illinois. Covers the main paradigms of backtracking, dynamic programming, greedy, and particularly graphs in depth. |
| ☆ | Name | Description |
|---|---|---|
| ★★☆ | Discrete Mathematics and Its Applications, by Kenneth H. Rosen | Discrete Mathematics is closely relevant to competitive programming. This book provides comprehensive materials on a wide range of topics including: Logics and Proofs, Sets, Functions, Sequences, Matrices, Number Theory, Recursion, Counting, Probability, Graphs, Trees and Boolean Alegra to name but a few. |
| ★★☆ | Concrete Mathematics: A Foundation for Computer Science, by Ronald L. Graham, Donald E. Knuth, Oren Patashnik | The book offers a deeper insight into Discrete Mathematics with more emphases on number-related topics. |
| ★★☆ | Linear Algebra and Its Applications, by David C. Lay, Steven R. Lay, Judi J. McDonald | The book does a brilliant job at bridging the gap between a physical system (for scientists and engineers) and an abstract system (for mathematicians). |
| ★★☆ | Introduction to Probability, by Charles M. Grinstead, J. Laurie Snell | This is a well-written introductory probabilities book. … It’s free for download (pdf) (released under GNU Free Documentation License). |
| ★★☆ | Intermediate Counting & Probability, by David Patrick | Topics in counting and probability byformer USA Mathematical Olympiad winner David Patrick , topics include inclusion-exclusion, 1-1 correspondences, the Pigeonhole Principle, constructive expectation, Fibonacci and Catalan numbers, recursion, conditional probability, generating functions, graph theory, and much more.. |
Good online judge systems / contest platforms to practice.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Topcoder | Topcoder has been around since 2001. Rich in history, It’s considered to be one of the most prestigious organizations when it comes to technology competitions. Hundreds of SRMs gave birth to an abundant problemset. Problems here are typically more challenging than others and Topcoder therefore appeals to many elite programmers. The annual Topcoder Open (TCO) is also a widely-discussed event. |
| ★★★ | Google Code Jam | Google Code Jam is certainly one of the most highly-esteemed programming competitions. The competition consists of unique programming challenges which must be solved in a fixed amount of time. Competitors may use any programming language and development environment to obtain their solutions. |
| ★★★ | AtCoder | AtCoder is a new but phenomenal contest platform created by a team of highly-rated Japanese competitive programmers. |
| ★★☆ | CodeChef | CodeChef is a non-profit educational initiative of Directi. It’s a global competitive programming platform and has a large community of programmers that helps students and professionals test and improve their coding skills. Its objective is to provide a platform for practice, competition and improvement for both students and professional software developers. Apart from this, it aims to reach out to students while they are young and inculcate a culture of programming in India. |
| ★★★ | SPOJ | The SPOJ platform is centered around an online judge system. It holds a staggering amount of problems prepared by its community of problem setters or taken from previous programming contests, some of which are great problems for practice (refer to the Problem classifiers section). SPOJ also allows advanced users to organize contests under their own rules. |
| ★★☆ | Timus | Timus Online Judge is the largest Russian archive of programming problems with automatic judging system. Problems are mostly collected from contests held at the Ural Federal University, Ural Championships, Ural ACM ICPC Subregional Contests, and Petrozavodsk Training Camps. |
| ★☆☆ | HDU | HDU is an online judge maintained by Hangzhou Dianzi University. It’s home to many classic problems from the Chinese IOI scene. |
| ★★☆ | Aizu Online Judge | Aizu online judge is a contest platform and problem archive hosted by The University of Aizu. It has a lot of great problems from programming competitions in Japan. |
| ★★☆ | UVa | An old-school problem archive / online judge with rich history. Thousands of problems, including many classic ones, are featured here. However, it is strongly advised that you practice with uHunt following its “Competitive Programming Exercise” section. |
| ★★☆ | HackerRank | HackerRank is a company that focuses on competitive programming challenges for both consumers and businesses. HackerRank’s programming challenges can be solved in a variety of programming languages and span multiple computer science domains. |
| ★★☆ | POJ | POJ is an online judge with many great problems maintained by Peking University. Most Chinese competitive programmers began their journey here. The platform is really dated so mysterious compilation and run-time issues may occur. |
| ★★☆ | Project Euler | Project Euler features a stunning set of good math problems. It also hosts a forum where people can discuss. |
| ★☆☆ | Hackerearth | HackerEarth is a startup technology company based in Bangalore, India that provides recruitment solutions. |
| ★☆☆ | Caribbean Online Judge | COJ is hosted by University of Informatics Sciences (UCI, by its acronym in Spanish), located in Cuba. Feature ACM ICPC and Progressive contest styles, mostly from Caribbean and Latin American problem setters, also has problem classifier and contest calendar. |
| ★★☆ | CS Academy | New in the competitive programming scene, CS Academy is a growing online judge that hosts competitions once every two weeks. It supports live chat, interactive lessons and an integrated online editor (that actually works). |
| ★★☆ | Russian Code Cup | Programming competitions powered by Mail.Ru Group. Competition consists of 3 qualification, 1 elimination and 1 final rounds. For each round contestants are given 4-8 problems which must be solved in a fixed amount of time. |
| ★★☆ | CodeFights | CodeFights is a website for competitive programming practice and interview preparation. It features daily challenges of varying difficulty, an archive of problems and regular (every 15 minutes) mini-tournaments. Good for beginners. |
Sites classifying programming problems.
Choose a category (eg. DP) of interest and practice problems on that topic.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | A2 Online Judge | Mixed |
| ★★★ | Problem Classifier | SPOJ |
| ★★☆ | UVa Online Judge | CP Book |
| ★☆☆ | Codeforces Tags | CF (DP) |
| ★★☆ | HackerRank | HackerRank |
| ★★☆ | Juniors Training Sheet, by Mostafa Saad Ibrahim | ~800 ordered problems for newcomers to be good up to Div2-D |
| ★★☆ | Lucky 貓的 UVA（ACM）園地 (Chinese) | UVa |
| ★★☆ | Topcoder problem archive | List of problems with categories and complexity levels |
Calendars for impending programming contests.
(Never miss another contest!)
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Programming Contest Calendar - HackerRank | Google Calendar export available |
| ★★☆ | clist.by | API available for use |
| ★★☆ | Coding Calendar (Android App) | |
| ★★☆ | Coder’s Calendar: Android App, Chrome Extension, Firefox Add-on | |
| ★★★ | CodeHorizon: iOS App, Android App |
These are great sites to ask questions.
Paste your codes at ideone, pastebin or other sites to avoid formatting issues.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Codeforces | For quick answers, Codeforces is definitely the go-to place to ask about anything competition-related. |
| ★★★ | Competitive Programming - Quora | You would typically get more elaborate answers on Quora, but you might not have your questions answered straightaway. |
| ★★☆ | Theoretical Computer Science Stack Exchange | This place is generally for the academics, so don’t ask questions about contest problems here. |
Online Trainings and Camps.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Online Free Problem-Solving Coaching, by Mostafa Saad Ibrahim | See the coaching details and people comments on its nature/quality. |
Algorithm & Data structure implementations.
| ☆ | Name | Description |
|---|---|---|
| ★★★ | CodeLibrary, by Andrey Naumenko (indy256) | CodeLibrary contains a large collection of implementations for algorithms and data structures in Java and C++. You may also visit his GitHub Repository. |
| ★★★ | spaghetti-source/algorithm, by Takanori MAEHARA (@tmaehara) | High-quality implementations of many hard algorithms and data structures. |
| ★★★ | kth-competitive-programming/kactl, by Simon Lindholm (simonlindholm) et al. | A phenomenally organized, documented and tested team notebook from KTH Royal Institute of Technology. One of the most well-crafted team notebooks (contest libraries) I’ve ever seen. |
| ★★☆ | jaehyunp/stanfordacm | Stanford’s team notebook is well maintained and the codes within are of high-quality. |
| ★★☆ | ngthanhtrung23/ACM_Notebook_new, by team RR Watameda (I_love_Hoang_Yen, flashmt, nguyenhungtam) from National University of Singapore | RR Watameda represented National University of Singapore for the 2016 ACM-ICPC World Finals. The items in this notebook are pretty standard and well-organized. |
| ★★☆ | bobogei81123/bcw_codebook, by team bcw0x1bd2 (darkhh, bobogei81123, step5) from National Taiwan University | bcw0x1bd2 represented National Taiwan University for the 2016 ACM-ICPC World Finals. This notebook contains robust implementations for advanced data structures and algorithms. |
| ★☆☆ | foreverbell/acm-icpc-cheat-sheet, by foreverbell (foreverbell) | A notebook with some advanced data structures and algorithms including some from the China informatics scene. |
| ★☆☆ | igor’s code archive, by Igor Naverniouk (Abednego) | A good notebook by Igor Naverniouk who is currently a software engineer at Google and part of the Google Code Jam team. |
Languages and other miscellaneous knowledge.
| ☆ | Name | Description |
|---|---|---|
| ★★☆ | Power up C++ with the Standard Template Library - Topcoder: Part 1, Part 2 | An introductory tutorial on basic C++ STLs. |
| ★★☆ | Yet again on C++ input/output - Codeforces | Learn more about C++ I/O optimizations. |
| ★★☆ | C++ Tricks - Codeforces … What are some cool C++ tricks to use in a programming contest? - Quora | Plentiful C++ tricks for competitive programming. Note that some should be used with care. |
| ★★★ | C++ STL: Policy based data structures - Codeforces: Part 1, Part 2 | Detailed introduction to the extra data structures implemented in GNU C++. The official documentation can be found here. |
| ★☆☆ | C++11 FAQ (English, Chinese, Russian, Japanese, Korean) | A list of FAQs regarding C++11 collected and written by Bjarne Stroustrup, the creator of C++. |
| ☆ | Name | Description |
|---|---|---|
| ★★☆ | How to read input in Java — tutorial - Codeforces | Learn how to read input faster. This is a must-read for those who intend to use Java for competitive programming |
| ★★☆ | How to sort arrays in Java and avoid TLE - Codeforces | Some tips on how to avoid hitting the worst case of quick sort |
| ★★☆ | BigNum arithmetic in Java — Let’s outperform BigInteger! - Codeforces | A basic but faster custom BigInteger class |
| ★★☆ | EZ Collections, EZ Life (new Java library for contests) - Codeforces | A Java library for contests written by Alexey Dergunov (dalex). ArrayList, ArrayDeque, Heap, Sort, HashSet, HashMap, TreeSet, TreeMap, TreeList and pair classes are implemented |
| ☆ | Name | Description |
|---|---|---|
| ★★★ | Bit Twiddling Hacks | A huge compiled list of bit manipulation tricks. |
| ★★★ | Comparing Floating Point Numbers, 2012 Edition - Random ASCII | Everything you need to know about floating point numbers. A must read especially for geometry topics. |
| ★★☆ | Object-Oriented C Style Languages: C++, Objective-C, Java, C# - a side-by-side reference sheet | A detailed side-by-side reference sheet for common syntaxes. |
Awesome tools that will make your life easier.
| ☆ | Name | Platform | Description |
|---|---|---|---|
| ★★★ | Vim | CLI / Cross-Platform | Vim is one of the most popular text editors among advanced programmers. It allows text-editing to be done very efficiently with solely keystrokes. Vim is also highly configurable, extensible and integrates with shells (command lines) really well. The only setback about Vim is that it has a high learning curve for beginners. |
| ★★★ | Emacs | CLI / Cross-Platform | Emacs is another popular text editor (or development environment to be more precise). The debate on “Vim vs. Emacs” is constantly brought up due to their popularity. Basically Emacs is more than just a text editor. It has plugins like file managers, web browsers, mail clients and news clients that allows users to performs these tasks directly inside Emacs. Emacs is “heavier” because of this, but it arguably has a relatively easier learning curve for beginners. |
| ★★★ | Far Manager | Hybrid / Windows | Far Manager is the most widely-used editor in the RU/CIS competitive programming community. It’s actually a file manager in its bare bones, but you can install FarColorer - a syntax highlighter plugin to program on it. Properly configured, Far Manager allows you to navigate between files very efficiently while writing your codes. |
| ★★★ | Code::Blocks | GUI / Cross-Platform | Code::Blocks is the go-to IDE for C/C++. It’s a full-fledged, versatile IDE with numerous great features. Code::Blocks is usually provided along with Vim in programming contests. |
| ★★★ | IntelliJ IDEA | GUI / Cross-Platform | IntelliJ IDEA is certainly one of the best IDEs for Java. It’s used by most competitive programmers who use Java as their main language. Be sure to check out CHelper, a very handy plugin written for programming contests. |
| ★★☆ | Sublime Text | GUI / Cross-Platform | Sublime Text is an extraordinary text editor. Packed with powerful and innovative features like Multiple Carets, Minimaps and Command Palletes, it attracts a strong and engaging community. Sublime Text is highly extensible, so be sure to have Package Control installed and explore perhaps one of the largest catalogue of plugins! |
| ★★☆ | Eclipse | GUI / Cross-Platform | Eclipse is another good IDE for Java. It’s an okay alternative to Intellij IDEA (A tad inferior to IDEA by today’s standards). Sometimes contests only provide Eclipse for some reason, so this might be a good incentive to try and use Eclipse. |
| ★★☆ | CLion | GUI / Cross-Platform | CLion, produced by JetBrains - the same company who made Intellij IDEA, is a powerful IDE for C++. Free educational licenses are available OR you can try out their EAP (Early Access Program) which is still free as of Apr, 2018. You may want to turn off its code inspection feature as it will cause quite a bit of lag. |
| ★☆☆ | Other IDEs | Mixed | Visual Studio is the IDE to use in case you want to code in C#. … Both Atom and Visual Studio Code are built with Electron (written in JavaScript) and therefore somewhat resource-hogging. … CodeLite is a newly rising IDE. Beware that the load-up and project-creation times can be extraordinary. |
| ☆ | Name | Description |
|---|---|---|
| ★★★ | VisuAlgo | A website featuring a large collection of visualization tools for algorithms and data structures. |
| ★★★ | General Practice Helpers: … CHelper (IntelliJ IDEA) (manual) … caide (Visual Studio, CodeLite, standalone command line app) … JHelper (AppCode, CLion) online-judge-tools (Stand alone CLI tool, It is actively maintained.) | Great tools that parse contests, inline library codes and provide testing frameworks.  Codeforces Parser … GoCF … cfparser (emacs) cfparser (cli) | These tools parse Codeforces contest problems and help run sample tests. |
| ★★★ | The On-Line Encyclopedia of Integer Sequences (OEIS) | A stunning encyclopedia with a database of countless integer sequences. It also features a powerful search engine. Sometimes a seemingly difficult combinatorics problem could be equivalent to a simple or studied integer sequence. |
| ★★☆ | Syntax Highlighters: … tohtml.com … markup.su … hilite.me | Very handy for creating slides or team notebooks with pretty, formatted code snippets. Just copy the highlighted code snippets and paste them in your favorite WYSIWYG (What-You-See-Is-What-You-Get) editor! |
| ★★☆ | Code Sharing: … Ideone.com … Pastebin.com … Ubuntu Pastebin | These tools generate semi-permanent pages for code sharing. Very useful especially when you’re trying to get someone else to look into your code. |
| ★★☆ | Ineffable | A simple command-line grader for local grading. |
| ★★☆ | uDebug | A platform that provides expected outputs for user-specified inputs to problems on the UVa Online Judge. Some problems also provide additional test cases for debugging. |
| ☆ | Name | Description |
|---|---|---|
| ★★★ | polygon | polygon provides a platform and a rich set of tools for professional contest preparation. … An example: Validators with testlib.h - Codeforces |
| ★★☆ | Graph Editor | A fantastic tool to create and visualize graphs. |
| ★★☆ | tcframe | A C++ framework for generating test cases of competitive programming problems. |
| ★★★ | Virtual Judge (vjudge) | Virtual Judge (vjudge) allows users to create virtual contests with problems from notable problem archives. |
| ★★☆ | BNU Online Judge | BNU Online Judge also allows users to create virtual contests. |
| ★★☆ | Kattis | Kattis assists in contest preparation (E-mail them for assistance). |
Meet the god-like competitive programmers!
Learn helpful tips, tutorials and insights from these people :)
| Name (Handle) | Blog Name |
|---|---|
| Codeforces blogs | |
| Petr Mitrichev (Petr) | Algorithms Weekly |
| Makoto Soejima (rng_58) | rng_58’s blog |
| Bruce Merry (bmerry) | Entropy always increases |
| Przemysław Dębiak (Psyho) | Psyho’s blog |
| Anudeep Nekkanti (anudeep2011) | Namespace Anudeep ;) |
| vexorian (vexorian) | vexorian’s blog |
| Ashar Fuadi (fushar) | Fushar’s blog |
| LiJie Chen (WJMZBMR) | WJMZBMR (Chinese) |
| Huang I-Wen (dreamoon) | 小月的耍廢日誌 (Chinese) |
| Shiang-Yun Yang (morris1028) | Morris’ Blog (Chinese) |
| Yuhao Du (TooDifficuIt, TooSimple, xudyh) | xudyh (Chinese) |
| Name (Handle) | Link |
|---|---|
| Petr Mitrichev (Petr) | Youtube |
| Gate Lectures by Ravindrababu Ravula | Youtube |
| Mostafa Saad Ibrahim (mostafa.saad.fci) | Competitive Programming Youtube (Arabic Speech-English Text) |
| Tushar Roy | Youtube, with many tutorial videos. |
| GeeksforGeeks | Youtube |
| Algorithms Live! | Youtube |
| CodeChef | Youtube |
| HackerRank | Youtube |
| IDeserve | Youtube |
| code_report | Youtube, with contest updates and problem tutorials of HackerRank, LeetCode, Topcoder and Codeforces. |
| “Sothe” the Algorithm Wolf | Youtube |
| Egor Kulikov (Egor) | Youtube |
| Adam Bardashevich (subscriber) | Youtube |
| Bohdan Pryshchenko (I_love_Tanya_Romanova) | Twitch, Youtube |
| Vladimir Smykalov (enot.1.10) | Twitch, Youtube |
| Aleksandar Abas (Alex7) | Youtube |
| Mikhail Tikhomirov (Endagorion) | Youtube |
| Kamil Debowski (Errichto) | Youtube |
| David Harmeyer (SecondThread) | Youtube |
| mycodeschool | Youtube |
| William Lin (tmwilliamlin168) | Youtube |
Visit Competitive Programming - Quora (Top 10 Most Viewed Writers).
| Important Community Figures | Description |
|---|---|
| Bill Poucher | Executive Director of ACM-ICPC. CS Professor at Baylor University. |
| Michal Forišek (misof) | Organizer of IPSC and IOI. CS Teacher at Comenius University in Slovakia. Algorithm and CS Education Researcher. Former highly-rated competitive programmer. |
| Ahmed Aly (ahmed_aly) | Founder of A2OJ. HackerRank Lead Software Engineer. Former member of the Google Code Jam team. |
Informative and helpful articles
| Subject |
|---|
| Overview of Programming Contests, by Przemysław Dębiak (Psyho) |
| The ‘science’ of training in competitive programming - Codeforces, by Thanh Trung Nguyen (I_love_Hoang_Yen) |
| If you ask me how to improve your algorithm competition skill, I will give you the link of this blog. - Codeforces, by Huang I-Wen (dreamoon) |
| How to prepare for ACM - ICPC? - GeeksforGeeks, by Vishwesh Shrimali |
| Complete reference to competitive programming - HackerEarth, by Ravi Ojha |
| Getting started with the sport of competitive programming - HackerEarth, by Triveni Mahatha |
Fine answers to frequently-asked questions
Relevant awesome lists
| Name | Link |
|---|---|
| C++ Books | The Definitive C++ Book Guide and List - Stack Overflow |
| Java Books | What are the best books to learn Java? - Quora |
| Advanced Java Books | What is the best book for advanced Java programming? - Quora |
| Algorithms | tayllan/awesome-algorithms |
| Algorithm Visualization | enjalot/algovis |
| Math | rossant/awesome-math |
| C++ | fffaraz/awesome-cpp |
| Java | akullpp/awesome-java |
| Courses | prakhar1989/awesome-courses |
| Free Programming Books | vhf/free-programming-books |
| Community-curated C++ Resources | Hackr.io |
| Name | Description |
|---|---|
| CareerCup | The most popular website for software engineering interview preparation. |
| InterviewBit | Features intriguing and refreshing game-play designs which are designed to invoke one’s interest in practicing. |
| Awesome Interviews | A curated list of awesome interview questions |
| LeetCode | Well-organized website for software engineering interview preparation with best explanined solutions. |


This repository is being developed to advance the state of the art of drone performance predictions under a wide range of weather and battery conditions with mission planning in mind. An interactive GUI is available at http://droneecon.com. This README will explain general usage as well as the underlying theory for the models used, as currently implemented. Note that Drone-AWE is a work in progress (see Future Work). This document will explain general usage for the latter, as well as the engineering theory at work behind the scenes.
Drone-AWE may be used in two ways: using the GUI available at http://droneecon.com, or by using the source code directly. To use the source code directly, install using
pip install drone_awe
Base functionality is achieved by running the following:
import drone_awe
m = drone_awe.model(args)
m.simulate()
where args
is a dictionary containing simulation parameters. Note that for every parameter not specified in args
, a default value is used. It is possible to run the default simulation by passing an empty dictionary into the drone_awe.model()
method:
import drone_awe
m = drone_awe.model({})
m.simulate()
Settable dictionary keys with example values for args
include the following:
{
"validation":False,
"validationcase":"DiFranco2016",
"dronename":"dji-Mavic2",
"batterytechnology":"near-future",
"stateofhealth":90.0,
"startstateofcharge":100.0,
"rain":False,
"dropsize":1.0,
"liquidwatercontent":1.0,
"temperature":15.0,
"wind":False,
"windspeed":10.0,
"winddirection":0.0,
"relativehumidity":0.0,
"mission": {
"missionspeed": 10.0,
"altitude":100.0,
"heading":0.0,
"payload:0.0
},
"timestep":1,
"plot":True,
"xlabel":"missionspeed",
"ylabel":"power",
"title":"First_test",
"simulationtype":"simple",
"model":"abdilla",
"xvals":[0,1,2,3,4,5],
"weathereffect":"temperature",
"weathervals":[10,20,30,40]
}
These are explained further in Settings. After a drone_awe.model
object is instantiated, settings can be changed by modifying the input
class variable as:
m.input['xlabel'] = 'payload'
m.input['validationcase'] = 'Stolaroff2018'
The simulation must then be re-run using:
m.simulate()
An optional boolean may be set to produce a plot on runtime by running:
m = drone_awe.model({},plot=True)
when a drone_awe.model
is instantiated. Alternatively, the drone_awe.model
's plot
variable may be set at any time:
m.plot = True
The following subsections explain the use of various settings of a drone_awe.model
object.
'dronename'
'dronename'
must be set to a string that is defined in the drone database. To access a dictionary containing all supported drones, use the following methods:
droneDictionary = drone_awe.drones
If a drone or validation case does not exist in the drone database, it may still be used by setting a custom dictionary:
m.drone = droneDictionary
where droneDictionary
is a dictionary with the same keys as the following:
{
'id': 'dji-Mavic2',
'wingtype': 'rotary',
'diagonal': 0.354,
'takeoffweight': 0.907,
'speedmax': 20,
'altitudemax': 6000,
'endurancemax': 31,
'endurancemaxspeed': 6.944,
'endurancemaxhover': 29,
'rangemax': 18000,
'rangemaxspeed': 13.889,
'temperaturemin': -10,
'chargerpowerrating': 60,
'batterytype': 'LiPo',
'batterycapacity': 3850,
'batteryvoltage': 15.4,
'batterycells': 4,
'batteryenergy': 59.29,
'batterymass': 0.297,
'waterproof': 'no',
'windspeedmax': 10.8,
'batteryrechargetime': 90,
'rotorquantity': 4,
'rotordiameter': 0.2,
'cruisespeed': 6.94,
'payload': 0.0,
'length': 0.322,
'width': 0.242,
'height': 0.084
}
Note that not all parameters need be specified, but if a simulation is run that requires unspecified parameters, the model will not run.
'validation'
and 'validationcase'
To view validation cases for drone_awe
models, set 'validation'=True
and 'validationcase'
to a string contained in the validation case database. To access a dictionary containing all supported validation cases, run the following:
validationDictionary = drone_awe.validationdata()
Additionally, validationCaseDictionary
is a dictionary with the following format:
{
'id': 'Stolaroff2018',
'xvalid': [1.358974359,1.7179487179,1.6923076923,1.7692307692,1.7692307692,1.8205128205,1.8717948718,1.8974358974,1.9230769231,1.9743589744,2.0512820513,2.1025641026,2.1025641026,2.1794871795,2.2820512821,2.3076923077,2.3333333333,2.4358974359,2.5384615385,2.5384615385,2.6666666667,2.7948717949,2.9487179487,3.1025641026,3.2564102564,3.358974359,3.4615384615,3.641025641,3.7435897436,3.8717948718,4.0512820513,4.2564102564,4.358974359,4.641025641,4.8974358974,5.8461538462,6,6.2820512821,6.5384615385,7.1538461538,7.4871794872,7.8205128205,8.4871794872,9.1794871795,9.7692307692,10.2564102564,10.6923076923,11.1282051282,11.5897435897],
'yvalid': [133.7510729614,149.2375075128,142.6477385276,144.5897859156,140.9450186657,141.7583868756,142.3874173587,140.4340604922,139.3656195241,139.5335348046,140.2321151941,139.9589946754,136.1689649626,138.3618186589,141.3711557508,139.4001574523,136.7492021569,136.5131929807,137.712167001,133.136399421,135.7755034665,136.58240428,141.8694500174,143.7278953027,145.8751386173,144.4503136349,143.5492800366,144.4966689523,140.8944307591,139.7885398414,140.0842115956,140.6905892611,140.7593265104,140.4412051028,148.3297356325,161.0751453894,160.7738527567,158.8079335653,157.0439596719,161.2248774665,165.1381601781,164.7032531681,177.1408013138,175.6982333173,190.095233258,197.4485952036,209.0736216573,203.7684942987,215.7551870381],
'drone': {
'validationcase':'Stolaroff2018',
'wingtype': 'rotary',
'rotorquantity': 4,
'takeoffweight': 1.3,
'batterytype': 'LiPo',
'batteryvoltage': 11.1,
'batterymass': 0.262,
'props': '10x4.7',
'endurancemaxhover': 16,
'payloadmax': 0.4,
'batterycapacity': 5500,
'payload': 0.0,
'rotordiameter': 0.254,
'batterycells': 3,
'length': 0.280,
'width': 0.140,
'height': 0.100,
'waterproof': 'no'
},
'settings': {
'dronename': 'drone',
'stateofhealth': 100.0,
'startstateofcharge': 100.0,
'altitude': 100.0,
'temperaturesealevel': 15.0,
'rain': False,
'dropsize': 0.0,
'liquidwatercontent': 1.0,
'temperature': 15.0,
'wind': False,
'windspeed': 0.0,
'winddirection': 0.0,
'relativehumidity': 85.0,
'icing': False,
"mission": {
"missionspeed": 10.0
},
'timestep': 1,
'xlabel': 'missionspeed',
'ylabel': 'alpha',
'title': 'Stolaroff',
'simulationtype': 'simple',
'model': 'abdilla',
'xvals': [0.0,1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0,15.0],
'validation': False,
'validationcase': 'Stolaroff2018',
'batterytechnology': 'current'
}
}
'L/D'
and 'propulsiveefficiency'
When simulating a fixed-wing drone, the current model requires input parameters for the lift-to-drag ratio ('L/D'
) and the efficiency of the propulsive system ('propulsiveefficiency'
). Ballpark estimates for small UAVs are on the order of 10 and 30%, respectively, although these values heavily depend on the specific geometries and propulsive systems of the drones.
'batterytechnology'
'batterytechnology'
must be set to one of the following options: 'current'
, 'near-future'
, or 'far-future'
. 'current'
will use the current battery capacity as specified in drone.params
. 'near-future'
projects a future capacity in five years based on an increase of 3.5% of battery capacity each year. 'far-future'
projects battery capacity for lithium-air batteries, about ten times the capacity of current LiPo batteries.
'stateofhealth'
and 'stateofcharge'
'stateofhealth'
refers to the amount of capacity contained within the battery relative to its initial capacity at first use. 100% would be a new battery. LiPo batteries (most commonly used battery for drones) are typically retired when their state of health falls to 80-85%. At lower states of health, the battery capacity is decreased and cycles through a full charge more quickly.
'stateofcharge'
refers to the current capacity level of the battery, where 100% is fully charged (regardless of how much the battery has been used before), and 0% is a dead battery.
'dropsize'
, 'liquidwatercontent'
and 'rainfallrate'
These parameters specifiy rain characteristics. If there is no rain in the simulation, set these to 0.0.
'dropsize'
refers to the diameter of a raindrop (assuming a spherical shape), with units of meters. 'liquidwatercontent'
refers to the amount of water in a given volume of air, with units of kg/m^3. 'rainfallrate'
is the rate of rainfall in units of mm/hr, which translates to litres per cubic meter per hour.
Only one of 'liquidatercontent'
and 'rainfallrate'
needs to be specified.
'temperature'
Units of temperature are given in degrees Celcius.
'relativehumidity'
'relativehumidity'
refers to water content in the air, ranging from 0% to 100%.
'mission'
is a dictionary with the following keys:
'missionspeed'
— the cruise velocity of the drone, with units of m/s.
'altitude'
— in units of meters.
'heading'
— the heading angle of the drone, in units of ___________.
'payload'
— the mass of any exra payload attached to the drone (e.g., camera), in units of kg.
'xlabel'
and 'ylabel'
not only specify axis labels of the plot, but also tell the simulation what to solve for ('ylabel'
) and what parameter to loop through ('xlabel'
). 'ylabel'
can be range
, endurance
, or power
. 'xlabel'
can be any variable from the following list:
"startstateofcharge",
"altitude",
"temperature",
"dropsize",
"liquidwatercontent",
"newtemperature",
"windspeed",
"winddirection",
"relativehumidity",
"payload",
"missionspeed"
'xvals'
is a list containing all the values of x the simulation will loop through and produce a single data point for.
'zlabel'
can be specified to any of the variables used for the 'xlabel'
parameter (see list above) to loop through. This will produce a curve for each of the values in 'zvals'
and plot them on the same figure. This is useful for looping through a weather effect, such as temperature or relative humidity, to see their effects on a plot of range vs payload.
'title'
is the title displayed on the top of the plot, followed by the current date. Currently, the title needs to be one word. A title of multiple words can have each word separated by an underscore en lieu of a space.
Drone AWE
is intended to predict performance parameters of rotary and fixed-wing drones based on readily-available specifications. To accomplish this, the power requirements for a given flight maneuver is calculated and used to predict battery drain behavior. Then, parameters such as range and endurance can be calculated. Comprehensive state data is collected at each step of a simulation, providing a versatile data set as output for study.
For rotary drones, power consumption is predicted in two steps. First, model parameters are calibrated based on known specifications, like maximum hover time and rotor diameter. Then, momentum theory is used to predict the power consumption.
According to rotor momentum theory, five equations govern the flight of a rotorcraft:
This section contains a detailed description of each class, all contained in Classes.py.
the Drone
class
class variables contain:
data sheet specifications of specific drone models (e.g., the Mavic 2 Pro), including
methods calculate certain characteristics based on available information
the Battery
class
class variables describe:
properties of specific batteries used to model their discharge characteristics, including
Real-time discharge characteristics for simulation, including
methods are used to update class variables using information from the params/
directory
the Power
class
class variables describe
methods are used to
PowerCorrection
objects to Power
objects using the addCorrection
methodaddCorrection
attempts to append a time-variant PowerCorrection
object to a time-invariant Power
objectPowerCorrection
method
the Weather
class
class variables describe
the __updateRain
method
the __getWebernumber
method
the __getSurfaceTension
method
empirically interpolates surfaces tension based on current temperature
the Temperature
class
class variables describe
the Humidity
class
class variables describe
the Wind
class
class variables describe
the Gust
class
class variables describe
the Ice
class
the Mission
class
class variables describe
the Simulation
class
NOTE: the model is based on power consumption to accomodate future development. The Power
class is designed to receive an indefinite number of modifications based on weather effects
the Plotter
class
settings.txt
file. Methods can plot a line or scatter plots. The validation method plots results on top of specified validation data.Properties and their respective units are converted within the simulation to SI units, and then converted back. Those units are:
Velocity/Speed: meters per second [m/s]
Power: watts [W]
Endurance or Flight time: minutes [min]
Altitude: meters [m]
mass: kilograms [kg]
Temperature: degrees Celcius [°C]
Wind Resistance: meters per second [m/s]
*refers to the maximum wind speed the drone can resist
Battery re-charge time: minutes [min]
The settings list file contains all the necessary simulation parameters the code will look through before running simulations. These include:
validation (True/False)
validationcase
drone (True/False)
dronename
battery state of health
battery beginning state of charge
altitude
sea level temperature
rain (True/False)
Temperature
Humidity
Wind
Icing
Timestep
plot (True/False)
simulation type
range of vx-values
xbegin
xend
xnumber
NOTE: For the plotting x- and y-labels, choose from the following parameters to plot:
There are .param
files in the Drone directory each contain parameters specific to each drone. They are labled with the company's name or abbreviation in lowercase letters followed by a dash (-) and then the name of the drone (e.g., dji-Mavic2). New drones needing to be tested can follow similar formats, with a space (" "
) delimiter.
Similar to the Drone .param
files, battery .param
files exist for each type of battery tested. These parameters assist in determining the discharge rate over time and amount of specific energy and power available for different types of batteries.
getparams
reads in a .txt or .csv file and outputs a dictionary with keys from a specified list and values from the specified parameter file.getXandY()
reads in data from a validation case and saves the contents to lists for x and y. This function assumes the first row contains labels and ignores them.interpolate()
does a simple linear interpolation with inputs of 2 x-values, 2 y-values, and the x-value of the parameter you are seeking.This section is to be used to record ideas for future development that cannot be immediately implemented due to time constraints.


Within the /system/expressionengine/third_party/ directory, copy the friends folder into your sites ./system/expressionengine/third_party/ directory.
Within the /themes/third_party/ directory, copy the friends folder into your sites ./themes/third_party/ directory.
Go to the Modules area in the ExpressionEngine control panel, find Friends in the list, and click Install.
Setup and configuring:
If you wish to install the demo templates, click on the Demo Templates tab inside the Control Panel area.
Updating
Within your sites ./system/expressionengine/third_party/ directory, delete the friends folder and upload the new one from the /system/expressionengine/third_party/ directory in your download package.
Within your sites ./themes/third_party/ directory, delete the friends folder and upload the new one from the /themes/third_party/ directory in your download package.
Go to the Modules area in the ExpressionEngine control panel and click the Run Module Updates button.


tolerance heat salinity selection stress lines genetic effects increased response Tigriopus physiological {border-style high selected stressors multiple px;} responses #ffffff;} evolutionary trade‐offs californicus adaptation ambient generations low salinity, test using generation hypo‐osmotic mortality temperatures variation female tested thermal change copepod effect expression hybrid hyperosmotic observed ppt temperature treatment evolution gene < Biology Ecology Evolution differences greater held line mate‐guarding population populations produced traits Kelly individual lines, pairs ppt), px; rate replicate results stress, synergistic tolerance, transcripts {font-family ANOVA Burton However, control correlations energetic established evidence fecundity females font-size important tolerance. transcriptome treatments two‐way unselected .). Figure RNA University climate controls copepods demands double; driven environmental generations, imposed intertidal laboratory larvae libraries loss low‐salinity measured new occur ppt) reads salinities salinity. selection, stressors, treatments, Biological border-color border-width change. combination competing conditions constraints correlated costs ecological fitness generation, genetically heat‐selected heat‐shock high‐salinity individuals kit lethal logistic lower maintained maintenance negative pools possible protein revealed selection. shock simultaneous solid; stressors. transcriptomic work {font-style {font-weight > (Fig. (Kelly Core Evolutionary Experimental Kelly, ability adaptive ambient‐salinity bold brood broods, changes cost courier; co‐occurring created crosses cultures day differentially divergent em; energy estimated experience exposure false generation. global heat, increase limits low‐ marine model native number overlap produce provided pt;} responses. saw sequencing simultaneously stressor studies survival testing tolerating trade‐off ~.°C


--- layout: post esbma_id: 1798 title: SQL Source Control date: 2011-07-06 14:26:09 ---
If I weren't such a lousy student maybe I would get a masters degree in business. My graduate thesis would be entitled, "The 21 Questions that People Ask at Trade Shows". You see, I have noticed that all the visitors to our booths at TechEd and PDC and DevConnections always ask the same questions.
After going to enough trade shows, we've basically heard them all. Nobody ever asks anything new.
Except for that time some guy with a Unix beard wanted to know if we were hiring and do we do criminal background checks and how many felony convictions are considered acceptable for a new hire. That was ... different.
Anyway, one of the questions we hear at every show is:
Can I use Vault to version control my SQL stuff?
To which we reply:
Well, no. You see, we could do this feature, but it would require us to build a whole bunch of SQL-specific tooling and that would put us in competition with Red Gate and we don't want to be there because Red Gate is a great company and Neil Davidson and Simon Galbraith are great guys so it would just be easier if you went over to the Red Gate booth and asked them to do this and let them know that we'll be available to help and by the way would you care for one of our free T-shirts?
I am quite pleased to say that, thanks to Red Gate's efforts, we won't have to give this answer anymore. Earlier this year, they shipped SQL Source Control 2.1 which includes integration support for Vault (and apparently every other prevalent version control tool on the planet).
It is miserable in the extreme for a developer to be working without good support for version control. If you're doing SQL development, this is the product you want to use. My compliments to our friends at Red Gate for meeting this need.


no references
quplaStmt ::= importStmt | typeStmt | lutStmt | funcStmt | evalStmt | testStmt | templateStmt | useStmt
referenced by:
importStmt ::= 'import' moduleName
referenced by:
referenced by:
lutStmt ::= 'lut' lutName ( '{' ( tritList '=' tritList )+ '}' | entityAlias )
referenced by:
funcStmt ::= 'func' funcSignature funcBody
referenced by:
referenced by:
referenced by:
templateStmt ::= 'template' templateName '<' placeHolderTypeName ( ',' placeHolderTypeName )* '>' templateBody
referenced by:
templateBody ::= '{' typeStmt* funcStmt+ '}'
referenced by:
useStmt ::= 'use' templateName typeInstantiation ( ',' typeInstantiation )*
referenced by:
typeInstantiation ::= '<' typeName ( ',' typeName )* '>'
referenced by:
entityAlias ::= '=' entityName '@' moduleName
referenced by:
funcSignature ::= typeName funcName ( '<' typeName ( ',' typeName )* '>' )? '(' funcParam ( ',' funcParam )* ')'
referenced by:
referenced by:
funcBody ::= '{' envExpr stateExpr* assignExpr* returnExpr '}'
referenced by:
envExpr ::= joinExpr* affectExpr*
referenced by:
joinExpr ::= 'join' environmentName ( 'limit' number )?
referenced by:
affectExpr ::= 'affect' environmentName ( 'delay' number )?
referenced by:
referenced by:
assignExpr ::= varName '=' condExpr
referenced by:
returnExpr ::= 'return' condExpr
referenced by:
condExpr ::= mergeExpr ( '?' trueBranch ':' falseBranch )?
referenced by:
trueBranch ::= mergeExpr
referenced by:
falseBranch ::= 'null' | condExpr
referenced by:
mergeExpr ::= concatExpr ( '|' concatExpr )*
referenced by:
concatExpr ::= postfixExpr ( '&' postfixExpr )*
referenced by:
referenced by:
referenced by:
referenced by:
referenced by:
referenced by:
referenced by:
referenced by:
constTerm ::= constFactor ( [*/%] constFactor )*
referenced by:
constFactor ::= '-'* ( number | typeName | '(' constExpr ')' )
referenced by:
referenced by:
referenced by:
trit ::= [-01]
referenced by:
name ::= [a-zA-Z_] [0-9a-zA-Z_]*
no references
number ::= [0-9]+
referenced by:
referenced by:
referenced by:
|
|


Anyone with the following link may view your session. Note that changes made to this session are also visible to people accessing this session via link.


Excelerator: The HTML to Excel Converter
-
Pick the file to upload. It will automatically process your file and give you a download link above.
- Right click the Download link and use save link as to save it.
- Check for any weird anonamlies in the sheet and correct.
-
Warning! If you are using Internet Explorer, this may not work. If you are using Firefox, you may
need to remove the .part file extension. Will be fixed in future versions.
-
Allow any amount of columns, auto-detect how many and adapt for many kinds of tables
- Make More compatible with Mozilla Firefox
- Ability to change names for files dynamically and separately
- Far Future: allow many files to become one with multiple sheets


A quality of service (QoS) class allows you to categorize work to be performed by NSOperation, NSOperationQueue, NSThread objects, dispatch queues, and pthreads (POSIX threads). By assigning a QoS to work, you indicate its importance, and the system prioritizes it and schedules it accordingly. For example, the system performs work initiated by a user sooner than background work that can be deferred until a more optimal time. In some cases, system resources may be reallocated away from the lower priority work and given to the higher priority work.
Because higher priority work is performed more quickly and with more resources than lower priority work, it typically requires more energy than lower priority work. Accurately specifying appropriate QoS classes for the work your app performs ensures that your app is responsive as well as energy efficient.
The system uses QoS information to adjust priorities such as scheduling, CPU and I/O throughput, and timer latency. As a result, the work performed maintains a balance between performance and energy efficiency.
When you assign a QoS to a task, consider how it affects the user and how it affects other work.
Primary QoS classes (shown in order of priority)
|
User-interactive |
Work that is interacting with the user, such as operating on the main thread, refreshing the user interface, or performing animations. If the work doesn’t happen quickly, the user interface may appear frozen. Focuses on responsiveness and performance. Work is virtually instantaneous. Global queue: Main thread |
|
User-initiated |
Work that the user has initiated and requires immediate results, such as opening a saved document or performing an action when the user clicks something in the user interface. The work is required in order to continue user interaction. Focuses on responsiveness and performance. Work is nearly instantaneous, such as a few seconds or less. Global queue: High |
|
Utility |
Work that may take some time to complete and doesn’t require an immediate result, such as downloading or importing data. Utility tasks typically have a progress bar that is visible to the user. Focuses on providing a balance between responsiveness, performance, and energy efficiency. Work takes a few seconds to a few minutes. Global queue: Low |
|
Background |
Work that operates in the background and isn’t visible to the user, such as indexing, synchronizing, and backups. Focuses on energy efficiency. Work takes significant time, such as minutes or hours. Global queue: Background |
Special QoS classes
|
Default |
The priority level of this QoS falls between user-initiated and utility. This QoS is not intended to be used by developers to classify work. Work that has no QoS information assigned is treated as default, and the GCD global queue runs at this level. Work takes significant time, such as minutes or hours. Global queue: Default |
|
Unspecified |
This represents the absence of QoS information and cues the system that an environmental QoS should be inferred. Threads can have an unspecified QoS if they use legacy APIs that may opt the thread out of QoS. |
Notes
Optimally, run your app at a QoS level of utility or lower at least 90% of the time when user activity is not occurring.
On iPhones, discretionary and background operations, including networking, are paused when Low Power Mode is enabled. See React to Low Power Mode on iPhones.'


Roslyn Code Club
Home
(current)
About
Sign In
Workshops
Today
Youth Workshops
Workshops
Click on a workshop to get started.
2018-19 Workshops
2017-18 Workshops
HTML/JS/CSS
Workshop 1: Personal Website
Workshop 2: Navigation Bar
Workshop 3: Cringe
Workshop 4: Puzzle Me
Workshop 5: Canvas
Arduino
Workshop 1: Blink an LED
Workshop 2: Ready, Set, GO
Workshop 3: Flashlight


|
CarsEvolution
|
#include <World.h>
Public Member Functions | |
| World (const CarsPopulationData &population, SimulationData *simulation_data) | |
| World (const World &)=delete | |
| World & | operator= (const World &)=delete |
| World (World &&)=delete | |
| World & | operator= (World &&)=delete |
| ~World ()=default | |
| bool | runSimulation () |
| runSimulation More... | |
| std::vector< std::pair< double, double > > | getRoute () const |
| getRoute More... | |
| std::vector< double > | maxDistanceReached () const |
| maxDistanceReached More... | |
| population | - parameters of the cars |
| simulation_data | - calculated cars positions |
|
explicit |
|
delete |
|
delete |
|
default |
| std::vector< std::pair< double, double > > cer::physics::World::getRoute | ( | ) | const |
| std::vector< double > cer::physics::World::maxDistanceReached | ( | ) | const |
| bool cer::physics::World::runSimulation | ( | ) |


F.A.Q.
Q: Does the beer taste like the “aromas” advertised?
A: No! The aromas are more descriptions of how your clothes will smell as you enjoy our product. All of our BECK’S® & Renuzit® Snuggle® products come with the same great taste as the original BECK’S® beer brand. The only choice you need to make is how you want your clothes to smell. The only addition you’ll notice is cleaner, fresher, smelling clothes!
Q: Is it safe to drink?
A: The BECK’S® & Renuzit® Snuggle® beer has been approved by the Food and Drug Administration (FDA), Canadian Food Inspection Agency (CFIA), and the European Medicines Agency (EMA). It is 100% safe for consumption and we know you’ll love the fresh scents it brings!
Q: This sounds impossible, how does it work?
A: A good magician never reveals their tricks, and a good company never reveals their trade secrets. What we can tell you is that our technology has no effect on taste or nutritional contents. It facilitates the body's natural occurring mechanisms to administer the fresh smelling compounds to be absorbed into and released from the clothes you’re wearing.
Q: Where can I buy BECK’S® & Renuzit® Snuggle® beer?
A: We are aiming to have our products everywhere domestic beer is sold. If you haven’t refreshed yourself, refreshingly, yet; head to your local beer retailer and see what all the hype is about!


I'm Ravi (or Robins), an engineer and entreprenuer from Boston. I recently graduated from Boston University's College of Engineering where I earned a Bachelor of Science in Computer Engineering.
I'm a cofounder at Pitch where I did product, UI, and UX and helped drive it to become a 2013 Microsoft ImagineCup finalist. It's going to be released in the Windows Store soon.
Feel free to write to me or get in touch via any other method.
Boston, Massachusetts, USA
July 7
English (Proficent), Gujarati (Proficient), Hindi (Elementary)
This site's engine is Jekyll. The design is a custom implmentation of Skeleton with a bit of Bootstrap and is available on Github. Icons are from Fontawesome. Fonts from Google1. Some javascript is used for effects2 . The logo effect is done by Airport.
The site is hosted on Azure and analytics are done by Google.
1 If you're using Windows, you may see Segoe being used instead of Lato. I find Segoe really beautiful, espeically on high DPI displays.
2 Some parts of the site may be a bit buggy on some devices. I may have it already marked, but if you find something, it would be great if you could fill an issue on Github.


It is a style of formating a page. Usually GBD involves a key feature on the left with a heading and text below following to the right of this feature. This feature could be something that catches the eye, such as an image. GBD is when the layout uses grids with the format mentioned above. It is used to make it easy for the user
It is all about having pages that are incredibly easy to use. Usually responsive webpages are made as basic as possible, which therefore makes less of a job for the user to get around and achieve what they went on the website for. Beyond this it is about making the website consistent across different platforms like tablet, cellphone and pc/lap tops.
Structure of html coding that is directly rated to specific content, such as images, headings, footers etc. Semantic structure involved more visible elements compared to elements such as 'div' and span'.
Put simply it is a standardised way of formatting HTML.


Group jQuery Challenge 1
Used Car Tracker
Make
Model
Year
Color
Customer Rating
Price
You get a new car!!!!11 (Random)


7 years ago today I started @newrelic. At the time it was my big chance to write Ruby professionally. I couldn't have imagined the many awesome people I'd meet, the technical growth I'd experience, or the incredible opportunities (like taking my family to Spain) it'd afford me.
10/8/2019, 7:58:57 AM
Favs: 33
Retweets: 1
link


CodeRamp - A part time intro to HTML, CSS and JavaScript
20 May 2015
Over the last 2 weeks I've been auditing the pilot Hack Reactor "CodeRamp" course. It's a 4 week part time course. No prior programming experience is expected. The course is taught Monday-Thursday 6:30-9, and on Saturday from 1-4. Its the first time the Hack Reactor team has offered the course,...
Read Post
Free Code Camp - the ying and the yang
27 April 2015
Over the last 3 months I’ve been digging into online coding schools and curriculum’s. I’ve concentrated on teaching & learning web development, and studied how numerous coding schools and camps organize, aggregate, present and track learning and assessment material. Freecodecamp.org has a number of features that make it interesting and...
Read Post
Old Settlers 2015
20 April 2015
2015 Old Settlers has come and gone, and a great time was had by all. As usual, the "settle in" was awesome.
Read Post


More...
|
| | Builder (TPanelTitle component) |
| |
| virtual TBuilder | Glyph (int? glyph) |
| | A numeric unicode character code to use as the icon for the panel header. The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily. More...
|
| |
| virtual TBuilder | GlyphSpec (string glyphSpec) |
| | A numeric unicode character code to use as the icon for the panel header. The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily. Alternatively, this config option accepts a string with the charCode and font-family separated by the @ symbol. For example '65 Font Family'. More...
|
| |
| virtual TBuilder | Icon (Icon icon) |
| | The icon to use in the Title bar. See also, IconCls to set an icon with a custom Css class. More...
|
| |
| virtual TBuilder | IconCls (string iconCls) |
| | A CSS class that will provide a background image to be used as the panel header icon (defaults to ''). More...
|
| |
| virtual TBuilder | IconPath (string iconPath) |
| | A CSS class that will provide a background image to be used as the panel header icon (defaults to ''). More...
|
| |
| virtual TBuilder | IconAlign (IconAlign iconAlign) |
| |
| virtual TBuilder | Text (string text) |
| | The title's text (can contain html tags/entities) More...
|
| |
| virtual TBuilder | TextAlign (TitleAlign textAlign) |
| | May be "left", "right" or "center". The alignment of the title text within the available space between the icon and the tools.  The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily.
◆ GlyphSpec()
A numeric unicode character code to use as the icon for the panel header. The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily. Alternatively, this config option accepts a string with the charCode and font-family separated by the @ symbol. For example '65 Font Family'.
◆ Icon()
The icon to use in the Title bar. See also, IconCls to set an icon with a custom Css class.
◆ IconAlign()
◆ IconCls()
A CSS class that will provide a background image to be used as the panel header icon (defaults to '').
◆ IconPath()
A CSS class that will provide a background image to be used as the panel header icon (defaults to '').
◆ operator Builder()
◆ Text()
The title's text (can contain html tags/entities)
◆ TextAlign()
May be "left", "right" or "center". The alignment of the title text within the available space between the icon and the tools. Defaults to: "left"
The documentation for this class was generated from the following file:
- Factory/Builder/PanelTitleBuilder.cs


Jamar Brandon Dulaney was arrested Friday, three months after he and his alleged victim had initiated consensual sexual contact at his home in Montgomery, Alabama.
The girl, who has not been named to protect her identity, then changed her mind during the August 7 encounter, it is alleged.
That prompted Dulaney to tie her hands and legs together and have sex with her against her will, court papers say.
Further details of how the attack ended and how Dulaney’s victim escaped have not yet been made public.
It is unclear whether Dulaney’s alleged victim reported him to police at the time, or waited until just before his arrest last week.
Advertisement Advertisement
He was apprehended by police within hours of the warrant being issued.
The Montgomery Advertiser reported that Dulaney still being held at Montgomery County Detention Facility on Monday, in lieu of $25,000 bond.


When Stop with runs is selected, the listener stop repeating when all of the runs are stopped, regardless of the value of Run data fetch interval.
Selected: [[joinSelected(selectedRuns)]]


Featured Project
Fury of Dracula AIIn 2020, myself and 3 other UNSW students built an AI to play a digital version of the popular board game Fury of Dracula. Since movement in the game is very complex we had to create a custom pathfinding method which we based off Dijkstra's algorithm. In each simulated game, the AI would use this pathfinding method to gain movement data, and along with the other information it was allowed to have (based on the rules), it would make a "best possible move" on every turn. Our team ended up placing 2nd out of over 50 teams.
Project Management
Having participated in debating, sporting, and consulting competitions throughout much of my life, I have developed strong communication and leadership skills. Throughout University I have also developed great skill in facilitating meetings, delegating responsibilities and ensuring projects are completed on time.
Programming
I have experience with a variety of both high and low-level programming languages including: C, Python, Javascript, Perl, Java, and MIPS Assembly language. The areas I am most comfortable in are backend web application development and OS, however I do have some experience with frontend development and AI/ML.
Creativity
Being both a gigging musician and a rock climber outside of tech, I often see problems in a different way to those around me, allowing me to think outside of the box and create unique solutions.