TY - JOUR AU - Morse, Gregory AU - Rybotycki, Tomasz AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Stojčić, Uroš AU - Kozsik, Tamás AU - Mencer, Oskar AU - Oszmaniec, Michał AU - Zimborás, Zoltán AU - Rakyta, Péter TI - High performance Boson sampling simulation via data-flow engines JF - NEW JOURNAL OF PHYSICS J2 - NEW J PHYS VL - 26 PY - 2024 IS - 3 PG - 17 SN - 1367-2630 DO - 10.1088/1367-2630/ad313b UR - https://m2.mtmt.hu/api/publication/34750423 ID - 34750423 AB - Boson sampling (BS) is viewed to be an accessible quantum computing paradigm to demonstrate computational advantage compared to classical computers. In this context, the evolution of permanent calculation algorithms attracts a significant attention as the simulation of BS experiments involves the evaluation of vast number of permanents. For this reason, we generalize the Balasubramanian–Bax–Franklin–Glynn permanent formula, aiming to efficiently integrate it into the BS strategy of Clifford and Clifford (2020 Faster classical boson sampling). A reduction in simulation complexity originating from multiplicities in photon occupation was achieved through the incorporation of a n-ary Gray code ordering of the addends during the permanent evaluation. Implementing the devised algorithm on FPGA-based data-flow engines, we leverage the resulting tool to accelerate boson sampling simulations for up to 40 photons. Drawing samples from a 60-mode interferometer, the achieved rate averages around 80 s per sample, employing 4 FPGA chips. The developed design facilitates the simulation of both ideal and lossy boson sampling experiments. LA - English DB - MTMT ER - TY - CHAP AU - Morse, Gregory AU - Kozsik, Tamás TI - On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming T2 - Proceedings of the 7th International Conference on Algorithms, Computing and Systems PY - 2024 SP - 145–153 DO - 10.1145/3631908.3631929 UR - https://m2.mtmt.hu/api/publication/34556674 ID - 34556674 AB - We present an asymptotic improvement in the number of variables (n + m⌊log 2(k − 1)⌋) required for state-of-the-art formulation of (max-)k-SAT problems when encoded as a quadratic unconstrained binary optimization (QUBO) problem. We further show a variable reduction technique (max-)3-SAT formula which achieves the optimal number of substitution variables. We show optimality empirically by presenting an integer linear programming (ILP) construction for arbitrary Boolean formulas. We show how various goals can be encoded, and this model can be generalized to searching for arbitrary substitution variable functions. Lastly, we show the optimal high-order substitution reduction in cubic QUBO equations which has smaller coefficients than the typical construction used. LA - English DB - MTMT ER - TY - JOUR AU - Erdenebat, Baasanjargal AU - Bud, Bayarjargal AU - Batsuren, Temuulen AU - Kozsik, Tamás TI - Multi-Project Multi-Environment Approach—An Enhancement to Existing DevOps and Continuous Integration and Continuous Deployment Tools JF - COMPUTERS J2 - COMPUTERS VL - 12 PY - 2023 IS - 12 SP - 254 SN - 2073-431X DO - 10.3390/computers12120254 UR - https://m2.mtmt.hu/api/publication/34429534 ID - 34429534 AB - DevOps methodology and tools, which provide standardized ways for continuous integration (CI) and continuous deployment (CD), are invaluable for efficient software development. Current DevOps solutions, however, lack a useful functionality: they do not support simultaneous project developments and deployment on the same operating infrastructure (e.g., a cluster of Docker containers). In this paper, we propose a novel approach to address this shortcoming by defining a multi-project, multi-environment (MPME) approach. With this approach, a large company can organize many microservice-based projects operating simultaneously on a common code base, using self-hosted Kubernetes clusters, which helps developers and businesses to better focus on the product they are developing, and to reduce efforts on the management of their DevOps infrastructure. LA - English DB - MTMT ER - TY - JOUR AU - Alqaradaghi, Midya AU - Nazir, Muhammad Zafar Iqbal AU - Kozsik, Tamás TI - Design and Implement an Accurate Automated Static Analysis Checker to Detect Insecure Use of SecurityManager JF - COMPUTERS J2 - COMPUTERS VL - 12 PY - 2023 IS - 12 SP - 247 SN - 2073-431X DO - 10.3390/computers12120247 UR - https://m2.mtmt.hu/api/publication/34406898 ID - 34406898 AB - Static analysis is a software testing technique that analyzes the code without executing it. It is widely used to detect vulnerabilities, errors, and other issues during software development. Many tools are available for static analysis of Java code, including SpotBugs. Methods that perform a security check must be declared private or final; otherwise, they can be compromised when a malicious subclass overrides the methods and omits the checks. In Java, security checks can be performed using the SecurityManager class. This paper addresses the aforementioned problem by building a new automated checker that raises an issue when this rule is violated. The checker is built under the SpotBugs static analysis tool. We evaluated our approach on both custom test cases and real-world software, and the results revealed that the checker successfully detected related bugs in both with optimal metrics values. LA - English DB - MTMT ER - TY - GEN AU - Morse, Gregory AU - Tomasz, Rybotycki AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Uros, Stojic AU - Kozsik, Tamás AU - Oskar, Mencer AU - Michał, Oszmaniec AU - Zimborás, Zoltán AU - Rakyta, Péter TI - High performance Boson Sampling simulation via data-flow engines PY - 2023 PG - 25 UR - https://m2.mtmt.hu/api/publication/34139689 ID - 34139689 LA - English DB - MTMT ER - TY - JOUR AU - Erdenebat, Baasanjargal AU - Bud, Bayarjargal AU - Kozsik, Tamás TI - Challenges in service discovery for microservices deployed in a Kubernetes cluster – a case study JF - INFOCOMMUNICATIONS JOURNAL J2 - INFOCOMM J VL - 15 PY - 2023 IS - Special Issue SP - 69 EP - 75 PG - 7 SN - 2061-2079 DO - 10.36244/ICJ.2023.5.11 UR - https://m2.mtmt.hu/api/publication/34130456 ID - 34130456 AB - With Kubernetes emerging as one of the most popular infrastructures in the cloud-native era, the utilization of containerization and tools alongside Kubernetes is steadily gaining traction. The main goal of this paper is to evaluate the service discovery mechanisms and DNS management (CoreDNS) of Kubernetes, and to present a general study of an experiment on service discovery challenges. In large scale Kubernetes clusters, running pods, services, requests, and workloads can be substantial. The increased number of HTTP-requests often result in resource utilization concerns, e.g., spikes of errors [24], [25]. This paper investigates potential optimization strategies for enhancing the performance and scalability of CoreDNS in Kubernetes. We propose a solution to address the concerns related to CoreDNS and provide a detailed explanation of how our implementation enhances service discovery functionality. Experimental results in a real-world case show that our solution for the CoreDNS ensures consistency of the workload. Compared with the default CoreDNS configuration, our customized approach achieves better performance in terms of number of errors for requests, average latency of DNS requests, and resource usage rate. LA - English DB - MTMT ER - TY - CONF AU - Erdenebat, Baasanjargal AU - Bud, Bayarjargal AU - Kozsik, Tamás TI - Challenges in service discovery for microservices deployed in a kubernetes cluster – a case study T2 - 12th International Conference on Applied Informatics (ICAI 2023) PB - Eszterházy Károly Katolikus Egyetem C1 - Eger PY - 2023 SP - 1 EP - 3 PG - 3 UR - https://m2.mtmt.hu/api/publication/34130245 ID - 34130245 LA - English DB - MTMT ER - TY - CONF AU - Németh, András AU - Kozsik, Tamás AU - Zimborás, Zoltán TI - An application for Gaussian Boson Sampling: vibronic spectra of molecules T2 - 12th International Conference on Applied Informatics (ICAI 2023) PB - Eszterházy Károly Katolikus Egyetem C1 - Eger PY - 2023 SP - 1 EP - 3 PG - 3 UR - https://m2.mtmt.hu/api/publication/34130204 ID - 34130204 LA - English DB - MTMT ER - TY - CONF AU - Alqaradaghi, Midya AU - Kozsik, Tamás TI - Improper Input Validation Vulnerability Detection by Static Analysis T2 - 12th International Conference on Applied Informatics (ICAI 2023) PB - Eszterházy Károly Katolikus Egyetem C1 - Eger PY - 2023 SP - 1 EP - 3 PG - 3 UR - https://m2.mtmt.hu/api/publication/34130002 ID - 34130002 LA - English DB - MTMT ER - TY - JOUR AU - Németh, András AU - Kozsik, Tamás AU - Zimborás, Zoltán TI - Vibronic spectra of molecules – an experiment with a quantum computer simulator JF - ANNALES MATHEMATICAE ET INFORMATICAE J2 - ANN MATH INFORM VL - 58 PY - 2023 SP - 121 EP - 132 PG - 12 SN - 1787-5021 DO - 10.33039/ami.2023.08.012 UR - https://m2.mtmt.hu/api/publication/34126738 ID - 34126738 N1 - Export Date: 08 March 2024 LA - English DB - MTMT ER -