Why something like socialism is necessary for the transition to something like communism

Conclusion The basic conclusion of the analysis of this article is that for a combination of economic and political reasons, a capitalist road to communism is implausible, and for political reasons a socialist road is more likely to succeed than the mixed road. The pure capitalist road is impossible because capital flight would immediately undermine the economic base of the communism-inducing universal grant proposal, and because even if this problem were solved, the political use of disinvestment would make the system unreproducible. The mixed road, combining elements of capitalist and socialist property relations, is economically feasible, but would be politically precarious. Only in a socialist society would the political conditions for a stable growth of the universal grants be secure enough to make movement along the road to communism likely.This general conclusion is based on what is a largely unargued assumption present thoughout this article, namely that socialism itself is unambiguously compatible with the emergence and development of communism- that collective ownership of the means of production by workers is compatible with a gradual growth in the realm of freedom, in the predominance of distribution according to need. Following VP, I acted as if the only issue were the extent to which capitalism might also be so compatible, and if not, the extent to which certain aspects of capitalism might be compatible in what I have called the mixed road.The assumption that socialism is compatible with the growth of communism rests on two more basic claims: first, that eliminating capitalist property relations does not necessarily produce authoritarian-bureaucratic forms of the state and politics, and, second, that in democratic socialism productivity will continue to increase (for without increasing productivity, expanding the sphere of distribution according to need becomes very problematic). While I will not attempt to defend them here, I believe both of these claims to be true. If either of these assumptions is false, however, then the only feasible road to communism, no matter how precarious it might be politically, may be the quasicapitalist/quasi-socialist mixed road described above, a road that combines elements of substantial state control over investments with capitalist economic rationality.     

The continuing relevance of class analysis — comments

Conclusion If the evidence I discuss above is correct, then it certainly seems premature to declare the death of class. Class may not be the most powerful or fundamental cause of societal organization, and class struggle may not be the most powerful transformative force in the world today. Class primacy as a generalized explanatory principle across all social explananda are implausible. Nevertheless, class remains a significant and sometimes powerful determinant of many aspects of social life. Class boundaries, especially the property boundary, continue to constitute real barriers in people's lives; inequalities in the distribution of capital assets continue to have real consequences for material interests; capitalist firms continue to face the problem of extracting labor effort from non-owning employees; and class location continues to have real, if variable, impacts on individual subjectivities.     

Finding longest increasing and common subsequences in streaming data

We present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data-streaming model. To decide if the LIS of a given stream of elements drawn from an alphabet αbet has length at least k, we discuss a one-pass algorithm using O(k log αbetsize) space, with update time either O(log k) or O(log log αbetsize); for αbetsize = O(1), we can achieve O(log k) space and constant-time updates. We also prove a lower bound of Ω(k) on the space requirement for this problem for general alphabets αbet, even when the input stream is a permutation of αbet. For finding the actual LIS, we give a ⌈log (1 + 1/ɛ)-pass algorithm using O(k^1+ɛlog αbetsize) space, for any ɛ > 0. For LCS, there is a trivial Θ(1)-approximate O(log n)-space streaming algorithm when αbetsize = O(1). For general alphabets αbet, the problem is much harder. We prove several lower bounds on the LCS problem, of which the strongest is the following: it is necessary to use Ω(n/ρ²) space to approximate the LCS of two n-element streams to within a factor of ρ, even if the streams are permutations of each other. A preliminary version of this paper appears in the Proceedings of the 11th International Computing and Combinatorics Conference (COCOON'05), August 2005, pp. 263–272.     

Systems thinking and business process redesign: An application to the beer game

Managers are regrettably ignorant of the fact that their business organisations are ‘designable’. But recently, concepts such as business re-engineering and systems thinking, coupled with advances in methods of quantifying business systems, have enabled managers to scrutinise their business systems afresh.Ann van Ackere, Erik Reimer Larsen and John Morecroft use a well-known logistical system — the ‘beer game’ — to illustrate these re-engineering concepts and tools in a multi-stage production and distribution system involving a single brand of beer. This business game raises the fundamental question of why it is so difficult to match shipments and factory production to consumer demand.The authors conclude that such re-design concepts and tools can be applied successfully to full-scale business problems. Systems thinking, modelling and continuous time simulation can provide the framework for carrying the design process from mapping all the way through to redesign. The most effective CEOs of the future will be those who are competent to create corporate design in which employees are allowed to succeed.     

Hugo Münsterberg and the Origins of Vocational Guidance

Hugo Münsterberg was among the most famous psychologists in the world at the turn of the 20th century. Despite his preeminence and associations with prominent leaders in several disciples, including Frank Parsons, his abrasive personality and unpopular politics led to his work being largely ignored during the 20th century. One such work is H. Münsterberg's (1910c) Vocation and Learning: A Popular Reading Course, which represents an early trait‐and‐factor psychological model of vocation. This triangular model suggests that people and vocations are composed of thinking, feeling, and willing dimensions that must be aligned to find the most suitable vocation for the person.     

Sequential sharing rules for river sharing problems

We analyse the redistribution of a resource amongst agents who have claims to the resource and who are ordered linearly. A well known example of this particular situation is the river sharing problem. We exploit the linear order of agents to transform the river sharing problem to a sequence of two-agent river sharing problems. These reduced problems are mathematically equivalent to bankruptcy problems and can therefore be solved using any bankruptcy rule. Our proposed class of solutions, that we call sequential sharing rules, solves the river sharing problem. Our approach extends the bankruptcy literature to settings with a sequential structure of both the agents and the resource to be shared. In the paper, we first characterise the class of sequential sharing rules. Subsequently, we apply sequential sharing rules based on four classical bankruptcy rules, assess their properties, provide two characterisations of one specific rule, and compare sequential sharing rules with three alternative solutions to the river sharing problem.