Finitness of the basic intersection cohomology of a Killing foliation

We prove that the basic intersection cohomology ${I H}^{^{*}}_{_{\bar{p}}}{(M/\mathcal{F})},$ where $\mathcal{F}$ is the singular foliation determined by an isometric action of a Lie group $G$ on the compact manifold $M$, is finite dimensional

Party rules, party resources, and the politics of parliamentary democracies: how parties organize in the 21st Century

This article introduces the first findings of the Political Party Database (PPDB) project, a major survey of party organizations in parliamentary and semi-presidential democracies. The project’s first round of data covers 122 parties in 19 countries. In this paper we describe the scope of the database, then investigate what it tells us about contemporary party organization in these countries, focussing on parties’ resources, structures and internal decision-making. We examine organizational patterns by country and party family, and where possible we make temporal comparisons with older datasets. Our analyses suggest a remarkable coexistence of uniformity and diversity. In terms of the major organizational resources on which parties can draw, such as members, staff and finance, the new evidence largely confirms the continuation of trends identified in previous research: i.e., declining membership, but enhanced financial resources and more paid staff. We also find remarkable uniformity regarding the core architecture of party organizations. At the same time, however, we find substantial variation between countries and party families in terms of their internal processes, with particular regard to how internally democratic they are, and in the forms that this democratization takes

Understanding students’ learning experience on a cultural school trip: findings from Eastern Indonesia

Despite the current increase of studies on school trips and experiential learning, questions remain about what aspects of school trips best contribute to students and how it affects students’ learning experience. This study attempts to explore students’ learning experience participating in 1-day cultural school trips in Papua, eastern Indonesia. Conducting trips to two cultural venues (a cultural museum and cultural village) and integrating topics in secondary schools’ curriculum (Papuan local content and Papuan art and culture), we evaluated student learning experiences against Bloom et al.’s (1956)taxonomy of educational objectives. The study found several emergent categories: students’ previous experiences, emotional experiences, impressions on seeing new perspective, reidentifying cultural identity, cultural awareness, personal effect, and framing and comparing learning strategy. The results provide insight into the effectiveness of school trip in the cultural setting in less developed countries and suggest areas for further study

Intra–Party Democracy and Responsiveness to Rival Parties’ Policies

Objective: We address whether intraparty democracy conditions political parties' responsiveness to rival parties' policy shifts. Method: We estimate parameters of a spatial econometric model of parties' policy positions in eleven established democracies. Results: Internally democratic parties respond to shifts in rival parties' policies, and internally undemocratic parties do no t respond rival parties' policy shifts. Conclusion: We argue that this occurs because intra-party deliberation provides a channel through which rival parties influence their competitors' policies. Because rank-and-file party members are influenced by deliberative processes more than party leaders, and the policy goals of internally democratic parties' policies are heavily influenced by their party members deliberative processes lead democratic parties to respond to shifts in rival parties' policy positions. This work has important implication s for our understanding of parties' election strategies, intra-party politics, and how policies diffuse between parties competing in the same election

On Central Spanning Trees of a Graph

We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem

Order-theoretic aspects of scheduling

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

On Central Spanning Trees of a Graph

We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central tree is algorithmically difficult and leads to an NP-complete problem. 1 Introduction All the basic notions concerning graphs, which are not explained here, may be found in any introductory book on graph theory, e.g. [4]. In the whole paper we consider undirected connected graphs without loops, but maybe with multiple edges. For a graph G we denote by V (G) and E(G) its vertex and edge sets, respectively. Let T 1 and T 2 be a pair of spanning trees of a graph G. We define the distance between T 1 and T 2 as D(T 1 ; T 2 ) = 1 2 \Delta j(E(T 1 ) [ E(T 2 )) n (E(T 1 ) " E(T 2 ))j; i.e. the distance equals half of the symmetric difference between E(T 1 ) and E(T 2 ) (notice..