检索结果-内蒙古大学图书馆

Stability analysis of Aggregated and Time Decomposed Power Market Dynamic Model 11

学校读者我要写书评

暂无评论

Stability Analysis of Aggregated and Time Decomposed Power M...

11th International Conference on Advanced computer Information Technologies, ACIT 2021

作者： Lyubchyk, Leonid Grinberg, Galyna Akhiiezer, Olena Kostyuk, Olga Serdiuk, Iryna National Technical University Kharkiv Polytechnic Institute Department of Computer Mathematics and Data Analysis Kharkiv Ukraine National Technical University Kharkiv Polytechnic Institute Department of Economic Cybernetics and Marketing Management Kharkiv Ukraine

The problem of stability analysis for power market dynamics mathematical models are considered from the standpoint of control theory;moreover, the pricing mechanism realized in the bidding process is interpreted as a regulator in the feedback system. It is assumed, that the rate of change in the market price is determined by a linear differential transformation of the imbalance between the volumes of electric power produced and consumed. The possibility of simplifying the model based on aggregation and decomposition procedures is considered. The dynamics and stability of the power market are studied using a synergetic control approach for systems with separation of slow and fast motion;it is shown, that market price can be interpreted as an equivalent control that ensures slow motion along the manifold, which determines the fulfillment of balance relations. © 2021 IEEE.

关键词： Power markets

On the k-independence number of graph products

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Abiad, Aida Koerts, Hidde Department of Mathematics and Computer Science Eindhoven University of Technology Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Belgium Department of Mathematics and Data Science of Vrije Universiteit Brussel Belgium Department of Combinatorics and Optimization University of Waterloo Canada

The k-independence number of a graph, αk(G), is the maximum size of a set of vertices at pairwise distance greater than k, or alternatively, the independence number of the k-th power graph Gk. Although it is known that αk(G) = α(Gk), this, in general, does not hold for most graph products, and thus the existing bounds for α of graph products cannot be used. In this paper we present sharp upper bounds for the k-independence number of several graph products. In particular, we focus on the Cartesian, tensor, strong, and lexicographic products. Some of the bounds previously known in the literature for k = 1 follow as corollaries of our main results. © 2022, CC BY.

关键词：

Methodological Foundations for Constructing Intelligent Information Security Systems

学校读者我要写书评

暂无评论

Methodological Foundations for Constructing Intelligent Info...

Human-computer Interaction, Optimization and Robotic Applications (HORA), International Congress on

作者： Serhii Yevseiev Stanislav Milevskyi Vladyslav Sokol Yevhen Melenti Olena Akhiiezer Kyrylo Petrenko Cybersecurity Department National Technical University "Kharkiv Polytechnic Institute" Kharkiv Ukraine National Academy of Security Service of Ukraine Kyiv Ukraine Department of Computer Mathematics and Data Analysis National Technical University "Kharkiv Polytechnic Institute" Kharkiv Ukraine Research Department for Development and Implementation of Strategic Communications National Defense University of Ukraine Kyiv Ukraine

ISBN: (数字)9798331510886

ISBN: (纸本)9798331510893

The development of artificial intelligence, the emergence of full-scale quantum computers form a new level of computing capabilities of intruders (cyberterrorists). At the same time, financial and energy costs for the implementation of targeted (mixed) attacks are significantly reduced, which, in combination with the development of smart technologies, provides evil to almost any critical infrastructure objects, on the one hand. On the other hand, the evolutionary development of the IT industry "ensures" an increase in the areas of human activity that must be included in the list of critical infrastructure objects. The paper proposes conceptual (methodological) foundations for building intelligent protection systems that can provide the required level of security in the post-quantum period.

关键词： Hands Costs Quantum computing Neural networks Information security Critical infrastructure Artificial intelligence Protection Robots Optimization

A Framework for Active Contour Initialization with Application to Liver Segmentation in MRI 19th

学校读者我要写书评

暂无评论

A Framework for Active Contour Initialization with Applica...

19th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2022

作者： Mir-Fuentes, Arnau Mir, Arnau Antunes-Santos, Felipe Fernandez, F. Javier Lopez-Molina, Carlos Department of Estadística Informática y Matemáticas Universidad Pública de Navarra Pamplona31006 Spain NavarraBiomed Hospital Universitario de Navarra Pamplona31008 Spain KERMIT Department of Data Analysis and Mathematical Modelling Ghent University Ghent9000 Belgium Department of Mathematics and Computer Science University of the Balearic Islands Palma07122 Spain Palma07010 Spain

ISBN: (纸本)9783031089732

Object segmentation is a prominent low-level task in image processing and computer vision. A technique of special relevance within segmentation algorithms is active contour modeling. An active contour is a closed contour on an image which can be evolved to progressively fit the silhouette of certain area or object. Active contours shall be initialized as a closed contour at some position of the image, further evolving to precisely fit to the silhouette of the object of interest. While the evolution of the contour has been deeply studied in literature [5, 11], the study of strategies to define the initial location of the contour is rather absent from it. Typically, such contour is created as a small closed curve around an inner position in the object. However, literature contains no general-purpose algorithms to determine those inner positions, or to quantify their fitness. In fact, such points are frequently set manually by human experts, hence turning the segmentation process into a semi-supervised one. In this work, we present a method to find inner points in relevant object using spatial-tonal fuzzy clustering. Our proposal intends to detect dominant clusters of bright pixels, which are further used to identify candidate points or regions around which active contours can be initialized. © 2022, Springer Nature Switzerland AG.

关键词： Image segmentation

ROTA-BAXTER OPERATORS, DIFFERENTIAL OPERATORS, PRE- AND NOVIKOV STRUCTURES ON GROUPS AND LIE ALGEBRAS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Gao, Xing Guo, Li Han, Zongjian Zhang, Yi School of Mathematics and Statistics Lanzhou University Lanzhou730000 China Gansu Provincial Research Center for Basic Disciplines of Mathematics and Statistics Lanzhou730070 China Department of Mathematics and Computer Science Rutgers University NewarkNJ07102 United States School of Mathematical Sciences Tonji University Shanghai200092 China School of Mathematics and Statistics Center for Applied Mathematics of Jiangsu Province Jiangsu International Joint Laboratory on System Modeling and Data Analysis NUIST Jiangsu Nanjing210044 China

Rota-Baxter operators on various structures have found important applications in diverse areas, from renormalization of quantum field theory to Yang-Baxter equations. Relative Rota-Baxter operators on Lie algebras are closely related to pre-Lie algebras and post-Lie algebras. Some of their group counterparts have been introduced to study post-groups, skew left braces and set-theoretic solutions of Yang-Baxter equations, but searching suitable notions of relative Rota-Baxter operators on groups with weight zero and pre-groups has been challenging and has been the focus of recent studies, by provisionally imposing an abelian condition. Arising from the works of Balinsky-Novikov and Gelfand-Dorfman, Novikov algebras and their constructions from differential commutative algebras have led to broad applications. Finding their suitable counterparts for groups and Lie algebras has also attracted quite much recent attention. This paper uses one-sided-inverse pairs of maps to give a perturbative approach to a general notion of relative Rota-Baxter operators and differential operators on a group and a Lie algebra with limit-weight. With the extra condition of limit-abelianess on the group or Lie algebra, we give an interpretation of relative Rota-Baxter and differential operators with weight zero. These operators motivate us to define pre-groups and Novikov groups respectively as the induced structures. The tangent maps of these operators are shown to give Rota-Baxter and differential operators with weight zero on Lie algebras. The tangent spaces of the pre-Lie and Novikov Lie groups are pre-Lie algebras and Novikov Lie algebras, fulfilling the expected property. Furthermore, limit-weight relative Rota-Baxter operators on groups give rise to skew left braces and then set-theoretic solutions of the Yang-Baxter *** Codes 22E60, 17B38, 17B40, 16W99, 45N05 Copyright © 2024, The Authors. All rights reserved.

关键词： Lie groups

data Processing Technology for Network Abnormal Traffic Detection

学校读者我要写书评

暂无评论

Procedia computer Science 2024年 243卷 610-618页

作者： Kun Wang Yu Fu Xueyuan Duan Jianqiao Xu Taotao Liu Department of Information Security Naval University of Engineering Wuhan 430033 China School of Mathematics and Information Engineering Xinyang Vocational and Technical College Xinyang 464000 China College of Computer and Information Technology Xinyang Normal University Xinyang 464000 China Henan Key Laboratory of Analysis and Applications of Education Big Data Xinyang Normal University Xinyang 464000 China

At present, the threats to network security are also increasing, among which abnormal traffic detection is the key link to ensure network security. Traditional detection methods based on signature or threshold are often difficult to adapt to the increasingly complex network environment and new attack methods. Therefore, this paper optimizes and improves the data processing technology, proposes a network ATD method based on particle swarm optimization (PSO) algorithm, and explores in detail the traffic data collection and pre-processing, the feature recognition of abnormal traffic, the application of PSO algorithm, real-time monitoring and response mechanism. The results of two sets of simulation experiments are as follows: compared with the traditional model, the accuracy rate of ATD of the improved algorithm is increased by 7.2% on average, and the detection time is reduced by 7.35s on average. This method not only enhances the adaptability of the model to new attacks, but also improves the degree of automation of detection.

关键词： Network Anomaly Traffic Detection data Processing Technology particle swarm optimization

SERDA: Secure Enhanced and Robust data Aggregation Scheme for Smart Grid

学校读者我要写书评

暂无评论

Journal of computers (Taiwan) 2024年第5期35卷 73-90页

作者： Chen, Yiming Duan, Hongjun Wang, Dong Liu, Yining Chang, Chin-Chen School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China Zhengzhou Art Infant Normal School Zhengzhou450000 China School of Mathematics and Computational Science Guilin University of Electronic Technology Guilin541004 China School of Data Science and Artificial Intelligence Wenzhou University of Technology Wenzhou325027 China Department of Information Engineering and Computer Science Feng Chia University Taichung40724 Taiwan Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Guilin541004 China

data aggregation is considered a viable security and privacy solution for smart grid as it allows to obtain the total electricity consumption within a region without disclosing individual data. However, existing data aggregation schemes give little consideration in their threat models to use cases where devices operate in untrustworthy environments and adversaries have physical system access, which is common in the smart grid. They cannot support authentication and resist physical attacks while maintaining data privacy and supporting fault tolerance for smart meter (SM) failures. Motivated by this, a secure enhanced and robust data aggregation (SERDA) scheme for smart grid is introduced in this article. The SERDA scheme provides enhanced security for key storage and updates based on physically unclonable function (PUF), while supporting data privacy protection and fault tolerance for SM failures without reliance on a trusted third party (TTP). Security analysis and performance evaluation demonstrate that SERDA meets the excepted goals and is efficient compared with related work. © 2024 Codon Publications. All rights reserved.

关键词：

Bordering of Symmetric Matrices and an Application to the Minimum Number of Distinct Eigenvalues for the Join of Graphs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Abiad, Aida Fallat, Shaun M. Kempton, Mark Levene, Rupert H. Oblak, Polona Šmigoc, Helena Tait, Michael Meulen, Kevin Vander Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Ghent Belgium Department of Mathematics and Data Science Vrije Universiteit Brussel Brussels Belgium Department of Mathematics and Statistics University of Regina ReginaSKS4S 0A2 Canada Department of Mathematics Brigham Young University ProvoUT84602 United States School of Mathematics and Statistics University College Dublin BelfieldDublin 4 Ireland University of Ljubljana Faculty of Computer and Information Science Faculty of Mathematics and Physics Ljubljana Slovenia Institute of Mathematics Physics and Mechanics Ljubljana Slovenia Department of Mathematics & Statistics Villanova University VillanovaPA19085 United States Department of Mathematics Redeemer University ONL9K 1J4 Canada

An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the join of a connected graph with a path. We then focus on bordering a matrix and attempt to control the change in the number of distinct eigenvalues induced by this operation. By applying bordering techniques to the join of graphs, we obtain numerous results on the nature of the minimum number of distinct eigenvalues as vertices are joined to a fixed *** Codes 05C50, 15A18 © 2023, CC BY.

关键词： Matrix algebra

Descriptive Complexity of the Generalized Spectra of Graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Abiad, Aida Dawar, Anuj Zapata, Octavio Department of Mathematics and Computer Science Eindhoven University of Technology Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Belgium Department of Mathematics and Data Science Vrije Universiteit Brussel Belgium Department of Computer Science and Technology University of Cambridge United Kingdom Departamento de Matemáticas Facultad de Ciencias Universidad Nacional Autónoma de México Mexico

Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complements. We study generalized cospectrality in relation to logical definability. We show that any pair of graphs that are elementary equivalent with respect to the three-variable counting first-order logic C3 are generalized cospectral, and this is not the case with C2, nor with any number of variables if we exclude counting quantifiers. Using this result we provide a new characterization of the well-known class of distance-regular graphs using the logic C3. We also show that, for controllable graphs (it is known that almost all graphs are controllable), the elementary equivalence in C2 coincides with isomorphism. © 2022, CC BY.

关键词： Graphic methods