Similar Journals
|
Programming and Computer Software
Journal Prestige (SJR): 0.224  Citation Impact (citeScore): 1 Number of Followers: 16  Hybrid journal (It can contain Open Access articles)ISSN (Print) 1608-3261 - ISSN (Online) 0361-7688 Published by Springer-Verlag  [2468 journals]
|
- Secure Messaging Application Development: Based on Post-Quantum Algorithms
CSIDH, Falcon, and AES Symmetric Key Cryptosystem-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: In this paper, the authors present a technique for developing a secure messaging service called “CryptoMess” which utilizes the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) algorithm for secure key exchange and the Advanced Encryption Standard (AES) to protect message content in communication. In addition, the authors have incorporated the Falcon post-quantum digital signature technology to ensure the integrity and authenticity of communications between the sender and the recipient. The novel post-quantum cryptographic algorithms utilized by the authors are still under consideration in the competition to select cryptosystems for use in quantum computing systems organized by the NIST Standards Institute. As a result, the messaging program “CryptoMess” is able to exchange messages between users, providing safety, security, integrity, and authenticity. The authors have included modern post-quantum cryptography techniques, such as the Falcon digital signature system, to guarantee that the product operates safely. The program has a transmitting rate of approximately 209–261 ms and a receiving rate of approximately 168–206 ms. The message signing time is about 260 ms, and the message verification speed is approximately 185 ms. Key generation time is about 741 ms, key encapsulation time is about 1.454 ms, and key decapsulation time is about 1.921 ms. The source code of the “CryptoMess” communications program has been analyzed and tested by the authors using the Fortify Static Code Analyzer tool to ensure that the product has been created safely and securely.
PubDate: 2024-08-01
-
- Constructing the Internal Voronoi Diagram of Polygonal Figure Using the
Sweepline Method-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: The problem of constructing the internal Voronoi diagram of a polygonal figure—a polygon with polygonal holes—is considered. A method based on the plane sweep paradigm is proposed. Direct construction of only the internal part of the Voronoi diagram allows us to reduce the amount of computations and increase robustness compared to known solutions. Another factor in reducing the computational complexity is the use of the property of pairwise incidence of linear segments formed by the sides of the polygonal figure. To take these features into account, it is proposed to build a data structure called sweep line status in the form of an ordered set of sites’ areas of responsibility. This structure is implemented as a combination of a balanced tree and a bidirectional list. Computational experiments illustrate the numerical reliability and efficiency of the proposed method.
PubDate: 2024-08-01
-
- Analytical Review of Confidential Artificial Intelligence: Methods and
Algorithms for Deployment in Cloud Computing-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: The technologies of artificial intelligence and cloud computing systems have recently been actively developed and implemented. In this regard, the issue of their joint use, which has been topical for several years, has become more acute. The problem of data privacy preservation in cloud computing acquired the status of critical long before the necessity of their joint use with artificial intelligence, which made it even more complicated. This paper presents an overview of both the artificial intelligence and cloud computing techniques themselves, as well as methods to ensure data privacy. The review considers methods that utilize differentiated privacy; secret sharing schemes; homomorphic encryption; and hybrid methods. The conducted research has shown that each considered method has its pros and cons outlined in the paper, but there is no universal solution. It was found that theoretical models of hybrid methods based on secret sharing schemes and fully homomorphic encryption can significantly improve the confidentiality of data processing using artificial intelligence.
PubDate: 2024-08-01
-
- RuGECToR: Rule-Based Neural Network Model for Russian Language Grammatical
Error Correction-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Grammatical error correction is one of the core natural language processing tasks. Presently, the open-source state-of-the-art sequence tagging for English is the GECToR model. For Russian, this problem does not have equally effective solutions due to the lack of annotated datasets, which motivated the current research. In this paper, we describe the process of creating a synthetic dataset and training the model on it. The GECToR architecture is adapted for the Russian language, and it is called RuGECToR. This architecture is chosen because, unlike the sequence-to-sequence approach, it is easy to interpret and does not require a lot of training data. The aim is to train the model in such a way that it generalizes the morphological properties of the language rather than adapts to a specific training sample. The presented model achieves the quality of 82.5 in the metric \({{{\mathbf{F}}}_{{{\mathbf{0}}{\mathbf{.5}}}}}\) on synthetic data and 22.2 on the RULEC dataset, which was not used at the training stage.
PubDate: 2024-08-01
-
- Comparative Efficiency Analysis of Hashing Algorithms for Use in zk-SNARK
Circuits in Distributed Ledgers-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: This paper presents a comparative efficiency analysis of hashing algorithms from a perspective of their use in systems based on the zero-knowledge succinct non-interactive argument of knowledge (zk-SNARK). Hash functions sha256, sha3, poseidon, mimc, and blake2, most commonly used in modern distributed ledgers, are considered. For parameter measurement experiments, an infrastructure using the ZoKrates toolbox is developed. Based on experimental data, the limits of practical applicability of the algorithms to the problem of proving knowledge of a hash preimage with zk-SNARK circuits in distributed ledgers are determined, and related efficiency problems are considered.
PubDate: 2024-08-01
-
- Joint Super-resolution and Tissue Patch Classification for Whole Slide
Histological Images-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Segmentation of whole slide histological images through the classification of tissue types of small fragments is an extremely relevant task in digital pathology, necessary for the development of methods for automatic analysis of whole slide histological images. The extremely large resolution of such images also makes the task of increasing image resolution relevant, which allows storing images at a reduced resolution and increasing it if necessary. Annotating whole slide images by histologists is complex and time-consuming, so it is important to make the most efficient use of the available data, both labeled and unlabeled. In this paper we propose a novel neural network method to simultaneously solve the problems of super-resolution of histological images from ×20 optical magnification to ×40 and classifying image fragments into tissue types at ×20 magnification. The use of a single encoder as well as the proposed neural network training scheme allows to achieve better results on both tasks compared to existing approaches. The PATH-DT-MSU WSS2v2 dataset presented for the first time in this paper was used for training and testing the method. On the test sample, an accuracy value of 0.971 and a balanced accuracy value of 0.916 were achieved in the classification task on 5 tissue types, for the super-resolution task, values of PSNR = 32.26 and SSIM = 0.89 were achieved. The source code of the proposed method is available at: https://github.com/Kukty/WSI_SR_CL.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700063
-
- Neural Network Method for Detecting Blur in Histological Images
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: In this paper we consider the problem of detecting blurred regions in high-resolution whole slide histologic images. The proposed method is based on the use of a Fourier neural operator trained on the results of two simultaneously used approaches: blur detection using multiscale analysis of the discrete cosine transform coefficients and estimation of the degree of sharpness of objects edges in the image. The efficiency of the algorithm is confirmed on images from the datasets PATH-DT-MSU [1] and FocusPath [2].
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700026
-
- Influence of Unequilateral Apertures of Digital Filters Laplacian
“Trunced Pyramid” and “Double Pyramid” on the Accuracy of
Television Measuring Systems-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: In the modern world, digital image processing requires increasing the speed of the processing methods and algorithms used. One way to improve performance is to transform spatial filters into filters with a recursively separable form of implementation. The recursion property implies the use of previous output values of a function to form the current sample. The property of separability is understood as division into processing by column and row of a matrix of digital image values. The transformation of spatial filters consists of changing the aperture of the masks into a non-orthogonal (non-equilateral) form, which reduces the number of computational operations and speeds up the processing process, while maintaining its efficiency. The paper presents a description of the non-equilateral apertures of the previously developed Laplacian digital filters “truncated pyramid” and “double pyramid.” For non-equilateral apertures, results were obtained for the first time on their use for television measuring systems. From which it can be seen that a “truncated pyramid” Laplacian filter with non-equilateral processing apertures is recommended for use in TIS, since it increases the efficiency of measuring the range to objects of interest while reducing processing time. Based on the results of processing with modified filters, sets of processed images were obtained for each of the 10 original images. For each set of processed images, measurements of the peak signal-to-noise ratio, standard deviation and selection of the optimal central coefficient of the filter mask were carried out, for subsequent assessment of the effectiveness of processing with modified filters. The assessment of the influence of recursively separable Laplacian filters “truncated pyramid” and “double pyramid” with non-equilateral aperture masks on the accuracy of television measurement systems consisted of considering their influence on measuring the distance (from the camera) to the object of interest in the image, when - control of processing time. Based on the evaluation results, we can conclude that by using pre-processing of images with modified digital filters, the accuracy of measuring the distance from the camera to the measurement object is improved, while reducing processing time.
PubDate: 2024-06-01
DOI: 10.1134/S036176882470004X
-
- A Method to Order Point Clouds for Visualization on the Ray Tracing
Pipeline-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Currently, the digitization of environment objects (vegetation, terrain, architectural structures, etc.) in the form of point clouds is actively being developed. The integration of such digitized objects into virtual environment systems allows the quality of the modeled environment to be improved, but requires efficient methods and algorithms for real-time visualization of large point volumes. In this paper the solution of this task on modern multicore GPUs with support of hardware-accelerated ray tracing is researched. A modified method is proposed where the original unordered point cloud is split up into point groups whose visualization is effectively parallelized on ray tracing cores. The paper describes an algorithm for constructing such groups using swapping arrays of point indices, which works faster than alternative solutions based on linked lists, and also has lower memory overhead. The proposed method and algorithm were implemented in point cloud visualization software complex and approbated on a number of digitized environment objects. The results of the approbation confirmed the efficiency of proposed solutions as well as their applicability for virtual environment systems, video simulators, geoinformation systems, virtual laboratories, etc.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700075
-
- Automatic Image Style Transfer using an Augmented Style Set
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Image style transfer is an applied task for automatic rendering of the original image (content) in the style of another image (specifying the target style). Traditional image stylization methods provide only a single stylization result. If the user is not satisfied with it due to stylization artifacts, he has to choose a different style. The work proposes a modified stylization algorithm, giving a variety of stylization results, and, as user review shows, achieves improved stylization quality by using additional style information from similar styles.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700038
-
- Dual Representation of Geometry for Ray Tracing Acceleration in Optical
Systems with Freeform Surfaces-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: This paper explores the possibility of using dual representation of geometry to speed up ray tracing and ensure robustness of light propagation simulation in complex optical systems with freeform surfaces defined by high-degree polynomials (up to order 34) or Jacobi polynomials. Traditional methods for representing this geometry both as a triangular mesh and as an analytical expression are analyzed. The analysis demonstrates the disadvantages of the traditional approaches due to the insufficient accuracy of calculating coordinates of the point at which the ray intersects the triangular mesh, as well as the non-robustness of the conventional procedures for finding the point of intersection between the tangent ray and the analytical surface. Thus, it is proposed to use a dual representation of geometry as a rough approximation of the surface by a triangular mesh, which is subsequently used as an initial approximation to find the point at which the ray intersects the surface defined by an analytical expression. This approach significantly speeds up convergence of the analytical methods and improves robustness of their solutions. The use of the Intel® Embree library to quickly find the point of intersection between the ray and the rough triangular mesh, as well as a vector model to refine the coordinates of the point of intersection between the ray and the analytically represented geometry, allows us to develop and implement a ray tracing algorithm for an optical system that has surfaces with dual representation of geometry. Experiments carried out using the developed algorithm show a significant speedup of ray tracing while preserving computational accuracy and high robustness of the results. The results are demonstrated by evaluating the point spread function and glare for two lenses with freeform surfaces defined by Jacobi polynomials. In addition, for these two lenses, an image formed by an RGB-D object that simulates a real scene is calculated.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700087
-
- Conversion of Point Cloud Data to 3D Models Using PointNet++ and
Transformer-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: This paper presents an approach to 3D model reconstruction from point cloud data using modern neural network architectures. The method is based on PointNet++ and Transformer. PointNet++ plays a key role, providing efficient feature extraction and encoding of complex geometries in 3D scenes. This is achieved by recursively applying PointNet++ to nested partitions of the input point set in a metric space. Convex decomposition, which is an important step in the proposed approach, transforms complex 3D objects into sets of simpler convex shapes. This facilitates data processing and makes the reconstruction process more manageable. Then, Transformer trains the model on the extracted features, which enables the generation of high-quality reconstructions. It should be noted that Transformer is used only to determine positions of the walls and detect object boundaries. This combination of technologies allows us to achieve high accuracy of 3D model reconstruction. The main idea of the method is to segment the point cloud into small fragments, which are then reconstructed as polygon meshes. To restore missing points in point cloud data, a method based on the L1-median algorithm and local features of the point cloud is used. This approach can adapt to different geometric structures and correct topological connectivity errors. The proposed method is compared with several modern approaches, demonstrating its potential in various fields, including architecture, engineering, digitalization of cultural heritage, as well as augmented and mixed reality systems. This confirms its wide applicability and great perspectives for further development.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700051
-
- Specifics of the Development of an On-Board Visualization System for Civil
Aircrafts-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Instrument panels of modern aircrafts are created based on the concept of glass cockpit. This new interface philosophy improves the perception of important flight information by displaying it on a single multi-function display. This paper considers problems that arise when developing a certified cockpit display visualization system designed for operation on civil aircrafts under the Russian real-time operating system JetOS. The paper presents several algorithmic solutions that make it possible to achieve acceptable rendering speed. In particular, a solution to the problem of rigid scheduling of operating system partitions is described in detail. This solution makes it possible to overcome the degradation of rendering speed. Some directions for further research are outlined.
PubDate: 2024-06-01
DOI: 10.1134/S0361768824700014
-
- Applying Computer Algebra Systems to Study Chaundy-Bullard Identities for
the Vector Partition Function with Weight-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: An algorithm for obtaining the Chaundy-Bullard identity for a vector partition function with weight that uses computer algebra methods is proposed. To automate this process in Maple, an algorithm was developed and implemented that calculates the values of the vector partition function with weight by finding non-negative solutions of systems of linear Diophantine equations that are used to form the identities involved. The algorithm’s input data is represented by the set of integer vectors that form a pointed lattice cone and by some point from this cone, and the Chaundy-Bullard identity for the vector partition function with weight is its output. The code involved is stored in the depository and is ready-to-use. An example demonstrating the algorithm’s operation is given.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020105
-
- On Calculating Partial Sums of Multiple Numerical Series by Methods of
Computer Algebra-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: A method to calculate partial sums of some multiple numerical series arising when searching for the resultant of a polynomial and an entire function is proposed. One can apply a symbolic algorithm that uses recurrent Newton formulas to find power sums of roots included in this formula without finding the very roots of the system. The algorithm that implements the proposed approach to calculate partial sums of multiple numerical series is implemented in Maple. Examples of using this algorithm to find partial sums of some classes of multiple numerical series are given.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020099
-
- Symbolic-Numerical Implementation of the Model of Adiabatic Guided Modes
for Two-Dimensional Irregular Waveguides-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: In this work, a symbolic-numerical solution of Maxwell’s equations is constructed, describing the guided modes of a two-dimensional smoothly irregular waveguide in the zeroth approximation of the model of adiabatic waveguide modes. The system of linear algebraic equations obtained in this approximation is solved symbolically. The dispersion relation is solved numerically using the parameter continuation method.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020063
-
- Computer-Algebraic Approach to First Differential Approximations: Van der
Pol Oscillator-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: First differential approximation has been used to analyze various numerical methods for solving systems of ordinary differential equations. This has made it possible to estimate the stiffness of the ODE system that models the oscillations of the Van der Pol oscillator and the error of the method as well as to propose simple criteria for choosing a calculation step. The presented methods allow one to perform efficient calculations using computer algebra systems.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020026
-
- Integration of a Degenerate System of ODEs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: The integrability of a two-dimensional autonomous polynomial system of ordinary differential equations (ODEs) with a degenerate singular point at the origin that depends on six parameters is investigated. The integrability condition for the first quasihomogeneous approximation allows one of these parameters to be fixed on a countable set of values. The further analysis is carried out for this value and five free parameters. Using the power geometry method, the system is reduced to a non-degenerate form through the blowup process. Then, the necessary conditions for its local integrability are calculated using the method of normal forms. In other words, the conditions for the parameters under which the original system is locally integrable near the degenerate stationary point are found. By resolving these conditions, we find seven two-parameter families in the five-dimensional parametric space. For parameter values from these families, the first integrals of the system are found. The cumbersome calculations that occur in the problem under consideration are carried out using computer algebra.
PubDate: 2024-04-01
DOI: 10.1134/S036176882402004X
-
- Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the
Leading Diagonal-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: We found a lower bound on the rank of a square matrix where every entry in the leading diagonal is neither zero nor one and every entry outside the leading diagonal is either zero or one. The rank of this matrix is at least half its order. Under an additional condition, the lower bound is higher by one. This condition means that some auxiliary system of linear equations has no binary solution. Some examples are provided that show that the lower bound can be achieved. This lower bound on the matrix rank allows the problem of finding a binary solution to a system of linear equations with a sufficiently large number of linearly independent equations to be reduced to a similar problem in a smaller number of variables. Restrictions on the existence of a large set of solutions are found, each differing from the binary one by the value of one variable. In addition, we discuss the possibility of certifying the absence of a binary solution to a large system of linear algebraic equations. Estimates of the time required for calculating the matrix rank in the SymPy computer algebra system are also provided. It is shown that the rank of a matrix over the field of residues modulo prime number is calculated faster than it generally takes to calculate the rank of a matrix of the same order over the field of rational numbers.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020142
-
- Implementation of Analytic Projective Geometry for Computer Graphics
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: In their research, the authors actively exploit different branches of geometry. For geometric constructions, computer algebra approaches and systems are used. Currently, we are interested in computer geometry, more specifically, the implementation of computer graphics. The use of the projective space and homogeneous coordinates has actually become a standard in modern computer graphics. In other words, the problem is reduced to the application of analytic projective geometry. The authors failed to find a computer algebra system that could implement projective geometry in its entirety. Therefore, it was decided to partially implement computer algebra for visualization of algebraic relations. For this purpose, the Asymptote system was employed.
PubDate: 2024-04-01
DOI: 10.1134/S0361768824020075
-
