Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 3
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

The issue of war reparations was a subject of controversy in Polish-German relations for a long time. This was due to the position of the Federal Republic of Germany that this issue had been deferred to the moment of German unification. The German concept of reparations also included the individual claims of Polish victims of National Socialism (Nazism). The case for interstate reparations from Germany to Poland was closed as a result of the Polish waiver of 1953, while the issue of individual compensation for Polish victims was symbolically resolved as a result of agreements between Poland and the Federal Republic of Germany only in 1990 and 2000. The scope and amount of any new payments depends on the agreements of particular countries or organizations with the Federal Republic of Germany. As long as the victims are still alive, new pragmatic solutions should not be ruled out.
Go to article

Authors and Affiliations

Jerzy Kranz
1 2

  1. Kozminski University (Warsaw)
  2. former ambassador in Germany and Undersecretaryof State at the Ministry of Foreign Affairs
Download PDF Download RIS Download Bibtex

Abstract

Among the most important expressions of the cultural identity of the Silesians are the Silesian dialect and Silesian cuisine. The German-Polish cultural and linguistic contacts that have been present in Silesia for centuries are also manifested in the culinary vocabulary of the regionʼs inhabitants. In addition to numerous loan words of German provenance, which have also been incorporated into Polish literary language, many other lexemes are found in Silesian variety that are related to eating and drinking and have only regional distribution. From a contact linguistic perspective, the article focuses on the court terms of German provenance present in the Silesian dialect, mainly addressing the various forms of borrowing.
Go to article

Authors and Affiliations

Daniela Pelka
1
ORCID: ORCID

  1. Institut für Sprachwissenschaft Universität Oppeln, Polen
Download PDF Download RIS Download Bibtex

Abstract

Aiming to address power consumption issues of various equipment in metro stations and the inefficiency of peak shaving and valley filling in the power supply system, this study presents an economic optimization scheduling method for the multi-modal “source-network-load-storage” system in metro stations. The proposed method, called the Improved Gray Wolf Optimization Algorithm (IGWO), utilizes objective evaluation criteria to achieve economic optimization. First, construct a mathematical model of the “sourcenetwork- load-storage” joint system with the metro station at its core. This model should consider the electricity consumption within the station. Secondly, a two-layer optimal scheduling model is established, with the upper model aiming to optimize peak elimination and valley filling, and the lower model aiming to minimize electricity consumption costs within a scheduling cycle. Finally, this paper introduces the IGWO optimization approach, which utilizes meta-models and the Improved Gray Wolf Optimization Algorithm to address the nonlinearity and computational complexity of the two-layer model. The analysis shows that the proposed model and algorithm can improve the solution speed and minimize the cost of electricity used by about 5.5% to 8.7% on the one hand, and on the other hand, it improves the solution accuracy, and at the same time effectively realizes the peak shaving and valley filling, which provides a proof of the effectiveness and feasibility of the new method.
Go to article

Authors and Affiliations

Jingjing Tian
1
Yu Qian
1
Feng Zhao
1 2
Shenglin Mo
1
Huaxuan Xiao
1
Xiaotong Zhu
1
Guangdi Liu
1

  1. School of Automation and Electrical Engineering, Lanzhou Jiaotong University Lanzhou, China
  2. Key Laboratory of Opto-Technology and Intelligent Control Ministry of Education Lanzhou, China

This page uses 'cookies'. Learn more