@inproceedings{AbdennadherIsmailKhoury2010,
  author    = {Abdennadher, Slim and Ismail, Haythem and Khoury, Frederick},
  title     = {Transforming imperative algorithms to constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41533},
  year      = {2010},
  abstract  = {Different properties of programs, implemented in Constraint Handling Rules (CHR), have already been investigated. Proving these properties in CHR is fairly simpler than proving them in any type of imperative programming language, which triggered the proposal of a methodology to map imperative programs into equivalent CHR. The equivalence of both programs implies that if a property is satisfied for one, then it is satisfied for the other. The mapping methodology could be put to other beneficial uses. One such use is the automatic generation of global constraints, at an attempt to demonstrate the benefits of having a rule-based implementation for constraint solvers.},
  language  = {en}
}
@inproceedings{Arnold2006,
  author    = {Arnold, Gabriele},
  title     = {Beitr{\"a}ge zur spektralen Fernerkundung fester planetarer Oberfl{\"a}chen},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7235},
  year      = {2006},
  abstract  = {Dr. Gabriele Arnold ist Leiterin des Bereichs Optische Informationssyteme am Institut f{\"u}r Planetenforschung des Deutschen Zentrums f{\"u}r Luft- und Raumfahrt (DLR) in Berlin-Adlershof <hr> Interdisziplin{\"a}res Zentrum f{\"u}r Musterdynamik und Angewandte Fernerkundung Workshop vom 9. - 10. Februar 2006},
  language  = {de}
}
@inproceedings{ArtsteinPoesio2006,
  author    = {Artstein, Ron and Poesio, Massimo},
  title     = {Identifying reference to abstract objects in dialogue},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10357},
  year      = {2006},
  abstract  = {In two experiments, many annotators marked antecedents for discourse deixis as unconstrained regions of text. The experiments show that annotators do converge on the identity of these text regions, though much of what they do can be captured by a simple model. Demonstrative pronouns are more likely than definite descriptions to be marked with discourse antecedents. We suggest that our methodology is suitable for the systematic study of discourse deixis.},
  language  = {en}
}
@inproceedings{BandaGallagher2010,
  author    = {Banda, Gourinath and Gallagher, John P.},
  title     = {Constraint-based abstraction of a model checker for infinite state systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41516},
  year      = {2010},
  abstract  = {Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.},
  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}
}
@inproceedings{Barthelemy2008,
  author    = {Barth{\´e}lemy, Fran{\c{c}}ois},
  title     = {Finite-state compilation of feature structures for two-level morphology},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27120},
  year      = {2008},
  abstract  = {This paper describes a two-level formalism where feature structures are used in contextual rules. Whereas usual two-level grammars describe rational sets over symbol pairs, this new formalism uses tree structured regular expressions. They allow an explicit and precise definition of the scope of feature structures. A given surface form may be described using several feature structures. Feature unification is expressed in contextual rules using variables, like in a unification grammar. Grammars are compiled in finite state multi-tape transducers.},
  language  = {en}
}
@inproceedings{Bartle2008,
  author    = {Bartle, Richard},
  title     = {When openness closes : the line between play and design},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-24536},
  year      = {2008},
  abstract  = {One of the informal properties often used to describe a new virtual world is its degree of openness. Yet what is an "open" virtual world? Does the phrase mean generally the same thing to different people? What distinguishes an open world from a less open world? Why does openness matter anyway? The answers to these questions cast light on an important, but shadowy, and uneasy, topic for virtual worlds: the relationship between those who construct the virtual, and those who use these constructions.},
  language  = {en}
}
@inproceedings{BergmannKopp2006,
  author    = {Bergmann, Kirsten and Kopp, Stefan},
  title     = {Verbal or visual? : How information is distributed across speech and gesture in spatial dialog},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10375},
  year      = {2006},
  abstract  = {In spatial dialog like in direction giving humans make frequent use of speechaccompanying gestures. Some gestures convey largely the same information as speech while others complement speech. This paper reports a study on how speakers distribute meaning across speech and gesture, and depending on what factors. Utterance meaning and the wider dialog context were tested by statistically analyzing a corpus of direction-giving dialogs. Problems of speech production (as indicated by discourse markers and disfluencies), the communicative goals, and the information status were found to be influential, while feedback signals by the addressee do not have any influence.},
  language  = {en}
}
@inproceedings{Berndt2003,
  author    = {Berndt, Sergei},
  title     = {O kategoriach żywotności w języku polskim},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27746},
  year      = {2003},
  language  = {mul}
}
@inproceedings{BetzRaiserFruehwirth2010,
  author    = {Betz, Hariolf and Raiser, Frank and Fr{\"u}hwirth, Thom},
  title     = {Persistent constraints in constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41547},
  year      = {2010},
  abstract  = {In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.},
  language  = {en}
}
@inproceedings{BeyssadeMarandin2006,
  author    = {Beyssade, Claire and Marandin, Jean-Marie},
  title     = {From complex to simple speech acts : a bidimensional analysis of illocutionary},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10319},
  year      = {2006},
  abstract  = {We present a new analysis of illocutionary forces in dialogue. We analyze them as complex conversational moves involving two dimensions: what Speaker commits herself to and what she calls on Addressee to perform. We start from the analysis of speech acts such as confirmation requests or whimperatives, and extend the analysis to seemingly simple speech acts, such as statements and queries. Then, we show how to integrate our proposal in the framework of the Grammar for Conversation (Ginzburg, to app.), which is adequate for modelling agents' information states and how they get updated.},
  language  = {en}
}
@inproceedings{Bischof2005,
  author    = {Bischof, Ulrike},
  title     = {Nachlasserschließung im Goethe- und Schiller-Archiv},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-6081},
  year      = {2005},
  abstract  = {Beitr{\"a}ge zum Thema "Nachl{\"a}sse an Universit{\"a}ts- und Hochschularchiven sowie Archiven wissenschaftlicher Institutionen" im Rahmen der Fr{\"u}hjahrstagung der Fachgruppe 8: "Archivare an Hochschularchiven und Archiven wissenschaftlicher Institutionen" am 16./17. Juni an der Universit{\"a}t Potsdam.},
  subject      = {Archiv},
  language  = {de}
}
@inproceedings{BlancConstantWatrin2008,
  author    = {Blanc, Olivier and Constant, Matthieu and Watrin, Patrick},
  title     = {Segmentation in super-chunks with a finite-state approach},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27133},
  year      = {2008},
  abstract  = {Since Harris' parser in the late 50s, multiword units have been progressively integrated in parsers. Nevertheless, in the most part, they are still restricted to compound words, that are more stable and less numerous. Actually, language is full of semi-fixed expressions that also form basic semantic units: semi-fixed adverbial expressions (e.g. time), collocations. Like compounds, the identification of these structures limits the combinatorial complexity induced by lexical ambiguity. In this paper, we detail an experiment that largely integrates these notions in a finite-state procedure of segmentation into super-chunks, preliminary to a parser.We show that the chunker, developped for French, reaches 92.9\% precision and 98.7\% recall. Moreover, multiword units realize 36.6\% of the attachments within nominal and prepositional phrases.},
  language  = {en}
}
@inproceedings{Blomme2007,
  author    = {Blomme, R.},
  title     = {Corotating Interaction Regions and clumping},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-18100},
  year      = {2007},
  abstract  = {We present hydrodynamical models for Corotating Interaction Regions, which were used by Lobel (2007) to model the Discrete Absorption Components in HD 64760. We also discuss our failure to model the rotational modulations seen in the same star.},
  language  = {en}
}
@inproceedings{Bogost2008,
  author    = {Bogost, Ian},
  title     = {The phenomenology of videogames},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-24547},
  year      = {2008},
  abstract  = {Jesper Juul has convincingly argued that the conflict over the proper object of study has shifted from "rules or story" to "player or game." But a key component of digital games is still missing from either of these oppositions: that of the computer itself. This paper offers a way of thinking about the phenomenology of the videogame from the perspective of the computer rather than the game or the player.},
  language  = {en}
}
@inproceedings{BonfanteLeRoux2008,
  author    = {Bonfante, Guillaume and Le Roux, Joseph},
  title     = {Intersection optimization is NP-complete},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27146},
  year      = {2008},
  abstract  = {Finite state methods for natural language processing often require the construction and the intersection of several automata. In this paper, we investigate the question of determining the best order in which these intersections should be performed. We take as an example lexical disambiguation in polarity grammars. We show that there is no efficient way to minimize the state complexity of these intersections.},
  language  = {en}
}
@inproceedings{BouretLanzHillieretal.2007,
  author    = {Bouret, J.-C. and Lanz, T. and Hillier, D. J. and Foellmi, C.},
  title     = {Clumping in O-type Supergiants},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17662},
  year      = {2007},
  abstract  = {We have analyzed the spectra of seven Galactic O4 supergiants, with the NLTE wind code CMFGEN. For all stars, we have found that clumped wind models match well lines from different species spanning a wavelength range from FUV to optical, and remain consistent with Hα data. We have achieved an excellent match of the P V λλ1118, 1128 resonance doublet and N IV λ1718, as well as He II λ4686 suggesting that our physical description of clumping is adequate. We find very small volume filling factors and that clumping starts deep in the wind, near the sonic point. The most crucial consequence of our analysis is that the mass loss rates of O stars need to be revised downward significantly, by a factor of 3 and more compared to those obtained from smooth-wind models.},
  language  = {en}
}
@inproceedings{Brass2010,
  author    = {Brass, Stefan},
  title     = {Range restriction for general formulas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41521},
  year      = {2010},
  abstract  = {Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and produce only a finite number of new tuples (in each iteration of the TP-operator: the fixpoint can still be infinite). It is also necessary to respect binding restrictions of built-in predicates: many of these predicates can be executed only when certain arguments are ground. Whereas for standard logic programming rules, questions of safety, allowedness, and range-restriction are relatively easy and well understood, the situation for general formulas is a bit more complicated. We give a syntactic analysis of formulas that guarantees the necessary properties.},
  language  = {en}
}
@inproceedings{BynensVanLanduytTruyenetal.2010,
  author    = {Bynens, Maarten and Van Landuyt, Dimitri and Truyen, Eddy and Joosen, Wouter},
  title     = {Towards reusable aspects: the callback mismatch problem},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41347},
  year      = {2010},
  abstract  = {Because software development is increasingly expensive and timeconsuming, software reuse gains importance. Aspect-oriented software development modularizes crosscutting concerns which enables their systematic reuse. Literature provides a number of AOP patterns and best practices for developing reusable aspects based on compelling examples for concerns like tracing, transactions and persistence. However, such best practices are lacking for systematically reusing invasive aspects. In this paper, we present the 'callback mismatch problem'. This problem arises in the context of abstraction mismatch, in which the aspect is required to issue a callback to the base application. As a consequence, the composition of invasive aspects is cumbersome to implement, difficult to maintain and impossible to reuse. We motivate this problem in a real-world example, show that it persists in the current state-of-the-art, and outline the need for advanced aspectual composition mechanisms to deal with this.},
  language  = {en}
}
@inproceedings{BoegelButtHautlietal.2008,
  author    = {B{\"o}gel, Tina and Butt, Miriam and Hautli, Annette and Sulger, Sebastian},
  title     = {Developing a finite-state morphological analyzer for Urdu and Hindi},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27155},
  year      = {2008},
  abstract  = {We introduce and discuss a number of issues that arise in the process of building a finite-state morphological analyzer for Urdu, in particular issues with potential ambiguity and non-concatenative morphology. Our approach allows for an underlyingly similar treatment of both Urdu and Hindi via a cascade of finite-state transducers that transliterates the very different scripts into a common ASCII transcription system. As this transliteration system is based on the XFST tools that the Urdu/Hindi common morphological analyzer is also implemented in, no compatibility problems arise.},
  language  = {en}
}
@inproceedings{Cabalar2010,
  author    = {Cabalar, Pedro},
  title     = {Existential quantifiers in the rule body},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41476},
  year      = {2010},
  abstract  = {In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretation for any arbitrary theory in the syntax of Predicate Calculus. We present a translation of this syntactic class into standard logic programs with variables (either disjunctive or normal, depending on the input rule heads), as those allowed by current ASP solvers. The translation relies on the introduction of auxiliary predicates and the main result shows that it preserves strong equivalence modulo the original signature.},
  language  = {en}
}
@inproceedings{CalvilloGamezCairns2008,
  author    = {Calvillo-G{\´a}mez, Eduardo H. and Cairns, Paul},
  title     = {Pulling the strings : a theory of puppetry for the gaming experience},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27509},
  year      = {2008},
  abstract  = {The paper aims to bring the experience of playing videogames closer to objective knowledge, where the experience can be assessed and falsified via an operational concept. The theory focuses on explaining the basic elements that form the core of the process of the experience. The name of puppetry is introduced after discussing the similarities in the importance of experience for both videogames and theatrical puppetry. Puppetry, then, operationalizes the gaming experience into a concept that can be assessed.},
  language  = {en}
}
@inproceedings{Cassinelli2007,
  author    = {Cassinelli, Joseph P.},
  title     = {Discussion: Magnetic fields, variability},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-18195},
  year      = {2007},
  language  = {en}
}
@inproceedings{CassinelliIgnaceWaldronetal.2007,
  author    = {Cassinelli, Joseph P. and Ignace, R. and Waldron, W. and Cho, J. and Murphy, N. and Lazarian, A.},
  title     = {X-ray line emission produced in clump bow shocks},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-18057},
  year      = {2007},
  abstract  = {We summarize Chandra observations of the emission line profiles from 17 OB stars. The lines tend to be broad and unshifted. The forbidden/intercombination line ratios arising from Helium-like ions provide radial distance information for the X-ray emission sources, while the H-like to He-like line ratios provide X-ray temperatures, and thus also source temperature versus radius distributions. OB stars usually show power law differential emission measure distributions versus temperature. In models of bow shocks, we find a power law differential emission measure, a wide range of ion stages, and the bow shock flow around the clumps provides transverse velocities comparable to HWHM values. We find that the bow shock results for the line profile properties, consistent with the observations of X-ray line emission for a broad range of OB star properties.},
  language  = {en}
}
@inproceedings{CheneMoffatCrowther2007,
  author    = {Chen{\´e}, A.-N. and Moffat, Anthony F. J. and Crowther, P. A.},
  title     = {Rapidly accelerating clumps in the winds of the very hot WNE Stars},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-18163},
  year      = {2007},
  abstract  = {We study the time variability of emission lines in three WNE stars : WR 2 (WN2), WR 3 (WN3ha) and WR152 (WN3). While WR 2 shows no variability above the noise level, the other stars do show variation, which are like other WR stars in WR 152 but very fast in WR 3. From these motions, we deduce a value of β ∼1 for WR 3 that is like that seen in O stars and β ∼2-3 for WR 152, that is intermediate between other WR stars and WR 3.},
  language  = {en}
}
@inproceedings{CohenLeuteneggerTownsend2007,
  author    = {Cohen, David H. and Leutenegger, M. A. and Townsend, R. H. D.},
  title     = {Quantitative analysis of resolved X-ray emission line profiles of O stars},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-18115},
  year      = {2007},
  abstract  = {By quantitatively fitting simple emission line profile models that include both atomic opacity and porosity to the Chandra X-ray spectrum of ζ Pup, we are able to explore the trade-offs between reduced mass-loss rates and wind porosity. We find that reducing the mass-loss rate of ζ Pup by roughly a factor of four, to 1.5 × 10-6 M⊙ yr-1, enables simple non-porous wind models to provide good fits to the data. If, on the other hand, we take the literature mass-loss rate of 6×10-6 M⊙ yr-1, then to produce X-ray line profiles that fit the data, extreme porosity lengths - of h∞ ≈ 3 R∗ - are required. Moreover, these porous models do not provide better fits to the data than the non-porous, low optical depth models. Additionally, such huge porosity lengths do not seem realistic in light of 2-D numerical simulations of the wind instability.},
  language  = {en}
}
@inproceedings{Daciuk2008,
  author    = {Daciuk, Jan},
  title     = {Perfect hashing tree automata},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27163},
  year      = {2008},
  abstract  = {We present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.},
  language  = {en}
}
@inproceedings{DaviesVinkOudmaijer2007,
  author    = {Davies, B. and Vink, J. S. and Oudmaijer, R. D.},
  title     = {Modelling the polarimetric variability of hot stars},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17939},
  year      = {2007},
  abstract  = {Many hot stars exhibit stochastic polarimetric variability, thought to arise from clumping low in the wind. Here we investigate the wind properties required to reproduce this variability using analytic models, with particular emphasis on Luminous Blue Variables. We find that the winds must be highly structured, consisting of a large number of optically-thin clumps; while we find that the overall level of polarization should scale with mass-loss rate - consistent with observations of LBVs. The models also predict variability on very short timescales, which is supported by the results of a recent polarimetric monitoring campaign.},
  language  = {en}
}
@inproceedings{deKoterVinkMuijres2007,
  author    = {de Koter, A. and Vink, J. S. and Muijres, L.},
  title     = {Constraints on wind clumping from the empirical mass-loss vs. metallicity relation for early-type stars},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17736},
  year      = {2007},
  abstract  = {We present the latest results on the observational dependence of the mass-loss rate in stellar winds of O and early-B stars on the metal content of their atmospheres, and compare these with predictions. Absolute empirical rates for the mass loss of stars brighter than 10\$^{5.2} L_{\odot}\$, based on H\$\alpha\$ and ultraviolet (UV) wind lines, are found to be about a factor of two higher than predictions. If this difference is attributed to inhomogeneities in the wind this would imply that luminous O and early-B stars have clumping factors in their H\$\alpha\$ and UV line forming regime of about a factor of 3--5. The investigated stars cover a metallicity range \$Z\$ from 0.2 to 1 \$Z_{\odot}\$. We find a hint towards smaller clumping factors for lower \$Z\$. The derived clumping factors, however, presuppose that clumping does not impact the predictions of the mass-loss rate. We discuss this assumption and explain how we intend to investigate its validity in more detail.},
  language  = {en}
}
@inproceedings{DeVaultStone2006,
  author    = {DeVault, David and Stone, Matthew},
  title     = {Scorekeeping in an uncertain language game},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10448},
  year      = {2006},
  abstract  = {Received views of utterance context in pragmatic theory characterize the occurrent subjective states of interlocutors using notions like common knowledge or mutual belief. We argue that these views are not compatible with the uncertainty and robustness of context-dependence in human–human dialogue. We present an alternative characterization of utterance context as objective and normative. This view reconciles the need for uncertainty with received intuitions about coordination and meaning in context, and can directly inform computational approaches to dialogue.},
  language  = {en}
}
@inproceedings{Didakowski2008,
  author    = {Didakowski, J{\"o}rg},
  title     = {SynCoP : combining syntactic tagging with chunking using weighted finite state transducers},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27172},
  year      = {2008},
  abstract  = {This paper describes the key aspects of the system SynCoP (Syntactic Constraint Parser) developed at the Berlin-Brandenburgische Akademie der Wissenschaften. The parser allows to combine syntactic tagging and chunking by means of constraint grammar using weighted finite state transducers (WFST). Chunks are interpreted as local dependency structures within syntactic tagging. The linguistic theories are formulated by criteria which are formalized by a semiring; these criteria allow structural preferences and gradual grammaticality. The parser is essentially a cascade of WFSTs. To find the most likely syntactic readings a best-path search is used.},
  language  = {en}
}
@inproceedings{Diderichsen2006,
  author    = {Diderichsen, Philip},
  title     = {Cross recurrence quantification analysis of indefinite anaphora in Swedish dialog : an eye-tracking pilot experiment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10388},
  year      = {2006},
  abstract  = {A new method is used in an eye-tracking pilot experiment which shows that it is possible to detect differences in common ground associated with the use of minimally different types of indefinite anaphora. Following Richardson and Dale (2005), cross recurrence quantification analysis (CRQA) was used to show that the tandem eye movements of two Swedish-speaking interlocutors are slightly more coupled when they are using fully anaphoric indefinite expressions than when they are using less anaphoric indefinites. This shows the potential of CRQA to detect even subtle processing differences in ongoing discourse.},
  language  = {en}
}
@inproceedings{DoktorBadeckBondeauetal.2006,
  author    = {Doktor, Daniel and Badeck, Franz-Werner and Bondeau, Alberte and Koslowsky, Dirk and Schaber, J{\"o}rg and McAllister, Murdock},
  title     = {Using satellite imagery and ground observations to quantify the effect of intra-annually changing temperature patterns on spring time phenology},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7244},
  year      = {2006},
  abstract  = {Interdisziplin{\"a}res Zentrum f{\"u}r Musterdynamik und Angewandte Fernerkundung Workshop vom 9. - 10. Februar 2006},
  language  = {en}
}
@inproceedings{Domsch2006,
  author    = {Domsch, Horst},
  title     = {Pr{\"a}gnante r{\"a}umlich-zeitliche Muster einer landwirtschaftlich genutzten Fl{\"a}che},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7257},
  year      = {2006},
  abstract  = {In ihrem Bem{\"u}hen, landwirtschaftliche Fl{\"a}chen standortgerecht zu bewirtschaften, sammelt eine zunehmende Anzahl landwirtschaftlicher Betriebe Informationen {\"u}ber die r{\"a}umlich-zeitliche Verteilung von Boden- und Pflanzenmerkmalen auf ihren Schl{\"a}gen. Diese Informationen dienen unmittelbar (Echtzeitansatz) oder mittelbar (Kartenansatz) zur Dosierung von D{\"u}nge- und Pflanzenschutzmitteln (Pr{\"a}zise Landbewirtschaftung). Zur Datensammlung werden vorrangig fahrzeuggest{\"u}tzte Sensoren und VIS- und NIR-Luftbilder, aufgenommen aus Sportflugzeugen, verwendet. Erste Betriebe erwerben von Dienstleistungsunternehmen aufbereitete Satelliten-Fernerkundungsdaten. Die landwirtschaftliche und agrartechnische Forschung ist bestrebt, die grundlegenden Muster (z.B. des Ertragspotentials) zu erkennen und damit den Aufwand der Betriebe f{\"u}r eine regelm{\"a}ßige Informationserfassung gering zu halten. <hr> Interdisziplin{\"a}res Zentrum f{\"u}r Musterdynamik und Angewandte Fernerkundung Workshop vom 9. - 10. Februar 2006},
  language  = {de}
}
@inproceedings{DrużbickaGibasTuszyńska2003,
  author    = {Drużbicka, Aleksandra and Gibas, Marta and Tuszyńska, Joanna},
  title     = {Świadomość językowa młodej inteligencji śląskiej},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27755},
  year      = {2003},
  language  = {mul}
}
@inproceedings{DzikovskaCallawayStoneetal.2006,
  author    = {Dzikovska, Myroslava O. and Callaway, Charles B. and Stone, Matthew and Moore, Johanna D.},
  title     = {Understanding student input for tutorial dialogue in procedural domains},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10193},
  year      = {2006},
  abstract  = {We present an analysis of student language input in a corpus of tutoring dialogue in the domain of symbolic differentiation. Our focus on procedural tutoring makes the dialogue comparable to collaborative problem-solving (CPS). Existing CPS models describe the process of negotiating plans and goals, which also fits procedural tutoring. However, we provide a classification of student utterances and corpus annotation which shows that approximately 28\% of non-trivial student language in this corpus is not accounted for by existing models, and addresses other functions, such as evaluating past actions or correcting mistakes. Our analysis can be used as a foundation for improving models of tutoring dialogue.},
  language  = {en}
}
@inproceedings{FanMasuharaAotanietal.2010,
  author    = {Fan, Yang and Masuhara, Hidehiko and Aotani, Tomoyuki and Nielson, Flemming and Nielson, Hanne Riis},
  title     = {AspectKE*: Security aspects with program analysis for distributed systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41369},
  year      = {2010},
  abstract  = {Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.},
  language  = {en}
}
@inproceedings{FeldmeierHamannRaetzeletal.2007,
  author    = {Feldmeier, Achim and Hamann, Wolf-Rainer and R{\"a}tzel, D. and Oskinova, Lida},
  title     = {Hydrodynamic simulations of clumps},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17975},
  year      = {2007},
  abstract  = {Clumps in hot star winds can originate from shock compression due to the line driven instability. One-dimensional hydrodynamic simulations reveal a radial wind structure consisting of highly compressed shells separated by voids, and colliding with fast clouds. Two-dimensional simulations are still largely missing, despite first attempts. Clumpiness dramatically affects the radiative transfer and thus all wind diagnostics in the UV, optical, and in X-rays. The microturbulence approximation applied hitherto is currently superseded by a more sophisticated radiative transfer in stochastic media. Besides clumps, i.e. jumps in the density stratification, so-called kinks in the velocity law, i.e. jumps in dv/dr, play an eminent role in hot star winds. Kinks are a new type of radiative-acoustic shock, and propagate at super-Abbottic speed.},
  language  = {en}
}
@inproceedings{Fernando2008,
  author    = {Fernando, Tim},
  title     = {Temporal propositions as regular languages},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27194},
  year      = {2008},
  abstract  = {Temporal propositions are mapped to sets of strings that witness (in a precise sense) the propositions over discrete linear Kripke frames. The strings are collected into regular languages to ensure the decidability of entailments given by inclusions between languages. (Various notions of bounded entailment are shown to be expressible as language inclusions.) The languages unwind computations implicit in the logical (and temporal) connectives via a system of finite-state constraints adapted from finite-state morphology. Applications to Hybrid Logic and non-monotonic inertial reasoning are briefly considered.},
  language  = {en}
}
@inproceedings{Fiedler2003,
  author    = {Fiedler, Adrian},
  title     = {Liczebniki w języku polskim i chorwackim (i serbskim) pod względem kategorii żywotności},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27766},
  year      = {2003},
  language  = {mul}
}
@inproceedings{Fiedlerowa2003,
  author    = {Fiedlerowa, Alicja},
  title     = {Wulgaryzmu wpływ na urodę języka},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27779},
  year      = {2003},
  language  = {mul}
}
@inproceedings{Fullerton2007,
  author    = {Fullerton, A. W.},
  title     = {Discussion: Spectral modeling},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17917},
  year      = {2007},
  language  = {en}
}
@inproceedings{FullertonMassaPrinja2007,
  author    = {Fullerton, A. W. and Massa, D. L. and Prinja, R. K.},
  title     = {Revised mass-loss rates for O stars from the Pv resonance line},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17647},
  year      = {2007},
  abstract  = {The P v λλ1118, 1128 resonance doublet is an extraordinarily useful diagnostic of O-star winds, because it bypasses the traditional problems associated with determining mass-loss rates from UV resonance lines. We discuss critically the assumptions and uncertainties involved with using P v to diagnose mass-loss rates, and conclude that the large discrepancies between massloss rates determined from P v and the rates determined from "density squared" emission processes pose a significant challenge to the "standard model" of hot-star winds. The disparate measurements can be reconciled if the winds of O-type stars are strongly clumped on small spatial scales, which in turn implies that mass-loss rates based on Hα or radio emission are too large by up to an order of magnitude.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten H. and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@inproceedings{GeskeWolf2010,
  author    = {Geske, Ulrich and Wolf, Armin},
  title     = {Preface},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41401},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), W{\"u}rzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and W{\"u}rzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.},
  language  = {en}
}
@inproceedings{Glashuettner2008,
  author    = {Glash{\"u}ttner, Robert},
  title     = {The perception of video games : from visual power to immersive interaction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-24578},
  year      = {2008},
  abstract  = {This paper highlights the different ways of perceiving video games and video game content, incorporating interactive and non-interactive methods. It examines varying cognitive and emotive reactions by persons who are used to play video games as well as persons who are unfamiliar with the aesthetics and the most basic game play rules incorporated within video games. Additionally, the principle of "Flow" serves as a theoretical and philosophical foundation. A small case-study featuring two games has been made to emphasize the numerous possible ways of perception of video games.},
  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{GonzalezCasacuberta2008,
  author    = {Gonz{\´a}lez, Jorge and Casacuberta, Francisco},
  title     = {Phrase-based finite state models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27209},
  year      = {2008},
  abstract  = {In the last years, statistical machine translation has already demonstrated its usefulness within a wide variety of translation applications. In this line, phrase-based alignment models have become the reference to follow in order to build competitive systems. Finite state models are always an interesting framework because there are well-known efficient algorithms for their representation and manipulation. This document is a contribution to the evolution of finite state models towards a phrase-based approach. The inference of stochastic transducers that are based on bilingual phrases is carefully analysed from a finite state point of view. Indeed, the algorithmic phenomena that have to be taken into account in order to deal with such phrase-based finite state models when in decoding time are also in-depth detailed.},
  language  = {en}
}
@inproceedings{GrohHillierDamineli2007,
  author    = {Groh, J. H. and Hillier, D. J. and Damineli, A.},
  title     = {Mass-loss rate and clumping in LBV stars : the impact of time-dependent effects},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-17773},
  year      = {2007},
  abstract  = {This paper outlines a newly-developed method to include the effects of time variability in the radiative transfer code CMFGEN. It is shown that the flow timescale is often large compared to the variability timescale of LBVs. Thus, time-dependent effects significantly change the velocity law and density structure of the wind, affecting the derivation of the mass-loss rate, volume filling factor, wind terminal velocity, and luminosity. The results of this work are directly applicable to all active LBVs in the Galaxy and in the LMC, such as AG Car, HR Car, S Dor and R 127, and could result in a revision of stellar and wind parameters. The massloss rate evolution of AG Car during the last 20 years is presented, highlighting the need for time-dependent models to correctly interpret the evolution of LBVs.},
  language  = {en}
}