Welcome
Username
Password
Login
New gamers?
Welcome to sign up and join the game!
Already signed up?
If you have signed up, please click sign in to continue./w/
Sign Up
Sign In
Hello
Username
Can contain Arabic numerals, upper and lower case letters, underline; Length not exceeding 150 characters.
Email
We will protect your privacy.
Password
contain at least one numeric digit and a special character(!@#$%^&*). Length not exceeding 150.
Invite Code
Sign up and login


Sorting visualizer
Made by -
SUBHANSHU MOHAN GUPTA
new array
no of bar
Speed
Merge sort
Quick sort
Insertion sort
Selection sort
Bubble sort


I'm an SF based freelance full-stack web developer and I would love to help you with your project. Currently, I work on building dynamic webapps using frameworks like Node and Angular. I can build any website, from huge dynamic apps to small static sites, on any budget. See my work below.
Using modern frameworks and development practices, I build responsive, fast, and clean webpages for any usage.
I develop numerous Python based applications, ranging from server-side tools, torrent clients, to small scripts for automating tasks.
I've worked on numerous Android based applications and mobile UI development projects, more recently implementing frameworks such as Ionic.
I build scalable applications using modern JS frameworks, and limit myself from just web-based JS development. From building Audio codec API's to small desktop applications, I've been working on pushing the limits of using JS
The Mogulot Suite is a lossless compression streaming API that I've been developing for months now. Currently, the Mogulot Suite consists of mogulotRadio, mogulotHome, and the mogulotAPI. This project uses Node.js at it's core for a fast and seamless API
torrentPi is a node-based application for the RaspberryPi 2, it's an easy to use web-based interface for streaming magnet links directly on your raspberryPi device.
Troper is a seamless web-socket based encrypted instant messaging service. There are no logs, no data stored, providing a completely secure web based solution for instant messaging. Troper was developed using Socket.io and Node.js
nodeSpot is a spotify desktop client built with the Node Webkit, nwjs. Runtime tests determine that nodeSpot has a faster profile than the existing spotify client available for both OSX and Windows. nodeSpot is a low resource intensive build and attributes its speed to ES6 and the V8 runtime
Python based program built to auto-archive your Spotify discover weekly playlist. dwManager is built using the spotipy API. Requires Spotify premium subscription to use.


URI uri
InetSocketAddress address
ResponseStatusCode responseStatusCode
private void readObject(ObjectInputStream inputStream) throws ClassNotFoundException, IOException
ClassNotFoundException
IOException
private void writeObject(ObjectOutputStream outputStream) throws IOException
IOException
Path path
ResponseMessage responseMessage
String testField
DetachedVertex outVertex
DetachedVertex inVertex
ReferencedVertex inVertex
ReferencedVertex outVertex
String key
Object value
boolean hidden
ReferencedElement element
String key
Object value
boolean hidden
ReferencedVertex vertex
Copyright © 2013–2014 TinkerPop. All rights reserved.


Toggle navigation
reely
Active
Bubbles-in-a-Can
Choose a canned bubbles demo below
Coworking
Gym
Bus Shelter


Part of the ETHGlobal community & the first event in Asia
August 10 - 12, 2018 | Bangalore
The leading minds in the cryptocurrency space are joining over 500 hackers from around the world to collaborate together on decentralized applications using Ethereum. With an exponential increase in adoption, developer interest, and other teams building on top of Ethereum, there has never been a better time to be a part of the community, building Web 3.0.
ETHIndia brings together the curious minds, industry experts and companies pushing the way forward in crypto space. Time to #BUIDL in Asia!
Interested in becoming a sponsor? Email us at
Everyone is welcome to apply, be it students, professionals or turing-test certified androids. If you are under 18 years of age, we’ll need a parental consent form.
We’re looking for people who "do"! Folks who are passionate enough to work on crazy world-changing ideas.  We’ll get to know more about your abilities from the past projects, GitHub profile, participation/awards in other hackathons.
Zero. Zip. Zilch. Nada. Nothing. Admission to ETHIndia is completely free, thanks to our sponsors! We'll provide you with a weekend's worth of schwag, meals, drinks, snacks and a place to crash when you need a break from coding.
Yes! This hackathon is strictly a team competition. We believe that you’re stronger as a team than you are apart. You can join or create a team once you've started an individual application.
You can form teams of up to 3 people. Most teams aim to have a mix of people with both design and developer skills.
Not to worry, most people don’t! We’ll have team formation and ideation events geared towards helping you find people to work with. You can join our Slack to find potential teammates.
A valid government issued photo ID, laptop, phone, chargers, any sleeping equipment you might want (we'll be providing mattresses) and a geeky t-shirt!
Weapons of any kind, drugs, or alcohol. If you’re not sure whether something will be okay, please ask ahead of time!
If you have specific hardware in mind, bring it with you. We will be doing our best to lend hardware at the event and enable you to work on your dream hack. We’ll put out a list closer to the event so you can see what’s available.
Yes! Once accepted, you will have to submit your travel reimbursement forms and receipts on the Dashboard. For each location
hackers travel from, we’ll determine a reasonable cap. We will reimburse travel costs up to this cap only.
Note: Hackers travelling from outside India & in need of travel reimbursement assistance should send us
an email at<EMAIL_ADDRESS>Decisions will be made on a case-by-case basis, and are subject to funding
availability.
A panel of some of the biggest names in tech will evaluate hacks based on creativity, technical difficulty, design, and usefulness. The top 10 overall projects will demo what they have built in front of all of ETHIndia during our closing ceremonies. New judges will be announced on a rolling basis on Twitter and Facebook, so make sure to follow us!
Tweet us your questions at @ethindiaco or reach out to us at<EMAIL_ADDRESS>MLR Convention Center
Brigade Millenium Campus, JP Nagar 7th Phase, Bengaluru, Karnataka, 560078
Get Directions


Your comment will be published once it has been approved.
Click here to see the pull request you generated.
Speak Freely


The goal of the game is to find SETs of three cards from the twelve cards placed on the desk. All cards have four properties.
SHAPE: oval, squiggle, diamond
COLOR: red, green, purlple
NUMBER: 1,2, or 3 shapes
SHADING: solid, striped or outlined shapes (only used in the subtasks for bonus points)
SET consists of three cards, where all properties are:
the same on all of the cards
different on all of the cards.
The selected cards have to adhere to these rules for ALL properties. Worded differently: if the three cards have the same number of shapes, or 1 2 and 3; if the color is the same, or all three colors; if all shapes are solid, or one solid, striped and empty, etc...


OpenDNP3 is a portable, scalable, and rigorously tested implementation of the DNP3 written in C++. The library is optimized for massively parallel front end processor implementations and slave device simulations, although it performs very well on embedded linux as well. Idiomatic bindings are available for the Microsoft CLR family of languages (C#, VB.NET, F#, etc) and JVM-based languages (Java, Scala, Clojure, etc).
The library has been in use production since 2006. This fork is maintained and supported by Automatak, LLC. The improvements here are based on many years of user feedback and real world deployment experience.
OpenDNP3 is very different from proprietary implementations. The biggest difference is the user has free access to the entire source code for the library and the associated tools like test-sets. You are free to experiment, change the code, etc, and can be as involved as you care to be in the future of the code-base. You have access to a community of experts whose collective experience and advice you can tap. You are not just the client of a company, although Automatak will provide as much support as you require.


#include <stdio.h>
#include <OpenSOAP/Envelope.h>
Go to the source code of this file.
Defines | |
| #define | OPENSOAP_HA_MD2 (1) /* MD2 */ |
| Hash Algorithm Definition For MD2. | |
| #define | OPENSOAP_HA_MD4 (2) /* MD4 */ |
| Hash Algorithm Definition For MD4. | |
| #define | OPENSOAP_HA_MD5 (3) /* MD5 */ |
| Hash Algorithm Definition For MD5. | |
| #define | OPENSOAP_HA_MDC2 (4) /* MDC2 */ |
| Hash Algorithm Definition For MDC2. | |
| #define | OPENSOAP_HA_RIPEMD (5) /* RIPEMD */ |
| Hash Algorithm Definition For RIPEMD. | |
| #define | OPENSOAP_HA_SHA (6) /* SHA */ |
| Hash Algorithm Definition For SHA. | |
| #define | OPENSOAP_CA_OWNER_LEN (1024) |
| Max Owner Length in CA Database. | |
| #define | OPENSOAP_CERT_DATE_LEN (14) |
| Data Length in Certificate. | |
Typedefs | |
| typedef tagOpenSOAPSecCert | OpenSOAPSecCert |
| OpenSOAPSecCert Structure Type Definition. | |
| typedef OpenSOAPSecCert * | OpenSOAPSecCertPtr |
| OpenSOAPSecCert Pointer Type Definition. | |
| typedef tagOpenSOAPCARec | OpenSOAPCARec |
| OpenSOAPCARec Structure Type Definition. | |
| typedef OpenSOAPCARec * | OpenSOAPCARecPtr |
| OpenSOAPCARec Pointer Type Definition. | |
Functions | |
| int | OpenSOAPSecGenerateRSAKeys (const unsigned char *szSeedPhrase, FILE *fpPrivKey, FILE *fpPubKey) |
| Generate RSA Keys To Stream. | |
| int | OpenSOAPSecGenerateRSAKeysToFile (const unsigned char *szSeedPhrase, const char *szPrivKeyFileName, const char *szPubKeyFileName) |
| Generate RSA Keys To File. | |
| int | OpenSOAPSecEncWithStream (OpenSOAPEnvelopePtr env, FILE *fpPubKey) |
| Encrypt Envelope Using Public Key File Stream. | |
| int | OpenSOAPSecEncWithFile (OpenSOAPEnvelopePtr env, const char *szPubKName) |
| Encrypt Envelope Using Public Key File. | |
| int | OpenSOAPSecDecWithStream (OpenSOAPEnvelopePtr env, FILE *fpPrivKey) |
| Decrypt Envelope Using Private Key File Stream. | |
| int | OpenSOAPSecDecWithFile (OpenSOAPEnvelopePtr env, const char *szPrivKName) |
| Decrypt Envelope Using Private Key File. | |
| int | OpenSOAPSecAddSignWithStream (OpenSOAPEnvelopePtr env, int iType, FILE *fpPrivKey, OpenSOAPStringPtr name) |
| Add Signature to SOAP Message using PrivateKey File Stream. | |
| int | OpenSOAPSecAddSignWithFile (OpenSOAPEnvelopePtr env, int iType, const char *szPrivKName, OpenSOAPStringPtr name) |
| Add Signature to SOAP Message using PrivateKey File. | |
| int | OpenSOAPSecCntSign (const OpenSOAPEnvelopePtr env, int *pnSig) |
| Count Signatures. | |
| int | OpenSOAPSecGetSignedByList (OpenSOAPEnvelopePtr env, int nCntMax, OpenSOAPStringPtr list[], int *pnCntPacked) |
| Get "SignedBy" List of Signatures. | |
| int | OpenSOAPSecVerifySignWithStream (OpenSOAPEnvelopePtr env, FILE *fpPubKey) |
| Verify Signature using PublicKey File Stream. | |
| int | OpenSOAPSecVerifySignWithFile (OpenSOAPEnvelopePtr env, const char *szPubKName) |
| Verify Signature using PublicKey File. | |
| int | OpenSOAPSecCertCreateWithStream (const char *szPublish, FILE *fpPrivKey, int iHashType, const OpenSOAPCARecPtr pRec, FILE *fpCert) |
| Create Certificate from CA Record(stream). | |
| int | OpenSOAPSecCertCreateWithFile (const char *szPublish, const char *szPrivKeyFile, int iHashType, const OpenSOAPCARecPtr pRec, const char *szCertName) |
| Create Certificate from CA Record(file). | |
| int | OpenSOAPSecCertLoadFromMem (size_t sizArea, const unsigned char *pucArea, OpenSOAPSecCertPtr *ppCert) |
| Load Certificate From Memory. | |
| int | OpenSOAPSecCertLoad (const char *szName, OpenSOAPSecCertPtr *ppCert) |
| Load Certificate From File. | |
| int | OpenSOAPSecCertFree (OpenSOAPSecCertPtr ppCert) |
| Free Certificate. | |
| int | OpenSOAPSecCertVerifyWithStream (FILE *fpCert, FILE *fpPubKey) |
| Verify Certificate (Stream). | |
| int | OpenSOAPSecCertVerifyWithFile (const char *szCertName, const char *szPubKeyName) |
| Verify Certificate (File). | |
| int | OpenSOAPSecCertGetPublisherName (OpenSOAPSecCertPtr pCert, char **pszName) |
| Get Name Of Publisher. | |
| int | OpenSOAPSecCertGetSerialNo (OpenSOAPSecCertPtr pCert, unsigned long *pulSerial) |
| Get Serial Number. | |
| int | OpenSOAPSecCertGetOwnerName (OpenSOAPSecCertPtr pCert, char **pszName) |
| Get Name of Owner. | |
| int | OpenSOAPSecCertGetEndDate (OpenSOAPSecCertPtr pCert, char **pszDate) |
| Get End Date. | |
| int | OpenSOAPSecCertGetPubKey (OpenSOAPSecCertPtr pCert, const char *szSaveName) |
| Get Public Key. | |
| int | OpenSOAPSecDecodeKeyFile (FILE *fp, unsigned long *pulLenOut, unsigned char **ppucDecode) |
| Decode Key File. | |
| int | OpenSOAPSecCABrowseRec (const OpenSOAPCARecPtr pRec, FILE *fpOut) |
| Browse CA Record. | |
| int | OpenSOAPSecCABrowse (FILE *fpOut) |
| Browse CA Database. | |
| int | OpenSOAPSecCARegist (const char *szNameOwner, const char *szTermDate, size_t sizPubkey, const unsigned char *szPubKey, unsigned long *pulSerialNo) |
| Regist Key To CA Databse. | |
| int | OpenSOAPSecCAInvalidate (const char *szNameOwner, unsigned long ulSerial) |
| Invalidate CA Record. | |
| int | OpenSOAPSecCASearchRecords (const char *szNameOwner, int *pnRec, long **pplIdxs) |
| Search Records. | |
| int | OpenSOAPSecCASearchOneRecord (const char *szNameOwner, OpenSOAPCARecPtr *ppRec) |
| Search Record(Longest Period). | |
| int | OpenSOAPSecCAGetRecord (long lIdx, OpenSOAPCARecPtr *ppRec) |
| Get Record. | |
| int | OpenSOAPSecCAFreeRecord (OpenSOAPCARecPtr pRec) |
| Free Record. | |
| int | OpenSOAPSecCARemoveRecord (unsigned long ulSerial) |
| Remove CA Record. |
|
|
Max Owner Length in CA Database. (1024) |
|
|
Data Length in Certificate. (14) |
|
|
Hash Algorithm Definition For MD2. (1) |
|
|
Hash Algorithm Definition For MD4. (2) |
|
|
Hash Algorithm Definition For MD5. (3) |
|
|
Hash Algorithm Definition For MDC2. (4) |
|
|
Hash Algorithm Definition For RIPEMD. (5) |
|
|
Hash Algorithm Definition For SHA.


Below are the existing users:
Below are the existing videos:
Below are the existing Playlist / Showcase:
Video Comments


Smeshariki. Deja vu
Krosh decides to arrange an unforgettable birthday Kopatycha - he turns to the agency "Deja vu", which promises its customers amazing time travel. But because of non-compliance with the terms of the contract, all smeshariki scatters in time, and Krosh will have to gather friends from different eras in the company of his second “I” - the matured and grumbling Shorq, who appeared due to a temporary paradox.


* The website is for NOTES ASSIGNMNET given by the teachers.
* Registor yourself in the website as teacher/student
* Teachers can login with their specialized subjects.
* They can provide their notes, question papers, Assignments for the students with submission date.
* Student can login with email id as username and password , they will get the notification about notes and assignment through mails.


The $provide service has a number of methods for registering components
with the $injector. Many of these functions are also exposed on
angular.Module
.
An Angular service is a singleton object created by a service factory. These service
factories are functions which, in turn, are created by a service provider.
The service providers are constructor functions. When instantiated they must contain a
property called $get
, which holds the service factory function.
When you request a service, the $injector is responsible for finding the
correct service provider, instantiating it and then calling its $get
service factory
function to get the instance of the service.
Often services have no configuration options and there is no need to add methods to the service
provider. The provider will be no more than a constructor function with a $get
property. For
these cases the $provide service has additional helper methods to register
services without specifying a provider.
fn
,
that will be wrapped in a service provider object, whose $get
property will contain the
given factory function.class
that will be wrapped in a service provider object, whose $get
property will instantiate
a new object using the given constructor function.See the individual methods for more information and examples.
provider(name, provider);
Register a provider function with the $injector. Provider functions are constructor functions, whose instances are responsible for "providing" a factory for a service.
Service provider names start with the name of the service they provide followed by Provider
.
For example, the $log service has a provider called
$logProvider.
Service provider objects can have additional methods which allow configuration of the provider
and its service. Importantly, you can configure what kind of service is created by the $get
method, or how that service will act. For example, the $logProvider has a
method debugEnabled
which lets you specify whether the $log service will log debug messages to the
console or not.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the instance. NOTE: the provider will be available under |
| provider | Objectfunction() |
If the provider is:
|
| Object | registered provider instance |
factory(name, $getFn);
Register a service factory, which will be called to return the service instance.
This is short for registering a service where its provider consists of only a $get
property,
which is the given service factory function.
You should use $provide.factory(getFn) if you do not need to
configure your service in a provider.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the instance. |
| $getFn | function() |
The $getFn for the instance creation. Internally this is a short hand
for |
| Object | registered provider instance |
service(name, constructor);
Register a service constructor, which will be invoked with new
to create the service
instance.
This is short for registering a service where its provider's $get
property is the service
constructor function that will be used to instantiate the service instance.
You should use $provide.service(class) if you define your service as a type/class.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the instance. |
| constructor | Function |
A class (constructor function) that will be instantiated. |
| Object | registered provider instance |
value(name, value);
Register a value service with the $injector, such as a string, a
number, an array, an object or a function. This is short for registering a service where its
provider's $get
property is a factory function that takes no arguments and returns the value
service.
Value services are similar to constant services, except that they cannot be injected into a
module configuration function (see angular.Module
) but they can be overridden by
an Angular
decorator.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the instance. |
| value | * |
The value. |
| Object | registered provider instance |
constant(name, value);
Register a constant service, such as a string, a number, an array, an object or a function,
with the $injector. Unlike value it can be
injected into a module configuration function (see angular.Module
) and it cannot
be overridden by an Angular decorator.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the constant. |
| value | * |
The constant value. |
| Object | registered instance |
decorator(name, decorator);
Register a service decorator with the $injector. A service decorator intercepts the creation of a service, allowing it to override or modify the behaviour of the service. The object returned by the decorator may be the original service, or a new service object which replaces or wraps and delegates to the original service.
| Param | Type | Details |
|---|---|---|
| name | string |
The name of the service to decorate. |
| decorator | function() |
This function will be invoked when the service needs to be instantiated and should return the decorated service instance. The function is called using the injector.invoke method and is therefore fully injectable. Local injection arguments:
|


{% extends 'webapp/base.html' %} {% block mainbody %}
All the Star Wars data you've ever wanted:
Planets, Spaceships, Vehicles, Persons, Films and Species
From all SEVEN Star Wars films
Result:
{ "name": "Luke Skywalker", "height": "172", "mass": "77", "hair_color": "blond", "skin_color": "fair", "eye_color": "blue", "birth_year": "19BBY", "gender": "male", "homeworld": "https://swapi.py4e.com/api/planets/1/", "films": [ "https://swapi.py4e.com/api/films/2/", "https://swapi.py4e.com/api/films/6/", "https://swapi.py4e.com/api/films/3/", "https://swapi.py4e.com/api/films/1/", "https://swapi.py4e.com/api/films/7/" ], "species": [ "https://swapi.py4e.com/api/species/1/" ], "vehicles": [ "https://swapi.py4e.com/api/vehicles/14/", "https://swapi.py4e.com/api/vehicles/30/" ], "starships": [ "https://swapi.py4e.com/api/starships/12/", "https://swapi.py4e.com/api/starships/22/" ], "created": "2014-12-09T13:50:51.644000Z", "edited": "2014-12-20T21:17:56.891000Z", "url": "https://swapi.py4e.com/api/persons/1/" }
The Star Wars API, or "swapi" (Swah-pee) is the world's first quantified and programmatically-accessible data source for all the data from the Star Wars canon universe!
We've taken all the rich contextual stuff from the universe and formatted into something easier to consume with software. Then we went and stuck an API on the front so you can access it all!
All the data is accessible through our HTTP web API. Consult our documentation if you'd like to get started.
Helper libraries for popular programming languages are also provided so you can consume swapi in your favourite programming language, in a style that suits you.


{% extends "constituent/constituent_base.html" %} {% load static sekizai_tags %} {% block page_content %} {% add_data "body-class" "public-page" %}
User successfully created on the voting system on {{ request.organization.platform_name }}.


a
gile
s
hare
K
L
Bookmarklet:
℁
Link to
from your page and that's all you need to do.
You can use this code:
℁
You can specify a URL and/or a service by using fragment (hash):
#
or query string:
?


About Me
I am an aspiring Full Stack Web Developer. I have a passion for creating things be it through ink, clay, or code. My ultimate goal is to start my own Cyber Security firm after completing my Bachelors of Science in Computer Science.
I currently work full time for Comcast as a CAE 4 handling high security accounts for our customers that require additional identity security.
 I spend the majority of my time working on personal coding projects with my son strapped to my chest.


Email :
Password :
Reset
Submit
Register
×
Email:
Password:
Gender:
Male
Female
GRE Verbal:
GRE Quantitative:
GRE Analytical Writing:
GPA:
TOEFL:
Register
Cancel


We are a group of students and teachers that want to learn more about programming whilst working collaboratively.
Our aim is to design and produce a working adventure style game.
Our game is called ... and involves ...
If you would like to visit out school website, please follow the link: Wycliffe College


WITNESS LIST Economic Development Committee (Subcommittee on Welfare and Workforce Reform) July 1, 1998-9:30A Welfare and Workforce Reform On: Adams, Joe, Ph. D. (TWC) Bates, Janie (Texoma Workf. Dev. Bd.) Cigainero, Barbara (TWC) Ellison, Burt (TWC Project RIO) Fuller, John H. (TWC) Kamas, Susan (Central TX Workf. Bd.) Martinez, Juan R. (Middle Rio Grande W.D.B) McDonald, Judy (Tarrant County W.D.Bd.) Rath, Diane (TWC) Sheridan, Mike (TWC Executive Director) Temple, Larry E. (TWC) Valdez, Nickie G. (Alamo Workf. Dev. Bd.) Wilkinson, Tom, Jr. (self)


Before Change
sents = []
for line in lines:
if not line.isspace():
tokens = tokenize(line)
sents += expand_parentheses(tokens)
self.sent_lists[name] = sents
def add_file(self, name, file_name):
with open(file_name, "r") as f:
After Change
self.sent_lists = {}
def add_lines(self, name, lines):
self.sent_lists[name] = sum([expand_parentheses(tokenize(line))
for line in lines if not line.isspace()], [])
def add_file(self, name, file_name):
with open(file_name, "r") as f:
self.add_lines(name, f.readlines())


- Unlimited access to FIFA 21 and all of our best games and brand-new releases
- Play the best editions of FIFA 21 and our top games with all the added extras, including in-game rewards, Season Passes, and premium player content
- Get early access to select new games before they’re released to the public
- Save 10% on all EA digital purchases, including game downloads, Season Passes, points packs, and DLC


The female mogrel named Serenity by animal rescuers kept a litter of tiny kittens alive with her body warmth on a cold Canadian night
by AFP1 / 2The female mogrel named Serenity by animal rescuers kept a litter of tiny kittens alive with her body warmth on a cold Canadian night (AFP Photo/Handout)
Ottawa (AFP) - Good with cats: a stray dog found on the side of a road on a cold Canadian night keeping a litter of kittens warm needs a home.
The two-year-old female mongrel, named Serenity by animal rescue officials, was discovered in a ditch on the side of a rural road near Chatham, Ontario a week ago.
It was -3 degrees Celsius (26.6 Farenheit) and dark outside, and the dog was covered in a dusting of snow.
When the passerby stopped to help the dog, she was surprised to find five tiny black kittens "snuggling with her," Myriam Armstrong, a spokeswoman for the Pet and Wildlife Rescue, told AFP.
The unlikely companions were brought to the agency for care -- and their heartfelt story of survival and cross-species nurturing has been widely shared on social media.
More than 30 people from across the continent have asked about adopting them.
"The kittens wouldn't have survived the cold Canadian winter without this dog's help," Armstrong said.
It's not clear how or what brought the dog and the now five-week old kittens together.
But Armstrong said their bond continued at the shelter, describing how Serenity doted on the kittens.
Many people have proposed finding them a home for the animals together, if possible.
Armstrong said they will be ready to be adopted several weeks apart, however.
Serenity will be ready next week after being spayed, but the kittens need another few weeks to fatten up and finish treatments for fleas and parasites.
An Instagram post purportedly written by Serenity says she is young and energetic, needs some house training, but is "obviously great with cats and would have no problem going to a home that has cats in it."


Add a list item with the text "Coffee" inside the .
Finish the HTML code to make an ordered list.
- Coffee
- Tea
- Milk
Use CSS to display squares instead of bullets.
Use the correct HTML attribute to display letters (uppercase ABC) instead of numbers.
- Coffee
- Tea
- Milk
Use the correct HTML attribute to display uppercase roman numbers.
- Coffee
- Tea
- Milk
Use the correct HTML elements to make a description of each term in the description list.


Template Title
text
About Me
Hi! I'm Joseph Feldmann, an Indie Unity Developer. I recently published my first Indie game PictoPull and am looking for new projects to work on. I have been making games for 5+ years now, mostly in Unity. I developed PictoPull part time for 1.5 years while I worked as a software developer and after its release I decided to take a break from software development and do indie dev full time.


The 2D Matrix is an object for holding values for an affine transformation matrix.
A 2D matrix is used to rotate, scale, translate, or skew the objects in a two-dimensional space. A 2D affine transformation can be represented by a 3 by 3 matrix:
| a | b | 0 |
| c | d | 0 |
| tx | ty | 1 |
The third column is constant (0,0,1).
On iOS, the matrix terms, a
, b
, c
, d
, tx
, and ty
, are available as
properties. On Android, the matrix terms are not available as properties.
Use the Titanium.UI.create2DMatrix
method to create a new 2D matrix. You can
pass an optional MatrixCreationDict
dictionary to the method to initialize the
matrix. For example:
var m = Ti.UI.2DMatrix({ rotate: 45 });
Produces a new matrix with a 45 degree rotation. If you pass no arguments,
create2DMatrix
returns an identity matrix.
Adds the specified callback as an event listener for the named event.
Arguments
| name | [String] | Name of the event. |
| callback | [Callback<Object>] | Callback function to invoke when the event is fired. |
Applies the properties to the proxy.
Arguments
| props | [Dictionary] | A dictionary of properties to apply. |
Fires a synthesized event to any registered listeners.
Arguments
| name | [String] | Name of the event. |
| event | [Dictionary] | A dictionary of keys and values to add to the Titanium.Event object sent to the listeners. |
Gets the value of the a property.
Gets the value of the b property.
Gets the value of the c property.
Gets the value of the d property.
Gets the value of the tx property.
Gets the value of the ty property.
Returns a matrix constructed by combining two existing matrices.
Arguments
| t2 | [Titanium.UI.2DMatrix] | The second matrix. |
Removes the specified callback as an event listener for the named event.
Arguments
| name | [String] | Name of the event. |
| callback | [Callback<Object>] | Callback function to remove. Must be the same function passed to addEventListener. |
Returns a matrix constructed by rotating this matrix.
Arguments
| angle | [Number] | Angle to rotate to, in degrees. On Android, if angleTo is specified, this specifies the starting angle for a rotation animation. |
| toAngle | [Number] | Ending angle for a rotation animation, in degrees. Android only. |
Returns a 2DMatrix
object that specifies a scaling animation from one scale to another.
Arguments
| sx | [Number] | Horizontal scaling factor. If toSx and toSy are specified, this specifies the starting horizontal scaling factor, at the beginning of an animation. |
| sy | [Number] | Vertical scaling factor. If toSx and toSy are specified, this specifies the starting vertical scaling factor, at the beginning of an animation. |
| toSx | [Number] | Ending horizontal scaling factor, at the end of an animation. If specified, toSy must be specified as well. Android only. |
| toSy | [Number] | Ending vertical scaling factor, at the end of an animation. If specified, toSx must be specified as well. Android only. |
Sets the value of the tx property.
Arguments
| tx | [Number] | New value for the property. |
Sets the value of the ty property.
Arguments
| ty | [Number] | New value for the property. |


UTC +3
Voltage: 230v (Awaku 110v)
Frequency: 50Hz (Awali 60Hz)
Friday is a holiday.
Generally most businesses are open Saturday to Thursday, although many close early on Thursday.
Government offices are open Saturday to Wednesday. 07:00-14:15 (Saturday-Tuesday), 07:00-14:00 (Wednesday).
Banks - 07:30-12 noon (Saturday-Thursday), selected branches also open a few hours some afternoons.
Shops - hours vary, but typically 08:30-12:30 and 16:00-20:00 (Saturday to Thursday). Many shops open half or full day on Friday as well.
The currency in Bahrain is Dinars, each divided into 1000 fils.
International Dialing code for Bahrain is 973
British Embassy in Manama, Bahrain
21 Government Avenue
P O Box 114
Manama 306, Kingdom of Bahrain
Phone: +973 17574100
Fax: +973 17574101
Web Site: United Kingdom Embassy
Office Hours: Sun - Thursday: 07:30 - 14:30
American Embassy in Manama, Bahrain
Bldg 979, Road 3119, Block 331
Zinj, Manama, Kingdom of Bahrain
Phone: (973)1724-2700
Fax: (973)1727-0547
Web Site: American Embassy
Email<EMAIL_ADDRESS>For full list of Foreign Embassies in Bahrain see link
Foreign Embassies in Bahrain
Emergency numbers
- Police: 999
- Fire department: 997
- Ambulance: 998
IMRAY AND ADLARD COLES PILOT BOOKS are available at a discounted price for Noonsite.com users via World Cruising Club
Routes and Waypoints
By Captain Pieter D. Brown
Publisher Baico Publishing Consultants Inc., Ontario, Canada (2011)
ISBN: 978-1-926596-83-9
A Navigational & Piloting Guide of Suggested Routes with Waypoints from Eastern Canada to Grenada including: the Canadian & USA E. Coasts, Bahamas, Turks & Caicos, Cuba, Dominican Republic, Puerto Rico, the Virgin Islands, the Leeward & Windward Islands.
Read Review here
Noonsite welcomes information and updates especially regarding clearance, customs and immigration procedures from cruisers visiting this country.
Please E-mail noonsite with any new information, updates or corrections. Even just a short email confirming that the current data is accurate would be most helpful.


SEED (Sharing and Enabling Environmental Data) is a plaform built for storing, sharing and visualising environmental information. It empowers the community to search for and analyse large amounts of data when making critical decisions about the environment.
Users want an intuitive search, browse and visualise experience especially when interacting with datasets with geolocation attributes.


@Documented
@Retention(value=RUNTIME)
@Target(value=FIELD)
public @interface SecondaryKey
SecondaryIndex
.
SecondaryKey
may appear on any number of fields in an entity
class, subclasses and superclasses. For a secondary key field in the entity
class or one of its superclasses, all entity instances will be indexed by
that field (if it is non-null). For a secondary key field in an entity
subclass, only instances of that subclass will be indexed by that field (if
it is non-null).
If a secondary key field is null, the entity will not be indexed by that key. In other words, the entity cannot be queried by that secondary key nor can the entity be found by iterating through the secondary index.
For a given entity class and its superclasses and subclasses, no two
secondary keys may have the same name. By default, the field name
identifies the secondary key and the secondary index for a given entity
class. name()
may be specified to override this default.
Using relate()
, instances of the entity class are related to
secondary keys in a many-to-one, one-to-many, many-to-many, or one-to-one
relationship. This required property specifies the cardinality of
each side of the relationship.
A secondary key may optionally be used to form a relationship with
instances of another entity class using relatedEntity()
and onRelatedEntityDelete()
. This establishes foreign key constraints
for the secondary key.
The secondary key field type must be a Set, Collection or array type when
a x-to-many relationship is used or a singular type when an
x-to-one relationship is used; see relate()
.
The field type (or element type, when a Set, Collection or array type is used) of a secondary key field must follow the same rules as for a primary key type. The key sort order is also the same.
For a secondary key field with a collection type, a type parameter must
be used to specify the element type. For example Collection<String>
is allowed but Collection
is not.
| Modifier and Type | Required Element and Description |
|---|---|
Relationship |
relate
Defines the relationship between instances of the entity class and the
secondary keys.
|
| Modifier and Type | Optional Element and Description |
|---|---|
java.lang.String |
name
Specifies the name of the key in order to use a name that is different
than the field name.
|
DeleteAction |
onRelatedEntityDelete
Specifies the action to take when a related entity is deleted having a
primary key value that exists as a secondary key value for this entity.
|
java.lang.Class |
relatedEntity
Specifies the entity to which this entity is related, for establishing
foreign key constraints.
|
public abstract Relationship relate
The table below summarizes how to create all four variations of relationships.
| Relationship | Field type | Key type | Example |
|---|---|---|---|
Relationship.ONE_TO_ONE |
Singular | Unique | A person record with a unique social security number key. |
Relationship.MANY_TO_ONE |
Singular | Duplicates | A person record with a non-unique employer key. |
Relationship.ONE_TO_MANY |
Set/Collection/array | Unique | A person record with multiple unique email address keys. |
Relationship.MANY_TO_MANY |
Set/Collection/array | Duplicates | A person record with multiple non-unique organization keys. |
For a many-to-x relationship, the secondary index will have non-unique keys; in other words, duplicates will be allowed. Conversely, for one-to-x relationship, the secondary index will have unique keys.
For a x-to-one relationship, the secondary key field is
singular; in other words, it may not be a Set, Collection or array type.
Conversely, for a x-to-many relationship, the secondary key
field must be a Set, Collection or array type. A collection type is any
implementation of Collection
.
For a x-to-many relationship, the field type should normally
be Set
(or a subtype of this interface). This
accurately expresses the fact that an Entity may not have two identical
secondary keys. For flexibility, a Collection
(or a
subtype of this interface) or an array type may also be used. In that
case, any duplicate key values in the Collection or array are
ignored.
public abstract java.lang.Class relatedEntity
The given class must be an entity class. This class is called the related entity or foreign entity.
When a related entity class is specified, a check (foreign key constraint) is made every time a new secondary key value is stored for this entity, and every time a related entity is deleted.
Whenever a new secondary key value is stored for this entity, it is
checked to ensure it exists as a primary key value of the related
entity. If it does not, an exception is thrown by the PrimaryIndex
put
method.
Whenever a related entity is deleted and its primary key value exists
as a secondary key value for this entity, the action is taken that is
specified using the onRelatedEntityDelete()
property.
Together, these two checks guarantee that a secondary key value for
this entity will always exist as a primary key value for the related
entity. Note, however, that a transactional store must be configured
to guarantee this to be true in the face of a crash; see StoreConfig.setTransactional(boolean)
.
public abstract DeleteAction onRelatedEntityDelete
Note: This property only applies when relatedEntity()
is specified to define the related entity.
The default action, ABORT
, means that an
exception is thrown in order to abort the current transaction.
If CASCADE
is specified, then this
entity will be deleted also. This in turn could trigger further
deletions, causing a cascading effect.
If NULLIFY
is specified, then the
secondary key in this entity is set to null and this entity is updated.
If the key field type is singular, the field value is set to null;
therefore, to specify NULLIFY
for a singular key field type, a
primitive wrapper type must be used instead of a primitive type. If the
key field type is an array or collection type, the key is deleted from
the array (the array is resized) or from the collection (using Collection.remove
).
DeleteAction.ABORT
if none is
specified.public abstract java.lang.String name
This is convenient when prefixes or suffices are used on field names. For example:
class Person { @SecondaryKey(relate=MANY_TO_ONE, relatedEntity=Person.class, name="parentSsn") String m_parentSsn; }
It can also be used to uniquely name a key when multiple secondary
keys for a single entity class have the same field name. For example,
an entity class and its subclass may both have a field named 'date',
and both fields are used as secondary keys. The name
property
can be specified for one or both fields to give each key a unique
name.
Copyright (c) 1996, 2016 Oracle and/or its affiliates. All rights reserved.


BOPlish: Browser-based Open Publishing
This browser-based peer is currently connected to 0 remote peer(s) in the BOPlish network. Click on a peer id to send a ping message to it.
Id's of connected peers:


The Tcsh package contains “an enhanced but completely compatible version of the Berkeley Unix C shell (csh)”. This is useful as an alternative shell for those who prefer C syntax to that of the bash shell, and also because some programs require the C shell in order to perform installation tasks.
This package is known to build and work properly using an LFS-9.1 platform.
Download (FTP): ftp://ftp.astron.com/pub/tcsh/tcsh-6.22.02.tar.gz
Download MD5 sum: f34909eab33733aecc05d27adc82277b
Download size: 984 KB
Estimated disk space required: 13 MB (with tests)
Estimated build time: 0.2 SBU (with tests)
User Notes: http://wiki.linuxfromscratch.org/blfs/wiki/tcsh
Install Tcsh by running the following commands:
./configure --prefix=/usr --bindir=/bin && make && sh ./tcsh.man2html
To test the results, issue: make check.
Now, as the root
user:
make install install.man && ln -v -sf tcsh /bin/csh && ln -v -sf tcsh.1 /usr/share/man/man1/csh.1 && install -v -m755 -d /usr/share/doc/tcsh-6.22.02/html && install -v -m644 tcsh.html/* /usr/share/doc/tcsh-6.22.02/html && install -v -m644 FAQ /usr/share/doc/tcsh-6.22.02
--bindir=/bin
: This
installs the tcsh
program in /bin
instead of
/usr/bin
.
sh ./tcsh.man2html: This creates HTML documentation from the formatted man page.
ln -v -sf tcsh
/bin/csh: The FHS states that if there is a
C shell installed, there should be
a symlink from /bin/csh
to it. This
creates that symlink.
There are numerous configuration files for the C shell. Examples
of these are /etc/csh.cshrc
,
/etc/csh.login
, /etc/csh.logout
, ~/.tcshrc
, ~/.cshrc
, ~/.history
, ~/.cshdirs
, ~/.login
, and ~/.logout
. More information on these files can
be found in the tcsh(1)
man page.
Update /etc/shells
to include the C
shell program names (as the root
user):
cat >> /etc/shells << "EOF"
/bin/tcsh
/bin/csh
EOF
The following ~/.cshrc
provides two
alternative colour prompts and coloured ls output. If you prefer a
global modification, issue the command as the root
user, replacing ~/.cshrc
by /etc/csh.cshrc
.
cat > ~/.cshrc << "EOF"
# Original at:
# https://www.cs.umd.edu/~srhuang/teaching/code_snippets/prompt_color.tcsh.html
# Modified by the BLFS Development Team.
# Add these lines to your ~/.cshrc (or to /etc/csh.cshrc).
# Colors!
set red="%{\033[1;31m%}"
set green="%{\033[0;32m%}"
set yellow="%{\033[1;33m%}"
set blue="%{\033[1;34m%}"
set magenta="%{\033[1;35m%}"
set cyan="%{\033[1;36m%}"
set white="%{\033[0;37m%}"
set end="%{\033[0m%}" # This is needed at the end...
# Setting the actual prompt. Two separate versions for you to try, pick
# whichever one you like better, and change the colors as you want.
# Just don't mess with the ${end} guy in either line... Comment out or
# delete the prompt you don't use.
set prompt="${green}%n${blue}@%m ${white}%~ ${green}%%${end} "
set prompt="[${green}%n${blue}@%m ${white}%~ ]${end} "
# This was not in the original URL above
# Provides coloured ls
alias ls ls --color=always
# Clean up after ourselves...
unset red green yellow blue magenta cyan yellow white end
EOF
Last updated on 2020-02-17 18:27:03 -0800


| 1 | //////////////////////////////////////////////////////////////////////////////// | |
| 2 | // checkstyle: Checks Java source code for adherence to a set of rules. | |
| 3 | // Copyright (C) 2001-2020 the original author or authors. | |
| 4 | // | |
| 5 | // This library is free software; you can redistribute it and/or | |
| 6 | // modify it under the terms of the GNU Lesser General Public | |
| 7 | // License as published by the Free Software Foundation; either | |
| 8 | // version 2.1 of the License, or (at your option) any later version. | |
| 9 | // | |
| 10 | // This library is distributed in the hope that it will be useful, | |
| 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 13 | // Lesser General Public License for more details. | |
| 14 | // | |
| 15 | // You should have received a copy of the GNU Lesser General Public | |
| 16 | // License along with this library; if not, write to the Free Software | |
| 17 | // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
| 18 | //////////////////////////////////////////////////////////////////////////////// | |
| 19 | ||
| 20 | package com.puppycrawl.tools.checkstyle; | |
| 21 | ||
| 22 | /** | |
| 23 | * Contains constant definitions common to the package. | |
| 24 | **/ | |
| 25 | public final class Definitions { | |
| 26 | ||
| 27 | /** Name of resource bundle for Checkstyle. */ | |
| 28 | public static final String CHECKSTYLE_BUNDLE = | |
| 29 | "com.puppycrawl.tools.checkstyle.messages"; | |
| 30 | ||
| 31 | /** | |
| 32 | * Do no allow {@code Definitions} instances to be created. | |
| 33 | **/ | |
| 34 | private Definitions() { | |
| 35 |
2
1. 2. |
} |
| 36 | ||
| 37 | } | |
Mutations | ||
| 0 |
1.1 |
|
| 35 |
1.1 2.2 |


Welcome! You will find here a growing collection of digital experiences and content by Max Irwin. All code on this site is lovingly handcrafted by yours truly. If you like what you see here and would like to get in touch, you can contact me on twitter @binarymax.
This site is a portfolio of all my fun hobby stuff. To learn more about my professional skills, please visit my profile on LinkedIn.


Check your answers for this task
Completing your claim |
||
|---|---|---|
| Read and understood rules: | Yes | Change Name |
Return to task list {% include 'prototypes/prototype-nov-2018/includes/contact.html' %}
Completing your claim |
||
|---|---|---|
| Read and understood rules: | Yes | Change Name |


Gauteng High Court sentences 7 cop killers to life imprisonment
by Kamva SomdyalaSeveral suspects standing trial for the murder and attempted murder of two police officers were handed hefty sentences by the Gauteng High Court in Johannesburg.
The Hawks, in a statement on Tuesday, said Wintson Sibiya, Mchazeleni Gwabaza, Nkululeko Mkhwane, Sonnyboy Mkhwane, Siyabonga Dlwathi, Mxolisi Mazibuko and Sthembiso Khumalo were sentenced to life imprisonment on Friday.
They were also sentenced to an additional 70 years for attempted murder, unlawful possession of prohibited firearms, unlawful possession of unlicenced firearms and ammunition as well as robbery with aggravating circumstances, said spokesperson Colonel Katlego Mogale.
In 2015, the seven were caught in the act during a robbery in Jeppestown, Johannesburg.
When approached by two on-duty officers - sergeants Selby Hlabisa and Mashudu Ramabulana - some of the suspects opened fire, killing Hlabisa, while Ramabulana was unharmed.
According to the statement, three of the suspects were shot and injured after which they fled to the Jeppe hostel.
The police gave chase, searched the hostel and apprehended the suspects.
The seven were sentenced as follows:
Count 1: Life imprisonment for murder;
Count 2: Fifteen years direct imprisonment for attempted murder;
Count 3: Twenty years direct imprisonment for robbery with aggravating circumstances;
Count 4: Fifteen years direct imprisonment for the unlawful possession of prohibited firearms;
Count 5: Five years direct imprisonment for the unlawful possession of ammunition;
Count 6: Fifteen years direct imprisonment for the unlawful possession of unlicenced firearms.


 Add your Github profile to the list of contributors.
Sean Callan
Sean has been passionately involved with Elixir since the very beginning. After experiencing the joys of working with Elixir he created Elixir School and has become a core contributor to numerous libraries. During the day, Sean helps companies transition teams and codebases to Elixir.
Lessons
- Project creator
George Mantzouranis
George is a software engineer based in Greece who's initial foray into Elixir brought him to Elixir School where he led the translation to Greek. Since joining the team he developed a number of the translation focused features to include the translation report. Being on the learning path, he also decided to contribute back to the community by reviewing the material he uses each time.
Translations
Lessons
- IEx Helpers
- Protocols
Lessons
- Benchee
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Translations
Svilen Gospodinov
Svilen is co-founder & CTO at Heresy, where he uses Elixir, Phoenix and the OTP to build and scale the product and services. Whenever he gets a chance, he tries to give back to the open source community by working on open source, giving talks, writing articles and helping beginners.
Articles
Sophie DeBenedetto
Sophie is an engineer and teacher at The Flatiron School. She loves teaching and learning and finding the Elixir School community felt like the perfect fit!
Lessons
- OTP Distribution
- Plug
Articles
Articles
Prince Wilson
Prince is a teacher at the Flatiron School. He enjoys sharing knowledge with people as he learns new things! Finding ways to create accessible, impactful content to developers out there is his jam.
Articles
Articles
Translations
Translations
Translations
Translations
Herminio Torres
I'm a developer at the Fundação Estudar NGO and Elixir enthusiast and living in Brazil.
Translations
Translations
Translations
Lessons
- Capture operator


Hey Everybody! I'm Emilene, and welcome to my first website!
This website is all about my time at Enspiral Dev Academy, learning and experiencing.
Thank you for viewing!
This website is all about my time at Enspiral Dev Academy, learning and experiencing.
Thank you for viewing!


Install plugin
brew install the_silver_searcher
Add configs into your ~/.vimrc
" Faster Grepping in Vim
" https://thoughtbot.com/blog/faster-grepping-in-vim
" The Silver Searcher
" brew install the_silver_searcher
if executable('ag')
" Use ag over grep
set grepprg=ag\ --nogroup\ --nocolor
" Use ag in CtrlP for listing files. Lightning fast and respects .gitignore
let g:ctrlp_user_command = 'ag %s -l --nocolor -g ""'
" ag is fast enough that CtrlP doesn't need to cache
let g:ctrlp_use_caching = 0
endif
" bind K to grep word under cursor
nnoremap <silent> K :grep! "\b<C-R><C-W>\b"<CR>:cw<CR>
Everytime you press K you will search the word under cursor, triggering :copen to show the results


Dr. Dasgupta has been recently featured in news "TNReady testing troubles over, for now" on WREG news channel 3 Memphis, TN. Published on April 18, 2018. Click here to read more
Dr. Dasgupta has been recently featured in news "Summer camp teaching kids to stay cyber secure" during Gen Cyber Boot Camp at University of Memphis, TN. Published on June 14, 2017. Click here to read the news
Dr. Dasgupta speaks about Social Media Tracking on WREG News Channel 3, posted on May 24, 2017. Click here to read the news
Dr. Dasgupta recently featured in news "Are Hackers Spying on You Through Your Home Appliances?"
Department of Computer Science at The University of Memphis.
Dr. Dasgupta has been interviewed by local TV Channel Fox 13 on January 25, 2017 as a Cyber Security Expert for a Phishing attack incident that happened to Tipton County School employees.
Development of an Intelligent and Robust Multi-Factor Authentication System by the Center for Information Assurance at the University of Memphis. For more on the Center for Information Assurance, please visit
http://www.memphis.edu/cfia/
Dr. Dasgupta was interviewed by a local TV Channel (FOX 13) and telecast on Feb. 19, 2016. He talks about the dngers that come with sshopping apps to the customers.
Dr. Dasgupta was telecasted on news channel 3 of memphis on August 6th, 2014 where he talked about the steps that we can take to protect our information from being hacked.
Dr. Dipankar talks to Local New channel 3 on January 13, 2014 about how businesses play a role in keeping credit information safe.
When electrical generators feed power into the Smart Grid, it is essential that they are coordinated extremely quickly and securely. Delays in coordinating the power input or a cyberattack or failure of the communication with the control center could have devastating effects on millions of people and businesses. With support from MLGW, Dr, Mohd Hasan Ali of The Herff College of Engineering is heading up the electrical engineering aspects of the project, and Dr. Dipankar Dasgupta of the FedEx Institute's Center for Information Assurance is handling internet security research.
Dr. Dasgupta spoke to the Class of 2012 at Summer Commencement.
A presentation on Artificial Immune Systems and Data Mining: Bridging the Gap with Scalability and Improved Learning was created by Dr. Dasgupta along with Olfa Nasraoui, Fabio Gonzalez and Cesar Cardona.


Toggle navigation
L & C . Co
Home
(current)
About
Contact
Signup
Login
LeetCode & Chill
The Only Dating APP Where You Can Practice Coding Problems With Others!
To The Code!


Alice Munro is alive; Italian journalist behind author's death hoax
by Mike DevlinA Twitter user responsible for a series of online death hoaxes was behind an erroneous report that author Alice Munro had died.
The Nobel Prize winner, who opened Victoria bookstore Munro’s Books in 1963 with her then husband, Jim Munro, was said to have died Monday at 88.
A Twitter account claiming to be her publisher, McLelland & Stewart, was outed as fake after a subsequent tweet from the same account — reporting that Munro’s death had been confirmed by her daughter, Sheila Munro — was picked up by several prominent news outlets.
Italian journalist Tommaso Debenedetti claimed responsibility for the hoax after representatives from McLelland & Stewart confirmed the author was alive.
Munro is the latest public figure to be targeted by Debenedetti, who has made a career out of writing fake news. He told The Guardian newspaper he has falsely reported on the deaths of notable figures, including Fidel Castro and Pope Benedict XVI, in order to prove “how unreliable social media can be as a news source.”


South Mayo alert following series of house break-ins
GARDAÌ in south Mayo have urged householders to be security alert following a series of break-ins to homes within the past week.
The burglaries occurred in Claremorris, Ballindine, Knock, Meelickmore and Mayfield.
The incidents have spread fear across the area with gardaì in Claremorris appealing for information that may help them with their enquiries.


This section is Pre-application
Check your answers
{{firstname}}'s details
{% else %}
Your details
{% endif %}
| Full name | {{firstname}}Shiela Green | Change |
| Date of birth | {{dobday}} {{dobmonth}} {{dobyear}} 02 April 1951 | Change |
| Partner | No | Change |
| Does anyone else live with you? | No | Change |
| Do you live in a care home? | No | Change |
| Savings and investments | Less than £6,000 | Change |
| Do you have a job? | No | Change |
| Do you claim benefits or tax credits? | No | Change |


LIFF Drone Controller
version 1.0
Device disconnected
Name
ID
PSDI
Duty ratio
You can change them by sliding bars below.


Disclaimer
The details of this section are complicated. This means their implementation is error-prone. If you get strange behavior, please let me know.
"I just want the simpliest solution..."
new in version 4.0 In this section, we'll see the really-easy but somewhat expensive way of reweighting a graph. I'll run through all the cases detailed below with the simple code. If you just need something to work and don't necessarily need to know about all the details, this section is for you!
Let's compute shortest paths in a cycle graph with only one weighted edge. The simple case requires a structural and weight matrix.
n will be the total size of the graph, and u and v will be the special vertices connected with a weight one edge.
n = 8; % it's just an example, so let's make it small.
u = 1;
v = 2;
These commands create an undirected cycle graph. The cycle is ... n - 1 - 2 - ... - n-1 - n - 1 ... where the weight on every edge is 0 except for the edge between vertex u,v. Notice that the edge list is already symmetric.
This setup means that while there is a weight 1 edge between u and v, the shortest path, or smallest weight path, is actually the path from u, circling every vertex except v and so d(v) should be 0.
E = [1:n 2:n 1; 2:n 1 1:n]'; w = [1 zeros(1,n-1) 1 zeros(1,n-1)]'; A = sparse(E(:,1), E(:,2), w, n, n); % create a weighted sparse matrix As = sparse(E(:,1), E(:,2), true, n, n); % create a structural sparse matrix
The relationship between As and A is that As should have a non-zero value for every edge, but the values of As will be ignored and the computation will proceed with the values in the corresponding spots in the matrix A.
The wrong way to compute shortest paths.
[d pred] = shortest_paths(A,u); d(v)
ans = 1
The right way to compute shortest paths.
[d pred] = shortest_paths(As,u,struct('edge_weight',edge_weight_vector(As,A)));
d(v)
ans = 0
That's better, d(v) = 0 as expected.
A first attempt
- Correct for version 3.0 * A trivial example graph to illustrate the problem that occurs with 0 weighted graphs occurs even with a simple cycle. Suppose that the graph corresponding to adjacency matrix A is a symmetric cycle where all edges have weight 0 except for one edge between vertices (1,2).
These commands create an undirected cycle graph. The cycle is ... n - 1 - 2 - ... - n-1 - n - 1 ... where the weight on every edge is 0 except for the edge between vertex u,v. Notice that the edge list is already symmetric.
E = [1:n 2:n 1; 2:n 1 1:n]'; w = [1 zeros(1,n-1) 1 zeros(1,n-1)]'; A = sparse(E(:,1), E(:,2), w, n, n);
The shortest weighted path between u and v is then through the vertex n because traversing the cycle in the other direction will use the u,v edge of weight 1. Let's check this with the shortest_paths function.
[d pred] = shortest_paths(A,u); d(v)
ans = 1
That is weird, there is a u-v path of length 0 in the graph! Let's see what path the shortest path algorithm chose.
path_from_pred(pred,v)
ans = 1 2
The path it chose was from u to v directly, taking the weight 1 edge. Let's look at the sparse matrix.
A
A = (2,1) 1 (1,2) 1
There are only two edges in the matrix corresponding to our symmetric weight 1 edge between u and v. This happens because Matlab removes all 0 weight edges from the graph.
A first solution
The solution to the problem is to use the 'edge_weight' optional parameter to the shortest_paths function to give it a set of weights to use for each edge.
help shortest_paths
SHORTEST_PATHS Compute the weighted single source shortest path problem. [d pred] = shortest_paths(A,u) returns the distance (d) and the predecessor (pred) for each of the vertices along the shortest path from u to every other vertex in the graph. ... = shortest_paths(A,u,...) takes a set of key-value pairs or an options structure. See set_matlab_bgl_options for the standard options. options.algname: the algorithm to use [{'auto'} | 'dijkstra' | 'bellman_ford' | 'dag'] options.inf: the value to use for unreachable vertices [double > 0 | {Inf}] options.target: a special vertex that will stop the search when hit [{'none'} | any vertex number besides the u]; target is ignored if visitor is set. options.visitor: a structure with visitor callbacks. This option only applies to dijkstra or bellman_ford algorithms. See dijkstra_sp or bellman_ford_sp for details on the visitors. options.edge_weight: a double array over the edges with an edge weight for each edge, see EDGE_INDEX and EXAMPLES/REWEIGHTED_GRAPHS for information on how to use this option correctly [{'matrix'} | length(nnz(A)) double vector] Note: if you need to compute shortest paths with 0 weight edges, you must use an edge_weight vector, see the examples for details. Note: 'auto' cannot be used with 'nocheck' = 1. The 'auto' algorithm checks if the graph has negative edges and uses bellman_ford in that case, otherwise, it uses 'dijkstra'. In the future, it may check if the graph is a dag and use 'dag'. Example: load graphs/clr-25-2.mat shortest_paths(A,1) shortest_paths(A,1,struct('algname','bellman_ford')) See also DIJKSTRA_SP, BELLMAN_FORD_SP, DAG_SP
Well, shortest_paths says to read this document, so you are on the right track! It also has a pointer to the function edge_weight_index. Let's look at that function
help edge_weight_index
EDGE_WEIGHT_INDEX Build a conformal matrix of edge index values for a graph. [eil Ei] = edge_weight_index(As) returns a vector where As(i,j) not= 0 implies Ei(i,j) not= 0 and Ei(i,j) = eil(i) for an integer value of eil(i) that corresponds to the edge index value passed in the visitors. The input matrix A should be a structural matrix with a non-zero value for each edge. The matrix Ei gives an index for each edge in the graph, and the vector eil will reorder a vector of edge weights to an appropriate input for 'edge_weight' parameter of a function call. The edge_weight_index function assists writing codes that use the edge_weight parameter to reweight a graph based on a vector of weights for the graph or using the ei parameter from an edge visitor. It is critical to obtain high performance when i) constructing algorithms that use 0 weighted edges ii) constructing algorithms that change edge weights often. See the examples reweighted_edges and edge_index_visitor for more information. ... = edge_weight_index(A,...) takes a set of key-value pairs or an options structure. See set_matlab_bgl_options for the standard options. options.undirected: output edge indices for an undirected graph [{0} | 1] see Note 1. Note 1: For an undirected graph, the edge indices of the edge corresponding to (u,v) and (v,u) are the same. Consequently, Ei is a symmetric matrix, using this option allows only one value for an undirected edge. Example: load('graphs/bfs_example.mat'); [eil Ei] = edge_weight_index(A,struct('undirected',1)); edge_rand = rand(num_edges(A)/2,1); [iu ju] = find(triu(A,0)); Av = sparse(iu,ju,edge_rand,size(A,1),size(A,1)); Av = Av + Av'; ee = @(ei,u,v) fprintf('examine_edge %2i, %1i, %1i, %4f, %4f, %4f\n', ... ei, u, v, edge_rand(eil(ei)), Av(u,v), edge_rand(Ei(u,v))); breadth_first_search(A,1,struct('examine_edge', ee)); See also INDEXED_SPARSE
This function claims to help us. It requires building a structural matrix which has a non-zero for each edge in the graph. Let's do that.
 According to the edge_weight_index function, it returns both a matrix and an index vector. The index vector is a way to permute an intelligently ordered set of edge weights to the order that MatlabBGL requires the edge weights.
[ei Ei] = edge_weight_index(As); full(Ei) ei
ans = 0 3 0 0 0 0 0 15 1 0 5 0 0 0 0 0 0 4 0 7 0 0 0 0 0 0 6 0 9 0 0 0 0 0 0 8 0 11 0 0 0 0 0 0 10 0 13 0 0 0 0 0 0 12 0 16 2 0 0 0 0 0 14 0 ei = 3 15 1 5 4 7 6 9 8 11 10 13 12 16 2 14
Now let's create a new edge weight vector for this graph corresponding to all the edges we want. Each non-zero in the matrix should have an associated edge weight. Most the edge weights in this case are 0, so it makes it simple.
ew = zeros(nnz(As),1);
ew(Ei(u,v)) = 1;
ew(Ei(v,u)) = 1;
[d pred] = shortest_paths(As,u,struct('edge_weight', ew(ei)));
path_from_pred(pred,v)
ans = 1 8 7 6 5 4 3 2
Excellent, now the shorest path avoids the edge (u,v) as we would expect it.
A simplified solution
The current example is somewhat tedious because we have to create the sparse matrix, then create the edge index matrix, and finally create and edit the edge weight array.
The indexed_sparse function makes the process easier.
Recall that using the sparse function directly generated an incorrect graph adjacency matrix.
A = sparse(E(:,1), E(:,2), w, n, n)
A = (2,1) 1 (1,2) 1
The indexed_sparse function is designed as a replacement for sparse where the adjacency matrix must be indexed using the edge_weight_index or contains 0 weight edges.
help indexed_sparse
INDEXED_SPARSE Create a sparse matrix with indexed edges. [As,A,eil,Ei] = indexed_sparse(i,j,v,m,n) creates a sparse matrix A just like A = sparse(i,j,v,m,n). However, indexed_sparse returns additional information. The matrix As is a structural matrix for A which corresponds to As = sparse(i,j,1,m,n). Thus, As(i,j) != 0 for all edges. The vector eil is a permutation for the vector v, such that v(eil) is the correct input for the edge_weight parameter. The matrix Ei lists the index of each edge in the vector v, so that A = sparse(j,i,v(nonzeros(Ei)),m,n)' unless options.istrans = 0. This function handles the case when v(k) == 0. For v(k) = 0, A(i(k),j(k)) = 0, but As(i(k),j(k)) = 1, and the vector v(eil) provides an appropriate input to the edge_weight parameter for all the algorithms. See the examples reweighted_edges for more information. ... = indexed_sparse(A,...) takes a set of key-value pairs or an options structure. See set_matlab_bgl_options for the standard options. options.undirected: output edge indices for an undirected graph [{0} | 1] See the note about undirected inputs. Note (Undirected inputs): If options.undirected = 1, the input to the graph still must contain both undirected edges and the corresponding weight. Example: % see example/reweighted_edges
From the documentation of indexed_sparse, the first two return values are the structural sparse matrix (As) and the sparse matrix (A) that sparse would have returned. The final two return values are the edge index list that edge_weight_index returns as well as the edge index matrix.
% save the old Ei as an example old_Ei = Ei; [As A eil Ei] = indexed_sparse(E(:,1), E(:,2), w, n, n); fprintf('old_Ei = \n\n'); disp(full(old_Ei)); fprintf('Ei = \n\n'); disp(full(Ei))
old_Ei = 0 3 0 0 0 0 0 15 1 0 5 0 0 0 0 0 0 4 0 7 0 0 0 0 0 0 6 0 9 0 0 0 0 0 0 8 0 11 0 0 0 0 0 0 10 0 13 0 0 0 0 0 0 12 0 16 2 0 0 0 0 0 14 0 Ei = 0 1 0 0 0 0 0 16 9 0 2 0 0 0 0 0 0 10 0 3 0 0 0 0 0 0 11 0 4 0 0 0 0 0 0 12 0 5 0 0 0 0 0 0 13 0 6 0 0 0 0 0 0 14 0 7 8 0 0 0 0 0 15 0
Note that the edge indices changed between the two calls. The reason for this change is that indexed_sparse generates edge indices based on order of E(:,1) and E(:,2). Consequently, this function is much easier to use when you already have a set of weighted edges.
In this case, we don't have to create the ew array again! (Note that the call uses eil instead of ei.)
[d pred] = shortest_paths(As,u,struct('edge_weight', w(eil)));
path_from_pred(pred,v)
ans = 1 8 7 6 5 4 3 2
An undirected solution
The situation for undirected graphs is more complicated. The trouble with the previous solution is that each directed edge had its own weight in the vector w. For an undirected graph, we really want each undirected edge to have a single weight, so the natural length of v would be nnz(A)/2 instead of nnz(A).
However, MatlabBGL really treats all problems as directed graphs, so it will need a vector w of length nnz(A), but that vector should satisfy the requirement w(ei1) = w(ei2) if the edges corresponding to ei1 and ei2 are (i,j) and (j,i), respectively.
Again, the edge_weight_index function provides a solution to this problem. We just have to tell edge_weight_index we have an undirected graph.
Let's start with the same sparse matrix
As = sparse(E(:,1), E(:,2), 1, n, n)
As = (2,1) 1 (8,1) 1 (1,2) 1 (3,2) 1 (2,3) 1 (4,3) 1 (3,4) 1 (5,4) 1 (4,5) 1 (6,5) 1 (5,6) 1 (7,6) 1 (6,7) 1 (8,7) 1 (1,8) 1 (7,8) 1
Here we use the edge_weight_index
[ei Ei] = edge_weight_index(As,struct('undirected',1)); full(Ei) % look at the matrix
ans = 0 1 0 0 0 0 0 7 1 0 2 0 0 0 0 0 0 2 0 3 0 0 0 0 0 0 3 0 4 0 0 0 0 0 0 4 0 5 0 0 0 0 0 0 5 0 6 0 0 0 0 0 0 6 0 8 7 0 0 0 0 0 8 0
Let's create the edge weight vector
ew = zeros(nnz(As)/2,1); % only half as many zeros here. ew(Ei(u,v)) = 1; % and we only needed to set one entry to 0 [d pred] = shortest_paths(As,u,struct('edge_weight', ew(ei))); path_from_pred(pred,v)
ans = 1 8 7 6 5 4 3 2
And we get the same output as before!
The undirected simplification
You can probably guess that the simplification for undirected graphs will use the indexed_sparse call again too.
help indexed_sparse
INDEXED_SPARSE Create a sparse matrix with indexed edges. [As,A,eil,Ei] = indexed_sparse(i,j,v,m,n) creates a sparse matrix A just like A = sparse(i,j,v,m,n). However, indexed_sparse returns additional information. The matrix As is a structural matrix for A which corresponds to As = sparse(i,j,1,m,n). Thus, As(i,j) != 0 for all edges. The vector eil is a permutation for the vector v, such that v(eil) is the correct input for the edge_weight parameter. The matrix Ei lists the index of each edge in the vector v, so that A = sparse(j,i,v(nonzeros(Ei)),m,n)' unless options.istrans = 0. This function handles the case when v(k) == 0. For v(k) = 0, A(i(k),j(k)) = 0, but As(i(k),j(k)) = 1, and the vector v(eil) provides an appropriate input to the edge_weight parameter for all the algorithms. See the examples reweighted_edges for more information. ... = indexed_sparse(A,...) takes a set of key-value pairs or an options structure. See set_matlab_bgl_options for the standard options. options.undirected: output edge indices for an undirected graph [{0} | 1] See the note about undirected inputs. Note (Undirected inputs): If options.undirected = 1, the input to the graph still must contain both undirected edges and the corresponding weight. Example: % see example/reweighted_edges
From the documentation, we find that indexed_sparse has an option called "undirected" which is set to 0 by default.
[As A eil Ei] = indexed_sparse(E(:,1), E(:,2), w, n, n, struct('undirected',1)); fprintf('Ei = \n\n'); disp(full(Ei))
Ei = 0 1 0 0 0 0 0 8 1 0 2 0 0 0 0 0 0 2 0 3 0 0 0 0 0 0 3 0 4 0 0 0 0 0 0 4 0 5 0 0 0 0 0 0 5 0 6 0 0 0 0 0 0 6 0 7 8 0 0 0 0 0 7 0
In this case, the indexed_sparse routine only issued edge indices that were between 1 and 8, rather than 1 and 16 as in the previous case.
[d pred] = shortest_paths(As,u,struct('edge_weight', w(eil)));
path_from_pred(pred,v)
ans = 1 8 7 6 5 4 3 2
Summary
The functions that support reweighted edges as of MatlabBGL 3.0 are shortest_paths, all_shortest_paths, dijkstra_sp, bellman_ford_sp, dag_sp, betweenness_centrality, astar_search, johnson_all_sp, floyd_warshall_all_sp, mst, kruskal_mst, and prim_mst. Note that max_flow does not support these indices.
The functions that assist working with the edge indices for the edge_weight vector are edge_weight_index, indexed_sparse, and edge_weight_vector.


Back to Home
Visit Site
Vortex Paint
code
A radial drawing tool created in p5.js.
4 weeks · UI designer, web developer · 2018
Abstract
I wanted to create a meditative drawing tool with a simple UI. Vortex Paint is the result of my experiments with p5.js, a library that enables one to use the Processing programming language in a JavaScript setting. As a very visual and iterative project, I included a lot of example images generated by me, as well as other users during test runs of the site among art students at the Maryland Institute College of Arts, as well as friends and family.
Design Challenge
Create an unconventional drawing tool that invokes a meditative user experience using p5.js, a JavaScript/web-friendly adaptation of Processing.


By the end of this module, you should be able to...
- use an abstract data type such a list
- understand how to generate equals and (to some extent) hashCode
- become more comfortable with designing objects based on stories
By the end of this module, you should be able to...


References
-
"ALEGRA -- A Framework for Large Strain Rate Physics."
https://sherpa.sandia.gov/9231home/alegra/alegra-frame.html
-
S. Attaway, T. Barragy, K. Brown, D. Gardner, B.
Hendrickson, S. Plimpton and C. Vaughan. "Transient Solid Dynamics Simulations
on the Sandia/Intel Teraflop Computer." Proceedings of SC'97, San
Jose, CA, November, 1997. (Finalist for the Gordon Bell Prize.)
U. Catalyurek and C. Aykanat,
"Hypergraph-partitioning-based decomposition for parallel
sparse matrix vector multiplication", IEEE Trans. Parallel Dist. Systems,
v. 10, no. 7, (1999) pp. 673--693.
-
P. Baehmann, S. Wittchen, M. Shephard, K. Grice,
and M. Yerry. "Robust geometrically based automatic two-dimensional mesh
generation." Intl. J. Numer. Meths. Engrg., 24 (1987) 1043-1078.
-
E.G. Boman, D. Bozdag, U. Catalyurek,
A.H. Gebremedhin and F. Manne. "A Scalable Parallel Graph Coloring
Algorithm for Distributed Memory Computers". Proceedings of Euro-Par'05,
Lisbon, Portugal, August, 2005.
-
D. Bozdag, U. Catalyurek, A.H. Gebremedhin,
F. Manne, E.G. Boman and F. Ozguner. "A Parallel Distance-2 Graph
Coloring Algorithm for Distributed Memory Computers". Proceedings of
HPCC'05, Sorrento, Italy, September, 2005.
-
M. Berger and S. Bokhari. "A partitioning strategy
for nonuniform problems on multiprocessors." IEEE Trans. Computers,
C-36 (1987) 570-580.
-
J. C. Culberson, “Iterated greedy graph
coloring and the difficulty landscape” University of Alberta,
Tech. Rep. TR 92-07, Jun. 1992
-
K.D. Devine, E.G. Boman, R. Heaphy,
R.H. Bisseling, U.V. Catalyurek. "Parallel Hypergraph Partitioning
for Scientific Computing", Proc. of IPDPS'06, Rhodos, Greece, April 2006.
-
K. Devine, G. Hennigan, S. Hutchinson,
A. Salinger, J. Shadid, and R. Tuminaro. "High Performance MP Unstructured
Finite Element Simulation of Chemically Reacting Flows." Proceedings
of SC'97, San Jose, CA, November, 1997. (Finalist for the Gordon Bell
Prize.)
-
K.D. Devine, E.G. Boman, R.T. Heaphy, B.A. Hendrickson,
J.D. Teresco, J. Faik, J.E. Flaherty, and L.G. Gervasio. "New
challenges in dynamic load balancing." Williams College Department of
Computer Science Technical Report CS-04-02, and Sandia Report SAND2004-1496J, Sandia National Laboratories, 2004.
Submitted to Applied Numerical Mathematics.
-
H.C. Edwards. A parallel infrastructure for scalable
adaptive finite element methods and its application to least squares
C^(inf) collocation. Ph.D. Dissertation, Univ. of Texas at Austin,
May, 1997.
-
J. Faik, J.E. Flaherty, L.G. Gervasio, J.D. Teresco, K,D.
Devine, and E.G. Boman.
"A model for resource-aware load balancing on heterogeneous clusters."
Williams College Department of Computer Science Technical Report CS-04-03,
and Sandia Report SAND2004-2145C, Sandia National Laboratories, 2004.
Presented at Cluster '04.
-
J. Flaherty, R. Loy, M. Shephard, B. Szymanski,
J. Teresco and L. Ziantz. "Adaptive local refinement with octree load-balancing
for the parallel solution of three-dimensional conservation laws." J.
Parallel Distrib. Comput., 47 (1998) 139-152.
-
L. Gervasio. "Final Report." Summer project report,
Internal Memo, Department 9103, Sandia National Laboratories, August, 1998.
-
B. Hendrickson and K. Devine. "Dynamic
load balancing in computational mechanics." Comp. Meth. Appl. Mech.
Engrg., v. 184 (#2-4), p. 485-500, 2000.
-
B. Hendrickson and T.G. Kolda.
"Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel computation", SIAM J. on Sci. Comp., v. 21, no. 6, 2001, pp. 2048-2072.
-
B. Hendrickson and R. Leland. "The Chaco user's guide,
version 2.0." Tech. Rep. SAND 94-2692, Sandia National Laboratories, Albuquerque,
NM, October, 1994. http://cs.sandia.gov/CRF/chac.html
-
G. Karypis and V. Kumar. "ParMETIS: Parallel graph
partitioning and sparse matrix ordering library." Tech. Rep. 97-060, Department
of Computer Science, Univ. of Minnesota, 1997. https://www-users.cs.umn.edu/~karypis/metis/parmetis/
-
R. Loy. Adaptive local refinement with octree load-balancing
for the parallel solution of three-dimensional conservation laws. Ph.
D. Dissertation, Dept. of Computer Science, Rensselaer Polytechnic Institute,
May 1998.
-
S. Mitchell and S. Vavasis. "Quality mesh generation
in three dimensions." Proc. 8th ACM Symposium on Computational Geometry,
ACM (1992) 212-221.
-
W. F. Mitchell. "A Fortran 90 Interface for OpenGL:
Revised January 1998" NISTIR 6134 (1998).
https://math.nist.gov/~mitchell/papers/nistir6134.ps.gz
-
W.F. Mitchell. "A Refinement-tree Based Partitioning Method for Dynamic Load
Balancing with Adaptively Refined Grids."
Journal of Parallel and Distributed Computing, Volume 67, Issue 4,
April 2007, Pages 417-429.
-
"MPSalsa: Massively Parallel Numerical Methods for
Advanced Simulation of Chemically Reacting Flows." http://cs.sandia.gov/CRF/MPSalsa/
-
A. Patra and J. T. Oden. "Problem decomposition for
adaptive hp-finite element methods." J. Computing Systems in Engrg.,
6 (1995).
-
J. Pilkington and S. Baden. "Partitioning with
space-filling curves." Tech. Rep. CS94-349, Dept. of Computer Science and
Engineering, Univ. of California, San Diego, CA, 1994.
-
A. E. Sariyuce, E. Saule, U. V. Catalyurek. "Improving Graph
Coloring on Distributed Memory Parallel Computers" Proceedings of the 18th Annual
International Conference on High Performance Computing (HiPC 2011), 2011, to appear.
-
M. Shephard and M. Georges. "Automatic three-dimensional
mesh generation by the finite octree technique." Intl. J. Numer. Meths.
Engrg., 32 (1991) 709-749.
-
V. E. Taylor and B. Nour-Omid. "A Study of the Factorization
Fill-in for a Parallel Implementation of the Finite Element Method." Intl.
J. Numer. Meths. Engrg., 37 (1994) 3809-3823.
-
J. D. Teresco, J. Faik, and J. E. Flaherty. "Resource-Aware Scientific Computation on a Heterogeneous Cluster." Computing in Science & Engineering, To appear, 2005.
-
J. D. Teresco, J. Faik, and J. E. Flaherty.
"Hierarchical Partitioning and Dynamic Load Balancing for Scientific
Computation." Williams College Department of Computer Science
Technical Report CS-04-04, and Sandia Report SAND2004-1559A, Sandia
National Laboratories, 2004. Submitted to Proc. PARA'04 Workshop on
State-Of-The-Art in Scientific Computing.
-
C. Walshaw. "JOSTLE mesh partitioning software", https://www.gre.ac.uk/jostle/
-
C. Walshaw, M. Cross, and M. Everett. "Parallel Dynamic
Graph Partitioning for Adaptive Unstructured Meshes", J. Par. Dist.
Comp., 47(2) 102-108, 1997.
-
M. Warren and J. Salmon. "A parallel hashed octree
n-body algorithm." Proc. Supercomputing `93, Portland, OR, November
1993.
-
R. D. Williams. "Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency, Practice, and Experience, 3(5), 457-481, 1991.
[Table of Contents | Next: Index of Interface and Query Functions | Previous: Backward Compatibility | Privacy and Security]


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/Andrew.20Ashworth.html ---
Testing... is this thing on?
I was hoping to be first!
So I need to reply to threads explicitly?
This is a teeny tiny bit less seamless than what I am generally used to.
And apparently I accidentally Andrew'd my last message.
It seems like it will make it easier to have multiple discussions at the same time
I like your optimism! :)
:D
If it doesn't, Leo will just do Lean++ and try again ;).
Or maybe he'll move on. I'm hoping that if Lean doesn't catch on, it will be because something better came along
Oh yes, I am Ferinko. I just failed to use my dummy github account for Zulip.
Now we're split across multiple channels ...
Surely you didn't think I'm Moses Schoenfinkel! :)
Yeah the split is the thing I am worried about as well.
I don't sanitize the names that I learn. As long as your name doesn't include an end quote, I'll learn it :P
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


the Laimbeer Building
[30, 30]
|
wasteland
[31, 30]
|
wasteland
[32, 30]
|
Mallack Walk
[33, 30]
|
the Withy Motel
[34, 30]
|
St Francis's Hospital
[35, 30]
|
Poncione Grove
[36, 30]
|
Hemmins Cinema
[37, 30]
|
the Futcher Museum
[38, 30]
|
a junkyard
[39, 30]
|
Gawade Bank
[30, 31]
|
a factory
[31, 31]
|
wasteland
[32, 31]
|
Wippell Row
[33, 31]
|
Burwold Way
[34, 31]
|
the Stuart Building
[35, 31]
|
a warehouse
[36, 31]
|
a junkyard
[37, 31]
|
the Bibby Monument
[38, 31]
|
Wadds Walk
[39, 31]
|
a junkyard
[30, 32]
|
Adams Square
[31, 32]
|
Lea Boulevard Railway Station
[32, 32]
|
Deacon Bank
[33, 32]
|
a factory
[34, 32]
|
a factory
[35, 32]
|
wasteland
[36, 32]
|
a carpark
[37, 32]
|
Borland Way
[38, 32]
|
the Lockwood Building
[39, 32]
|
the Giffard Arms
[30, 33]
|
Belsten Square
[31, 33]
|
the Lazenbury Museum
[32, 33]
|
Club Beastall
[33, 33]
|
Storrow Lane
[34, 33]
|
Scanlon Crescent
[35, 33]
|
Snaydon Crescent
[36, 33]
|
Edgcumbe Cinema
[37, 33]
|
wasteland
[38, 33]
|
Skilliter Library
[39, 33]
|
a junkyard
[30, 34]
|
Torrington Place
[31, 34]
|
Mahon Avenue
[32, 34]
|
Wood Grove Fire Station
[33, 34]
|
Snow Plaza
[34, 34]
|
wasteland
[35, 34]
|
Cunningham Cinema
[36, 34]
|
Melrose Way
[37, 34]
|
Alkin Crescent
[38, 34]
|
Birkley Walk
[39, 34]
|
Timmins Cinema
[30, 35]
|
Brownsey Avenue
[31, 35]
|
Joycey Drive
[32, 35]
|
Annesley Street
[33, 35]
|
a junkyard
[34, 35]
|
Green Walk
[35, 35]
|
a junkyard
[36, 35]
|
Freeguard Cinema
[37, 35]
|
a warehouse
[38, 35]
|
wasteland
[39, 35]
|
Hobson Way
[30, 36]
|
the Rhoades Building
[31, 36]
|
Dodge Square
[32, 36]
|
Enwright Park
[33, 36]
|
Wawer Way
[34, 36]
|
a carpark
[35, 36]
|
Symonds Lane
[36, 36]
|
Shehan Boulevard
[37, 36]
|
Eelms Way
[38, 36]
|
Buckett Walk
[39, 36]
|
Caple Avenue
[30, 37]
|
Nicholls Square
[31, 37]
|
Keniston Grove
[32, 37]
|
Bowerman Park
[33, 37]
|
wasteland
[34, 37]
|
Snow Road
[35, 37]
|
a carpark
[36, 37]
|
a warehouse
[37, 37]
|
wasteland
[38, 37]
|
St Odile's Church
[39, 37]
|
Club Rainey
[30, 38]
|
Sabine Plaza
[31, 38]
|
Gasper Plaza
[32, 38]
|
the Lumber Building
[33, 38]
|
Alington Street
[34, 38]
|
Carle Street Police Dept
[35, 38]
|
Bracher Street
[36, 38]
|
Bayley Row Railway Station
[37, 38]
|
Club Woodard
[38, 38]
|
Cardwell Plaza Railway Station
[39, 38]
|
Bungay Towers
[30, 39]
|
Powles Cinema
[31, 39]
|
Cozens Street
[32, 39]
|
wasteland
[33, 39]
|
St Mark's Hospital
[34, 39]
|
the Lavers Motel
[35, 39]
|
the Splain Arms
[36, 39]
|
Picton Way
[37, 39]
|
Roe Crescent
[38, 39]
|
the Froom Building
[39, 39]
|
|
Menu
City Map
Find Location
Route Finder
World View
Map Mirror
|


Piecharts are highly criticized in dataviz. Use it with care, or even better, use alternatives like barcharts, lollipop plots, treemap and others.
What's wrong with it? Barchart Lollipoppie()
functionThe pie()
function is natively provided in R
. It allows to build nice piechart in seconds. Here is an overview of its functioning:
ggplot2
packageThere is no specific geom
to build piechart with ggplot2. The trick is to build a barplot and use coord_polar
to make it circular. This is why the pie()
function described above is probably a better alternative.