Search results for "dab"
showing 10 items of 1280 documents
The Dialectics of Free Energy Minimization
2019
Karl Friston’s free energy minimization has been received with great enthusiasm. With good reason: it not only makes the bold claim to a unifying theory of the brain, but it is presented as an a priori principle applicable to living systems in general. In this article, we set out to show how the breadth of scope of Friston’s framework converges with the dialectics of Georg Hegel. Through an appeal to the work of Catherine Malabou, we aim to demonstrate how Friston not only reinvigorates Hegelian dialectics from the perspective of neuroscience, but that the implicit alignment with Hegel necessitates a reading of free energy minimization from the perspective of Hegel’s speculative philosophy.…
The Psychology of Thinking in Creating AI
2021
The broad-scale emergence of AI in industry calls forth basic questions in terms of the knowledge bases and approaches relevant for its design. Engineering design has been mainly developed for electromechanical artifacts. In practice, this has meant that the scientific knowledge required for creating technical artifacts such as engines, cars, ships, cranes, telephones, radios, TVs, and simple data processing units has been natural science. However, one cannot find intelligent processes by means of physics and chemistry. Natural scientific phenomena follow their deterministic laws, but intelligence is based on selection and decision processes. The conceptual landscape of natural science is o…
System times and channel availability analyses in multi-channel cognitive radio networks
2014
Channel accessibility by a secondary user (SU) in cognitive radio networks (CRNs) depends on the availability of the spectrum based on primary user and other SU activities. A new SU request may be blocked and an ongoing SU service may also be discarded if no sufficient spectrum is available. So far, little work has been done to analyze the reliability and availability aspects of CRNs from the perspective of the dependability theory. In this paper, we introduce the concept of availability for spectrum access in multi-channel CRNs, which is defined as the fraction of time that a CRN can allocate at least the minimum number of required channels for a new SU request. Through a proposed continuo…
Skrejvaboļu (Coleoptera, Carabidae) sabiedrības sausos kaļķainos zālājos un tās ietekmējošie faktori Abavas senlejā
2016
Kā Eiropā tā Latvijā sausu, kaļķainu zālāju platības ar katru gadu samazinās. Šis biotops ir viens no sugām bagātākajiem, tomēr uzskatāms par Latvijā izzūdošu, jo aizņem vairs tikai 0,05% no valsts teritorijas (Auniņš 2013). Šī darba mērķis ir noskaidrot zālāju apsaimniekošanas un botāniskās kvalitātes ietekmi uz skrejvaboļu (Carabidae) sabiedrībām sausos, kaļķainos zālājos. Pētījums veikts sausos, kaļķainos zālājos, dabas parka “Abavas senleja” posmā starp Kandavas un Sabiles pilsētām. Septiņpadsmit parauglaukumos, kas iedalīti atšķirīgās botāniskās kvalitātes un apsaimniekošanas veida grupās, ar Bārbera tipa augsnes lamatām, ievākti kvantitatīvi dati par skrejvaboļu sastopamību. Noteikts …
On languages factorizing the free monoid
1996
A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous. First we give a combinatorial characterization of factorizing languages. Further we prove that it is decidable whether a regular language X is factorizing and we construct an automaton recognizing the corresponding language Y. For finite languages we show that it suffices to consider words of bounded length. A complete characterization of factorizing languages with three words and explicit regular expression for the co…
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
2005
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
Coding with traces
1994
We prove that the existence of a coding between two trace monoids is decidable for some families of trace monoids. Decidability heavily depends on the structure of the dependence graphs. The concept of coding is based on the new notion of strong morphism between trace monoids.
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Information Integration Platform for Patient-Centric Healthcare Services: Design, Prototype and Dependability Aspects
2014
Published version of an article in the journal: Future Internet. Also available from the publisher at: http://dx.doi.org/10.3390/fi6010126 Open Access Technology innovations have pushed today’s healthcare sector to an unprecedented new level. Various portable and wearable medical and fitness devices are being sold in the consumer market to provide the self-empowerment of a healthier lifestyle to society. Many vendors provide additional cloud-based services for devices they manufacture, enabling the users to visualize, store and share the gathered information through the Internet. However, most of these services are integrated with the devices in a closed “silo” manner, where the devices can…