Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
Singular Neumann (p, q)-equations
2019
We consider a nonlinear parametric Neumann problem driven by the sum of a p-Laplacian and of a q-Laplacian and exhibiting in the reaction the competing effects of a singular term and of a resonant term. Using variational methods together with suitable truncation and comparison techniques, we show that for small values of the parameter the problem has at least two positive smooth solutions.
Logic, Computing and Biology
2015
Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.
Inductive inference of recursive functions: Qualitative theory
2005
This survey contains both old and very recent results in non-quantitative aspects of inductive inference of total recursive functions. The survey is not complete. The paper was written to stress some of the main results in selected directions of research performed at the University of Latvia rather than to exhaust all of the obtained results. We concentrated on the more explored areas such as the inference of indices in non-Goedel computable numberings, the inference of minimal Goedel numbers, and the specifics of inference of minimal indices in Kolmogorov numberings.
Transformations Between UML Diagrams
2003
The Unified Modeling Language (UML) provides various diagram types for describing a system from different perspectives or abstraction levels. Hence, UML diagrams describing the same system are dependent and strongly overlapping. In this paper we study how this can be exploited for specifying transformation operations between different diagram types. We discuss various general approaches and viewpoints of model transformations in UML. The source and target diagram types for useful transformations are analyzed and given categories. The potentially most interesting transformation operations are discussed in detail. It is concluded that the transformation operations can automate a substantial p…
Reduction of UML Class Diagrams
2002
One and the same “real world” can be modeled by different UML class diagrams, which in such a case can be considered “intuitively equivalent”. A formalization of this “intuitive equivalence” of class diagrams is proposed. An algorithm is constructed that for two class diagrams determines if they model the same “real world”. This algorithm can be used in CASE tools to compare alternative models of a system, and for diagram “compression” to facilitate understanding of large diagrams.
Mobile agents and knowledge discovery in ubiquitous computing
2004
Publisher Summary This chapter discusses a knowledge discovery strategy to be performed by mobile agents in an augmented reality (AR) scenario. AR entities are implemented by mobile agents who perform all the behaviors of cooperating entities. Among other tasks, mobile agents implement a resource discovery strategy, which is aimed at filling lacking entities with missing methods and knowledge rules. A three layer entity description model and a cooperation mechanism are discussed, which allow knowledge and methods to be shared between entities in augmented reality. Three layers host three different projection descriptions of an AR entity respectively are: (1) a semantic projection for knowle…
ean-Square Filtering for Polynomial System States Confused with Poisson Noises over Polynomial Observations
2011
Published version of an article in the journal: Modeling, Identification and Control. Also available from the publisher at: http://dx.doi.org/10.4173/mic.2011.2.1 In this paper, the mean-square filtering problem for polynomial system states confused with white Poisson noises over polynomial observations is studied proceeding from the general expression for the stochastic Ito differentials of the mean-square estimate and the error variance. In contrast to the previously obtained results, the paper deals with the general case of nonlinear polynomial states and observations with white Poisson noises. As a result, the Ito differentials for the mean-square estimate and error variance corre- spon…
Modeling and Performance Analysis of Energy Efficiency Binary Power Control in MIMO-OFDM Wireless Communication Systems
2011
Published version of an article in the journal:International Journal of Distributed Sensor Networks. Also available from Hindawi Publishing: http://dx.doi.org/10.1155/2011/946258 The energy efficiency optimization of the binary power control scheme for MIMO-OFDM wireless communication systems is formulated, and then a global optimization solution of power allocation is derived. Furthermore, a new energy efficiency binary power control (EEBPC) algorithm is designed to improve the energy efficiency of MIMO-OFDM wireless communication systems. Simulation results show that the EEBPC algorithm has better energy efficiency and spectrum efficiency than the average power control algorithm in MIMO-O…
Chasing Metaverses: Reflecting on Existing Literature to Understand the Business Value of Metaverses
2022
AbstractMetaverses refer to immersive virtual worlds in which people, places, and things of the physical world are represented by their digital representations. The wide adoption of metaverses is expected to widely disrupt the way we interact in the virtual world by elevating our online interactive experiences and bringing a plethora of implications for businesses. Following a structured literature review of related research published in the last decade, we shed light on our current understanding of metaverses and reflect on the potentially transformative value of metaverses for businesses in the near future. We draw on an established research framework to organize the insights of existing …
Distributed ASM - Pitfalls and solutions
2014
Published version of a chapter in the book: Abstract State Machines, Alloy, B, TLA, VDM, and Z. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-662-43652-3_18 While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is not clear that this is true of distributed ASM. This paper looks at two kinds of distributed process, one based on a global state and one based on variable access. Their commonalities are extracted and conclusions for the general understanding of distributed computation are drawn, providing integration between global state and variable access.