Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
Adaptive dual control in one biomedical problem
2003
In this paper, the following biomedical problem is considered. People are subjected to a certain chemotherapeutic treatment. The optimal dosage is the maximal dose for which an individual patient will have toxicity level that does not cross the allowable limit. We discuss sequential procedures for searching the optimal dosage, which are based on the concept of dual control and the principle of optimality. According to the dual control theory, the control has two purposes that might be conflicting: one is to help learning about unknown parameters and/or the state of the system (estimation); the other is to achieve the control objective. Thus the resulting control sequence exhibits the closed…
Fuzzy control of pH using NAL
1991
Abstract A fuzzy controller for a neutralization process is described. The controller was set up for a laboratory pilot plant. The approach is shown to be effective and can be extended to highly nonlinear and nonstationary processes. The “operator” knowledge encoded in the rules was obtained by several experimental runs of the system using manual control. Rules are composed using the max-min compositional rule of inference. The use of metarules, which depends on controller performance and on active disturbances, makes the controller behave like an adaptive controller. The control program is encoded in NAL, a new experimental logic programming language that was first used in this work in a r…
ABM of Civil Violence: ODD Description
2017
This chapter contains a description of the proposed agent-based model, using the well-known “Overview, Design Concepts and Details” protocol. The model was implemented in NetLogo and is based on the same two types of agents—citizens and law-enforcement—as in Epstein’s model, but “citizen” agents have one subtype (“activist”) used for implementing network influence effects. The salient aspects of the model description are centered on the submodels for the risk perception, the expression of hardship in terms of value-sensitive relative deprivation, endogenous legitimacy feedback and network influence effects, which provide extensions to Epstein’s model. The model includes two networks called …
Arithmetical Analysis of Biomolecular Finite Automaton
2013
In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.
Forcing for First-Order Languages from the Perspective of Rasiowa–Sikorski Lemma
2017
The paper is concerned with the problem of building models for first-order languages from the perspective of the classic paper of Rasiowa and Sikorski [9]. The central idea, developed in this paper, consists in constructing first-order models from individual variables. The key notion of a Rasiowa–Sikorski set of formulas for an arbitrary countable language L is examined. Each Rasiowa–Sikorski set defines a countable model for L . Conversely, every countable model for L is determined by a Rasiowa–Sikorski set. The focus is on constructing Rasiowa–Sikorski sets by applying forcing techniques restricted to Boolean algebras arising from the subsets of the set of atomic formulas of L .
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
A Survey on Nature-Inspired Medical Image Analysis: A Step Further in Biomedical Data Integration
2019
Natural phenomena and mechanisms have always intrigued humans, inspiring the design of effective solutions for real-world problems. Indeed, fascinating processes occur in nature, giving rise to an ever-increasing scientific interest. In everyday life, the amount of heterogeneous biomedical data is increasing more and more thanks to the advances in image acquisition modalities and high-throughput technologies. The automated analysis of these large-scale datasets creates new compelling challenges for data-driven and model-based computational methods. The application of intelligent algorithms, which mimic natural phenomena, is emerging as an effective paradigm for tackling complex problems, by…
Stubborn sets, frozen actions, and fair testing
2021
Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method tha…
FORMAL CONCEPTION OF ROUGH SETS
1996
In the paper we present a formal description of rough sets within the framework of the generalized set theory, which is interpreted in the set approximation theory. The rough sets are interpreted as approximations, which are defined by means of the Pawlak's rough sets.
Continuity of solutions of linear, degenerate elliptic equations
2009
We consider the simplest form of a second order, linear, degenerate, divergence structure equation in the plane. Under an integrability condition on the degenerate function, we prove that the solutions are continuous.