@book{MTMT:34863508,
	title = {Amber 2024},
	url = {https://m2.mtmt.hu/api/publication/34863508},
	author = {Case, D.A. and Aktulga, H.M. and Belfon, K. and Ben-Shalom, I.Y. and Berryman, J.T. and Brozell, S.R. and Cerutti, D.S. and Cheatham III, T.E. and Cisneros, G.A. and Cruzeiro, V.W.D. and Darden, T.A. and Forouzesh, N. and Giamba¸su, G. and Giese, T. and Gilson, M.K. and Gohlke, H. and Goetz, A.W. and Harris, J. and Huang, Z. and Izadi, S. and Izmailov, S.A. and Kasavajhala, K. and Kaymak, M.C. and Kolossváry, István and Kovalenko, A. and Kurtzman, T. and Lee, T.S. and Li, P. and Lin, C. and Liu, J. and Luchko, T. and Luo, R. and Machado, M. and Manathunga, M. and Merz, K.M. and Miao, Y. and Mikhailovskii, O. and Monard, G. and Nguyen, H. and O’Hearn, K.A. and Onufriev, A. and Pan, F. and Pantano, S. and Rahnamoun, A. and Roe, D.R. and Roitberg, A. and Sagui, C. and Schott-Verdugo, S. and Shajan, A. and Shen, J. and Simmerling, C.L. and Skrynnikov, N.R. and Smith, J. and Swails, J. and Walker, R.C. and Wang, J. and Wang, J. and Wu, X. and Wu, Y. and Xiong, Y. and Xue, Y. and York, D.M. and Zhao, C. and Zhu, Q. and Kollman, P.A.},
	publisher = {University of California},
	unique-id = {34863508},
	year = {2024},
	orcid-numbers = {Kolossváry, István/0000-0002-0424-4577}
}

@inproceedings{MTMT:34862731,
	title = {Landmark Estimation for Qualitative Diagnosis Over Distributed Traces},
	url = {https://m2.mtmt.hu/api/publication/34862731},
	author = {Péter, Bertalan Zoltán and Kocsis, Imre},
	booktitle = {Proceedings of the 31th Minisymposium},
	doi = {10.3311/MINISY2024-017},
	unique-id = {34862731},
	year = {2024},
	pages = {89-94}
}

@inproceedings{MTMT:34862622,
	title = {Conditional Molecule Generation with 2D Latent Diffusion},
	url = {https://m2.mtmt.hu/api/publication/34862622},
	author = {Szarvas, Dániel and Pogány, Domonkos},
	booktitle = {Proceedings of the 31th Minisymposium},
	doi = {10.3311/MINISY2024-007},
	unique-id = {34862622},
	year = {2024},
	pages = {37-40},
	orcid-numbers = {Pogány, Domonkos/0000-0003-4968-7504}
}

@inproceedings{MTMT:34862607,
	title = {Hyperbolic Drug-Target Interaction Prediction Utilizing Differential Expression Signatures},
	url = {https://m2.mtmt.hu/api/publication/34862607},
	author = {Pogány, Domonkos and Antal, Péter},
	booktitle = {Proceedings of the 31th Minisymposium},
	doi = {10.3311/MINISY2024-009},
	unique-id = {34862607},
	year = {2024},
	pages = {46-49},
	orcid-numbers = {Pogány, Domonkos/0000-0003-4968-7504; Antal, Péter/0000-0002-4370-2198}
}

@inproceedings{MTMT:34862351,
	title = {Exploring PLA/Flax Substrates for Antenna Applications: Assessing Moisture, Temperature and Dielectric Constant Homogeneity},
	url = {https://m2.mtmt.hu/api/publication/34862351},
	author = {Grennerat, Vincent and Nashef, Georges Zakka El and Sabra, Ahmad and Xavier, Pascal and Lacrevaz, Thierry and Corrao, Nicolas and Liang, Haokai and Géczy, Attila and Chevalier, Nicolas},
	booktitle = {2024 18th European Conference on Antennas and Propagation (EuCAP)},
	doi = {10.23919/EuCAP60739.2024.10501367},
	unique-id = {34862351},
	abstract = {This paper investigates the potential of polylactic acid (PLA)/Flax substrates as eco-friendly alternatives for radio frequency (RF) antenna applications in the context of sustainability within the electronics industry. As electronic waste continues to mount globally and the use of RF-connected devices proliferates, there is a growing need for sustainable materials. This study explores the dielectric properties of PLA/Flax substrates and their implications for antenna design and performance. Our findings reveal promising RF performance, highlighting the viability of bio-sourced and biodegradable materials in RF engineering to address environmental concerns. Subsequent sections delve into the impact of moisture, and substrate homogeneity, offering valuable insights for sustainable RF systems. © 2024 18th European Conference on Antennas and Propagation, EuCAP 2024. All Rights Reserved.},
	year = {2024}
}

@article{MTMT:34861666,
	title = {Improving lean transformation success with change management techniques},
	url = {https://m2.mtmt.hu/api/publication/34861666},
	author = {Tarjáni, Ariella Janka and Kalló, Noémi and Pataki, Béla},
	doi = {10.1504/IJSOM.2024.10063440},
	journal-iso = {INT J SERV OPER MANAG},
	journal = {INTERNATIONAL JOURNAL OF SERVICES AND OPERATIONS MANAGEMENT},
	volume = {1},
	unique-id = {34861666},
	issn = {1744-2370},
	abstract = {While the success rate of lean transformations is low, soft management techniques such as change management methodologies are rarely mentioned in the lean literature. Combining the different approaches represented by lean and change management can support the success of lean projects and the organisation. As lean transformations are inevitably radical changes in organisations, they must be supported suitably by change management techniques. We show how the success of such a change can be forecasted and how the preparation and implementation phase can be supported with the help of change management. This paper presents a case study where a new lean tool, an online kanban board, is introduced into the operation of a service SME. Based on the case study, we recommend using the presented change management tools for lean implementations.},
	keywords = {Change management; Lean management},
	year = {2024},
	eissn = {1744-2389},
	orcid-numbers = {Kalló, Noémi/0000-0003-3193-081X; Pataki, Béla/0000-0001-6905-1795}
}

@article{MTMT:34860911,
	title = {Stable source connection and assignment problems as multi-period shortest path problems},
	url = {https://m2.mtmt.hu/api/publication/34860911},
	author = {Streekstra, Leanne and Trudeau, C.},
	doi = {10.1007/s00182-024-00896-1},
	journal-iso = {INT J GAME THEORY},
	journal = {INTERNATIONAL JOURNAL OF GAME THEORY},
	unique-id = {34860911},
	issn = {0020-7276},
	abstract = {We extend the familiar shortest path problem by supposing that agents have demands over multiple periods. This potentially allows agents to combine their paths if their demands are complementary; for instance if one agent only needs a connection to the source in the summer while the other requires it only in the winter. We not only show that the resulting cost sharing problem always generates a totally balanced game, regardless of the number of agents and periods, the cost structure or the demand profile, but that all totally balanced games are representable as multi-period shortest path problems. We then exploit the fact that the model encompasses many well-studied problems to obtain or reobtain balancedness and total balancedness results for source-connection problems, assignment problems and minimum coloring problems. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.},
	keywords = {ASSIGNMENT; CORE; Cooperative game; Shortest path; D63; C71; Demand over multiple periods; Source-connection; Total balancedness},
	year = {2024},
	eissn = {1432-1270}
}

@article{MTMT:34860910,
	title = {Shannon capacity, Lovász theta number and the Mycielski construction},
	url = {https://m2.mtmt.hu/api/publication/34860910},
	author = {Csonka, Bence and Simonyi, Gábor},
	doi = {10.1109/TIT.2024.3394775},
	journal-iso = {IEEE T INFORM THEORY},
	journal = {IEEE TRANSACTIONS ON INFORMATION THEORY},
	unique-id = {34860910},
	issn = {0018-9448},
	abstract = {We investigate the effect of the well-known Mycielski construction on the Shannon capacity of graphs and on one of its most prominent upper bounds, the (complementary) Lovász theta number. We prove that if the Shannon capacity of a graph, the distinguishability graph of a noisy channel, is attained by some finite power, then its Mycielskian has strictly larger Shannon capacity than the graph itself. For the complementary Lovász theta function we show that its value on the Mycielskian of a graph is completely determined by its value on the original graph, a phenomenon similar to the one discovered for the fractional chromatic number by Larsen, Propp and Ullman. We also consider the possibility of generalizing our results on the Sperner capacity of directed graphs and on the generalized Mycielsky construction. Possible connections with what Zuiddam calls the asymptotic spectrum of graphs are discussed as well. IEEE},
	keywords = {INFORMATION THEORY; INFORMATION THEORY; graph capacities; Shannon capacity; Informatics; Informatics; Economics; Graph coloring; Directed graphs; Upper Bound; Upper Bound; Graphic methods; Noise measurements; Technological innovation; Technological innovation; Electrical engineering; Graph colorings; noise measurement; spectra of graphs; spectra of graphs; graph capacity; Lovasz number; Lovasz number; Mycielski construction; Mycielski's constructions},
	year = {2024},
	eissn = {1557-9654}
}

@article{MTMT:34860908,
	title = {Btor2-Cert: A Certifying Hardware-Verification Framework Using Software Analyzers},
	url = {https://m2.mtmt.hu/api/publication/34860908},
	author = {Ádám, Zsófia and Beyer, Dirk and Chien, Po-Chun and Lee, Nian-Ze and Sirrenberg, Nils},
	doi = {10.1007/978-3-031-57256-2_7},
	journal-iso = {LNCS},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {14572},
	unique-id = {34860908},
	issn = {0302-9743},
	abstract = {Formal verification is essential but challenging: Even the best verifiers may produce wrong verification verdicts. Certifying verifiers enhance the confidence in verification results by generating a witness for other tools to validate the verdict independently. Recently, translating the hardware-modeling language Btor2 to software, such as the programming language C or LLVM intermediate representation, has been actively studied and facilitated verifying hardware designs by software analyzers. However, it remained unknown whether witnesses produced by software verifiers contain helpful information about the original circuits and how such information can aid hardware analysis. We propose a certifying and validating framework Btor2-Cert to verify safety properties of Btor2 circuits, combining Btor2-to-C translation, software verifiers, and a new witness validator Btor2-Val, to answer the above open questions. Btor2-Cert translates a software violation witness to a Btor2 violation witness; As the Btor2 language lacks a format for correctness witnesses, we encode invariants in software correctness witnesses as Btor2 circuits. The validator Btor2-Val checks violation witnesses by circuit simulation and correctness witnesses by validation via verification. In our evaluation, Btor2-Cert successfully utilized software witnesses to improve quality assurance of hardware. By invoking the software verifier Cbmc on translated programs, it uniquely solved, with confirmed witnesses, 8 % of the unsafe tasks for which the hardware verifier ABC failed to detect bugs. © The Author(s) 2024.},
	keywords = {quality control; Quality assurance; Translation (languages); C (programming language); Software verification; Software verification; circuit simulation; Program debugging; formal verification; Modeling languages; SAT; SAT; SMT; Verification framework; Verification results; Timing circuits; Program translators; Word level; Hardware verification; Hardware verification; Btor2; Verification witnesses; Witness validation; Word-level circuit; Btor2; Verification witness; Witness validation; Word-level circuit},
	year = {2024},
	eissn = {1611-3349},
	pages = {129-149},
	orcid-numbers = {Ádám, Zsófia/0000-0003-2354-1750}
}

@article{MTMT:34860900,
	title = {Seismic performance evaluation of exterior reinforced concrete beam-column connections retrofitted with economical perforated steel haunches},
	url = {https://m2.mtmt.hu/api/publication/34860900},
	author = {Sahil, M. and Bahrami, A. and Waqas, H.A. and Amin, F. and Mansoor, Khan M. and Iqbal, F. and Muhammad, Fawad and Najam, F.A.},
	doi = {10.1016/j.rineng.2024.102179},
	journal-iso = {RESULT ENGIN},
	journal = {RESULTS IN ENGINEERING},
	volume = {22},
	unique-id = {34860900},
	abstract = {The exterior beam-column joint (BCJ) within reinforced concrete (RC) frame structures is acknowledged as a vulnerable component prone to seismic failure. This article proposes a practical and economical strengthening method for exterior BCJs using a perforated steel haunch system. This method is designed to mitigate damage in BCJs and improve the seismic performance of the structure. Employing finite element modeling (FEM) techniques, the study evaluates the impact of perforated steel haunches on the BCJs’ behavior and performance. The investigation involves creating nine distinct models, each representing a BCJ with a steel haunch system. These models include a control model without any perforations and eight variations with different levels of perforation (ranging from 10% to 50%) within the steel haunch system. Furthermore, the study analyzes the influence of perforation shapes on the connections’ performance, considering square, circular, hexagonal, and triangular shapes. The results reveal that utilizing a steel haunch without perforations significantly increases the load-carrying capacity of a BCJ by about 89%. Additionally, circular or square-shaped perforations, up to 30–35% within the steel haunch, effectively prevent the joints’ failure and promote the ductile behavior. These findings hold the potential to advance the design methodology for RC joints subjected to seismic loads, thereby enhancing the structural resilience in earthquake-prone regions. © 2024 The Authors},
	keywords = {PERFORMANCE; finite element method; earthquakes; earthquake; Ductile fracture; Seismic waves; Loads (forces); Cyclic Loading; Cyclic Loading; Finite element modeling; Finite element modeling; Reinforced concrete; SEISMIC DESIGN; Concrete beams and girders; load-carrying capacity; reinforced concrete beams; Load limits; Beam-column joint; Beam - column connection; Beam-column joints; Seismic performance evaluation; Element models; Perforated steel haunch; Exterior beam-column joints; Perforated steel haunch},
	year = {2024},
	eissn = {2590-1230}
}