@inproceedings{ReyesIturbideVelazquezRosado2007,
  author    = {Reyes-Iturbide, J. and Vel{\´a}zquez, P. and Rosado, M.},
  title     = {3D numerical model for an asymmetrical superbubble},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17724},
  year      = {2007},
  abstract  = {Massive stars usually form groups such as OB associations. Their fast stellar winds sweep up collectively the surrounding insterstellar medium (ISM) to generate superbubbles. Observations suggest that superbubble evolution on the surrounding ISM can be very irregular. Numerical simulations considering these conditions could help to understand the evolution of these superbubbles and to clarify the dynamics of these objects as well as the difference between observed X-ray luminosities and the predicted ones by the standard model (Weaver et al. 1977).},
  language  = {en}
}
@inproceedings{VlugterKnott2006,
  author    = {Vlugter, Peter and Knott, Alistair},
  title     = {A multi-speaker dialogue system for computer-aided language learning},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10208},
  year      = {2006},
  abstract  = {The main topic of this paper is how to configure a dialogue system to support computer-aided language learning. The paper also serves to introduce our new multi-speaker dialogue system, and highlight some of its novel features.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {A paraconsistent semantics for generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41496},
  year      = {2010},
  abstract  = {We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].},
  language  = {en}
}
@inproceedings{GoltzPieth2010,
  author    = {Goltz, Hans-Joachim and Pieth, Norbert},
  title     = {A tool for generating partition schedules of multiprocessor systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41556},
  year      = {2010},
  abstract  = {A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.},
  language  = {en}
}
@inproceedings{MacuraGinzburg2006,
  author    = {Macura, Zoran and Ginzburg, Jonathan},
  title     = {Acquiring words across generations : introspectively or interactively?},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10408},
  year      = {2006},
  abstract  = {How does a shared lexicon arise in population of agents with differing lexicons, and how can this shared lexicon be maintained over multiple generations? In order to get some insight into these questions we present an ALife model in which the lexicon dynamics of populations that possess and lack metacommunicative interaction (MCI) capabilities are compared. We ran a series of experiments on multi-generational populations whose initial state involved agents possessing distinct lexicons. These experiments reveal some clear differences in the lexicon dynamics of populations that acquire words solely by introspection contrasted with populations that learn using MCI or using a mixed strategy of introspection and MCI. The lexicon diverges at a faster rate for an introspective population, eventually collapsing to one single form which is associated with all meanings. This contrasts sharply with MCI capable populations in which a lexicon is maintained, where every meaning is associated with a unique word. We also investigated the effect of increasing the meaning space and showed that it speeds up the lexicon divergence for all populations irrespective of their acquisition method.},
  language  = {en}
}
@inproceedings{Watson2008,
  author    = {Watson, Bruce W.},
  title     = {Advances in automata implementation techniques (Abstract)},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27094},
  year      = {2008},
  language  = {en}
}
@inproceedings{VinkBenagliaDaviesetal.2007,
  author    = {Vink, J. S. and Benaglia, P. and Davies, B. and de Koter, A. and Oudmaijer, R. D.},
  title     = {Advances in mass-loss predictions},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17948},
  year      = {2007},
  abstract  = {We present the results of Monte Carlo mass-loss predictions for massive stars covering a wide range of stellar parameters. We critically test our predictions against a range of observed massloss rates - in light of the recent discussions on wind clumping. We also present a model to compute the clumping-induced polarimetric variability of hot stars and we compare this with observations of Luminous Blue Variables, for which polarimetric variability is larger than for O and Wolf-Rayet stars. Luminous Blue Variables comprise an ideal testbed for studies of wind clumping and wind geometry, as well as for wind strength calculations, and we propose they may be direct supernova progenitors.},
  language  = {en}
}
@inproceedings{HanusKoschnicke2010,
  author    = {Hanus, Michael and Koschnicke, Sven},
  title     = {An ER-based framework for declarative web programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41447},
  year      = {2010},
  abstract  = {We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.},
  language  = {en}
}
@inproceedings{YliJyrae2008,
  author    = {Yli-Jyr{\"a}, Anssi},
  title     = {Applications of diamonded double negation},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27109},
  year      = {2008},
  abstract  = {Nested complementation plays an important role in expressing counter- i.e. star-free and first-order definable languages and their hierarchies. In addition, methods that compile phonological rules into finite-state networks use double-nested complementation or "double negation". This paper reviews how the double-nested complementation extends to a relatively new operation, generalized restriction (GR), coined by the author (Yli-Jyr{\"a} and Koskenniemi 2004). This operation encapsulates a double-nested complementation and elimination of a concatenation marker, diamond, whose finite occurrences align concatenations in the arguments of the operation. The paper demonstrates that the GR operation has an interesting potential in expressing regular languages, various kinds of grammars, bimorphisms and relations. This motivates a further study of optimized implementation of the operator.},
  language  = {en}
}
@inproceedings{BarbaianiCanceddaDanceetal.2008,
  author    = {Barbaiani, Mădălina and Cancedda, Nicola and Dance, Chris and Fazekas, Szil{\´a}rd and Ga{\´a}l, Tam{\´a}s and Gaussier, {\´E}ric},
  title     = {Asymmetric term alignment with selective contiguity constraints by multi-tape automata},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27115},
  year      = {2008},
  abstract  = {This article describes a HMM-based word-alignment method that can selectively enforce a contiguity constraint. This method has a direct application in the extraction of a bilingual terminological lexicon from a parallel corpus, but can also be used as a preliminary step for the extraction of phrase pairs in a Phrase-Based Statistical Machine Translation system. Contiguous source words composing terms are aligned to contiguous target language words. The HMM is transformed into a Weighted Finite State Transducer (WFST) and contiguity constraints are enforced by specific multi-tape WFSTs. The proposed method is especially suited when basic linguistic resources (morphological analyzer, part-of-speech taggers and term extractors) are available for the source language only.},
  language  = {en}
}