Breast cancer is a leading cause of morbidity and mortality worldwide. Although mammography screening available, there an ongoing interest in improved early detection prognosis. Herein, we have analysed combination serological biomarkers case-control cohort sera taken before diagnosis.This nested study within the UK Collaborative Trial Ovarian Cancer Screening (UKCTOCS) used serum samples from 239 women who subsequently developed breast matched cancer-free controls. Sera were screened by...

Abstract Background An accurate and simple risk prediction model that would facilitate earlier detection of pancreatic adenocarcinoma (PDAC) is not available at present. In this study, we compare different algorithms in order to select the best one for constructing a biomarker-based score, PancRISK. Methods Three hundred seventy-nine patients with measurements three urine biomarkers, (LYVE1, REG1B TFF1) using retrospectively collected samples, as well creatinine age, were randomly split into...

The theory of optimal set partitioning is a powerful tool for solving infinite-dimensionaloptimization problems, including infinite-dimensional transportation problems where oneside, producers or consumers, continuously allocated in subset n-dimensional space,for example, over part ofa plane. A variation the problem describedwhere products done two stages, with intermediate transporta-tion points being integrated intothe model. First, are transported from ofcontinuously distributed to...

The issues of applying mathematical methods artificial intelligence for solving fuzzyproblems optimal set partitioning, which represent a new section infinite-dimensionalmathematical programming with Boolean variables, are considered. It is shown that appa-ratus such as fuzzy theories, logic, neural networks,neuro-fuzzy technologies effectively used to reveal uncertainty in prob-lems partitioning.

The algorithm for solving a continuous problem of optimal partitioning the sets from n-dimensional Euclidean space into subsets with neurolinguistic identification functions included target functional undefined explicit analytical form is proposed. software that implements proposed approach based on neuron-fuzzy technologies using Shor's r-algorithm developed. results program implementation developed model test are presented.

A large number of real-world problems from various fields human activity can be reduced to optimal partitioning-allocation with the purpose minimizing partitioning quality criterion. typical representative such problem is an infinite-dimensional transportation and more generalized problems—infinite-dimensional production centers placement along area continuously distributed consumers costs. The relevant are characterized by some kind uncertainty level a not-probabilistic nature. method...

Abstract A two-stage continuous-discrete optimal partitioning-allocation problem is studied, and a method an algorithm for its solving are proposed. This generalization of classical transportation to the case when coordinates production points (collection, storage, processing) homogeneous products continuously allocated in given domain volumes at these unknown. These found as solution corresponding continuous set-partitioning finite-dimensional Euclidean space with placement (finding...

A mathematical model for evaluating startups investment attractiveness based on neuro-fuzzy technologies is proposed. It allows one to take into account not only a statistical uncertainty but also linguistic one. The parameters optimization of created fuzzy the stage its adjustment performed using undifferential methods − Shor r- algorithm. software that implements proposed approach developed. results modeling define real are presented

The problem of construction a generalized Voronoi diagram with optimal placement finite number generator points in bounded set \textit{n}-dimensional Euclidean space is considered. A method proposed for solving such based on the formulation corresponding continuous partitioning partition quality criterion that provides form diagram. Further, to solve problem, developed mathematical and algorithmic apparatus used, part which Shor's \textit{r}-algorithm.

This article explores the construction of mathematical model, method, and algorithm for solving two-stage optimal location-allocation problem, along with software implementation execution. The developed enables resolution resource management transportation problems from supply centers to consumer spaces. Considering that in contemporary world where all resources goods are transported over considerable distances substantial volumes, task optimizing delivery routes minimizing costs remains...

The objective of this article is to explore the possibilities identifying network attacks using cluster analysis methods. Density-based spatial clustering applications with noise (DBSCAN) and ordering points identify structure (OPTICS) algorithm have been implemented on data representing a simulated network. findings reveal most effective algorithmic combinations for distinguishing between regular connections associated intrusions.

The objective of this work is to study and implement an approach for initializing centersbefore executing the r-algorithm, based on clustering results, solving optimal set parti-tioning (OSP) problems. focuses single-product unconstrained OSP tasks andconsiders algorithms such as EM, K-Means, hierarchical withvarious linkage types. research results show a reduction in number r-algorithmiterations ability achieve solutions with lower computational effort.

The problem of enterprises location with the simultaneous allocation this region, coninuously filled by consumers, into consumer areas, where each them is served one enterprise, in order to minimize transportation and production costs, mathematical definition, are illustrated as infinite-dimensional optimal set partitioning problems (OSP) non-intersecting subsets placement centers these subsets. A wide range methods algorithms have been developed solve practical tasks location-allocation,...

The theory of optimal set partitioning from an n-dimensional Euclidean space En is important part infinite-dimensional mathematical programming. mostly reason high interest in development the that its results can be applied to solving classes different theoretical and optimization problems, which are transferred into continuous problem. This paper investigates further case a two-stage continuous-discrete problem partitioningdistribution with non-determined input data, frequently appear...

The paper substantiates the possibility of applying mathematical theory continuous problems optimal partitioning sets n-dimensional Euclidean space, which belong to non-classical infinite-dimensional programming, solution artificial intelligence and pattern recognition. recognition both in conditions certainty uncertainty are formulated. A particular attention is paid application methods for construction fuzzy Voronoi diagrams. Examples constructing diagrams with placement generating points given.

Досліджено математичні моделі та підходи до розв’язання двоетапних задач оптимального розміщення-розбиття з нечіткими початковими даними. Ці задачі узагальнюють, одного боку, класичні скінченновимірні транспортні на випадок, коли обсяги виробництва (зберігання, переробки) в заданих пунктах невідомі заздалегідь відшукуються як розв’язок відповідної неперервної розбиття множини споживачів (постачальників неперервно розподіленого ресурсу) сфери обслуговування їх цими пунктами; іншого вони...

The mathematical theory of optimal set partitioning (OSP) the n-dimensional Eu-clidean space, which has been formed for todays, is field modern opti-mization, namely, new section non-classical infinite-dimensional pro-gramming. built based on a single, theoretically defined approach that sum up initial infinitedimensional optimization problems in certain way (with function Lagrange) to nonsmooth, usually, finite-dimensional problems, where lat-est numerical nondifferentiated methods may be...