@article{BoernerBulatovChenetal.2009,
  author    = {Boerner, Ferdinand and Bulatov, Andrei and Chen, Hubie and Jeavons, Peter and Krokhin, Andrei},
  title     = {The complexity of constraint satisfaction games and QCSP},
  issn      = {0890-5401},
  doi       = {10.1016/J.Ic.2009.05.003},
  year      = {2009},
  abstract  = {We study the complexity of two-person constraint satisfaction games. An instance of such a game is given by a collection of constraints on overlapping sets of variables, and the two players alternately make moves assigning values from a finite domain to the variables, in a specified order. The first player tries to satisfy all constraints, while the other tries to break at least one constraint: the goal is to decide whether the first player has a winning strategy. We show that such games can be conveniently represented by a logical form of quantified constraint satisfaction, where an instance is given by a first-order sentence in which quantifiers alternate and the quantifier-free part is a conjunction of (positive) atomic formulas; the goal is to decide whether the sentence is true. While the problem of deciding such a game is PSPACE-complete in general, by restricting the set of allowed constraint predicates, one can obtain infinite classes of constraint satisfaction games of lower complexity. We use the quantified constraint satisfaction framework to study how the complexity of deciding such a game depends on the parameter set of allowed predicates. With every predicate. one can associate certain predicate-preserving operations, called polymorphisms. We show that the complexity of our games is determined by the surjective polymorphisms of the constraint predicates. We illustrate how this result can be used by identifying the complexity of a wide variety of constraint satisfaction games.},
  language  = {en}
}
@article{Bobda2009,
  author    = {Bobda, Christophe},
  title     = {Special issue on ReCoSoC 2007 : editorial},
  issn      = {0141-9331},
  doi       = {10.1016/j.micpro.2009.01.001},
  year      = {2009},
  language  = {en}
}
@article{BlumBoldeaMagedanzetal.2010,
  author    = {Blum, Niklas and Boldea, Irina and Magedanz, Thomas and Margaria, Tiziana},
  title     = {Service-oriented access to next generation networks : from service creation to execution},
  issn      = {1383-469X},
  doi       = {10.1007/s11036-010-0222-1},
  year      = {2010},
  abstract  = {Existing telecommunication networks and classical roles of operators are subject to fundamental change. Many network operators are currently seeking for new sources to generate revenue by exposing network capabilities to 3rd party service providers. At the same time we can observe that services on the World Wide Web (WWW) are becoming mature in terms of the definition of APIs that are offered towards other services. The combinations of those services are commonly referred to as Web 2.0 mash-ups. Rapid service design and creation becomes therefore important to meet the requirements in a changing technology and competitive market environment. This report describes our approach to include Next Generation Networks (NGN)-based telecommunications application enabler into complex services by defining a service broker that mediates between 3rd party applications and NGN service enablers. It provides policy-driven orchestration mechanisms for service enablers, a service authorization functionality, and a service discovery interface for Service Creation Environments. The work has been implemented as part of the Open SOA Telco Playground testbed at Fraunhofer FOKUS.},
  language  = {en}
}
@article{BlankertzMuellerKrusienskietal.2006,
  author    = {Blankertz, Benjamin and M{\"u}ller, Klaus-Robert and Krusienski, Dean and Schalk, Gerwin and Wolpaw, Jonathan R. and Schl{\"o}gl, Alois and Pfurtscheller, Gert and Millan, Jos{\´e} del R. and Schr{\"o}der, Michael and Birbaumer, Niels},
  title     = {The BCI competition III : validating alternative approaches to actual BCI problems},
  issn      = {1534-4320},
  doi       = {10.1109/Tnsre.2006.875642},
  year      = {2006},
  abstract  = {A brain-computer interface (BCI) is a system that allows its users to control external devices with brain activity. Although the proof-of-concept was given decades ago, the reliable translation of user intent into device control commands is still a major challenge. Success requires the effective interaction of two adaptive controllers: the user's brain, which produces brain activity that encodes intent, and the BCI system, which translates that activity into device control commands. In order to facilitate this interaction, many laboratories are exploring a variety of signal analysis techniques to improve the adaptation of the BCI system to the user. In the literature, many machine learning and pattern classification algorithms have been reported to give impressive results when applied to BCI data in offline analyses. However, it is more difficult to evaluate their relative value for actual online use. BCI data competitions have been organized to provide objective formal evaluations of alternative methods. Prompted by the great interest in the first two BCI Competitions, we organized the third BCI Competition to address several of the most difficult and important analysis problems in BCI research. The paper describes the data sets that were provided to the competitors and gives an overview of the results.},
  language  = {en}
}
@article{BlankertzMuellerCurioetal.2004,
  author    = {Blankertz, Benjamin and M{\"u}ller, Klaus-Robert and Curio, Gabriel and Vaughan, Theresa M. and Schalk, Gerwin and Wolpaw, Jonathan R. and Schlogl, Alois and Neuper, Christa and Pfurtscheller, Gert and Hinterberger, Thilo and Schroder, Michael and Birbaumer, Niels},
  title     = {The BCI competition 2003 : Progress and perspectives in detection and discrimination of EEG single trials},
  issn      = {0018-9294},
  year      = {2004},
  abstract  = {Interest in developing a new method of man-to-machine communication-a brain-computer interface (BCI)-has grown steadily over the past few decades. BCIs create a new communication channel between the brain and an output device by bypassing conventional motor output pathways of nerves and muscles. These systems use signals recorded from the scalp, the surface of the cortex, or from inside the brain to enable users to control a variety of applications including simple word-processing software and orthotics. BCI technology could therefore provide a new communication and control option for individuals who cannot otherwise express their wishes to the outside world. Signal processing and classification methods are essential tools in the development of improved BCI technology. We organized the BCI Competition 2003 to evaluate the current state of the art of these tools. Four laboratories well versed in EEG-based BCI research provided six data sets in a documented format. We made these data sets (i.e., labeled training sets and unlabeled test sets) and their descriptions available on the Internet. The goal in the competition was to maximize the performance measure for the test labels. Researchers worldwide tested their algorithms and competed for the best classification results. This paper describes the six data sets and the results and function of the most successful algorithms},
  language  = {en}
}
@article{BlankertzDornhegeKrauledatetal.2006,
  author    = {Blankertz, Benjamin and Dornhege, Guido and Krauledat, Matthias and M{\"u}ller, Klaus-Robert and Kunzmann, Volker and Losch, Florian and Curio, Gabriel},
  title     = {The Berlin brain-computer interface : EEG-based communication without subject training},
  issn      = {1534-4320},
  doi       = {10.1109/Tnsre.2006.875557},
  year      = {2006},
  abstract  = {The Berlin Brain-Computer Interface (BBCI) project develops a noninvasive BCI system whose key features are 1) the use of well-established motor competences as control paradigms, 2) high-dimensional features from 128-channel electroencephalogram (EEG), and 3) advanced machine learning techniques. As reported earlier, our experiments demonstrate that very high information transfer rates can be achieved using the readiness potential (RP) when predicting the laterality of upcoming left-versus right-hand movements in healthy subjects. A more recent study showed that the RP similarily accompanies phantom movements in arm amputees, but the signal strength decreases with longer loss of the limb. In a complementary approach, oscillatory features are used to discriminate imagined movements (left hand versus right hand versus foot). In a recent feedback study with six healthy subjects with no or very little experience with BCI control, three subjects achieved an information transfer rate above 35 bits per minute (bpm), and further two subjects above 24 and 15 bpm, while one subject could not achieve any BCI control. These results are encouraging for an EEG-based BCI system in untrained subjects that is independent of peripheral nervous system activity and does not rely on evoked potentials even when compared to results with very well-trained subjects operating other BCI systems},
  language  = {en}
}
@article{Blaese2014,
  author    = {Blaese, Leif},
  title     = {Data mining for unidentified protein squences},
  series = {Process design for natural scientists: an agile model-driven approach},
  journal   = {Process design for natural scientists: an agile model-driven approach},
  number    = {500},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {73 -- 87},
  year      = {2014},
  abstract  = {Through the use of next generation sequencing (NGS) technology, a lot of newly sequenced organisms are now available. Annotating those genes is one of the most challenging tasks in sequence biology. Here, we present an automated workflow to find homologue proteins, annotate sequences according to function and create a three-dimensional model.},
  language  = {en}
}
@article{BickelBruecknerScheffer2009,
  author    = {Bickel, Steffen and Br{\"u}ckner, Michael and Scheffer, Tobias},
  title     = {Discriminative learning under covariate shift},
  issn      = {1532-4435},
  year      = {2009},
  abstract  = {We address classification problems for which the training instances are governed by an input distribution that is allowed to differ arbitrarily from the test distribution-problems also referred to as classification under covariate shift. We derive a solution that is purely discriminative: neither training nor test distribution are modeled explicitly. The problem of learning under covariate shift can be written as an integrated optimization problem. Instantiating the general optimization problem leads to a kernel logistic regression and an exponential model classifier for covariate shift. The optimization problem is convex under certain conditions; our findings also clarify the relationship to the known kernel mean matching procedure. We report on experiments on problems of spam filtering, text classification, and landmine detection.},
  language  = {en}
}
@article{BickelBruecknerScheffer2009,
  author    = {Bickel, Steffen and Brueckner, Michael and Scheffer, Tobias},
  title     = {Discriminative learning under covariate shift},
  issn      = {1532-4435},
  year      = {2009},
  abstract  = {We address classification problems for which the training instances are governed by an input distribution that is allowed to differ arbitrarily from the test distribution-problems also referred to as classification under covariate shift. We derive a solution that is purely discriminative: neither training nor test distribution are modeled explicitly. The problem of learning under covariate shift can be written as an integrated optimization problem. Instantiating the general optimization problem leads to a kernel logistic regression and an exponential model classifier for covariate shift. The optimization problem is convex under certain conditions; our findings also clarify the relationship to the known kernel mean matching procedure. We report on experiments on problems of spam filtering, text classification, and landmine detection.},
  language  = {en}
}
@article{BibelBrueningOttenetal.1998,
  author    = {Bibel, Wolfgang and Br{\"u}ning, Stefan and Otten, Jens and Rath, Thomas and Schaub, Torsten},
  title     = {Compressions and extensions},
  year      = {1998},
  language  = {en}
}
@article{BhattacharyaDimitrievGoessel2000,
  author    = {Bhattacharya, M. K. and Dimitriev, Alexej and G{\"o}ssel, Michael},
  title     = {Zero-aliasing space compresion using a single periodic output and its application to testing of embedded},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2003,
  author    = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2002,
  author    = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{BesnardSchaub1995,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {An approach to context-based default reasoning},
  issn      = {0169-2968},
  year      = {1995},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Characterization of non-monotone non-constructive systems},
  issn      = {1012-2443},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Signed systems for paraconsistent reasoning},
  issn      = {0168-7433},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Signed systems for paraconsistent reasoning},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1993,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {A context-based framework for default logics},
  isbn      = {0-262-51071-5},
  year      = {1993},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Significant inferences},
  isbn      = {1-55860-690-4},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {What is a (non-constructive) non-monotone logical system?},
  issn      = {0304-3975},
  year      = {2000},
  language  = {en}
}