Search

Copyright of Hitit Medical Journal is the property of Hitit Medical Journal and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Joseph Fewsmith's book, "Forging Leninism in China: Mao and the Remaking of the Chinese Communist Party, 1927-1934," offers a fresh perspective on the early years of the Communist Party of China (CPC). Fewsmith argues that the conventional history, which focuses on Mao Zedong's central role, overlooks the contributions of local revolutionaries like those in the Donggu Revolutionary Base Area. By examining the relationship between local and non-local revolutionaries, Fewsmith demonstrates how the CPC transformed from a fragmented movement into a disciplined Leninist party. The book explores topics such as the collapse of the United Front, the role of educated local youth in grassroots party organizations, Mao's land policy, and the sufan campaign against counterrevolutionaries. Fewsmith's analysis sheds light on the complex dynamics within the CPC during this crucial period of Chinese history. [Extracted from the article]

Determination of the optimal route in transportation activities is one of the major problems in transportation. Therefore, efficient techniques deserve our utmost attention to detect optimal routes. In this study, a novel method called Cluster Path Covering (CPC) has been developed and introduced to identify a route based on a sequence of location points on a network. There are already models to minimize the total path cost between the pair of nodes following a kind of sequence. However, our method aims to minimize the path cost, including the neighbourhood accessibility of the path nodes on the network. One of the major challenges for the new model is to reveal the accessibility costs between the nodes. The methodology presents the CPC method clustering the location points on a network and indicating the optimum point for each cluster. Then, the CPC method generates the best path by connecting the specific location points representing the clusters. Moreover, the shortest covering of the neighbourhood path problem (SCNPP) is introduced in this study. The novel CPC method is utilized for SCNPP, a distinctive version of the shortest covering path problem (SCPP). The performance of the CPC method is then tested on two different benchmark networks. According to the results, it provides robust and efficient outcomes for decreasing the routes' transportation costs (e.g., distances). The issues that can be solved via the CPC method include the accessibility costs of public transportation paths and the locations of stops by minimizing the costs. [ABSTRACT FROM AUTHOR]