3,771 research outputs found
The political role of the people's liberation army 1949-1973
No full textThis thesis is to study the political role of the People's Liberation Army from the approach of structure and function. The framework of the thesis consists of three major parts, first, the influence of Chinese traditional political culture on, and the formation of, the political role of the PL A; second, the influence of domestic political struggles and external military conflicts on the development of the political role of the PLA; and the third, the analysis of the transition of the PLA's political role from the structure and personnel arrangements of the CCPCC Within the above-mentioned three scopes, this thesis make a thorough discussion on the following: (1) The relationship between the structure of the PRC and the formation of the PLA's political role; (2) How has ideology influenced the army's political role; (3) What is Mao's viewpoint and his influence on the development of the army's political role; (4) What is the link between the army and the party, and how has this developed; (6) What accounts for the expansion of the PLA's political functions; (7) What is the influence of political factional struggles on the PLA's political role; (8) Is it political institution or military institution that controls the recruitment of the military elite; (9) What are the disparities between the military elite in handling international conflicts and what are their political considerations; (10) What is the Party's position in the army; (11) How have the Party’s important meetings and personnel arrangements influenced the rise and fall of the PLA's political role
Approximation algorithms for clique transversals on some graph classes
No full textGiven a graph G=(V,E) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a minimum-cardinality clique transversal is NP-hard for the following classes: planar, line and bounded degree graphs. For line graphs we present a 3-approximation for the unweighted case and a 4-approximation for the weighted case with nonnegative weights; a ⌈(Δ(G)+1)/2 ⌉(-approximation for bounded degree graphs and a 3-approximation for planar graphs.Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Vasiliev, Saveliy. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentin
A faster algorithm for the cluster editing problem on proper interval graphs
No full textWe develop a linear-space O(n+m) time algorithm to solve the cluster editing problem for proper interval models, where n and m are the number of vertices and edges of the represented graph.Fil: Lin, Min Chih. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; ArgentinaFil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasi
Approximating weighted neighborhood independent sets
No full textA neighborhood independent set (NI-set) is a subset of edges in a graph such that the closed neighborhood of any vertex contains at most one edge of the subset. Finding a maximum cardinality NI-set is an NP-complete problem. We consider the weighted version of this problem. For general graphs we give an algorithm with approximation ratio Δ, and for diamond-free graphs we give a ratio , where Δ is the maximum degree of the input graph. Furthermore, we show that the problem is polynomially solvable on cographs. Finally, we give a tight upper bound on the cardinality of a NI-set on regular graphs.Fil: Lin, Min Chih. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; ArgentinaFil: Mestre, Julian. University of Sydney; AustraliaFil: Vasiliev, Saveliy. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentin
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
No full textWe study the computational complexity of the minimum dominating set problem on graphs restricted by forbidden induced subgraphs. We give some dichotomies results for the problem on graphs defined by any combination of forbidden induced subgraphs with at most four vertices, implying either an NP-Hardness proof or a polynomial time algorithm. We also extend the results by showing that dominating set problem remains NP-hard even when the graph has maximum degree three, it is planar and has no induced claw, induced diamond, induced K4 nor induced cycle of length 4, 5, 7, 8, 9, 10 and 11.Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin
Molecular systematics and phylogeography of the gigantic earthworms of the Metaphire formosae species group (Clitellata, Megascolecidae)
No full textCarteraol E, a potent polyhydroxyl ichthyotoxin from the dinoflagellate Amphidinium carterae
No full text- …
