9,970 research outputs found
Dem Andenken des Herrn Georg Christian Schulz geweiht von Christoph Andreas Leonhard Creuzer
No full textDEM ANDENKEN DES HERRN GEORG CHRISTIAN SCHULZ GEWEIHT VON CHRISTOPH ANDREAS LEONHARD CREUZER
Dem Andenken des Herrn Georg Christian Schulz geweiht von Christoph Andreas Leonhard Creuzer ( - )
Title page ( - )
[Hauptteil.] (3
Ambulante Hilfen zur Erziehung in Familien aus Südosteuropa/Roma
No full textAMBULANTE HILFEN ZUR ERZIEHUNG IN FAMILIEN AUS SÜDOSTEUROPA/ROMA
Ambulante Hilfen zur Erziehung in Familien aus Südosteuropa/Roma / Schulz, Andreas [Hrsg.] (Rights reserved) (-
Integer-empty polytopes in the 0/1-cube with maximal Gomory–Chvátal rank
No full textWe provide a complete characterization of all polytopes P⊆[0,1]nP⊆[0,1][superscript n] with empty integer hulls, whose Gomory–Chvátal rank is n (and, therefore, maximal). In particular, we show that the first Gomory–Chvátal closure of all these polytopes is identical
Biased Information Search in Homogeneous Groups: Confidence as a Moderator for the Effect of Anticipated Task Requirements
No full textWhen searching for information, groups that are homogeneous regarding their members’ prediscussion decision preferences show a strong bias for information that supports rather than conflicts with the prevailing opinion (confirmation bias). The present research examined whether homogeneous groups blindly search for information confirming their beliefs irrespective of the anticipated task or whether they are sensitive to the usefulness of new information for this forthcoming task. Results of three experiments show that task sensitivity depends on the groups’ confidence in the correctness of their decision: Moderately confident groups displayed a strong confirmation bias when they anticipated having to give reasons for their decision but showed a balanced information search or even a disconfirmation bias (i.e., predominately seeking conflicting information) when they anticipated having to refute unterarguments. In contrast, highly confident groups demonstrated a strong confirmation bias independent of the anticipated task requirements
Combined Effects of Knowledge About Others' Opinions and Anticipation of Group Discussion on Confirmatory Information Search
No full textThere is conclusive evidence that information search processes are typically biased in favor of the information seeker’s own opinion (confirmation bias). Less is known about how knowledge about others’ opinions affects this confirmatory information search. In the present study, the authors manipulated feedback about others’ opinions and anticipation of group interaction. As predicted, the effect of knowledge about others’ opinions on confirmatory information search depended on whether participants anticipated interacting with these others. Specifically, minority members anticipating a group discussion exhibited a particularly strong confirmation bias, whereas minority members who did not anticipate a discussion predominantly sought information opposing their opinion. For participants not anticipating group interaction, confidence about the correctness of one’s decision mediated the impact of knowledge about others’ opinions on confirmatory information search. Results are discussed with regard to the debiasing effect of preference heterogeneity on confirmatory information search in groups
sj-docx-1-ips-10.1177_01925121211036417 – Supplemental material for Regional patterns of multilateral treaty cooperation: Is there a Latin American ‘commitment gap’?
No full textSupplemental material, sj-docx-1-ips-10.1177_01925121211036417 for Regional patterns of multilateral treaty cooperation: Is there a Latin American ‘commitment gap’? by Carsten-Andreas Schulz and Laura Levick in International Political Science Review</p
A Case Study on Colposcopy-Based Cervical Cancer Staging Reveals an Alarming Lack of Data Sharing Hindering the Adoption of Machine Learning in Clinical Practice
No full textNew Old Algorithms for Stochastic Scheduling
No full textWe consider the stochastic identical parallel machine scheduling problem and its online extension, when the objective is to minimize the expected total weighted completion time of a set of jobs that are released over time. We give randomized as well as deterministic online and offline algorithms that have the best known performance guarantees in either setting, online or offline and deterministic or randomized. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems that can be solved online
- …
