We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π2 ]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles. We also provide several extensions that might be of independent interest.

This paper examines the phenomenon of Community Design. It is a radical phenomenon in that community members collectively grow their own community information infrastructures without the intervention of professionals typically associated with such endeavors. A recently initiated comparative study draws on ongoing, longitudinal research engagements with a small number of communities and has iden...

The purpose of this essay is to design a framework of a performance system which is subject to the characteristics of China high-tech enterprises. It is based on analyzing the principles and significance of the performance system of high-tech enterprises. The framework will promote the standardization management of high-tech enterprises of China.

Learn what it takes to succeed in the the most in-demand tech jobHarvard Business Review calls it the sexiest tech job of the 21st century. Data scientists are in demand, and this unique book shows you exactly what...

I am interested in what I refer to as collaborative Knowledge-Building Environments (KBEs).These are software environments for supporting the construction of knowledge by groups of people. I consider this to be a paradigmatic task of CSCL (computer supported collaborative learning) because I assume that the notion of collaborative learning that CSCL practitioners strive to support is a construc...