BIO
- I have a Biomedical engineering degree form (JUST), I graduated in 2017
- My first job was CSR at Extensya; It was graet experience in 2018
- I worked with ILO as field researcher; It was hard time in 2019
- I worked with Sprii.com as CSR ; It was as a second job while my main job was field researcher with ILO
The top 10 resturant in Irbid
- Cappado Rsturant and cafe: I recommend Fettuccine alefredo
- mansafji: it is the best place to eat mansaf
- shawrma 3al-hatab: I recommend the italian meal
- AL-rwabi: It is for yemenis food, I recommend "Adani tea"
- Grill mark: Here the place that make the best burger in irbid
- Lunch box: If you are in diet or you prefer healthy food, it is the best destination in Irbid for that.
- Abu-sheikha Pastries: It is really delicious- I Recommend to try it
- al-qaiser: Here the pizza's home
- 3arafa resturant: This is the best place to eat homs and flafel
- Fire snack: I love the decoration


Most calendars (e.g. Google Calendar) offer this feature. This allows you to see all events in your personal calendar. To activate this, you need to copy the address of the following link and subscribe to the URL." %}


ZwWdP 30.08.2011
|
Zeit |
Interpret |
Titel |
|
20 Uhr |
Jellyfish |
The King Is Half Undressed |
|
|
Paul Weller |
Starlite |
|
|
Plus49 |
Sad In One Hour |
|
|
Plan B |
Love Goes Down |
|
|
AM & Shawn Lee |
City Boy |
|
|
Rox |
No Going Back |
|
|
Mayer Hawthorne |
Mr. Blue Sky |
|
|
Roger Joseph Manning Jr. |
Too Late For Us Now |
|
|
The Head And The Heart |
Coeur d'Alene |
|
|
Motors |
Airport |
|
|
Angus & Julia Stone |
Big Jet Plane |
|
|
Harpers Bizarre |
Witchi Tai To |
|
|
The Kramford Look |
The Cat Is Missing |
|
|
Thomas Dybdahl |
From Grace |
|
|
Röksopp |
Eple |
|
21 Uhr |
June & The Exit Wounds |
How Much I Really Loved You |
|
|
Bran Van 3000 |
Drinking In L.A. |
|
|
AM & Shawn Lee |
Promises Are Never Far From Lies |
|
|
Pugwash |
See You Mine |
|
|
Eggstone |
Birds In Cages |
|
|
Moderato |
HLM |
|
|
Prefab Sprout |
Dragons |
|
|
Plus49 |
16 Days Until Election (live) |
|
|
Plus49 |
Plain (live) |
|
|
Plus49 |
Naive Brother (live) |
|
|
Plus49 |
Rock On (live) |
|
|
Gabor Szabo |
Dear Prudence |
|
22 Uhr |
Air |
Playground Love |
|
|
A.S. Dragon |
Everybody's Got To Learn Sometimes |
|
|
Other Lives |
Old Statues |
|
|
Julie Depardieu |
Born To Be Alive |
|
|
Ed Harcourt |
Lustre |
|
|
Stars |
My Radio (FM Mix) |
|
|
The Pastels |
The Viaduct (Kid Loco Remix) |
|
|
Momus |
Born To Be Adored |
|
|
Madeleine Peyroux |
Smile |
|
|
Mummers |
Wonderland |
|
|
Lanterns On The Lake |
I Love You Sleepyhead |
|
|
Ed Harcourt |
Still I Dream Of It |
|
|
Louise LeMay |
Be My Guru |


Chapter 1: CPAN
Chapter 2: Perl Module Basics
Chapter 3: Module Design and Implementation
Chapter 4: CPAN Module Distributions
Chapter 5: Submitting Your Module to CPAN
Chapter 6: Module Maintenance
Chapter 7: Great CPAN Modules
Chapter 8: Programming Perl in C
Chapter 9: Writing C Modules with XS
Chapter 10: Writing C Modules with Inline::C
Chapter 11: CGI Application Modules for CPAN


|
||||||||||
| 前のクラス 次のクラス | フレームあり フレームなし | |||||||||
| 概要: 入れ子 | フィールド | コンストラクタ | メソッド | 詳細: フィールド | コンストラクタ | メソッド |
java.lang.Object org.restlet.data.Method
public final class Method
Method to execute when handling a call.
| フィールドの概要 | |
|---|---|
static Method |
ALL
Pseudo-method use to match all methods. |
static Method |
CONNECT
Used with a proxy that can dynamically switch to being a tunnel. |
static Method |
COPY
Creates a duplicate of the source resource, identified by the Request-URI, in the destination resource, identified by the URI in the Destination header. |
static Method |
DELETE
Requests that the origin server deletes the resource identified by the request URI. |
static Method |
GET
Retrieves whatever information (in the form of an entity) that is identified by the request URI. |
static Method |
HEAD
Identical to GET except that the server must not return a message body in the response but only the message header. |
static Method |
LOCK
Used to take out a lock of any access type on the resource identified by the request URI. |
static Method |
MKCOL
MKCOL creates a new collection resource at the location specified by the Request URI. |
static Method |
MOVE
Logical equivalent of a copy, followed by consistency maintenance processing, followed by a delete of the source where all three actions are performed atomically. |
static Method |
OPTIONS
Requests for information about the communication options available on the request/response chain identified by the URI. |
static Method |
PATCH
Requests that the origin server applies partial modifications contained in the entity enclosed in the request to the resource identified by the request URI. |
static Method |
POST
Requests that the origin server accepts the entity enclosed in the request as a new subordinate of the resource identified by the request URI. |
static Method |
PROPFIND
Retrieves properties defined on the resource identified by the request URI. |
static Method |
PROPPATCH
Processes instructions specified in the request body to set and/or remove properties defined on the resource identified by the request URI. |
static Method |
PUT
Requests that the enclosed entity be stored under the supplied request URI. |
static Method |
TRACE
Used to invoke a remote, application-layer loop-back of the request message. |
static Method |
UNLOCK
Removes the lock identified by the lock token from the request URI, and all other resources included in the lock. |
| コンストラクタの概要 | |
|---|---|
Method(java.lang.String name)
Constructor for unsafe and non idempotent methods. |
|
Method(java.lang.String name,
java.lang.String description)
Constructor for unsafe and non idempotent methods. |
|
Method(java.lang.String name,
java.lang.String description,
java.lang.String uri)
Constructor for unsafe and non idempotent methods. |
|
Method(java.lang.String name,
java.lang.String description,
java.lang.String uri,
boolean safe,
boolean idempotent)
Constructor for methods that reply to requests with responses. |
|
Method(java.lang.String name,
java.lang.String description,
java.lang.String uri,
boolean safe,
boolean idempotent,
boolean replying)
Constructor. |
| メソッドの概要 | |
|---|---|
int |
compareTo(Method o)
Compares this method to another. |
boolean |
equals(java.lang.Object object)
|
java.lang.String |
getDescription()
Returns the description. |
java.lang.String |
getName()
Returns the name. |
java.lang.String |
getUri()
Returns the URI of the specification describing the method. |
int |
hashCode()
|
boolean |
isIdempotent()
Indicates if the side-effects of several requests is the same as a single request. |
boolean |
isReplying()
Indicates if the method replies with a response. |
boolean |
isSafe()
Indicates if it should have the significance of taking an action other than retrieval. |
static void |
register(Method method)
Adds a new Method to the list of registered methods. |
static void |
sort(java.util.List<Method> methods)
Sorts the given list of methods by name. |
java.lang.String |
toString()
Returns the name. |
static Method |
valueOf(java.lang.String name)
Returns the method associated to a given method name. |
| クラス java.lang.Object から継承されたメソッド |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| フィールドの詳細 |
|---|
public static final Method ALL
public static final Method CONNECT
public static final Method COPY
public static final Method DELETE
public static final Method GET
public static final Method HEAD
public static final Method LOCK
public static final Method MKCOL
public static final Method MOVE
public static final Method OPTIONS
public static final Method PATCH
public static final Method POST
public static final Method PROPFIND
public static final Method PROPPATCH
public static final Method PUT
public static final Method TRACE
public static final Method UNLOCK
| コンストラクタの詳細 |
|---|
public Method(java.lang.String name)
name
- The technical name of the method.valueOf(String)
public Method(java.lang.String name, java.lang.String description)
name
- The technical name of the method.description
- The description.valueOf(String)
public Method(java.lang.String name, java.lang.String description, java.lang.String uri)
name
- The technical name.description
- The description.uri
- The URI of the specification describing the method.valueOf(String)
public Method(java.lang.String name, java.lang.String description, java.lang.String uri, boolean safe, boolean idempotent)
name
- The technical name.description
- The description.uri
- The URI of the specification describing the method.safe
- Indicates if the method is safe.idempotent
- Indicates if the method is idempotent.valueOf(String)
public Method(java.lang.String name, java.lang.String description, java.lang.String uri, boolean safe, boolean idempotent, boolean replying)
name
- The technical name.description
- The description.uri
- The URI of the specification describing the method.safe
- Indicates if the method is safe.idempotent
- Indicates if the method is idempotent.replying
- Indicates if the method replies with a response.valueOf(String)
| メソッドの詳細 |
|---|
public static void register(Method method)
method
- The method to register.public static void sort(java.util.List<Method> methods)
methods
- The methods to sort.public static Method valueOf(java.lang.String name)
name
- The method name.
public int compareTo(Method o)
java.lang.Comparable<Method>
内の compareTo
o
- The other method.public boolean equals(java.lang.Object object)
java.lang.Object
内の equals
public java.lang.String getDescription()
public java.lang.String getName()
public java.lang.String getUri()
public int hashCode()
java.lang.Object
内の hashCode
public boolean isIdempotent()
public boolean isReplying()
public boolean isSafe()
public java.lang.String toString()
java.lang.Object
内の toString
|
||||||||||
| 前のクラス 次のクラス | フレームあり フレームなし | |||||||||
| 概要: 入れ子 | フィールド | コンストラクタ | メソッド | 詳細: フィールド | コンストラクタ | メソッド |


Before Change
target_set = OrderedSet()
for target in self._target_roots:
target_set.update(target.closure())
return filter(predicate, target_set)
def dependents(self, on_predicate=None, from_predicate=None):
Returns a map from targets that satisfy the from_predicate to targets they depend on that
After Change
:return: a list of targets evaluated by the predicate in inorder traversal order.
target_root_addresses = [target.address for target in self._target_roots]
target_set = self.build_graph.transitive_subgraph_of_addresses(target_root_addresses)
return filter(predicate, target_set)


- PlasmaGunController - Class in it.polimi.se2019.controller.weapons.optional_effects
-
- PlasmaGunController(GameBoardController) - Constructor for class it.polimi.se2019.controller.weapons.optional_effects.PlasmaGunController
-
- player - Variable in class it.polimi.se2019.controller.player_state_controller.PlayerStateController
-
- Player - Class in it.polimi.se2019.model.player
-
Player contains all the player data, and related collections (eg: Inventory)
- Player(String, String, GameBoard) - Constructor for class it.polimi.se2019.model.player.Player
-
- PlayerBoard - Class in it.polimi.se2019.model.player
-
Player board contains all the logic related to damages, marks and scores
- PlayerBoard() - Constructor for class it.polimi.se2019.model.player.PlayerBoard
-
- PlayerController - Class in it.polimi.se2019.controller
-
This class controls player actions, it contains the player's current state
which is determined by the amount of damage received or the state of
the game (regular turns or final frenzy round).
- PlayerController(GameBoardController, Player, PlayerViewOnServer) - Constructor for class it.polimi.se2019.controller.PlayerController
-
- PlayerStateController - Class in it.polimi.se2019.controller.player_state_controller
-
- PlayerStateController(GameBoardController, Player, PlayerViewOnServer) - Constructor for class it.polimi.se2019.controller.player_state_controller.PlayerStateController
-
- PlayerStateController.DirectionBlockedException - Exception in it.polimi.se2019.controller.player_state_controller
-
- PlayerStateController.InvalidMovementException - Exception in it.polimi.se2019.controller.player_state_controller
-
- PlayerStateController.NonExistingPlayerException - Exception in it.polimi.se2019.controller.player_state_controller
-
- PlayerViewOnServer - Class in it.polimi.se2019.view.player
-
- PlayerViewOnServer(ViewFacadeInterfaceRMIClient, int) - Constructor for class it.polimi.se2019.view.player.PlayerViewOnServer
-
Create a new wrapper for a player on the server.
- PlayerViewOnServer.RMIFunction<I,R> - Interface in it.polimi.se2019.view.player
-
- PlayerViewOnServer.RMISupplier<R> - Interface in it.polimi.se2019.view.player
-
- playFrenzyTurn() - Method in class it.polimi.se2019.controller.GameBoardController
-
This method manages the final frenzy round which is played when the
number of skulls on the scoreboard reaches 0 after this final round the
scoreboard will be resolved and the game will end
- playTurn(Integer) - Method in class it.polimi.se2019.controller.PlayerController
-
Take turn
- playTurns() - Method in class it.polimi.se2019.controller.GameBoardController
-
This method is the main game loop, it makes players do actions on their
turn, replaces resources that have been picked up during a turn and
resolves player deaths.
- PowerGloveController - Class in it.polimi.se2019.controller.weapons.alternative_effects
-
- PowerGloveController(GameBoardController) - Constructor for class it.polimi.se2019.controller.weapons.alternative_effects.PowerGloveController
-
- PowerUpCard - Class in it.polimi.se2019.model.grabbable
-
PowerUpCard represent a PowerUp, AKA an object that modifies the normal
flow of in-game operations
- PowerUpCard(Ammo, String) - Constructor for class it.polimi.se2019.model.grabbable.PowerUpCard
-
Generates a new PowerUpCard
- PowerUpController - Class in it.polimi.se2019.controller.powerup
-
Powerups are cards that can be used to produce an effect
or to pay an ammo cost.
- PowerUpController() - Constructor for class it.polimi.se2019.controller.powerup.PowerUpController
-


A few nights ago, I recived the following email.
Did you know that, like you, nearly 50% of the 40,000 subscribers to the FSF’s supporter mailing list have an @gmail.com email address?
JavaScript, once lauded for adding simple visual effects to web pages, is now used by web sites like Gmail to run powerful
programs on your computer. These programs, like any other program running on your computer, should be free software. But
right now, the vast majority of JavaScript programs do not respect your essential freedoms to run, study, modify and share
them. They take control of your computer away from you; the same control we have been working for over 25 years to protect.
Because of the incredibly high percentage of Gmail-using free software supporters, we’re taking action to raise awareness
about how to use Gmail without using proprietary software. We’ll also be working on longer term solutions, but the most
immediate positive step to take is to stop running the proprietary programs.
Many people suggest that you shouldn’t use Gmail at all, because it means losing control over your data and privacy. We agree
that this is a very important factor for you to consider when choosing how you will handle your email.
But since you are already using Gmail, please help us build momentum for change by not using the proprietary JavaScript on
your system – and helping others to do the same.
Yours sincerely,
Matt Lee
Campaigns Manager
Free Software Foundation
–
Sent from the Free Software Foundation,
51 Franklin Street
Fifth Floor
Boston, MA 02110-1335
United States
To this epistle, I have but one thing to say.
WAKE UP. NAOW.
Seriously.
I read that, and I tweeted the link.
Shortly thereafter, I got the following tweet.
firefly911 @jrgifford That’s pretty odd. I fully support open software, but if someone wants their code proprietary they have that right to.
(Link)
So… what’s he saying there? I couldn’t understand it from all the proprietary kool-aid I’ve been drinking.
Exactly that. True freedom (I prefer the term “liberty” but that’s another story) is the right to choose. And that means that if they want to, they can make their codebase proprietary. As a matter of fact, I’m writing this on a Ubuntu Linux box (Free software), using the amazing Simplenote (not free) for my editor. Oh, and I’m using Google Chrome (Not completely free, although it does have a large amount of free components in it), because Firefox (Free) is a memory hog on my computer. And (Ya know, before I forget), I’m also using Dropbox (Not free) to backup the stuff I’m writing in Simplenote, and I’ve also got about 5-10 tabs open with * GASP * proprietary websites in them! WHO WOULDA THUNK IT?!?!?!?! O_O
My point is, people are going to use what WORKS. And until there are FOSS (Where FOSS = Free Open Source Software) alternatives that work as well (or (hopefully) better than) the competition, people won’t be changing.
I know a guy who still uses his AOL account for all his email.
Why?
Because it works. And yes, there are “better” alternatives out there. But it works.
And (as was stated in a open letter to RMS)
“We live in a world where having the technological edge makes the difference between success and failure; asking us to just give up that edge for a theoretical idea of freedom is not going to work.”
And on that note, to the FSF, I have this to say.
If you’re really about Freedom, then people have the right to make their codebase (software, artwork, etc) proprietary. And now, if you’ll excuse me, I’ll just go off and play one of those DRM’ed games that I bought for $.99 on the (proprietary) Apple AppStore, because for games, the (“Open Source”-but-not-really) Android just doesn’t seem to work well. Wonder why…


I recently spent some time at the Geometry of Redistricting Hackathon where I learned about quantitative approaches to assessing gerrymandering. Check out the Metric Geometry and Gerrymandering Group on GitHub to see how you can get involved. I focused on improving documentation during my brief time at the hackathon, but I did not get a chance to contribute as much as I would have liked during the hackathon itself due to my own time constraints.
Here I hope to continue to improve the overall documentation by giving some intuition about how one can generate valid redistricting plans and evaluate them based on compactness measures using the mandeR and redist packages as well as some code from the MCMC visualization project. The mandeR package takes shapefiles and calculates a variety of compactness measures for each polygon. The redist package implements a Markov Chain Monte Carlo (MCMC) approach to generating valid redistricting plans. We combine the functionality of both to get some intuition about the issues facing the quantitative study of gerrymandering.
require(redist)
require(mandeR)
require(ggplot2) ## need latest version for geom_sf()
require(sf) ## for working with shape files
require(dplyr)
require(parallel) ## speed up some of the calculations
require(gridExtra)
*See the README for mandeR if you have trouble installing it.
The redist package implements a new approach for simulating possible redistricting scenarios using MCMC. Fifield et al. define the problem as “a state consisting of \(m\) geographical units (e.g. census blocks or voting precincts) must be divided into \(n\) contiguous districts.”
For small \(m\) or \(n\) it may be possible to enumerate all valid redistricting plans with a specified number of districts given a set of geographic units. redist.enumerate() does this, but quickly becomes too slow as \(m\) and \(n\) increase. The example provided by the documentation enumerates all possible redistricting plans for 25 contiguous precincts in Florida. The method only expects an adjacency list (which geographic units share a boundary), and does not utilize any other spatial information.
data(algdat.pfull)
ptm <- proc.time()
test=redist.enumerate(adjobj=algdat.pfull$adjlist,ndists=2)#,popvec=algdat.pfull$precinct.data,popcons=0.05)
time=proc.time() - ptm
time
## user system elapsed
## 1.411 0.041 1.458
length(test)
## [1] 2318
test[[1]]
## [1] 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
We can see the number of valid redistricting scenarios. A valid redistricting scenario gives a district label to each geographic unit (here a 1 or 2).
If we want to impose equal population constraints for each district, the popvec argument allows us to give population values for each geographical unit, and popcons gives the threshold for how far from equal population we will allow (here we specify within 5%).
ptm <- proc.time()
test=redist.enumerate(adjobj=algdat.pfull$adjlist,ndists=2,popvec=algdat.pfull$precinct.data$pop,popcons=0.05)
time=proc.time() - ptm
time
## user system elapsed
## 0.967 0.013 0.987
length(test)
## [1] 180
test[[1]]
## [1] 1 1 1 2 1 2 1 1 2 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2
We can see there are many fewer valid redistricting scenarios when we impose this constraint.
If we want three districts instead of two, we already reach intractability (at least for my patience level on my laptop).
test=redist.enumerate(adjobj=algdat.pfull$adjlist,ndists=3) ## don't run
If it is not feasible to try all possible combinations, how can we generate possible redistricting scenarios efficiently? The challenge is that a random “redistricting” may not be a valid one. We also need to impose a certain structure (contiguous geographic units) and set of constraints (equal population, geographical compactness). Previous approaches are inefficient and ad-hoc. redist.mcmc() is an algorithm that uses MCMC to uniformly sample redistricting plans with a specified number of contiguous districts subject to constraints.
Let’s walk through the example in the documentation:
## Get an initial partition
initcds <- algdat.pfull$cdmat[,sample(1:ncol(algdat.pfull$cdmat), 1)]
## Run the algorithm
alg_253 <- redist.mcmc(adjobj = algdat.pfull$adjlist, popvec = algdat.pfull$precinct.data$pop, initcds = initcds, nsims = 10000)
names(alg_253)
## [1] "partitions" "distance_parity"
## [3] "distance_original" "mhdecisions"
## [5] "mhprob" "pparam"
## [7] "beta_sequence" "constraint_pop"
## [9] "constraint_compact" "constraint_segregation"
## [11] "constraint_similar" "boundary_partitions"
## [13] "boundaryratio"
dim(alg_253$partitions)
## [1] 25 10000
alg_253$partitions[1,1:10]
## [1] 0 0 0 0 0 0 0 0 0 0
For each geographic unit, we see which district it is placed in per iteration. We can also track various constraint measures. However, this all operates via adjacency list, which isn’t easy to parse. What if we want to visualize these redistricting scenarios to better see what is going on? We will use some helper functions from the mcmcviz project.
## wrapper for redist.mcmc
## pre-procceing: change shapefile to adjacency list
## post-processing: thinning
#redistrict = function(geom, nsims, nthin, nburn, ndists, popcons, eprob, lambda) {
redistrict = function(geom, nsims, nthin, nburn, ndists, popcons) { ## changed for our example
adj_obj = st_relate(geom, pattern = "****1****")
mcmc = redist.mcmc(adj_obj, geom$population,
nsims=nsims+nburn, ndists=ndists, popcons=popcons) ## removed eprob, lambda for our example
mcmc$partitions %>% as.data.frame() %>% as.list() ##thin(nsims, nburn, nthin=nthin) %>% ## took out thin, couldn't find the appropriate function (not coda)
}
## groups geographic units into districts, makes polygons by pasting all together
create_district_map = function(geom, districts)
{
mutate(geom, district = as.character(districts)) %>%
group_by(district) %>%
summarize(
population = sum(population),
geometry = st_union(geometry)
)
}
## gets a district map per iteration
gather_maps=function(geom, iters) {
mclapply(iters, create_district_map, geom = geom, mc.cores = detectCores()) ## parallel
}
The mcmcviz project also has some real shapefiles of Anne Arundel, MD that we will use here. I have this data downloaded locally, but I would love if someone could tell me how to load a shapefile from GitHub via code (I suspect issues because the other .dbf, .prj, etc. files are also needed at the same time).
setwd("~/Desktop/mcmcviz/data")
geom = st_read("AnneArundelN.shp", quiet = TRUE)
names(geom) = tolower(names(geom)) ## needed in order for redist.rsg to be able to create an initial districting
iters = redistrict(geom, nsims=1000, nthin=10, nburn=100, ndists=3, popcons=0.05)
maps = gather_maps(geom, iters) ## time intensive even in parallel
## look at a few iterations
mapdata1 = maps[[1]]
mapdata2 = maps[[10]]
mapdata3 = maps[[20]]
mapdata4 = maps[[30]]
mapdata5 = maps[[40]]
mapdata6 = maps[[50]]
mapDistrict<-function(idx){
mapdata=maps[[idx]]
g1=ggplot(mapdata)+geom_sf(aes(fill=district))+theme(axis.title.x=element_blank(),
axis.text.x=element_blank(),
axis.ticks.x=element_blank(),axis.title.y=element_blank(),
axis.text.y=element_blank(),
axis.ticks.y=element_blank())
return(g1)
}
g1=mapDistrict(1)
g2=mapDistrict(10)
g3=mapDistrict(20)
g4=mapDistrict(30)
g5=mapDistrict(40)
g6=mapDistrict(50)
grid.arrange(g1,g2,g3,g4,g5,g6,ncol=2)
Using the README from mandeR we can now check the compactness measures of the proposed redistricting scenarios.
Expanding on the description of compactness measures from compactnesslib:
Read more about compactness measures here.
mapdata = maps[[1]]
#Convert the shapefile to WKT (class needed by compactlib)
wkt_str <- lapply(st_geometry(mapdata),st_as_text)
#Retrieve compactness scores from mandeR
scores <- lapply(wkt_str,getScoresForWKT)
scores=do.call(rbind,scores)
scores$id=1:nrow(scores)
#Merge scores back into districts
dists<-merge(mapdata,scores,by.x="district",by.y="id")
names(dists)
mapScore<-function(dists,name){
g1=ggplot(dists)+geom_sf(aes_string(fill =name ))+theme(axis.title.x=element_blank(),
axis.text.x=element_blank(),
axis.ticks.x=element_blank(),axis.title.y=element_blank(),
axis.text.y=element_blank(),
axis.ticks.y=element_blank())
}
g1=mapScore(dists,"population")
g2=mapScore(dists,"CvxHullPS")
g3=mapScore(dists,"ReockPS")
g4=mapScore(dists,"Schwartzbe")
g5=mapScore(dists,"PolsbyPopp")
grid.arrange(g1,g2,g3,g4,g5,ncol=2)
mapdata = maps[[50]]
#Convert the shapefile to WKT
wkt_str <- lapply(st_geometry(mapdata),st_as_text)
#Retrieve compactness scores from mandeR
scores <- lapply(wkt_str,getScoresForWKT)
scores=do.call(rbind,scores)
scores$id=1:nrow(scores)
#Merge scores back into districts
dists<-merge(mapdata,scores,by.x="district",by.y="id")
g1=mapScore(dists,"population")
g2=mapScore(dists,"CvxHullPS")
g3=mapScore(dists,"ReockPS")
g4=mapScore(dists,"Schwartzbe")
g5=mapScore(dists,"PolsbyPopp")
grid.arrange(g1,g2,g3,g4,g5,ncol=2)
If we want to more systematically compare all of the redistricting options, we can get compactness scores for all of the iterations.
getScoresFn=function(mapdata){
wkt_str <- lapply(st_geometry(mapdata),st_as_text)
#Retrieve compactness scores from mandeR
scores <- lapply(wkt_str,getScoresForWKT)
scores=do.call(rbind,scores)
scores$id=1:nrow(scores)
#Merge scores back into districts
dists<-merge(mapdata,scores,by.x="district",by.y="id")
return(dists)
}
scoresPerIter=mclapply(maps,getScoresFn,mc.cores = detectCores())
Then we can plot the density of the scores. This can help us see which particular redistricting plans are extreme (used as evidence for intentional gerrymandering).
par(mfrow=c(1,2))
plot(density(unlist(lapply(scoresPerIter,function(x){mean(x$PolsbyPopp)}))),main="Avg PolsbyPopp")
plot(density(unlist(lapply(scoresPerIter,function(x){sd(x$PolsbyPopp)}))),main="SD PolsbyPopp")
Now we can:


Hello world
This Contest has {{awards.length}} awards.
Award - {{award.id}}
{{award.name}}
X
Crop Your Logo


DIRTY DANCING A film review by Sharon Badian Copyright 1987 Sharon Badian
I went to see DIRTY DANCING because one of the critics on a NY independent station loved it. Not that I always listen to the critics (far from it, believe me), but he gave it such a glowing review that I couldn't resist. I had not seen any of the ads for it. Which is probably a good thing since it's being pushed as the next SATURDAY NIGHT FEVER-FLASHDANCE-FOOTLOOSE type movie.  Well, don't be fooled by this bogus advertising!! The movie has more to offer than slick dancing! And it doesn't fall into the all too familiar trap of gratuitous female flesh used only to satisfy a bunch of horny teenage boys.
This movie is not about anything new; the pain of growing up has been dealt with in many movies. But I can't remember another one that does it with such charm and affection. Baby (Jennifer Grey) goes to the Catskills* with her family for a three week vacation. In three weeks, her world changes forever; she becomes a woman, an adult. She's not Daddy's little Baby anymore. There is pain and turmoil, but also humor. It's like real life and maybe, that's why I liked it so much.
The title DIRTY DANCING comes from the fact that the help at the hotel engage in very close dancing at their parties and it is seeing this dancing for the first time, that starts Baby's transformation.
The acting is wonderful. These people seem real. You feel for them. And they can all dance. It's nice to see actors and actresses dancing instead of dancers doing the dancing and actors doing the acting. Both Jennifer Grey and Patrick Swayze started out as dancers. It's to their credit that they can act too. Together they are like dynamite, dancing or acting.
And I can't stop without saying something about Patrick Swayze. I think all the women in the theater were sighing. He just takes your breath away.
So, forget the advertising. Go see the movie. It will make you feel better.
Sharon Badian ihnp4!hoqax!qaseb
* The Catskills are mountains in NY State where many New York City Jews spent their summers (my great-grandparents, grandparents, parents and me included). Though it looks like the Catskills, the movie was actually filmed at a pretty hotel on a lake in southwestern Virginia, near Blacksburg.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Free
- Unlimited emojinary
- Unlimited attempts
- Unlimited team members
- *Incoming webhooks
Pro
- Unlimited emojinary
- Unlimited attempts
- Unlimited team members
- *Incoming webhooks
- View your stats
/emojinary stats
- See previous emojinary
/emojinary list
- Set random emojinary
/emojinary random
- Forfeit the current emojinary
/emojinary forfeit
- ($5/month) 7 day free trial
* emojinary! will send notifications to a Slack channel whenever an emojinary is created, solved, or an attempt to solve is made.


RT @unclebobmartin: Are you disciplined about your whitespace? Or do you strew it around carelessly?
6/13/2011, 10:35:17 AM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @unclebobmartin: Are you disciplined about your whitespace? Or do you strew it around carelessly?
6/13/2011, 10:35:17 AM
Favs: 0
Retweets: 0
link


One of the goals of MPI is to support parallel computations across heterogeneous environments. Communication in a heterogeneous environment may require data conversions. We use the following terminology.
Overflow and underflow exceptions may occur during floating point conversions. Conversion of integers or characters may also lead to exceptions when a value that can be represented in one system cannot be represented in the other system. An exception occurring during representation conversion results in a failure of the communication. An error occurs either in the send operation, or the receive operation, or both.
If a value sent in a message is untyped (i.e., of type MPI_BYTE), then the binary representation of the byte stored at the receiver is identical to the binary representation of the byte loaded at the sender. This holds true, whether sender and receiver run in the same or in distinct environments. No representation conversion is required. (Note that representation conversion may occur when values of type MPI_CHARACTER or MPI_CHAR are transferred, for example, from an EBCDIC encoding to an ASCII encoding.)
No conversion need occur when an MPI program executes in a homogeneous system, where all processes run in the same environment.
Consider the three examples, Type Matching Rules --Type Matching Rules . The first program is correct, assuming that a and b are REAL arrays of size . If the sender and receiver execute in different environments, then the ten real values that are fetched from the send buffer will be converted to the representation for reals on the receiver site before they are stored in the receive buffer. While the number of real elements fetched from the send buffer equal the number of real elements stored in the receive buffer, the number of bytes stored need not equal the number of bytes loaded. For example, the sender may use a four byte representation and the receiver an eight byte representation for reals.
The second program is erroneous, and its behavior is undefined.
The third program is correct. The exact same sequence of forty bytes that were loaded from the send buffer will be stored in the receive buffer, even if sender and receiver run in a different environment. The message sent has exactly the same length (in bytes) and the same binary representation as the message received. If a and b are of different types, or if they are of the same type but different data representations are used, then the bits stored in the receive buffer may encode values that are different from the values they encoded in the send buffer.
Data representation conversion also applies to the envelope of a message: source, destination and tag are all integers that may need to be converted.
Advice
to implementors.
The current definition does not require messages to carry data type information. Both sender and receiver provide complete data type information. In a heterogeneous environment, one can either use a machine independent encoding such as XDR, or have the receiver convert from the sender representation to its own, or even have the sender do the conversion.
Additional type information might be added to messages
in order to allow the system to detect mismatches between
datatype at sender and receiver.
This might be particularly useful in a slower but safer debug mode.
( End of advice to implementors.)
MPI requires support for inter-language communication, i.e.,
if messages are sent
by a C or C++ process and received by a Fortran process, or vice-versa.
The behavior is defined in
Section Language Interoperability
on page Language Interoperability
.


GridRenderContainer
ui.grid
The grid has render containers, allowing the ability to have pinned columns. If the grid is right-to-left then there may be a right render container, if left-to-right then there may be a left render container. There is always a body render container.
GridRenderContainer(name, grid, options);
| Param | Type | Details |
|---|---|---|
| name | string | The name of the render container ('body', 'left', or 'right') |
| grid | Grid | the grid the render container is in |
| options | object | the render container options |
Returns the total canvas height. Only recalculates if canvasHeightShouldUpdate = false
| number | total height of all the visible rows in the container |
last calculated canvas height value
flag to signal that container should recalculate the canvas size
Determine the appropriate column width of each column across all render containers.
Column width is easy when each column has a specified width. When columns are variable width (i.e. have an * or % of the viewport) then we try to calculate so that things fit in. The problem is that we have multiple render containers, and we don't want one render container to just take the whole viewport when it doesn't need to - we want things to balance out across the render containers.
To do this, we use this method to calculate all the renderContainers, recognising that in a given render cycle it'll get called once per render container, so it needs to return the same values each time.
The constraints on this method are therefore:
must return the same value when called multiple times, to do this it needs to rely on properties of the columns, but not properties that change when this is called (so it shouldn't rely on drawnWidth)
The general logic of this method is:


Lesson 7 - Two Dimensional Ballistics
This lesson is similar to the previous in that it uses JavaScript and the DOM to provide the animation. But there are a few differences, so let's take a look. First off, like the previous lesson, the text of the lesson is plain HTML with a large left margin for the cannon, which is SVG. Also like the previous lesson, the SVG is positioned absolutely and on top of the HTML. However, unlike the previous lesson, the SVG in this case covers the whole page which allows drawing on top of the HTML anywhere on the page.
The structure of the files is again the same, with the base page being XHTML, which loads the SVG into an object tag. The SVG in turn loads the JavaScript via the SVG script tag.
The root svg element is very similar to the previous lesson, including the onload event handler:
<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"
width="1593" height="1739" onload="on_load(evt)" >
Note that we don't need to both with a viewBox this time since we will just use page coordinates. The onload handler is very similar to the previous lesson as well.
function on_load(evt) {
svgDoc = getSVGDoc(evt.target);
CannonBall = svgDoc.getElementById('CannonBall');
TrajectoryInfo = svgDoc.getElementById('TrajectoryInfo');
CannonBallPath = svgDoc.getElementById('CannonBallPath');
FireButton = svgDoc.getElementById('FireButton');
FireButtonFill = svgDoc.getElementById('FireButtonFill');
CannonSound = window.parent.document.getElementById("audio-cannon");
}
There are a couple of additional items, notably the cannonball's path and the fire-button's IDs. We'll cover those as we go along.
The code for the Fire button handler is
function OnMouseDownFire(evt) {
CannonSound.play();
startTime = new Date();
points="";
bFlying = true;
CannonBall.setAttribute("display", "inline" );
velocity = INITIAL_VELOCITY;
speedY = velocity * Math.sin(CANNON_ANGLE * DEG2RAD);
speedX = velocity * Math.cos(CANNON_ANGLE * DEG2RAD);
opacity = 1.0;
CannonBallPath.setAttribute("points", points );
CannonBallPath.setAttribute("stroke-opacity", opacity );
FireButtonFill.setAttribute("fill", "#000080");
FireButton.setAttribute("pointer-events", "none" );
FireButton.setAttribute("opacity", "0.5");
intervalID = window.setInterval('next_update()', 16);
}
First off, we call the HTML audio element for the cannon fire sound then set the start time for the animation. We then ensure that the points SVG polyline element, which will hold the trajectory of the cannonball's path is empty. We set the animation-in-progress flag to true. We then change the cannonball's display property to "inline" so it is no longer hidden. We calculate speed in X and Y of the cannonball as a function of the initial (arbitrary) velocity and and the angle of the cannon's barrel. Since we neglect friction, the speed in X and Y doesn't change over time though the position in Y will also be affected by gravity.
Then we set the opacity of the cannonball's path to 1.0 and set the SVG polyline's points attribute to point at our JavaScript variable points, which is a string. We will dyamically add coordinates to the string as the cannonball flies along it's trajectory. We set the polyline's stroke-opacity to 1.0. Note that we set the stroke-opacity becase we are stroking the path, not filling it.
We then set the fire-button to dark blue and the pointer-events to none so the user can't press the button while the cannonball is flying. We set the opacity of the button to 50% to visually indicate this.
Finally, we tell the browser to call our update function as fast as it can. Like the previous lesson, the update function is where all the work gets done.
function next_update () {
elapsed = (Date.now() - startTime.getTime()) / 1000.0;
if (posY < MIN_ALTITUDE && bFlying == true) {
bFlying = false;
}
else
{
if (bFlying == true) {
posX = elapsed * speedX;
posY = elapsed * speedY - 0.5 * gravity * elapsed * elapsed;
velocity = Math.sqrt(speedX*speedX + speedY*speedY);
points = points + posX.toFixed(1) + ',';
points = points + posY.toFixed(1) + ' ';
CannonBall.setAttribute("cy", posY );
CannonBall.setAttribute("cx", posX );
CannonBallPath.setAttribute("points", points );
TrajectoryInfo.firstChild.nodeValue = 't: ' + elapsed.toFixed(1) + ' v: '
+ velocity.toFixed(1) + ' y: ' + posY.toFixed(1);
}
else {
opacity -= OPACITY_DECREMENT;
CannonBallPath.setAttribute("stroke-opacity", opacity );
if (opacity <= 0) {
window.clearTimeout( intervalID );
points = "";
FireButtonFill.setAttribute("fill", "#C00000");
FireButton.setAttribute("opacity", "1");
FireButton.setAttribute("pointer-events", "auto" );
}
}
}
}
First we see how much time has elapsed. Then we check to see if we are currently animating and if the cannonball has fallen off the page. If it has, we clear the flying flag, but we DON'T stop the animation just yet because we haven't erased the cannonball's path yet.
If the cannonball is flying and HASN'T fallen off the page, then we need to update it's position and trajectory. Since there is no friction in our world, the position in X is easy to calculate given the horizontal speedX and the elapsed time. The position in Y is calculated in exactly the same fashion as the previous lesson, of course. We then append the X and Y coordinates onto the points string whcih appends them to the SVG polyline element, which causes it to be stroked in white. We then update the position of the cannonball itself. Finally, we update the text element with the trajectory info.
But if the cannonball ISN'T flying then it means it has fallen off the page so we don't need to update it's position anymore but we do need to erase the cannonball's path my slowly making the path more transparent. So we decrease the path's opacity by a small amount. Then, when the path is completely transparent, we turn clear the animation calls, set the points string to empty and re-enable the Fire button and turn it fully opaque and back to red.
And that's it! Click on this link to see the actual rendered demo in all its booming glory!


| HADOOP-4595 |
JVM Reuse triggers RuntimeException(“Invalid state”) |
Major |
. |
Aaron Kimball |
Devaraj Das |
| HADOOP-4552 |
Deadlock in RPC Server |
Major |
ipc |
Raghu Angadi |
Raghu Angadi |
| HADOOP-4525 |
config ipc.server.tcpnodelay is no loger being respected |
Major |
ipc |
Clint Morgan |
Clint Morgan |
| HADOOP-4510 |
FileOutputFormat protects getTaskOutputPath |
Blocker |
. |
Chris K Wensel |
Chris K Wensel |
| HADOOP-4500 |
multifilesplit is using job default filesystem incorrectly |
Major |
. |
Joydeep Sen Sarma |
Joydeep Sen Sarma |
| HADOOP-4498 |
JobHistory does not escape literal jobName when used in a regex pattern |
Blocker |
. |
Chris K Wensel |
Chris K Wensel |
| HADOOP-4471 |
Capacity Scheduler should maintain the right ordering of jobs in its running queue |
Blocker |
. |
Vivek Ratan |
Amar Kamat |
| HADOOP-4466 |
SequenceFileOutputFormat is coupled to WritableComparable and Writable |
Blocker |
io |
Chris K Wensel |
Chris K Wensel |
| HADOOP-4457 |
Input split logging in history is broken in 0.19 |
Blocker |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4455 |
Upload the derby.jar and TestSeDe.jar needed for fixes to 0.19 bugs |
Blocker |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4449 |
Minor formatting changes to quota related commands |
Trivial |
. |
Raghu Angadi |
Raghu Angadi |
| HADOOP-4446 |
Update Scheduling Information display in Web UI |
Major |
. |
Karam Singh |
Sreekanth Ramakrishnan |
| HADOOP-4439 |
Cleanup memory related resource management |
Blocker |
. |
Hemanth Yamijala |
Hemanth Yamijala |
| HADOOP-4438 |
Add new/missing dfs commands in forrest |
Blocker |
documentation |
Hemanth Yamijala |
Suresh Srinivas |
| HADOOP-4427 |
Add new/missing commands in forrest |
Blocker |
documentation |
Sharad Agarwal |
Sreekanth Ramakrishnan |
| HADOOP-4425 |
Edits log takes much longer to load |
Blocker |
. |
Chris Douglas |
Chris Douglas |
| HADOOP-4423 |
FSDataset.getStoredBlock(id) should not return corrupted information |
Blocker |
. |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-4418 |
Update documentation in forrest for Mapred, streaming and pipes |
Blocker |
documentation |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4410 |
TestMiniMRDebugScript fails on trunk |
Blocker |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4405 |
all creation of hadoop dfs queries from with in hive shell |
Minor |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4404 |
saveFSImage() should remove files from a storage directory that do not correspond to its type. |
Blocker |
. |
Konstantin Shvachko |
Konstantin Shvachko |
| HADOOP-4400 |
Add “hdfs://” to fs.default.name on quickstart.html |
Trivial |
documentation |
Jeff Hammerbacher |
Jeff Hammerbacher |
| HADOOP-4393 |
Merge AccessControlException and AccessControlIOException into one exception class |
Blocker |
fs |
Owen O’Malley |
Owen O’Malley |
| HADOOP-4387 |
TestHDFSFileSystemContract fails on windows |
Blocker |
test |
Raghu Angadi |
Raghu Angadi |
| HADOOP-4380 |
Make new classes in mapred package private instead of public |
Major |
. |
Owen O’Malley |
Owen O’Malley |
| HADOOP-4378 |
TestJobQueueInformation fails regularly |
Blocker |
test |
Tsz Wo Nicholas Sze |
Sreekanth Ramakrishnan |
| HADOOP-4376 |
Fix line formatting in hadoop-default.xml for hadoop.http.filter.initializers |
Blocker |
conf |
Enis Soztutar |
Enis Soztutar |
| HADOOP-4373 |
Guaranteed Capacity calculation is not calculated correctly |
Blocker |
. |
Karam Singh |
Hemanth Yamijala |
| HADOOP-4367 |
Hive: UDAF functions cannot handle NULL values |
Major |
. |
Zheng Shao |
Zheng Shao |
| HADOOP-4366 |
Provide way to replace existing column names for columnSet tables |
Major |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4361 |
Corner cases in killJob from command line |
Blocker |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4358 |
NPE from CreateEditsLog |
Blocker |
test |
Chris Douglas |
Raghu Angadi |
| HADOOP-4356 |
[Hive] for a 2-stage map-reduce job, number of reducers not set correctly |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4355 |
hive 2 case sensitivity issues |
Major |
. |
Zheng Shao |
|
| HADOOP-4344 |
Hive: Partition pruning causes semantic exception with joins |
Major |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4342 |
[hive] bug in partition pruning |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4336 |
fix sampling bug in fractional bucket case |
Minor |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4335 |
FsShell -ls fails for file systems without owners or groups |
Major |
scripts |
David Phillips |
David Phillips |
| HADOOP-4333 |
add ability to drop partitions through DDL |
Minor |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4330 |
Hive: AS clause with subqueries having group bys is not propogated to the outer query block |
Major |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4329 |
Hive: [] operator with maps does not work |
Major |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4327 |
Create table hive does not set delimeters |
Major |
. |
Edward Capriolo |
Namit Jain |
| HADOOP-4321 |
Document the capacity scheduler in Forrest |
Blocker |
documentation |
Hemanth Yamijala |
Hemanth Yamijala |
| HADOOP-4320 |
[Hive] TCTLSeparatedProtocol implement maps/lists/sets read/writes |
Major |
. |
Pete Wyckoff |
|
| HADOOP-4319 |
fuse-dfs dfs_read function may return less than the requested #of bytes even if EOF not reached |
Blocker |
. |
Pete Wyckoff |
Pete Wyckoff |
| HADOOP-4316 |
[Hive] extra new lines at output |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4315 |
Hive: Cleanup temporary files once the job is done |
Major |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4309 |
eclipse-plugin no longer compiles on trunk |
Blocker |
contrib/eclipse-plugin |
Chris Douglas |
Chris Douglas |
| HADOOP-4303 |
Hive: trim and rtrim UDFs behaviors are reversed |
Major |
. |
Ashish Thusoo |
Ashish Thusoo |
| HADOOP-4302 |
TestReduceFetch fails intermittently |
Blocker |
. |
Devaraj Das |
Chris Douglas |
| HADOOP-4299 |
Unable to access a file by a different user in the same group when permissions is set to 770 or when permissions is turned OFF |
Blocker |
. |
Ramya Sunil |
Hairong Kuang |
| HADOOP-4296 |
Spasm of JobClient failures on successful jobs every once in a while |
Blocker |
. |
Joydeep Sen Sarma |
dhruba borthakur |
| HADOOP-4294 |
Hive: Parser should pass field schema to SerDe |
Major |
. |
Zheng Shao |
|
| HADOOP-4288 |
java.lang.NullPointerException is observed in Jobtracker log while call heartbeat |
Blocker |
. |
Karam Singh |
Amar Kamat |
| HADOOP-4287 |
[mapred] jobqueue_details.jsp shows negative count of running and waiting reduces with CapacityTaskScheduler. |
Blocker |
. |
Vinod Kumar Vavilapalli |
Sreekanth Ramakrishnan |
| HADOOP-4282 |
User configurable filter fails to filter accesses to certain directories |
Blocker |
. |
Kan Zhang |
Tsz Wo Nicholas Sze |
| HADOOP-4280 |
test-libhdfs consistently fails on trunk |
Blocker |
. |
Raghu Angadi |
Pete Wyckoff |
| HADOOP-4278 |
TestDatanodeDeath failed occasionally |
Blocker |
. |
Tsz Wo Nicholas Sze |
dhruba borthakur |
| HADOOP-4275 |
New public methods added to the *ID classes |
Major |
. |
Owen O’Malley |
Owen O’Malley |
| HADOOP-4274 |
Capacity scheduler’s implementation of getJobs modifies the list of running jobs inadvertently |
Blocker |
. |
Hemanth Yamijala |
Hemanth Yamijala |
| HADOOP-4273 |
[Hive] job submission exception if input is null |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4272 |
Hive: metadataTypedColumnsetSerDe should check if SERIALIZATION.LIB is old columnsetSerDe |
Major |
. |
Zheng Shao |
Prasad Chakka |
| HADOOP-4269 |
LineRecordReader.LineReader should use util.LineReader |
Major |
util |
Chris Douglas |
Chris Douglas |
| HADOOP-4267 |
TestDBJob failed on Linux |
Blocker |
. |
Raghu Angadi |
Enis Soztutar |
| HADOOP-4266 |
Hive: Support “IS NULL”, “IS NOT NULL”, and size(x) for map and list |
Major |
. |
Zheng Shao |
Zheng Shao |
| HADOOP-4265 |
[Hive] error when user specifies the delimiter |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4261 |
Jobs failing in the init stage will never cleanup |
Blocker |
. |
Amar Kamat |
Amareshwari Sriramadasu |
| HADOOP-4256 |
Remove Completed and Failed Job tables from jobqueue_details.jsp |
Blocker |
. |
Sreekanth Ramakrishnan |
Sreekanth Ramakrishnan |
| HADOOP-4254 |
Cannot setSpaceQuota to 1TB |
Blocker |
. |
Tsz Wo Nicholas Sze |
Raghu Angadi |
| HADOOP-4250 |
Remove short names of serdes from Deserializer, Serializer & SerDe interface and relevant code. |
Major |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4249 |
Declare hsqldb.jar in eclipse plugin |
Blocker |
contrib/eclipse-plugin |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-4248 |
Remove HADOOP-1230 API from 0.19 |
Major |
. |
Owen O’Malley |
Owen O’Malley |
| HADOOP-4247 |
hadoop jar throwing exception when running examples |
Blocker |
. |
Hemanth Yamijala |
Owen O’Malley |
| HADOOP-4246 |
Reduce task copy errors may not kill it eventually |
Blocker |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4242 |
Remove an extra “;” in FSDirectory |
Blocker |
. |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-4241 |
-hiveconf config parameters in hive cli should override all config variables |
Major |
. |
Joydeep Sen Sarma |
Joydeep Sen Sarma |
| HADOOP-4236 |
JobTracker.killJob() fails to kill a job if the job is not yet initialized |
Blocker |
. |
Amar Kamat |
Sharad Agarwal |
| HADOOP-4232 |
Race condition in JVM reuse when more than one slot becomes free |
Blocker |
. |
Devaraj Das |
Devaraj Das |
| HADOOP-4225 |
FSEditLog logs modification time instead of access time. |
Blocker |
. |
Konstantin Shvachko |
Konstantin Shvachko |
| HADOOP-4213 |
NPE in TestLimitTasksPerJobTaskScheduler |
Major |
test |
Tsz Wo Nicholas Sze |
Sreekanth Ramakrishnan |
| HADOOP-4209 |
The TaskAttemptID should not have the JobTracker start time |
Blocker |
. |
Owen O’Malley |
Amar Kamat |
| HADOOP-4200 |
Hadoop-Patch build is failing |
Major |
build |
Ramya Sunil |
Ramya Sunil |
| HADOOP-4197 |
Need to update DATA_TRANSFER_VERSION |
Major |
. |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-4195 |
SequenceFile.Writer close() uses compressor after returning it to CodecPool. |
Major |
io |
Hong Tang |
Arun C Murthy |
| HADOOP-4189 |
HADOOP-3245 is incomplete |
Blocker |
. |
Amar Kamat |
Amar Kamat |
| HADOOP-4183 |
select * to console issues in Hive |
Major |
. |
Joydeep Sen Sarma |
|
| HADOOP-4175 |
Incorporate metastore server review comments |
Major |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4173 |
TestProcfsBasedProcessTree failing on Windows machine |
Major |
test, util |
Ramya Sunil |
Vinod Kumar Vavilapalli |
| HADOOP-4169 |
‘compressed’ keyword in DDL syntax misleading and does not compress |
Major |
. |
Joydeep Sen Sarma |
Joydeep Sen Sarma |
| HADOOP-4163 |
If a reducer failed at shuffling stage, the task should fail, not just logging an exception |
Blocker |
. |
Runping Qi |
Sharad Agarwal |
| HADOOP-4155 |
JobHisotry::JOBTRACKER_START_TIME is not initialized properly |
Major |
. |
Lohit Vijayarenu |
Lohit Vijayarenu |
| HADOOP-4154 |
Fix javac warning in WritableUtils |
Minor |
io |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-4149 |
JobQueueJobInProgressListener.jobUpdated() might not work as expected |
Blocker |
. |
Amar Kamat |
Amar Kamat |
| HADOOP-4147 |
Remove JobWithTaskContext from JobInProgress |
Trivial |
. |
Amar Kamat |
Amareshwari Sriramadasu |
| HADOOP-4146 |
[Hive] null pointer exception on a join |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4139 |
[Hive] multi group by statement is not optimized |
Major |
. |
Namit Jain |
Namit Jain |
| HADOOP-4135 |
change max length of database columns for metastore to 767 |
Minor |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4133 |
remove derby.log files form repository and also change the location where these files get created |
Minor |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4129 |
Memory limits of TaskTracker and Tasks should be in kiloBytes. |
Blocker |
. |
Vinod Kumar Vavilapalli |
Vinod Kumar Vavilapalli |
| HADOOP-4125 |
Reduce cleanup tip web ui is does not show attempts |
Major |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4121 |
HistoryViewer initialization failure should log exception trace |
Trivial |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-4112 |
Got ArrayOutOfBound exception while analyzing the job history |
Major |
. |
Amar Kamat |
Amareshwari Sriramadasu |
| HADOOP-4100 |
Scheduler.assignTasks should not be dealing with cleanupTask |
Major |
. |
Devaraj Das |
Amareshwari Sriramadasu |
| HADOOP-4099 |
HFTP interface compatibility with older releases broken |
Blocker |
fs |
Kan Zhang |
dhruba borthakur |
| HADOOP-4097 |
Hive interaction with speculative execution is broken |
Critical |
. |
Joydeep Sen Sarma |
Joydeep Sen Sarma |
| HADOOP-4093 |
[Hive]unify Table.getCols() & get_fields() |
Major |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4089 |
Check if the tmp file used in the CLI exists before using it. |
Major |
. |
Ashish Thusoo |
|
| HADOOP-4087 |
Make Hive metastore server to work for PHP & Python clients |
Major |
. |
Prasad Chakka |
Prasad Chakka |
| HADOOP-4078 |
TestKosmosFileSystem fails on trunk |
Blocker |
fs |
Amareshwari Sriramadasu |
Lohit Vijayarenu |
| HADOOP-4077 |
Access permissions for setting access times and modification times for files |
Blocker |
. |
dhruba borthakur |
dhruba borthakur |
| HADOOP-4071 |
FSNameSystem.isReplicationInProgress should add an underReplicated block to the neededReplication queue using method “add” not “update” |
Major |
. |
Hairong Kuang |
Hairong Kuang |
| HADOOP-4054 |
During edit log loading, an underconstruction file’s lease gets removed twice |
Major |
. |
Hairong Kuang |
Hairong Kuang |
| HADOOP-4050 |
TestFairScheduler failed on Linux |
Major |
. |
Tsz Wo Nicholas Sze |
Matei Zaharia |
| HADOOP-4036 |
Increment InterTrackerProtocol version number due to changes in HADOOP-3759 |
Major |
. |
Hemanth Yamijala |
Hemanth Yamijala |
| HADOOP-4030 |
LzopCodec shouldn’t be in the default list of codecs i.e. io.compression.codecs |
Major |
io |
Arun C Murthy |
Arun C Murthy |
| HADOOP-4027 |
When streaming utility is run without specifying mapper/reducer/input/output options, it returns 0. |
Major |
. |
Ramya Sunil |
|
| HADOOP-4023 |
javadoc warnings: incorrect references |
Major |
documentation |
Tsz Wo Nicholas Sze |
Owen O’Malley |
| HADOOP-4018 |
limit memory usage in jobtracker |
Major |
. |
dhruba borthakur |
dhruba borthakur |
| HADOOP-4014 |
DFS upgrade fails on Windows |
Blocker |
fs |
NOMURA Yoshihide |
Konstantin Shvachko |
| HADOOP-3991 |
updates to hadoop-ec2-env.sh for 0.18.0 |
Minor |
contrib/cloud |
Karl Anderson |
Tom White |
| HADOOP-3985 |
TestHDFSServerPorts fails on trunk |
Major |
. |
Amar Kamat |
Hairong Kuang |
| HADOOP-3970 |
Counters written to the job history cannot be recovered back |
Major |
. |
Amar Kamat |
Amar Kamat |
| HADOOP-3968 |
test-libhdfs fails on trunk |
Major |
. |
Lohit Vijayarenu |
Pete Wyckoff |
| HADOOP-3964 |
javadoc warnings by failmon |
Major |
build |
Tsz Wo Nicholas Sze |
dhruba borthakur |
| HADOOP-3962 |
Shell command “fs -count” should support paths with different file systsms |
Major |
fs |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-3961 |
resource estimation works badly in some cases |
Blocker |
. |
Ari Rabkin |
Ari Rabkin |
| HADOOP-3959 |
[HOD] –resource_manager.options is not passed to qsub |
Major |
contrib/hod |
Craig Macdonald |
Vinod Kumar Vavilapalli |
| HADOOP-3958 |
TestMapRed ignores failures of the test case |
Major |
test |
Owen O’Malley |
Owen O’Malley |
| HADOOP-3957 |
Fix javac warnings in DistCp and the corresponding tests |
Minor |
. |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-3954 |
Skip records enabled as default. |
Critical |
. |
Koji Noguchi |
Sharad Agarwal |
| HADOOP-3952 |
TestDataJoin references dfs.MiniDFSCluster instead of hdfs.MiniDFSCluster |
Major |
test |
Owen O’Malley |
Owen O’Malley |
| HADOOP-3951 |
The package name used in FSNamesystem is incorrect |
Trivial |
. |
Tsz Wo Nicholas Sze |
Chris Douglas |
| HADOOP-3950 |
TestMapRed and TestMiniMRDFSSort failed on trunk |
Major |
test |
Tsz Wo Nicholas Sze |
Enis Soztutar |
| HADOOP-3949 |
javadoc warnings: Multiple sources of package comments found for package |
Major |
build, documentation |
Tsz Wo Nicholas Sze |
Jerome Boulon |
| HADOOP-3946 |
TestMapRed fails on trunk |
Blocker |
test |
Amareshwari Sriramadasu |
Tom White |
| HADOOP-3937 |
Job history may get disabled due to overly long job names |
Major |
. |
Matei Zaharia |
Matei Zaharia |
| HADOOP-3933 |
DataNode’s BlockSender sends more data than necessary |
Minor |
. |
Ning Li |
Ning Li |
| HADOOP-3919 |
hadoop conf got slightly mangled by 3772 |
Minor |
. |
Ari Rabkin |
Ari Rabkin |
| HADOOP-3910 |
Are ClusterTestDFSNamespaceLogging and ClusterTestDFS still valid tests? |
Minor |
test |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-3907 |
INodeDirectoryWithQuota should be in its own .java file |
Minor |
. |
Steve Loughran |
Tsz Wo Nicholas Sze |
| HADOOP-3904 |
A few tests still using old hdfs package name |
Minor |
test |
Tsz Wo Nicholas Sze |
Tsz Wo Nicholas Sze |
| HADOOP-3875 |
Fix TaskTracker’s heartbeat timer to note the time the hearbeat RPC returned to decide next heartbeat time |
Major |
. |
Arun C Murthy |
Arun C Murthy |
| HADOOP-3864 |
JobTracker lockup due to JobInProgress.initTasks taking significant time for large jobs on large clusters |
Critical |
. |
Arun C Murthy |
Arun C Murthy |
| HADOOP-3863 |
Use a thread-local rather than static ENCODER/DECODER variables in Text for synchronization |
Critical |
. |
Arun C Murthy |
Arun C Murthy |
| HADOOP-3851 |
spelling error in FSNamesystemMetrics log message |
Trivial |
. |
Steve Loughran |
Steve Loughran |
| HADOOP-3848 |
TaskTracker.localizeJob calls getSystemDir for each task rather than caching it |
Major |
. |
Arun C Murthy |
Arun C Murthy |
| HADOOP-3846 |
CreateEditsLog used for benchmark misses creating parent directories |
Minor |
benchmarks |
Lohit Vijayarenu |
Lohit Vijayarenu |
| HADOOP-3836 |
TestMultipleOutputs will fail if it is ran more than one times |
Major |
test |
Tsz Wo Nicholas Sze |
Alejandro Abdelnur |
| HADOOP-3831 |
slow-reading dfs clients do not recover from datanode-write-timeouts |
Major |
. |
Christian Kunz |
Raghu Angadi |
| HADOOP-3820 |
gridmix-env has a syntax error, and wrongly defines USE_REAL_DATASET by default |
Major |
benchmarks |
Arun C Murthy |
Arun C Murthy |
| HADOOP-3819 |
can not get svn revision # at build time if locale is not english |
Minor |
build |
Rong-En Fan |
Rong-En Fan |
| HADOOP-3816 |
KFS changes for faster directory listing |
Minor |
fs |
Sriram Rao |
Sriram Rao |
| HADOOP-3814 |
[HOD] Remove dfs.client.buffer.dir generation, as this is removed in Hadoop 0.19. |
Blocker |
contrib/hod |
Hemanth Yamijala |
Vinod Kumar Vavilapalli |
| HADOOP-3795 |
NameNode does not save image if different dfs.name.dir have different checkpoint stamps |
Major |
. |
Lohit Vijayarenu |
Lohit Vijayarenu |
| HADOOP-3785 |
FileSystem cache should be case-insensitive |
Major |
fs |
Doug Cutting |
Bill de hOra |
| HADOOP-3783 |
“deprecated filesystem name” warning on EC2 |
Minor |
contrib/cloud |
Stuart Sierra |
Tom White |
| HADOOP-3778 |
seek(long) in DFSInputStream should catch socket exception for retry later |
Minor |
. |
Luo Ning |
Luo Ning |
| HADOOP-3777 |
Failure to load native lzo libraries causes job failure |
Major |
. |
Chris Douglas |
Chris Douglas |
| HADOOP-3776 |
NPE in NameNode with unknown blocks |
Blocker |
. |
Raghu Angadi |
Raghu Angadi |
| HADOOP-3773 |
Setting the conf twice in Pipes Submitter |
Trivial |
. |
Koji Noguchi |
Koji Noguchi |
| HADOOP-3756 |
dfs.client.buffer.dir isn’t used in hdfs, but it’s still in conf/hadoop-default.xml |
Trivial |
. |
Michael Bieniosek |
Raghu Angadi |
| HADOOP-3732 |
Block scanner should read block information during initialization. |
Blocker |
. |
Konstantin Shvachko |
Raghu Angadi |
| HADOOP-3728 |
Cannot run more than one instance of examples.SleepJob at the same time. |
Minor |
. |
Brice Arnould |
Brice Arnould |
| HADOOP-3726 |
TestCLI loses exception details on setup/teardown |
Minor |
test |
Steve Loughran |
Steve Loughran |
| HADOOP-3725 |
TestMiniMRMapRedDebugScript loses exception details |
Minor |
test |
Steve Loughran |
Steve Loughran |
| HADOOP-3723 |
libhdfs only accepts O_WRONLY and O_RDONLY so does not accept things like O_WRONLY | O_CREAT |
Minor |
. |
Pete Wyckoff |
Pi Song |
| HADOOP-3720 |
dfsadmin -refreshNodes should re-read the config file. |
Major |
. |
Lohit Vijayarenu |
Lohit Vijayarenu |
| HADOOP-3711 |
Streaming input is not parsed properly to find the separator |
Major |
. |
Amareshwari Sriramadasu |
Amareshwari Sriramadasu |
| HADOOP-3705 |
CompositeInputFormat is unable to parse InputFormat classes with names containing ‘_’ or ‘$’ |
Major |
. |
Jingkei Ly |
Chris Douglas |
| HADOOP-3658 |
Incorrect destination IP logged for receiving blocks |
Minor |
. |
Koji Noguchi |
Chris Douglas |
| HADOOP-3643 |
jobtasks.jsp when called for running tasks should ignore completed TIPs |
Major |
. |
Amar Kamat |
Amar Kamat |
| HADOOP-3640 |
NativeS3FsInputStream read() method for reading a single byte is incorrect |
Major |
fs/s3 |
Tom White |
Tom White |
| HADOOP-3623 |
LeaseManager needs refactoring. |
Major |
. |
Konstantin Shvachko |
Tsz Wo Nicholas Sze |
| HADOOP-3592 |
org.apache.hadoop.fs.FileUtil.copy() will leak input streams if the destination can’t be opened |
Minor |
fs |
Steve Loughran |
Bill de hOra |
| HADOOP-3570 |
Including user specified jar files in the client side classpath path in Hadoop 0.17 streaming |
Major |
. |
Suhas Gogate |
Sharad Agarwal |
| HADOOP-3560 |
Archvies sometimes create empty part files. |
Blocker |
. |
Mahadev konar |
Mahadev konar |
| HADOOP-3543 |
Need to increment the year field for the copyright notice |
Trivial |
documentation |
Chris Douglas |
Chris Douglas |
| HADOOP-3542 |
Hadoop archives should not create _logs file in the final archive directory. |
Blocker |
. |
Mahadev konar |
Mahadev konar |
| HADOOP-3528 |
Metrics FilesCreated and files_deleted metrics do not match. |
Blocker |
metrics |
Lohit Vijayarenu |
Lohit Vijayarenu |
| HADOOP-3506 |
Occasional NPE in Jets3tFileSystemStore |
Major |
fs/s3 |
Robert |
Tom White |
| HADOOP-3488 |
the rsync command in hadoop-daemon.sh also rsync the logs folder from the master, what deletes the datanode / tasktracker log files. |
Critical |
scripts |
Stefan Groschupf |
Craig Macdonald |
| HADOOP-3319 |
[HOD]checknodes prints errors messages on stdout |
Major |
contrib/hod |
Vinod Kumar Vavilapalli |
Vinod Kumar Vavilapalli |
| HADOOP-3155 |
reducers stuck at shuffling |
Blocker |
. |
Runping Qi |
dhruba borthakur |
| HADOOP-3131 |
enabling BLOCK compression for map outputs breaks the reduce progress counters |
Major |
. |
Colin Evans |
Matei Zaharia |
| HADOOP-3076 |
[HOD] If a cluster directory is specified as a relative path, an existing script.exitcode file will not be deleted. |
Blocker |
contrib/hod |
Hemanth Yamijala |
Vinod Kumar Vavilapalli |
| HADOOP-2403 |
JobHistory log files contain data that cannot be parsed by org.apache.hadoop.mapred.JobHistory |
Critical |
. |
Runping Qi |
Amareshwari Sriramadasu |
| HADOOP-2168 |
Pipes with a C++ record reader does not update progress in the map until it is 100% |
Major |
. |
Owen O’Malley |
Arun C Murthy |
| HADOOP-1945 |
pipes examples aren’t in the release |
Major |
. |
Owen O’Malley |
Owen O’Malley |
| HADOOP-9 |
mapred.local.dir temp dir. space allocation limited by smallest area |
Minor |
. |
Paul Baclace |
Ari Rabkin |


{% import 'macros.html' as macro%} {% extends 'base.html'%} {% block content %}
Writing, to me, is simply thinking through my fingers.~Isaac Asimov
{{ quotes.quote }}


|
gtsam
4.0.0
gtsam
|
An equality factor that forces either one variable to a constant, or a set of variables to be equal to each other.
Depending on flag, throws an error at linearization if the constraints are not met.
Switchable implementation:
Standard Constructors | |
| NonlinearEquality (Key j, const T &feasible, const CompareFunction &_compare=boost::bind(traits< T >::Equals, _1, _2, 1e-9)) | |
| Constructor - forces exact evaluation. | |
| NonlinearEquality (Key j, const T &feasible, double error_gain, const CompareFunction &_compare=boost::bind(traits< T >::Equals, _1, _2, 1e-9)) | |
| Constructor - allows inexact evaluation. | |
Testable | |
| virtual void | print (const std::string &s="", const KeyFormatter &keyFormatter=DefaultKeyFormatter) const |
| Print. | |
| virtual bool | equals (const NonlinearFactor &f, double tol=1e-9) const |
| Check if two factors are equal. | |
Standard Interface | |
| virtual double | error (const Values &c) const |
| actual error function calculation | |
| Vector | evaluateError (const T &xj, boost::optional< Matrix & > H=boost::none) const |
| error function | |
| virtual GaussianFactor::shared_ptr | linearize (const Values &x) const |
| linearize to a GaussianFactor | |
| virtual gtsam::NonlinearFactor::shared_ptr | clone () const |
Public Member Functions | |
| NonlinearEquality () | |
| default constructor - only for serialization | |
| Public Member Functions inherited from gtsam::NoiseModelFactor1< VALUE > | |
| NoiseModelFactor1 () | |
| Default constructor for I/O only. | |
| Key | key () const |
| NoiseModelFactor1 (const SharedNoiseModel &noiseModel, Key key1) | |
| Constructor. More... | |
| virtual Vector | unwhitenedError (const Values &x, boost::optional< std::vector< Matrix > & > H=boost::none) const |
| Calls the 1-key specific version of evaluateError, which is pure virtual so must be implemented in the derived class. | |
Public Attributes | |
| CompareFunction | compare_ |
Public Types | |
| typedef VALUE | T |
| typedef boost::function< bool(const T &, const T &)> | CompareFunction |
| Function that compares two values. | |
| Public Types inherited from gtsam::NoiseModelFactor1< VALUE > | |
| typedef VALUE | X |
Friends | |
| class | boost::serialization::access |
| Serialization function. | |
Additional Inherited Members | |
| Protected Types inherited from gtsam::NoiseModelFactor1< VALUE > | |
| typedef NoiseModelFactor | Base |
| typedef NoiseModelFactor1< VALUE > | This |
|
inlinevirtual |
Reimplemented from gtsam::NonlinearFactor.


-
furniture
big black chair
$99
-
decoration
bright wall clock
$89
-
special
vifa
speaker$49 $89
-
Just use coupon code 60 WINTER for getting your discount.
-
decoration
stewie floor lamp
$99
-
furniture
classic chair
$299
-
furniture
sheep bench felt
$199
-
electronics
vifa loudspeaker
$499
-
lighting
muuto lamp
$99
Subscribe to get update


For all your education rather it be school, under-graduate studies or professional courses, Loan available upto 1 crore(~7.3% per annum to 16% per annum interest rate)


{% extends "main.html" %} {% block content %}
{{user_info['name']}}... Are you sure you want to delete this item?


Hello there !
ShroomBot is a Discord Bot that can show League of Legends player's stats, the weekly rotation, and a few other things.
Example commands
- -help - available commands
- -getinfo $(summoner) $(region) - summoner information
- -rotation - the weekly rotation
- -quote - a random Teemo quote


LocalStorage =
Interacts with HTML5's localStorage
.
LocalStorage =
Retrieve data from localStorage.
get: ->
window.localStorage.getItem @key
set: (value) ->
window.localStorage.setItem @key, value
Clear data from localStorage.
clear: ->
window.localStorage.removeItem @key
Interacts with the browser's cookies.
Cookie =
Retrieve data from cookies.
get: ->
key = "#{@key}="
for cookiePart in document.cookie.split /;\s*/
if cookiePart.indexOf(key) is 0
return cookiePart.substring key.length
Save data to a cookie.
value
(String)
options
Optional (Object): Only used for deleting cookies by writing
them with an expiration time in the past.
set: (value, options = {expires: ''}) ->
unless options.expires
date = new Date
date.setTime(date.getTime() + (365 * 24 * 60 * 60 * 1000))
options.expires = "expires=" + date.toGMTString()
document.cookie = "#{@key}=#{value}; #{options.expires}; path=/"
Clear a cookie.
clear: ->
Cookie.set @key, '', {expires: -1}
Wrapper for interacting with the Kissmetrics API with logged out users. The
only difference from KissmetricsClient
is that an identifier for the user
will be automatically created and saved in their browser.
apiKey
(String): Your Kissmetrics API key
options
Optional (Object):
storage
: Specify which internal engine you want to
use: 'localStorage'
or 'cookie'
. Default is 'localStorage'
storageKey
: Specify what key you want the assigned ID to be
stored under. Default is 'kissmetricsAnon'
km = new AnonKissmetricsClient(API_KEY, {
storage: 'cookie',
storageKey: 'myKissmetricsAnon'
})
km.record('Visited signup form')
class AnonKissmetricsClient extends KissmetricsClient
constructor: (apiKey, options = {}) ->
@_storage =
if options.storage
switch options.storage
when 'cookie' then Cookie
when 'localStorage' then LocalStorage
else
if window.localStorage then LocalStorage else Cookie
@_storage.key = options.storageKey || 'kissmetricsAnon'
unless person = @_storage.get()
person = @createID()
@_storage.set person
super apiKey, person
createID: ->
parts = for x in [0..10]
(((1 + Math.random()) * 0x10000) | 0).toString(16).substring(1)
parts.join ''
Identify the current user and (by default) delete the logged out identifier that was stored.
newIdentity
(String): A new identifier to map to the @person
set on
the current instance.
deleteStoredID
Optional (Boolean): Whether or not to delete the
logged-out identity that was stored. Default true
.
<EMAIL_ADDRESS>false)
<EMAIL_ADDRESS>alias: (newIdentity, deleteStoredID = true) ->
@_storage.clear() unless deleteStoredID is off
super newIdentity
Make AnonKissmetricsClient
available as a property
on the current context in the browser.
@AnonKissmetricsClient = AnonKissmetricsClient unless NODEJS is on


AWS::FSx::FileSystem
The
AWS::FSx::FileSystem
resource creates a new Amazon FSx file system. You must specify the type Amazon FSx
file system to create, Microsoft Windows (WindowsConfiguration)
or Lustre (LustreConfiguration). For more information, see
CreateFileSystem in the Amazon FSx API Reference.
Syntax
To declare this entity in your AWS CloudFormation template, use the following syntax.
JSON
{ "Type" : "AWS::FSx::FileSystem", "Properties" : { "BackupId" :
String
, "FileSystemType" :String
, "KmsKeyId" :String
, "LustreConfiguration" : LustreConfiguration, "SecurityGroupIds" : [String
, ... ], "StorageCapacity" :Integer
, "SubnetIds" : [String
, ... ], "Tags" : [ Resource Tag, ... ], "WindowsConfiguration" : WindowsConfiguration } }
YAML
Type: "AWS::FSx::FileSystem" Properties: BackupId:
String
FileSystemType:String
KmsKeyId:String
LustreConfiguration: LustreConfiguration SecurityGroupIds: -String
StorageCapacity:Integer
SubnetIds: -String
Tags: - Resource Tag WindowsConfiguration: WindowsConfiguration
Properties
BackupId
-
The ID of the backup of an Amazon FSx for Windows File Server file system. For more information, see CreateBackup in the Amazon FSx API Reference.
Required: No
Type: String
Update requires: Replacement
FileSystemType
-
The type of file system. For more information, see FileSystem in the Amazon FSx API Reference.
Required: No
Type: String
Update requires: Replacement
KmsKeyId
-
The ID of the AWS Key Management Service (AWS KMS) key used to encrypt the file system's data for an Amazon FSx for Windows File Server file system. For more information, see CreateFileSystem in the Amazon FSx API Reference.
Required: No
Type: String
Update requires: Replacement
LustreConfiguration
-
The configuration for the Amazon FSx for Lustre file system. For more information, see LustreFileSystemConfiguration in the Amazon FSx API Reference.
Required: No
Type: LustreConfiguration
Update requires: No interruption
SecurityGroupIds
-
A list of IDs for the security groups that apply to the specified network interfaces created for file system access. These security groups apply to all network interfaces. This list isn't returned in later describe requests.
Required: No
Type: List of String values
Update requires: Replacement
StorageCapacity
-
The storage capacity of the file system. For Windows file systems, the storage capacity has a minimum of 300 GiB, and a maximum of 65,536 GiB. For Lustre file systems, the storage capacity has a minimum of 3,600 GiB, and is provisioned in increments of 3,600 GiB. For more information, see StorageCapacity in the Amazon FSx API Reference.
Required: No
Type: Integer
Update requires: Replacement
SubnetIds
-
A list of IDs for the subnets that the file system will be accessible from. File systems support only one subnet. The file server is also launched in that subnet's Availability Zone. For more information, see SubnetIds in the Amazon FSx API Reference.
Required: No
Type: List of String values
Update requires: Replacement
Tags
-
The tags to be applied to the file system at file system creation. The key value of the
Name
tag appears in the console as the file system name. For more information, see Tags in the Amazon FSx API Reference.Required: No
Type: List of Resource Tag property types
Update requires: No interruption
WindowsConfiguration
-
The configuration for a Microsoft Windows file system. For more information, see WindowsFileSystemConfiguration in the Amazon FSx API Reference.
Required: No
Type: WindowsConfiguration
Update requires: No interruption
Return Values
Ref
When you pass the logical ID of an
AWS::FSx::FileSystem
resource to the intrinsic
Ref
function, the function returns the file system resource ID, such as
fs-0d33333e999a7c66g
.
For more information about using the
Ref
function, see
Ref.
Examples
Create an Amazon FSx for Lustre File System
The following examples create an Amazon FSx for Lustre file system.
JSON
{ "Resources": { "BasicS3LinkedLustreFileSystem": { "Type": "AWS::FSx::FileSystem", "Properties": { "FileSystemType": "LUSTRE", "StorageCapacity": 3600, "SubnetIds": [ null ], "SecurityGroupIds": [ null ], "Tags": [ { "Key": "Name", "Value": "s3linkedLustre" }, { "Key": "StorageCapacity", "Value": "3600GB" } ], "LustreConfiguration": { "ImportPath": null, "ExportPath": null, "WeeklyMaintenanceStartTime": "2:20:30" } } } }, "Outputs": { "FileSystemId": { "Value": null } } }
YAML
Resources: BasicS3LinkedLustreFileSystem: Type: AWS::FSx::FileSystem Properties: FileSystemType: "LUSTRE" StorageCapacity: 3600 SubnetIds: [!ImportValue CustomerPublicSubnet01] SecurityGroupIds: [!ImportValue LustreIngressSecurityGroupId] Tags: - Key: "Name" Value: "s3linkedLustre" - Key: "StorageCapacity" Value: "3600GB" LustreConfiguration: ImportPath: !Join ["", ["s3://", !ImportValue LustreCFNTestS3ImportBucketName]] ExportPath: !Join ["", ["s3://", !ImportValue LustreCFNTestS3ImportBucketName]] WeeklyMaintenanceStartTime: "2:20:30" Outputs: FileSystemId: Value: !Ref BasicS3LinkedLustreFileSystemOutputs: FileSystemId: Value: !Ref BasicS3LinkedLustreFileSystem
Create an Amazon FSx for Windows File Server File System
The following examples create an Amazon FSx for Windows File Server file system.
JSON
{ "Resources": { "WindowsFileSystemWithAllConfigs": { "Type": "AWS::FSx::FileSystem", "Properties": { "FileSystemType": "WINDOWS", "StorageCapacity": 300, "SubnetIds": [ null ], "SecurityGroupIds": [ null ], "Tags": [ { "Key": "Name", "Value": "windows" }, { "Key": "ThroughputCapacity", "Value": "16" } ], "WindowsConfiguration": { "ActiveDirectoryId": null, "ThroughputCapacity": 8, "WeeklyMaintenanceStartTime": "4:16:30", "DailyAutomaticBackupStartTime": "01:00", "AutomaticBackupRetentionDays": 2, "CopyTagsToBackups": false } } } }, "Outputs": { "FileSystemId": { "Value": null } } }
YAML
Resources: WindowsFileSystemWithAllConfigs: Type: "AWS::FSx::FileSystem" Properties: FileSystemType: "WINDOWS" StorageCapacity: 300 SubnetIds: [!ImportValue CustomerPublicSubnet01] SecurityGroupIds: [!ImportValue LustreIngressSecurityGroupId] Tags: - Key: "Name" Value: "windows" - Key: "ThroughputCapacity" Value: "16" WindowsConfiguration: ActiveDirectoryId: !ImportValue CustomerDirectoryServiceId ThroughputCapacity: 8 WeeklyMaintenanceStartTime: "4:16:30" DailyAutomaticBackupStartTime: "01:00" AutomaticBackupRetentionDays: 2 CopyTagsToBackups: false Outputs: FileSystemId: Value: !Ref WindowsFileSystemWithAllConfigs


Last Name
First Name
Address
City
State
Zip/Postal Code
Country
Bulgaria
United States of America
Russia
United Kingdom
Нема такава държава!
Phone (country code, area code, number)
(+
)
-
E-mail
Birth date
Month
Day
Year(4 digit)
Gender
Male
Female
Unknown
Starting date
Spring 2006
Summer 2006
Comments/Questions


Additional Visuals
Clouds
Wind
Temperature
Humidity
Latitude versus Wind
Generally speaking, areas that fall in a higher latitude have higher wind speeds.
Wind by Latitude
Explore Other Visuals


FIFA21
Nintendo Switch PS4 Xbox One
FIFA 21 is a football simulation video game published by
Electronic Arts as part of the FIFA series.[1] It is the 28th
installment in the FIFA series, and was released 9 October 2020
for Microsoft Windows, Nintendo Switch, PlayStation 4 and Xbox
One. Enhanced versions for the PlayStation 5 and Xbox Series X and
Series S were released on 3 December 2020, in addition to a
version for Stadia.


--- layout: default title: IRC SSL/TLS Statistics ---
This is a set of statistics retrieved from various IRC networks. How many networks were queried is shown. These stats do not represent every IRC network out there, just the ones we've been able to scan.
Statistics are often misleading and can be used to push agendas based on how they are presented. The statistics here ARE NOT normalised or weighted based on user count, and we DO NOT filter out networks with very low numbers of users.
These stats present a misleading picture of the IRC software and features typically encountered by users because they are presented based only on sheer number of instances. Adding weighting and filtering based on user count is planned, but hasn't been implemented yet simply due to time.
Don't trust these statistics. Don't trust ANY IRC statistics unless you can see exactly how they are weighted / processed, and experiment with how weighting and filtering based on user counts and other metrics changes the stats to give you a more complete picture of them.
This site is a WORK IN PROGRESS and will be updated as the statistics collection and display is improved. These statistics should not be used in anything other than curiosity's sake at this point.
Last Updated: {{ site.data.ssltls.PrettyTime }}
Networks: {{ site.data.ssltls.Connections }}
These are the primary SSL/TLS ports that networks present to users. In order, the default ports we check are {% for port in site.data.ssltls.PortCheckOrder %}{{port}}{% if forloop.last == false %}, {% endif %}{% endfor %}.
For a network to count as 'verified', the certificate they present must be signed by a trusted CA, and the client must be able to verify it for the hostname they are connecting from. The failures in this test represent self-signed certs, expired certs, and servers that did not present a certificate for their actual hostname (say, for the round-robin DNS address clients use).


Status
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented


Hi, this is Momo. I am an international student from China. This is my senior year in San Francisco State University. I am very passionate about new challenges, probably that's reason why I pick Computer Science as a major. My biggest goal is to build something that can benefit everybody in the future. During my spare time, I am a huge fan of outdoor activities, such as camping, hiking, skiing and photographing. Thanks for visiting my page. Cheers!


SELFIE
HEALTHY HAIR
Hairstyles
Hairdressers
Tutorials
Before/After Shots
SAY CHEESE!
HAIRSTYLES
HAIRDRESSERS
TUTORIALS
BEFORE/AFTER SHOTS
Photos for before and after your Selfie Healthy Hair makeover!
Twitter
Pinterest
Instagram
Facebook


A summer reading group for Foundations of Data Science (download link).
Guidelines
Every two weeks we will cover 40 pages. You can always post questions and have discussion on reddit (r/summerds) or slack, but to be considered an active participant you will need to complete the following:
- Submit 10 questions related to the reading.
- Answer 2 questions that were posted for the last session.
Both of these tasks should be complete by the end of the session. Both your questions and answers will be posted publically and need to be unique. As you can post them at any time after the session begins, it is advantageous to post them early since you may have collisions with other participants. More than one person may answer the same question as long as the answers are reasonably distinct.
There will be in-person discussion at least once a session. In order to join, you must have been an active participant in the ongoing or previous session.
Online Forum and Discussion
The primary source for new announcement and online discussion will be hosted on zulip.
There's also a dedicated subreddit for discussion that is better suited for a forum-like format.


SUICIDE KINGS A film review by Matt Williams
RATING: * 1/2* out of * * * *
Kidnapping thrillers seem to be the rage these days, and Suicide Kings is a film that's so eager to join the trend that it has not just one, but two! But more doesn't necessarily equate to better, and the only thing that holds the film together is a rock solid performance by Christopher Walken.
Rich student Avery Chasten (Henry Thomas) has a problem that his friends are trying to help him solve. His sister, Lisa (Laura T. Harris), has been kidnapped by some goons who are demanding $2 million in ransom. Avery's dad doesn't have that kind of liquid cash, so Avery's pal Brett Campbell (Jay Mohr) has come up with this brilliant scheme: kidnap mafia don Charlie Barrett (Christopher Walken), aka Carlo Bartolucci, and force him to pay the ransom.
Assisting Avery and Brett in this crime are Lisa's boyfriend Max Minot (Sean Patrick Flannery), med student T.K. (Jeremy Sisto), and the constantly worrying Ira Reder (Johnny Galecki). Meanwhile, Charlie's hitman/driver Lono (Denis Leary) is on his boss' trail.
The first thing that jumps out at you about Suicide Kings is its ridiculous premise. What type of brain-dead scheme is this? I mean, are we supposed to believe that the characters fully expect Charlie to pay $2 million and forget about it? True, this is supposed to be a last-ditch effort, but the "Suicide" in the title would be a simpler way out.
But, incredulous premise aside, Suicide Kings hums when Christopher Walken is onscreen. Even though he spends most of the movie taped to a chair, he's still the strongest presence in the room. The mental games he plays with his five kidnappers are intensely interesting, and nearly make the movie worthwhile.
Of the five kidnappers, the only one who nearly holds his own against Walken is, surprisingly, Jay Mohr (if only he launched into his superb Walken impersonation...). That's not to say that the other four do a bad job, but they all seem to wither when next to an actor of Walken's caliber.
Unfortunately, the movie retreats from its main story too often. Each character seemingly has one story to tell, and as the movie mechanically plods along, he tells it (usually in some sort of contrived one-on-one with Charlie). But not one of these digressions is either entertaining or interesting. Even the usually lively Denis Leary is subdued and bland in his wandering subplot (which never makes that much sense).
The film's climax does contain a few good twists, but nothing an observant viewer shouldn't expect. However, the ultimate resolution of those twists is disappointing.
"Disappointing" is a word that is apt to describe the whole film as well. Walken gives a terrific performance, and it's too bad he's duct taped to the rest of the film like Charlie to the chair.
Copyright 1998 Matt Williams
- Matt Williams<EMAIL_ADDRESS>Reviewer for Cinematter: http://www.cinematter.com Home of over 500 reviews, and information on over 600 upcoming releases
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


RT @scalzi: When iTunes tells me I don't have sufficient privileges to install it, I think Apple's taken its snob level a bit too far.
8/20/2010, 9:41:28 AM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @scalzi: When iTunes tells me I don't have sufficient privileges to install it, I think Apple's taken its snob level a bit too far.
8/20/2010, 9:41:28 AM
Favs: 0
Retweets: 0
link


HTML Checker
Home Page
HTML Checker
Information
Error/Warning (click for more info)
Lines
Image element does not have alt attribute
Image element has title attribute but not alt attribute
Image element has empty alt attribute
Anchor element does not have href attribute but has action-oriented label
Anchor element links to current page but not a separate section
Anchor element is of a button class
Text element has action-oriented label
Check
Paste your HTML in the box below, then press check!


Preparation time
over 2 hours
Cooking time
10 to 30 mins
Serves
Makes 12 pastries
Dietary
It's time to show off your baking chops with a trayful of warm chocolate pastries.
Equipment and preparation: for this recipe you will need a freestanding mixer with a dough hook.
Stir together the yeast and 125ml/4fl oz lukewarm water in the bowl of a freestanding mixer, fitted with a dough hook. Allow the yeast to dissolve for five minutes.
Add the flour, milk, sugar, melted butter and salt, and mix on medium speed for two minutes.
Remove the dough from the bowl, shape into a ball, wrap in cling film and set aside to rest for 20 minutes.
Dust the work surface lightly with flour. Unwrap the dough and roll into a rectangle roughly 25x38cm/10x15in, cover with a clean tea towel and allow to rise for 30 minutes.
Dot the rectangle with half of the softened butter. Fold the top third of the rectangle down onto the middle, then fold the bottom third up, so the pastry is folded in thirds. Roll out into a rectangle again, fold into thirds again, cover with cling film and place in fridge for 40 minutes.
Remove the dough from the fridge, roll it out to a rectangle as before and dot with the remaining butter. Fold into thirds, roll out again and fold into thirds again. Refrigerate for another 40 minutes.
For the pear and chocolate filling, place the chopped pear in a pan with the sugar. Cook over a medium heat for about 20-30 minutes, or until the pear is soft and sticky.
Roll out the dough, and cut into 12 equal squares, spread the pear onto the top third of each square and top with the chocolate.
Fold the top third of each square over, to enclose the pear and chocolate filling, then roll the filled pastry over onto the lower third. Place seam-side down on two baking trays lined with non-stick baking paper. Cover with cling film and allow to rise for 40 minutes.
Preheat the oven to 200C/400F/Gas 6.
Brush the pastries with the beaten egg and milk mixture and place in the oven for 12-14 minutes, or until golden-brown.
Transfer to a wire rack to cool slightly, then eat warm.


Louisiana government computers knocked out after ransomware attack
BATON ROUGE: Louisiana state government computers were knocked out following a ransomware attack, the governor said on Monday (Nov 18), as results from the close gubernatorial election in the southern state await certification.
Many state agencies had their servers taken down in response to the attack, Governor John Bel Edwards said in a series of messages posted to Twitter. He said the agencies were coming back online but that full restoration could take "several days."
"There is no anticipated data loss and the state did not pay a ransom," he said. Ransomware works by scrambling data held on vulnerable computers and demanding a payment to unlock it.
Louisiana Secretary of State spokesman Tyler Brey said that while his office's website was briefly offline, the tallying of Saturday's vote, in which Bel Edwards narrowly won re-election, was unaffected.
The vote drew national attention following US President Donald Trump's well-publicized endorsement of Bel Edward's Republican challenger, Eddie Rispone.
Louisiana's candidates have until next week to contest the results and ask for a recount.
A person familiar with the matter identified the particular breed of ransomware that struck Louisiana as Ryuk, a variant that cybersecurity firms first identified in August of last year.
Kimberly Goody, a cybercrime analyst at FireEye, said Ryuk had been tied to financially motivated criminals and that its operators typically extorted more than US$300,000 at a time, with some ransoms reaching into the millions of dollars.
Louisiana is one of a long list of local jurisdictions that have been bedeviled by ransomware attacks. The state made headlines in July after it declared a state of emergency following an outbreak that disrupted several school districts.
The state has also drawn criticism for its failure to implement a paper audit of its voting machines.
Messages seeking comment from Louisiana's Division of Administration and the Louisiana branches of the Democratic and Republican parties were not immediately returned.


| DOSE: |
8.0 mg |
oral |
2C-P |
(powder / crystals) |
I started off with 16 mg. My boyfriend (R) had taken 16mg with a very intense trip, and considering I usually have harder trips than others I decided to split the dose with him, each of us taking 8 mgs. We took it at night, which may have been the first mistake, as I soon learned what a wonderful thing the sun is. The come up started when we were in the basement. Everything started moving, everything.
We then proceeded over to his dorm.  When we got there we decided making out was the appropriate move. However 2c-p links the body and mind on very psychological levels. I believed that he was grape juice and I a cup and that he was pouring into me. I then thought my skin was the night sky and that I was covered in stars. Then that I was Cleopatra and could travel to Africa (located on my hip) by simply turning around. I felt very connected to women in history. All the while rings of electricity were singing up my body, and I had to pause to breathe.
I think the trip would have gone better, except that his roommate and roommate’s girlfriend were both asleep in the room, their presence making me uncomfortable. Knowing that R had had a difficult trip before with this drug, I started to worry about him. It seemed like he kept leaving the room, but I'm still foggy on that. I do remember suddenly being stricken with fear because I didn't believe it was R that was kissing me. I worried because it seemed that like I could be anyone so could he and that the person I had known had left leaving an animalistic man in his wake. When I looked into his eyes, it was as if he was a different person or not a person at all.
A tad later I ended up alone on the bed, and because it is lofted thought the ceiling was coming done on me. I got down close to the mattress, terrified of the ceiling. R came back, but because I was still unsure it was him I didn't really trust him that the ceiling wasn't getting closer. According to him I sat there in silence for some time. Apparently I slept.
The next day (a few hours later) I was very cautious. I looked out the window for some time captivated by the math and beauty involved with the natural world. I talked very little to the guys, because while they played video games it was as if they spoke in square language while I spoke in circle language. I toyed with the idea of becoming nihilistic, and stood outside in the rain and wind with a black umbrella, and that seemed to bring back my senses, though some things still trigger those intense feelings, such as the shirt R was wearing, other 2cs, and the basement walls.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Match Report
Live from 7pm
In the first episode of the year, we watch some sports.
Having problems with the livestream? Visit the help page.
In the first episode of the year, we watch some sports.
Having problems with the livestream? Visit the help page.