@article{MTMT:34275283,
	title = {An improved delay-dependent stabilization criterion of linear time-varying delay systems: An iterative method},
	url = {https://m2.mtmt.hu/api/publication/34275283},
	author = {Modala, Venkatesh and Patra, Sourav and Ray, Goshaidas},
	doi = {10.14736/kyb-2023-4-0633},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {34275283},
	issn = {0023-5954},
	year = {2023},
	pages = {633-654}
}

@article{MTMT:34444360,
	title = {INFINITE PROBABILISTIC SECRET SHARING},
	url = {https://m2.mtmt.hu/api/publication/34444360},
	author = {Csirmaz, László},
	doi = {10.14736/kyb-2023-2-0179},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {34444360},
	issn = {0023-5954},
	abstract = {A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of participants allows us to investigate their abstract properties, to connect the topic to other branches of mathematics, and to discover new design paradigms. A scheme is perfect if unqualified subsets have no information on the secret, that is, their total share is independent of the secret. By relaxing this security requirement, three other scheme types are defined. Our first result is that every (infinite) access structure can be realized by a perfect scheme where the recovery functions are non-measurable. The construction is based on a paradoxical pair of independent random variables which determine each other. Restricting the recovery functions to be measurable ones, we give a complete characterization of access structures realizable by each type of the schemes. In addition, either a vector-space or a Hilbert-space based scheme is constructed realizing the access structure. While the former one uses the traditional uniform distributions, the latter one uses Gaussian distributions, leading to a new design paradigm. © 2023 Institute of Information Theory and Automation of The Czech Academy of Sciences. All rights reserved.},
	keywords = {Secret sharing; span program; Product measure; abstract probability space; Hilbert space program; Sierpiński topology},
	year = {2023},
	pages = {179-197}
}

@article{MTMT:34306048,
	title = {A FAMILY OF LYAPUNOV-BASED CONTROL SCHEMES FOR MAXIMUM POWER POINT TRACKING IN BUCK CONVERTERS},
	url = {https://m2.mtmt.hu/api/publication/34306048},
	author = {Alvarez, Jorge and Ruiz, Jorge and Bernal, Miguel},
	doi = {10.14736/kyb-2023-2-0294},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {34306048},
	issn = {0023-5954},
	abstract = {This paper presents a novel family of Lyapunov-based controllers for the maximum power point tracking problem in the buck converter case. The solar power generation system here considered is composed by a stand-alone photovoltaic panel connected to a DC/DC buck converter. Lyapunov function candidates depending on the output are considered to develop conditions which, in some cases, can be expressed as linear matrix inequalities; these conditions guarantee that the output goes asymptotically to zero, thus implying that the MPPT is achieved. Simulation and real-time results are presented, which validate the effectiveness of the proposals.},
	keywords = {Solar energy; Linear matrix inequalities; Maximum Power Point Tracking; photovoltaic panel; Lyapunov method; convex model},
	year = {2023},
	pages = {294-313}
}

@article{MTMT:34044049,
	title = {TPM: TRANSITION PROBABILITY MATRIX – GRAPH STRUCTURAL FEATURE BASED EMBEDDING},
	url = {https://m2.mtmt.hu/api/publication/34044049},
	author = {Mohammed, S.N. and Gündüç, S.},
	doi = {10.14736/kyb-2023-2-0234},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {34044049},
	issn = {0023-5954},
	year = {2023},
	pages = {234-253}
}

@article{MTMT:34008681,
	title = {Further results on laws of large numbers for uncertain random variables},
	url = {https://m2.mtmt.hu/api/publication/34008681},
	author = {Hu, Feng and Fu, Xiaoting and Qu, Ziyi and Zong, Zhaojun},
	doi = {10.14736/kyb-2023-2-0314},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {34008681},
	issn = {0023-5954},
	year = {2023},
	pages = {314-338}
}

@article{MTMT:33867431,
	title = {ROBUST OPTIMALITY ANALYSIS FOR LINEAR PROGRAMMING PROBLEMS WITH UNCERTAIN OBJECTIVE FUNCTION COEFFICIENTS: AN OUTER APPROXIMATION APPROACH},
	url = {https://m2.mtmt.hu/api/publication/33867431},
	author = {Gao, Z. H. E. N. Z. H. O. N. G. and Inuiguchi, M.},
	doi = {10.14736/kyb-2023-1-0064},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {59},
	unique-id = {33867431},
	issn = {0023-5954},
	abstract = {Linear programming (LP) problems with uncertain objective function coefficients (OFCs) are treated in this paper. In such problems, the decision-maker would be interested in an optimal solution that has robustness against uncertainty. A solution optimal for all conceivable OFCs can be considered a robust optimal solution. Then we investigate an efficient method for checking whether a given non-degenerate basic feasible (NBF) solution is optimal for all OFC vectors in a specified range. When the specified range of the OFC vectors is a hyper -box, i. e., the marginal range of each OFC is given by an interval, it has been shown that the tolerance approach can efficiently solve the robust optimality test problem of an NBF solution. However, the hyper-box case is a particular case where the marginal ranges of some OFCs are the same no matter what values the remaining OFCs take. In real life, we come across cases where some OFCs' marginal ranges depend on the remaining OFCs' values. For example, the prices of products rise together in tandem with raw materials, the gross profit of exported products increases while that of imported products decreases because they depend on the currency exchange rates, and so on. Considering those dependencies, we consider a case where the range of the OFC vector is specified by a convex polytope. In this case, the tolerance approach to the robust optimality test problem of an NBF solution becomes in vain. To treat the problem, we propose an algorithm based on the outer approximation approach. By numerical experiments, we demonstrate how the proposed algorithm efficiently solves the robust optimality test problems of NBF solutions compared to a conventional vertex-listing method.},
	keywords = {Convex polytope; linear programming problems; interactive uncertain coefficients; robust opti-mality analysis; outer approximation approach},
	year = {2023},
	pages = {64-87}
}

@article{MTMT:33912165,
	title = {T - SEMIRING PAIRS},
	url = {https://m2.mtmt.hu/api/publication/33912165},
	author = {Jun, Jaiung and Mincheva, Kalina and Rowen, Louis},
	doi = {10.14736/kyb-2022-5-0733},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {58},
	unique-id = {33912165},
	issn = {0023-5954},
	abstract = {We develop a general axiomatic theory of algebraic pairs, which simultaneously generalizes several algebraic structures, in order to bypass negation as much as feasible. We investigate several classical theorems and notions in this setting including fractions, integral extensions, and Hilbert's Nullstellensatz. Finally, we study a notion of growth in this context.},
	keywords = {SYSTEM; MAP; congruence; SHALLOW; TRIPLE; PAIR; Semiring; module; negation; Ore; integral; Affine; algebraic},
	year = {2022},
	pages = {733-759}
}

@article{MTMT:33903422,
	title = {INTERVAL MULTI-LINEAR SYSTEMS FOR TENSORS IN THE MAX-PLUS ALGEBRA AND THEIR APPLICATION IN SOLVING THE JOB SHOP PROBLEM},
	url = {https://m2.mtmt.hu/api/publication/33903422},
	author = {Khaleghzade, Sedighe and Zangiabadi, Mostafa and Peperko, Aljosa and Hajarian, Masoud},
	doi = {10.14736/kyb-2022-5-0708},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {58},
	unique-id = {33903422},
	issn = {0023-5954},
	abstract = {In this paper, we propose the notions of the max-plus algebra of the interval tensors, which can be used for the extension of interval linear systems to interval multi-linear systems in the max-plus algebra. Some properties and basic results of interval multi-linear systems in maxplus algebra are derived. An algorithm is developed for computing a solution of the multi-linear systems in the max-plus algebra. Necessary and sufficient conditions for the interval multi-linear systems for weak solvability over max-plus algebra are obtained as well. Also, some examples are given for illustrating the obtained results. Moreover, we briefly sketch how our results can be used in the max-plus algebraic system theory for synchronized discrete event systems.},
	keywords = {Max-plus algebra; job shop problem; interval tensor; multi-linear systems; weak solvability},
	year = {2022},
	pages = {708-732}
}

@article{MTMT:33248685,
	title = {MIGRATIVITY PROPERTIES OF 2-UNINORMS OVER SEMI-T-OPERATORS},
	url = {https://m2.mtmt.hu/api/publication/33248685},
	author = {Ying, Li-Jun and Qin, Feng},
	doi = {10.14736/kyb-2022-3-0354},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {58},
	unique-id = {33248685},
	issn = {0023-5954},
	abstract = {In this paper, we analyze and characterize all solutions about alpha-migrativity properties of the five subclasses of 2-uninorms, i.e. Ck, Ck0, Ck1, C10, C01, over semi-t-operators. We give the sufficient and necessary conditions that make these alpha-migrativity equations hold for all possible combinations of 2-uninorms over semi-t-operators. The results obtained show that for G is an element of Ck, the alpha-migrativity of G over a semi-t-operator F mu,nu is closely related to the alpha-section of F mu,nu or the ordinal sum representation of t-norm and t-conorm corresponding to F mu,nu. But for the other four categories, the alpha-migrativity over a semi-t-operator F mu,nu is fully determined by the alpha-section of F mu,nu.},
	keywords = {Triangular norms; Uninorms; Triangular conorms; 2-uninorms; semi-t-operators},
	year = {2022},
	pages = {354-375}
}

@article{MTMT:33247567,
	title = {A new overlapping community detection algorithm based on similarity of neighbors in complex networks},
	url = {https://m2.mtmt.hu/api/publication/33247567},
	author = {Cetin, P and Amrahov, SE},
	doi = {10.14736/kyb-2022-2-0277},
	journal-iso = {KYBERNETIKA},
	journal = {KYBERNETIKA},
	volume = {58},
	unique-id = {33247567},
	issn = {0023-5954},
	year = {2022},
	pages = {277-300}
}