Search

Your search keyword '"Bieńkowski, A."' showing total 1,934 results
Start Over Author "Bieńkowski, A."
1,934 results on '"Bieńkowski, A."'

1. OPMOS: Ordered Parallel Multi-Objective Shortest-Path

Author

Gold, Leo, Bienkowski, Adam, Sidoti, David, Pattipati, Krishna, and Khan, Omer

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Artificial Intelligence, Computer Science - Hardware Architecture, Computer Science - Data Structures and Algorithms, Computer Science - Performance
Abstract

The Multi-Objective Shortest-Path (MOS) problem finds a set of Pareto-optimal solutions from a start node to a destination node in a multi-attribute graph. To solve the NP-hard MOS problem, the literature explores heuristic multi-objective A*-style algorithmic approaches. A generalized MOS algorithm maintains a "frontier" of partial paths at each node and performs ordered processing to ensure that Pareto-optimal paths are generated to reach the goal node. The algorithm becomes computationally intractable as the number of objectives increases due to a rapid increase in the non-dominated paths, and the concomitantly large increase in Pareto-optimal solutions. While prior works have focused on algorithmic methods to reduce the complexity, we tackle this challenge by exploiting parallelism using an algorithm-architecture approach. The key insight is that MOS algorithms rely on the ordered execution of partial paths to maintain high work efficiency. The OPMOS framework, proposed herein, unlocks ordered parallelism and efficiently exploits the concurrent execution of multiple paths in MOS. Experimental evaluation using the NVIDIA GH200 Superchip shows the performance scaling potential of OPMOS on work efficiency and parallelism using a real-world application to ship routing., Comment: 15 pages

Published
2024

2. Learning Minimum Linear Arrangement of Cliques and Lines

Author

Dallot, Julien, Pacut, Maciej, Bienkowski, Marcin, Melnyk, Darya, and Schmid, Stefan

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of MinLA where the graph is not given at the beginning, but rather revealed piece-by-piece. The algorithm starts in a fixed initial permutation, and after a piece of the graph is revealed, the algorithm must update its current permutation to be a MinLA of the subgraph revealed so far. The objective is to minimize the total number of swaps of adjacent nodes as the algorithm updates the permutation. The main result of this paper is an online randomized algorithm that solves this online variant for the restricted cases where the revealed graph is either a collection of cliques or a collection of lines. We show that the algorithm is $8 \ln n$-competitive, where $n$ is the number of nodes of the graph. We complement this result by constructing an asymptotically matching lower bound of $\Omega(\ln n)$., Comment: ICDCS 2024

Published
2024

3. Online Disjoint Set Covers: Randomization is not Necessary

Author

Bienkowski, Marcin, Byrka, Jarosław, and Jeż, Łukasz

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n nodes of a hypergraph are given at the beginning, and then a sequence of hyperedges (subsets of [n]) is presented to an algorithm. For each hyperedge, an online algorithm must assign a color (an integer). Once an input terminates, the gain of the algorithm is the number of colors that correspond to valid set covers (i.e., the union of hyperedges that have that color contains all n nodes). We present a deterministic online algorithm that is O(log^2 n)-competitive, exponentially improving on the previous bound of O(n) and matching the performance of the best randomized algorithm by Emek et al. [ESA 2019]. For color selection, our algorithm uses a novel potential function, which can be seen as an online counterpart of the derandomization method of conditional probabilities and pessimistic estimators. There are only a few cases where derandomization has been successfully used in the field of online algorithms. In contrast to previous approaches, our result extends to the following new challenges: (i) the potential function derandomizes not only the Chernoff bound, but also the coupon collector's problem, (ii) the value of OPT of the maximization problem is not bounded a priori, and (iii) we do not produce a fractional solution first, but work directly on the input.

Published
2024

4. Contract Scheduling with Distributional and Multiple Advice

Author

Angelopoulos, Spyros, Bienkowski, Marcin, Dürr, Christoph, and Simon, Bertrand

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Artificial Intelligence, Computer Science - Machine Learning
Abstract

Contract scheduling is a widely studied framework for designing real-time systems with interruptible capabilities. Previous work has showed that a prediction on the interruption time can help improve the performance of contract-based systems, however it has relied on a single prediction that is provided by a deterministic oracle. In this work, we introduce and study more general and realistic learning-augmented settings in which the prediction is in the form of a probability distribution, or it is given as a set of multiple possible interruption times. For both prediction settings, we design and analyze schedules which perform optimally if the prediction is accurate, while simultaneously guaranteeing the best worst-case performance if the prediction is adversarial. We also provide evidence that the resulting system is robust to prediction errors in the distributional setting. Last, we present an experimental evaluation that confirms the theoretical findings, and illustrates the performance improvements that can be attained in practice., Comment: To appear in Proceedings of IJCAI 2024

Published
2024

5. Emerin mislocalization during chromatin bridge resolution can drive prostate cancer cell invasiveness in a collagen-rich microenvironment

Author

Popęda, Marta, Kowalski, Kamil, Wenta, Tomasz, Beznoussenko, Galina V., Rychłowski, Michał, Mironov, Alexander, Lavagnino, Zeno, Barozzi, Sara, Richert, Julia, Bertolio, Rebecca, Myszczyński, Kamil, Szade, Jolanta, Bieńkowski, Michał, Miszewski, Kevin, Matuszewski, Marcin, Żaczek, Anna J., Braga, Luca, Del Sal, Giannino, Bednarz-Knoll, Natalia, Maiuri, Paolo, and Nastały, Paulina

Published
2024
Full Text
View/download PDF

8. Loss of Y in regulatory T lymphocytes in the tumor micro-environment of primary colorectal cancers and liver metastases

Author

Wójcik, Magdalena, Juhas, Ulana, Mohammadi, Elyas, Mattisson, Jonas, Drężek-Chyła, Kinga, Rychlicka-Buniowska, Edyta, Bruhn-Olszewska, Bożena, Davies, Hanna, Chojnowska, Katarzyna, Olszewski, Paweł, Bieńkowski, Michał, Jankowski, Michał, Rostkowska, Olga, Hellmann, Andrzej, Pęksa, Rafał, Kowalski, Jacek, Zdrenka, Marek, Kobiela, Jarek, Zegarski, Wojciech, Biernat, Wojciech, Szylberg, Łukasz, Remiszewski, Piotr, Mieczkowski, Jakub, Filipowicz, Natalia, and Dumanski, Jan P.

Published
2024
Full Text
View/download PDF

9. An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem

Author

Basiak, Mateusz, Bienkowski, Marcin, and Tatarczuk, Agnieszka

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We study the online variant of the Min-Sum Set Cover (MSSC) problem, a generalization of the well-known list update problem. In the MSSC problem, an algorithm has to maintain the time-varying permutation of the list of $n$ elements, and serve a sequence of requests $R_1, R_2, \dots, R_t, \dots$. Each $R_t$ is a subset of elements of cardinality at most $r$. For a requested set $R_t$, an online algorithm has to pay the cost equal to the position of the first element from $R_t$ on its list. Then, it may arbitrarily permute its list, paying the number of swapped adjacent element pairs. We present the first constructive deterministic algorithm for this problem, whose competitive ratio does not depend on $n$. Our algorithm is $O(r^2)$-competitive, which beats both the existential upper bound of $O(r^4)$ by Bienkowski and Mucha [AAAI '23] and the previous constructive bound of $O(r^{3/2} \cdot \sqrt{n})$ by Fotakis et al. [ICALP '20]. Furthermore, we show that our algorithm attains an asymptotically optimal competitive ratio of $O(r)$ when compared to the best fixed permutation of elements.

Published
2023

10. A Subquadratic Bound for Online Bisection

Author

Bienkowski, Marcin and Schmid, Stefan

Subjects
Computer Science - Data Structures and Algorithms
Abstract

The online bisection problem is a natural dynamic variant of the classic optimization problem, where one has to dynamically maintain a partition of $n$ elements into two clusters of cardinality $n/2$. During runtime, an online algorithm is given a sequence of requests, each being a pair of elements: an inter-cluster request costs one unit while an intra-cluster one is free. The algorithm may change the partition, paying a unit cost for each element that changes its cluster. This natural problem admits a simple deterministic $O(n^2)$-competitive algorithm [Avin et al., DISC 2016]. While several significant improvements over this result have been obtained since the original work, all of them either limit the generality of the input or assume some form of resource augmentation (e.g., larger clusters). Moreover, the algorithm of Avin et al. achieves the best known competitive ratio even if randomization is allowed. In this paper, we present the first randomized online algorithm that breaks this natural quadratic barrier and achieves a competitive ratio of $\tilde{O}(n^{23/12})$ without resource augmentation and for an arbitrary sequence of requests., Comment: Published in STACS 2024

Published
2023

11. Emerin mislocalization during chromatin bridge resolution can drive prostate cancer cell invasiveness in a collagen-rich microenvironment

Author

Marta Popęda, Kamil Kowalski, Tomasz Wenta, Galina V. Beznoussenko, Michał Rychłowski, Alexander Mironov, Zeno Lavagnino, Sara Barozzi, Julia Richert, Rebecca Bertolio, Kamil Myszczyński, Jolanta Szade, Michał Bieńkowski, Kevin Miszewski, Marcin Matuszewski, Anna J. Żaczek, Luca Braga, Giannino Del Sal, Natalia Bednarz-Knoll, Paolo Maiuri, and Paulina Nastały

Subjects
Medicine, Biochemistry, QD415-436
Abstract

Abstract Micronuclei (MN) can form through many mechanisms, including the breakage of aberrant cytokinetic chromatin bridges. The frequent observation of MN in tumors suggests that they might not merely be passive elements but could instead play active roles in tumor progression. Here, we propose a mechanism through which the presence of micronuclei could induce specific phenotypic and functional changes in cells and increase the invasive potential of cancer cells. Through the integration of diverse in vitro imaging and molecular techniques supported by clinical samples from patients with prostate cancer (PCa) defined as high-risk by the D’Amico classification, we demonstrate that the resolution of chromosome bridges can result in the accumulation of Emerin and the formation of Emerin-rich MN. These structures are negative for Lamin A/C and positive for the Lamin-B receptor and Sec61β. MN can act as a protein sinks and result in the pauperization of Emerin from the nuclear envelope. The Emerin mislocalization phenotype is associated with a molecular signature that is correlated with a poor prognosis in PCa patients and is enriched in metastatic samples. Emerin mislocalization corresponds with increases in the migratory and invasive potential of tumor cells, especially in a collagen-rich microenvironment. Our study demonstrates that the mislocalization of Emerin to MN results in increased cell invasiveness, thereby worsening patient prognosis.

Published
2024
Full Text
View/download PDF

13. The use of Octree in point cloud analysis with application to cultural heritage

Author

Bieńkowski, Rafał and Rutkowski, Krzysztof E.

Subjects
Computer Science - Computer Vision and Pattern Recognition, E.1, E.2, J.2
Abstract

In this article we present the effects of our work on the subject of the technical approach to the 3D point cloud data analysis through the use of the Octree method to compress, analyse and compute the initial data., Comment: 6 pages, 12 figures, 7 citations

Published
2022

15. Metabolism gene expression in worker honey bees after exposure to 50Hz electric field - semi-field analysis

Author

Agnieszka Murawska, Paweł Migdał, Moritz Mating, Paweł Bieńkowski, Ewelina Berbeć, and Ralf Einspanier

Subjects
Gene expression, Long-term effects, E-field exposure, 50Hz, Zoology, QL1-991
Abstract

Abstract The investigation of the effects of artificial 50 Hz electric field (E-field) frequency on Apis mellifera is a relatively new field of research. Since the current literature focuses mainly on short-term effects, it is unknown whether E-fields have permanent effects on bees or whether their effects can be neutralized. In this study we assessed gene expression immediately after exposure to the E-field, as well as 7 days after exposure. The aim of this work was to identify potentially dysregulated gene transcripts in honey bees that correlate with exposure time and duration to E-fields. Newly emerged bees were marked daily with a permanent marker (one color for each group). Then bees were exposed to the 50 Hz E-field with an intensity of 5.0 kV/m or 10.0 kV/m for 1–3 h. After exposure, half of the bees were analyzed for gene expression changes. The other half were transferred to a colony kept in a mini-hive. After 7 days, marked bees were collected from the mini-hive for further analysis. Six regulated transcripts were selected of transcripts involved in oxidative phosphorylation (COX5a) and transcripts involved in endocrine functions (HBG-3, ILP-1), mitochondrial inner membrane transport (TIM10), and aging (mRPL18, mRPS30). Our study showed that in Apis mellifera the expression of selected genes is altered in different ways after exposure to 50 Hz electric fields -. Most of those expression changes in Cox5a, mRPL18, mRPS30, and HGB3, were measurable 7 days after a 1–3 h exposure. These results indicate that some E-field effects may be long-term effects on honey bees due to E-field exposure, and they can be observed 7 days after exposure.

Published
2024
Full Text
View/download PDF

16. Evaluation of CSF 8-iso-prostaglandin F2α and erythrocyte anisocytosis as prognostic biomarkers for delayed cerebral ischemia after aneurysmal subarachnoid hemorrhage

Author

Karol Wiśniewski, Karol Zaczkowski, Bartosz M. Szmyd, Marta Popęda, Michał Bieńkowski, Bartłomiej Posmyk, Ernest J. Bobeff, and Dariusz J. Jaskólski

Subjects
Medicine, Science
Abstract

Abstract Delayed cerebral ischemia (DCI) is a serious, life-threatening, complication affecting patients who have survived the initial bleeding from a ruptured intracranial aneurysm. Due to the challenging diagnosis, potential DCI prognostic markers should be of value in clinical practice. According to recent reports isoprostanes and red blood cell distribution (RDW) showed to be promising in this respect. We conducted a prospective study of 27 aSAH patients and control group (n = 8). All patients from the study group were treated within the first day of the initial bleeding. We collected data regarding clinical status and results of biochemical, and radiological examinations. We measured cerebrospinal fluid (CSF) concentration of 8-iso-prostaglandin F2α (F2-IsoP) and RDW on days 1, 3, and 5. Both CSF F2-IsoP level and RDW-SD measured on day 1 were significant predictors of DCI. The receiver operating characteristics curve for DCI prediction based on the multivariate model yielded an area under the curve of 0.924 (95% CI 0.824–1.000, p

Published
2024
Full Text
View/download PDF

17. Loss of Y in regulatory T lymphocytes in the tumor micro-environment of primary colorectal cancers and liver metastases

Author

Magdalena Wójcik, Ulana Juhas, Elyas Mohammadi, Jonas Mattisson, Kinga Drężek-Chyła, Edyta Rychlicka-Buniowska, Bożena Bruhn-Olszewska, Hanna Davies, Katarzyna Chojnowska, Paweł Olszewski, Michał Bieńkowski, Michał Jankowski, Olga Rostkowska, Andrzej Hellmann, Rafał Pęksa, Jacek Kowalski, Marek Zdrenka, Jarek Kobiela, Wojciech Zegarski, Wojciech Biernat, Łukasz Szylberg, Piotr Remiszewski, Jakub Mieczkowski, Natalia Filipowicz, and Jan P. Dumanski

Subjects
Medicine, Science
Abstract

Abstract Male sex is a risk factor for colorectal cancer (CRC) with higher illness burden and earlier onset. Thus, we hypothesized that loss of chromosome Y (LOY) in the tumor micro-environment (TME) might be involved in oncogenesis. Previous studies show that LOY in circulating leukocytes of aging men was associated with shorter survival and non-hematological cancer, as well as higher LOY in CD4 + T-lymphocytes in men with prostate cancer vs. controls. However, nothing is known about LOY in leukocytes infiltrating TME and we address this aspect here. We studied frequency and functional effects of LOY in blood, TME and non-tumorous tissue. Regulatory T-lymphocytes (Tregs) in TME had the highest frequency of LOY (22%) in comparison to CD4 + T-lymphocytes and cytotoxic CD8 + T-lymphocytes. LOY score using scRNA-seq was also linked to higher expression of PDCD1, TIGIT and IKZF2 in Tregs. PDCD1 and TIGIT encode immune checkpoint receptors involved in the regulation of Tregs function. Our study sets the direction for further functional research regarding a probable role of LOY in intensifying features related to the suppressive phenotype of Tregs in TME and consequently a possible influence on immunotherapy response in CRC patients.

Published
2024
Full Text
View/download PDF

18. An Improved Algorithm For Online Min-Sum Set Cover

Author

Bienkowski, Marcin and Mucha, Marcin

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning
Abstract

We study a fundamental model of online preference aggregation, where an algorithm maintains an ordered list of $n$ elements. An input is a stream of preferred sets $R_1, R_2, \dots, R_t, \dots$. Upon seeing $R_t$ and without knowledge of any future sets, an algorithm has to rerank elements (change the list ordering), so that at least one element of $R_t$ is found near the list front. The incurred cost is a sum of the list update costs (the number of swaps of neighboring list elements) and access costs (position of the first element of $R_t$ on the list). This scenario occurs naturally in applications such as ordering items in an online shop using aggregated preferences of shop customers. The theoretical underpinning of this problem is known as Min-Sum Set Cover. Unlike previous work (Fotakis et al., ICALP 2020, NIPS 2020) that mostly studied the performance of an online algorithm ALG against the static optimal solution (a single optimal list ordering), in this paper, we study an arguably harder variant where the benchmark is the provably stronger optimal dynamic solution OPT (that may also modify the list ordering). In terms of an online shop, this means that the aggregated preferences of its user base evolve with time. We construct a computationally efficient randomized algorithm whose competitive ratio (ALG-to-OPT cost ratio) is $O(r^2)$ and prove the existence of a deterministic $O(r^4)$-competitive algorithm. Here, $r$ is the maximum cardinality of sets $R_t$. This is the first algorithm whose ratio does not depend on $n$: the previously best algorithm for this problem was $O(r^{3/2} \cdot \sqrt{n})$-competitive and $\Omega(r)$ is a lower bound on the performance of any deterministic online algorithm., Comment: Presented at AAAI 2023

Published
2022

19. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization

Author

Bienkowski, Marcin, Fuchssteiner, David, and Schmid, Stefan

Subjects
Computer Science - Networking and Internet Architecture, Computer Science - Data Structures and Algorithms
Abstract

Reconfigurable optical topologies are a promising new technology to improve datacenter network performance and cope with the explosive growth of traffic. In particular, these networks allow to directly and adaptively connect racks between which there is currently much traffic, hence making an optimal use of the bandwidth capacity by avoiding multi-hop forwarding. This paper studies the dynamic optimization of such reconfigurable topologies, by adapting the network to the traffic in an online manner. The underlying algorithmic problem can be described as an online maximum weight $b$-matching problem, a~generalization of maximum weight matching where each node has at most $b \geq 1$ incident matching edges. We make the case for a randomized approach for matching optimization. Our main contribution is a $O(\log b)$-competitive algorithm and we show that it is asymptotically optimal. This algorithm is hence exponentially better than the best possible deterministic online algorithm. We complement our theoretical results with extensive trace-driven simulations, based on real-world datacenter workloads., Comment: Published in ACM SC 2023

Published
2022

21. Chronic fatigue syndrome related to herpes simplex viruses infection – a narrative review

Author

Kuba Bieńkowski, Albert Bielaska, Ewelina Wesołek-Bielaska, Wojciech Kołodziej, Jakub Krzysztof Gałązka, and Magdalena Greszta

Subjects
chronic fatigue syndrome, herpes simples viruses, neurology, infectious diseases, neuroinflammatory, Sports, GV557-1198.995, Sports medicine, RC1200-1245
Abstract

This article reviews the potential impact of herpes simplex viruses (HSV) on chronic fatigue syndrome (CFS). HSV-1 and HSV-2 are prevalent pathogens, with HSV-1 acquired early in life and HSV-2 typically transmitted sexually. Studies have shown an association between HSV and CFS, with HSV-1 detected in saliva and cerebrospinal fluid of CFS patients and elevated HSV-2 antibodies found in CFS patients. Immunological abnormalities, including increased pro-inflammatory cytokines and chemokines, suggest immune dysregulation in CFS patients infected with HSV. HSV infections can also disrupt the hypothalamic-pituitary-adrenal axis and autonomic nervous system, impacting energy metabolism regulation and contributing to CFS fatigue. Neuroinflammation, indicated by increased translocator protein binding in CFS patients' brains, may play a role in CFS symptoms. However, the mechanisms linking HSV to CFS and the contribution of viral-induced neuroinflammation are still unclear. Despite the evidence, understanding the complex interactions between HSV, immune responses, and other factors in CFS remains challenging. In conclusion, HSV, particularly HSV-1 and HSV-2, may contribute to CFS development. Further research is needed to unravel the mechanisms involved and identify potential therapeutic interventions.

Published
2024
Full Text
View/download PDF

22. Deterministic Self-Adjusting Tree Networks Using Rotor Walks

Author

Avin, Chen, Bienkowski, Marcin, Salem, Iosif, Sama, Robert, Schmid, Stefan, and Schmidt, Paweł

Subjects
Computer Science - Data Structures and Algorithms, E.1, F.2.2
Abstract

We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications in reconfigurable datacenter networks. We are given a fixed balanced binary tree T connecting n nodes V = {v_1, ... , v_n}. A source node v_0, attached to the root of the tree, issues communication requests to nodes in V, in an online and adversarial manner; the access cost of a request to a node v, is given by the current depth of v in T. The online algorithm can try to reduce the access cost by performing swap operations, with which the position of a node is exchanged with the position of its parent in the tree; a swap operation costs one unit. The objective is to design an online algorithm which minimizes the total access cost plus adjustment cost (swapping). Avin et al. recently presented Random-Push, a constant competitive online algorithm for this problem, based on random walks, together with an analysis exploiting the most recently used (MRU) property of random walks. We study analytically and empirically, online algorithms for this problem. In particular, we explore how to derandomize Random-Push. We consider a simple derandomized algorithm which we call Rotor-Push, as its behavior is reminiscent of rotor walks. We first prove that Rotor-Push is constant competitive: its competitive ratio is 12 and hence by a factor of five lower than the best existing competitive ratio. In contrast to Random-Push, the algorithm does not feature the MRU property, which requires a new analysis. We present a significantly improved and simpler analysis for the randomized algorithm, showing that it is 16-competitive. We compare empirically all self-adjusting single-source tree networks, using synthetic and real data with varying locality and observe that Rotor-Push and Random-Push have almost identical performance., Comment: full version, including all proofs

Published
2022

23. Cardiovascular complications in the course of COVID-19 - lessons learned and implications for the future care of patients with viral respiratory diseases: Data from a single center retrospective observational study

Author

Krogulec, Dominika, Bieńkowski, Carlo, Kowalska, Justyna D., Bednarska, Agnieszka, Wojtycha-Kwaśnica, Beata, Jurek, Natalia, Ząbek, Piotr, Czeszko-Paprocka, Hanna, Mrozińska, Monika, Paciorek, Marcin, Pihowicz, Andrzej, and Horban, Andrzej

Published
2024
Full Text
View/download PDF

25. Combination of modified FOLFIRINOX with stereotactic body radiotherapy as an induction therapy for locally advanced pancreatic adenocarcinoma – a prospective single-arm study

Author

Michał Piątek, Michał Bieńkowski, Katarzyna Kuśnierz, Joanna Pilch-Kowalczyk, Dorota Imielska-Zdunek, Sławomir Mrowiec, Paweł Lampe, Barbara Radecka, and Sergiusz Nawrocki

Subjects
chemotherapy, health- related quality of life, neoadjuvant therapy, pancreatic ductal carcinoma, stereotactic body radiation therapy, Medicine
Published
2024
Full Text
View/download PDF

26. Changes in honey bee nutrition after exposure to radiofrequency electromagnetic field

Author

P. Migdal, M. Plotnik, P. Bieńkowski, A. Murawska, E. Berbeć, P. Sobkiewicz, K. Zarębski, and K. Latarowski

Subjects
Honey bee, nutrition, radiofrequency, electromagnetic field, hemolymph, Zoology, QL1-991
Abstract

Urban beekeeping has gained interest in recent years. Bees placed in cities, on the roofs of buildings, are exposed to many different sources of electromagnetic fields of different frequencies and intensities. Knowledge about the impact of electromagnetic fields on the physiology and behavior of insects (including honey bees) is limited. Hence, one of the first steps was to check how radiofrequency electromagnetic fields affect honey bees’ nutrition. The level of total proteins, glucose, triglycerides, and TAS activity in bee hemolymph was analyzed. This is because they indicate the honey bee’s nutrition level. The experiment involved 2-day-old Carniolan worker honey bees (Apis mellifera carnica L.). The bees were exposed to fields of 12 V/m, 28 V/m, and 61 V/m for 0.25, 1 and 3 h. Hemolymph was taken from 40 alive worker honey bees from each group immediately after exposure, by removing the antennae with sterile tweezers. The activity of biochemical markers (total proteins, TAS, and triglycerides) in the bee hemolymph in 12 V/m and 28 V/m groups showed statistically significant differences compared to the control group in most cases. According to our own research, radiofrequency electromagnetic fields disturb honey bee nutrition. The changes in the analyzed indicators may have long-term effects.

Published
2024
Full Text
View/download PDF

27. Online Facility Location with Linear Delay

Author

Bienkowski, Marcin, Böhm, Martin, Byrka, Jarosław, and Marcinkowski, Jan

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We study the problem of online facility location with delay. In this problem, a sequence of $n$ clients appear in the metric space, and they need to be eventually connected to some open facility. The clients do not have to be connected immediately, but such a choice comes with a penalty: each client incurs a waiting cost (the difference between its arrival and connection time). At any point in time, an algorithm may decide to open a facility and connect any subset of clients to it. This is a well-studied problem both of its own, and within the general class of network design problems with delays. Our main focus is on a new variant of this problem, where clients may be connected also to an already open facility, but such action incurs an extra cost: an algorithm pays for waiting of the facility (a cost incurred separately for each such "late" connection). This is reminiscent of online matching with delays, where both sides of the connection incur a waiting cost. We call this variant two-sided delay to differentiate it from the previously studied one-sided delay. We present an $O(1)$-competitive deterministic algorithm for the two-sided delay variant. On the technical side, we study a greedy strategy, which grows budgets with increasing waiting delays and opens facilities for subsets of clients once sums of these budgets reach certain thresholds. Our technique is a substantial extension of the approach used by Jain, Mahdian and Saberi [STOC 2002] for analyzing the performance of offline algorithms for facility location. We then show how to transform our $O(1)$-competitive algorithm for the two-sided delay variant to $O(\log n / \log \log n)$-competitive deterministic algorithm for one-sided delays. We note that all previous online algorithms for problems with delays in general metrics have at least logarithmic ratios.

Published
2021

28. Elevated expression of complement factor I in lung cancer cells associates with shorter survival–Potentially via non-canonical mechanism

Author

Felberg, Anna, Bieńkowski, Michał, Stokowy, Tomasz, Myszczyński, Kamil, Polakiewicz, Zuzanna, Kitowska, Kamila, Sądej, Rafał, Mohlin, Frida, Kuźniewska, Alicja, Kowalska, Daria, Stasiłojć, Grzegorz, Jongerius, Ilse, Spaapen, Robbert, Mesa-Guzman, Miguel, Montuenga, Luis M., Blom, Anna M., Pio, Ruben, and Okrój, Marcin

Published
2024
Full Text
View/download PDF

29. Vaccination against COVID-19 among healthcare workers as a cocoon strategy for people living with HIV

Author

Agata Skrzat-Klapaczyńska, Justyna Kowalska, Filip Fijołek, Marcin Paciorek, Carlo Bieńkowski, Dominika Krogulec, and Andrzej Horban

Subjects
Healthcare workers, HCWs, PLWH, COVID-19 vaccination, Cocoon strategy, S-RBD antibodies, Microbiology, QR1-502, Public aspects of medicine, RA1-1270
Abstract

Introduction: Healthcare professionals working in infectious disease units are often engaged in the care of patients with HIV infection. A cocoon vaccination strategy may protect those who are immunocompromised from a severe course of COVID-19. Methods: The research was conducted between January 2021 and June 2022. The study participants were 450 healthcare workers (HCWs) from the Hospital for Infectious Diseases in Warsaw who were vaccinated against COVID-19 with the BNT162b2 mRNA vaccine (Pfizer-BioNTech) –, thefirst available type of vaccine in Poland. Sera were collected according to the schedule of the study. Statistical analyses were performed with non-parametric tests: Wilcoxon's test was used to compare dependent numerical variables, and Fisher's exact test and the Chi-squared test to compare categorical variables. A p value of

Published
2024
Full Text
View/download PDF

30. Early trajectories of virological and immunological biomarkers and clinical outcomes in patients admitted to hospital for COVID-19: an international, prospective cohort study

Author

Sahner, David, Tierney, John, Vogel, Susan E., Herpin, Betsey R., Smolskis, Mary C., McKay, Laura A., Cahill, Kelly, Crew, Page, Sardana, Ratna, Raim, Sharon Segal, Hensely, Lisa, Lorenzo, Johsua, Mock, Rebecca, Zuckerman, Judith, Atri, Negin, Miller, Mark, Vallee, David, Chung, Lucy, Kang, Nayon, Barrett, Kevin, Adam, Stacey J., Read, Sarah, Draghia-Akli, Ruxandra, Currier, Judy, Hughes, Eric, Harrigan, Rachel H., Amos, Laura, Carlsen, Amy, Carter, Anita, Collins, Gary, Davis, Bionca, Denning, Eileen, DuChene, Alain, Eckroth, Kate, Engen, Nicole, Frase, Alex, Gandits, Greg, Grund, Birgit, Harrison, Merrie, Hurlbut, Nancy, Kaiser, Payton, Koopmeiners, Joseph, Larson, Gregg, Meger, Sue, Mistry, Shweta Sharma, Murray, Thomas, Nelson, Ray, Quan, Kien, Quan, Siu Fun, Reilly, Cavan, Siegel, Lianne, Thompson, Greg, Vock, David, Walski, Jamie, Gelijns, Annetine C., Moskowitz, Alan J., Bagiella, Emilia, Moquete, Ellen, O'Sullivan, Karen, Marks, Mary E., Accardi, Evan, Kinzel, Emily, Burris, Sarah, Bedoya, Gabriela, Gupta, Lola, Overbey, Jessica R., Santos, Milerva, Gillinov, Marc A., Miller, Marissa A., Taddei-Peters, Wendy C., Fenton, Kathleen, Sandkovsky, Uriel, Gottlieb, Robert L., Mack, Michael, Berhe, Mezgebe, Haley, Clinton, Dishner, Emma, Bettacchi, Christopher, Golden, Kevin, Duhaime, Erin, Ryan, Madison, Tallmadge, Catherine, Estrada, Lorie, Jones, Felecia, Villa, Samatha, Wang, Samatha, Robert, Raven, Coleman, Tanquinisha, Clariday, Laura, Baker, Rebecca, Hurutado-Rodriguez, Mariana, Iram, Nazia, Fresnedo, Michelle, Davis, Allyson, Leonard, Kiara, Ramierez, Noelia, Thammavong, Jon, Duque, Krizia, Turner, Emma, Fisher, Tammy, Robinson, Dianna, Ransom, Desirae, Maldonado, Nicholas, Lusk, Erica, Killian, Aaron, Palacious, Adriana, Solis, Edilia, Jerrow, Janet, Watts, Matthew, Whitacre, Heather, Cothran, Elizabeth, Smith, Peter K., Barkauskas, Christina E., Vekstein, Andrew M., Ko, Emily R., Dreyer, Grace R., Stafford, Neil, Brooks, Megan, Der, Tatyana, Witte, Marie, Gamarallage, Ruwan, Franzone, John, Ivey, Noel, Lumsden, Rebecca H., Mosaly, Nilima, Mourad, Ahmaad, Holland, Thomas L., Motta, Mary, Lane, Kathleen, McGowan, Lauren M., Stout, Jennifer, Aloor, Heather, Bragg, Kennesha M., Toledo, Barvina, McLendon-Arvik, Beth, Bussadori, Barbara, Hollister, Beth A., Griffin, Michelle, Giangiacomo, Dana M., Rodriguez, Vicente, Bokhart, Gordon, Eichman, Sharon M., Parrino, Patrick E., Spindel, Stephen, Bansal, Aditya, Baumgarten, Katherine, Hand, Johnathan, Vonderhaar, Derek, Nossaman, Bobby, Sylvia Laudun, Ames, DeAnna, Broussard, Shane, Hernandez, Nilmo, Isaac, Geralyn, Dinh, Huan, Zheng, Yiling, Tran, Sonny, McDaniel, Hunter, Crovetto, Nicolle, Perin, Emerson, Costello, Briana, Manian, Prasad, Sohail, M. Rizwan, Postalian, Alexander, Hinsu, Punit, Watson, Carolyn, Chen, James, Fink, Melyssa, Sturgis, Lydia, Walker, Kim, Mahon, Kim, Parenti, Jennifer, Kappenman, Casey, Knight, Aryn, Sturek, Jeffrey M., Barros, Andrew, Enfield, Kyle B., Kadl, Alexandra, Green, China J., Simon, Rachel M., Fox, Ashley, Thornton, Kara, Adams, Amy, Badhwar, Vinay, Sharma, Sunil, Peppers, Briana, McCarthy, Paul, Krupica, Troy, Sarwari, Arif, Reece, Rebecca, Fornaresico, Lisa, Glaze, Chad, Evans, Raquel, Di, Fang, Carlson, Shawn, Aucremanne, Tanja, Tennant, Connie, Sutton, Lisa Giblin, Buterbaugh, Sabrina, Williams, Roger, Bunner, Robin, Traverse, Jay H., Rhame, Frank, Huelster, Joshua, Kethireddy, Rajesh, Davies, Irena, Salamanca, Julianne, Majeski, Christine, Skelton, Paige, Zarambo, Maria, Sarafolean, Andrea, Bowdish, Michael E., Borok, Zea, Wald-Dickler, Noah, Hutcheon, Douglass, Towfighi, Amytis, Lee, Mary, Lewis, Meghan R., Spellberg, Brad, Sher, Linda, Sharma, Aniket, Olds, Anna P., Justino, Chris, Loxano, Edward, Romero, Chris, Leong, Janet, Rodina, Valentina, Quesada, Christine, Hamilton, Luke, Escobar, Jose, Leshnower, Brad, Bender, William, Sharifpour, Milad, Miller, Jeffrey, Farrington, Woodrow, Baio, Kim T., McBride, Mary, Fielding, Michele, Mathewson, Sonya, Porte, Kristina, Maton, Missy, Ponder, Chari, Haley, Elisabeth, Spainhour, Christine, Rogers, Susan, Tyler, Derrick, Madathil, Ronson J., Rabin, Joseph, Levine, Andrea, Saharia, Kapil, Tabatabai, Ali, Lau, Christine, Gammie, James S., Peguero, Maya-Loren, McKernan, Kimberly, Audette, Mathew, Fleischmann, Emily, Akbari, Kreshta, Lee, Myounghee, Chi, Andrew, Salehi, Hanna, Pariser, Alan, Nyguyen, Phuong Tran, Moore, Jessica, Gee, Adrienne, Vincent, Shelika, Zuckerman, Richard A., Iribarne, Alexander, Metzler, Sara, Shipman, Samantha, Johnson, Haley, Newton, Crystallee, Parr, Doug, Miller, Leslie, Schelle, Beth, McLean, Sherry, Rothbaum, Howard R., Alvarez, Michael S., Kalan, Shivam P., Germann, Heather H., Hendershot, Jennifer, Moroney, Karen, Herring, Karen, Cook, Sharri, Paul, Pam, Walker-Ignasiak, Rebecca, North, Crystal, Oldmixon, Cathryn, Ringwood, Nancy, Muzikansky, Ariela, Morse, Richard, Fitzgerald, Laura, Morin, Haley D., Brower, Roy G., Reineck, Lora A., Bienstock, Karen, Steingrub, Jay H., Hou, Peter K., Steingrub, Jay S., Tidswell, Mark A., Kozikowski, Lori-Ann, Kardos, Cynthia, DeSouza, Leslie, Romain, Sarah, Thornton-Thompson, Sherell, Talmor, Daniel, Shapiro, Nathan, Andromidas, Konstantinos, Banner-Goodspeed, Valerie, Bolstad, Michael, Boyle, Katherine L., Cabrera, Payton, deVilla, Arnaldo, Ellis, Joshua C., Grafals, Ana, Hayes, Sharon, Higgins, Conor, Kurt, Lisa, Kurtzman, Nicholas, Redman, Kimberly, Rosseto, Elinita, Scaffidi, Douglas, Filbin, Michael R., Hibbert, Kathryn A., Parry, Blair, Margolin, Justin, Hillis, Brooklynn, Hamer, Rhonda, Brait, Kelsey, Beakes, Caroline, McKaig, Brenna, Kugener, Eleonore, Jones, Alan E., Galbraith, James, Nandi, Utsav, Peacock, Rebekah, Hendey, Gregory, Kangelaris, Kirsten, Ashktorab, Kimia, Gropper, Rachel, Agrawal, Anika, Yee, Kimberley J., Jauregui, Alejandra E., Zhuo, Hanjing, Almasri, Eyad, Fayed, Mohamed, Hubel, Kinsley A., Hughes, Alyssa R., Garcia, Rebekah L., Lim, George W., Chang, Steven Y., Lin, Michael Y., Vargas, Julia, Sihota, Hena, Beutler, Rebecca, Agarwal, Trisha, Wilson, Jennifer G., Vojnik, Rosemary, Perez, Cynthia, McDowell, Jordan H., Roque, Jonasel, Wang, Henry, Huebinger, Ryan M., Patel, Bela, Vidales, Elizabeth, Albertson, Timothy, Hardy, Erin, Harper, Richart, Moss, Marc A., Baduashvili, Amiran, Chauhan, Lakshmi, Douin, David J., Martinez, Flora, Finck, Lani L., Bastman, Jill, Howell, Michelle, Higgins, Carrie, McKeehan, Jeffrey, Finigan, Jay, Stubenrauch, Peter, Janssen, William J., Griesmer, Christine, VerBurg, Olivia, Hyzy, Robert C., Park, Pauline K., Nelson, Kristine, McSparron, Jake I., Co, Ivan N., Wang, Bonnie R., Jimenez, Jose, Olbrich, Norman, McDonough, Kelli, Jia, Shijing, Hanna, Sinan, Gong, Michelle N., Richardson, Lynne D., Nair, Rahul, Lopez, Brenda, Amosu, Omowunmi, Offor, Obiageli, Tzehaie, Hiwet, Nkemdirim, William, Boujid, Sabah, Mosier, Jarrod M., Hypes, Cameron, Campbell, Elizabeth Salvagio, Bixby, Billie, Gilson, Boris, Lopez, Anitza, Bime, Christian, Parthasarathy, Sairam, Cano, Ariana M., Hite, R. Duncan, Terndrup, Thomas E., Wiedemann, Herbert P., Hudock, Kristin, Tanzeem, Hammad, More, Harshada, Martinkovic, Jamie, Sellers, Susan, Houston, Judy, Burns, Mary, Kiran, Simra, Roads, Tammy, Kennedy, Sarah, Duggal, Abhijit, Thiruchelvam, Nirosshan, Ashok, Kiran, King, Alexander H., Mehkri, Omar, Dugar, Siddharth, Sahoo, Debasis, Yealy, Donald M., Angus, Derek C., Weissman, Alexandra J., Vita, Tina M., Berryman, Emily, Hough, Catherine L., Khan, Akram, Krol, Olivia F., Mills, Emmanuel, Kinjal, Mistry, Briceno, Genesis, Reddy, Raju, Hubel, Kinsley, Jouzestani, Milad K., McDougal, Madeline, Deshmukh, Rupali, Johnston, Nicholas J., Robinson, Bryce H., Gundel, Staphanie J., Katsandres, Sarah C., Chen, Peter, Torbati, Sam S., Parimon, Tanyalak, Caudill, Antonina, Mattison, Brittany, Jackman, Susan E., Chen, Po-En, Bayoumi, Emad, Ojukwu, Cristabelle, Fine, Devin, Weissberg, Gwendolyn, Isip, Katherine, Choi-Kuaea, Yunhee, Mehdikhani, Shaunt, Dar, Tahir B., Fleury Augustin, Nsole Biteghe, Tran, Dana, Dukov, Jennifer Emilow, Matusov, Yuri, Choe, June, Hindoyan, Niree A., Wynter, Timothy, Pascual, Ethan, Clapham, Gregg J., Herrera, Lisa, Caudill, Antonia, O’Mahony, D. Shane, Nyatsatsang, Sonam T., Wilson, David M., Wallick, Julie A., Duven, Alexandria M., Fletcher, Dakota D., Miller, Chadwick, Files, D. Clark, Gibbs, Kevin W., Flores, Lori S., LaRose, Mary E., Landreth, Leigha D., Palacios, D. Rafael, Parks, Lisa, Hicks, Madeline, Goodwin, Andrew J., Kilb, Edward F., Lematty, Caitlan T., Patti, Kerilyn, Grady, Abigail, Rasberry, April, Morris, Peter E., Sturgill, Jamie L., Cassity, Evan P., Dhar, Sanjay, Montgomery-Yates, Ashley A., Pasha, Sarah N., Mayer, Kirby P., Pharm.D., Brittany Bissel, Trott, Terren, Rehman, Shahnaz, de Wit, Marjolein, Mason, Jessica, Bledsoe, Joseph, Knowlton, Kirk U., Brown, Samuel, Lanspa, Michael, Leither, Lindsey, Pelton, Ithan, Armbruster, Brent P., Montgomery, Quinn, Kumar, Naresh, Fergus, Melissa, Imel, Karah, Palmer, Ghazal, Webb, Brandon, Klippel, Carolyn, Jensen, Hannah, Duckworth, Sarah, Gray, Andrew, Burke, Tyler, Knox, Dan, Lumpkin, Jenna, Aston, Valerie T., Applegate, Darrin, Serezlic, Erna, Brown, Katie, Merril, Mardee, Harris, Estelle S., Middleton, Elizabeth A., Barrios, Macy A.G., Greer, Jorden, Schmidt, Amber D., Webb, Melissa K., Paine, Roert, Callahan, Sean J., Waddoups, Lindsey J., Yamane, Misty B., Self, Wesley H., Rice, Todd W., Casey, Jonathan D., Johnson, Jakea, Gray, Christopher, Hays, Margaret, Roth, Megan, Menon, Vidya, Kasubhai, Moiz, Pillai, Anjana, Daniel, Jean, Sittler, Daniel, Kanna, Balavenkatesh, Jilani, Nargis, Amaro, Francisco, Santana, Jessica, Lyakovestsky, Aleksandr, Madhoun, Issa, Desroches, Louis Marie, Amadon, Nicole, Bahr, Alaa, Ezzat, Imaan, Guerrero, Maryanne, Padilla, Joane, Fullmer, Jessie, Singh, Inderpreet, Ali Shah, Syed Hamad, Narang, Rajeev, Mock, Polly, Shadle, Melissa, Hernandez, Brenda, Welch, Kevin, Payne, Andrea, Ertl, Gabriela, Canario, Daniel, Barrientos, Isabel, Goss, Danielle, DeVries, Mattie, Folowosele, Ibidolapo, Garner, Dorothy, Gomez, Mariana, Price, Justin, Bansal, Ekta, Wong, Jim, Faulhaber, Jason, Fazili, Tasaduq, Yeary, Brian, Ndolo, Ruth, Bryant, Christina, Smigeil, Bridgette, Robinson, Philip, Najjar, Rana, Jones, Patrice, Nguyen, Julie, Chin, Christina, Taha, Hassan, Najm, Salah, Smith, Christopher, Moore, Jason, Nassar, Talal, Gallinger, Nick, Christian, Amy, Mauer, D’Amber, Phipps, Ashley, Waters, Michael, Zepeda, Karla, Coslet, Jordan, Landazuri, Rosalynn, Pineda, Jacob, Uribe, Nicole, Garcia, Jose Ruiz, Barbabosa, Cecilia, Sandler, Kaitlyn, Overcash, J. Scott, Marquez, Adrienna, Chu, Hanh, Lee, Kia, Quillin, Kimberly, Garcia, Andrea, Lew, Pauline, Rogers, Ralph, Shehadeh, Fadi, Mylona, Evangelia K., Kaczynski, Matthew, Tran, Quynh-Lam, Benitez, Gregorio, Mishra, Biswajit, Felix, Lewis Oscar, Vafea, Maria Tsikala, Atalla, Eleftheria, Davies, Robin, Hedili, Salma, Monkeberg, Maria Andrea, Tabler, Sandra, Harrington, Britt, Meegada, Sreenath, Koripalli, Venkata Sandeep, Muddana, Prithvi, Jain, Lakshay, Undavalli, Chaitanya, Kavya, Parasa, Ibiwoye, Mofoluwaso, Akilo, Hameed, Lovette, Bryce D., Wylie, Jamie-Crystal, Smith, Diana M., Poon, Kenneth, Eckardt, Paula, Heysu, Rubio-Gomez, Sundararaman, Nithya, Alaby, Doris, Sareli, Candice, Sánchez, Adriana, Popielski, Laura, Kambo, Amy, Viens, Kimberley, Turner, Melissa, Vjecha, Michael J., Weintrob, Amy, Brar, Indira, Markowitz, Norman, Pastor, Erika, Corpuz, Roweena, Alangaden, George, McKinnon, John, Ramesh, Mayur, Herc, Erica, Yared, Nicholas, Lanfranco, Odaliz Abreu, Rivers, Emanuel, Swiderek, Jennifer, Gupta, Ariella Hodari, Pabla, Pardeep, Eliya, Sonia, Jazrawi, Jehan, Delor, Jeremy, Desai, Mona, Cook, Aaron, Jaehne, Anja Kathrina, Gill, Jasreen Kaur, Renaud, Sheri, Sarveswaran, Siva, Gardner, Edward, Scott, James, Bianchini, Monica, Melvin, Casey, Kim, Gina, Wyles, David, Kamis, Kevin, Miller, Rachel, Douglas, Ivor, Haukoos, Jason, Hicks, Carrie, Lazarte, Susana, Marines-Price, Rubria, Osuji, Alice, Agbor Agbor, Barbine Tchamba, Petersen, Tianna, Kamel, Dena, Hansen, Laura, Garcia, Angie, Cha, Christine, Mozaffari, Azadeh, Hernandez, Rosa, Cutrell, James, Kim, Mina, DellaValle, Natalie, Gonzales, Sonia, Somboonwit, Charurut, Oxner, Asa, Guerra, Lucy, Hayes, Michael, Nguyen, Thi, Tran, Thanh, Pinto, Avenette, Hatlen, Timothy, Anderson, Betty, Zepeda-Gutierrez, Ana, Martin, Dannae, Temblador, Cindi, Cuenca, Avon, Tanoviceanu, Roxanne, Prieto, Martha, Guerrero, Mario, Daar, Eric, Correa, Ramiro, Hartnell, Gabe, Wortmann, Glenn, Doshi, Saumil, Moriarty, Theresa, Gonzales, Melissa, Garman, Kristin, Baker, Jason V., Frosch, Anne, Goldsmith, Rachael, Driver, Brian, Frank, Christine, Leviton, Tzivia, Prekker, Matthew, Jibrell, Hodan, Lo, Melanie, Klaphake, Jonathan, Mackedanz, Shari, Ngo, Linh, Garcia-Myers, Kelly, Kunisaki, Ken M., Wendt, Chris, Melzer, Anne, Wetherbee, Erin, Drekonja, Dimitri, Pragman, Alexa, Hamel, Aimee, Thielen, Abbie, Hassler, Miranda, Walquist, Mary, Augenbraun, Michael, George, Jensen, Demeo, Lynette, Mishko, Motria, Thomas, Lorraine, Tatem, Luis, Dehovitz, Jack, Abassi, Mahsa, Leuck, Anne-Marie, Rao, Via, Pullen, Matthew, Luke, Darlette, LaBar, Derek, Christiansen, Theresa, Howard, Diondra, Biswas, Kousick, Harrington, Cristin, Garcia, Amanda, Bremer, Tammy, Burke, Tara, Koker, Brittany, Davis-Karim, Anne, Pittman, David, Vasudeva, Shikha S., Johnstone, Jaylynn R., Agnetti, Kate, Davis, Ruby, Trautner, Barbara, Hines-Munson, Casey, Van, John, Dillon, Laura, Wang, Yiqun, Nagy-Agren, Stephanie, Vasudeva, Shikha, Ochalek, Tracy, Caldwell, Erin, Humerickhouse, Edward, Boone, David, McGraw, William, Looney, David J., Mehta, Sanjay R., Johns, Scott Thompson, St. John, Melissa, Raceles, Jacqueline, Sear, Emily, Funk, Stephen, Cesarini, Rosa, Fang, Michelle, Nicalo, Keith, Drake, Wonder, Jones, Beatrice, Holtman, Teresa, Nguyen, Hien H., Maniar, Archana, Johnson, Eric A., Nguyen, Lam, Tran, Michelle T., Barrett, Thomas W., Johnston, Tera, Huggins, John T., Beiko, Tatsiana Y., Hughes, Heather Y., McManigle, William C., Tanner, Nichole T., Washburn, Ronald G., Ardelt, Magdalena, Tuohy, Patricia A., Mixson, Jennifer L., Hinton, Charles G., Thornley, Nicola, Allen, Heather, Elam, Shannon, Boatman, Barry, Baber, Brittany J., Ryant, Rudell, Roller, Brentin, Nguyen, Chinh, Mikail, Amani Morgan, Research, Marivic Hansen, Lichtenberger, Paola, Baracco, Gio, Ramos, Carol, Bjork, Lauren, Sueiro, Melyssa, Tien, Phyllis, Freasier, Heather, Buck, Theresa, Nekach, Hafida, Holodniy, Mark, Chary, Aarthi, Lu, Kan, Peters, Theresa, Lopez, Jessica, Tan, Susanna Yu, Lee, Robert H., Asghar, Aliya, Karyn Isip, Tasadduq Karim, Le, Katherine, Nguyen, Thao, Wong, Shinn, Raben, Dorthe, Murray, Daniel D., Jensen, Tomas O., Peters, Lars, Aagaard, Bitten, Nielsen, Charlotte B., Krapp, Katharina, Nykjær, Bente Rosdahl, Olsson, Christina, Kanne, Katja Lisa, Grevsen, Anne Louise, Joensen, Zillah Maria, Bruun, Tina, Bojesen, Ane, Woldbye, Frederik, Normand, Nick E., Esman, Frederik V.L., Benfield, Thomas, Clausen, Clara Lundetoft, Hovmand, Nichlas, Israelsen, Simone Bastrup, Iversen, Katrine, Leding, Caecilie, Pedersen, Karen Brorup, Thorlacius-Ussing, Louise, Tinggaard, Michaela, Tingsgard, Sandra, Krohn-Dehli, Louise, Pedersen, Dorthe, Villadsen, Signe, Staehr Jensen, Jens-Ulrik, Overgaard, Rikke, Rastoder, Ema, Heerfordt, Christian, Hedsund, Caroline, Ronn, Christian Phillip, Kamstrup, Peter Thobias, Hogsberg, Dorthe Sandbaek, Bergsoe, Christina, Søborg, Christian, Hissabu, Nuria M.S., Arp, Bodil C., Ostergaard, Lars, Staerke, Nina Breinholt, Yehdego, Yordanos, Sondergaard, Ane, Johansen, Isik S., Pedersen, Andreas Arnholdt, Knudtzen, Fredrikke C., Larsen, Lykke, Hertz, Mathias A., Fabricius, Thilde, Holden, Inge K., Lindvig, Susan O., Helleberg, Marie, Gerstoft, Jan, Kirk, Ole, Jensen, Tomas Ostergaard, Madsen, Birgitte Lindegaard, Pedersen, Thomas Ingemann, Harboe, Zitta Barrella, Roge, Birgit Thorup, Hansen, Thomas Michael, Glesner, Matilde Kanstrup, Lofberg, Sandra Valborg, Nielsen, Ariella Denize, Leicht von Huth, Sebastian, Nielsen, Henrik, Thisted, Rikke Krog, Petersen, Kristine Toft, Juhl, Maria Ruwald, Podlekareva, Daria, Johnsen, Stine, Andreassen, Helle Frost, Pedersen, Lars, Clara Ellinor Lindnér, Cecilia Ebba, Wiese, Lothar, Knudsen, Lene Surland, Skrøder Nytofte, Nikolaj Julian, Havmøller, Signe Ravn, Expósito, Maria, Badillo, José, Martínez, Ana, Abad, Elena, Chamorro, Ana, Figuerola, Ariadna, Mateu, Lourdes, España, Sergio, Lucero, Maria Constanza, Santos, José Ramón, Lladós, Gemma, Lopez, Cristina, Carabias, Lydia, Molina-Morant, Daniel, Loste, Cora, Bracke, Carmen, Siles, Adrian, Fernández-Cruz, Eduardo, Di Natale, Marisa, Padure, Sergiu, Gomez, Jimena, Ausin, Cristina, Cervilla, Eva, Balastegui, Héctor, Sainz, Carmen Rodríguez, Lopez, Paco, Carbone, Javier, Escobar, Mariam, Balerdi, Leire, Legarda, Almudena, Roldan, Montserrat, Letona, Laura, Muñoz, José, Camprubí, Daniel, Arribas, Jose R., Sánchez, Rocio Montejano, Díaz-Pollán, Beatriz, Stewart, Stefan Mark, Garcia, Irene, Borobia, Alberto, Mora-Rillo, Marta, Estrada, Vicente, Cabello, Noemi, Nuñez-Orantos, M.J., Sagastagoitia, I., Homen, J.R., Orviz, E., Montalvá, Adrián Sánchez, Espinosa-Pereiro, Juan, Bosch-Nicolau, Pau, Salvador, Fernando, Burgos, Joaquin, Morales-Rull, Jose Luis, Moreno Pena, Anna Maria, Acosta, Cristina, Solé-Felip, Cristina, Horcajada, Juan P., Sendra, Elena, Castañeda, Silvia, López-Montesinos, Inmaculada, Gómez-Junyent, Joan, Gonzáles, Carlota Gudiol, Cuervo, Guilermo, Pujol, Miquel, Carratalà, Jordi, Videla, Sebastià, Günthard, Huldrych, Braun, Dominique L., West, Emily, M’Rabeth-Bensalah, Khadija, Eichinger, Mareile L., Grüttner-Durmaz, Manuela, Grube, Christina, Zink, Veronika, pharmacist, Goes pharmacist, Josefine, Fätkenheuer, Gerd, Malin, Jakob J., Tsertsvadze, Tengiz, Abutidze, Akaki, Chkhartishvili, Nikoloz, Metchurtchlishvili, Revaz, Endeladze, Marina, Paciorek, Marcin, Bursa, Dominik, Krogulec, Dominika, Pulik, Piotr, Ignatowska, Anna, Horban, Andrzej, Bakowska, Elzbieta, Kowaska, Justyna, Bednarska, Agnieszka, Jurek, Natalia, Skrzat-Klapaczynska, Agata, Bienkowski, Carlo, Hackiewicz, Malgorzata, Makowiecki, Michal, Platowski, Antoni, Fishchuk, Roman, Kobrynska, Olena, Levandovska, Khrystyna, Kirieieva, Ivanna, Kuziuk, Mykhailo, Naucler, Pontus, Perlhamre, Emma, Mazouch, Lotta, Kelleher, Anthony, Polizzotto, Mark, Carey, Catherine, Chang, Christina C., Hough, Sally, Virachit, Sophie, Davidson, Sarah, Bice, Daniel J., Ognenovska, Katherine, Cabrera, Gesalit, Flynn, Ruth, Young, Barnaby E., Chia, Po Ying, Lee, Tau Hong, Lin, Ray J., Lye, David C., Ong, Sean W.X., Puah, Ser Hon, Yeo, Tsin Wen, Diong, Shiau Hui, Ongko, Juwinda, Yeo, He Ping, Eriobu, Nnakelu, Kwaghe, Vivian, Zaiyad, Habib, Idoko, Godwin, Uche, Blessing, Selvamuthu, Poongulali, Kumarasamy, Nagalingeswaran, Beulah, Faith Ester, Govindarajan, Narayan, Mariyappan, Kowsalya, Losso, Marcelo H., Abela, Cecilia, Moretto, Renzo, Belloc, Carlos G., Ludueña, Jael, Amar, Josefina, Toibaro, Javier, Macias, Laura Moreno, Fernandez, Lucia, Frare, Pablo S., Chaio, Sebastian R., Pachioli, Valeria, Timpano, Stella M., Sanchez, Marisa del Lujan, de Paz Sierra, Mariana, Stanek, Vanina, Belloso, Waldo, Cilenti, Flavia L., Valentini, Ricardo N., Stryjewski, Martin E., Locatelli, Nicolas, Soler Riera, Maria C., Salgado, Clara, Baeck, Ines M., Di Castelnuovo, Valentina, Zarza, Stella M., Hudson, Fleur, Parmar, Mahesh K.B., Goodman, Anna L., Dphil, Badrock, Jonathan, Gregory, Adam, Goodall, Katharine, Harris, Nicola, Wyncoll, James, Bhagani, S., Rodger, A., Luntiel, A., Patterson, C., Morales, J., Witele, E., Preston, A.-M., Nandani, A., Price, D.A., Hanrath, Aiden, Nell, Jeremy, Patel, Bijal, Hays, Carole, Jones, Geraldine, Davidson, Jade, Bawa, T., Mathews, M., Mazzella, A., Bisnauthsing, K., Aguilar-Jimenez, L., Borchini, F., Hammett, S., Touloumi, Giota, Pantazis, Nikos, Gioukari, Vicky, Souliou, Tania, Antoniadou, A., Protopapas, K., Kavatha, D., Grigoropoulou, S., Oikonomopoulo, C., Moschopoulos, C., Koulouris, N.G., Tzimopoulos, K., Koromilias, A., Argyraki, K., Lourida, P., Bakakos, P., Kalomenidis, I., Vlachakos, V., Barmparessou, Z., Balis, E., Zakynthinos, S., Sigala, I., Gianniou, N., Dima, E., Magkouta, S., Synolaki, E., Konstanta, S., Vlachou, M., Stathopoulou, P., Panagopoulos, P., Petrakis, V., Papazoglou, D., Tompaidou, E., Isaakidou, E., Poulakou, G., Rapti, V., Leontis, K., Nitsotolis, T., Athanasiou, K., Syrigos, K., Kyriakoulis, K., Trontzas, I., Arfara-Melanini, M., Kolonis, V., Kityo, Cissy, Mugerwa, Henry, Kiweewa, Francis, Kimuli, Ivan, Lukaakome, Joseph, Nsereko, Christoher, Lubega, Gloria, Kibirige, Moses, Nakahima, William, Wangi, Deus, Aguti, Evelyne, Generous, Lilian, Massa, Rosemary, Nalaki, Margaret, Magala, Felix, Nabaggala, Phiona Kaweesi, Kidega, Robert, Faith, Oryem Daizy, Florence, Apio, Emmanuel, Ocung, Beacham, Mugoonyi Paul, Geoffrey, Amone, Nakiboneka, Dridah, Apiyo, Paska, Kirenga, Bruce, Atukunda, Angella, Muttamba, Winters, Remmy, Kyeyume, Segawa, Ivan, Pheona, Nsubuga, Kigere, David, Mbabazi, Queen Lailah, Boersalino, Ledra, Nyakoolo, Grace, Fred, Aniongo, Alupo, Alice, Ebong, Doryn, Monday, Edson, Nalubwama, Ritah Norah, Kainja, Milton, Ambrose, Munu, Kwehayo, Vanon, Nalubega, Mary Grace, Ongoli, Augustine, Obbo, Stephen, Sebudde, Nicholus, Alaba, Jeniffer, Magombe, Geoffrey, Tino, Harriet, Obonya, Emmanuel, Lutaakome, Joseph, Kitonsa, Jonathan, Onyango, Martin, Naboth, Tukamwesiga, Naluyinda, Hadijah, Nanyunja, Regina, Irene, Muttiibwa, Jane, Biira, Wimfred, Kyobejja, Leonard, Ssemazzi, Deus, Tkiinomuhisha, Babra, Namasaba, Taire, Paul, Nabankema, Evelyn, Ogavu, Joseph, Mugerwa, Oscar, Okoth, Ivan, Mwebaze, Raymond, Mugabi, Timothy, Makhoba, Anthony, Arikiriza, Phiona, Theresa, Nabuuma, Nakayima, Hope, Frank, Kisuule, Ramgi, Patrícia, Pereira, Kássia, Osinusi, Anu, Cao, Huyen, Klekotka, Paul, Price, Karen, Nirula, Ajay, Osei, Suzette, Tipple, Craig, Wills, Angela, Peppercorn, Amanda, Watson, Helen, Gupta, Rajesh, Alexander, Elizabeth, Mogalian, Erik, Lin, Leo, Ding, Xiao, Margolis, David, Yan, Li, Girardet, Jean-Luc, Ma, Ji, Hong, Zhi, Zhu, Quing, Seegobin, Seth, Gibbs, Michael, Latchman, Mickel, Hasior, Katarzyna, Bouquet, Jerome, Wei, Jianxin, Streicher, Katie, Schmelzer, Albert, Brooks, Dennis, Butcher, Jonny, Tonev, Dimitar, Arbetter, Douglas, Damstetter, Philippe, Legenne, Philippe, Stumpp, Michael, Goncalves, Susana, Ramanathan, Krishnan, Chandra, Richa, Baseler, Beth, Teitelbaum, Marc, Schechner, Adam, Holley, H. Preston, Jankelevich, Shirley, Becker, Nancy, Dolney, Suzanne, Hissey, Debbie, Simpson, Shelly, Kim, Mi Ha, Beeler, Joy, Harmon, Liam, Asomah, Mabel, Jato, Yvonne, Stottlemyer, April, Tang, Olivia, Vanderpuye, Sharon, Yeon, Lindsey, Buehn, Molly, Eccard-Koons, Vanessa, Frary, Sadie, MacDonald, Leah, Cash, Jennifer, Hoopengardner, Lisa, Linton, Jessica, Schaffhauser, Marylu, Nelson, Michaela, Spinelli-Nadzam, Mary, Proffitt, Calvin, Lee, Christopher, Engel, Theresa, Fontaine, Laura, Osborne, C.K., Hohn, Matt, Galcik, Michael, Thompson, DeeDee, Kopka, Stacey, Shelley, Denise M., Mendez, Gregg, Brown, Shawn, Albert, Sara, Balde, Abby, Baracz, Michelle, Bielica, Mona, Billouin-Frazier, Shere, Choudary, Jay, Dixon, Mary, Eyler, Carolyn, Frye, Leanne, Gertz, Jensen, Giebeig, Lisa, Gulati, Neelam, Hankinson, Liz, Hogarty, Debi, Huber, Lynda, Krauss, Gary, Lake, Eileen, Manandhar, Meryan, Rudzinski, Erin, Sandrus, Jen, Suders, Connie, Natarajan, Ven, Rupert, Adam W., Baseler, Michael, Lynam, Danielle, Imamichi, Tom, Laverdure, Sylvain, McCormack, Ashley, Paudel, Sharada, Cook, Kyndal, Haupt, Kendra, Khan, Ayub, Hazen, Allison, Badralmaa, Yunden, Smith, Kenneth, Patel, Bhakti, Kubernac, Amanda, Kubernac, Robert, Hoover, Marie L., Solomon, Courtney, Rashid, Marium, Murphy, Joseph, Brown, Craig, DuChateau, Nadine, Ellis, Sadie, Flosi, Adam, Fox, Lisa, Johnson, Les, Nelson, Rich, Stojanovic, Jelena, Treagus, Amy, Wenner, Christine, Williams, Richard, Jensen, Tomas O, Murray, Thomas A, Grandits, Greg A, Jain, Mamta K, Shaw-Saliba, Kathryn, Matthay, Michael A, Baker, Jason V, Dewar, Robin L, Goodman, Anna L, Hatlen, Timothy J, Highbarger, Helene C, Lallemand, Perrine, Leshnower, Bradley G, Looney, David, Moschopoulos, Charalampos D, Murray, Daniel D, Mylonakis, Eleftherios, Rehman, M Tauseef, Rupert, Adam, Stevens, Randy, Turville, Stuart, Wick, Katherine, Lundgren, Jens, and Ko, Emily R

Published
2024
Full Text
View/download PDF

32. Improved Analysis of Online Balanced Clustering

Author

Bienkowski, Marcin, Böhm, Martin, Koutecký, Martin, Rothvoß, Thomas, Sgall, Jiří, and Veselý, Pavel

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the online balanced graph repartitioning problem, one has to maintain a clustering of $n$ nodes into $\ell$ clusters, each having $k = n / \ell$ nodes. During runtime, an online algorithm is given a stream of communication requests between pairs of nodes: an inter-cluster communication costs one unit, while the intra-cluster communication is free. An algorithm can change the clustering, paying unit cost for each moved node. This natural problem admits a simple $O(\ell^2 \cdot k^2)$-competitive algorithm COMP, whose performance is far apart from the best known lower bound of $\Omega(\ell \cdot k)$. One of open questions is whether the dependency on $\ell$ can be made linear; this question is of practical importance as in the typical datacenter application where virtual machines are clustered on physical servers, $\ell$ is of several orders of magnitude larger than $k$. We answer this question affirmatively, proving that a simple modification of COMP is $(\ell \cdot 2^{O(k)})$-competitive. On the technical level, we achieve our bound by translating the problem to a system of linear integer equations and using Graver bases to show the existence of a ``small'' solution.

Published
2021

33. Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times

Author

Bienkowski, Marcin, Kraska, Artur, and Liu, Hsiang-Hsuan

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We present a unified framework for minimizing average completion time for many seemingly disparate online scheduling problems, such as the traveling repairperson problems (TRP), dial-a-ride problems (DARP), and scheduling on unrelated machines. We construct a simple algorithm that handles all these scheduling problems, by computing and later executing auxiliary schedules, each optimizing a certain function on already seen prefix of the input. The optimized function resembles a prize-collecting variant of the original scheduling problem. By a careful analysis of the interplay between these auxiliary schedules, and later employing the resulting inequalities in a factor-revealing linear program, we obtain improved bounds on the competitive ratio for all these scheduling problems. In particular, our techniques yield a $4$-competitive deterministic algorithm for all previously studied variants of online TRP and DARP, and a $3$-competitive one for the scheduling on unrelated machines (also with precedence constraints). This improves over currently best ratios for these problems that are $5.14$ and $4$, respectively. We also show how to use randomization to further reduce the competitive ratios to $1+2/\ln 3 < 2.821$ and $1+1/\ln 2 < 2.443$, respectively. The randomized bounds also substantially improve the current state of the art. Our upper bound for DARP contradicts the lower bound of 3 given by Fink et al. (Inf. Process. Lett. 2009); we pinpoint a flaw in their proof., Comment: ICALP 2021

Published
2021

34. Knowledge and Awareness of Risk Factors for HIV Infection and about HIV Testing among Medical Students in Warsaw

Author

Justyna Kowalska, Martyna Cholewik, Carlo Bieńkowski, Aleksandra Maciejczyk, Dominik Bursa, and Agata Skrzat-Klapaczyńska

Subjects
HIV, self-testing, students, risk behaviors, late diagnosis, Microbiology, QR1-502
Abstract

Background: The number of late diagnoses of HIV remains very high in Poland, leading to a high proportion of patients developing and dying of HIV-related diseases. The main reason for this is the very low utilization of HIV testing. Our analyses aimed to investigate knowledge about the indications for HIV testing among medical university students, as well as identify their own HIV testing experiences. Material and methods: A cross-sectional survey study was designed to collect information on the students’ demographics and their experiences of HIV testing, as well as their knowledge of virus transmission and the indications for testing. Data were collected as part of the HIV_week@WUM project conducted at the Medical University of Warsaw in parallel with the 18th European AIDS Conference, which took place in Warsaw between 18 and 21 October 2023. Results: In total, 545 questionnaires were collected. The median age of the study participants was 20 (interquartile range (IQR): 19–22 years). The majority of respondents were as follows: women (67.5%), born in Poland (97.8%), and were attending the medical faculty (56.7%). Only 114 (21.43%) participants had ever been tested for HIV. For all modes of HIV transmission, most of the respondents overestimated the risk of acquiring HIV, but, at the same time, they had never been tested for HIV. Conclusions: Only one in five health sciences students has ever had a test for HIV, which is less than estimates for the general population of Warsaw. There is an ongoing need to popularize testing among future health care providers in order to address both the indications for testing for individuals and the better use of HIV testing in clinical practice.

Published
2024
Full Text
View/download PDF

35. Experimental Validation of a Multi-objective Planning Decision Support System for Ship Routing Under Time Stress

Author

Macesker, Matthew, Pattipati, Krishna R., Sidoti, David, Bienkowski, Adam, Zhang, Lingyi, Kleinman, David L., McGuire, Mollie, Uziel, Steven, Basu Roy, Senjuti, Primerano, Francesco, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Degen, Helmut, editor, and Ntoa, Stavroula, editor

Published
2023
Full Text
View/download PDF

36. Plasmonic electrochemical cells

Author

Małgorzata Jakubowska, Aleksandra Parzuch, Krzysztof Bieńkowski, Renata Solarska, and Piotr Wróbel

Subjects
plasmonics, photoelectrochemical cells, plasmonic nanoparticles, Technology
Abstract

The constantly growing global demand for clean energy forces the development of technologiesproducing efficient and renewable energy sources. One direction of development is thin-film photovoltaicsystems that allow for the efficient conversion of solar energy to electrical or chemical energy andtheir usage in production of hydrogen, which is one of the most promising elements for storing greenenergy. The efficiency of photovoltaic systems is determined, among others factors, by properties ofa semiconductor in which light is absorbed and electron-hole pairs are generated. The efficiency ofthis process can be increased by using surface plasmon resonance induced on metallic nanoparticleslocated on the surface or inside the active material. Collective oscillations of the electron plasma excitedin the nanoparticle lead to trapping and enhancement of the electromagnetic field, which, resonantlyscattered to the active layer, increases the absorption in the cell. The selection of the material, size andshape of the nanoparticles allows spectral tuning of the absorption in the system. This study aims toimprove the efficiency of electrochemical cells with copper oxide electrodes by incorporating silvernanoparticles doped with palladium. The nanoparticles were prepared using physical vapour deposition.The fabricated structures were optically characterised by spectrophotometry and SE M microscopy.The conducted research demonstrates an increase in cell efficiency depending on the shape and sizeof the applied nanoparticles. The best results were obtained for systems subjected to post-depositionannealing, resulting in improved chemical stability and optical response of nanoparticles.Keywords: plasmonics, photoelectrochemical cells, plasmonic nanoparticles

Published
2023
Full Text
View/download PDF

37. Caught in a Matrix of Factors: A Pilot Study of Female Retirees Receiving Below-Minimum Pension Payments

Author

Stefan Bieńkowski and Danuta Życzyńska-Ciołek

Subjects
below-minimum pension, retirement, employment career, life course approach, poland, Sociology (General), HM401-1281
Abstract

Pension systems based on an insurance model were originally designed for male breadwinners who worked under permanent contracts without career breaks. Since their inception, women’s participation in the workforce has increased significantly, but on average, their employment career paths are still shorter and less linear compared to those that men enjoy. Demographic changes have prompted many countries to reform their pension systems to ensure long-term financial sustainability. And to varying degrees, such reforms also have looked to address the issue of short careers. In Poland, reforms introduced in 1999 brought about significant changes to the rules governing pension entitlement. That led to the emergence of a new category of retirees—those who had contributed to the pension system for a short period and consequently received very low pensions. This article provides an overview of an exploratory qualitative pilot study conducted in 2018 with nine women who were in receipt of benefits from the Polish universal pension system, which amounted to less than the so-called ‘lowest retirement pension’ being granted at that time. The analysis makes recourse to the concept of employment career and its connection to retirement to identify various life-course determinants that contributed to their situation. These factors include childhood and adolescent adversities that affected educational attainment; domestic and caregiving responsibilities coupled with cultural expectations and insufficient institutional support; the labor market situation, and the inability to document certain employment periods. The research material indicates that a significant portion of the work performed by the interviewees throughout their lives did not translate into a pension benefit, as it either involved unpaid domestic and caregiving duties; or work performed without formal contracts.

Published
2023
Full Text
View/download PDF

39. Heterogeneity in precision oncology

Author

Bartłomiej Tomasik, Filip Garbicz, Marcin Braun, Michał Bieńkowski, and Jacek Jassem

Subjects
cancer, precision oncology, genomics, tumour heterogeneity, proteomics, Internal medicine, RC31-1245, Therapeutics. Pharmacology, RM1-950
Abstract

Precision oncology is a rapidly evolving concept that holds great promise in cancer treatment. However, a cancer complexity attributed to genomic and acquired tumour heterogeneity limits treatment effectiveness and increases toxicity. These limitations refer to both systemic therapies and radiotherapy, which are two mainstays of non-invasive cancer treatment. By understanding cancer heterogeneity and utilising advanced tools to personalise treatment strategies, precision oncology has the potential to revolutionise cancer care. In this article, we review the current status of precision oncology in solid tumours, specifically focusing on the impact of tumour heterogeneity and genomic patient features on systemic therapies and radiation. We also discuss the implementation of novel tools, such as next-generation sequencing and liquid biopsies, to overcome this problem.

Published
2024
Full Text
View/download PDF

40. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location

Author

Bienkowski, Marcin, Feldkord, Björn, and Schmidt, Paweł

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the online non-metric variant of the facility location problem, there is a given graph consisting of a set $F$ of facilities (each with a certain opening cost), a set $C$ of potential clients, and weighted connections between them. The online part of the input is a sequence of clients from $C$, and in response to any requested client, an online algorithm may open an additional subset of facilities and must connect the given client to an open facility. We give an online, polynomial-time deterministic algorithm for this problem, with a competitive ratio of $O(\log |F| \cdot (\log |C| + \log \log |F|))$. The result is optimal up to loglog factors. Our algorithm improves over the $O((\log |C| + \log |F|) \cdot (\log |C| + \log \log |F|))$-competitive construction that first reduces the facility location instance to a set cover one and then later solves such instance using the deterministic algorithm by Alon et al. [TALG 2006]. This is an asymptotic improvement in a typical scenario where $|F| \ll |C|$. We achieve this by a more direct approach: we design an algorithm for a fractional relaxation of the non-metric facility location problem with clustered facilities. To handle the constraints of such non-covering LP, we combine the dual fitting and multiplicative weight updates approach. By maintaining certain additional monotonicity properties of the created fractional solution, we can handle the dependencies between facilities and connections in a rounding routine. Our result, combined with the algorithm by Naor et al. [FOCS 2011] yields the first deterministic algorithm for the online node-weighted Steiner tree problem. The resulting competitive ratio is $O(\log k \cdot \log^2 \ell)$ on graphs of $\ell$ nodes and $k$ terminals., Comment: STACS 2021

Published
2020

41. Online Dynamic B-Matching With Applications to Reconfigurable Datacenter Networks

Author

Bienkowski, Marcin, Fuchssteiner, David, Marcinkowski, Jan, and Schmid, Stefan

Subjects
Computer Science - Networking and Internet Architecture, Computer Science - Data Structures and Algorithms, F.2, C.2.1
Abstract

This paper initiates the study of online algorithms for the maximum weight $b$-matching problem, a generalization of maximum weight matching where each node has at most $b \geq 1$ adjacent matching edges. The problem is motivated by emerging optical technologies which allow to enhance datacenter networks with reconfigurable matchings, providing direct connectivity between frequently communicating racks. These additional links may improve network performance, by leveraging spatial and temporal structure in the workload. We show that the underlying algorithmic problem features an intriguing connection to online paging (a.k.a. caching), but introduces a novel challenge. Our main contribution is an online algorithm which is $O(b)$-competitive; we also prove that this is asymptotically optimal. We complement our theoretical results with extensive trace-driven simulations, based on real-world datacenter workloads as well as synthetic traffic traces.

Published
2020

42. An Optimal Algorithm for Online Multiple Knapsack

Author

Bienkowski, Marcin, Pacut, Maciej, and Piecuch, Krzysztof

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the online multiple knapsack problem, an algorithm faces a stream of items, and each item has to be either rejected or stored irrevocably in one of $n$ bins (knapsacks) of equal size. The gain of an~algorithm is equal to the sum of sizes of accepted items and the goal is to maximize the total gain. So far, for this natural problem, the best solution was the $0.5$-competitive algorithm First Fit (the result holds for any $n \geq 2$). We present the first algorithm that beats this ratio, achieving the competitive ratio of $1/(1+\ln(2))-O(1/n) \approx 0.5906 - O(1/n)$. Our algorithm is deterministic and optimal up to lower-order terms, as the upper bound of $1/(1+\ln(2))$ for randomized solutions was given previously by Cygan et al. [TOCS 2016]. Furthermore, we show that the lower-order term is inevitable for deterministic algorithms, by improving their upper bound to $1/(1+\ln(2))-O(1/n)$., Comment: To appear in the proceedings of ICALP 2020

Published
2020

45. Influence of Electromagnetic Field with Frequency of 50 Hz in form of Doses on Selected Biochemical Markers of Honey Bee

Author

Plotnik Mateusz, Bieńkowski Paweł, Berbeć Ewelina, Murawska Agnieszka, Latarowski Krzysztof, and Migdał Paweł

Subjects
biochemical markers, electromagnetic field, enzymatic markers, honey bee, 50 hz, Zoology, QL1-991
Abstract

The honey bee has a significant environmental and economic impact. While collecting food or water, bees are exposed to negative physical and chemical factors that lead to physiological and behavioral changes and, consequently, even death. Along with the development of technology and communication, electromagnetic fields produced by artificial emitters have begun to have an impact on the environment. The aim of the study was to check whether the electromagnetic field also impacts antioxidant enzymes functioning in the honey bee's organism. The study was conducted under laboratory conditions, and one-day and seven-day-old honey bee workers were used in the experiment. Honey bee workers were exposed to an electromagnetic field with a frequency of 50Hz and variable intensity in the range of 1–10 kV/m. Immediately after the end of the exposure, hemolymph was collected from the bees for biochemical analysis. The results of the research did not show clearly whether changes in the activity of biochemical markers were affected by the time spent in the electromagnetic field or its intensity but did show that there was a difference in physiology between one-day-old and seven-day-old bees.

Published
2023
Full Text
View/download PDF

46. Size matters: the impact of nucleus size on results from spatial transcriptomics

Author

Elyas Mohammadi, Katarzyna Chojnowska, Michał Bieńkowski, Anna Kostecka, Magdalena Koczkowska, Michał A. Żmijewski, Marcin Jąkalski, Martin Ingelsson, Natalia Filipowicz, Paweł Olszewski, Hanna Davies, Justyna M. Wierzbicka, Bradley T. Hyman, Jan P. Dumanski, Arkadiusz Piotrowski, and Jakub Mieczkowski

Subjects
Spatial transcriptomics, Cerebral cortex, Neuronal nuclei, Consecutive tissue sections, Data integration, Medicine
Abstract

Abstract Background Visium Spatial Gene Expression (ST) is a method combining histological spatial information with transcriptomics profiles directly from tissue sections. The use of spatial information has made it possible to discover new modes of gene expression regulations. However, in the ST experiment, the nucleus size of cells may exceed the thickness of a tissue slice. This may, in turn, negatively affect comprehensive capturing the transcriptomics profile in a single slice, especially for tissues having large differences in the size of nuclei. Methods Here, we defined the effect of Consecutive Slices Data Integration (CSDI) on unveiling accurate spot clustering and deconvolution of spatial transcriptomic spots in human postmortem brains. By considering the histological information as reference, we assessed the improvement of unsupervised clustering and single nuclei RNA-seq and ST data integration before and after CSDI. Results Apart from the escalated number of defined clusters representing neuronal layers, the pattern of clusters in consecutive sections was concordant only after CSDI. Besides, the assigned cell labels to spots matches the histological pattern of tissue sections after CSDI. Conclusion CSDI can be applied to investigate consecutive sections studied with ST in the human cerebral cortex, avoiding misinterpretation of spot clustering and annotation, increasing accuracy of cell recognition as well as improvement in uncovering the layers of grey matter in the human brain.

Published
2023
Full Text
View/download PDF

48. Immunological and Clinical Responses to Vaccinations among Adults Living with HIV

Author

Carlo Bieńkowski, Zuzanna Żak, Filip Fijołek, Martyna Cholewik, Maciej Stępień, Agata Skrzat-Klapaczyńska, and Justyna D. Kowalska

Subjects
HIV, vaccinations, prevention, Science
Abstract

People living with human immunodeficiency virus (HIV) are at higher risk of morbidity and mortality due to vaccine-preventable diseases. At the same time, they are less likely to respond to vaccinations, and might have a higher rate of vaccine adverse event and faster waning of protective effect. International and national guidelines emphasize the importance of vaccinating people living with HIV against respiratory system disease pathogens including seasonal influenza, Streptococcus pneumoniae, and COVID-19, as well as against sexually transmitted infections, i.e., Hepatitis A and B (HAV, HBV) and human papillomavirus (HPV). This narrative review aims to provide a comprehensive examination of the current knowledge regarding the immune and clinical responses elicited by vaccinations in the older adult population living with HIV.

Published
2024
Full Text
View/download PDF

49. Use of Panel Surveys to Measure Employment Precarity in a Cross-National Framework: An Integrated Approach to Harmonize Research Concepts and Longitudinal Data

Author

Katarzyna Kopycka, Anna Kiersztyn, Zbigniew Sawiński, Stefan Bieńkowski, and Viktoriia Sovpenchuk

Subjects
precarity index, precarious work, employment careers, sequence-based measures, cross-national comparability, panel surveys, Social sciences (General), H1-99
Abstract

In this article, we introduce a methodology to measure employment precarity in cross-country research based on individual career data from national panel surveys. First, we propose a measure of employment precarity, which is comparable across countries differing in their institutions, legal regulations and practices concerning the organization of labor relations. To address the comparability issues raised by using fixed-term employment indicators in the study of employment disadvantage, we conceptualize employment precarity in terms of sequences of labor market experiences, which carry a universal meaning as indicators of labor market attachment: non-employment, low income from work, and job separations. Drawing on recent developments in the field of sequence-based indices, we develop a Cross-National Precarity Index (CNPI) and test its performance using data on employment biographies from the German Socio-Economic Panel. We confirm good construct validity of the proposed measure by comparing its distribution across subpopulations as well as by assessing the statistical association between the index and typical correlates of precarious employment identified in the literature: employment status and life satisfaction. Second, we outline a methodological framework for the ex-post harmonization of career data gathered in various types of individual panel studies. Acknowledging the methodological differences between these studies, we propose adopting a common, calendar-based format for longitudinal data organization and constructing harmonization control variables to account for the recall and measurement bias resulting from the specific methodological solutions adopted in domestic surveys.

Published
2023
Full Text
View/download PDF

50. Radiotherapy-induced dynamic changes in the lymphocyte-to-monocyte ratio in patients with laryngeal cancer indicate poor prognosis

Author

Natalia Cichowska-Cwalińska, Michał Bieńkowski, Marta Popęda, Magdalena Dróżka, Jacek Rutkowski, Jacek Jassem, and Renata Zaucha

Subjects
lymphocyte-to-monocyte ratio (LMR), neutrophil to lymphocyte ratio (NLR), platelet to lymphocyte ratio (PLR), programmed death 1 ligand 1 (PD-L1), laryngeal cancer (LC), Neoplasms. Tumors. Oncology. Including cancer and carcinogens, RC254-282
Abstract

AimWe hypothesized that markers of inflammation correlate with response to radiotherapy in patients with non-metastatic laryngeal cancer (LC). Our aim was to assess peripheral and local markers of inflammation including lymphocyte to monocyte ratio (LMR), neutrophil to lymphocyte ratio (NLR), platelet to lymphocyte ratio (PLR), infiltrating CD8+ lymphocytes (TILsCD8), and programmed death 1 ligand (PD-L1) expression.MethodsWe performed a retrospective single-center analysis of LC patients administered definitive (R-RT) or postoperative radiotherapy (PORT). The primary endpoint was overall survival (OS) in relation to peripheral and local inflammatory markers and their dynamic changes during RT.ResultsStudy group included 215 patients (R-RT, n=116; PORT, n=99). The baseline (t0) NLR and LMR were significantly correlated with OS in the R-RT group. In patients with high and low NLR at t0, the five-year OS was 33% and 56% (p=0.010) and in high and low LMR at t0, the five-year OS was 56% and 27% (p=0.003), respectively. The LMR increase during R-RT predicted better prognosis: the five-year OS in high and low LMR was 57% and 31% at t2 (after 2 weeks of RT) (p=0.015), 49% and 26% at t4 (p< 0.001), and 50% and 25% at t6 (p=0.013), respectively. Multivariable analysis shows that the worse performance status (p=0.003), the presence of nodal metastases (p=0.0001), and low baseline LMR (p=0.049) in the R-RT group, and the presence of nodal metastases (p=0.035) and completion treatment on time (p=0.042) in PORT group were associated with poor prognosis. The PD-L1 expression had no significant prognostic value in any of the examined patients.ConclusionThe baseline LMR and its dynamic changes during R-RT and baseline NLR are independent prognostic factors in patients with nonmetastatic LC. PD-L1 expression and number of TILsCD8 have no prognostic value in R-RT and PORT group.

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results