Occurrence Of Random Events Research Articles

Quantum-inspired Attribute Selection Algorithms

Abstract In this study, we propose the use of quantum information gain and fidelity as quantum splitting criteria to construct an efficient and balanced quantum decision tree. Quantum information gain is a circuit-based criterion in which angle embedding is used to construct a quantum state, which utilizes quantum mutual information to compute the information between a feature and the class attribute. For the fidelity-based criterion, we construct a quantum state using the occurrence of random events in a feature and its corresponding class. We use the constructed state to further compute fidelity for determining the splitting attribute among all features. Using numerical analysis, our results clearly demonstrate that the fidelity-based criterion ensures the construction of a balanced tree. We further compare the efficiency of our quantum information gain and fidelity-based quantum splitting criteria with different classical splitting criteria on balanced and imbalanced datasets. Our analysis shows that the quantum splitting criteria lead to quantum advantage in comparison to classical splitting criteria for different evaluation metrics.

Research OF Complex Processes Based on Step-By-Step Modeling

Purpose. When solving practical problems that require the creation and further analysis of the model, an important criterion is the labour intensity of modeling. In this regard, the article is aimed at formalizing the modeling process and using the method of step-by-step modeling for the design of technological processes. This approach allows you to design processes and tasks according to the following stages: physical modeling, mathematical modeling, discrete computer modeling and simulation. Methodology. To solve the problem, a methodology of step-by-step modeling is used. The simulation involves 3 stages and uses the decomposition algorithm, i. e. considers the problem from global to detailed. At the first stage of this implementation, the necessary information is collected for the experiment. This information is presented in the form of statistics. In the second stage, further processing takes place, which is performed by checking the compliance of the input data and the process with the question of how this process should be performed. The last stage is the simulation of passages of this fragment, which is represented by a chain of transitions, obtaining statistics of time efficiency of this process, weaknesses of the process and the ability to compare the results obtained during modeling and in the real process, as well as the ability to predict future results and actions. Findings. The technique can be used to study complex technological processes in the enterprise. It allows modeling of complex processes to obtain information about the time efficiency of the technological operation, finding weaknesses in it and patterns in the occurrence of random events that may affect the operation. Using this approach can be very effective in the systems that require constant real-time monitoring, as this tool can be modified by adding sensor kits that will constantly send information to the system or equip an additional system that will provide ready-made information packets. Originality. The method of step-by-step modeling of representation has been improved, which consists in the simultaneous use of physical, mathematical and simulation modeling of complex processes with a set of stages of their implementation. Practical value. The proposed technique is designed for step-by-step modeling of the technological process with the subsequent construction of simulation programming.

A Prevention Fund in Insurance Activity

The article presents specific features of the prevention fund, discusses both an accounting and a tax approach to the treatment of expenditure on prevention, as well as examines the importance of marketing activities in insurance prevention and indicates various similarities and differences. The activities financed from the prevention fund can also play an important role in shaping the price of a product, thereby influencing the overall technical result. A certain preventive action included in the product price may become a part of an insurance offer. A possible marketing aspect of using the prevention fund is only an indirect consequence of expenditure from the fund, incurred by the insurance company in accordance with its statutory purpose. In addition to that, the authors discuss the possibility of transferring the fund's resources to policyholders so that they can meet preventive objectives in the light of Article 18 (1) of the Insurance and Reinsurance Activity Act, according to which in the case of insurance for someone else's account, the policyholder receives neither remuneration nor other benefits in connection with offering insurance protection nor activities related to the performance of an insurance contract. Prevention activities are targeted at insurers’ customers directly or indirectly and may be of a more universal nature, with their beneficiaries being other members of society (e.g. the purchase of a fire truck may bring a benefit to other insured in the future). A specified action financed from the prevention fund may cover only the customers of an insurer in question (e.g. subsidizing preventive examinations of its customers) provided that the basic principles are met and the participation in it does not depend on the conclusion of a contract with the insurer. Therefore, as long as the prevention fund is used in a manner serving directly the purpose of reducing the risk of occurrence of random events as well as their consequences, it ought to be assumed that the benefit obtained by a specified group of customers should not be qualified as a marketing activity.

AROUND THE SIERPINSKI TRIANGLE. THE CHAOS GAME AND THE SCRATCH PROGRAMMING

The article discusses the experience of studying Sierpinski geometric fractals in circle classes in mathematics and informatics with students of grades 4–6. A versatile approach to the construction of fractal objects is used: a method of cutting out of paper, Chaos Game on transparent films and implementing the studied algorithm in the Scratch programming language. At the same time, some issues related to the occurrence of random events are discussed with the children. After the fractal is obtained on a computer, the research phase of the constructed model follows. In the computer Chaos Game: (1) a small rotation by a specified number of degrees is sequentially added before setting the next point; (2) a turn in front of individual fractal vertices; (3) compression of a fractal to individual vertices. Conclusions are drawn about the self-similarity of the resulting objects. The proposed method allows us to study some properties of fractal sets, by involving visualization, intuition and computer modeling.

Clustering-based heterogeneous optimized-HEED protocols for WSNs

Clustering-based networks play a vital role in efficient utilization of energy consumption of each sensor node (SN) in wireless sensor networks (WSNs). Furthermore, firstly, prolonged network’s lifetime is observed as the key factor to analyze the protocol’s efficiency. However, in critical applications, i.e., military surveillance, environmental monitoring and structural health monitoring, stability region is also an important aspect for consideration. This provides reliability of data from each SN in the network. On the other hand, once a SN dies at any region, we are not able to sense that region which leaves the region vulnerable from detection of events. With this reason, it is highly important for an energy efficient protocol to provide good stability region with prolonged network lifetime. Secondly, a protocol should be intelligent enough to handle homogeneous as well as heterogeneous nodes efficiently in the network (i.e., homogeneous and heterogeneous WSNs) because once the network executes, a homogeneous WSN is also transformed in heterogeneous WSN. This is because of different radio communication features, occurrence of random events or morphological attributes of the network field. optimized-HEED protocols are one of the most recent clustering-based algorithms which improved the various shortcomings of classical protocol, i.e., HEED and provided far efficient results in terms of energy consumption, load balancing and network lifetime. However, these demonstrated their efficiency for homogeneous WSN only. In this paper, we extend the optimized-HEED protocols for heterogeneous WSNs model on the basis of varying levels of node heterogeneity (in terms of energy), i.e., 1-level, 2-level, 3-level and multi-level, and propose these as heterogeneous optimized-HEED (Hetero-OHEED) protocols. Simulation results confirm that by increasing the level of node’s heterogeneity, stability region of each Hetero-OHEED protocol enhances extremely with prolonged network lifetime. These provide a rich solution in designing of efficient protocols for those applications, where stability region and network lifetime require equal importance.

Brazilian network of PhDs working with probability and statistics

Statistical and probabilistic reasoning enlightens our judgments about uncertainty and the chance or beliefs on the occurrence of random events in everyday life. Therefore, there are scientists working with Probability and Statistics in various fields of knowledge, what favors the formation of scientific network collaborations of researchers with different backgrounds. Here, we propose to describe the Brazilian PhDs who work with probability and statistics. In particular, we analyze national and states collaboration networks of such researchers by calculating different metrics. We show that there is a greater concentration of nodes in and around the cites which host Probability and Statistics graduate programs. Moreover, the states that host P&S Doctoral programs are the most central. We also observe a disparity in the size of the states networks. The clustering coefficient of the national network suggests that this network and regional differences especially with respect to states from South-east and North is not cohesive and, probably, it is in a maturing stage.

Modeling the Energy Consumption of Upload Patterns on Smartphones and IoT Devices

In this letter, we provide the probabilistic analysis of the energy consumed by installed mobile apps when uploading data to the cloud based on the occurrence of random events during a given time interval. A polynomial algorithm to calculate the probability distribution of the energy they consume is obtained here. The validity of our approach is corroborated with a bound and simulation analysis, resorting to the use of real-world data.

Balancing stochastic parallel assembly lines

In industrial systems, efficient design of production units is important for productivity. An assembly line is a special type of industrial systems, and it has been widely used in various manufacturing industries. One possible way to achieve high efficiency in an assembly line design is to use two or more assembly lines, referred to as parallel assembly lines. Additionally, the occurrence of random events in industrial systems is inevitable. Among these random events that disturb the production process are operator unavailability, technical failures in the production line, loss of motivation, lack of training, non-qualified operators, complex tasks, etc. So, it is more realistic to consider industrial systems as stochastic context rather than deterministic one. For this purpose, in this paper, the problem of balancing parallel assembly lines with stochastic task times (SPALBP) is introduced and characterised for the first time. A chance-constrained, piecewise-linear, mixed integer programming (CPMIP) formulation and a tabu search (TS) algorithm are proposed to model and to solve the SPALBP. The objective of CPMIP and TS algorithm is minimizing the number of stations for a given cycle time. A simple lower bound calculation on the number of stations for SPALBP is proposed, and an example problem is solved using the proposed CPMIP. A set of test problems taken from the literature is solved in order to test the proposed TS algorithm, and some computational properties of the proposed solution methodologies are given. The computational results show that the proposed algorithm is very effective and successful for the SPALBP.

Simulation of random events for adaptive control systems calibration

The paper deals with a mathematical model that simulates the random occurrence of events during cutting processes by milling. The evolution of certain parameters that typify the cutting processes depends on predictable and non-predictable variables. In this context, either the material hardness that varies in different sides of billet, or cutting depth, can act as non-predictable variables. In order to design a response in terms of cutting parameters to non-predictable variations of inputs, a simulation of such phenomena is very useful. A mathematical model that generates random events, both in terms of non-uniform frequency and intensity is here described. A virtual instrument built in LabVIEW generates (pseudo) random events based on a combination of random numbers, as the evolution of the simulated process to be much like a real one. Furthermore the user of virtual instrument can generate himself events at certain moments and of certain intensity. This can be a useful tool to study the algorithms of designing the response which should re-balance the process within adaptive control systems.

Approximate determination of the distribution of entropy

Contrary to the popular in the technical literature quantitative representation of entropy as a measure of the uncertainty of the occurrence of random events, its estimation is proposed based on the density and probability distribution functions. Constructing them using approximation methods is shown. At the core of the construction, the method of moments is used. In applied terms, two problems for the research of the transfer properties of a device with a constant and random coefficient of transmission are solved.

Interval distribution function of a bounded chaotic sequence as a basis of nonaxiomatic probability theory

We introduce the notion of interval distribution function of random events on the set of elementary events and the notion of interval function of the frequencies of these events. In the limiting case, the interval function turns into the ordinary distribution function and the interval function of frequencies (under certain conditions) turns into the density of distribution of random events. The case of discrete sets of elementary events is also covered. This enables one to introduce the notion of the probability of occurrence of random events as a result of the limit transition.

Expression of Alleles of the Mdh1Locus in Apozygotic Progenies of Sugar Beet Beta vulgarisL.

Expression of Mdh1alleles has been studied in 60 apozygotic (agamospermic) sugar beet progenies. Seed progenies were obtained by uniparental (pollenless) mode of seed reproduction: selfing of pollen-sterile plants isolated with paper bags. The apozygotic seed progenies demonstrate a disomic gamete autosegregation, i.e., the ratio between genotypes in the progenies correspond to the gamete segregation in a duplex heterozygote of an autotetraploid. It was shown that the ratio between theMdh1phenotypes in apozygotic progenies is strongly affected by spontaneous inactivation of one of the alleles. In most progenies, the excess of FF phenotypes and the deficit of SS phenotypes were observed. In our opinion, such deviations in genotype and phenotype frequencies result from conversion of the active Mdh1-Sinto the inactive Mdh1-S0allele (epigenetic gene inactivation). The spontaneous inactivation of one allele results in extremely variable frequencies of heterozygous Mdh1-F/Mdh1-Sgenotypes and phenotypes in the apozygotic seed progenies. The empirical distribution of the frequencies of heterozygous genotypes in the apozygotic seed progenies is given by a negative binomial distribution describing the expected time of occurrence of random events.

A New Empirical Test for the Quality of Random Integer Generators

In a number of applications, it is necessary to generate stimnuli: to generate random patterns when random testing of logic faults is employed, and to generate the random occurrence of events when simulation is used, to mention two. In this paper, we show a quick empirical test, which is based on a data compression method, to analyze the pseudorandom integers generated by certain types of random integer generators and to determine whether the approximation to a true random process is good.

Rapid methods for ascertaining whether the activity of a weak radioactive sample exceeds a predetermined level

The paper considers methods of determining whether the mean rate of occurrence of random events, such as radioactive disintegrations, is greater or less than some given tolerance rate. The most efficient method is one which makes this determination in the shortest time and with an acceptably low probability of error. Sequential test procedures minimize the sample size by observing the random process until some terminating condition is satisfied. The performance of several sequential tests is investigated, with particular reference to conditions encountered in monitoring radioactive contamination on the hands. The most efficient of these tests is shown to be one which measures the difference between the number of events actually observed and the number expected at the tolerance rate. Under conditions likely to be encountered in routine monitoring for radioactivity on the hands this method gives a fivefold saving in time over the method now in use.