Distributionally Robust Variational Quantum Algorithms With Shifted Noise by Zichang He, Bo Peng, Yuri Alexeev, Zheng Zhang

“…This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. …”
Get full text

Research on prioritization algorithm for multi-hazard warning dissemination by Yunyin Mo, Qiang Han, Yingying Song, Jingfeng Li, Jingjing Zhao

“…In a specific instance, there may be identical values for a certain attribute, resulting in the same score for the indicator determined based on that attribute, and consequently, that indicator does not play a role in the algorithm.we can omit that indicator from the formula to reduce computational load.…”
Get full text

RESEARCH ALGORITHM FOR BUSINESS ENTERPRISE ORGANIZATIONAL SUSTAINABILITY INDICES by A. V. Kouznetsov

Get full text

Chaos-based scramble self-embedding watermarking algorithm by HE Hong-jie, ZHANG Jia-shu

“…Theoretic analysis and simulation results show that the proposed algorithms may not only improve security, but it also effectively locates tamper blocks whether watermark is altered or not.…”
Get full text

Algorithmic transparency, union information rights and strategic litigation by Riccardo Maraga

“…In particular, the paper focuses on the information and consultation rights of trade union recently introduced by national and European legal systems, with special reference to the principle of algorithmic transparency introduced by Italian law (Art. 1-bis, Legislative Decree No. 152 of May 26, 1997) and the collective information rights provided for by Regulation (EU) 2024/1689, which establishes harmonized rules on artificial intelligence, and by the Directive of the European Parliament and Council on the improvement of working conditions at work through digital platforms. …”
Get full text

A ranking hashing algorithm based on listwise supervision by Anbang YANG, Jiangbo QIAN, Yihong DONG, Huahui CHEN

“…Recently,learning to hash technology has been used for the similarity search of large-scale data.It can simultaneous increase the search speed and reduce the storage cost through transforming the data into binary codes.At present,most ranking hashing algorithms compare the consistency of data in the Euclidean space and the Hamming space to construct the loss function.However,because the Hamming distance is a discrete integer value,there may be many data points sharing the same Hamming distance result in the exact ranking cannot be performed.To address this challenging issue,the encoded data was divided into several subspaces with the same length.Each subspace was set with different weights.The Hamming distance was calculated according to different subspace weights.The experimental results show that this algorithm can effectively sort the data in the Hamming space and improve the accuracy of the query compared with other learning to hash algorithms.…”
Get full text

Implementation of sepsis algorithm by nurses in the intensive care unit by Paula Pedroso Peninck, Regimar Carla Machado

“…Sepsis is defined as a clinical syndrome consisting of a systemic inflammatory response associated to an infection, which may determine malfunction or failure of multiple organs. …”
Get full text

Treatment algorithm for robotic transplant ureteral stricture repair by Emily Ji, Jonathan Rosenfeld, Devin Boehm, Rebecca Arteaga, Jaewoo Kim, Aidan Raikar, Ziho Lee

“…Here, we describe our treatment algorithm for robotic reconstruction of transplant ureteral strictures. …”
Get full text

Hierarchical Models and Tuning of Random Walk Metropolis Algorithms by Mylène Bédard

“…The theorems are proved by studying the generator of the first and second components of the algorithm and verifying their convergence to the generator of a modified RWM algorithm and a diffusion process, respectively. …”
Get full text

Fast surface reconstruction algorithm with adaptive step size. by Jingguo Dai, Yeqing Yi, Chengzhi Liu

“…To further improve the computational efficiency, an adaptive step size adjustment strategy for surface reconstruction algorithm is investigated. During each iteration, the step size is adaptively chosen based on the current residual-larger residuals may necessitate larger steps, while smaller ones might permit smaller steps. …”
Get full text

Bresenham's Line and Circle Drawing Algorithm using FPGA by Areej Ali, Riyadh Mahmood

“…An extension to the original algorithm may lead to draw circles. This research deals with the Bresenham’s line and circle drawing algorithm based on FPGA hardware platform.…”
Get full text

A Modified Grey Wolf Algorithm with Applications to Engineering by Vahid Mahboub

“…The mechanism is free of derivation, simple in execution and implementation, and only needs target function as input of the problem, among other things that make the gray wolf algorithm popular and of interest. But the problem that can be mentioned about it is that the decreasing factor used in it is linear and in some non-linear problems, it may cause more error or late convergence to the original solution. …”
Get full text

Algorithms for planning working time under interval uncertainty by Yu. N. Sotskov, N. G. Egorova, N. M. Matsveichuk

“…It is shown how scheduling theory may be used for optimal planning in time-management. …”
Get full text

Efficient heuristic algorithm for the mobile sink routing problem by YUAN yuan1, PENG Yu-xing1, LI Shan-shan2, TANG Wen-sheng3

“…In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing prob-lem can be regarded as a special case of TSP with neighborhoods（TSPN） problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a "racetrack" by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuris-tic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O（n2） computa-tion time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approxima-tion ratio and can be more efficient than the related algorithms.…”
Get full text

HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS by A. V. Sidorenko, I. V. Shakinko

“…It is demonstrated that, with the use of Henon and «Arnold’s cat» maps for the messages exceeding 4 KB, the proposed algorithm outperforms «Keccak» algorithm, being faster by 20% and more.The proposed hashing algorithm may be used in solving the problems of data integrity in modern telecommunication systems.…”
Get full text

Comparative analysis of boosting algorithms for predicting personal default by Nhat Nguyen, Duy Ngo

“…This study conducts a comparative analysis of the performance of boosting algorithms, including AdaBoost, XGBoost, LightGBM, and CatBoost, in predicting personal defaults. …”
Get full text

Lightweight Block and Stream Cipher Algorithm: A Review by Suaad Ali Abead, Nada Hussein M. Ali

“…Thus, it will affect against security of such devices and may be attacked by malicious programs. Lightweight cryptographic algorithms are one of the most ideal methods Securing these IoT applications. …”
Get full text

An Incremental High-Utility Mining Algorithm with Transaction Insertion by Jerry Chun-Wei Lin, Wensheng Gan, Tzung-Pei Hong, Binbin Zhang

“…Traditional association-rule mining is, however, not suitable in real-world applications since the purchased items from a customer may have various factors, such as profit or quantity. …”
Get full text

Angular orientation determination in SINS: traditional algorithms comparison by A. A. Sanko, A. A. Sheinikov

“…The efficiency of numerical integration is determined by the accuracy and stability of the computational process. The integration algorithm may have a small integration error, but at the same time be inefficient due to the instability of the numerical method when the step or conditions of integration change. …”
Get full text

Causes of Resistant Hypertension Detected by a Standardized Algorithm by Livia Beatriz Santos Limonta, Letícia dos Santos Valandro, Flávio Gobis Shiraishi, Pasqual Barretti, Roberto Jorge da Silva Franco, Luis Cuadrado Martin

Get full text