Our Work

Anonymized reproducibility package for a paper under double-blind review. See README.md inside the archive.

This dataset provides high-resolution information on the spatial and temporal variability of chlorophyll-a and cyanobacterial blooms in the southern Baltic Sea for 2023–2024. It was developed wi…

This dataset provides high-resolution information on the spatial and temporal variability of chlorophyll-a and cyanobacterial blooms in the southern Baltic Sea for 2023–2024. It was developed within the CSI-POM Stage 2 project by combining Sentinel-3 OLCI satellite observations, machine-learning methods, and numerical modelling. Sentinel-3 OLCI observations (300 m spatial resolution) were processed using POLYMER atmospheric correction and quality-control procedures. Total chlorophyll-a concentration (chlaTot) was estimated using a Support Vector Regression (SVR) model. Cyanobacterial biomass was characterised through phycocyanin concentration (PC) and cyanobacteria-associated chlorophyll-a (chlPC). The processed satellite products were aggregated into daily datasets. Satellite-derived chlorophyll-a fields were also assimilated into the 3D CEMBS-PolSea hydrodynamic-biogeochemical model with a spatial resolution of approximately 575 m. The dataset covers the Polish Marine Areas and adjacent waters of the southern Baltic Sea (approximately 13°30′–21°30′E, 53°50′–55°45′N). Data are provided in NetCDF4 format compliant with CF metadata conventions. The dataset is intended for environmental monitoring, satellite and numerical model validation, studies of eutrophication and cyanobacterial blooms, and the development of marine early-warning and management applications. License and data attribution This derived dataset is made available under the Creative Commons Attribution 4.0 International (CC BY 4.0) license, insofar as copyright and database rights in the derived products are held by the dataset authors and/or their institutions. Source satellite data: Contains modified Copernicus Sentinel data 2023–2024. The underlying Copernicus Sentinel data remain subject to the Legal Notice on the use of Copernicus Sentinel Data and Service Information.

No description provided.

System(3X±1)/4 Framework for the Collatz (3x+1) Problem     © Dr.(Prof.) Keshava Prasad Halemane, Professor - retired (2017JAN31) from Department of Mathematical And Computation…

System(3X±1)/4 Framework for the Collatz (3x+1) Problem     © Dr.(Prof.) Keshava Prasad Halemane, Professor - retired (2017JAN31) from Department of Mathematical And Computational Sciences, National Institute of Technology Karnataka Surathkal, Srinivasnagar, Mangaluru - 575025, India. https://orcid.org/0000-0003-3483-3521 Independent Researcher @ SASHESHA (no affiliations; no funding; no data used; no conflict of interests) https://www.linkedin.com/in/keshavaprasadahalemane/ k.prasad.h@gmail.com     Abstract   In order to gain deeper insight into the Collatz (3x+1) Problem, we design a framework based on System(3X±1)/4; defined similar to the Collatz (3x+1) system, with slightly modified operations.  On similar lines, we define the CTUHSK(3x+1)/4 system, and show that to be exactly the same as the Collatz (3x+1) system.  The convergence of System(3X±1)/4 to its trivial-cycle {(1⇐(2)⇐4)} is established using the persistent local characteristic property of ‘odd-to-odd monotonicity’ in its defining function.  We also present a meticulously designed reversible (invertible) transformation (reduction); between System(3X±1)/4 and the CTUHSK(3x+1)/4 system; based on pruning-&-joining operations on the system arborescence; which does not affect the binary(inward)arborescence structure as well as the convergence characteristics of either of these systems.  This establishes the convergence of the CTUHSK(3x+1)/4 system to its trivial-cycle {(1⇐2⇐4)}.   This paper also presents Halemane-Conjecture associated with the Collatz sequence, that the upper bound on the number of odd (3x+1) operations required to reach its trivial-cycle {(1⇐2⇐4)} starting from any given positive integer and moving along the Collatz sequence, is the given number itself; the triad {(31⇐41⇐27)} being an exceptional limiting case.     Keywords: System(3X±1)/4; CTUHSK(3x+1)/4 system;          Halemane’s Conjecture on the Collatz (3x+1) system;          Collatz-Thwaites-Ulam-Hasse-Syracuse-Kakutani (CTUHSK) Sequence;          Collatz-Thwaites-Ulam-Hasse-Syracuse-Kakutani (CTUHSK) Conjecture;          binary(inward)arborescence;     AMS MSC Mathematics Subject Classification:  11B83; 11Y55; 40A99; 93A99.       Summary   System(3X±1)/4 has been defined, similar to the Collatz (3x+1) system; with slightly modified operations.  We have also defined the CTUHSK(3x+1)/4 system, and shown that to be exactly the same as the Collatz (3x+1) system.  The convergence of System(3X±1)/4 to its trivial-cycle {(1⇐(2)⇐4)} is established using the persistent local ‘odd-to-odd monotonicity’ property of its defining function.  A reversible (invertible) transformation between System(3X±1)/4 and CTUHSK(3x+1)/4 system has been designed, based on a recursive/iterative process consisting of pruning-&-joining operations performed on the binary(inward)arborescence structure of the system.  This pruning-&-joining operation does not affect the binary(inward)arborescence structure as well as the convergence characteristics of either of these systems; because the pruned subtree is joined onto an already existing inactive-node of the system arborescence; without adding or removing any nodes.  Therefore, it establishes the convergence of the CTUHSK(3x+1)/4 system to its trivial-cycle {(1⇐2⇐4)}.   The Halemane-Conjecture on the Collatz (3x+1) sequence states that the maximum limit on number of odd (3x+1) operations required to reach its trivial-cycle {(1⇐2⇐4)}; starting from any given positive integer and moving along the Collatz sequence; is the given number itself; with the triad {(31⇐41⇐27)} as an exceptional limiting case.      

Мужское бесплодие является гетерогенным состоянием, в этиологии которого существенное место занимают генетические нарушения. Особое значение имеют микроделеции длинного плеча Y-хромосомы в области AZF…

Мужское бесплодие является гетерогенным состоянием, в этиологии которого существенное место занимают генетические нарушения. Особое значение имеют микроделеции длинного плеча Y-хромосомы в области AZF (Azoospermia Factor), включающей субрегионы AZFa, AZFb и AZFc. Эти структурные изменения могут нарушать сперматогенез и проявляться необструктивной азооспермией либо тяжелой олигозооспермией. Для Республики Узбекистан до настоящего исследования отсутствовали обобщенные данные о частоте и спектре AZF-микроделеций в клинически значимой выборке мужчин с нарушениями фертильности, что ограничивало возможность региональной адаптации генетической диагностики.

Objective: Understanding impacts of Ag finger metallization and Cu interconnect wire layout on performance and materials.

This data-and-code package supports the study “Urinary DINCH biomarkers and HbA1c in US adults: NHANES 2011–2018”. It contains analysis-ready derived data, statistical scripts, resul…

This data-and-code package supports the study “Urinary DINCH biomarkers and HbA1c in US adults: NHANES 2011–2018”. It contains analysis-ready derived data, statistical scripts, result tables and figures. The analyses cover urinary DINCH biomarker detection and concentration distributions, two-part and categorical HbA1c models, and secondary mortality analyses. This version includes joint exposure tests in HbA1c-restricted populations and a matched MHNCH-plus-MCOCH comparison with the German adult HBM-I value. The README documents data sources, reconstruction steps, software requirements and analytical limitations. Original NHANES XPT files are publicly available from the US National Center for Health Statistics; their expected filenames are documented. No direct personal identifiers are included. Manuscript documents and submission correspondence are not included in this package.

Deutsch: Aufgrund der Datengrösse werden die VISUM-Versionen des NPVM 2023 für den Durchschnittlichen Tagesverkehr (DTV) und die Spitzenstunden im MIV und ÖV separat zur Verfügung…

Deutsch: Aufgrund der Datengrösse werden die VISUM-Versionen des NPVM 2023 für den Durchschnittlichen Tagesverkehr (DTV) und die Spitzenstunden im MIV und ÖV separat zur Verfügung gestellt. Alle weiteren Daten zum nationalen Personenverkehrsmodell (NPVM) 2023 und eine Beschreibung sind unter dieser DOI verfügbar: 10.5281/zenodo.15755931. Update (02.10.2026): Die Dateien des DTV (inkl. Tag und Nacht) wurden aktualisiert. Français: En raison de la taille des données, les versions VISUM du MNTP 2023 pour le trafic journalier moyen (TJM) et les heures de pointe TIM et TP sont mises à disposition séparément. Toutes les autres données relatives au modèle national de trafic voyageurs (MNTP) 2023 ainsi qu'une description des données sont disponibles via ce DOI 10.5281/zenodo.15755931. Update (02.10.2026): Les fichiers du TJM (y compris les états jour et nuit) ont été actualisés. Italiano: A causa delle dimensioni dei dati, le versioni VISUM del MTVN 2023 per il traffico giornaliero medio (TGM) e alle ore di punta TIM e TP sono disponibili separatamente. Tutti gli altri dati relativi al Modello del Traffico Viaggiatori a livello Nazionale (MTVN) 2023 e una descrizione dei dati sono disponibili utilizzando questo DOI 10.5281/zenodo.15755931. Update (02.10.2026): I file del DTV (compresi quelli relativi al giorno e alla notte) sono stati aggiornati. English: Due to the size of the data, the VISUM versions of the national model for passenger traffic 2023 for the average annual daily traffic (AADT) and peak hours for road and public transport are provided separately. All the other data related to the national model for passenger traffic 2023 and a data description are available using this DOI 10.5281/zenodo.15755931. Update (02.10.2026): The files des AADT (incl. day and night) have been updated.

This paper develops a formal mathematical description of the interface between transitions and events. The central problem is to characterize the structural conditions under which an event can be asso…

This paper develops a formal mathematical description of the interface between transitions and events. The central problem is to characterize the structural conditions under which an event can be associated with a transition without assuming that the transition–event correspondence is one-to-one, exhaustive, or structurally trivial.   We introduce a transition space, an event space, and an eligibility relation that determines which events are structurally compatible with a given transition. This relation induces an eligibility fiber over each transition and separates the interface into structurally distinct classes of events. The resulting construction shows that the interface is not adequately represented by a simple pointwise correspondence; it possesses an internal set-theoretic structure. We prove that relations and set-valued maps are equivalent descriptions; that the coverage map factors canonically through the quotient by fiber-equality, so that distinct transitions may collapse onto one event-side structure; that the degenerate interface is exactly the product relation, and count the nondegenerate ones in the finite case; and that every nonempty family of subsets of the event space is realizable as a coverage image. The last result shows that closure, lattice and related properties cannot follow from the interface alone. The paper provides the formal starting point for the subsequent study of structural emptiness, closure, separation, trace and information loss.