This work presents a mechanism to debias polynomial functions computed from locally differentially private data. Local differential privacy is a widely used privacy notion where users add Laplacian noise to their information before submitting it to a central server. That, however, causes bias when we calculate non-linear functions based on those noisy information. Our proposed recursive algorithm debiases these functions, with a calculation time of O(r n log n), where r is the polynomial degree and n is the number of users. We evaluate our method on the problems of k-star counting and variance estimation, comparing results with state-of-the-art algorithms. The results show that our method not only eliminates bias, but also provides at least 100 times more accuracy than previous works.
Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.
13 January 2024 in Journal on Computing and Cultural Heritage
Many Western-style paintings by Japanese artists in the early 1900s, though maintaining a unique quality, were greatly inspired by the works of Western artists. In this article, we employ machine learning to identify relationships and classify the works of Japanese and Western artists. The relationships are of significant interest to numerous art historians, as they can reveal how Western art was introduced to Japan. Historically, art historians have manually annotated these correspondences, which is a time-consuming and labor-intensive process. In this article, we introduce a new method for finding correspondences between related artworks by comparing their overall outline information. This technique is based on Siamese neural networks (SNNs) and a self-supervised learning approach. Additionally, we have compiled a dataset of illustrations from Japanese artists such as Seiki Kuroda and Western artists such as Raphaël Collin, complete with correspondence annotations. However, to exhibit the unique quality of works by Japanese artists, we demonstrate that machine learning can classify between artworks created by Japanese artists and those created by Western artists.