A distributed computing scenario is considered, where the computational power of a set worker nodes used to perform certain computation task over dataset that dispersed among workers. Lagrange coded (LCC), proposed by Yu et al., leverages well-known polynomial evaluation in such an efficient parallel fashion while keeping privacy data amidst possible collusion This solution relies on quantizing...

This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange systems. We propose a fundamental consensus algorithm, a consensus algorithm accounting for actuator saturation, and a consensus algorithm accounting for unavailability of measurements of generalised coordinate derivatives, for systems modelled by Euler–Lagrange equati...

‎In this study‎, ‎we investigate topological properties of fuzzy strong‎ b-metric spaces defined in [13]‎. ‎Firstly‎, ‎we prove Baire's theorem for‎ ‎these spaces‎. ‎Then we define the product of two fuzzy strong b-metric spaces‎ ‎defined with same continuous t-norms and show that $X_{1}times X_{2}$ is a‎ ‎complete fuzzy strong b-metric space if and only if $X_{1}$ and $X_{2}$ are‎ ‎complete fu...

It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when performing several personalized campaigns simultaneously. We formulate the multi-campaign assignment problem to solve this issue and propose methods for solving the problem. The most notable element is the Lagrange mult...