Biased group decision-making and the effect of computer-mediated communication: separating the effects of anonymity, voting and blind picking

The influence of communication technology on group decision-making has been examined in many studies. But the findings are inconsistent. Some studies showed a positive effect on decision quality, other studies have shown that communication technology makes the decision even worse. One possible explanation for these different findings could be the use of different Group Decision Support Systems (GDSS) in these studies, with some GDSS better fitting to the given task than others and with different sets of functions. This paper outlines an approach with an information system solely designed to examine the effect of (1) anonymity, (2) voting and (3) blind picking on decision quality, discussion quality and perceived quality of information.

Dimensions, issues, and bills: Appropriations voting on the house floor

One of the fundamental findings in the congressional literature is that one or sometimes two dimensions can successfully describe roll-call voting. In this paper we investigate if we can reach the same conclusions about low dimensionality when we divide the roll-call agenda into subsets of relatively homogeneous subject matter. We are primarily interested in the degree to which the same ordering of representatives is yielded across these different groups of votes. To conduct our analysis we focus on all roll calls on the 13 annual appropriations bills across eight congresses. When we concentrate on these smaller issue areas, we find that voting is multidimensional and members do not vote in a consistent ideological fashion across all issue areas. Copyright © Southern Political Science Association 2010.

Mobilizing Maryland: a look into the voting tendencies of students at the University of Maryland

Gemstone Team VOTE-CP (Voice of the Electorate - Collegiate Participation)

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.

[Book review] Peter Reimann and Hans Spada (eds), Learning in Humans and Machines: Towards an Interdisciplinary Learning Science

Review of: Peter Reimann and Hans Spada (eds), Learning in Humans and Machines: Towards an Interdisciplinary Learning Science, Pergamon. (1995). ISBN: 978-0080425696

Scheduling parallel dedicated machines under a single non-shared resource

The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered. For different variants of the problem the complexity status is established. Heuristic algorithms employing the so-called group technology approach are presented and their worst-case behavior is examined. Finally, a polynomial time approximation scheme is presented for the problem with fixed number of machines.

Scheduling problems for parallel dedicated machines under multiple resource constraints

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.

Support vector machines for regression and applications to software quality prediction

Software metrics are the key tool in software quality management. In this paper, we propose to use support vector machines for regression applied to software metrics to predict software quality. In experiments we compare this method with other regression techniques such as Multivariate Linear Regression, Conjunctive Rule and Locally Weighted Regression. Results on benchmark dataset MIS, using mean absolute error, and correlation coefficient as regression performance measures, indicate that support vector machines regression is a promising technique for software quality prediction. In addition, our investigation of PCA based metrics extraction shows that using the first few Principal Components (PC) we can still get relatively good performance.

Scheduling parallel dedicated machines with the speeding-up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Preemptive scheduling on uniform parallel machines with controllable job processing times

In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.

Caged birds and cloning machines: how student imagery 'speaks' to us about cultures of schooling and student participation

With the advent of the United Nations Convention on the Rights of the Child (CRC), there is an increasing requirement that schools ensure children and young people's views are voiced, listened to and taken seriously on matters of significance. Encouraging these shifts by law is one thing; changing the culture in schools is another. For a significant proportion of schools, actively engaging students' voices on how they experience education poses a significant challenge and crucial gaps may exist between the rhetoric espoused and a school's readiness for genuine student involvement. This ethnographic study illuminates tensions that persist between headteachers' espoused views of how students are valued and students' creative images of their actual post-primary schooling experience. If cultures of schooling are to nurture the true spirit of democratic pupil participation implied by changes in the law, there is a need to develop genuine processes of student engagement in which students and staff can collaborate towards greater shared understandings of a school's priorities.

'The Aftermath of the Annan Plan Referendums' Cross-Voting Moderation for Cyprus

This article examines recent developments in the Cyprus negotiations and suggests a number of changes to the proposed electoral system. Specifically, cross-voting and other electoral methods that encourage coalition-building across ethnic communities might add significantly to the functionality of the Annan Plan. Combined with other innovative mechanisms already in the plan, cross-voting could force political parties to seriously take into account the interests and concerns of the two Cypriot communities, an element that is currently missing from both the Turkish Cypriot (TC) and Greek Cypriot (GC) political systems. Special conditions on the island, as well as the way most political parties operated in the critical pre-April 2004 referendum period, suggest the need for this amendment. Although this study respects the consociational logic of the Annan Plan, it supplements consociationalism with elements that foster integration and inter-dependence between the two communities and their voters. The article also reviews the postreferendum developments in Cyprus which might have worrisome future implications, not only for its two communities, but also for EU enlargement in general. Cyprus both holds one of the keys to Turkey's entrance into the EU and is a litmus test for the Euro-Atlantic nexus and its capacity to pacify and integrate ethnically divided societies in Europe and elsewhere.

Perceptions and reality: Economic voting at the 2004 European Parliament elections

One of the most influential explanations of voting behaviour is based on economic factors: when the economy is doing well, voters reward the incumbent government and when the economy is doing badly, voters punish the incumbent. This reward-punishment model is thought to be particularly appropriate at second order contests such as European Parliament elections. Yet operationalising this economic voting model using citizens' perceptions of economic performance may suffer from endogeneity problems if citizens' perceptions are in fact a function of their party preferences rather than being a cause of their party preferences. Thus, this article models a 'strict' version of economic voting in which they purge citizens' economic perceptions of partisan effects and only use as a predictor of voting that portion of citizens' economic perceptions that is caused by the real world economy. Using data on voting at the 2004 European Parliament elections for 23 European Union electorates, the article finds some, but limited, evidence for economic voting that is dependent on both voter sophistication and clarity of responsibility for the economy within any country. First, only politically sophisticated voters' subjective economic assessments are in fact grounded in economic reality. Second, the portion of subjective economic assessments that is a function of the real world economy is a significant predictor of voting only in single party government contexts where there can be a clear attribution of responsibility. For coalition government contexts, the article finds essentially no impact of the real economy via economic perceptions on vote choice, at least at European Parliament elections.