@article{BruggemeierDovifatKubisch2005,
  author    = {Bruggemeier, M. and Dovifat, A. and Kubisch, D.},
  title     = {Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government},
  issn      = {0937-6429},
  year      = {2005},
  abstract  = {E-Government requires technical and organizational innovation. Research has already shown that the respective innovation process is complex and contingent upon specific organizational structures. Managing such innovation processes successfully is difficult. Drawing on assumptions of micropolitical behavior, a framework of innovation arenas is proposed. It supports the analysis of ongoing E-Government projects as well as the ex post investigation of successful or failed projects. Testing this framework in case studies already demonstrates its usefulness for individual actors making strategic choices about change management. Furthermore, the results indicate that many commonly held assumptions about successful change management have to be reconsidered},
  language  = {en}
}
@article{BordihnHolzerKutrib2005,
  author    = {Bordihn, Henning and Holzer, Markus and Kutrib, Martin},
  title     = {Unsolvability levels of operation problems for subclasses of context-free languages},
  issn      = {0129-0541},
  year      = {2005},
  abstract  = {We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449},
  language  = {en}
}
@article{Bordihn2005,
  author    = {Bordihn, Henning},
  title     = {On the number of components in cooperating distributed grammar systems},
  issn      = {0304-3975},
  year      = {2005},
  abstract  = {It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components. (C) 2004 Elsevier B.V. All rights reserved},
  language  = {en}
}
@article{BeerenwinkelSingLengaueretal.2005,
  author    = {Beerenwinkel, Niko and Sing, Tobias and Lengauer, Thomas and Rahnenfuhrer, Joerg and Roomp, Kirsten and Savenkov, Igor and Fischer, Roman and Hoffmann, Daniel and Selbig, Joachim and Korn, Klaus and Walter, Hauke and Berg, Thomas and Braun, Patrick and Faetkenheuer, Gerd and Oette, Mark and Rockstroh, Juergen and Kupfer, Bernd and Kaiser, Rolf and Daeumer, Martin},
  title     = {Computational methods for the design of effective therapies against drug resistant HIV strains},
  year      = {2005},
  abstract  = {The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data},
  language  = {en}
}
@article{SchefflerSchnor2005,
  author    = {Scheffler, Thomas and Schnor, Bettina},
  title     = {Privacy Requirements for Embedded Sensor Devices},
  isbn      = {978-3-800729-09-8},
  year      = {2005},
  abstract  = {This paper analyses data privacy issues as they arise from different deployment scenarios for networks that use embedded sensor devices. Maintaining data privacy in pervasive environments requires the management and implementation of privacy protection measures close to the data source. We propose a set of atomic privacy parameters that is generic enough to form specific privacy classes and might be applied directly at the embedded sensor device.},
  language  = {en}
}
@article{GoesselMorozovSapozhnikovetal.2005,
  author    = {Goessel, Michael and Morozov, A. V. and Sapozhnikov, V. V. and Sapozhaikov, Vl. V.},
  title     = {Checking combinational circuits by the method of logic complement},
  issn      = {0005-1179},
  year      = {2005},
  abstract  = {Design of fully self-testing combinational circuits was considered. A theorem defining the conditions for guaranteed logic complement-based design of fully self-testing circuit was proved. Examples were presented},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@article{FaberKonczak2005,
  author    = {Faber, Wolfgang and Konczak, Kathrin},
  title     = {Strong Equivalence for Logic Programs with Preferences},
  year      = {2005},
  language  = {en}
}
@article{GrellKonczakSchaub2005,
  author    = {Grell, Susanne and Konczak, Kathrin and Schaub, Torsten H.},
  title     = {nomore) : a system for computing preferred Answer Sets},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}