Fix http to https for all wikipedia entries in index.wml

13 files changed, 52 insertions, 52 deletions

diff --git a/croatian/vote/index.wml b/croatian/vote/index.wml
index f1563fbd0ec..45a2f7f27e5 100644
--- a/croatian/vote/index.wml
+++ b/croatian/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Debian glasačke informacije" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
 <h1 class="title">Debian glasačke informacije</h1>
 
@@ -24,7 +24,7 @@ dostupan i tekst svakog pojedinog glasa, osim ako je glasanje bilo tajno.</p>
 
 <p>
 Debian koristi
-<a href="http://en.wikipedia.org/wiki/Condorcet_method">Condorcetovu
+<a href="https://en.wikipedia.org/wiki/Condorcet_method">Condorcetovu
 metodu</a> za izbor vođe projekta (povezani članak u Wikipediji je prilično
 informativan).
 Pojednostavljeno rečeno, obična Condorcetova metoda se može opisati ovako:
@@ -42,7 +42,7 @@ Problem je u tome što u kompliciranim izborima može biti grupa kružno
 povezanih kandidata, gdje A pobjeđuje B, B pobjeđuje C, a C pobjeđuje A.
 Većina varijacija Condorcetove metode koriste razne načine razrješavanja
 takvih izjednačenja. Pogledajte
-<a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+<a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
 u Wikipediji za detalje.
 Debianova varijacija je opisana u
 <a href="$(HOME)/devel/constitution">ustavu</a>, konkretno u stavku A.6.
@@ -51,5 +51,5 @@ Debianova varijacija je opisana u
 <p>
 Za više informacija o tome kako očitati matricu pobjeda, koja se objavljuje
 kao rezultat glasanja, možete pogledati
-<a href="http://en.wikipedia.org/wiki/Schwartz_method">ovaj primjer</a>.
+<a href="https://en.wikipedia.org/wiki/Schwartz_method">ovaj primjer</a>.
 </p>
diff --git a/danish/vote/index.wml b/danish/vote/index.wml
index 51b691eef4b..5fdcdfc725e 100644
--- a/danish/vote/index.wml
+++ b/danish/vote/index.wml
@@ -1,5 +1,5 @@
 #use wml::debian::template title="Debians afstemningsoplysninger" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 #use wml::debian::votebar
 
 <h1 class="title">Debians afstemningsoplysninger</h1>
@@ -25,7 +25,7 @@ udfaldet samt en liste over alle der stemte, og hvad de stemte.  Desuden er
 teksten fra hver enkelt stemme tilgængelig, med mindre det var en hemmelig
 afstemning.</p>
 
-<p>Debian anvender <a href="http://en.wikipedia.org/wiki/Condorcet_method">\
+<p>Debian anvender <a href="https://en.wikipedia.org/wiki/Condorcet_method">\
 Condorcet-metoden</a> i projektledervalgene (den engelsksprogede artikel på 
 Wikipedia, som der linkes til, er ganske informativ).  Simplificeret kan 
 Condorcets metode forklares som følger:</p>
@@ -42,7 +42,7 @@ kandidater i et tosidet opgør med denne kandidat.
 forbindelse hvor A slår B, B slår C og C slår A.  De fleste af 
 Condorcet-varianterne anvender forskellige metoder til at afgøre 
 stemmelighed.  Se 
-<a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">\
+<a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">\
 Cloneproof Schwartz Sequential Dropping</a> (på engelsk) for flere oplysninger.  
 Debians variant er beskrevet i 
 <a href="$(HOME)/devel/constitution">vedtægterne</a>, helt specifitk i § 
@@ -50,4 +50,4 @@ A.6.</p>
 
 <p>For flere oplysninger om hvordan man læser vindermatriksen, der 
 offentliggøres som resultatet af afstemningen, kan man kigge på et 
-<a href="http://en.wikipedia.org/wiki/Schwartz_method">eksempel</a>.</p>
+<a href="https://en.wikipedia.org/wiki/Schwartz_method">eksempel</a>.</p>
diff --git a/dutch/vote/index.wml b/dutch/vote/index.wml
index 3290885f32a..2578f115302 100644
--- a/dutch/vote/index.wml
+++ b/dutch/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Informatie over stemmingen in Debian" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
     <h1 class="title">Informatie over stemmingen in Debian</h1>
 
@@ -34,7 +34,7 @@
 
     <p>
       Debian gebruikt de
-      <a href="http://en.wikipedia.org/wiki/Condorcet_method">Condorcet-methode</a>
+      <a href="https://en.wikipedia.org/wiki/Condorcet_method">Condorcet-methode</a>
       bij de verkiezing van de projectleider (het wikipedia-artikel waarnaar de
       link doorverwijst, is behoorlijk informatief). Simpel gezegd, kan een
       eenvoudige Condorcet-methode als volgt uitgelegd worden
@@ -51,7 +51,7 @@
        mogelijk is, waarbij A de bovenhand haalt op B, B de bovenhand haalt
        op C en C de bovenhand haalt op A. De meeste variaties op Condorcet
        maken gebruik van verschillende manieren om die knoop te ontwarren.
-       Raadpleeg <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+       Raadpleeg <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
        voor details. De variant die Debian gebruikt wordt in de
        <a href="$(HOME)/devel/constitution">constitutie</a> uitgelegd,
        meer in het bijzonder in § A.6.
@@ -59,5 +59,5 @@
     <p>
       Voor meer informatie over hoe u de matrix moet lezen van wie wie verslaat,
       welke gepubliceerd wordt als uitkomst van de stemming, kunt u dit
-      <a href="http://en.wikipedia.org/wiki/Schwartz_method">voorbeeld</a> bekijken.
+      <a href="https://en.wikipedia.org/wiki/Schwartz_method">voorbeeld</a> bekijken.
     </p>
diff --git a/finnish/vote/index.wml b/finnish/vote/index.wml
index 636b94d8618..881e711da55 100644
--- a/finnish/vote/index.wml
+++ b/finnish/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Debianin äänestystietoa" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
 <h1 class="title">Debianin äänestystietoa</h1>
 
@@ -27,7 +27,7 @@ heidän äänensä oli. Saatavilla on myös teksti jokaisesta äänestä ellei
 kyseessä ole salainen äänestys.</p>
 
 <p>Debian käyttää <a
-href="http://fi.wikipedia.org/wiki/Condorcet%27n_menetelm%C3%A4">Condorcet'n
+href="https://fi.wikipedia.org/wiki/Condorcet%27n_menetelm%C3%A4">Condorcet'n
 menetelmää</a> projektin johtajan vaaleissa (linkki johtaa
 Wikipediaan, erityisesti englanninkielinen artikkeli on melko
 informatiivinen). Yksinkertaisesti perus-Condorcet'n menetelmä voidaan
@@ -45,7 +45,7 @@ vastaehdokkaan kahdenvälisessä äänestyksessä.</p>
 kehälliseen suhteeseen, jossa A voittaa B:n, B voittaa C:n ja C
 voittaa A:n. Useimmat variaatiot Condorcet'sta käyttävät erilaisia
 keinoja tasapelin selvittämiseen. Wikipedian artikkelissa <a
-href="http://fi.wikipedia.org/wiki/Schulzen_menetelm%C3%A4">klooninkestävästä
+href="https://fi.wikipedia.org/wiki/Schulzen_menetelm%C3%A4">klooninkestävästä
 Schwartzin peräkkäispudotuksesta (n.k. Schulzen menetelmä)</a> on
 tarkempaa tietoa. Debianin variaatio on määrätty <a
 href="$(HOME)/devel/constitution">säännöissä</a>, erityisesti §
@@ -53,5 +53,5 @@ A.6.</p>
 
 <p>Lisätietoa lyöntimatriisin, joka julkisestaan äänestystuloksessa,
 lukemisesta voit lukea englanniksi <a
-href="http://en.wikipedia.org/wiki/Schwartz_method#Examples">näistä
+href="https://en.wikipedia.org/wiki/Schwartz_method#Examples">näistä
 esimerkeistä</a>.</p>
diff --git a/french/vote/index.wml b/french/vote/index.wml
index ea7c833665b..3636151f875 100644
--- a/french/vote/index.wml
+++ b/french/vote/index.wml
@@ -1,7 +1,7 @@
 #use wml::debian::template title="Informations sur les votes dans Debian" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
 
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e" translation_maintainer="Christian Couder"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4" translation_maintainer="Christian Couder"
 
 <h1 class="title">Informations sur les votes dans Debian</h1>
 
@@ -36,7 +36,7 @@
 
     <p>
 	Debian utilise la
-	<a href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Condorcet">méthode
+	<a href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Condorcet">méthode
 	Condorcet</a> pour les élections du chef du
 	projet (l'article de Wikipedia du lien est très instructif).
 	Pour simplifier, la méthode originale de Condorcet peut être
@@ -57,7 +57,7 @@
 	bat C et C bat A. La plupart des variantes de la méthode de
 	Condorcet utilisent divers moyens pour résoudre ces cas de
 	ballottage. Voyez
-	<a href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">la suppression séquentielle de Schwartz sans doublons</a>
+	<a href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">la suppression séquentielle de Schwartz sans doublons</a>
 	pour plus de détails.
 	La variante utilisée par Debian est décrite dans
 	<a href="$(HOME)/devel/constitution">la
@@ -68,5 +68,5 @@
 	Pour plus d'informations sur la façon de lire la matrice des
 	préférences, qui est publiée comme résultat de scrutin, vous
 	pouvez regarder cet
-	<a href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze#Exemple">exemple</a>.
+	<a href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze#Exemple">exemple</a>.
     </p>
diff --git a/german/vote/index.wml b/german/vote/index.wml
index a91ddce48cf..dc341383df1 100644
--- a/german/vote/index.wml
+++ b/german/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Debian-Abstimmungs-Informationen" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 # $Id$
 # Translator: Noel Köthe, noel@koethe.net, 2001-06-20
 
@@ -35,7 +35,7 @@
 
   <p>
     Debian benutzt die
-    <a href="http://de.wikipedia.org/wiki/Condorcet-Methode">Condorcet-Methode</a>
+    <a href="https://de.wikipedia.org/wiki/Condorcet-Methode">Condorcet-Methode</a>
     für die Wahl zum Projektleiter (der Wikipedia-Text ist
     sehr informativ). Vereinfachend kann die grundlegende
     Condorcet-Methode folgendermaßen beschrieben werden:
@@ -54,7 +54,7 @@
     B siegt, B über C siegt und C über A siegt. Die meisten
     Variationen von Condorcet verwenden verschiedene Mittel,
     um diese Pattsituation aufzulösen. Siehe
-    <q><a href="http://de.wikipedia.org/wiki/Schulze-Methode">Cloneproof
+    <q><a href="https://de.wikipedia.org/wiki/Schulze-Methode">Cloneproof
     Schwartz Sequential Dropping</a></q> für Details. Die Variation von
     Debian ist in
     <a href="$(HOME)/devel/constitution">der Satzung</a>
@@ -63,6 +63,6 @@
   <p>
     Für weitere Informationen darüber, wie die Ergebnismatrix zu lesen ist,
     die als Resultat der Wahl veröffentlicht wird, können Sie sich dieses
-    <a href="http://de.wikipedia.org/wiki/Schulze-Methode">Beispiel</a>
+    <a href="https://de.wikipedia.org/wiki/Schulze-Methode">Beispiel</a>
     ansehen.
   </p>
diff --git a/japanese/vote/index.wml b/japanese/vote/index.wml
index 5cd9758c6e3..b5144c55aef 100644
--- a/japanese/vote/index.wml
+++ b/japanese/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Debian 投票情報" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
 <h1 class="title">Debian 投票情報</h1>
 
@@ -23,7 +23,7 @@
 できます。</p>
 
 <p>Debian は、プロジェクトリーダー選挙で
-<a href="http://en.wikipedia.org/wiki/Condorcet_method">コンドルセメソッド</a>を
+<a href="https://en.wikipedia.org/wiki/Condorcet_method">コンドルセメソッド</a>を
 使っています (リンク先の wikipedia の記述がとても参考になります)。きわめて簡潔に
 述べれば、コンドルセメソッドとは以下のようなものです:</p>
 
@@ -39,12 +39,12 @@
 C は A に勝つといった堂々巡りの関係が発生しうることがあります。これを
 解決するために、大半のコンドルセメソッドの変種は様々な手段を使っています。
 詳細については
-<a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+<a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
 を参照してください。Debian 式の変種については
 <a href="$(HOME)/devel/constitution">Debian 憲章</a>
 の付録 A において詳細に述べられています。</p>
 
 <p>投票結果として公開された勝敗マトリックスの読み方に関する詳細は、
-<a href="http://en.wikipedia.org/wiki/Schwartz_method">例</a>を
+<a href="https://en.wikipedia.org/wiki/Schwartz_method">例</a>を
 参照してください。</p>
 
diff --git a/polish/vote/index.wml b/polish/vote/index.wml
index 5e4f9191a78..9c5ef9d5dfa 100644
--- a/polish/vote/index.wml
+++ b/polish/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Informacje o głosowaniach Debiana" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
     <h1 class="title">Informacje o głosowaniach Debiana</h1>
 
@@ -35,7 +35,7 @@
 
     <p>
       Debian używa 
- <a href="http://en.wikipedia.org/wiki/Condorcet_method">metody Condorcet</a> 
+ <a href="https://en.wikipedia.org/wiki/Condorcet_method">metody Condorcet</a> 
       przy wyborze Lidera Projektu (artykuł na który wskazuje odnośnik 
       jest dość pouczający). Upraszczając, można ją opisać tak:
     </p>
@@ -53,7 +53,7 @@
        kandydat A pokonuje B, B pokonuje C a C pokonuje A. 
        Większość odmian metody Condorcet używa różnych środków 
        aby rozwiązać ten problem. Strona 
-       <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+       <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
        opisuje to bardziej szczegółowo. Odmiana używana przez 
        Debiana jest opisana w        
        <a href="$(HOME)/devel/constitution">statucie</a>, 
@@ -63,5 +63,5 @@
       Dodatkowe informacje o tym, jak czytać macierz wyników, 
       która jest publikowana jako wynik głosowania, można 
       znaleźć w tym 
-      <a href="http://en.wikipedia.org/wiki/Schwartz_method">przykładzie</a>.
+      <a href="https://en.wikipedia.org/wiki/Schwartz_method">przykładzie</a>.
     </p>
diff --git a/portuguese/vote/index.wml b/portuguese/vote/index.wml
index 708d68dca06..b3b3d16ceda 100644
--- a/portuguese/vote/index.wml
+++ b/portuguese/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Informações sobre Votações do Debian" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
 <H1 class="title">Informações sobre votações do Debian</H1>
 
@@ -34,7 +34,7 @@
 
 	<p>
 	  O Debian usa o <a
-	  href="http://en.wikipedia.org/wiki/Condorcet_method">método
+	  href="https://en.wikipedia.org/wiki/Condorcet_method">método
 	  Condorcet</a> para as eleições do líder do projeto (o artigo
 	  da wikipedia linkado é bem informativo). Simplisticamente, o
 	  método Condorcet puro pode ser definido como segue
@@ -52,7 +52,7 @@
 	  circulares nas quais A bate B, B bate C e C bate A. A maioria
 	  das variações do Condorcet usam vários modos para resolver
 	  este empate.  Veja <a
-	  href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+	  href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
 	  para detalhes. a variação do Debian está explicada na <a
 	  href="$(HOME)/devel/constitution">constituição</a>,
 	  especificamente em § A.6.
@@ -61,5 +61,5 @@
 	  Para mais informações sobre como ler a matriz de confrontos,
 	  que é publicada conforme o resultado dos votos, você pode olhar
 	  este <a
-	  HREF="http://en.wikipedia.org/wiki/Schwartz_method">exemplo</A>.
+	  HREF="https://en.wikipedia.org/wiki/Schwartz_method">exemplo</A>.
 	</p>
diff --git a/romanian/vote/index.wml b/romanian/vote/index.wml
index 4bdbdf95c19..0de00f6f145 100644
--- a/romanian/vote/index.wml
+++ b/romanian/vote/index.wml
@@ -1,4 +1,4 @@
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 #use wml::debian::template title="Informații despre votarea din organizație" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
 
@@ -32,7 +32,7 @@
 
     <p>
       Debian folosește
-      <a href="http://en.wikipedia.org/wiki/Condorcet_method">metoda Condorcet
+      <a href="https://en.wikipedia.org/wiki/Condorcet_method">metoda Condorcet
         </a> pentru alegerile de leader
       (a se vedea articolul wikipedia mentionat).
       In mare, metoda Condorcet poate fi descrisă astfel: 
@@ -50,7 +50,7 @@
        circulară de tipul A invinge B, B invinge C,
        C invinge A. Majoritatea variantelor metodei Condorcet folosesc
        diverși algoritmi pentru rezolvarea problemei.  A se vedea 
-       <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
+       <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
        pentru detalii.  Varianta Debian este descrisă în 
        <a href="$(HOME)/devel/constitution">constituție</a>,
        in mod concret, § A.6.
@@ -58,5 +58,5 @@
     <p>
       Pentru informații privind matricea de competitori,
       care se publică în urma voturilor, vedeți acest 
-      <a href="http://en.wikipedia.org/wiki/Schwartz_method">exemplu</a>.
+      <a href="https://en.wikipedia.org/wiki/Schwartz_method">exemplu</a>.
     </p>
diff --git a/russian/vote/index.wml b/russian/vote/index.wml
index db8507107bc..eea52efb8e6 100644
--- a/russian/vote/index.wml
+++ b/russian/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Информация о голосованиях Debian" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
     <h1 class="title">Информация о голосованиях Debian</h1>
 
@@ -33,7 +33,7 @@
 
     <p>
       Debian использует
-      <a href="http://en.wikipedia.org/wiki/Condorcet_method">метод
+      <a href="https://en.wikipedia.org/wiki/Condorcet_method">метод
         Кондорсе (Condorset)</a> для выбора лидера проекта (ссылка на
 	статью в википедии достаточно информативна).
       В упрощенном виде чистый метод Кондорсе можно описать так:
@@ -52,7 +52,7 @@
        зависимости, когда A обходит B, B обходит C, а C обходит A.
        Большинство вариаций метода Кондорсе используют различные
        способы для решения этой проблемы. Смотрите детали в
-       <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Концепции
+       <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Концепции
        последовательного отброса Шварца (Schwartz)</a>.
        Вариация, используемая в Debian, описана в
        <a href="$(HOME)/devel/constitution">конституции</a>,
@@ -61,5 +61,5 @@
     <p>
       Информацию о том, как читать матрицу борьбы, которая публикуется
       как результат выборов, вы можете увидеть на этом
-      <a href="http://en.wikipedia.org/wiki/Schwartz_method">примере</a>.
+      <a href="https://en.wikipedia.org/wiki/Schwartz_method">примере</a>.
     </p>
diff --git a/spanish/vote/index.wml b/spanish/vote/index.wml
index cfc00bf6abe..5cacc404f96 100644
--- a/spanish/vote/index.wml
+++ b/spanish/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Información de votaciones en Debian" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e" maintainer="David Moreno Garza"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4" maintainer="David Moreno Garza"
 
 <h1 class="title">Información de votaciones en Debian</h1>
 	<p>El Proyecto Debian dispone de un sistema de
@@ -29,7 +29,7 @@
 
 	<p>
 	Debian utiliza el
-      	<a href="http://en.wikipedia.org/wiki/Condorcet_method">método Condorcet</a> 
+      	<a href="https://en.wikipedia.org/wiki/Condorcet_method">método Condorcet</a> 
 	para elecciones del líder del proyecto (el artículo enlazado de Wikipedia
 	es bastante informativo).
     	</p>
@@ -46,7 +46,7 @@
        circulares en las que A vence a B, B vence a C and C vence a A. La mayoría de las
        variaciones en Condorcet utiliza varios criterios para resolver el desempate.
        Vea el <a 
-       href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof
+       href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof
        Schwartz Sequential Dropping</a> para mayor información. La variación en Debian está
        establecida en <a href="$(HOME)/devel/constitution">la constitución</a>,
        específicamente, § A.6.
@@ -54,5 +54,5 @@
     <p>
       Para mayor información en cómo leer la maraña de resultados, que es publicada como
       resultado de las votaciones, puede ver este
-      <a href="http://en.wikipedia.org/wiki/Schwartz_method">ejemplo</a>.
+      <a href="https://en.wikipedia.org/wiki/Schwartz_method">ejemplo</a>.
     </p>
diff --git a/swedish/vote/index.wml b/swedish/vote/index.wml
index 3421a443d68..b13de6fad4f 100644
--- a/swedish/vote/index.wml
+++ b/swedish/vote/index.wml
@@ -1,6 +1,6 @@
 #use wml::debian::template title="Debians omröstningsinformation" BARETITLE="true" NOHEADER="true" NOHOMELINK="true"
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="61f9fa6e2b8dfae00fbddbad3fad546329e16f6e"
+#use wml::debian::translation-check translation="5127161ff176cab5734ac40fd7c6f6ccf12526f4"
 
 <h1 class="title">Debians omröstningsinformation</h1>
 <p>Debianprojektet har ett rösthanteringssystem
@@ -33,7 +33,7 @@ omröstningen inte var hemlig.
 
 <p>
 Debian använder
-<a href="http://en.wikipedia.org/wiki/Condorcet_method">Condorcet-metoden</a>
+<a href="https://en.wikipedia.org/wiki/Condorcet_method">Condorcet-metoden</a>
 för val av projektledare (den länkade wikipediaartikeln innehåller en hel
 del information).
 Enkelt sagt kan den normala Condorcetmetoden förklaras med
@@ -53,7 +53,7 @@ där A slår B, B slår C och C slår A.
 De flesta varianter av Condorcet använder olika sätt att lösa sådana döda
 lopp.
 Se
-<a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof
+<a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof
 Schwartz Sequential Dropping</a> för detaljer.
 Debians variant beskrivs i
 <a href="$(HOME)/devel/constitution">stadgarna</a>,
@@ -63,5 +63,5 @@ specifikt i § A.6.
 <p>
 För ytterligare information om hur du läser utslagsmatrisen, vilken
 publiceras som omröstningsresultat, kan du se detta
-<a href="http://en.wikipedia.org/wiki/Schwartz_method">exempel</a>.
+<a href="https://en.wikipedia.org/wiki/Schwartz_method">exempel</a>.
 </p>