Search results for "Information Systems."

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…

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).

QSAR Modeling ANTI-HIV-1 Activities by Optimization of Correlation Weights of Local Graph Invariants

2004

Results of using descriptors calculated with the correlation weights (CWs) of local graph invariants for modeling of anti-HIV-1 potencies of two groups of reverse transcriptase (RT) inhibitors are reported. Presence of different chemical elements in molecular structure of the inhibitors and the presence of Morgan extended connectivity values of zeroth-, first- and second order have been examined as local graph invariants in the labeled hydrogen-filled graphs. By Monte Carlo method optimization procedure, values of the CWs which produce as large values as possible of correlation coefficient between the numerical data on the anti-HIV-1 potencies and values of the descriptors on the training s…

A Hardware and Secure Pseudorandom Generator for Constrained Devices

2018

Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…

Investigating the Impact of Radiation-Induced Soft Errors on the Reliability of Approximate Computing Systems

2020

International audience; Approximate Computing (AxC) is a well-known paradigm able to reduce the computational and power overheads of a multitude of applications, at the cost of a decreased accuracy. Convolutional Neural Networks (CNNs) have proven to be particularly suited for AxC because of their inherent resilience to errors. However, the implementation of AxC techniques may affect the intrinsic resilience of the application to errors induced by Single Events in a harsh environment. This work introduces an experimental study of the impact of neutron irradiation on approximate computing techniques applied on the data representation of a CNN.

Estado de la investigación sobre la colaboración en Entornos Virtuales de Aprendizaje

2019

El aprendizaje colaborativo posee una tradición teórica y práctica amplia en la educación general, como en la educación superior. No obstante, la actividad de coordinación entre personas que buscan aprender no es sencilla de gestionar. Esta complejidad aumenta cuando entre la actividad colaborativa surge un nuevo componente, la tecnología. ¿Qué se ha avanzado sobre el aprendizaje colaborativo mediado tecnológicamente? Este trabajo tiene como objetivo analizar el estado de la investigación sobre aprendizaje colaborativo en Educación Superior en los Entornos Virtuales de Aprendizaje (EVA). Para ello se realiza un análisis bibliométrico de las publicaciones indexadas de la base de datos SCOPUS…