RAMBO (Brooklyn)




RAMBO (um acrônimo para "Right After the Manhattan Bridge Overpass"[1][2][3]) é um pequeno bairro na zona central da borough de Brooklyn em Nova Iorque. O bairro é limitado pela Flatbush Avenue Extension a oeste, pela Tillary Street ao sul e pela Brooklyn-Queens Expressway (BQE) ao norte e ao leste. A região é conhecida também por razões históricas[4] e no planejamento da cidade[5] como "Bridge Plaza". RAMBO foi parte de Vinegar Hill até a década de 1950, quando a construção da BQP se iniciou.



Referências |





  1. ↑ «In RAMBO, Free to Be You and Me». curbed.com. 16 de fevereiro de 2006. Consultado em 4 de novembro de 2007 


  2. ↑
    Cohen, Ariella (18 de agosto de 2007). «Downtown going Williamsburg». The Brooklyn Paper. Consultado em 4 de novembro de 2007 


  3. ↑
    Weinstein, Robert (March-April, 2008). «'Flattery' will get you somewhere». Brooklyn Boom. Consultado em 6 de janeiro de 2009  Verifique data em: |data= (ajuda)


  4. ↑ «'MANUFACTURING CENTRE CREATED AT MANHATTAN BRIDGE PLAZA IN BROOKLYN». The New York Times. 23 de dezembro de 1917. p. 31. Consultado em 6 de janeiro de 2009 


  5. ↑ «Bridge Plaza Rezoning Proposal». New York City Department of City Planning. 19 de agosto de 2003. Consultado em 6 de janeiro de 2009 






Ícone de esboço
Este artigo sobre geografia dos Estados Unidos é um esboço. Você pode ajudar a Wikipédia expandindo-o.

  • v

  • d

  • e












v • e
Bairros do Brooklyn, Nova Iorque, NY


Admiral's Row ·
ATURA ·
Barren Island ·
Bath Beach ·
Bay Ridge ·
Bedford ·
Bedford-Stuyvesant (Bed-Stuy) ·
Bensonhurst ·
Bergen Beach ·
BoCoCa ·
Boerum Hill ·
Borough Park ·
Brighton Beach ·
Brooklyn Heights ·
Brownsville ·
Bushwick ·
Cadman Plaza ·
Canarsie ·
Carroll Gardens ·
City Line ·
Clinton Hill ·
Cobble Hill ·
Coney Island ·
Crown Heights ·
Cypress Hills ·
Ditmas Park ·
Downtown ·
DUMBO ·
Dyker Heights ·
East Flatbush ·
East New York ·
East Williamsburg ·
Farragut ·
Fiske Terrace ·
Flatbush ·
Flatlands ·
Fort Greene ·
Fort Hamilton ·
Fulton Ferry ·
Georgetown ·
Gerritsen Beach ·
Gowanus ·
Gravesend ·
Greenpoint ·
Greenwood Heights ·
Highland Park ·
Homecrest ·
Kensington ·
Little Poland ·
Madison ·
Manhattan Beach ·
Marine Park ·
Midwood ·
Mill Basin ·
Navy Yard ·
New Lots ·
New Utrecht ·
Ocean Hill ·
Ocean Parkway ·
Park Slope ·
Pigtown ·
Plum Beach ·
Prospect Heights ·
Prospect-Lefferts Gardens ·
Prospect Park South ·
RAMBO ·
Red Hook ·
Sea Gate ·
Sheepshead Bay ·
South Brooklyn ·
South Park Slope ·
Starrett City ·
Stuyvesant Heights ·
Sunset Park ·
Vinegar Hill ·
Weeksville ·
White Sands ·
Williamsburg ·
Windsor Terrace ·
Wingate



 The Brooklyn Bridge



-

Popular posts from this blog

Contact image not getting when fetch all contact list from iPhone by CNContact

Image
up vote 0 down vote favorite I know this question already asked but not getting solution. From this code I will get all the information from the contact but image not found when open vcf files on mac os, also not getting when share this file. I use this stackoverflow link here but It's not help full. var contacts = [CNContact]() let keys = [CNContactVCardSerialization.descriptorForRequiredKeys() ] as [Any] let request = CNContactFetchRequest(keysToFetch: keys as! [CNKeyDescriptor]) do { try self.contactStore.enumerateContacts(with: request) { (contact, stop) in // Array containing all unified contacts from everywhere contacts.append(contact) } } catch { print("unable to fetch contacts") } do { let data = try
Read more

count number of partitions of a set with n elements into k subsets

Image
up vote 6 down vote favorite 1 This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k? NOTE->I know this is not the best way to calculate number of partitions that would be DP // A C++ program to count number of partitions // of a set with n elements into k subsets #include<iostream> using namespace std; // Returns count of different partitions of n // elements in k subsets int countP(int n, int k) { // Base cases if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; // S(n+1, k) = k*S(n, k) + S(n, k-1) return k*countP(n-1, k) + countP(n-1, k-1); } // Driver program int ma
Read more

A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

Image
0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{
Read more