123,608 research outputs found
The political role of the people's liberation army 1949-1973
Get PDFThis 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
The phase transition in Chung-Lu graphs
Get PDFIn 2002, Chung and Lu introduced a version of the Erdos-Renyi model which an
edge between and is present with probability . They applied
this model to compute the diameter of power-law random graphs, with yielded
easier proofs than those for the configuration model. In 2007 their model was
brought and integrated under the umbrella of Bolobas, Janson, and Riordan's
inhomogeneous random graphs. However, the properties of the Chung-Lu model were
never fully explored. In this paper, we fill the gap by giving a result for the
cluster sizes in the subcritical regime and the fraction of vertices in the
giant component in the supercritical phase
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
Get PDFFor vertices and of an -vertex graph , a -trail of is an induced -path of that is not a shortest -path of . Berger, Seymour, and Spirkl [Discrete Mathematics 2021] gave the previously only known polynomial-time algorithm, running in time, to either output a -trail of or ensure that admits no -trail. We reduce the complexity to the time required to perform a poly-logarithmic number of multiplications of Boolean matrices, leading to a largely improved -time algorithm.18 pages, 6 figures, a preliminary version appeared in STACS 202
Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
Get PDFA Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees, independently for different edges. We derive a central limit theorem for the principal eigenvalue and the components of the principal eigenvector of the adjacency matrix of a Chung–Lu random graph. Our derivation requires certain assumptions on the average degrees that guarantee connectivity, sparsity and bounded inhomogeneity of the graph.</p
Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
Get PDFA Chung-Lu random graph is an inhomogeneous Erdős-Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees, independently for different edges. We derive a central limit theorem for the principal eigenvalue and the components of the principal eigenvector of the adjacency matrix of a Chung-Lu random graph. Our derivation requires certain assumptions on the average degrees that guarantee connectivity, sparsity and bounded inhomogeneity of the graph
Ksavers Andermanis – LU Akadēmiskās nozīmītes meta autors
Get PDFRaksts tapis kā turpinājums 2024. gada septembra mēneša priekšmetam par Latvijas Universitātes (LU) Akadēmisko nozīmīti, kur uzmanība pievērsta LU Akadēmiskās nozīmītes meta autoram, LU Arhitektūras fakultātes studentam un novadpētniekam, vācbaltietim Ksaveram Andermanim. K. Andermanis ne tikai ir sniedzis ieguldījumu Latvijas etnogrāfijas pētniecībā, bet arī LU simbolu izgatavošanā, kas mūsdienās saglabā savu unikalitāti un vērtību. Meta autora piederība pie LU saimes sakņojusies jau viņa ģimenē, jo viņa tēvs ir absolvējis Rīgas Politehnisko institūtu, LU priekšteci starpkaru periodā, un strādājis LU Saimniecības padomē par inspektoru.The article is a continuation of the September 2024 Museum Object on the Academic Badge of the University of Latvia (UL), which focuses on the author of the UL Academic Badge design, the student of the Faculty of Architecture and local historian, the Baltic German Ksavers Andermanis. K. Andermanis has not only contributed to the research of Latvian ethnography, but also to the production of symbols of the UL, which today retain their uniqueness and value. The author's belonging to the UL family is rooted in his family, as his father graduated from the Riga Polytechnic Institute, the predecessor of UL during the interwar period, and worked as an inspector at the UL Economical council
An optimal algorithm for the maximum-density segment problem
No full textWe address a fundamental problem arising from analysis of biomolecular sequences.
The input consists of two numbers wmin & wmax & a sequence S of n number pairs (ai, wi)
with wi > 0. Let segment S(i, j) of S be the consecutive subsequence of S between indices i
and j. The density of S(i, j) is d(i, j) = (ai + ai+1 + · · · + aj )/(wi + wi+1 + · · · + wj ). The
maximum-density segment problem is to find a maximum-density segment over all segments S(i, j)
with wmin ≤ wi + wi+1 + · · · + wj ≤ wmax..
Personal Papers (MS 80-0002)
No full textLetter from I. H. Kempner to Lu-Tex Products, Inc. discussing the lack of reply to his previous inquiry and asking about turkeys to be shipped to him
- …
