@inproceedings{MTMT:34560996,
	title = {Kulcsszógenerálás magyar nyelvű, hosszú szövegekből nagy nyelvi modellekkel},
	url = {https://m2.mtmt.hu/api/publication/34560996},
	author = {Dodé, Réka and Yang, Zijian Győző},
	booktitle = {XX. Magyar Számítógépes Nyelvészeti Konferencia},
	unique-id = {34560996},
	year = {2024},
	pages = {257-267}
}

@inproceedings{MTMT:34560795,
	title = {Az egészség jele a szöveg EGÉSZsége? - Szövegkoherencia borderline személyiségzavarban},
	url = {https://m2.mtmt.hu/api/publication/34560795},
	author = {Felletár, Fanni and Yang, Zijian Győző and Babarczy, Anna},
	booktitle = {XX. Magyar Számítógépes Nyelvészeti Konferencia},
	unique-id = {34560795},
	year = {2024},
	pages = {201-214}
}

@article{MTMT:34303566,
	title = {The hyper-Wiener Index of diamond nanowires},
	url = {https://m2.mtmt.hu/api/publication/34303566},
	author = {Nagy, Benedek},
	doi = {10.1002/qua.27258},
	journal-iso = {INT J QUANTUM CHEM},
	journal = {INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY},
	volume = {124},
	unique-id = {34303566},
	issn = {0020-7608},
	abstract = {Carbon nanowires based on various structures have various applications. In this article, our focus is on diamond nano-wires, based on the structure of the diamond. Our goal is to characterize these nanowires by providing their hyper-Wiener index, one of the basic topological graph indices. The diamond is formed by carbon atoms in a compact structure: every atom has exactly four neighbors connected by covalent bonds according to the simplest three-dimensional polyhedron. Considering an atom in the center of a tetrahedron, its neighbors, the atoms connected to it by bonds, are located in the corners of the tetrahedron. In this article, this "diamond-grid" structure is analysed in the case that the graphs correspond to connected parts of sequences of unit cells, in this way forming nanowires of various lengths. By a combinatorial approach, a closed formula is proven for the hyper-Wiener index based on the graph-distances of every pair of carbon atoms (i.e., the minimal number of edges connecting the atoms), and this formula depends only on the size of the graph in terms of the number of unit cells included.},
	keywords = {crystal structure; Shortest paths; mathematical chemistry; carbon nanowires; compactness measures; diamond cubic lattice; topological graph indices},
	year = {2024},
	eissn = {1097-461X}
}

@article{MTMT:34623343,
	title = {Formal verification for quantized neural networks},
	url = {https://m2.mtmt.hu/api/publication/34623343},
	author = {Kovásznai, Gergely and Kiss, D.H. and Mlinkó, P.},
	doi = {10.33039/ami.2023.04.003},
	journal-iso = {ANN MATH INFORM},
	journal = {ANNALES MATHEMATICAE ET INFORMATICAE},
	volume = {57},
	unique-id = {34623343},
	issn = {1787-5021},
	abstract = {Despite of deep neural networks are being successfully used in many fields of computing, it is still challenging to verify their trustiness. Previously it has been shown that binarized neural networks can be verified by being encoded into Boolean constraints. In this paper, we generalize this encoding to quantized neural networks (QNNs). We demonstrate how to implement QNNs in Python, using the Tensorflow and Keras libraries. Also, we demonstrate how to implement a Boolean encoding of QNNs, as part of our tool that is able to run a variety of solvers to verify QNNs. © 2023, Eszterhazy Karoly College. All rights reserved.},
	keywords = {Artificial intelligence; Neural network; formal verification; Python; SAT; SMT; Deep learning; constraint programming; Keras},
	year = {2023},
	eissn = {1787-6117},
	pages = {36-48}
}

@article{MTMT:34560870,
	title = {Analyzing Narratives of Patient Experiences: A BERT Topic Modeling Approach},
	url = {https://m2.mtmt.hu/api/publication/34560870},
	author = {Osváth, Mátyás and Yang, Zijian Győző and Kósa, Karolina},
	doi = {10.12700/APH.20.7.2023.7.9},
	journal-iso = {ACTA POLYTECH HUNG},
	journal = {ACTA POLYTECHNICA HUNGARICA},
	volume = {20},
	unique-id = {34560870},
	issn = {1785-8860},
	abstract = {Due to healthcare systems increased focus on healthcare quality and patientcentered care, the patients’ perspective of delivered healthcare, has become an important
		part of healthcare service evaluations. Patient experiences can be used to improve the quality
		of care, as they reveal important information about health care encounters. An increasing
		number of organizations systematically collect and analyze patient experience data. The aim
		of our study was to identify major topics in narratives of patients’ healthcare related
		experiences and analyze the reactions of readers of patient experiences. 1663 blogs and
		298806 textual comments were extracted on non-solicited patient experiences from a
		Hungarian online forum during a 10-year period. Topic modeling with state-of-the-art BERT
		embeddings were used to analyze the data and extract meaningful patterns and concepts.
		Sentiment analysis was utilized to categorize the emotional valence of the narrative writings.
		The huBERT and HIL-SBERT models identified 326 and 200 topics in terms of patient
		experiences and 508 and 728 topics regarding the reactions to these experiences without
		human supervision. Conceptually similar topics were integrated into major categories with
		manual analysis. 94.4% of the experiences and 77.5% of comments were classified as
		negative, reflecting the same annual tendency over the decade. Our study uses a data-driven
		approach for extracting patterns of healthcare related patient opinions, in Hungary. Topic
		modeling, based on BERT embeddings, could provide useful information on patient
		perceptions and perspectives, that could improve healthcare quality and safety},
	year = {2023},
	eissn = {1785-8860},
	pages = {153-171}
}

@article{MTMT:34560462,
	title = {A pseudonymization tool for Hungarian},
	url = {https://m2.mtmt.hu/api/publication/34560462},
	author = {Hatvani, Péter and Laki, László János and Yang, Zijian Győző},
	doi = {10.33039/ami.2023.08.009},
	journal-iso = {ANN MATH INFORM},
	journal = {ANNALES MATHEMATICAE ET INFORMATICAE},
	volume = {58},
	unique-id = {34560462},
	issn = {1787-5021},
	year = {2023},
	eissn = {1787-6117},
	pages = {69-80}
}

@misc{MTMT:34495006,
	title = {Alternatív „robotolás” lehetőségei a közoktatásban. előadás},
	url = {https://m2.mtmt.hu/api/publication/34495006},
	author = {Geda, Gábor},
	unique-id = {34495006},
	year = {2023}
}

@misc{MTMT:34495003,
	title = {Interdiszciplinaritás lehetőségei a nyelvoktatás és az algoritmikus gondolkodás területén. előadás},
	url = {https://m2.mtmt.hu/api/publication/34495003},
	author = {Varga, Éva and Geda, Gábor},
	unique-id = {34495003},
	year = {2023}
}

@article{MTMT:34406590,
	title = {Weighted distances and distance transforms on the triangular tiling},
	url = {https://m2.mtmt.hu/api/publication/34406590},
	author = {Nagy, Benedek},
	doi = {10.1111/tgis.13112},
	journal-iso = {TRANS IN GIS},
	journal = {TRANSACTIONS IN GIS},
	volume = {27},
	unique-id = {34406590},
	issn = {1361-1682},
	abstract = {Digital geometry is a field in the intersection of discrete mathematics and geometry having various applications including geographical information systems (GIS). In digital spaces, in grids, distances can be defined based on steps in paths in somewhat similarly as in graph theory. However, the grids have more definite structures, thus one may obtain more concrete results, for example, close formulae, than on arbitrary graphs. In this article, the weighted (also called chamfer) distances, and based on them, the distance transform are investigated on the regular triangular grid. Three types of neighborhood relations are used on the grid, and therefore, three weights are used to define a distance function. Natural conditions are used on the weights such as they are positive and a larger step (in the usual and also in the Euclidean sense) cannot have a smaller weight than a smaller one. Some properties of the weighted distances are discussed; for example, they are proven to be metrics. We also give algorithms and formulae that compute the weighted distance of any point pair on a triangular grid. Algorithm for weighted distance transform is provided based on wave-front propagation. Therefore, these new distance functions are ready for further applications in GIS, in image processing tasks, in computer vision, in graphics, in networking, and also in other applied fields. © 2023 The Authors. Transactions in GIS published by John Wiley & Sons Ltd.},
	keywords = {Image processing; Geographic Information Systems; Graph theory; Discrete geometry; Digital geometry; Discrete mathematics; Arbitrary graphs; Distance functions; Triangular grid; Distance transforms; Wavefronts; Weighted distance; Geographical information; Digital space},
	year = {2023},
	eissn = {1467-9671},
	pages = {2042-2098}
}

@inproceedings{MTMT:34406589,
	title = {On Languages Generated by Signed Grammars},
	url = {https://m2.mtmt.hu/api/publication/34406589},
	author = {Glu, Ö.E. and Nagy, Benedek},
	booktitle = {Electronic Proceedings in Theoretical Computer Science, EPTCS},
	doi = {10.4204/EPTCS.388.5},
	volume = {388},
	unique-id = {34406589},
	abstract = {We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the words generated also have signs. We use the structure of the formal series of yields of all derivation trees over such a grammar as a method of specifying a formal language and study properties of the resulting family of languages. © Ömer Egecio glu & Benedek Nagy.},
	keywords = {PROPERTY; Context free languages; Context free grammars; context-free grammars; Formal series},
	year = {2023},
	pages = {28-37}
}