Who speaks for China? Is it the old men of the politbureau or an activist like Wei Jingshsheng, who spent eighteen years in prison for writing a democratic manifesto? Is China’s future to be found amid the boisterous sleaze of an electoral campaign in Taiwan or in the maneuvers by which ordinary residents of Beijing quietly resist the authority of the state? These are among the questions that Ian Buruma poses in this enlightening and often moving tour of Chinese dissidence. Moving from the quarrelsome exile communities of the U. S. to Singapore and Hong Kong and from persecuted Christians to Internet “hacktivists,” Buruma captures an entire spectrum of opposition to the orthodoxies of the Communist Party. He explores its historical antecedents its conflicting notions of freedom and the paradoxical mix of courage and cussedness that inspires its members. Panoramic and intimate, disturbing and inspiring, Bad Elements is a profound meditation on the themes of national identity and political struggle.

The 1949 Communist Revolution marked a period of earthshaking change in China. Political, economic, ideological, and cultural movements galvanized the country, culminating in dramatic social transformations at all levels, including the persecution of hundreds of thousands of the country’s citizens. Based on normally inaccessible records of confessions, interrogations, trial transcripts, and depositions, Eight Outcasts tells the stories of eight victims of the Maoist dictatorship. It introduces readers to individuals accused of infractions such as corruption, political wrong thinking, homosexuality, illicit sexual activity, foreign ties, or “historical problems” (connections to the former Kuomintang regime) in the period between the revolution and Mao’s death in 1976. Each chapter brings stories of China’s voiceless citizens to light, broadening our knowledge of this important transitional period.

Part I Algorithms and Data Structures 1 Fundamentals Approximating the square root of a number Generating Permutation Efficiently Unique 5-bit Sequences Select Kth Smallest Element The Non-Crooks Problem Is this (almost) sorted? Sorting an almost sorted list The Longest Upsequence Problem Fixed size generic array in C++ Seating Problem Segment Problems Exponentiation Searching two-dimensional sorted array Hamming Problem Constant Time Range Query Linear Time Sorting Writing a Value as the Sum of Squares The Celebrity Problem Transport Problem Find Length of the rope Switch Bulb Problem In, On or Out The problem of the balanced seg The problem of the most isolated villages 2 Arrays The Plateau Problem Searching in Two Dimensional Sequence The Welfare Crook Problem 2D Array Rotation A Queuing Problem in A Post Office Interpolation Search Robot Walk Linear Time Sorting Write as sum of consecutive positive numbers Print 2D Array in Spiral Order The Problem of the Circular Racecourse Sparse Array Trick Bulterman’s Reshuffling Problem Finding the majority Mode of a Multiset Circular Array Find Median of two sorted arrays Finding the missing integer Finding the missing number with sorted columns Re-arranging an array Switch and Bulb Problem Compute sum of sub-array Find a number not sum of subsets of array Kth Smallest Element in Two Sorted Arrays Sort a sequence of sub-sequences Find missing integer Inplace Reversing Find the number not occurring twice in an array 3 Trees Lowest Common Ancestor(LCA) Problem Spying Campaign 4 Dynamic Programming Stage Coach Problem Matrix Multiplication TSP Problem A Simple Path Problem String Edit Distance Music recognition Max Sub-Array Problem 5 Graphs Reliable distribution Independent Set Party Problem 6 Miscellaneous Compute Next Higher Number Searching in Possibly Empty Two Dimensional Sequence Matching Nuts and Bolts Optimally Random-number generation Weighted Median Compute a^n Compute a^n revisited Compute the product a × b Compute the quotient and remainder Compute GCD Computed Constrained GCD Alternative Euclid’ Algorithm Revisit Constrained GCD Compute Square using only addition and subtraction Factorization Factorization Revisited Decimal Representation Reverse Decimal Representation Solve Inequality Solve Inequality Revisited Print Decimal Representation Decimal Period Length Sequence Periodicity Problem Compute Function Emulate Division and Modulus Operations Sorting Array of Strings : Linear Time LRU data structure Exchange Prefix and Suffix 7 Parallel Algorithms Parallel Addition Find Maximum Parallel Prefix Problem Finding Ranks in Linked Lists Finding the k th Smallest Element 8 Low Level Algorithms Manipulating Rightmost Bits Counting 1-Bits Counting the 1-bits in an Array Computing Parity of a word Counting Leading/Trailing 0’s Bit Reversal Bit Shuffling Integer Square Root Newton’s Method Integer Exponentiation LRU Algorithm Shortest String of 1-Bits Fibonacci words Computation of Power of 2 Round to a known power of 2 Round to Next Power of 2 Efficient Multiplication by Constants Bit-wise Rotation Gray Code Conversion Average of Integers without Overflow Least/Most Significant 1 Bit Next bit Permutation Modulus Division Part II C++ 8 General 9 Constant Expression 10 Type Specifier 11 Namespaces 12 Misc 13 Classes 14 Templates 15 Standard Library

International scholars and sinologists discuss culture, economic growth, social change, political processes, and foreign influences in China since the earliest pre-dynastic period.

Maoism at the Grassroots challenges state-centered views of China under Mao, providing insights into the lives of citizens across social strata, ethnicities, and regions. It reveals how ordinary people risked persecution and imprisonment in order to assert personal beliefs and identities, despite political repression and surveillance.

This title is part of UC Press's Voices Revived program, which commemorates University of California Press’s mission to seek out and cultivate the brightest minds and give them voice, reach, and impact. Drawing on a backlist dating to 1893, Voices Revived makes high-quality, peer-reviewed scholarship accessible once again using print-on-demand technology. This title was originally published in 1974.

This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004. The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.