scholarly journals AN ANALYSIS OF IMAGES BEFORE COMPRESSION IN PNG FORMAT

2010 ◽  
pp. 192-204
Author(s):  
Alexander Shport'ko
Keyword(s):  
Image Analysis ◽  
Dynamic Programming ◽  
Programming Language ◽  
C Programming Language ◽  
C Programming ◽  
Before And After ◽  
Continuous Tone ◽  
Minimum Block ◽  
Image Set ◽  
True Color

An influence of predictor’s different variants and their combination on PNG image compression is examined in this article. Fragments in C programming language for estimation of pixel lines entropy before and after application of context-dependent algorithm have been presented. A method for image analysis before the compression through breakdown of pixel lines with close entropy values into minimum blocks is offered. The method is based on the choice of an effective compression variant from five possible ones for every minimum block using dynamic programming and on the combination of contiguous minimum blocks in the homogeneous blocks of lines and on adjustment of their code parameters. It is experimentally showed that the images analysis, for example, allows to decrease the continuous tone images compression aspect of Kodak True Color PNG format image set on the average up to 12,37 bpp.

scholarly journals Parallel programming technologies on computer complexes

2020 ◽  
Vol 30 (3) ◽  
pp. 28-33 ◽  
Author(s):  
S. A. Pryadko ◽  
A. Yu. Troshin ◽  
V. D. Kozlov ◽  
A. E. Ivanov
Keyword(s):  
Parallel Programming ◽  
Shared Memory ◽  
Programming Language ◽  
Operating Systems ◽  
Distributed Memory ◽  
Programming Models ◽  
Writing Programs ◽  
Advantages And Disadvantages ◽  
C Programming Language ◽  
C Programming

The article describes various options for speeding up calculations on computer systems. These features are closely related to the architecture of these complexes. The objective of this paper is to provide necessary information when selecting the capability for the speeding process of solving the computation problem. The main features implemented using the following models are described: programming in systems with shared memory, programming in systems with distributed memory, and programming on graphics accelerators (video cards). The basic concept, principles, advantages, and disadvantages of each of the considered programming models are described. All standards for writing programs described in the article can be used both on Linux and Windows operating systems. The required libraries are available and compatible with the C/C++ programming language. The article concludes with recommendations on the use of a particular technology, depending on the type of task to be solved.

scholarly journals Computing support for testing equal values of the figurative numbers in the Pascal triangle

2020 ◽  
Vol 2 (7) ◽  
pp. 36-41
Author(s):  
Miroslava Mihajlov Carević ◽  
Miloš Ilić ◽  
Milena Petrović ◽  
Nebojša Denić
Keyword(s):  
Programming Language ◽  
Mathematical Analysis ◽  
Computer Laboratory ◽  
C Programming Language ◽  
Pascal Triangle ◽  
C Programming ◽  
Computing Support

In this paper we deal with a method for the determination of numbers in a Pascal triangle that are simultaneously triangular, tetrahedral and pentaedroidni. The collected results, obtained by mathematical analysis, were verified by computer. For this purpose, we used the C# programming language as well as the computer laboratory within our University in order to test the results. The results collected by computer confirmed the accuracy of the results obtained by mathematical analysis.

scholarly journals Numerical Results for the General Linear Complementarity Problem

2019 ◽  
Vol 11 (1) ◽  
pp. 43-46
Author(s):  
Zsolt Darvay ◽  
Ágnes Füstös
Keyword(s):  
Programming Language ◽  
Linear Complementarity Problem ◽  
Interior Point ◽  
Complementarity Problem ◽  
Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Results ◽  
Interior Point Algorithm ◽  
C Programming Language ◽  
C Programming

Abstract In this article we discuss the interior-point algorithm for the general complementarity problems (LCP) introduced by Tibor Illés, Marianna Nagy and Tamás Terlaky. Moreover, we present a various set of numerical results with the help of a code implemented in the C++ programming language. These results support the efficiency of the algorithm for both monotone and sufficient LCPs.

Sign in / Sign up

Export Citation Format

Share Document