Search results for "Information System"
showing 10 items of 2404 documents
Sustainable Farming Practices, Awareness, and Behavior in Small Farms in Brazil
2021
This paper investigates the relationship between the use of digital and non-digital sources of information on sustainable farming practices, institutional pressure and adoption of such practices by farmers in Brazilian semi-arid lands. The research uses a model based on the theory of reasoned action (TRA) and the institutional theory. Our results for a sample of 100 Brazilian farmers show that non-digital sources of information and ‘Coercive’ and ‘Normative’ pressures have a positive impact on farmers’ attitude towards and actual adoption of sustainable farming practices. However, digital sources of information such as TV and Radio do not play a significant role. In addition, pro-environmen…
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.
Modelling “Occident/Orient” duality and migration process with mobile agents
2019
Urban growth (1956-1998) in the metropolitan area of Alacant-Elx (Comunitat Valenciana)
2007
18 páginas, 5 figuras, 4 tablas. An abbreviated English version of the paper in the same journal is also attached (Boletín de la AGE 43: 369-374).