The contemporary Platonists in the philosophy of mathematics argue that mathematical objects exist. One of the arguments by which they support this standpoint is the so-called Enhanced Indispensability Argument (EIA). This paper aims at pointing out the difficulties inherent to the EIA. The first is contained in the vague formulation of the Argument, which is the reason why not even an approximate scope of the set objects whose existence is stated by the Argument can be established. The second problem is reflected in the vagueness of the very term indispensability, which is essential to the Argument. The paper will remind of a recent definition of the concept of indispensability of a mathematical object, reveal its deficiency and propose an improvement of this definition. Following this, we will deal with one of the consequences of the arbitrary employment of the concept of indispensability of a mathematical theory. We will propose a definition of this concept as well, in accordance with the common intuition about it. Eventually, on the basis of these two definitions, the paper will describe the relation between these two concepts, in the attempt to clarify the conceptual apparatus of the EIA., Současní platonisté ve filozofii matematiky argumentují, že matematické objekty existují. Jedním z argumentů, které toto stanovisko podporují, je tzv. Enhanced Indispensability Argument (EIA). Cílem tohoto příspěvku je poukázat na obtíže spojené s EIA. První z nich je obsažena v vágní formulaci Argumentu, což je důvod, proč nelze stanovit ani přibližný rozsah nastavených objektů, jejichž existence je uvedena argumentem. Druhý problém se odráží v neurčitosti samotného pojmu nepostradatelnost, která je pro argument nezbytná. Příspěvek bude připomínat nedávnou definici pojmu nepostradatelnost matematického objektu, odhalit jeho nedostatek a navrhnout zlepšení této definice. Poté budeme se zabývat jedním z důsledků svévolného zaměstnávání konceptu nepostradatelnosti matematické teorie. Navrhneme také definici této koncepce v souladu se společnou intuicí. Nakonec, na základě těchto dvou definic, bude článek popsat vztah mezi těmito dvěma pojmy, ve snaze objasnit koncepční aparát EIA., and Vladimir Drekalović
A refined common generalization of known theorems (Arhangel’skii, Michael, Popov and Rančin) on the Fréchetness of products is proved. A new characterization, in terms of products, of strongly Fréchet topologies is provided.
The aim of our study was to develop a model producing obese mice in early adulthood (4-6 weeks) based on their over-nutrition during fetal and early postnatal development. The fertilized dams of the parental generation were fed the standard diet supplemented with high-energy nutritional product Ensure Plus during gestation and lactation. De livered weanlings were then fed with standard or supplemented diet and assessed for body fat deposits using EchoMRI at the ti me of early and late adulthood. Maternal over-feeding during th e period before weaning had the most significant effect on obesity development in the filial generation. In weanlings, signific antly higher body fat deposits and average body weight were recorded. Later, further significant increase in percentage of body fat in both male and female mice was observed. Withdrawal of the Ensure Plus supplement caused a decrease in the percentage of body fat in part of the filial generation. In offspring fed the standard diet, higher fat deposits persisted till the time of late adulthood. We conclude that this diet-induced obesity model might be used in exploration of the effects of elevated body fat on physiological functions of various organ systems during juvenile and early adulthood periods of life of a human being., J. Kubandová ... [et al.]., and Obsahuje bibliografii a bibliografické odkazy
This paper focuses on a two-layer approach to genetic programming algorithm and the improvement of the training process using ensemble learning. Inspired by the performance leap of deep neural networks, the idea of a multilayered approach to genetic programming is proposed to start with two-layered genetic programming. The goal of the paper was to design and implement a twolayer genetic programming algorithm, test its behaviour in the context of symbolic regression on several basic test cases, to reveal the potential to improve the learning process of genetic programming and increase the accuracy of the resulting models. The algorithm works in two layers. In the first layer, it searches for appropriate sub-models describing each segment of the data. In the second layer, it searches for the final model as a non-linear combination of these sub-models. Two-layer genetic programming coupled with ensemble learning techniques on the experiments performed showed the potential for improving the performance of genetic programming.
In many natural language processing applications two or more models usually have to be involved for accuracy. But it is difficult for minor models, such as “backoff” taggers in part-of-speech tagging, to cooperate smoothly with the major probabilistic model. We introduce a two-stage approach for model selection between hidden Markov models and other minor models. In the first stage, the major model is extended to give a set of candidates for model selection. Parameters weighted hidden Markov model is presented using weighted ratio to create the candidate set. In the second stage, heuristic rules and features are used as evaluation functions to give extra scores to candidates in the set. Such scores are calculated using a diagnostic likelihood ratio test based on sensitivity and specificity criteria. The selection procedure can be fulfilled using swarm optimization technique. Experiment results on public tagging data sets show the applicability of the proposed approach.
The purpose of the paper is to present existing and discuss modified optimization models and solution techniques which are suitable for engineering decision-making problems containing random elements with emphasis on two decision stages. The developed aproach is called two-stage stochastic programming and the paper links motivation, applicability, theoretical remarks, transformations, input data generation techniques, and selected decomposition algorithms for generalized class of engineering problems. The considered techniques have been found applicable by the experience of the authors in various areas of engineering problems. They have been applied to engineering design problems involving constraints based on differential equations to achieve reliable solutions. They have served for technological process control e.g. in melting, casting, and sustainable energy production. They have been used for industrial production technologies involving related logistics, as e.g. fixed interval scheduling under uncertainty. The paper originally introduces several recent improvements in the linked parts and it focuses on the unified two-stage stochastic programming approach to engineering problems in general. It utilizes authentic experience and ideas obtained in certain application areas and advises their fruitful utilization for other cases. The paper follows the paper published in 2000 which deals with the applicability of static stochastic programs to engineering design problems. Therefore, it refers to the basic concepts and notation introduced there and reviews only the principal ideas in the beginning. Then. it focuses on motivation of recourse concepts and two decision stages from engineering point of view. The principal models are introduced and selected theoretical features are reviewed. They are also accompanied by the discussion about difficulties caused by real-world cases. Scenario-based approach is detailed as the important one for the solution of engineering problems, discussion in data input generation is added together with model transformation remarks. Robust algorithms suitable for engineering problems involving nonlinearities and integer variable are selected and scenario-based decomposition is preferred. An original experience with using heuristics is shared. Several postprocessing remarks are added at the end of the paper, which is followed by an extensive literature review. and Obsahuje seznam literatury