Dependency Graph Research Articles

Enhancing Chinese Event Extraction with Event Trigger Structures

The dependency syntactic structure is widely used in event extraction. However, the dependency structure reflecting syntactic features is essentially different from the event structure that reflects semantic features, leading to the performance degradation. In this paper, we propose to use Event Trigger Structure for Event Extraction (ETSEE), which can compensate the inconsistency between two structures. First, we leverage the ACE2005 dataset as case study, and annotate 3 kinds of ETSs, i.e., “light verb + trigger”, “preposition structures” and “tense + trigger”. Then we design a graph-based event extraction model that jointly identifies triggers and arguments, where the graph consists of both the dependency structure and ETSs. Experiments show that our model significantly outperforms the state-of-the-art methods. Through empirical analysis and manual observation, we find that the ETSs can bring the following benefits: (1) enriching trigger identification features by introducing structural event information; (2) enriching dependency structures with event semantic information; (3) enhancing the interactions between triggers and candidate arguments by shortening their distances in the dependency graph.

The Power Word Problem in Graph Products

The power word problem for a group G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document} asks whether an expression u1x1⋯unxn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{u_1^{x_1} \\cdots u_n^{x_n}}$$\\end{document}, where the ui\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{u_i}$$\\end{document} are words over a finite set of generators of G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document} and the xi\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{x_i}$$\\end{document} binary encoded integers, is equal to the identity of G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document}. It is a restriction of the compressed word problem, where the input word is represented by a straight-line program (i.e., an algebraic circuit over G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document}). We start by showing some easy results concerning the power word problem. In particular, the power word problem for a group G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document} is uNC1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\ extsf{uNC}^{1}}$$\\end{document}-many-one reducible to the power word problem for a finite-index subgroup of G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{G}$$\\end{document}. For our main result, we consider graph products of groups that do not have elements of order two. We show that the power word problem in a fixed such graph product is AC0\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\ extsf{AC} ^0}$$\\end{document}-Turing-reducible to the word problem for the free group F2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{F_2}$$\\end{document} and the power word problems of the base groups. Furthermore, we look into the uniform power word problem in a graph product, where the dependence graph and the base groups are part of the input. Given a class of finitely generated groups C\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\\mathcal {C}}$$\\end{document} without order two elements, the uniform power word problem in a graph product can be solved in AC0[C=LUPowWP(C)]\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\ extsf{AC} ^0[\ extsf{C}_=\ extsf{L} ^{{{\\,\ extrm{UPowWP}\\,}}(\\mathcal {C})}]}$$\\end{document}, where UPowWP(C)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{{{\\,\ extrm{UPowWP}\\,}}(\\mathcal {C})}$$\\end{document} denotes the uniform power word problem for groups from the class C\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\\mathcal {C}}$$\\end{document}. As a consequence of our results, the uniform knapsack problem in right-angled Artin groups is NP\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\varvec{\ extsf{NP}}$$\\end{document}-complete. The present paper is a combination of the two conference papers (Lohrey and Weiß 2019b, Stober and Weiß 2022a). In Stober and Weiß (2022a) our results on graph products were wrongly stated without the additional assumption that the base groups do not have elements of order two. In the present work we correct this mistake. While we strongly conjecture that the result as stated in Stober and Weiß (2022a) is true, our proof relies on this additional assumption.

Gated independence in graphs

If G=(V,E) is a (finite and simple) graph, we call an independent set X a gated independent set in G if for each x∈X, there exists a neighbor y of x such that (X∖{x})∪{y} is an independent set in G. We define the gated independence numbergi(G) of G to be the maximum cardinality of a gated independent set in G. We demonstrate that the gated independence number is closely related to both matching and domination parameters of graphs. We prove that the inequalities im(G)⩽gi(G)⩽mur(G) hold for every graph G, where im(G) and mur(G) denote the induced and uniquely restricted matching numbers of G. On the other hand, we show that γi(G)⩽gi(G) and γpr(G)⩽2gi(G) for every graph G without any isolated vertex, where γi(G) and γpr(G) denote the independence and paired domination numbers. Furthermore, we provide bounds on the gated independence number involving the order, size and maximum degree. In particular, we prove that gi(G)⩾n5 for every n-vertex subcubic graph G without any isolated vertex or any component isomorphic to K3,3, and gi(B)⩽3n8 for every n-vertex connected cubic bipartite graph B.

Rashnu: Data-Dependent Order-Fairness

Distributed data management systems use state Machine Replication (SMR) to provide fault tolerance. The SMR algorithm enables Byzantine Fault-Tolerant (BFT) protocols to guarantee safety and liveness despite the malicious failure of nodes. However, SMR does not prevent the adversarial manipulation of the order of transactions, where the order assigned by a malicious leader differs from the order in that transactions are received from clients. While order-fairness has been recently studied in a few protocols, such protocols rely on synchronized clocks, suffer from liveness issues, or incur significant performance overhead. This paper presents Rashnu , a high-performance fair ordering protocol. Rashnu is motivated by the fact that fair ordering among two transactions is needed only when both transactions access a shared resource. Based on this observation, we define the notion of data-dependent order fairness where replicas capture only the order of data-dependent transactions and the leader uses these orders to propose a dependency graph that represents fair ordering among transactions. Replicas then execute transactions using the dependency graph, resulting in the parallel execution of independent transactions. We implemented a prototype of Rashnu where our experimental evaluation reveals the low overhead of providing order-fairness in Rashnu.

Designing lab-on-a-chip systems with attribute dependency graphs

AbstractLab-on-a-Chip (LOC) products for point-of-care diagnostics have gained significant attention. However, there is a lack of systematic approaches for LOC product development. To address this, we introduce an Attribute Dependency Graph exemplary for a magnetophoretic LOC system for pathogen detection. This model organizes dependencies between the design variables and crucial quantities of interest, such as detectability, cost per test, and test duration. The obtained model helps to manage design complexity and can be adapted to other LOC approaches.

ВИЗНАЧЕННЯ РАЦІОНАЛЬНОГО СКЛАДУ РЕАГЕНТІВ ДЛЯ ЗДІЙСНЕННЯ ПРОЦЕСІВ КОМПЛЕКСНОГО РАФІНУВАННЯ РІДКОГО ЧАВУНУ НА ЕТАПІ ПОЗАПІЧНОЇ ОБРОБКИ

The paper is devoted to the issue of complex treatment of cast iron. Possible chemical transformations that can occur when reagents are introduced into liquid cast iron are analyzed, and expressions for calculating the equilibrium constant Kr, depending on temperature, are obtained. Graphical dependences of the equilibrium constants on temperature for these reactions were also constructed. The calculations were performed for desulfurization reactions, carbonate dissociation reactions, oxidation of cast iron impurities due to interaction with carbon dioxide, and for the interaction of liquid cast iron components with iron oxides. Thermodynamic calculations have established that the mixture for the complex refining of liquid cast iron at the out-of-furnace treatment stage should belong to the chemical system CaO - Na2CO3 - FeO(Fe2O3) - Al. The specific ratio of components is determined by the required refining result.

A Knowledge Graph Service Composition Model for E-Government

In an era of Artificial Intelligence (AI), governments around the world are advancing their digital footprints, and using AI to achieving their objectives of effective and efficient public service delivery and citizens engagement. Knowledge Graph (KG), a constituent AI technology, has proven to be the means through which a government can use to manage the complexity of an e-Government instance, and realize its objective. One area in e-Government that KG is used to address, is the challenge of automated composition of web services, where web services are created and maintained by one government department, but is used by another, in an integrated and interoperable manner. Service composition is the combination of two or more web services to create a composite service in order to accomplish a task. In this paper, we present a KG-based approach for automatically composing web services in an e-Government context. Our aim is to advance the e-Government objective of effective and efficient public service delivery and citizens engagement, given a complex e-Government. We focus on creating a Service Dependency Graph (SDG), which captures the semantic relationships between the services, and we further describe the services with QoS characteristics, and then we create a weighted graph based on these two descriptions. We then adapted the Uniform Cost Search algorithm to find the shortest path between a start node and a goal node. We implement our algorithm, and carried-out experiments to obtain execution times, and we compared our results with benchmark results of comparable experimental setup. The difference in execution times of the service composition task is dependent on factors such as the design of the composition model, the complexity of the composition graph, and the hardware and software environments. Our research approach affords us the means to analyze and design our model; and validate and evaluate our work. Our model and the development approach help to achieve the e-Government goals of efficient and effective service delivery and citizens engagement.

Knowledge Graph Multi-Hop Question Answering Based on Dependent Syntactic Semantic Augmented Graph Networks

In the rapidly evolving domain of question answering systems, the ability to integrate machine comprehension with relational reasoning stands paramount. This paper introduces a novel architecture, the Dependent Syntactic Semantic Augmented Graph Network (DSSAGN), designed to address the intricate challenges of multi-hop question answering. By ingeniously leveraging the synergy between syntactic structures and semantic relationships within knowledge graphs, DSSAGN offers a breakthrough in interpretability, scalability, and accuracy. Unlike previous models that either fall short in handling complex relational paths or lack transparency in reasoning, our framework excels by embedding a sophisticated mechanism that meticulously models multi-hop relations and dynamically prioritizes the syntactic–semantic context.

Results of experimental research of the process of forming reinforced concrete products by the centrifugation method

The method of conducting an experimental study of the process of forming reinforced concrete products is disclosed. The key factors influencing the quality indicators of the product being formed are defined and considered. On the basis of the conducted active, factorial experiment, a regression equation was compiled, graphical dependences of the influence of these factors on the process were obtained, rational parameters of the centrifugation process were determined, which are decisive in the manufacture of reinforced concrete products by the centrifugation method. Based on the results of laboratory experiment data processing, recommendations were developed for optimizing the operating parameters of industrial equipment for forming reinforced concrete products by the centrifugation method. Problem. When forming reinforced concrete products by the centrifugation method, some problems may arise, uneven distribution of the mixture in the mold body and of reinforcement, formation of voids or cracks, insufficient compaction of the mixture. If the parameters of the centrifugation process are not properly controlled, the quality of the products may vary, which may lead to deviations from specifications and standards. Problems with the deformation of the molds after forming the product can lead to damage to the product or difficulties in its removal. Goal. Based on the results of the conducted factorial experiment, recommendations are developed regarding the rational parameters of the process of forming columns of reinforced concrete supports for power transmission lines by the centrifugation method in the conditions of an operating technological line. Methodology. The basis of the research is the method of conducting a planned factorial experiment with further statistical processing of the obtained results using a computer program. Results. Based on the processing of the obtained results of the conducted factorial experiment, the following recommendations are suggested regarding the rational parameters of the process of forming reinforced concrete pillars for power lines by the centrifugation method in the conditions of an operating technological line.

Differential thermal analysis of moisture binding in zephyr with different contents of glucose syrup

When formulating a product, it is just as important to measure changes in free and bound moisture as it is to analyze quality indicators. Zephyr, a Russian whipped dessert, made with sugar dries quickly during storage, gradually losing its moisture. Its crystalline sugar crust thickens and its entire mass saccharifies, resulting in higher firmness and poor appearance. In this study, we aimed to determine the effect of high-conversion glucose syrup on the amount of moisture and its binding forms in zephyr after storage.
 We studied four samples of pectin-based zephyr with different carbohydrate profiles after three months of storage. Differential scanning calorimetry, thermogravimetry, and non-isothermal kinetics were applied to assess moisture contents and forms of binding in zephyr.
 Thermograms with thermoanalytical curves were used to analyze the thermolysis of zephyr samples with different contents of glucose syrup in the temperature range from 20 to 300°C. We also studied the endothermic effects at various stages of thermolysis and measured free and bound moisture in the samples. Four stages of their dehydration were identified on the basis of graphical dependences between weight changes and heating temperatures.
 The control zephyr sample contained more capillary and polymolecular bound moisture, while the experimental samples in which sugar and confectioner’s syrup were partially or completely replaced with high-conversion glucose syrup had more polymolecular and monomolecular bound moisture. The use of high-conversion glucose syrup instead of sugar and confectioner’s syrup reduced the amount of free moisture and therefore increased the amount of bound moisture, keeping zephyr fresh throughout its shelf life.

Micro-Doppler based Human Activity Recognition using ABOA based Dual Spatial Convolution with Gated Recurrent Unit

The through-wall capability, device-free detection of radar-based human activity recognition are drawing a lot of interest from both academics and industry. The majority of radar-based systems do not yet combine signal analysis and feature extraction in the frequency domain and the time domain. Applications like smart homes, assisted living, and monitoring rely on human identification and activity recognition (HIAR). Radar has a number of advantages over other sensing modalities, such as the ability to shield users' privacy and conduct contactless sensing. The article introduces a new human tracking system that uses radar and a classifier called Dual Spatial Convolution Gated Recurrent Unit (DSC-GRU) to identify the subject and their behavior. The system follows the person and identifies the type of motion whenever it detects movement. One important feature is the integration of the GRU with the DSC unit, which allows the model to simultaneously capture the spatiotemporal dependence. Present prediction models just take into account spatial features that are immediately adjacent to each other, disregarding or just superimposing global spatial features when taking spatial correlation into account. A new dependency graph is created by calculating the correlation among nodes using the correlation coefficient; this graph represents the global spatial dependence, while the classic static graph represents the neighboring spatial dependence in the DSC unit. The DSC unit goes a step further by using a modified gated mechanism to quantify the various contributions of both local and global spatial correlation. While previous models performed worse, the suggested model outperformed them with an accuracy of 99.45 percent and a precision of 97.15 percent.

Exploring the drivers of local government budget coordination: A random forest regression analysis

Budget coordination is a critical issue of local government coordinative governance. Existing literature emphasizes its importance but does not give in-depth empirical research. The random forest regression model was used to probe into the drivers of budget coordination for 2815 local government projects in China. Based on the purity of the split nodes of the decision tree, the three most important factors for achieving the goal of local government budget coordination are identified: discretion, decision-making level and fund scale. The partial dependence graphs visually illustrate the differentiated and nonlinear marginal effects of various explanatory variables on the response variable.

SAGL: A self-attention-based graph learning framework for predicting survival of colorectal cancer patients

Background and Objective: Colorectal cancer (CRC) is one of the most commonly diagnosed cancers worldwide. The accurate survival prediction for CRC patients plays a significant role in the formulation of treatment strategies. Recently, machine learning and deep learning approaches have been increasingly applied in cancer survival prediction. However, most existing methods inadequately represent and leverage the dependencies among features and fail to sufficiently mine and utilize the comorbidity patterns of CRC. To address these issues, we propose a self-attention-based graph learning (SAGL) framework to improve the postoperative cancer-specific survival prediction for CRC patients.Methods: We present a novel method for constructing dependency graph (DG) to reflect two types of dependencies including comorbidity-comorbidity dependencies and the dependencies between features related to patient characteristics and cancer treatments. This graph is subsequently refined by a disease comorbidity network, which offers a holistic view of comorbidity patterns of CRC. A DG-guided self-attention mechanism is proposed to unearth novel dependencies beyond what DG offers, thus augmenting CRC survival prediction. Finally, each patient will be represented, and these representations will be used for survival prediction.Results: The experimental results show that SAGL outperforms state-of-the-art methods on a real-world dataset, with the receiver operating characteristic curve for 3- and 5-year survival prediction achieving 0.849±0.002 and 0.895±0.005, respectively. In addition, the comparison results with different graph neural network-based variants demonstrate the advantages of our DG-guided self-attention graph learning framework.Conclusions: Our study reveals that the potential of the DG-guided self-attention in optimizing feature graph learning which can improve the performance of CRC survival prediction.

Research of numerical indicators for the development of the Asselskaya area of Orenburg oil and gas condensate field using the material balance method

The purpose of this work is to analyze and forecast the development indicators of the Assel deposit of Orenburg oil and gas condensate field. To complete this task, a large amount of data is required, which was obtained from the technological development project. The calculation is performed using a program written in the Python programming language. The variables for the material balance equation are given, some of them are calculated using intermediate formulas. The average values of the parameters over the last 15 years of development were chosen as the optimized parameters, since small amounts of cumulative production in the first years of development can lead to a significant error in the calculation of the material balance equation. Also, a comparison was made of the estimated forecast for the development of the Assel deposit with the forecast, according to the state plan, presented in the field development project. The comparison was made on the main parameters: cumulative oil production, annual oil production, oil recovery factor and water cut. For a visual comparison of the calculated parameters, dependency graphs are presented that reflect the forecast made by the material balance method, as well as the forecast based on the data of the state plan. The difference in the behavior of the curves shown on the graphs can be explained by the inaccuracy of the parameters describing the reservoir, as well as the inaccuracy of determining the initial recoverable reserves. This is also affected by the difference in reservoir drawdowns for injection and production wells, proposed in the state plan and in the forecast. Of course, the inaccuracy of the injectivity and productivity coefficients of wells, which were selected based on the estimated volumes of water injection and oil production, also affects. Based on the calculation performed, it can be concluded that it is expedient to further exploit the Asselskaya area of Orenburg oil and gas condensate field with the introduction of a reservoir pressure maintenance system until 2079. According to the forecasts, the water cut equal to 96% will be achieved in 2079, while the oil recovery factor will be 0.427.

Intelligent code search aids edge software development

The growth of multimedia applications poses new challenges to software facilities in edge computing. Developers must effectively develop edge computing software to accommodate the rapid expansion of multimedia applications. Code search has become a prevalent practice to enhance the efficiency of the construction of edge software infrastructure. Researchers have proposed lots of approaches for code search, and employed deep learning technology to extract features from program representations, such as token, AST, graphs, method name, and API. Nevertheless, two prominent issues remain: 1) there are only a few studies on the effective use of graph representation for code search (especially in Java language), and 2) there is a lack of empirical study on the contributions of different program representations. To address these issues, we conduct an empirical study to explore program representations, especially program graphs. To the best of our knowledge, this is the first attempt to conduct code search with mixed graphs representation for Java language, containing the control flow graph and the program dependence graph. We also present a hybrid approach to capture and fuse the features of a program with representations of Token, AST, and Mixed Graphs (TAMG). The results of our experiment show that our approach possesses the best ability (R@1 with 37% and R@10 with 67.1%). Our graph representation exhibits a positive effect, and the token and AST also have a significant contribution to the code search. Our findings can aid developers in efficiently searching for the desired code while constructing the software infrastructure for edge computing, which is crucial for the rapid expansion of multimedia applications.

Exploring user satisfaction and improvement opportunities in public charging pile resources

The existing market of public charging pile services for electric vehicle (EV) users has occupied a particular market share. However, instead of solely focusing on pre-planning the construction of charging piles, it is crucial to address the shortcomings of the existing charging pile service and develop effective marketing strategies. This approach can help optimize the utilization of charging pile resources and minimize wastage. In this study, we explore EV users’ comments on the public charging pile service and adopt a natural language pre-training model to classify comments for extracting positive and negative comments. For these two types of comments respectively, we construct the text-to-knowledge to mine the keywords from multiple dimensions. We further excavate the words correlated with the keywords by utilizing dependency parsing to create relational dependency graphs. Taken together, we identify key factors influencing EV user satisfaction or dissatisfaction and uncover the relationships among these factors. These insights provide valuable information for charging pile operators to develop targeted marketing strategies and improvement plans for the existing public charging pile resources, ultimately enhancing the overall user experience.

Распределение осевой и радиальной скорости вблизи с круглым раструбом в воздуховоде

The purpose of the article is to increase the energy efficiency of ventilation systems in mining enterprises using a round socket installed in the air duct. The article presents numerical and experimental results of studying the outlines of vortex zones formed at the installation site of a round bell. Numerical studies were carried out using the Ansys Fluent software package. We obtained graphical and analytical dependences of the distribution of the axial and radial components of the velocity near the bell, depending on its radius and angle of inclination

Interactive Abstract Interpretation with Demanded Summarization

We consider the problem of making expressive, interactive static analyzers compositional . Such a technique could help bring the power of server-based static analyses to integrated development environments (IDEs), updating their results live as the code is modified. Compositionality is key for this scenario, as it enables reuse of already-computed analysis results for unmodified code. Previous techniques for interactive static analysis either lack compositionality, cannot express arbitrary abstract domains, or are not from-scratch consistent. We present demanded summarization, the first algorithm for incremental compositional analysis in arbitrary abstract domains that guarantees from-scratch consistency. Our approach analyzes individual procedures using a recent technique for demanded analysis, computing summaries on demand for procedure calls. A dynamically updated summary dependency graph enables precise result invalidation after program edits, and the algorithm is carefully designed to guarantee from-scratch-consistent results after edits, even in the presence of recursion and in arbitrary abstract domains. We formalize our technique and prove soundness, termination, and from-scratch consistency. An experimental evaluation of a prototype implementation on synthetic and real-world program edits provides evidence for the feasibility of this theoretical framework, showing potential for major performance benefits over non-demanded compositional analyses.

О зависимости процесса промерзания грунтов от влажности

Purpose: the temperatures at which soils begin to freeze during the onset of frost are of interest primarily to agricultural workers and construction workers. It was previously established that many factors influence soil freezing. However, not enough research has been carried out on the influence of individual factors on the freezing process. The article examines the influence of soil moisture on their supercooling and freezing temperatures. Methods: the studies were carried out in a microrefrigerator with three freezing modes. Results: it was found that with constant shaking, the supercooling temperature increased, but the freezing temperature did not change. Graphic dependences of the temperatures of supercooling and freezing of soils on the initial humidity were obtained. The degree of soil compaction did not affect these temperatures. The temperatures of supercooling and freezing of soils depend to a greater extent on the dispersion of soils than on the content of organic substances in them. Practical significance: the results of the work are important for construction as they expand the understanding of the features of the mechanism of soil freezing.

FEATURES OF MAGNETIC OSCILLATIONS IN A TWO-LAYER STRUCTURE WITH EXCHANGE COUPLING

Graphs of time and frequency dependences of the components of magnetic oscillations of the layers of a planar two-layer structure and their portraits of oscillations were constructed. The excitation of the structure layers for different interlayer coupling coefficients was carried out by a microwave magnetic field of circular polarization. The interlayer bond is characterized by an additional local energy minimum, the spatial position of which depends on the coupling coefficient.