Search

Copyright of Taiwanese Journal of Political Science is the property of NTU Press & National Taiwan University, Department of Political Science 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.)

The International Codex Alimentarius Commission (CAC) issued a new version of the general rules on food hygiene in 2020, which revised and improved the structure, definition and technical contents of the standard, clarified the important role of good hygiene practices in food safety management, and emphasized the advantages of Hazard Analysis and Critical Control Point (HACCPL) in dealing with more complex food safety issues. It also added the latest achievements of standardization research in the field of food safety in recent years, such as allergen control and food safety culture. By comparing the new version of the standard with the 2003 edition of general principles of food hygiene, this paper expounds and analyzes the main changes of the new version of the standard in detail, so as to provide reference for the formulation and implementation of food-related standards in China. [ABSTRACT FROM AUTHOR]

The engineering support system plays an important role in supplying support resources for modern warfare. The ability of the system will be seriously affected due to the failure of critical nodes. Therefore, it is of great significance for future wars to analyze critical node identification technology in the equipment support system and identify the weak links. Based on the theory of complex networks, this paper proposes a comprehensive index to measure the importance of support nodes. On the one hand, the node importance index measures the connection ability of the support node in a certain spatial range. On the other hand, according to a task-oriented routing method proposed in this paper, the global transportation ability of the support node is measured. By comparing with six other node importance indexes, the result verifies the effectiveness and applicability of the node importance index proposed in this paper in identifying critical nodes. [ABSTRACT FROM AUTHOR]

Copyright of Architectural Journal / Jian Zhu Xue Bao is the property of Architectural Journal Editorial Office 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.)

Copyright of China Harbour Engineering is the property of Editorial Office of China Harbour Engineering 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.)

As the features of service composition such as large scale, high complexity, various failures and resource dynamics, a safe and credible service composition scheme is one of the biggest challenges for flexible deployment and on-demand providing. Based on the critical analysis of block chain infrastructure, consensus mechanism and programmable features, contrasting to the characteristics and process of Web service composition, this paper developed an novel service composition system architecture with much more credibility and reliability using service overlay networks theory. In addition, considering the security strategies derived from block chain consensus mechanism, and making full use of smart contract’s functions and effects, this paper proposed an effective algorithm based on the predictive route life time( RLT) and service intensity( SI)across overlay networks for the generation of service paths. Besides, it designed a better service-path selection algorithm which was decided by the trusted quality of service model with the single-node’s trust index and interactive tightness index. The simulation results show that the service composition strategy based on block chain mechanism has greatly increased the success rate and credibility of service components after composition. [ABSTRACT FROM AUTHOR]

Community structure analysis is a critical task in examining a complex network. This paper presented a self-organizing overlapping community structure analysis algorithm (SO2CSA2) based on the swarm intelligence theory. The basic idea behind the algorithm was that it treats an analyzed network as a swarm intelligence system, of which each node was an individual with simple intelligence. Each individual independently decides to which community it joined based on a defined metric named connection score. An individual could join to multiple communities simultaneously. At first, the algorithm found a set of K-cliques from the analyzed network as the initial community structure. Then, each individual in the system acted iteratively to join into or leave from communities, and an optimal community structure of the whole network could develop and eventually emerge from the initial community structure. Finally, to improve the quality of the obtained community structure, a post process adjusted community assignments of a small number of individuals. Experimental evaluation on a number of synthesized networks and real-world networks indicates that the quality of community structures discovered by SO2CSA2 is better than those of two compared algorithms, SLPA and OSLOM, especially on networks with a large number of overlapping nodes or on networks with overlapping nodes of which overlapping degrees are high. [ABSTRACT FROM AUTHOR]