Search

Purpose. The article substantiates and confirms the thesis about the need for energy-oriented power consumption control levels in power complexes: the system of power supply at iron ore underground mining enterprises on the basis of experiment data analysis. Methodology. It is estimated that along with the current positive trend suitable for developing architecture of power consumption control levels when a limited number of energy-intensive enterprises consume about 80 % of the total power produced, their functioning modes in day hours vary. Analysis of varied realtime modes of power consumption in hours indicates absence of enterprises’ control over this process. Results. The suggested methods enable forecasting efficiency of power consumption control in hours in any variant of time-of-day tariff integration. In non-standard and changeable conditions of technological parameters in mining production, on the basis of the results of stochastic optimization analysis, it is proven that even when applying a small number of iterations N = 10, it is possible to improve the initial solution by over 60 % (the initial value of the objective function is I* = 27.7 and the final value on the last iteration is I* = 10.7). There are determined required vectors to specify a connection of the time-of-day tariff of ore mining (Р*) and the corresponding power consumption (Е*) which corresponds to the suboptimal value of the objective function (I*). The obtained results can be applied to developing recommendations for a more efficient planning of an enterprise’s performance. Practical value. The suggested algorithm implemented in power consumption control systems enables receiving a final result with any quality required for the level. If the quality of the obtained results needs improving, the number of iterations is to be increased by two or three orders of magnitude.

The growing popularity of payment cards has led to the emergence of new types of illegal transactions with money. In particular, the widespread use of non-cash payments has allowed fraud to reach the international level. Therefore, financial institutions are interested in the development and implementation of new effective fraud monitoring systems that will minimize the risk of approving illegal transactions. The article presents the results of applying machine learning methods to detect fraudulent transactions with bank cards. The use of various classification methods in modeling the specified problem is investigated. Generalized algorithm for detecting fraudulent transactions has been developed, which makes it possible to detect atypical international money transfers in real time. Generalized algorithm for detecting atypical international transfers will allow timely detection of potential fraud cases, thereby reducing the total volume of losses from illegal transactions and minimizing the reputation damage caused to the organization.

In this paper, a generalized algorithm is proposed to balance the DC-link (DCL) voltage across each power cell of n number of cascaded H-bridge multilevel inverter (CHBMLI), using dc-dc converter, ...

The paper describes research results of features of error detection in data vectors by sum codes. The task is relevant in this setting, first of all, for the use of sum codes in the implementation of the checkable discrete systems and the technical means for the diagnosis of their components. Methods for sum codes constructing are described. A brief overview in the field of methods for sum codes constructing is provided. The article highlights codes for which the values of all data bits are taken into account once by the operations of summing their values or the values of the weight coefficients of the bits during the formation of the check vector. The paper also highlights codes that are formed when the data vectors are initially divided into subsets, in particular, into two subsets. An extension of the sum code class obtained by isolating two independent parts in the data vectors, as well as weighting the bits of the data vectors at the stage of code construction, is proposed. The paper provides a generalized algorithm for two-module weighted codes construction, and describes their features obtained by weighing with non-ones weight coefficients for one of data bits in each of the subvectors, according to which the total weight is calculated. Particular attention is paid to the two-module weight-based sum code, for which the total weight of the data vector in the residue ring modulo M = 4 is determined. It is shown that the purpose of the inequality between the bits of the data vector in some cases gives improvements in the error detection characteristics compared to the well-known two-module codes. Some modifications of the proposed two-module weighted codes are described. A method for calculating the total number of undetectable errors in the two-module sum codes in the residue ring modulo M = 4 with one weighted bit in each of the subsets is proposed. Detailed characteristics of error detection by the considered codes both by the multiplicities of undetectable errors and by their types (unidirectional, symmetrical and asymmetrical errors) are given. The proposed codes are compared with known codes. A method for the synthesis of two-module sum encoders on a standard element base of the single signals adders is proposed. The classification of two-module sum codes is presented.

The major bottleneck of first principle based beyond Born–Oppenheimer (BBO) treatment originates from large number and complicated expressions of adiabatic to diabatic transformation (ADT) equation...

The author of the work has proposed an algorithm for determining catacaustics in a “source-reflector” optical system on a plane. Katakaustika is called the envelope of reflected rays from a given curve and the study of catacaustics in the design of optical systems is one of the main tasks. The paper gives examples of solving this problem and presents the corresponding visualization. Particular attention is paid to problems where the source and reflector are curved, because these tasks in the scientific literature have not been previously considered. The presented algorithm is based on the cyclographic projection of the spatial curve of the line and its optical property. It is versatile and suitable for all tasks where the source of optical radiation is given in the form of a central (point), parallel or scattered beam of direct (light rays). The main advantage of the algorithm is that in the end it turns out analytical, i.e. exact solution to the problem of determining catacaustics. The results of the study can be used in applied fields of geometric optics, as well as in various computer-aided design systems specializing in modeling lighting of geometric objects.

Pulse-like signals are ubiquitous in the field of single molecule analysis, e.g., electrical or optical pulses caused by analyte translocations in nanopores. The primary challenge in processing pulse-like signals is to capture the pulses in noisy backgrounds, but current methods are subjectively based on a user-defined threshold for pulse recognition. Here, we propose a generalized machine-learning based method, named pulse detection transformer (PETR), for pulse detection. PETR determines the start and end time points of individual pulses, thereby singling out pulse segments in a time-sequential trace. It is objective without needing to specify any threshold. It provides a generalized interface for downstream algorithms for specific application scenarios. PETR is validated using both simulated and experimental nanopore translocation data. It returns a competitive performance in detecting pulses through assessing them with several standard metrics. Finally, the generalization nature of the PETR output is demonstrated using two representative algorithms for feature extraction.

A feature of irregular end-to-end business processes is that at some competitive points their number can not only change, but a new business process can be included in their number. Given these features, problems arise in planning, accounting, control, analysis and regulation. To solve them, methods and tools of operational calendar planning are used. However, problems arise when managing such business processes competing for shared resources. To solve them, the article proposes a generalized algorithm for finding a solution to establish priorities for launching end-to-end business processes with the participation of decision makers at each competitive point. The developed software platform is described which provides in the just in time mode the automatic correction of the obtained solutions.

The paper discusses a model of an automated system for sorting correspondence, developed in the VisSim environment. A simulation model of information coding has been developed. The possibility of optimizing the operation of similar lines is shown. A generalized algorithm for managing the sorting and accumulation of correspondence has been developed.

Every countrywide reform can always have specific opponents and fans as the changes make people leave their comfort zone. As an example, we have chosen a Ukrainian decentralization reform. Although this local self-government reform can be considered the most successful in our country, the attitude of Ukrainians to the changes has not always been unambiguous. Using taxonomic analysis, the paper calculates the integrated indicator of public approval of decentralization reform in Ukraine based on sociological research for 2015–2020. We have described the features of conducting surveys in different periods and identified the reasons for the emergence of such an attitude to the reform. We have also calculated the weights of the impact of each primary indicator on the integrated indicator, which helped us identify the weaknesses and strengths of the reform in public opinion Furthermore, the analysis allowed us to reveal and substantiate a set of problems in implementing decentralization reform in Ukraine, and the causes and solutions were worked out for each problem. Finally, we have made a generalized algorithm for the application of the experience of public opinion analysis in planning and carrying out reforms.

In this paper, we propose using a single protograph to design joint source-channel codes (JSCCs). We present a generalized algorithm, called protograph extrinsic information transfer for JSCC algorithm (PEXIT-JSCC algorithm), for analyzing the channel threshold of the proposed JSCC. Using the classic AR3A and AR4JA protographs, we construct AR3A-JSCC and AR4JA-JSCC codes. We analyze their decoding thresholds and compare their performance with JSCC systems using optimized double protograph low-density-party-check codes.

Simulating multiple linked elemental cycles is a frontier in the field of biogeochemistry. The Generalized Algorithm for Nutrient, Growth, Stoichiometric and Thermodynamic Analysis (GANGSTA) is a software framework that automates the instantiation of formalized, user-defined conceptual models of linked elemental cycles as simulation model code. The GANGSTA employs first principles of stoichiometry and thermodynamics to generate models that simulate any suite of elemental cycles, compounds, metabolic processes, and microorganisms. Results demonstrated, e.g., that simulating the oxygen (O) cycle, rather than oxic versus anoxic conditions, fundamentally altered carbon (C) and nitrogen (N) cycling - despite holding the compounds and processes involved in the C and N cycles constant. Additionally, incorporating the sulfur (S) cycle substantively changed C and N cycling, largely via shifts in the O cycle. Thus, emergent dynamics from GANGSTA-derived models can aid in the development of hypotheses to describe the specific mechanisms of interdependence among linked elemental cycles.

It is necessary for cost consideration to minimize the number of the used layers in a high-speed printed circuit board (PCB) design. In this paper, any independent net cannot be treated as a bus-oriented net in a high-speed PCB design because of no timing-matching constraint on an independent net. Any independent net in a high-speed PCB design can be modeled to obey the via-count constraint as the maximum number of the permitted vias for signal integrity. Clearly, the introduction of the permitted vias onto the independent nets can lead to the reduction on the number of the used layers in a high-speed PCB design. Given a set of bus-oriented nets and a set of independent nets with a via-count constraint in a high-speed PCB design, by introducing virtual vias onto independent nets and eliminating redundant vias on any used layer, a generalized algorithm can be proposed to minimize the number of the used layers with satisfying the via-count constraint on any independent net and assign the given bus-oriented nets and the separated segments inside the given independent nets onto the used layers. Compared with Yan’s algorithm with no via introduction on independent nets, the experimental results show that our proposed algorithm with ${c_{\max } = 1}$ , ${c_{\max } = 2}$ , ${c_{\max } = 3}$ , ${c_{\max } = 4}$ , and ${c_{\max } = 5}$ use reasonable CPU time to insert permitted vias to reduce 2.1, 2.8, 3.8, 4.4, and 4.6 used layers on the average for ten tested examples, respectively. Compared with a two-phase algorithm with via introduction on independent nets, the experimental results show that our proposed algorithm with ${c_{\max } = 1}$ , ${c_{\max } = 2}$ , ${c_{\max } = 3}$ , ${c_{\max } = 4}$ , and ${c_{\max } = 5}$ use less CPU time to reduce 1.6, 1.7, 1.7, 1.6, and 1.5 used layers on the average with increasing 13.3%, 16.3%, 10.6%, 4.2%, and 2.6% of the total used vias on the independent nets for ten tested examples, respectively.

An attempt is made to reduce the maximum value of rms electric field (E-field) via the transposition of conductors in a 765-kV substation with reference to the occupational exposure. The method is applied to a extra-high-voltage substation, which is under construction. The effect of transposing the bay conductors (alone) and the bus conductors (alone) on the E-field distribution (at 2 m above the ground) over the area of the substation is discussed. Also, the topology of substation conductors that results in the minimum value for the maximum of rms E-fields is obtained via simultaneous transpositions of the bus and bay conductors. The area of the substation where the rms E-field exceeds the reference value of 10 kV/m (International Commission on Non-Ionizing Radiation Protection occupational exposure limit) is also reported for the existing topology. For this topology, the computed maximum value of the rms E-field over the area of the substation is 13.06 kV/m. This E-field is reduced to 7.999 kV/m with the best configuration of substation conductors obtained via transposition. The charge-simulation-method-based generalized algorithm for obtaining the best topology (among all permutations) of substation conductors, which results in the minimum value for the maximum of rms E-field magnitudes over the substation area is also reported.

As a typical quantum computing algorithm, quantum annealing is widely used in the optimization of glass-like problems to find the best solution. However, the optimization problems in constrained complex systems usually involve topological structures, and the performance of the quantum annealing algorithm is still largely unknown. Here, we take an Ising system as a typical example with local constraints accompanied by intrinsic topological properties that can be implemented on quantum computing platforms such as the D-wave machine, and study the effectiveness of the quantum annealing algorithm in its optimization and compare it with that of the thermal annealing. We find that although conventional quantum annealing is difficult for the optimization of constrained topological problems, a generalized algorithm --- the sweeping quantum annealing method --- can be designed and solve the problem with better efficiency than both conventional quantum and thermal annealing algorithms. The sweeping quantum annealing algorithm, therefore, opens up a promising avenue for quantum computing of constrained problems and can be readily employed on the optimizations in quantum material design, engineering, and even social sciences.

This letter proposes a new generalized continuous-time distributed optimization algorithm which includes the popular modified-Lagrangian-based (MLB) algorithm and zero-gradient-sum (ZGS) algorithm as its special cases. The convergence of the proposed algorithm to the optimal point is analyzed in a uniform framework for directed and undirected communication topologies. Moreover, it is showed that by utilizing the Hessian of local cost functions, the design of algorithmic gains is made independent of global information even if the ZGS constraints are not satisfied. Finally, numerical simulations are provided to illustrate the feasibility of the theoretical results.

The purpose of the study is the analysis of best practices in the implementation of new technologies in the system of university education and their impact on the development of the teaching profession. Research tasks: - to conduct a sociological survey of teachers of higher educational institutions on the impact of new technologies on the teaching profession in order to identify problematic and positive aspects of the introduction of new educational technologies; - to analyze the best practices of introduction of new educational technologies in the leading universities of the world for the purpose of formation of the generalized algorithm of adaptation of new technologies to educational process and development of a pedagogical profession; - formulation of recommendations for ensuring high quality of online education and development of the pedagogical profession in the conditions of online learning. we note that new technologies will certainly improve the skills of teachers, but provided that the university creates the necessary working conditions.

In this work, a generalized algorithm is introduced to generate all alternatives of planar N-bar kinematic chains (KCs) with simple joints containing sliders. A simple graphical technique is introduced to enumerate all available N-bar chains with prismatic (P) joints. Then, a new topological Loop Code (TLC) is presented to detect isomorphic chains during the enumeration process in addition to detecting rejected KCs. A visual C++ code is developed for automatic enumeration and detection of rejected KCs and isomorphic KCs. Examples of 6, 8, and 10-bar KCs are presented to illustrate algorithm procedures. As a result, 21, 16, and 1350 KCs have P-joints for Stephenson, Watt, and 8-bar chains, respectively. Also, 308 KCs are obtained for a 10-bar KC with up to 3 sliders.

The Detection of the location of partial discharge in the windings of power transformers has always been considered a challenging task because of the convoluted structure of the winding. There are several methods proposed for the localization of partial discharge in the transformer winding. In this paper, we have concluded a detailed study on a generalized algorithm to compute the response of a partial discharge in a winding of a transformer. The algorithm for two separate winding sections that are along and across the winding is computed. A correlation method is used to compare the responses of the test signal and an arbitrary signal. A response is calculated as a current response at the winding neutral terminal.

The questions of development a generalized algorithm for determining the parameters of the low circular orbit (LCO) of an Earth satellite (ES) based on the use of quadratic functionals are in the focus of this paper. The functionals represent the square of the differences between the measured values of the ES sighting angles and the frequency of the received signal with the values of the same parameters obtained for the assumed values of the Keplerian orbital elements in accordance with the adopted model of the ES motion. Estimates of the orbit parameters are formed from the condition of the minimum of the proposed quality functionals. The proposed algorithm is aimed at the developing two equations for the relationship between the measured values of the azimuth and elevation angles, as well as the frequency of the received satellite signal and the parameters of the satellite orbit. The use of the indicated constraint equations makes it possible to pass from the six-dimensional space of the Keplerian orbital elements to the four-dimensional space of the Keplerian orbital elements when constructing the algorithm and choosing the initial approximations of the orbit parameters. Such a reduction in the dimension of space makes it possible to significantly reduce the amount of computational expenditure, which ensures the stability of the algorithm and expands the possibilities of its practical use with limited resources (computing power and restrictions on the permissible processing time). The following Keplerian orbital elements are proposed as four basic parameters: eccentricity, ascending node longitude, orbital inclination, and perigee argument. The other two elements, the semi-major axis of the orbit and the mean anomaly, are expressed as functions of four basic parameters. This choice is determined by the fact that, in the case of LCO, the pivoting of the initial values of the eccentricity and the argument of perigee is quite simple, which makes it possible to ensure convergence to the exact values of the orbit parameters in a wide value of the initial approximations. Within the Keplerian approximation of the satellite's orbital motion, mathematical relations are presented that determine the operations performed within the framework of the considered algorithm. However, a more complete consideration of the factors influencing the motion of the satellite only leads to more volumetric relations, but does not fundamentally affect the construction of the algorithm itself.

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm for single player games. In this paper we propose to generalize NRPA with a temperature and a bias and to analyze theoretically the algorithms. The generalized algorithm is named GNRPA. Experiments show it improves on NRPA for different application domains: SameGame and the Traveling Salesman Problem with Time Windows.

Exploration and remote sensing with mobile robots is a well known field of research, but current solutions cannot be directly applied for tethered robots. In some applications, tethers may be very important to provide power or allow communication with the robot. This paper presents an exploration algorithm that guarantees complete exploration of arbitrary environments within the length constraint of the tether, while keeping the tether tangle-free at all times. While we also propose a generalized algorithm that can be used with several exploration strategies, our implementation uses a modified frontier-based exploration approach, where the robot chooses its next goal in the frontier between explored and unexplored regions of the environment. The basic idea of the algorithm is to keep an estimate of the tether configuration, including length and homotopy, and decide the next robot path based on the difference between the current tether length and the shortest tether length at the next goal position. Our algorithm is provable correct and was tested and evaluated using both simulations and real-world experiments.

The article presents a model and a generalized algorithm for determining and predicting an abrupt change in a technical parameter. The model is based on processing Poincare graphs generated in real time by a local array of points in the time series of parameter values. The array is cut out by a fixed time window during its movement along the time series. At the initial stage, abnormal values of the initial time series are detected using the Irwin criterion. For each chart, a reference trend is constructed in the form of a linear function. To assess the abrupt change in the parameter, the adequacy of the reference trend to an array of points on the graph is analyzed. To estimate the magnitude of the parameter, change within the time window, the standard deviation of the points on the Poincare graph from the point of the center of mass is calculated. The criterion for an unacceptable change in the parameter is the calculated deviation beyond the specified zone. The model provides for fixing an emergency at an early stage of its development in real time.

The paper analyzes methods of data clustering. Cytological images of breast cancer were investigated, and nuclei feature of cytological images were calculated. The authors have developed a generalized algorithm for clustering cytological images, which includes the definition of the main features, the calculation of the number of clusters and the K-means algorithm. Computer experiments were conducted using Python computer vision libraries.

The goal of this paper is to describe the pathophysiology of adult nocturnal enuresis and develop a generalized approach for evaluation and treatment. Although nocturnal enuresis (NE) impacts a significant proportion of the adult population, research on this topic remains lacking. In the few existing studies, the management strategy is extrapolated from research on pediatric nocturnal enuresis. Furthermore, treatment approaches highlight the importance of identifying risk factors and contributing pathologies. The modern urologist should understand the complexity of this problem and the variety of techniques to evaluate and treat the adult patient with NE. Adult nocturnal enuresis is multifactorial and may have multiple underlying pathologies. A comprehensive workup requires an understanding of the patient’s history and symptomatology and the pathophysiologic processes that can occur. Treatment should first target identifiable etiologies, although a generalized algorithm can then be utilized with behavioral and lifestyle modifications, followed by medical therapy. Future studies will provide a better framework for treating this problem.

Protecting data transmission networks from targeted attacks is currently a priority cyber security goal in critical infrastructures. The paper considers the approach to the evaluation of the probability of disclosing the structure of the data transmission network when the attacker implements targeted attacks. The approach is based on graph theory. The conceptual model of the targeted attack is presented. Algorithms for estimating the structural secrecy of data transmission networks are developed. They include an algorithm for evaluating the probability of compromising a network node and recognizing the structure of the data transmission network, as well as a generalized algorithm for estimating the structural secrecy. Implementation and results of the experimental evaluation of the proposed approach are discussed.

While talking about prime numbers there are two things that come to our mind, one is how do we know whether a number is prime or not and another is how do we generate new prime numbers. Many algorithms have been evolved regarding primality test. Various approaches have been made to perform this test for the determination of a prime number based on the time taken for the calculation, and how the prime number can be determined using various methods. Still there is not any generalized algorithm to generate prime numbers. There were many approaches given by Fermat but none of them is up to the mark. In this paper, we will go through some of the prime generating functions and then test some primality testing algorithms and propose our work to generate large prime numbers using smaller ones.

Traditionally, high-performance dedicated servers are used to build a DSS, as a rule they are expensive and require additional maintenance costs. The authors suggest a way to use common and more budget computer equipment to build distributed DSS. The subject of the paper is a development of an organization method and a generalized algorithm for the interaction of nodes of a distributed decision support system in the process of group interaction based on a multi-agent computing environment built with corporative computing infrastructure.

In the article, using econometric methods to analyze various aspects of identification of relevant factors of modernization of industrial enterprises, determined the most effective relations between them, their ranking is carried out. The paper provides an understanding of the role and place of the accelerated technological modernization of the industry as one of the imperatives of the state socio-economic strategy that currently updates the problem identification forms, mechanisms, strategies to build domestic industrial capacity. Along with this, SMEs require clear mechanisms of organizational-economic providing of the implementation of comprehensive modernization, including taking into account the specifics of the industrial complex and the accumulated socio-economic potential of the region. This predetermines the importance of the formulation of problems of organizational-economic providing of processes of technological modernization of the industry at the regional level. Discusses the changes in the process of modernization: the emergence of the latest procedures and devices of resolving social problems on the basis of improvement of all system of public relations and modification of way of life the emergence of innovative technologies; development of commodity-money relations, the acquisition of the highest level of professional expertise of managers and employees; the modification of social relations. The generalized algorithm effective management of the enterprise in terms of innovation, the tools identify the time lags of development of the enterprise. It is concluded that the identification of the relevant factors provides the possibility of optimizing the process of active management of innovative activity taking into account the stage of development of the enterprise.

The current algorithm for calculating mass flow rate in gas production and transportation systems from outlet pressure measurements is generalized to the case where the inner cross section of the pipe changes with time and is also to be determined in the course of solving the general problem. The generalized algorithm is recommended for identification of gas hydrate formation in the above-mentioned systems. The identification of hydrates in a main gas pipeline in permafrost is considered as an example.

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes (for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.

In present work we constructed the tree of quality indicators of plastic parts. A generalized algorithm is proposedto estimatethe quality level of plastic parts, which is the basis for the developmentof method forassessing the quality level of plastic parts. The designed algorithm, in contrast to those existing, includes a stage for the estimation of error in quality level, which will make it possible to improveaccuracy of determining thequality level of plastic parts. We devised acomprehensive method for evaluating quality of plastic parts. Its essence is in the fact that the obtained method allows us to determine anintegratedindicator of quality of plastic part, which includesa proposed nomenclature of quality indicators, represented in the form of the tree and the proposed generalized indicator of quality of plastic part. The developed comprehensive method differs from those existing by the proposed additional stage – the estimation of error in quality. Its essence is that it is necessary to determine: error in the number of properties that characterize quality; error in determiningthe weight coefficients;wear and aging of the materials that the MD are made of; error in the calculations of quality indicators;and permissible instrument errors. All these components will in turn make it possible to increase accuracy in the quality assessment of plastic parts. Results of present researchinto quality indicators ofpart’s PMdemonstrated that for the selected part, one part of the values of relative quality indicators is larger than unity, and another part is lower, which does not make it possible to unambiguously estimate the quality level for the givenpart. The designed method is useful in the development of mathematical and CAD software for technological equipment. It might be applied in the fabrication of thermoplastic parts for radio-electronic equipment.

Based on the analysis of the current global and national guidelines, the article offers a generalized algorithm for pregravid preparation of women with a history of miscarriage. There are recommendations on the identification and management of the main etiological factors of miscarriage to prevent recurrent pregnancy loss and other obstetric and perinatal complications.

In previous chapters, we introduced the three main processes required to implement generalized algorithm of fault tolerance (GAFT), namely—testing and checking, second recovery preparation, and third and finally recovery and recovery monitoring. We described what every of these steps incorporates, gave possible solutions, and analyzed them. In the Chap. 7, we introduced syndrome for testing and checking; here we introduce programming language models for the two other mentioned processes. What we now want to do is to synthesize the introduced concepts into system software tools—programming languages and their compilers. We will discuss possible project solutions related to the overall architecture of software tools and introduce the major components of the architecture.

The process of diagnosing partial failures in complex technical devices is considered. It is shown that the usual procedures used in the diagnosis of complete failures are complemented by the operations of collecting and processing information necessary for solving specific problems: identifying a failure as a partial and ensuring a decision about the possibility of continuing the operation of the device in partial failure conditions. A generalized algorithm for using the received diagnostic signs of failure in the recommendation for making decisions about further actions is given and disclosed by the content of the operators. Recommendations on the use of methods of control and diagnostic analysis of electromechanical systems are given. The essence of one of the deterministic approaches to solving the problem of identifying regimes affected by partial failures in multifunctional complex technical devices is disclosed. The advantages and disadvantages of this and other approaches are shown when solving the problem of identifying acceptable modes.The process of diagnosing partial failures in complex technical devices is considered. It is shown that the usual procedures used in the diagnosis of complete failures are complemented by the operations of collecting and processing information necessary for solving specific problems: identifying a failure as a partial and ensuring a decision about the possibility of continuing the operation of the device in partial failure conditions. A generalized algorithm for using the received diagnostic signs of failure in the recommendation for making decisions about further actions is given and disclosed by the content of the operators. Recommendations on the use of methods of control and diagnostic analysis of electromechanical systems are given. The essence of one of the deterministic approaches to solving the problem of identifying regimes affected by partial failures in multifunctional complex technical devices is disclosed. The advantages and disadvantages of this and other approaches are shown when solving th...

A recursive filtering technique is developed to improve the computational efficiency of explicit-filter large-eddy simulation in highly parallelized computational environments. In parallel computations on a partitioned domain, unlike in non-recursive explicit filtering in which the number of ghost cell layers for storing neighbor cell values to ensure communication with neighbor partitions is increased rapidly as the stencil of the filter becomes wider, the present recursive filtering technique requires only a single layer of ghost cells for storing immediate neighbor cell values regardless of the stencil width of the filter. A generalized algorithm for construction of recursive filters with desired filter widths is developed. The computational efficiency of the proposed recursive filtering technique over the conventional non-recursive broad-band filtering techniques in terms of memory usage and computational time is presented.

Forecasting plays a significant role in organizing the economic activities of executive authorities using the example of customs authorities, since this is associated with the ongoing policy of optimizing customs payments administered by customs authorities, ensuring the economic security of the state, improving the quality of customs services and compliance with customs legislation. A wide range of forecasting methods allows them to be applied on the basis of assessing the feasibility of applying one method or another to forecast the main economic indicators of the activities of executive authorities. The analysis of the scientific and methodological base made it possible to form and propose a generalized algorithm for forecasting the indicators of the economic activity of executive authorities. Goal is to develop a generalized algorithm for predicting the indicators of the economic activity of executive authorities using the example of customs authorities.

A number of authors have considered the solution of second order initial value problems (IVPs) and the adoption of block methods of order eight has been seen to be widely applied. However, these previously developed block methods have considered non-hybrid grid points. Hence, this article presents a new hybrid block method of order eight for solving second order IVPs with an improved level of accuracy when compared to previously existing order eight block methods in terms of error. The methodology employed involves a new generalized algorithm for developing the hybrid block method which is another novel contribution existing in this work. Hence, not only this article presents a new block method that can be adopted when solving real life problems modelled as second order IVPs, it also gives a more convenient algorithm for developing hybrid block methods.

We have defined weight of the pair $(\langle S \mid R \rangle, R)$ for a given presentation $\langle S \mid R \rangle$ of a group, where the number of generators is equal to the number of relations. We present an algorithm to construct crystallizations of 3-manifolds whose fundamental group has a presentation with two generators and two relations. If the weight of $(\langle S \mid R \rangle, R)$ is $n$ then our algorithm constructs all the $n$-vertex crystallizations which yield $(\langle S \mid R \rangle, R)$. As an application, we have constructed some new crystallizations of 3-manifolds. We have generalized our algorithm for presentations with three generators and certain class of relations. For $m\geq 3$ and $m \geq n \geq k \geq 2$, our generalized algorithm gives a $2(2m+2n+2k-6+\delta_n^2 + \delta_k^2)$-vertex crystallization of the closed connected orientable $3$-manifold $M\langle m,n,k \rangle$ having fundamental group $\langle x_1,x_2,x_3 \mid x_1^m=x_2^n=x_3^k=x_1x_2x_3 \rangle$. These crystallizations are minimal and unique with respect to the given presentations. If `$n=2$' or `$k\geq 3$ and $m \geq 4$' then our crystallization of $M\langle m,n,k \rangle$ is vertex-minimal for all the known cases., Comment: 24 pages, 8 figures