A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-spacewavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.
This paper presents the current stage of the development of EA-MOSGWA – a tool for identifying causal genes in Genome Wide Association Studies (GWAS). The main goal of GWAS is to identify chromosomal regions which are associated with a particular disease (e.g. diabetes, cancer) or with some quantitative trait (e.g height or blood pressure). To this end hundreds of thousands of Single Nucleotide Polymorphisms (SNP) are genotyped. One is then interested to identify as many SNPs as possible which are associated with the trait in question, while at the same time minimizing the number of false detections.
The software package MOSGWA allows to detect SNPs via variable selection using the criterion mBIC2, a modified version of the Schwarz Bayesian Information Criterion. MOSGWA tries to minimize mBIC2 using some stepwise selection methods, whereas EA-MOSGWA applies some advanced evolutionary algorithms to achieve the same goal. We present results from an extensive simulation study where we compare the performance of EA-MOSGWA when using different parameter settings. We also consider using a clustering procedure to relax the multiple testing correction in mBIC2. Finally we compare results from EA-MOSGWA with the original stepwise search from MOSGWA, and show that the newly proposed algorithm has good properties in terms of minimizing the mBIC2 criterion, as well as in minimizing the misclassification rate of detected SNPs.
The problem of reconstructing an unknown disturbance under measuring a part of phase coordinates of a system of linear differential equations is considered. Solving algorithm is designed. The algorithm is based on the combination of ideas from the theory of dynamical inversion and the theory of guaranteed control. The algorithm consists of two blocks: the block of dynamical reconstruction of unmeasured coordinates and the block of dynamical reconstruction of an input.
Today’s human-computer interaction systems have a broad variety of applications in which automatic human emotion recognition is of great interest. Literature contains many different, more or less successful forms of these systems. This work emerged as an attempt to clarify which speech features are the most informative, which classification structure is the most convenient for this type of tasks, and the degree to which the results are influenced by database size, quality and cultural characteristic of a language. The research is presented as the case study on Slavic languages.
The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over Fpn, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields Fp; Fp2 ; Fp4 ; Fp6 and Fp8 , for primes p used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.
The frictional resistance coefficient of ventilation of a roadway in a coal mine is a very important technical parameter in the design and renovation of mine ventilation. Calculations based on empirical formulae and field tests to calculate the resistance coefficient have limitations. An inversion method to calculate the mine ventilation resistance coefficient by using a few representative data of air flows and node pressures is proposed in this study. The mathematical model of the inversion method is developed based on the principle of least squares. The measured pressure and the calculated pressure deviation along with the measured flow and the calculated flow deviation are considered while defining the objective function, which also includes the node pressure, the air flow, and the ventilation resistance coefficient range constraints. The ventilation resistance coefficient inversion problem was converted to a nonlinear optimisation problem through the development of the model. A genetic algorithm (GA) was adopted to solve the ventilation resistance coefficient inversion problem. The GA was improved to enhance the global and the local search abilities of the algorithm for the ventilation resistance coefficient inversion problem.
As the delivery of good quality software in time is a very important part of the software development process, it's a very important task to organize this process very accurately. For this, a new method of the searching associative rules were proposed. It is based on the classification of all tasks on three different groups, depending on their difficulty, and after this, searching associative rules among them, which will help to define the time necessary to perform a specific task by the specific developer.
We present a novel quantum algorithm for the classification of images. The algorithm is constructed using principal component analysis and von Neuman quantum measurements. In order to apply the algorithm we present a new quantum representation of grayscale images.