The Invisible Internet Project (I2P) is an anonymous network layer (implemented as a mix network) that allows for censorship-resistant, peer-to-peer communication.  Anonymous connections are achieved by encrypting the user's traffic (by using end-to-end encryption), and sending it through a volunteer-run network of roughly 55,000 computers distributed around the world.  Given the high number of possible paths the traffic can transit, a third party watching a full connection is unlikely.  The software that implements this layer is called an "I2P router", and a computer running I2P is called an "I2P node".  I2P is free and open sourced, and is published under multiple licenses.

Technical design
I2P has been beta software since it started in 2003 as a fork of Freenet.  The software's developers emphasize that bugs are likely to occur in the beta version and that peer review has been insufficient to date.  However, they believe the code is now reasonably stable and well-developed, and more exposure can help the development of I2P.

The network is strictly message-based, like IP, but a library is available to allow reliable streaming communication on top of it (similar to Non-blocking IO-based TCP, although from version 0.6, a new Secure Semi-reliable UDP transport is used).  All communication is end-to-end encrypted (in total, four layers of encryption are used when sending a message) through garlic routing, and even the end points ("destinations") are cryptographic identifiers (essentially a pair of public keys), so that neither senders nor recipients of messages need to reveal their IP address to the other side or to third-party observers.

Although many developers had been a part of the Invisible IRC Project (IIP) and Freenet communities,  significant differences exist between their designs and concepts.  IIP was an anonymous centralized IRC server.  Freenet is a censorship-resistant distributed data store.  I2P is an anonymous peer-to-peer distributed communication layer designed to run any traditional internet service (e.g. Usenet, email, IRC, file sharing, Web hosting and HTTP, or Telnet), as well as more traditional distributed applications (e.g. a distributed data store, a web proxy network using Squid, or DNS).

Many developers of I2P are known only under pseudonyms.  While the previous main developer, jrandom, is currently on hiatus, others, such as zzz, killyourtv, and Complication have continued to lead development efforts, and are assisted by numerous contributors.

I2P uses 2048bit ElGamal/AES256/SHA256+Session Tags encryption and Ed25519 EdDSA/ECDSA signatures.

Releases

I2P has had a stable release every six to eight weeks.  Updates are distributed via I2P torrents and are signed by the release manager (generally zzz or str4d).

Funding
On the website it states, that "funding for I2P comes entirely from donations". Admins and managers of the project said, that "the core project itself doesn't take donations". These should instead go to secondary applications or be spent on hiring others, to work on I2P. Support for the onboarding for I2P came from the Open Technology Fund. In contrast to The Tor Project, I2P has "not the financial or legal infrastructure to support a network of exit nodes". The reseed servers, a sort of bootstrap nodes, which connect the user with the initial set of peers to join the I2P-network, should be run by volunteers.

Software

Since I2P is an anonymizing network layer, it is designed so other software can use it for anonymous communication. As such, there are a variety of tools currently available for I2P or in development.

The I2P router is controlled through the router console, which is a web frontend accessed through a web browser.

General networking
 I2PTunnel is an application embedded into I2P that allows arbitrary TCP/IP applications to communicate over I2P by setting up "tunnels" which can be accessed by connecting to pre-determined ports on localhost.
 SAM (Simple Anonymous Messaging) is a protocol which allows a client application written in any programming language to communicate over I2P, by using a socket-based interface to the I2P router.
 BOB (Basic Open Bridge) is a less complex app to router protocol similar to "SAM"
 Orchid Outproxy Tor plugin

Chat
 Any IRC client made for the Internet Relay Chat can work, once connected to the I2P IRC server (on localhost). I2P have the option to create tunnels that are specific for this usage, where certain commands that could de-anonymize the user are filtered out.

File sharing
 Several programs provide BitTorrent functionality for use within the I2P network.  Users cannot connect to non-I2P torrents or peers from within I2P, nor can they connect to I2P torrents or peers from outside I2P. I2PSnark, included in the I2P install package, is a port of the BitTorrent client named Snark. Vuze, formerly known as Azureus, is a BitTorrent client that includes a plugin for I2P, allowing anonymous swarming through this network. This plugin is still in an early stage of development, however it is already fairly stable. I2P-BT is a BitTorrent client for I2P that allows anonymous swarming for file sharing. This client is a modified version of the original BitTorrent 3.4.2 program which runs on MS Windows and most dialects of Unix in a GUI and command-line environment. It was developed by the individual known as 'duck' on I2P in cooperation with 'smeghead'. It is no longer being actively developed; however, there is a small effort to upgrade the I2P-BT client up to par with the BitTorrent 4.0 release. I2PRufus is an I2P port of the Rufus BitTorrent client. Robert (P2P Software) is the most actively maintained I2PRufus fork. XD is a standalone BitTorrent client written in Go.  BiglyBT is a bittorrent client based on Vuze which also allows the use of i2p for downloading/seeding.
  Two Kad network clients exist for the I2P network, iMule and Nachtblitz. iMule (invisible Mule) is a port of eMule for I2P network. iMule has not been developed since 2013. iMule is made for anonymous file sharing. In contrast to other eDonkey clients, iMule only uses the Kademlia for proceeding to connect through I2P network, so no servers are needed. Nachtblitz is a custom client built on the .NET Framework. The latest version is 1.4.27, released on March 23, 2016. Nachtblitz includes a time lock to disable the software one year after its release date.
 I2Phex is a port of the popular Gnutella client Phex to I2P. It is stable and fairly functional.
 Tahoe-LAFS has been ported to I2P. This allows for files to be anonymously stored in Tahoe-LAFS grids.
MuWire is a file-sharing program inspired by the LimeWire Gnutella client that works atop the I2P network.

Bridging to clearnet
Currently, Vuze and BiglyBT are the torrent clients that make clearnet (connections not through I2P) torrents available on I2P and vice versa. Depending on the client settings, torrents from the internet can be made available on I2P (via announcements to I2P's DHT network) and torrents from I2P can be made available to the internet. For this reason, torrents previously published only on I2P can be made available to the entire Internet, and users of I2P can often download popular content from the Internet while maintaining the anonymity of I2P. As of August 2022 the default outproxy is exit.stormycloud.i2p which is run by StormyCloud Inc

Email

 I2P-Bote is a free, fully decentralized and distributed anonymous email system with a strong focus on security. It supports multiple identities and does not expose email metadata. , it is still considered beta software. I2P-Bote is accessible via the I2P web console interface or using standard email protocols (i.e. IMAP/SMTP). All bote-mails are transparently end-to-end encrypted and signed by the sender's private key, thus removing the need for PGP or other email encryption software. I2P-Bote offers additional anonymity by allowing for the use of mail relays with variable length delays. Since it is decentralized, there is no centralized email server that could correlate different email identities as communicating with each other (i.e. profiling). Even the nodes relaying the mails do not know the sender, and apart from sender and receiver, only the end of the high-latency mail route and the storing nodes will know to whom (which I2P-Bote address – the user's IP address is still hidden by I2P) the mail is destined. The original sender could have gone offline long before the email becomes available to the recipient. No account registration is necessary, all you have to do in order to use it is create a new identity. I2P-Bote can be installed as an I2P plugin .
 I2P also has a free pseudonymous e-mail service run by an individual called Postman. Susimail is a web-based email client intended primarily for use with Postman's mail servers, and is designed with security and anonymity in mind. Susimail was created to address privacy concerns in using these servers directly using traditional email clients, such as leaking the user's hostname while communicating with the SMTP server. It is currently included in the default I2P distribution, and can be accessed through the I2P router console web interface. Mail.i2p can contact both I2P email users and public internet email users.
 Bitmessage.ch can be used over I2p

Instant messaging
 I2P-Messenger is a simple Qt-based, serverless, end-to-end-encrypted instant messenger for I2P. No servers can log the user's conversations. No ISP can log with whom the user chats, when, or for how long. As it is serverless, it can make use of I2P's end-to-end encryption, preventing any node between two parties from having access to the plain text. I2P-Messenger can be used for fully anonymous instant communication with persons the user doesn't even know, or, alternatively, to communicate securely and untraceably with friends, family members, or colleagues.  In addition to messaging, file transfer is also supported.

 I2P-Talk is another simple instant messenger incompatible with I2P-Messenger, but having the same security properties

Publishing
 Syndie is a content distribution application, suitable for blogs, newsgroups, forums and small media attachments. Syndie is designed for network resilience. It supports connections to I2P, the Tor network (Syndie does not support Socks proxies, workaround needed for Tor access), Freenet and the regular internet. Server connections are intermittent, and support higher-latency communications. Connections can be made to any number of known servers. Content is spread efficiently using a Gossip protocol.
 Aktie is an anonymous file sharing and distributed Web of trust forums system.  Aktie can connect to I2P with its internal router or use an external router. To fight spam, "hash payments" (proof of CPU work) is computed for every published item.

Routers
 I2PBerry is a Linux distribution which can be used as a router to encrypt and route network traffic through the I2P network.
i2pd is a light-weight I2P router written in C++, stripping the excessive applications such as e-mail, torrents, and others that can be regarded as bloat.
 Kovri is an I2P router written in C++. It was forked from i2pd following developer disagreements. Kovri's primary purpose is to integrate with the cryptocurrency Monero to send new transaction information over I2P, making it much more difficult to find which node is the origin of a transaction request. Those using the Kovri router will be running full I2P routers that contribute to the I2P network the same way the current Java router does. This project is expected to benefit both the Monero and I2P communities, since it will allow for greater privacy in Monero, and it should increase the number of nodes on the I2P network.

The Privacy Solutions project
The Privacy Solutions project, a new organization that develops and maintains I2P software, launched several new development efforts designed to enhance the privacy, security, and anonymity for users, based on I2P protocols and technology.

These efforts include:

 The Abscond browser bundle.
 i2pd, an alternate implementation of I2P, written in C++ (rather than Java).
 The "BigBrother" I2P network monitoring project.

The code repository and download sections for the i2pd and Abscond project is available for the public to review and download.
Effective January, 2015 i2pd is operating under PurpleI2P.

Android

 Release builds of an I2P Router application for Android can be found on the Google Play store under The Privacy Solutions Project's Google Play account or on an F-Droid repository hosted by the developers.
 Nightweb is an Android application that utilizes I2P and Bittorrent to share blog posts, photos, and other similar content. It can also be run as a desktop application. It is no longer in development.

Cryptocurrency
Some cryptocurrencies that support I2P are listed below.

 Bitcoin
 Monero
 Verge

Terminology

 Eepsite Eepsites are websites that are hosted anonymously within the I2P network.  Eepsite names end in .i2p, such as ugha.i2p or forum.i2p. EepProxy can locate these sites through the cryptographic identifier keys stored in the hosts.txt file found within the I2P program directory.  Typically, I2P is required to access these eepsites.
 .i2p 'I2p' is a pseudo-top-level domain which is only valid within the I2P overlay network scope. .i2p names are resolved by browsers by submitting requests to EepProxy which will resolve names to an I2P peer key and will handle data transfers over the I2P network while remaining transparent to the browser.
 EepProxy The EepProxy program handles all communication between the browser and any eepsite.  It functions as a proxy server that can be used by any web browser.
 Peers, I2P nodes Other machines using I2P that are connected to user's machine within the network.  Each machine within the network shares the routing and forwarding of encrypted packets.
 Tunnels Every ten minutes, a connection is established between the user's machine and another peer.  Data to and from the user, along with the data for other peers (routed through the user's machine), pass through these tunnels and are forwarded to their final destination (may include more jumps).
 netDb The distributed hash table (DHT) database based on the Kademlia algorithm that holds information on I2P nodes and I2P eepsites. This database is split up among routers known as "floodfill routers".  When a user wants to know how to contact an eepsite, or where more peers are, they query the database.

Vulnerabilities
Denial of service attacks are possible against websites hosted on the network, though a site operator may secure their site against certain versions of this type of attack to some extent.

A zero-day vulnerability was discovered for I2P in 2014, and was exploited to de-anonymize at least 30,000 users. This included users of the operating system Tails. This vulnerability was later patched.

A 2017 study examining how forensic investigators might exploit vulnerabilities in I2P software to gather useful evidence indicated that a seized machine which had been running I2P router software may hold unencrypted local data that could be useful to law enforcement. Records of which eepsites a user of a later-seized machine was interested in may also be inferred. The study identified a "trusted" I2P domain registrar ("NO.i2p") which appeared to have been abandoned by its administrator, and which the study identified as a potential target for law enforcement takeover. It alternatively suggested waiting for NO.i2p's server to fail, only to social engineer the I2P community into moving to a phony replacement. Another suggestion the study proposed was to register a mirror version of a target website under an identical domain.

I2PCon

From  an I2P convention was held in Toronto, Ontario.  The conference was hosted by a local hackerspace, Hacklab. The conference featured presentations from I2P developers and security researchers.

See also

 Crypto-anarchism
 Deep web
 Darknet
 Garlic routing
 Key-based routing
 Public-key cryptography
 Rendezvous protocol
 Secure communication
 Threat model

Software

 Freenet
 Mixnet
 Retroshare
 Tor
 Tribler
 ZeroNet

References

External links

Anonymity networks
Anonymous file sharing networks
Application layer protocols
Computer networking
Cross-platform free software
Cross-platform software
Cryptographic software
Cryptographic protocols
Dark web
Distributed data storage
Distributed data structures
Distributed data storage systems
Distributed file systems
File sharing
Free and open-source Android software
Free communication software
Free file transfer software
Free file sharing software
Free multilingual software
Free network-related software
Free routing software
Free software programmed in Java (programming language)
Garlic routing
Hash-based data structures
Internet privacy software
Key-based routing
Mix networks
Onion routing
Overlay networks
Peer-to-peer computing
Privacy software
Software using the MIT license
2003 software

I2P


Çok eşlilik veya poligami, bir kimsenin aynı esnada birden fazla kişiyle evli ya da birlikte olmasıdır. Terim çok karılılık (polijini), çok kocalılık (poliandri), eşcinsel çok eşlilik ve grup evliliği durumlarını kapsamakla birlikte -yaygın olması nedeniyle- genellikle polijini ile eşanlamlı olarak kullanılır.

Bazı din ve kültürlerde kabul edilen bir durum olan poligami, pek çok ülkede kanunen suçtur. Poligaminin serbest veya yaygın olduğu ülkelerde ekseriyetle polijini (çok karılılık) görülür. Birleşmiş Milletler; insan haysiyetine ve eşitliğine aykırı olduğu gerekçesiyle, poligaminin engellenmesi için devletler nezdinde çağrıda bulunur.

Sosyobiyoloji ve zooloji terimi olarak çok eşlilik, birden fazla eş ile çiftleşme davranışları için kullanılan genel bir terimdir.

Etimoloji
Türkçeye Fransızca polygamieden geçen kavramın kökeni Yunanca polus (çok) ve gamos (evlilik) sözcükleridir. -jini eki Yunanca gunê (kadın) ve -andri ise andr (erkek) sözcüklerinden gelir.

Yaygınlık
1980 basımı Ethnographic Atlas kitabının listelediği 1,231 toplumdan, 186'sının tek eşli, 453'ünün nadiren polianjik, 588'inin sıkça polianjik ve 4'ünün poliandrik toplumlar olduğunu ortaya koymuştur.  Poliandri sadece Himalayalar'da bulunan dağ toplumlarında gözlemlenmiştir.

Kaynakça

Evlilik
Din ve siyaset
Çiftleşme
Fransızcadan Türkçeye geçen sözcükler

Çok eşlilik


Računalna animacija je animacija napravljena pomoću računala odnosno računalnih programa. Prve su rađene analognim sustavom. Današnje se animacije radi digitalno.

Animacija može biti u dvjema dimenzijama, poput klasične crtane animacije i u trima dimenzijama, s jakom sugestijom voluminoznosti likova i okolnog prizora te njezinom gradiranom animacijom. Primjenjuje se u animiranom filmu (računalni film), za posebne efekte u igranim filmovima, za znanstvene i stručne analize poput športskih.

Športašima je računalo i računalna grafika važno tehničko pomagalo u analizi kretnja športaša i kretnji športskih rekvizita (lopte, loptice, palica, štapova i dr.). Otkriva je li lopta pala na crtu ili izvan nje, je li prešla crtu ili nije. Animacijom se analizira pokrete, uči, vježba, demonstrira i proučava je li se nešto dogodilo ili nije.

Izvori

Vanjske poveznice
IRB Ana Marija Komar: Računalna animacija na Webu
FER Ana Marija Komar: Računalna animacija na Webu
FER Računalna animacija

Računala
Animirani film
Primijenjene umjetnosti
Primijenjene znanosti

Računalna animacija


Omniboro, usa na klase sin hayop na nakuha han iya pagkaon tikang sa magkadurudilain an ginikanan sugad han mga tanaman, igkasi-hayop, algae, fungi ngan pili na mga bakterya.

An tawo ngan baktin amo in mga halimbawa san omniboro.

Mga Kasarigan

Omniboro


Andrew Lepani (28 de agosto de 1979 en Port Moresby) es un futbolista papú que juega como mediocampista o defensor en el Hekari United.

Carrera

Comenzó su carrera futbolística en 2001 jugando para el PS United. En 2003 llegó al Cosmos Port Moresby, donde jugó seis años, hasta que en 2009 el Hekari United lo fichó, ganó con este último la O-League 2010.

Clubes

Selección nacional

Disputó 4 partidos para la selección de  en las eliminatorias a Alemania 2006. Convirtió la misma cantidad de goles. Jugó 8 partidos no oficiales en los que hizo 1 gol.

Referencias

Enlaces externos

Lepani en ceroacero

Personas de Puerto Moresby
Futbolistas de Papúa Nueva Guinea
Futbolistas de Papúa Nueva Guinea en la Copa de las Naciones de la OFC 2012

Futbolistas del Hekari United Football Club

Andrew Lepani


Vigo, İspanya'nın kuzeybatısında bulunan Galiçya özerk bölgesinin Pontevedra ili'ne bağlı bulunan şehri. Vigo Atlas Okyanusu üzerinde derin ve kara içine çok girmiş korunaklı bir körfezde bulunan liman şehridir.

Coğrafi konum

Vigo'nun coğrafi koordinatları 42°14′10″K, 8°43′36″B olur. Şehrin önemli Galiçya Özerk Bölgesi ve İspanya şehirlerinden uzaklıkları şunlardır: Pontevedra: 28 km; Santiago de Compostela: 71 km; Madrid: 596 km. Vigo hemen İspanya-Portekiz sınırında olup büyük Portekiz şehirlerinden uzaklıkları şunlardır - Oporto: 144 km; Lizbon: 452 km

Demografi

Vigo belediye sınırları içinde nüfus (2016 tahmini) itibarıyla 292,817 kişi olup nüfus yoğunluğu 2.700/ kişi/km² olur. Vigo etrafında belediye sınırları dışında şehirleşmiş alan gelişmiş ve kent ve şehirleşmiş varoşlardan bir büyük metropoliten alan oluşmuştur. Bu metropoliten alanın nüfusu tahminen 481,268 kişidir. Vigo belediye sınırları içinde nüfusun gelişmesi şu gösterimde izlenebilir:

1.000 Kişi

Kaynak: INE - Instituto Nacional de Estadística, İspanya
Kaynak:Hollandaca Wikipedia "Vigo" maddesi

Vigo şehri Galiçya'da olup bu bölge İspanyolca'ya yakın fakat kendi özellikleri olan ve "Gallego" adı verilen Galiçyaca dili kullanılma alanıdır. Vigo'da 2008'de yapılan sayıma göre halkın %7'si devamlı olarak Galiçyaca dili kullanmakta; %43'ü devamlı (bazen Castiliano adı verilen) İspanyolca konuşmakta ve diğer kısmı ise hem Galiçyaca hem de İspanyolca'yı değişik zamanlarda değişik olarak kullanmaktadır. Bu istatistiklere göre Vigo şehrinin nüfusunun dil istatistiklerinin diğer Galiçya şehir ve yerleşkelerinden çok gayritipik olduğunu açıkça göstermektedir.

Görülecek yerler

 Casco Vello: Tarihsel eski şehir merkezi
 Porta do Sol, Policarpo Şanz ve Alameda: Modern merkez çarşı sokakları
 Calle Príncipe ve Calle Urzaiz: Modern ticari merkez sokakları
 Castro: Kalıntılar. Keltler ve antik Romalı surlar kalıntıları
 Castro Kalesi: 1665'te Portekiz'le savaşta şehri Portekiz ve müttefiki İngilizler hücumlarından savunmak için yapılmıştır.
 Naturnova Müzesi Çevre sorunları için müze. Çok sayıda etkileşimli sergi bulunur.
 Deniz Müzesi: Yapının tasarımcı mimarları Aldo Rossi ve Cesar Portela.
 Vido Çağdaş Güzel Sanatlar Müzesi Modern ve çağdaş sanat üzerinde tüm İspanya'da isim yapmıştır.
 Castrelos Müzesi.
 Verbum, Casa das palabras: Konuşma, diller ve iletişim konuları üzerine müze. Müze binası tasarımı ünlü Cesar Portela tarafından yapılmıştır.

Kardeş şehirler

Vigo'nun şu kardeş şehirleri bulunmaktadır:

Resimler

Vigo

Kaynakça

Ayrıca bakınız

 Galiçya (özerk topluluk)
 Pontevedra ili

Dış bağlantılar

 Vigo Beldiyesi Resmi İnternet Sitesi

İspanya'daki şehirler

Vigo


Naismith Memorial Basketball Hall of Fame er den officielle hall of fame for sporten basketball, beliggende i byen Springfield i Massachusetts, USA, den by hvor James Naismith i 1891 opfandt sporten. Den blev oprettet i 1959, og hvert år nomineres nye medlemmer til optagelse.

Naismith Memorial Basketball Hall of Fame har over 400 medlemmer, og besøges hvert år af op mod 200.000 gæster. Medlemmerne inkluderer både spillere, trænere og dommere, der har udmærket sig indenfor sporten, samt udvalgte bidragydere, der har været med til at fremme basketballsporten.

Medlemmer

Nedenstående er en fuld liste over de personer, der (pr. 2019) er blevet optaget i Naismith Memorial Hall of Fame, sorteret efter optagelsesår:

2019
 Al Attles, bidragyder
 Carl Braun, spiller
 Chuck Cooper, spiller
 Vlade Divac, spiller
 Bill Fitch, træner
 Bobby Jones, spiller
 Sidney Moncrief, spiller
 Jack Sikma, spiller
 Tennessee A&I Teams Of 1957-59, hold
 Wayland Baptist University Teams Of 1948-82, hold
 Teresa Weatherspoon, spiller
 Paul Westphal, spiller

2018
 Ray Allen, spiller
 Maurice Cheeks, spiller
 Lefty Driesell, træner
 Grant Hill, spiller
 Jason Kidd, spiller
 Steve Nash, spiller
 Tina Thompson, spiller
 Dino Radja, spiller
 Charlie Scott, spiller
 Ora Mae Washington, spiller
 Rod Thorn, bidragyder
 Rick Welts, bidragyder
 Katie Smith, spiller

2017
 Robert Hughes, træner
 Tracy McGrady, spiller
 Bill Self, træner
 Rebecca Lobo, bidragyder
 Muffet McGraw, træner
 Mannie Jackson, bidragyder
 Tom Jernstedt, bidragyder
 Jerry Krause, bidragyder
 Zack Clayton, spiller
 Nick Galis, spiller
 George McGinnis, spiller

2016
 Zelmo Beaty, spiller
 Darell Garretson, dommer
 Allen Iverson, spiller
 Tom Izzo, træner
 John McClendon, træner
 Yao Ming, spiller
 Shaquille O'Neal, spiller
 Cumberland Posey, spiller
 Jerry Reinsdorf, bidragyder
 Sheryl Swoopes, spiller

2015
 Dick Bavetta, dommer
 John Calipari, træner
 Louie Dampier, spiller
 Lindsay Gaze, træner
 Tom Heinsohn, træner
 John Isaacs, spiller
 Lisa Leslie, spiller
 Dikembe Mutombo, spiller
 George Raveling, bidragyder
 Jo Jo White, spiller

2014
 David Stern,bidragyder
 Alonzo Mourning,spiller
 Mitch Richmond, spiller
 Guy Rodgers, spiller
 Sarunas Marciulionis, spiller
 Nolan Richardson, træner
 Gary Williams, træner
 Bob Leonard, træner
 Nat Clifton, bidragyder
 Immaculata University, hold

2013
 Gary Payton, spiller
 Bernard King, spiller
 Roger Brown, spiller
 Rick Pitino, træner
 Sylvia Hatchell, træner
 Dawn Staley, spiller
 Edwin B. Henderson, bidragyder
 Oscar Schmidt, spiller
 Richard Geurin, spiller
 Russ Granik, bidragyder

2012
 Mel Daniels, spiller
 Don Barskdale, bidragyder
 Lidia Aleksejeva, træner
 Chet Walker, spiller
 Phil Knight, bidragyder
 Reggie Miller, spiller
 Don Nelson, træner
 Hank Nichols, dommer
 Ralph Sampson, spiller
 Jamaal Wilkes, spiller
 All-American Red Heads, hold
 Katrina McClain, spiller

2011
 Teresa Edwards, spiller
 Artis Gilmore, spiller
 Herb Magee, træner
 Chris Mullin, spiller
 Dennis Rodman, spiller
 Arvydas Sabonis, spiller
 Tom Sanders, bidragyder
 Goose Tatum, spiller
 Tara Van Derveer, træner
 Tex Winter, træner

2010
 USA' OL-hold 1960, hold
 Dream Team, hold
 Jerry Buss, bidragyder
 Cynthia Cooper-Dyke, spiller
 Bob Hurley, træner
 Dennis Johnson, spiller
 Gus Johnson, spiller
 Karl Malone, spiller
 Maciel Pereira, spiller
 Scottie Pippen, spiller

2009
 Michael Jordan, spiller
 David Robinson, spiller
 Jerry Sloan, træner
 John Stockton, spiller
 C. Vivian Stringer, træner

2008
 Adrian Dantley, spiller
 Bill Davidson, bidragyder
 Patrick Ewing, spiller
 Hakeem Olajuwon, spiller
 Pat Riley, træner'
 Catchy Rush, træner
 Dick Vitale, bidragyder

2007
 Phil Jackson, træner
 Roy Williams, træner
 Texas Western, hold
 Van Chancellor, træner
 Pedro Ferrandiz, træner
 Mirko Novosel, træner
 Mendy Rudolph, dommer

2006
 Charles Barkley, spiller
 Joe Dumars, spiller
 Dominique Wilkins, spiller
 Geno Auriemma, træner
 Sandro Gamba, træner
 Dave Gavitt, bidragyder

2005
 Jim Boeheim, træner
 Hubie Brown, træner
 Jim Calhoun, træner
 Sue Gunter, træner
 Hortencia Marcari, spiller

2004
 Clyde Drexler, spiller
 Jerry Colangelo, bidragyder
 Bill Sharman, træner
 Drazen Dalipagic, spiller
 Maurice Stokes, spiller
 Lynette Woodard, spiller

2003
 Robert Parish, spiller
 James Worthy, spiller
 Dino Meneghin, spiller
 Meadowlark Lemon, bidragyder
 Chick Hearn, bidragyder
 Leon Barmore, træner
 Earl Lloyd, bidragyder

2002
 Magic Johnson, spiller
 Drazen Petrovic, spiller
 Larry Brown, træner
 Harlem Globetrotters, hold
 Lute Olson, træner
 Kay Yow, træner

2001
 Moses Malone, spiller
 Mike Krzyzewski, træner
 John Chaney, træner

2000
 Isiah Thomas, spiller
 Pat Summit, træner
 Bob McAdoo, spiller
 Danny Biasone, bidragyder
 Charles Newton,bidragyder
 Morgan Wooten, træner

1999
 Kevin McHale, spiller
 Wayne Embry, bidragyder
 Billie Moore, træner
 John Thompson, træner
 Fred Zollner, bidragyder

1998
 Larry Bird, spiller
 Lenny Wilkens, træner
 Jody Conradt, træner
 Alex Hannum, træner
 Marques Haynes, spiller
 Aleksandar Nikolic, træner
 Arnie Risen, spiller

1997
 Alex English, spiller
 Pete Carril, træner
 Joan Crawford, spiller
 Denise Curry, spiller
 Antonio Diaz-Miguel, træner
 Don Haskins, træner
 Bailey Howell, spiller

1996
 George Gervin, spiller
 Gail Goodrich, spiller
 David Thompson, spiller
 Kresimir Cosic, spiller
 Nancy Lieberman-Cline, spiller
 George Yardley, spiller

1995
 Kareem Abdul-Jabbar, spiller
 Cheryl Miller, spiller
 Anne Donovan, spiller
 Aleksandr Gomelskij, træner
 John Kundla, træner
 Vern Mikkelsen, spiller
 Earl Storm, dommer

1994
 Chuck Daly, træner
 Denny Crum, træner
 Carol Blazejowski, spiller
 Buddy Jeannette, spiller
 Cesare Rubini, træner

1993
 Julius Erving, spiller
 Bill Walton, spiller
 Calvin Murphy, spiller
 Walt Bellamy, spiller
 Dan Issell, spiller
 Dick McGuire, spiller
 Ann Meyers, spiller
 Uljana Semjonova, spiller

1992
 Bob Lanier, spiller
 Connie Hawkins, spiller
 Sergei Belov, spiller
 Lou Carnesecca, træner
 Lusia Harris-Stewart, spiller
 Alfred McGuire, træner
 Jack Ramsay, træner
 Nera White, spiller
 Phillip Woolpert, træner

1991
 Tiny Archibald, spiller
 Bob Knight, træner
 Lawrence O'Brien, bidragyder
 Dave Cowens, spiller
 Larry Fleisher, bidragyder
 Harry Gallatin, spiller
 Borislav Stankovic, bidragyder

1990
 Earl Monroe, spiller
 Dave Bing, spiller
 Elvin Hayes, spiller
 Neil Johnston, spiller

1989
 Lenny Wilkens, spiller
 Pop Gates, spiller
 K.C. Jones, spiller

1988
 Wes Unseld, spiller
 Ralph Miller, træner
 Bob McDermott, spiller
 Clyde Lovellette, spiller

1987
 Rick Barry, spiller
 Walt Frazier, spiller
 Pete Maravich, spiller
 Bobby Wanzer, spiller
 Bob Houbregs, spiller

1986
 Red Holzman, træner
 Tom Heinsohn, spiller
 Billy Cunningham, spiller
 Red Mihalik, dommer
 Fred Taylor, træner
 Stanley Watts, træner

1985
 Nate Thurmond, spiller
 Harold Anderson, træner
 Senda Berenson Abbott, bidragyder
 Al Cervi, spiller
 Marv Harshman, træner
 Bertha Teague, bidragyder
 Margaret Wade, træner

1984
 John Havlicek, spiller
 Sam Jones, spiller
 Clifford Fagan, bidragyder
 Jack Gardner, træner
 Edward Steitz, bidragyder

1983
 Bill Bradley, spiller
 Dean Smith, træner
 Dave DeBusschere, spiller
 Lloyd Leith, dommer
 Jack Twyman, spiller
 Louis Wilke, bidragyder

1982
 Willis Reed, spiller
 Frank Ramsey, spiller
 Slater Martin, spiller
 Hal Greer, spiller
 Clarence Gaines, træner
 Alva Duer, bidragyder
 Everett Case, træner

1981
 Thomas Barlow, spiller
 Ferenc Hepp, bidragyder
 Walter Kennedy, bidragyder
 Arad McCutchan, træner

1980
 Oscar Robertson, spiller
 Jerry Lucas, spiller
 Jerry West, spiller
 Les Harrison, bidragyder
 Everett Shelton, træner
 Dallas Shirley, dommer

1979
 Wilt Chamberlain, spiller
 Sam Barry,træner
 James Enright, dommer
 Edgar Hickey, træner
 John McLendon, træner
 Ray Meyer, træner
 Pete Newell, træner

1978
 Paul Arizin, spiller
 Joe Fulks, spiller
 Cliff Hagan, spiller
 John Nucatola, dommer
 Jim Pollard, spiller

1977
 Elgin Baylor, spiller
 Charles Cooper, spiller
 Lauren Gale, spiller
 William Johnson, spiller
 Frank McGuire, træner

1976
 Tom Gola, spiller
 Ed Krause, spiller
 Harry Litwack, træner
 Bill Sharman, spiller

1975
 Bill Russell, spiller
 Joseph Brennan, spiller
 Emil Liston, bidragyder
 Robert Vandivier, spiller

1974
 Harry Fisher, bidragyder
 Maurice Podoloff, bidragyder
 Ernest Schmidt, spiller

1973
 John Beckman, spiller
 Bruce Drake, træner
 Arthur Lonborg, træner
 Elmer Ripley, bidragyder
 Dolph Schayes, spiller
 John Wooden, træner

1972
 Edgar Diddle, træner
 Robert Douglas, bidragyder
 Paul Endacott, spiller
 Max Friedman, spiller
 Edward Gottlieb, bidragyder
 Clifford Wells, bidragyder

1971
 Bob Cousy, spiller
 Bob Pettit, spiller
 Abe Saperstein, bidragyder

1970
 Bernard Carnevale, træner
 Bob Davies, spiller

1969
 Red Auerbach, træner
 Dutch Dehnert, spiller
 Henry Iba, træner
 Adolph Rupp, træner
 Charles Taylor, bidragyder

1968
 Clair Bee, bidragyder
 Howard Cann, træner
 Amory Gill, træner
 Alvin Julian, træner

1966
 Everett Dean, træner
 Joe Lapchick, spiller

1965
 Walter Brown, bidragyder
 Paul Hinkle, bidragyder
 Howard Hobson, træner
 William Mokray, bidragyder

1964
 John Bunn, bidragyder
 Harold Foster, spiller
 Nat Holman, spiller
 Ned Irish, bidragyder
 William Jones, bidragyder
 Kenneth Loeffler, træner
 John Russell, spiller

1963
 New York Rens, hold
 Robert Gruenig, spiller
 William Reid, bidragyder

1962
 Jack McCracken, spiller
 Frank Morgenweck, bidragyder
 Harlan Page, spiller
 Barney Sedran, spiller
 Lynn St. John, bidragyder
 John Thompson, spiller

1961
 Buffalo Germans, hold
 Bergnard Borgmann, spiller
 Forrest DeBernardi, spiller
 George Hoyt, dommer
 Bob Kurland, spiller
 John O'Brien, bidragyder
 Andy Phillip, spiller
 Ernest Quigley, dommer
 John Roosma, spiller
 Leonard Sachs, træner
 Arthur Schabinger, bidragyder
 Christian Steinmetz, spiller
 David Tobey, dommer
 Arthur Trester, bidragyder
 Edward Wachter, spiller
 David Walsh, dommer

1960
 Ernest Blood, træner
 Victor Hanson, spiller
 George Hepbron, dommer
 Frank Keaney, træner
 Ward Lambert, træner
 Ed Macauley, spiller
 Branch McCracken, spiller
 Charles Murphy, spiller
 Henry Porter, bidragyder
 John Wooden, spiller

1959
 Original Celtics, hold
 The First Team, hold
 Phog Allen, træner
 Henry Clifford Carlson, træner
 Luther Gulick, bidragyder
 Edward Hickox, bidragyder
 Charles Hyatt, spiller
 Matthew Kennedy, dommer
 Hank Luisetti, spiller
 Walter Meanwell, træner
 George Mikan, spiller
 Ralph Morgan, bidragyder|
 James Naismith, bidragyder
 Harold Olsen, bidragyder
 John Schommer, spiller
 Amos Alonzo Stagg, bidragyder
 Oswald Tower, bidragyder

Referencer

Eksterne henvisninger

 Naismith Memorial Basketball Hall of Fame Officiel hjemmeside

Basketball


Der Staatssekretär für Integration war ein im April 2011 geschaffenes Staatssekretariat der österreichischen Bundesregierung.

Mit dem zuvor dem Innenministerium zugeteilten Arbeitsbereich wurde im Zuge einer Kabinettsumbildung Sebastian Kurz (* 1986) betraut. Nach der Nationalratswahl in Österreich 2013 und der Fortsetzung der großen Koalition wurde die Abteilung als neue Sektion VIII in das Außenministerium transferiert. Aktuelle Sektionschefin ist Susanne Raab, zuvor war dies Stefan Steiner.

Siehe auch
Integrationsbeauftragter

Weblinks
 Internetseite
 Außenministerium: Geschäftseinteilung

Einzelnachweise

 Integration
Bundesministerium für Inneres

Staatssekretär für Integration


Onthophagus murchisoni é uma espécie de inseto do género Onthophagus, família Scarabaeidae, ordem Coleoptera.

História
Foi descrita cientificamente por Blackburn em 1892.

Referências

Ligações externas

murchisoni
Coleópteros descritos em 1892

Onthophagus murchisoni


Marele Premiu al Franței din 2019 (cunoscut oficial ca Formula 1 Pirelli Grand Prix de France 2019) a fost o cursă de Formula 1 care s-a desfășurat între 21 și 23 iunie 2019 la Le Castellet, Franța. Cursa a fost cea de-a opta etapă a Campionatului Mondial de Formula 1 din 2019, fiind pentru a cincizeci și noua oară când s-a desfășurat o etapă de Formula 1 în Franța.

Clasament

Calificări

Note
   – Daniil Kveat și George Russell au plecat de pe ultimele poziții de pe grilă pentru schimbările multiple ale motorului.

Cursa

Note
  – Daniel Ricciardo a terminat pe 7, dar a primit două penalizări a câte 5 secunde, una pentru părăsirea pistei câștigând astfel un avantaj, și una pentru reintrarea periculoasă pe pistă.

Clasament campionat după cursă

Clasament piloți

Clasament constructori

 Notă: În ambele clasamente sunt prezentate doar primele cinci locuri.

Referințe

Franța
Marele Premiu al Franței

Marele Premiu al Franței din 2019


Die Route nationale 691, kurz N 691 oder RN 691, war eine französische Nationalstraße, die von 1933 bis 1973 zwischen Treignac und Neuvic verlief. Ihre Länge betrug 61 Kilometer.

Weblinks
Route nationale française 691 auf WikiSara (französisch)

691

Route nationale 691


Alihan Samedov (Azerice: Əlixan Səmədov, 27 Nisan 1964, Sumgayıt), Azerbaycan asıllı Türk balaban virtüözü.

Yaşamı ve kariyeri
Alihan Samedov, 27 Nisan 1964 yılında Sumgayıt'ta müzisyen bir ailenin çocuğu olarak dünyaya geldi. Samed Vurgun Müzik Okulu'nda obua, Neriman Nerimanov Kültür Evi'nde de garmon eğitimi aldı (1979 -1982). Azerbaycan Devlet Pedagoji Üniversitesi'nde okuyup (1986-1990) eğitimini tamamladı. Nefesli çalgıları (balaban, klarnet, gaboy, tütek, zurna, saksafon) ve halk çalgılarını (nağara, goşa nağara, tef, garmon) büyük bir ustalıkla çalabiliyor. 1993 yılında müzik sanatını daha da geliştirmek amacıyla Türkiye'ye göçen Samedov, balabanı ile kısa sürede büyük dinleyici kitlesi kazandı. "Balaban Metodu" kitabının yazarı Alihan Samedov çeşitli ödüllere layık görüldü. Rusça'yı iyi bilen Samedov ayrıca satranç ustasıdır ve Erenköy İlköğretim Okulu'nda satranç öğretmenliği yapmıştır. Kadıköy Halk Eğitim Merkezi'nde müzik direktörlüğü, Eyüboğlu Eğitim Kurumu'nda halk dansları müzik direktörlüğü, İstanbul Kafkas Dance Company'de müzik direktörlüğü ve Samanyolu TV Azerbaycan musiki sorumluluğu görevlerini üstlenmiştir.

Diskografi

Albümleri

Balaban - The Land Of Fire (2001)
 "Sen Gelmez Oldun"
 "Sarı Gelin (Improvise)"
 "Sarı Gelin"
 "Men Gülem"
 "Gözelim Sensin"
 "Apardı Seller Saranı"
 "Gelmedin"
 "Mirzeyi"
 "Getti Yar"
 "Heyva Gülü"
 "Sen Gelmez Oldun"

Balaban 2 - Sızı (2002)
 "Sızı"
 "Yalgızam"
 "Yaz Akşamı"
 "Son Nefes"
 "Laçin"
 "Segah"
 "Ayrılık"
 "Alagözlüm"
 "Aygız"
 "Üsküdara Gideriken"
 "Herşey Senin İçin"

Balaban - Türküler (2002)
 "Ah Bir Ataş"
 "Dağlar Oy"
 "Sarı Gelin"
 "Demir Kapı"
 "Arzu Gızım"
 "Yüksek Yüksek"
 "Göçmen Kızı"
 "Urfanın Etrafı"
 "Reyhan"
 "Leyla"

Nale (2004)
 "Nerede Kaldın"
 2-Düet Club"
 3-Asya"
 4-Yaz Akşamı (Remix)"
 5-Nale"
 6-Azerbaycan Maralı"
 7-Sen Gelmez Oldun (Remix)"
 8-Roket"
 9-Aziz Dostum"
 10-Karabağ Şikestesi"
 11-Lay Lay (Ninni)"

Balaban 6 (2006)
 Mutlu Anlar"
 "Son Defa"
 "Bugün Tarihi Bir Gündür"
 "Masal Gibi"
 "Bebek Şarkısı"
 "Gel Ey Seher"
 "İki Nefes"
 "Tütek"
 "Canım Lerik"
 "Dilberim"
 "Dilberim (Remix)"
 "Mutlu Anlar (Intro)"
 "Mutlu Anlar (Acoustic)"
 "Bugün Tarihi Bir Gündür (Dance Mix)"

Balaban 7 (2008)
 "Çırpınırdı Karadeniz"
 "Halil İbrahim"
 "Karagile"
 "Keskin Bıçak"
 "İncir Ağacı"
 "Karaağaç"
 "Şirvan Şikestesi"
 "Azerbaycanım"
 "Kör Arabın Mahnısı"
 "10-20 Ocak"
 "11-Halil İbrahim (remix)"

Ödülleri
 1993 İstanbul Halk Dansları Yarışması (En iyi Müzik)
 1996 Zakopane (En iyi müzik, En iyi müzisyen)
 1997 Milliyet Gazetesi Yarışması (Özel Ödül)

Dış bağlantılar

Yaşayan insanlar
1964 doğumlular
Sumgayıt doğumlular
Türkiye'deki Azeri göçmenler
Balabancılar
Resim aranan müzisyenler

Alihan Samedov


Regionalne kvalifikacije za Hrvatski rukometni kup za muškarce za sezonu 2020./21.
Igrane su u pet regija - "Istok", "Jug", "Sjever", "Središte" i "Zapad", kroz koje se deset klubova plasiralo u osminu završnice Hrvatskog kupa 2020./21.

 Regija Istok
Klubovi iz županija:
 Brodsko-posavska
 Osječko-baranjska
 Požeško-slavonska
 Virovitičko-podravska
  Vukovarsko-srijemska

 1. kolo

 2. kolo

 3. kolo

 Regija Jug
Klubovi iz županija:
 Dubrovačko-neretvanska
 Splitsko-dalmatinska
 Šibensko-kninska
 Zadarska

 Pretkolo

 1. kolo

 2. kolo

 3. kolo

 Regija Sjever
Klubovi iz županija:
 Bjelovarsko-bilogorska
 Koprivničko-križevačka
 Međimurska
 Varaždinska

 1. kolo

 2. kolo

 3. kolo

 Regija Središte
Klubovi iz županija:
  Krapinsko-zagorska
 Sisačko-moslavačka
 Zagrebačka
 Grad Zagreb

 1. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 24. studenog 2020. ||Zagreb ||ZG-Dubrava Zagreb - Ivanić (Ivanić-Grad) ||<center>  35:23 ||<small> ||<small>
|-
|<small> 25. studenog 2020. ||Rugvica ||Rugvica - Moslavina Kutina ||<center> 21:39 ||<small> ||<small>
|-
|<small> 25. studenog 2020. ||Zagreb ||Medveščak Zagreb - Sesvete ||<center> 24:47 ||<small> ||<small>
|-
|<small> 27. siječnja 2021. ||Dugo Selo ||Dugo Selo - Rudar Rude ||<center> 37:28 ||<small> ||<small>
|-
|<small> 18. veljače 2021. ||Sisak ||Sisak - Metalac Zagreb ||<center> 36:26 ||<small> ||<small>
|-
|<small> 23. veljače 2021. ||Kutina ||Petrinja - Maksimir Pastela Zagreb ||<center> 30:26 ||<small> ||<small>
|-
|<small> 25. veljače 2021. ||Zagreb ||Novi Zagreb - Gorica (Velika Gorica) ||<center> 24:52 ||<small> ||<small>
|-
|}

 2. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 10. veljače 2021. ||Dugo Selo ||Dugo Selo - Sesvete ||<center> 25:26 ||<small> ||<small>
|-
|<small> || ||ZG-Dubrava Zagreb - Moslavina Kutina ||<center> 0:10 b.b. ||<small> "Moslavina" prošla bez borbe ||<small>
|-
|<small> 6. ožujka 2021. ||Sisak ||Petrinja - Sisak ||<center> 30:32 ||<small> ||<small>
|-
|<small> || ||colspan="2"|Gorica (Velika Gorica) ||<small> slobodni ||<small>
|-
|}

 3. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 3. ožujka 2021. ||Kutina ||Moslavina Kutina - Gorica (Velika Gorica) ||<center> 27:33 ||<small> "Gorica" se plasirala u osminu završnice Hrvatskog kupa ||<small>
|-
|<small> 11. ožujka 2021. ||Sisak ||Sisak - Sesvete ||<center> 20:46 ||<small> "Sesvete" su se plasirale u osminu završnice Hrvatskog kupa ||<small>
|-
|}

 Regija Zapad
Klubovi iz županija:
 Istarska
 Karlovačka
 Ličko-senjska
 Primorsko-goranska

 1. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 25. studenog 2020. ||Karlovac ||Dubovac-Gaza Karlovac - Karlovac ||<center> 25:40 ||<small> ||<small>
|-
|<small> 25. studenog 2020. ||Ogulin ||Ogulin - Gospić ||<center> 42:31 ||<small> ||<small>
|-
|<small> || ||Buje 53 - Kozala Rijeka ||<center> 0:10 b.b. ||<small> "Kozala" prošla bez borbe ||<small>
|-
|<small> 26. siječnja 2021. ||Senj ||Senj - Mornar Dramalj-Crikvenica ||<center> 38:25 ||<small> ||<small>
|-
|<small> 28. siječnja 2021. ||Pula ||Arena-Pula - Buzet ||<center> 21:32 ||<small> ||<small>
|-
|<small> 16. veljače 2021. ||Pula ||Veruda Pula - Rudar Adria Oil Labin ||<center> 31:42 ||<small> ||<small>
|-
|<small> || ||28. April Kaštelir - Rovinj ||<center> 0:10 b.b. ||<small> "Rovinj" prošao bez borbe ||<small>
|-
|}

 2. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 30. siječnja 2021. ||Rijeka ||Kozala Rijeka - Senj ||<center> 32:37 ||<small> ||<small>
|-
|<small> 23. veljače 2021. ||Rovinj ||Rovinj - Buzet ||<center> 24:21 ||<small> ||<small>
|-
|<small> 24. veljače 2021. ||Labin ||Rudar Adria Oil Labin - Zamet Rijeka ||<center> 27:32 ||<small> ||<small>
|-
|<small> 1. ožujka 2021. ||Ogulin ||Ogulin - Karlovac ||<center> 27:37 ||<small> ||<small>
|-
|}

 3. kolo
{| class="wikitable" style="font-size: 90%"
!datum !!mjesto odigravanja !!par !!rez. !!napomene !!izvještaj
|-
|<small> 3. ožujka 2021. ||Senj ||Senj - Zamet Rijeka ||<center> 25:29 ||<small> "Zamet" se plasirao u osminu završnice Hrvatskog kupa ||<small>
|-
|<small> 3. ožujka 2021. ||Rovinj ||Rovinj - Karlovac ||<center> 25:24 ||<small> "Rovinj"'' se plasirao u osminu završnice Hrvatskog kupa ||
|-
|}

 Povezani članci
 Hrvatski rukometni kup
 Hrvatski kup 2020./21.
 1. HRL 2020./21.
 2. HRL 2020./21.
 3. HRL 2020./21.

 Vanjske poveznice
 hrs.hr, Hrvatski rukometni savez
 hrs.hr, Natjecanje / Hrvatski kup - Muški
 hrs.hr, Kup Hrvatske

 Izvori

 hrs.hr, Natjecanje / Hrvatski kup - Muški (2020./21.), pristupljeno 10. listopada 2021.
 hrs.hr, Natjecanje / Hrvatski kup - Muški (2020./21.), wayback arhiva

kvalifikacije 2020-21
m-kup-k

Hrvatski rukometni kup za muškarce – kvalifikacije 2020./21.


In mathematical statistics, the Fisher information (sometimes simply called information) is a way of measuring the amount of information that an observable random variable X carries about an unknown parameter θ of a distribution that models X. Formally, it is the variance of the score, or the expected value of the observed information.

The role of the Fisher information in the asymptotic theory of maximum-likelihood estimation was emphasized by the statistician Sir Ronald Fisher (following some initial results by Francis Ysidro Edgeworth). The Fisher information matrix is used to calculate the covariance matrices associated with maximum-likelihood estimates. It can also be used in the formulation of test statistics, such as the Wald test.

In Bayesian statistics, the Fisher information plays a role in the derivation of non-informative prior distributions according to Jeffreys' rule. It also appears as the large-sample covariance of the posterior distribution, provided that the prior is sufficiently smooth (a result known as Bernstein–von Mises theorem, which was anticipated by Laplace for exponential families). The same result is used when approximating the posterior with Laplace's approximation, where the Fisher information appears as the covariance of the fitted Gaussian.

Statistical systems of a scientific nature (physical, biological, etc.) whose likelihood functions obey shift invariance have been shown to obey maximum Fisher information. The level of the maximum depends upon the nature of the system constraints.

Definition
The Fisher information is a way of measuring the amount of information that an observable random variable  carries about an unknown parameter  upon which the probability of  depends. Let  be the probability density function (or probability mass function) for  conditioned on the value of . It describes the probability that we observe a given outcome of , given a known value of . If  is sharply peaked with respect to changes in , it is easy to indicate the "correct" value of  from the data, or equivalently, that the data  provides a lot of information about the parameter . If  is flat and spread-out, then it would take many samples of  to estimate the actual "true" value of  that would be obtained using the entire population being sampled. This suggests studying some kind of variance with respect to .

Formally, the partial derivative with respect to  of the natural logarithm of the likelihood function is called the score. Under certain regularity conditions, if  is the true parameter (i.e.  is actually distributed as ), it can be shown that the expected value (the first moment) of the score, evaluated at the true parameter value , is 0:

The Fisher information is defined to be the variance of the score:

Note that . A random variable carrying high Fisher information implies that the absolute value of the score is often high. The Fisher information is not a function of a particular observation, as the random variable X has been averaged out.

If  is twice differentiable with respect to θ, and under certain regularity conditions, then the Fisher information may also be written as

since

and

Thus, the Fisher information may be seen as the curvature of the support curve (the graph of the log-likelihood). Near the maximum likelihood estimate, low Fisher information therefore indicates that the maximum appears "blunt", that is, the maximum is shallow and there are many nearby values with a similar log-likelihood. Conversely, high Fisher information indicates that the maximum is sharp.

Regularity conditions
The regularity conditions are as follows:

 The partial derivative of f(X; θ) with respect to θ exists almost everywhere. (It can fail to exist on a null set, as long as this set does not depend on θ.)
 The integral of f(X; θ) can be differentiated under the integral sign with respect to θ.
 The support of f(X; θ) does not depend on θ.

If θ is a vector then the regularity conditions must hold for every component of θ. It is easy to find an example of a density that does not satisfy the regularity conditions: The density of a Uniform(0, θ) variable fails to satisfy conditions 1 and 3. In this case, even though the Fisher information can be computed from the definition, it will not have the properties it is typically assumed to have.

In terms of likelihood
Because the likelihood of θ given X is always proportional to the probability f(X; θ), their logarithms necessarily differ by a constant that is independent of θ, and the derivatives of these logarithms with respect to θ are necessarily equal.  Thus one can substitute in a log-likelihood l(θ; X) instead of  in the definitions of Fisher Information.

Samples of any size
The value X can represent a single sample drawn from a single distribution or can represent a collection of samples drawn from a collection of distributions.  If there are n samples and the corresponding n distributions are statistically independent then the Fisher information will necessarily be the sum of the single-sample Fisher information values, one for each single sample from its distribution.  In particular, if the n distributions are independent and identically distributed then the Fisher information will necessarily be n times the Fisher information of a single sample from the common distribution.

Informal derivation of the Cramér–Rao bound
The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any unbiased estimator of θ. H.L. Van Trees (1968) and B. Roy Frieden (2004) provide the following method of deriving the Cramér–Rao bound, a result which describes use of the Fisher information.

Informally, we begin by considering an unbiased estimator . Mathematically, "unbiased" means that

This expression is zero independent of θ, so its partial derivative with respect to θ must also be zero. By the product rule, this partial derivative is also equal to

For each θ, the likelihood function is a probability density function, and therefore . By using the chain rule on the partial derivative of  and then dividing and multiplying by , one can verify that

Using these two facts in the above, we get

Factoring the integrand gives

Squaring the expression in the integral, the Cauchy–Schwarz inequality yields

The second bracketed factor is defined to be the Fisher Information, while the first bracketed factor is the expected mean-squared error of the estimator . By rearranging, the inequality tells us that

In other words, the precision to which we can estimate θ is fundamentally limited by the Fisher information of the likelihood function.

Alternatively, the same conclusion can be obtained directly from the Cauchy–Schwarz inequality for random variables, , applied to the random variables  and , and observing that for unbiased estimators we have

Single-parameter Bernoulli experiment
A Bernoulli trial is a random variable with two possible outcomes, "success" and "failure", with success having a probability of θ. The outcome can be thought of as determined by a coin toss, with the probability of heads being θ and the probability of tails being .

Let X be a Bernoulli trial. The Fisher information contained in X may be calculated to be

Because Fisher information is additive, the Fisher information contained in n independent Bernoulli trials is therefore

This is the reciprocal of the variance of the mean number of successes in n Bernoulli trials, so in this case, the Cramér–Rao bound is an equality.

Matrix form
When there are N parameters, so that θ is an  vector  then the Fisher information takes the form of an  matrix.  This matrix is called the Fisher information matrix (FIM) and has typical element

The FIM is a  positive semidefinite matrix.  If it is positive definite, then it defines a Riemannian metric on the N-dimensional parameter space.  The topic information geometry uses this to connect Fisher information to differential geometry, and in that context, this metric is known as the Fisher information metric.

Under certain regularity conditions, the Fisher information matrix may also be written as

The result is interesting in several ways:
It can be derived as the Hessian of the relative entropy.
It can be used as a Riemannian metric for defining Fisher-Rao geometry when it is positive-definite.
It can be understood as a metric induced from the Euclidean metric, after appropriate change of variable.
In its complex-valued form, it is the Fubini–Study metric.
It is the key part of the proof of Wilks' theorem, which allows confidence region estimates for maximum likelihood estimation (for those conditions for which it applies) without needing the Likelihood Principle.
In cases where the analytical calculations of the FIM above are difficult, it is possible to form an average of easy Monte Carlo estimates of the Hessian of the negative log-likelihood function as an estimate of the FIM. The estimates may be based on values of the negative log-likelihood function or the gradient of the negative log-likelihood function; no analytical calculation of the Hessian of the negative log-likelihood function is needed.

Information orthogonal parameters
We say that two parameter component vectors θ1 and θ2 are information orthogonal if the Fisher information matrix is block diagonal, with these components in separate blocks. Orthogonal parameters are easy to deal with in the sense that their  maximum likelihood estimates are asymptotically uncorrelated. When considering how to analyse a statistical model, the modeller is advised to invest some time searching for an orthogonal parametrization of the model, in particular when the parameter of interest is one-dimensional, but the nuisance parameter can have any dimension.

Singular statistical model

If the Fisher information matrix is positive definite for all , then the corresponding statistical model is said to be regular; otherwise, the statistical model is said to be singular. Examples of singular statistical models include the following: normal mixtures, binomial mixtures, multinomial mixtures, Bayesian networks, neural networks, radial basis functions, hidden Markov models, stochastic context-free grammars, reduced rank regressions, Boltzmann machines.

In machine learning, if a statistical model is devised so that it extracts hidden structure from a random phenomenon, then it naturally becomes singular.

Multivariate normal distribution
The FIM for a N-variate multivariate normal distribution,  has a special form. Let the K-dimensional vector of parameters be  and the vector of random normal variables be .  Assume that the mean values of these random variables are , and let  be the covariance matrix. Then, for , the (m, n) entry of the FIM is:

where  denotes the transpose of a vector,  denotes the trace of a square matrix, and:

Note that a special, but very common, case is the one where , a constant. Then

In this case the Fisher information matrix may be identified with the coefficient matrix of the normal equations of least squares estimation theory.

Another special case occurs when the mean and covariance depend on two different vector parameters, say, β and θ. This is especially popular in the analysis of spatial data, which often uses a linear model with correlated residuals. In this case,

where

Properties

Chain rule
Similar to the entropy or mutual information, the Fisher information also possesses a chain rule decomposition. In particular, if X and Y are jointly distributed random variables, it follows that:

where  and  is the Fisher information of Y relative to  calculated with respect to the conditional density of Y given a specific value X = x.

As a special case, if the two random variables are independent, the information yielded by the two random variables is the sum of the information from each random variable separately:

Consequently, the information in a random sample of n independent and identically distributed observations is n times the information in a sample of size 1.

F-divergence
Given a convex function  that  is finite for all , , and , (which could be infinite), it defines an f-divergence . Then if  is strictly convex at , then locally at , the Fisher information matrix is a metric, in the sense thatwhere  is the distribution parametrized by . That is, it's the distribution with pdf .

In this form, it is clear that the Fisher information matrix is a Riemannian metric, and varies correctly under a change of variables. (see section on Reparametrization.)

Sufficient statistic
The information provided by a sufficient statistic is the same as that of the sample X. This may be seen by using Neyman's factorization criterion for a sufficient statistic. If T(X) is sufficient for θ, then

for some functions g and h.  The independence of h(X) from θ implies

and the equality of information then follows from the definition of Fisher information. More generally, if  is a statistic, then

with equality if and only if T is a sufficient statistic.

Reparametrization
The Fisher information depends on the parametrization of the problem. If θ and η are two scalar parametrizations of an estimation problem, and θ is a continuously differentiable function of η, then

where  and  are the Fisher information measures of η and θ, respectively.

In the vector case, suppose  and  are k-vectors which parametrize an estimation problem, and suppose that  is a continuously differentiable function of , then,

where the (i, j)th element of the k × k Jacobian matrix  is defined by

and where  is the matrix transpose of

In information geometry, this is seen as a change of coordinates on a Riemannian manifold, and the intrinsic properties of curvature are unchanged under different parametrizations. In general, the Fisher information matrix provides a Riemannian metric (more precisely, the Fisher–Rao metric) for the manifold of thermodynamic states, and can be used as an information-geometric complexity measure for a classification of phase transitions, e.g., the scalar curvature of the thermodynamic metric tensor diverges at (and only at) a phase transition point.

In the thermodynamic context, the Fisher information matrix is directly related to the rate of change in the corresponding order parameters. In particular, such relations identify second-order phase transitions via divergences of individual elements of the Fisher information matrix.

Isoperimetric inequality
The Fisher information matrix plays a role in an inequality like the isoperimetric inequality. Of all probability distributions with a given entropy, the one whose Fisher information matrix has the smallest trace is the Gaussian distribution. This is like how, of all bounded sets with a given volume, the sphere has the smallest surface area.

The proof involves taking a multivariate random variable  with density function  and adding a location parameter to form a family of densities . Then, by analogy with the Minkowski–Steiner formula, the "surface area" of  is defined to be

where  is a Gaussian variable with covariance matrix . The name "surface area" is apt because the entropy power  is the volume of the "effective support set," so  is the "derivative" of the volume of the effective support set, much like the Minkowski-Steiner formula. The remainder of the proof uses the entropy power inequality, which is like the Brunn–Minkowski inequality. The trace of the Fisher information matrix is found to be a factor of .

Applications

Optimal design of experiments
Fisher information is widely used in optimal experimental design. Because of the reciprocity of estimator-variance and Fisher information, minimizing the variance corresponds to maximizing the information.

When the linear (or linearized) statistical model has several parameters, the mean of the parameter estimator is a vector and its variance is a matrix. The inverse of the variance matrix is called the "information matrix". Because the variance of the estimator of a parameter vector is a matrix, the problem of "minimizing the variance" is complicated. Using statistical theory, statisticians compress the information-matrix using real-valued summary statistics; being real-valued functions, these "information criteria" can be maximized.

Traditionally, statisticians have evaluated estimators and designs by considering some summary statistic of the covariance matrix (of an unbiased estimator), usually with positive real values (like the determinant or matrix trace). Working with positive real numbers brings several advantages: If the estimator of a single parameter has a positive variance, then the variance and the Fisher information are both positive real numbers; hence they are members of the convex cone of nonnegative real numbers (whose nonzero members have reciprocals in this same cone).

For several parameters, the covariance matrices and information matrices are elements of the convex cone of nonnegative-definite symmetric matrices in a partially ordered vector space, under the Loewner (Löwner) order. This cone is closed under matrix addition and inversion, as well as under the multiplication of positive real numbers and matrices. An exposition of matrix theory and Loewner order appears in Pukelsheim.

The traditional optimality criteria are the information matrix's invariants, in the sense of invariant theory; algebraically, the traditional optimality criteria are functionals of the eigenvalues of the (Fisher) information matrix (see optimal design).

Jeffreys prior in Bayesian statistics
In Bayesian statistics, the Fisher information is used to calculate the Jeffreys prior, which is a standard, non-informative prior for continuous distribution parameters.

Computational neuroscience
The Fisher information has been used to find bounds on the accuracy of neural codes. In that case, X is typically the joint responses of many neurons representing a low dimensional variable θ (such as a stimulus parameter). In particular the role of correlations in the noise of the neural responses has been studied.

Derivation of physical laws
Fisher information plays a central role in a controversial principle put forward by Frieden as the basis of physical laws, a claim that has been disputed.

Machine learning
The Fisher information is used in machine learning techniques such as elastic weight consolidation, which reduces catastrophic forgetting in artificial neural networks.

Fisher information can be used as an alternative to the Hessian of the loss function in second-order gradient descent network training.

Relation to relative entropy

Fisher information is related to relative entropy. The relative entropy, or Kullback–Leibler divergence, between two distributions  and  can be written as

Now, consider a family of probability distributions  parametrized by . Then the Kullback–Leibler divergence, between two distributions in the family can be written as

If  is fixed, then the relative entropy between two distributions of the same family is minimized at . For  close to , one may expand the previous expression in a series up to second order:

But the second order derivative can be written as

Thus the Fisher information represents the curvature of the relative entropy of a conditional distribution with respect to its parameters.

History
The Fisher information was discussed by several early statisticians, notably F. Y. Edgeworth. For example, Savage says: "In it [Fisher information], he [Fisher] was to some extent anticipated (Edgeworth 1908–9 esp. 502, 507–8, 662, 677–8, 82–5 and references he [Edgeworth] cites including Pearson and Filon 1898 [. . .])." There are a number of early historical sources and a number of reviews of this early work.

See also
Efficiency (statistics)
Observed information
Fisher information metric
Formation matrix
Information geometry
Jeffreys prior
Cramér–Rao bound
Minimum Fisher information
Quantum Fisher information

Other measures employed in information theory:
Entropy (information theory)
Kullback–Leibler divergence
Self-information

Notes

References

 Frieden, B. R. (2004) Science from Fisher Information: A Unification. Cambridge Univ. Press. .

Estimation theory
Information theory
Design of experiments

Fisher information


El duatlón es un deporte individual o por equipos, y de resistencia, que reúne dos disciplinas deportivas: atletismo y ciclismo. Se aplica el orden siguiente: carrera a pie, ciclismo y carrera a pie. Tiene una variante que es el duatlón de montaña, realizada en caminos no asfaltados y con una BTT y no debe confundirse con el biatlón. En duatlón el evento de mayor exigencia física se conoce como el Powerman (10 km de carrera a pie, 150 km de ciclismo y otros 30 km de carrera a pie), semejante al Ironman en el triatlón. El duatlón se disputa tanto en carretera como en montaña.

Distancias
Las distancias recorridas en pruebas de duatlón son:

 Distancia sprint: 5 km + 20 km + 2,5 km
 Distancia olímpica o corta: 10 km + 40 km + 5 km
 Distancia larga: 14 km + 60 km + 7 km

El duatlón en España depende de la Federación Española de Triatlón (FETRI).

Duatletas destacados
Emilio Martín es el máximo representante del duatlón a nivel español y uno de los grandes duatletas a nivel internacional, podemos corroborarlo con algunos títulos ya en su palmarés, como son, varios campeonatos de España y de Andalucía, su primer puesto en el Campeonato del mundo de duatlón 2012 y su segundo puesto en el Campeonato del mundo de duatlón 2013. También tenemos a otros duatletas importantes a nivel nacional como son Sergio Lorenzo, Aída Valiño y Rocío Espada.

Referencias

Enlaces externos

 Federación Española de Triatlón (FETRI)

Duatlón


O USS Missouri foi um couraçado pré-dreadnought operado pela Marinha dos Estados Unidos e a segunda embarcação da Classe Maine, depois do  e seguido pelo . Sua construção começou em fevereiro de 1900 nos estaleiros da Newport News Shipbuilding e foi lançado ao mar em dezembro do ano seguinte, sendo comissionado na frota norte-americana em dezembro de 1903. Era armado com uma bateria principal composta por quatro canhões de 305 milímetros montados em duas torres de artilharia duplas, tinha um deslocamento carregado de quase catorze mil toneladas e conseguia alcançar uma velocidade máxima de dezoito nós (33 quilômetros por hora).

O Missouri teve uma carreira relativamente tranquila e passou a maior parte de seu serviço atuando no Oceano Atlântico, com suas principais atividades consistindo em exercícios e treinamentos de rotina. Ele deu uma volta ao mundo entre 1907 e 1909 como parte Grande Frota Branca. Foi modernizado ao fim da viagem e colocado na reserva, sendo reativado de tempos em tempos pelos anos seguintes para ser usado como navio-escola em cruzeiros de treinamento. Depois do fim da Primeira Guerra Mundial foi brevemente empregado como transporte de tropas em 1919 para trazer soldados norte-americanos de volta para casa da França. Foi descomissionado no ano seguinte e desmontado.

Descrição
O Congresso dos Estados Unidos aprovou um importante programa de construção naval em resposta à eclosão da Guerra Hispano-Americana em 1898; o programa incluía três novos encouraçados, que se tornariam a classe Maine. A classe incorporou vários desenvolvimentos tecnológicos significativos, incluindo canhões principais de menor calibre que usavam pólvora sem fumaça para atingir maior velocidade de saída (e, portanto, poder de penetração), blindagem cimentada Krupp que era mais forte do que a blindagem Harvey usada em embarcações anteriores e caldeiras aquatubulares que forneciam mais potência para os motores.

O Missouri tinha 120 metros de comprimento total e tinha uma boca de 22 metros e um calado de sete metros. Ele deslocava 12 560 toneladas conforme projetado e até 13 900 em plena carga. O navio era movido por motores a vapor de expansão tripla de dois eixos avaliados em 16 mil cavalos de potência, acionando duas hélices helicoidais. O vapor era fornecido por doze caldeiras Thornycroft movidas a carvão, que eram ventiladas em três funis. No que toca ao sistema de propulsão, este gerava uma velocidade máxima de dezoito (33 quilômetros por hora). Como construído, ele foi equipado com mastros militares pesados, mas estes foram rapidamente substituídos por equivalentes treliçados em 1909. Ele tinha uma tripulação de 561 oficiais e praças, que aumentaram para 779 – 813.

O navio estava armado com uma bateria principal de quatro canhões de 305 milímetros, com 40 calibres de comprimento, em duas torres de canhão gêmeas na linha central, uma à frente e uma à ré. A bateria secundária consistia em dezesseis canhões Mark VI de 152 milímetros, com 50 calibres de comprimento, que foram colocados em casamatas no casco. Para defesa de curto alcance contra torpedeiros, ele carregava seis canhões de 76 milímetros, com 50 calibres de comprimento montados em casamatas ao longo da lateral do casco, oito canhões de 3 libras e seis canhões de 1 libra. Como era padrão para os navios capitais da época, o Missouri carregava dois tubos de torpedos de 457 milímetros, submersos em seu casco na lateral.

O cinturão blindado do Missouri tinha 279 milímetros de espessura sobre os paióis e as casas das máquinas de propulsão e 203 milímetros em outro lugares. As torres de canhão da bateria principal tinham 305 milímetros em seus lados, e as barbetas de suporte tinham a mesma espessura de blindagem em seus lados expostos. A blindagem de 152 milímetros protegia as paredes casamatadas da bateria secundária. A torre de comando tinha 254 milímetros em seus lados.

Histórico de serviço

1900 – 1907

O Missouri teve sua quilha batida na Newport News Shipbuilding & Drydock Company em 7 de fevereiro de 1900, o terceiro membro da classe a ter sua construção iniciada. Ele foi lançado em 28 de dezembro de 1901 e comissionado na frota em 1º de dezembro de 1903. O navio foi designado para a Frota do Atlântico Norte após entrar em serviço. Ele partiu de Norfolk para começar seus testes de mar em Virginia Capes em 4 de fevereiro de 1904, antes de se juntar ao resto da frota no Caribe para exercícios de treinamento.

Em 13 de abril, o navio sofreu um acidente durante o treinamento de artilharia; o canhão de 305 milímetros de bombordo em sua torre traseira disparou para trás e acendeu três cargas de propelente na torre. O incêndio resultante sufocou 36 homens na torre, embora a ação rápida entre os membros sobreviventes da tripulação da torre impedisse que o fogo se espalhasse para os paióis, onde teria destruído o navio. Por suas ações, três homens receberam a Medalha de Honra. O Missouri voltou a Newport News para reparos, que foram concluídos no início de junho. Em 9 de junho, o Missouri deixou Newport News para uma viagem pelo Mediterrâneo, chegando de volta a Nova York em 17 de dezembro. Ele permaneceu com a Frota do Atlântico Norte pelos próximos três anos conduzindo treinamento normal em tempos de paz. Nesse período, a frota passou a se chamar Frota do Atlântico. O Missouri ajudou no trabalho de socorro em Kingston, Jamaica, de 17 a 19 de janeiro de 1907, após um forte terremoto ali. Em abril daquele ano, ele participou da Exposição de Jamestown. As cerimônias foram realizadas para comemorar o 300º aniversário da colônia de Jamestown. Uma frota internacional que incluía navios de guerra britânicos, franceses, alemães, japoneses e austro-húngaros juntou-se à Marinha dos Estados Unidos no evento.

Grande Frota Branca
A próxima ação significativa do Missouri foi o cruzeiro da Grande Frota Branca ao redor do mundo, que começou com uma revista naval para o presidente Theodore Roosevelt em Hampton Roads. O cruzeiro da Grande Frota Branca foi concebido como uma forma de demonstrar o poder militar americano, particularmente para o Japão. As tensões começaram a aumentar entre os Estados Unidos e o Japão após a vitória deste último na Guerra Russo-Japonesa em 1905, particularmente sobre a oposição racista à imigração japonesa para os Estados Unidos. A imprensa de ambos os países começou a clamar pela guerra, e Roosevelt esperava usar a demonstração de poderio naval para deter a agressão japonesa.

Em 17 de dezembro, a frota partiu de Hampton Roads e navegou para o sul até o Caribe e depois para a América do Sul, fazendo escalas em Port of Spain, Rio de Janeiro, Punta Arenas e Valparaíso, entre outras cidades. Depois de chegar ao México em março de 1908, a frota passou três semanas praticando artilharia. A frota então retomou sua viagem pela costa do Pacífico das Américas, parando em São Francisco e Seattle antes de cruzar o Pacífico para a Austrália, parando no Havaí no caminho. As paradas no Pacífico Sul incluíram Melbourne, Sydney e Auckland.

Após deixar a Austrália, a frota virou para o norte para as Filipinas, parando em Manila, antes de seguir para o Japão, onde uma cerimônia de boas-vindas foi realizada em Yokohama. Seguiram-se três semanas de exercícios na Baía de Subic, nas Filipinas, em novembro. Os navios passaram por Cingapura em 6 de dezembro e entraram no Oceano Índico; eles carvoaram em Colombo antes de prosseguir para o Canal de Suez e carvoar novamente em Porto Saíde, Egito. A frota fez escala em vários portos do Mediterrâneo antes de parar em Gibraltar, onde uma frota internacional de navios de guerra britânicos, russos, franceses e holandeses saudou os americanos. Os navios então cruzaram o Atlântico para retornar a Hampton Roads em 22 de fevereiro de 1909, tendo percorrido 86 542 quilômetros. Lá, eles realizaram uma revista naval para Roosevelt.

Carreira posterior

O Missouri passou os anos seguintes parado, com reativações periódicas para cruzeiros de treinamento de verão para aspirantes da Academia Naval dos Estados Unidos. Ele foi temporariamente reduzido ao status de reserva em 1º de maio de 1910 em Boston, embora tenha sido recomissionado em 1 de junho de 1911 para servir na Frota do Atlântico. Em junho de 1912, o navio foi enviado a Cuba com um contingente de fuzileiros navais para proteger os interesses americanos durante uma rebelião no país. Ele conduziu um cruzeiro de treinamento de aspirantes em julho antes de ser desativado pela segunda vez em 9 de setembro, desta vez na Filadélfia. Ele voltou ao serviço em 16 de março de 1914 para outro cruzeiro de aspirantes, que visitou a Itália e a Grã-Bretanha. Em 2 de dezembro, ele foi novamente desativado antes de retornar ao serviço em 15 de abril de 1915 para um cruzeiro de aspirantes no Caribe, através do Canal do Panamá, e para visitar portos na Califórnia. Depois de chegar de volta à Filadélfia, ele foi reduzido a membro da Frota de Reserva mais uma vez em 18 de outubro. Outro período de serviço ativo começou em 2 de maio de 1916 para um cruzeiro de treinamento ao longo da costa leste dos Estados Unidos e no Caribe, antes que o Missouri fosse novamente paralisado no final do ano.
Em 6 de abril de 1917, os Estados Unidos declararam guerra à Alemanha, entrando na Primeira Guerra Mundial. O Missouri foi recomissionado em 23 de abril para servir como navio de treinamento para artilheiros e pessoal da casa de máquinas, com base na Baía de Chesapeake. O contra-almirante Hugh Rodman içou sua bandeira a bordo do Missouri em 26 de agosto, como comandante da 2.ª Divisão da Frota do Atlântico. Em 11 de novembro de 1918, a Alemanha assinou o armistício que pôs fim à guerra. O Missouri foi posteriormente usado para transportar soldados americanos de volta da Europa como parte da Cruiser and Transport Force. Sua primeira viagem começou em 15 de fevereiro de 1919, quando ele partiu de Norfolk; mais três seguiriam naquele ano. Nas quatro viagens, ele carregou 3.278 soldados de volta aos Estados Unidos. O antigo encouraçado foi desativado pela última vez em 8 de setembro de 1919 no Philadelphia Navy Yard. O Missouri foi vendido para a J.G. Hitner e a W.F. Cutler da Filadélfia em 26 de janeiro de 1922 e posteriormente desmontado para sucata.

Bibliografia

Ligações externas

Classe Maine
Navios de 1901
Navios construídos na Virgínia
Navios construídos pela Newport News Shipbuilding
Couraçados da Marinha dos Estados Unidos

USS Missouri (BB-11)


John Wynn,  baronnet (1628 - ) est un propriétaire terrien gallois et homme politique conservateur qui siège à la Chambre des communes anglaise et britannique entre 1679 et 1713.

Début de la vie
Wynn est le fils unique d'Henry Wynn de Rhiwgoch, Merioneth, et fait ses études à l'Inner Temple en 1646. Il hérite du domaine Watstay par son mariage avec Jane Evans (fille d'Eyton Evans de Watstay), qu'il rebaptise le domaine Wynnstay. Il aurait également remporté le manoir de Stanwardine dans le Shropshire de Thomas Corbett dans une course d'escargots.

Il succède à son cousin  en tant que baronnet en 1674 mais n'hérite pas du domaine Gwydyr, qui passe à la fille de son prédécesseur, Mary.

Carrière
Wynn est haut shérif du Denbighshire de 1671 à 1671, haut shérif de Caernarvonshire de 1674 à 1675 et haut shérif du Merionethshire de 1675 à 1676. Il est Custos Rotulorum de Merionethshire pour 1678-1688, 1690-1696 et 1700-1711 .

Wynn est élu député de Merioneth en 1679. Il est réélu en 1685 et occupe le siège jusqu'en 1695. Aux élections générales anglaises de 1698, il est réélu député des arrondissements de Caernarvon. Aux élections générales anglaises de 1705, il est réélu sans opposition comme député du Caernarvonshire. Il est réélu sans opposition aux élections générales britanniques de 1708 et aux élections générales britanniques de 1710. Il prend sa retraite aux élections générales britanniques de 1713.

Héritage
Wynn a vécu jusqu'à 90 ans, résidant principalement à Londres, mais est décédé sans descendance en 1719. À sa mort, la baronnie de Wynn s'éteint et l'ancienne maison d'Aberffraw (qui prétendait descendre directement de Rhodri Mawr ap Merfyn à la fin du  siècle et à travers lui jusqu'à la lignée légendaire de Brutus) est laissée sans descendance masculine connue.

Sans héritier clair, il lègue l'intégralité du domaine Wynnstay à Jane Thelwall (arrière-petite-fille de John Wynn (1er baronnet)) mariée à William Williams (2e baronnet) (vers 1665 – 20 octobre 1740). John Wynn et William Williams sont les deux plus grands propriétaires terriens du nord du Pays de Galles à cette époque et, ensemble, le domaine combiné éclipse tous les autres. En l'honneur des ancêtres de sa femme, William Williams change son nom en William Williams-Wynn de Wynnstay.

Le baronnet actuel est David Watkin Williams-Wynn,  baronnet (né en 1940).

Notes et références

Baronnet
Décès en janvier 1719
Naissance en 1628

John Wynn (5e baronnet)


Relative Strangers es una película del 2006, producida por Ram Bergman y dirigida por Greg Glienna sobre guion del propio Glienna y Peter Stass.

Trama

Con treinta y cuatro años de edad, al psicólogo Richard Clayton (Ron Livingston) le confiesan sus padres que fue adoptado. A continuación, se dispone a averiguar quiénes son sus padres biológicos, pero el desastre se produce cuando resulta que sus padres, Frank (Danny DeVito) y Agnes Menure (Kathy Bates), son un desastre total, se ganan su vida como feriantes, y además se van a vivir a su casa y pasan parte de su vida haciéndole pasar momentos bochornosos.

Reparto

 Danny DeVito – Frank Menure
 Kathy Bates – Agnes Menure
 Ron Livingston – Richard Clayton/Menure
 Neve Campbell – Ellen Minnola
 Beverly D'Angelo – Angela Minnola
 Bob Odenkirk – Mitch Clayton
 Edward Herrmann – Doug Clayton
 Christine Baranski – Arleen Clayton
 Martin Mull – Jeffry Morton
 Michael McKean – Ken Hyman
 M. C. Gainey – Spicer
 Star Jones – Holly Davis

Enlaces externos

Películas cómicas de los años 2000
Películas de 2006
Películas de Estados Unidos
Películas en inglés

Relative Strangers


Das Haus Blasiistraße 1 ist ein denkmalgeschütztes Gebäude in der Stadt Quedlinburg in Sachsen-Anhalt.

Lage
Es befindet sich an der Südseite des Quedlinburger Marktplatzes und gehört zum UNESCO-Weltkulturerbe.

Architektur und Geschichte
Das im Denkmalverzeichnis der Stadt als Kaufmannshof bezeichnete Gebäude entstand nach einer Bauinschrift im Jahr 1755. Die Gestaltung ist frühklassizistisch. Markant ist ein von einem Dreiecksgiebel überspannter Kastenerker, über welchem sich ein Zwerchhaus befindet. Die Traufgesimse und Stockschwellen des Hauses weisen spätbarocke Profilierungen auf. In den Gefachen finden sich Zierausmauerungen. Der an der Straße Steinbrücke stehende Flügel entstand 1896 als Neubau in massiver Bauweise. Er verfügt über einen Giebel im Stil der Neorenaissance.

Literatur
 Falko Grubitzsch in: Georg Dehio: Handbuch der deutschen Kunstdenkmäler. Sachsen-Anhalt. Band 1: Ute Bednarz, Folkhard Cremer u. a.: Regierungsbezirk Magdeburg. Neubearbeitung. Deutscher Kunstverlag, München u. a. 2002, ISBN 3-422-03069-7, Seite 748.
 Landesamt für Denkmalpflege Sachsen-Anhalt (Hrsg.): Denkmalverzeichnis Sachsen-Anhalt. Band 7: Falko Grubitzsch, unter Mitwirkung von Alois Bursy, Mathias Köhler, Winfried Korf, Sabine Oszmer, Peter Seyfried und Mario Titze: Landkreis Quedlinburg. Teilband 1: Stadt Quedlinburg. Fliegenkopf, Halle 1998, ISBN 3-910147-67-4, S. 83.

Einzelnachweise

Kulturdenkmal in Quedlinburg
Fachwerkhaus in Quedlinburg
Erbaut in den 1750er Jahren
Blasiistraße (Quedlinburg)
Markt (Quedlinburg)

Blasiistraße 1 (Quedlinburg)


මලායෝ-පොලිනීසියානු සම්භවයක් දරන, මලගාසි භාෂාව, දිවයින පුරා සමස්තයක් ලෙසින් කථනය සඳහා භාවිතා කෙරේ. මැඩගස්කරයෙහි නිල භාෂාවන් මලගාසි, ප්‍රංශ සහ ඉංග්‍රීසි වෙති. මැඩගස්කරය යනු ප්‍රංශ-කථන රටක් වන අතර, මෙම පූර්ව ප්‍රංශ යටත් විජිතයෙහි උගත් ජනයා අතර කථන භාෂාවක් ලෙසින් ප්‍රංශ භාවිතා වෙයි. තවමත් විරල වුවද, ඉංග්‍රීසි, පුළුල් භාෂිතයට ලක් වෙමින් පවතින අතර, 2003 දී, රජය විසින් නියමු ව්‍යාපෘතියක් ලෙසින් පාසල් 44 ක ප්‍රාථමික ශ්‍රේණින් හි ඉංග්‍රීසි උගැන්වීම ඇරඹුවේ මෙම ව්‍යාපෘතිය රට පුරා ක්‍රියාත්මක කිරීමේ බලාපොරොත්තු ඇතිවය. බොහෝ සාම බලකා ස්වේච්ඡා සාමාජිකයින් මෙම කර්තව්‍යය ඉටු කර ගැනීමට ආධාර සපයමින් සහ ගුරුවරුන් පුහුණු කරමින් සහය වෙති.

1958 පළමු ව්‍යවස්ථාවෙන්, මලගාසි ජනරජයෙහි නිල භාෂාවන් ලෙස, මලගාසි සහ ප්‍රංශ නම් කරන ලදි.

1992 ව්‍යවස්ථාව තුල නිල භාෂාවන් පිළිබඳ කිසිදු සඳහනක් නොමැත. ඒ වෙනුවට, ජාතික භාෂාව ලෙසින් මලගාසි නම් කරන ලදි; කෙසේවුවද, බොහෝ මූලාශ්‍රයන් විසින් තවමත්, නිල භාෂාවන් ලෙසින් මලගාසි හා ප්‍රංශ හුවා දක්වන්නේ ඒවා තත්වාකාරයෙන් එම ස්ථාපිතය ආරෝපණය කර ගෙන ඇති බැවිනි. 2000 අප්‍රේල් හිදී, පුරවැසියෙකු විසින් අධිකරණයෙහි නඩුවක් ගොනු කලේ, නිල ලේඛන ප්‍රංශ භාෂාවෙන් පමණක් ප්‍රකාශනයට පත් කිරීම ව්‍යවස්ථා-විරෝධි බව දක්වමිනි. තම තීන්දුව ප්‍රකාශයට පත් කරමින් මහාධිකරණය කරුණු දැක්වූයේ , භාෂා නීතියක් නොමැති විටෙක, ප්‍රංශ සඳහා නිල භාෂා තත්ත්වය ආරෝපණය කල හැකි බවය.

2007 ව්‍යවස්ථාව තුලින්, මලගාසි ජාතික භාෂාව ලෙසින් පවත්වා ගෙන ගියද නිල භාෂා යළි-පිහිටුවන ලදහ: මලගාසි, ප්‍රංශ, සහ ඉංග්‍රීසි. ඉංග්‍රීසි ඇතුළත් කිරීම සඳහා පෙළඹවීමක් ලෙසින් අඩ වශයෙන් හෝ ක්‍රියා කරන්නට ඇත්තේ ඉංග්‍රීසි භාවිතා කරන අසල්වැසි රටවල් හා සමගින් සබඳතා වැඩි දියුණු කිරීම හා විදේශ සෘජු ආයෝජනය දිරිමත් කිරීම යන කාරණාවන්ය.

පුස්තක නාමාවලිය
  Sophie Babault, Langues, école et société à Madagascar : normes scolaires, pratiques langagières, enjeux sociaux, L'Harmattan, 2006, 320 p. ISBN 978-2-296-00690-4

ආශ්‍රිත

බාහිර සබැඳි
 Linguistic map of the world/ Madagascar

මැඩගස්කරය

මැඩගස්කරයෙහි භාෂා


Gimpo (en coreano:김포시, Romanización revisada: gimposi, léase: Kimpo) Es una ciudad en la provincia de Gyeonggi al norte de la república de Corea del Sur. Está ubicada al sur de Seúl a unos 30 km y su área es de 276 km² y su población total es de 232.364 (2010) en 71.000 casas.

El Aeropuerto Internacional de Gimpo es el segundo más grande del país y está ubicado en esta región.

En la ciudad hay 24 escuelas ,11 escuelas de segundaría y 6 escuelas de preparatoria.

Administración
La ciudad de Gimbo se divide en.
 Tongjin (통진읍)
 Gochonmyeon (고촌면)
 Yangchonmyeon (양촌면)
 Daegojmyeon (대곶면)
 Wolgojmyeon (월곶면)
 Haseongmyeon (하성면)
 Gimpo1dong (김포1동)
 Gimpo2dong (김포2동)
 Saudong (사우동)
 Pungmudong (풍무동)

Historia moderna
En 1914, el condado Yangcheon fue fusionado con el condado Gimpo. El condado Yangcheon fue separado en 2 pueblos (Yangdong y Yangseo). En 1958, el aeropuerto internacional Yeouido fue reubicado en Gimpo. En 1963 los pueblos Yangdong y Yangseo fueron incorporaos al condado Yeongdeungpo. En 1973, los pueblos de Gyeyang y Ojeong de Bucheon fueron transferidos a Gimpo. En 1989, partes del pueblo Gyeyang fueron cedidos a Incheon.

Ciudades hermanas
 Hampyeong, Corea del Sur
 Xinmin, República popular China.

Referencias

Enlaces externos

Gimpo.com

Localidades de Gyeonggi

Gimpo


Benincaseae, tribus tikvovki. Sastoji se od 25 rodova.; tipični je beninkasa (Benincasa) iz tropske Afrike i Azije.

Rodovi i broj vrsta

 Tribus Benincaseae Ser.
 Zehneria Endl. (74 spp.)
 Papuasicyos Duyfjes (8 spp.)
 Scopellaria W. J. De Wild. & Duyfjes (2 spp.)
 Citrullus Schrad. ex Eckl. & Zeyh. (7 spp.)
 Raphidiocystis Hook. fil. (5 spp.)
 Peponium Engl. (20 spp.)
 Lagenaria Ser. (6 spp.)
 Indomelothria W. J. De Wild. & Duyfjes (2 spp.)
 Acanthosicyos Welw. ex Hook. fil. (1 sp.)
 Cephalopentandra Chiov. (1 sp.)
 Lemurosicyos Keraudren (1 sp.)
 Borneosicyos W. J. J. O. De Wild. (1 sp.)
 Solena Lour. (2 spp.)
 Benincasa Savi (2 spp.)
 Blastania Kotschy & Peyr. (2 spp.)
 Dactyliandra (Hook. fil.) Hook. fil. (2 spp.)
 Ctenolepis Hook. fil. (1 sp.)
 Khmeriosicyos W. J. De Wild. & Duyfjes (1 sp.)
 Trochomeria Hook. fil. (7 spp.)
 Ruthalicia C. Jeffrey (2 spp.)
 Melothria L. (15 spp.)
 Diplocyclos (Endl.) Post & Kuntze (4 spp.)
 Coccinia Wight & Arn. (31 spp.)
 Muellerargia Cogn. (2 spp.)
 Cucumis L. (62 spp.)

Izvori

Tikvovke

Benincaseae