Алгоритм определения наличия аварийного электрического разряда в сетях электропитания
Issue of identification emergency electrical discharge for electrical network is studied. Structure chart of detector is shown. Algorithm of DSP module is offered. Timing diagram of identification process and realization example of algorithm in Matlab is given
The 11th International Conference on Security and its Applications (CNSA 2018) was held in Zurich, Switzerland, during January 02~03, 2018. The 5th International Conference on Data Mining and Database (DMDB 2018) and The 5th International Conference on Artificial Intelligence and Applications (AIAP 2018) was collocated with The 11th International Conference on Security and its Applications (CNSA 2018). The conferences attracted many local and international delegates, presenting a balanced mixture of intellect from the East and from the West. The goal of this conference series is to bring together researchers and practitioners from academia and industry to focus on understanding computer science and information technology and to establish new collaborations in these areas. Authors are invited to contribute to the conference by submitting articles that illustrate research results, projects, survey work and industrial experiences describing significant advances in all areas of computer science and information technology.
This article presents a method of the automated control of distributed radio direction finding system (RDFS) providing the construction of an automated system of technical diagnostics and recovery of distributed RDFS performance on the specified requirements. This dual-circuit method includes diagnosing and reliability operations, redundancy recommendations, and also control algorithms of the constituent elements of the system. The structure and mathematical apparatus of the operations, recommendations, and algorithms of the proposed method are shown. The basic requirements and restrictions under which the construction of automated technical diagnosis system is carried out are specified.
Issue of identification emergency electrical discharge is studied. Circuit of identification and formulas is offered. Timing diagram of identification process is shown. Example circuit realized in Matlab is presented.
The existing device repacking data streams and options for their implementation as application specific integrated circuits, so on the FPGA is studied. Revealed their limitations and shortcomings of the synchronization of the data flow transformation. A device universal repacking data streams is offered. The function chart and timing diagrams of his work is shown.
This paper is devoted to modern approaches to development of new positioning algorithms which will guarantee the achievement of the minimum mean square error and do not create excessive computing load. The algorithm performing the search of global extremum in problems of source position estimation using one-step methods based on a likelihood function for two types of passive radar systems was proposed. The first system is a passive radar system consisting of narrow-base subsystems; the second system is the combined passive radar system which includes several narrow-base subsystems together with a wide-base passive radar system.
According to results of computer simulation, the analysis of the frequency of appearing abnormal errors and relative time spent on calculations was made. The comparison performed using the proposed algorithm with an adaptive step and a universal method of global extremum searching, that is “particle swarm”, showed that the developed algorithm requires up to 20 times less computational costs and vanishes abnormal errors.
Provides an overview of the different ways to implement the high-speed I/O data to the PC using FPGA based on the use of commercially available modules. The possibility of developing a specialized unit that provides the present-simplification of the equipment.
In this paper, E pulse target discrimination method which uses the time-domain target response to a wideband incident waveform is discussed. Based upon the resonant model of the transient behavior of conducting targets obtained and formularized via the singularity-expansion method (SEM), the E pulse method allows developing the computationally efficient technique for discrimination of radar targets. The E pulse is defined as a finite duration waveform, which annihilates a preselected number of the natural resonances of a particular target. Mathematically, this means the convolution product of the target response and the E pulse matched to the target will vanish in late-time part. The E pulse can be analytically represented as a weighted sum of convenient basis functions. The most useful basis set, due to its great simplicity, is one that is composed of subsectional polynomial pulse functions. Finding the coefficients of polynomials to obtain functions that determine the waveform of E pulse over each of the sections could be ob-tained by solving large-scale system of linear equations with elements evaluated sophisticatedly. In practice, there emerges a chain of difficulties associated with this problem, for example, an ill-conditioned matrix case. The purpose of this work is to introduce an alterna-tive synthesis algorithm of polynomial based E pulses. This multistep algorithm proposes producing an E pulse consisting of delta-functions at the first step, and then, a series of step-by-step cross convolutions up to the desired polynomial degree. Not only does this solution not imply solving any equations but it also requires a great deal few operations than standard equation solving procedure. In addition, the discrimination scheme assembled for this method was investigated. The E pulse technique performance was confirmed by numerical simulation using natural resonances of two aircraft scale models: Boeing 707 (B-707) and McDonnel Douglas F-18.
Proceedings of 2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Generalized error-locating codes are discussed. An algorithm for calculation of the upper bound of the probability of erroneous decoding for known code parameters and the input error probability is given. Based on this algorithm, an algorithm for selection of the code parameters for a specified design and input and output error probabilities is constructed. The lower bound of the probability of erroneous decoding is given. Examples of the dependence of the probability of erroneous decoding on the input error probability are given and the behavior of the obtained curves is explained.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov , we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables