Fourier Transformation method for solving integral equation in the 2.5D problem of electric sounding

The paper discusses a method for solving an integral equation for calculating a three-dimensional electric field in a medium with a two-dimensional geometry based on the Fourier transform. The results of the numerical solution of the transformed integral equation and the original integral equation for the medium with the surface relief are compared. The original equation was solved using parallelization technologies on a system with shared memory. A significant performance improvement based on the transformed equations, including in comparison with the parallel version of the program for the original integral equation, is shown.

Hadoop solution for large data protection

Investigated one of large data problems of - providing protection in the process of accumulation and processing. The case of application of Hadoop technology and its latest modification Apache Hadoop 3.3.0 is considered. A solution is proposed with strengthening the protection of processed data, connecting the Apache Knox Gateway, Apache Ranger and Apache Atlas tools. The possibil-ity of using data obtained as a result of the work of local databases, electronic archives, database management systems and individual users is provided. The solution also features the use of a pri-vate cloud and cryptographic algorithms. An example of the implementation of a secure solution to the problem of Intelligent Data Analysis is given on the example of a parallel version of the problem of finding association rules when working with unstructured data of large volumes.

Optimal Location and Sizing of DGs in DC Networks Using a Hybrid Methodology Based on the PPBIL Algorithm and the VSA

In this paper, we propose a master–slave methodology to address the problem of optimal integration (location and sizing) of Distributed Generators (DGs) in Direct Current (DC) networks. This proposed methodology employs a parallel version of the Population-Based Incremental Learning (PPBIL) optimization method in the master stage to solve the location problem and the Vortex Search Algorithm (VSA) in the slave stage to solve the sizing problem. In addition, it uses the reduction of power losses as the objective function, considering all the constraints associated with the technical conditions specific to DGs and DC networks. To validate its effectiveness and robustness, we use as comparison methods, different solution methodologies that have been reported in the specialized literature, as well as two test systems (the 21 and 69-bus test systems). All simulations were performed in MATLAB. According to the results, the proposed hybrid (PPBIL–VSA) methodology provides the best trade-off between quality of the solution and processing times and exhibits an adequate repeatability every time it is executed.

OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval

Given a mathematical expression in LaTeX or MathML format, retrieval algorithm extracts similar expressions from a database. In our previous work, we have used Longest Common Subsequence (LCS) algorithm to match two expressions of lengths, [Formula: see text] and [Formula: see text], which takes [Formula: see text] time complexity. If there are [Formula: see text] database expressions, total complexity is [Formula: see text], and an increase in [Formula: see text] also increases this complexity. In the present work, we propose to use parallel LCS algorithm in our retrieval process. Parallel LCS has [Formula: see text] time complexity with [Formula: see text] processors and total complexity can be reduced to [Formula: see text]. For our experimentation, OpenMP based implementation has been used on Intel [Formula: see text] processor with 4 cores. However, for smaller expressions, parallel version takes more time as the implementation overhead dominates the algorithmic improvement. As such, we have proposed to use parallel version, selectively, only on larger expressions, in our retrieval algorithm to achieve better performance. We have compared the sequential and parallel versions of our ME retrieval algorithm, and the performance results have been reported on a database of 829 mathematical expressions.

Extremely High-Throughput Parallel Microfluidic Vortex-Actuated Cell Sorting

We demonstrate extremely high-throughput microfluidic cell sorting by making a parallel version of the vortex-actuated cell sorter (VACS). The set-up includes a parallel microfluidic sorter chip and parallel cytometry instrumentation: optics, electronics and control software. The result is capable of sorting lymphocyte-sized particles at 16 times the rate of our single-stream VACS devices, and approximately 10 times the rate of commercial cell sorters for an equivalent procedure. We believe this opens the potential to scale cell sorting for applications requiring the processing of much greater cell numbers than currently possible with conventional cell sorting.

Exploiting Soft Constraints within Decomposition and Coordination Methods for Sub-hourly Unit Commitment

Unit commitment (UC) is an important problem solved on a daily basis within a strict time limit. While hourly UC problems are currently considered, they may not be flexible enough with the fast-changing demand and the increased penetration of intermittent renewables. Sub-hourly UC is therefore recommended. This, however, will significantly increase problem complexity even under the deterministic setting, and current methods may not be able to obtain good solutions within the time limit. In this paper, deterministic sub-hourly UC is considered, with the innovative exploitation of soft constraints – constraints that do not need to be strictly satisfied, but with predetermined penalty coefficients for their violations. The key idea is the “surrogate optimization” concept that ensures multiplier convergence within “surrogate” Lagrangian relaxation as long as the “surrogate optimality condition” is satisfied without the need to optimally solve the “relaxed problem.” Consequently, subproblems can still be formed and optimized when soft constraints are not relaxed, leading to a drastically reduced number of multipliers and improved performance. To further enhance the method, a parallel version is developed. Testing results on the Polish system demonstrate the effectiveness and robustness of both the sequential and parallel versions at finding high-quality solutions within the time limit.