World Scientific
Refine
Institute
- Fachbereich Medizintechnik und Technomathematik (4)
- INB - Institut für Nano- und Biotechnologien (2)
- Fachbereich Elektrotechnik und Informationstechnik (1)
- Fachbereich Energietechnik (1)
- Fachbereich Luft- und Raumfahrttechnik (1)
- IfB - Institut für Bioengineering (1)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (1)
Has Fulltext
- no (7)
Language
- English (7)
Document Type
- Article (4)
- Part of a Book (2)
- Conference Proceeding (1)
We generalize our work on Carlitz prime power torsion extension to torsion extensions of Drinfeld modules of arbitrary rank. As in the Carlitz case, we give a description of these extensions in terms of evaluations of Anderson generating functions and their hyperderivatives at roots of unity. We also give a direct proof that the image of the Galois representation attached to the p-adic Tate module lies in the p-adic points of the motivic Galois group. This is a generalization of the corresponding result of Chang and Papanikolas for the t-adic case.
The network approach towards the analysis of the dynamics of complex systems has been successfully applied in a multitude of studies in the neurosciences and has yielded fascinating insights. With this approach, a complex system is considered to be composed of different constituents which interact with each other. Interaction structures can be compactly represented in interaction networks. In this contribution, we present a brief overview about how interaction networks are derived from multivariate time series, about basic network characteristics, and about challenges associated with this analysis approach.
In this paper we present an extension of the action language Golog that allows for using fuzzy notions in non-deterministic argument choices and the reward function in decision-theoretic planning. Often, in decision-theoretic planning, it is cumbersome to specify the set of values to pick from in the non-deterministic-choice-of-argument statement. Also, even for domain experts, it is not always easy to specify a reward function. Instead of providing a finite domain for values in the non-deterministic-choice-of-argument statement in Golog, we now allow for stating the argument domain by simply providing a formula over linguistic terms and fuzzy uents. In Golog’s forward-search DT planning algorithm, these formulas are evaluated in order to find the agent’s optimal policy. We illustrate this in the Diner Domain where the agent needs to calculate the optimal serving order.