HitIct:Chinese corpus for the evaluation of lossless compression algorithms by CHANG Wei-ling1, YUN Xiao-chun2, FANG Bin-xing1, WANG Shu-peng2

“…HitIct, a Chinese corpus for the evaluation of lossless compression algorithms based on ANSI code, was proposed.In accordance with the principle of application representativeness, Complementary principle and openness principle, a large number of candidate files were obtained from the Internet, and then average compression ratio, average correlation coefficient, compression ratio correlation coefficient and standard deviation were used to select the files that give the most accurate indication of the overall performance of compression algorithms.Experimental results show that this collection has a good representativeness and stability, and can be used as the supplementary test set of the main benchmark for comparing compression methods.…”
Get full text

High accuracy and octave error immune pitch detection algorithms by M. Dziubiński, B. Kostek

“…Experiments were performed on a variety of musical instrument sounds and sample results exemplifying main issues of both engineered algorithms are shown. …”
Get full text

AN ONBOARD IMAGE RECOGNITION MODULE FOR MONITORING SYSTEMS: METHODS AND ALGORITHMS by V. A. Kovalev, A. A. Kalinovsky, A. A. Dmitruk

“…The methods and algorithms of a compact on-board image recognition module to be used as a part of monitoring systems is presented. …”
Get full text

Algorithm for Non-Contact Monitoring of the Performance of Electronic Equipment Elements by A. V. Grinkevich, А. А. Denis, Т. М. Marchuk

“…The research, described in the article, relates to the field of technical diagnostics – one of the componentsof the process of repairing electronic equipment. The main reasons that influence the correct operation of radioelectronic equipment are identified, and the types of technical malfunctions that arise during its operationare identified. …”
Get full text

A Reliable Numerical Algorithm for the Fractional Klein-Gordon Equation by Harendra SINGH, Devendra KUMAR, Jagdev SINGH, C.S. SINGH

“…The main advantage of the numerical algorithm is that it reduces the FKGE into Sylvester form of algebraic equations which significantly simplify the problem. …”
Get full text

Treatment algorithm for patients with gum recession and dento-alveolar abnormalities

“…Gingival recession is a non-inflamatory periodontal disease with tooth root exposure. The main role in gingival recession pathogenesis play anatomical cortical bone defects. …”
Get full text

HitIct:Chinese corpus for the evaluation of lossless compression algorithms by CHANG Wei-ling1, YUN Xiao-chun2, FANG Bin-xing1, WANG Shu-peng2

“…HitIct, a Chinese corpus for the evaluation of lossless compression algorithms based on ANSI code, was proposed.In accordance with the principle of application representativeness, Complementary principle and openness principle, a large number of candidate files were obtained from the Internet, and then average compression ratio, average correlation coefficient, compression ratio correlation coefficient and standard deviation were used to select the files that give the most accurate indication of the overall performance of compression algorithms.Experimental results show that this collection has a good representativeness and stability, and can be used as the supplementary test set of the main benchmark for comparing compression methods.…”
Get full text

SDN hypervisor oriented vSDN controller placement algorithm by Xiaodong DONG, Zhiqiang GUO, Sheng CHEN, Xiaobo ZHOU, Heng QI, Keqiu LI

“…With the development of the future internet technology,the future network architecture which utilizes network virtualization as a tool to solve the rigidity of traditional network becomes the main stream.As a new network architecture,software defined networking provides an effective network virtualization solution.Firstly,related technology of network virtualization in SDN was concluded,distinguished differences between deploying virtual network in SDN and traditional network was compared,and aiming at the virtual network mapping problem in SDN virtualization platform,a latency sensitive SDN virtualization controller placement algorithm.At last,experiment results show that the algorithm not only can assure the delay between SDN controllers and switches in an acceptable range,but also improve the utilization efficiency of network resources.…”
Get full text

Symmetric Encryption Algorithms in a Polynomial Residue Number System by I. Yakymenko, M. Karpinski, R. Shevchuk, M. Kasianchuk

“…In this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. …”
Get full text

SDN hypervisor oriented vSDN controller placement algorithm by Xiaodong DONG, Zhiqiang GUO, Sheng CHEN, Xiaobo ZHOU, Heng QI, Keqiu LI

“…With the development of the future internet technology,the future network architecture which utilizes network virtualization as a tool to solve the rigidity of traditional network becomes the main stream.As a new network architecture,software defined networking provides an effective network virtualization solution.Firstly,related technology of network virtualization in SDN was concluded,distinguished differences between deploying virtual network in SDN and traditional network was compared,and aiming at the virtual network mapping problem in SDN virtualization platform,a latency sensitive SDN virtualization controller placement algorithm.At last,experiment results show that the algorithm not only can assure the delay between SDN controllers and switches in an acceptable range,but also improve the utilization efficiency of network resources.…”
Get full text

Efficient i-DFA construction algorithm based on state grouping by Deng-ke QIAO, Qing WANG, Ting-wen LIU, Yong SUN, Li GUO

“…Regular expression matching plays an important role in many network and security applications.DFA is the preferred representation to perform regular expression matching in high-speed network,because of its high and stable matching efficiency.However,DFA may experience state explosion,and thus consume huge memory space.As a classical solution for the problem of state explosion,i-DFA can reduce the memory consumption significantly and guarantee the worst matching performance at the same time.However,prior methods are inefficient in both time and space during the construction of i-DFA.An efficient i-DFA construction algorithm based on the idea of state grouping was proposed.Furthermore,a formal description for the problem of state grouping was given,and it was proved that it was NP-hard to get the best state grouping result.Thus,based on local search strategy,a near-optimal algorithm was introduced to divide states into different groups.Compared with the classical construction method,the significant improvement in both time and space is achieved; the i-DFA of the proposed method may have 2/3 states as that of prior method and the proposed i-DFA is constructed with only 1/16 time of it.…”
Get full text

The green algorithm: can sustainability define the winner in the AI race? by Sebastián Rivero-Silva, David Chinarro Vadillo, Antonio Prieto-Andres

Get full text

Analytical MPC Algorithm Using Steady-State Process Model by Piotr M. Marusak

“…., large time delay or inverse response), the PID controllers may offer unsatisfactory results; on the other hand, a Model Predictive Control (MPC) algorithm based on a linear model may offer insufficient control quality when applied to nonlinear control plants. …”
Get full text

DEVELOPMENT OF ALGORITHM OF PLANNING OF INCREASE OF COMPETITIVENESS OF AUTO REPAIR BUSINESSES by Remzi Ablaev, Tatiana Cocodei, Julia Antokhina

Get full text

A Method for Adapting Stereo Matching Algorithms to Real Environments by Adam L. Kaczmarek

“…One of the main problems is that the poor quality of the results is either blamed on an inappropriate stereo camera calibration or a bad stereo matching algorithm. …”
Get full text

Analysis of algorithms performing basic arithmetic operations in the quadratic RNS by Lyudmila Borisovna Kopytkova

“…In this paper we explore the question of representing complex numbers in a residue number system and build algorithms for the operations of addition and multiplication. …”
Get full text

GPU Accelerating Algorithms for Three-Layered Heat Conduction Simulations by Nicolás Murúa, Aníbal Coronel, Alex Tello, Stefan Berres, Fernando Huancas

Get full text

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix by Jan Fikejz, Markéta Brázdová, Ľudmila Jánošíková

“…Similarly, the destination of the request may be the depot or another customer. Unlike the original version of the Clarke and Wright algorithm, the initial routes are created to satisfy delivery orders, and therefore, the same customer can occur in multiple routes. …”
Get full text

Adaptor signature scheme based on ISRSAC digital signature algorithm by Yanshuo ZHANG, Ning LIU, Yuqi YUAN, Yatao YANG

“…The adapter signature scheme can provide good properties of atomic exchange in the block chain, and has been widely used in practice.A new adapter signature scheme was constructed based on a digital signature algorithm for improved security of RSA cryptosystem (ISRSAC).After proving that the proposed scheme satisfied the correctness of the pre-signature, unforgeability, adaptability of the pre-signature, extractability of the evidence and the security of the signature scheme, it was compared with the adapter signature scheme based on the SM2 digital signature algorithm, the Schnorr-based adapter signature scheme and the ECDSA-based adapter signature scheme.And these schemes were analyzed in terms of time overhead and main calculation amount.The analysis results show that the proposed scheme is similar to other schemes in terms of time overhead, but the proposed scheme expands the application scenarios of ISRSAC algorithm in the current environment, and through the combination of ISRSAC algorithm and adapter signature technology, the selection of adapter signature is more flexible and can have a wider range of applications.…”
Get full text

Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree by A. S. Nepomniaschaya

“…To this end, we provide the data structure and its building along with the STAR–machine that simulates the run of associative (content–addressable) parallel systems with simple single–bit processing elements and vertical processing. The associative algorithm is represented on the STAR–machine as the main procedure DeleteArcSPT that uses some auxiliary procedures. …”
Get full text