Ethics Codes Of The Hungarian Top 200 Companies

The aim of this current article is to summarize the statements regarding the code of ethics examined in the empirical research of the Hungarian TOP 200 corporate ethics institution system. This study was conducted by the Ethics and Transparency work team of the Hungarian Business Leaders Forum. The research indicates that in Hungary, similar to transitional economies, the codes of ethics are also undeveloped. The main purposes of introducing the code of ethics include providing guidelines for employees, declaring ethical commitment, and the development of company’s culture. Based on the topics, emphasis is laid on protecting the interests of the companies. However, improving competitiveness and meeting the expectations of stakeholders plays an insignificant role. The practice of the code of ethics in the Hungarian large companies contradicts the global tendency that the codes are more and more comprehensive. Thus, they contain several objectives that define corporate responsibility, and they not only focus on the do's and don’ts of employees

TiO2-doped resorcinol–formaldehyde (RF) polymer and carbon gels with photocatalytic activity

Resorcinol-formaldehyde (RF) polymer gels offer a relatively easy and versatile route for incorporating metals into a carbon aerogel matrix. The hybrid materials thus obtained are ideal candidates for applications involving enhanced adsorption or catalysis. This paper presents a detailed study of Ti-doped RF and carbon aerogels. The metal was introduced into the system at three different stages of the preparation process: during polymerization, by impregnation of the RF gel, or by impregnation of the carbon gel. The structure and morphology of the samples are compared using low temperature N2 adsorption, SEM, and small and wide angle X-Ray scattering (SAXS/WAXS) methods. The TiO2-doped carbon aerogels display photocatalytic activity in breaking down aromatic compounds

Az online gyakorló tesztek bevezetésének első tapasztalatai a Dr. Ámbédkar Iskolában

A tanulás hatékonyságának fontos eleme - a tanulással eltöltött megfelelő mennyiségű idő mellett - a jól megválasztott forma. A tesztelés a szakemberek által is a leghatékonyabbnak tartott tanulási módszerek egyike, amelynél az előhívás szerves részévé válik a tanulásnak. Ez a módszer egy online oktatási platform használatával úgy valósítható meg, hogy alkalmazásakor a tanár terhelése nem növekszik, sőt amennyiben rendelkezésére áll a feladatbank, amiből a tesztelés folyik, komoly könnyítést jelent számára. A halmozottan hátrányos helyzetű diákok oktatásával, nevelésével foglalkozó Dr. Ámbédkar Iskolában a 2021/2022-es tanévben kísérleti jelleggel a hagyományos tanulást, tanítást rendszeres online teszteléssel egészítettük ki. Ennek a munkának a tapasztalatait, tanulságait szeretnénk megosztani

Pentagons in medieval architecture

Among regular polygons, the pentagon is considered to be barely used in medieval architectural compositions, due to its odd spatial appearance and difficult method of construction. The pentagon, representing the number five has a rich semantic role in Christian symbolism. Even though the proper way of construction was already invented in the Antiquity, there is no evidence of medieval architects having been aware of this knowledge. Contemporary sources only show approximative construction methods. In the Middle Ages the form has been used in architectural elements such as window traceries, towers and apses. As opposed to the general opinion supposing that this polygon has rarely been used, numerous examples bear record that its application can be considered as rather common. Our paper attempts to give an overview of the different methods architects could have used for regular pentagon construction during the Middle Ages, and the ways of applying the form

4G/5G polymorphism of PAI-1 gene is associated with multiple organ dysfunction and septic shock in pneumonia induced severe sepsis: prospective, observational, genetic study

In Caucasian patients with severe sepsis due to pneumonia carriers of the 4G allele of PAI-1 polymorphism have higher risk for multiple organ dysfunction syndrome and septic shock and in agreement they showed more fulminant disease progression based on continuous clinical variables

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth

We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decompositions of small treewidth decompose the graph with small vertex separators, decompositions with small cutwidth decompose the graph with small edge separators. Let p,q ∈ ℕ such that p is a prime and q ≥ 3. We show: - If p divides q-1, there is a (q-1)^{ctw}n^{O(1)} time algorithm for counting list q-colorings modulo p of n-vertex graphs of cutwidth ctw. Furthermore, there is no ε > 0 for which there is a (q-1-ε)^{ctw} n^{O(1)} time algorithm that counts the number of list q-colorings modulo p of n-vertex graphs of cutwidth ctw, assuming the Strong Exponential Time Hypothesis (SETH). - If p does not divide q-1, there is no ε > 0 for which there exists a (q-ε)^{ctw} n^{O(1)} time algorithm that counts the number of list q-colorings modulo p of n-vertex graphs of cutwidth ctw, assuming SETH. The lower bounds are in stark contrast with the existing 2^{ctw}n^{O(1)} time algorithm to compute the chromatic number of a graph by Jansen and Nederlof [Theor. Comput. Sci.'18]. Furthermore, by building upon the above lower bounds, we obtain the following lower bound for counting connected spanning edge sets: there is no ε > 0 for which there is an algorithm that, given a graph G and a cutwidth ordering of cutwidth ctw, counts the number of spanning connected edge sets of G modulo p in time (p - ε)^{ctw} n^{O(1)}, assuming SETH. We also give an algorithm with matching running time for this problem. Before our work, even for the treewidth parameterization, the best conditional lower bound by Dell et al. [ACM Trans. Algorithms'14] only excluded 2^{o(tw)}n^{O(1)} time algorithms for this problem. Both our algorithms and lower bounds employ use of the matrix rank method, by relating the complexity of the problem to the rank of a certain "compatibility matrix" in a non-trivial way