Energy Efficient Scheduling and Routing via Randomized Rounding

We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel speed scalable processors in a fully heterogeneous setting. For both the preemptive-non-migratory and the preemptive-migratory variants, our approach allows us to obtain solutions of almost the same quality as for the homogeneous environment. By exploiting the result for the preemptive-non-migratory variant, we are able to improve the best known approximation ratio for the single processor non-preemptive problem. Furthermore, we show that our approach allows to obtain a constant-factor approximation algorithm for the power-aware preemptive job shop scheduling problem. Finally, we consider the min-power routing problem where we are given a network modeled by an undirected graph and a set of uniform demands that have to be routed on integral routes from their sources to their destinations so that the energy consumption is minimized. We improve the best known approximation ratio for this problem.Comment: 27 page

Bounded Max-Colorings of Graphs

In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most $b$ and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes' weights. In this paper we present complexity results and approximation algorithms for those problems on general graphs, bipartite graphs and trees. We first show that both problems are polynomial for trees, when the number of colors is fixed, and $H_b$ approximable for general graphs, when the bound $b$ is fixed. For the bounded max-vertex-coloring problem, we show a 17/11-approximation algorithm for bipartite graphs, a PTAS for trees as well as for bipartite graphs when $b$ is fixed. For unit weights, we show that the known 4/3 lower bound for bipartite graphs is tight by providing a simple 4/3 approximation algorithm. For the bounded max-edge-coloring problem, we prove approximation factors of $3-2/\sqrt{2b}$, for general graphs, $\min\{e, 3-2/\sqrt{b}\}$, for bipartite graphs, and 2, for trees. Furthermore, we show that this problem is NP-complete even for trees. This is the first complexity result for max-coloring problems on trees.Comment: 13 pages, 5 figure

What Machine Learning Can Do for Focusing Aerogel Detectors

Particle identification at the Super Charm-Tau factory experiment will be provided by a Focusing Aerogel Ring Imaging CHerenkov detector (FARICH). The specifics of detector location make proper cooling difficult, therefore a significant number of ambient background hits are captured. They must be mitigated to reduce the data flow and improve particle velocity resolution. In this work we present several approaches to filtering signal hits, inspired by machine learning techniques from computer vision.Comment: 5 pages, 4 figures, to be published in 26th International Conference on Computing in High Energy & Nuclear Physics (CHEP2023) proceeding

SynToxProfiler: An interactive analysis of drug combination synergy, toxicity and efficacy

Author summary High-throughput combinatorial screening is an established approach to identify candidate drug combinations to be further developed as safe and effective treatment options for many diseases, such as various types of cancers, bacterial, malarial, and viral infections. The selection of top performing drug combinations for further development is an important step for the success of the screen, where not only the synergy but also selective efficacy and potential toxicity of the drug pairs should be critically assessed. Currently, there is no method available for this; therefore, we developed SynToxProfiler tool, which was demonstrated in two different application cases to prioritize synergistic drug pairs with higher efficacy and lower toxicity as top hits, providing thus an increased likelihood for their clinical success.Peer reviewe

Recovery tread wheel pairs of machining

The basic methods of resurfacing wheels are determined and analised. It’sshown that for raising resource of used wheels and decreasing requirements of railwaytransport for new wheels it’s reasonable to use methods of recovering not only geometricparameters of rim, but also its mechanical properties. It’s marked that use of infeedprofile high-speed grinding (VPVSh) enables to intensify significantly process ofmechanical treatment of wheel rim profile both when its resurfacing in service and whenmanufacturing new wheel

The Spectrum and Energy Levels of the Low-lying Configurations of Nd III

Emission spectra of neodymium (Nd, Z=60) were recorded using Penning and hollow cathode discharge lamps in the region 11500-54000 cm$^{-1}$ (8695-1852 \r{A}) by Fourier transform spectroscopy at resolving powers up to 106. Wavenumber measurements were accurate to a few 10$^{-3}$ cm$^{-1}$. Grating spectroscopy of Nd vacuum sliding sparks and stellar spectra were used to aid line and energy level identification. The classification of 433 transitions of doubly-ionised neodymium (Nd III) from the Penning lamp spectra resulted in the determination of 144 energy levels of the 4f$^4$, 4f$^3$5d, 4f$^3$6s, and 4f$^3$6p configurations of Nd III, 105 of which were experimentally established for the first time. Of the 40 previously published Nd III levels, 1 was revised and 39 were confirmed. New Nd III atomic structure calculations were made using the Cowan code parameterised by newly established levels. These results will not only benchmark and improve future semi-empirical atomic structure calculations of Nd III, but also enable more reliable astrophysical applications of Nd III, such as abundance analyses of kilonovae and chemically peculiar stars, and studies of pulsational wave propagation in these stars