• Advances in Computational Design
• /
• 제7권4호
• /
• pp.345-369
• /
• 2022

Infectious disease emergency hospitals are usually temporarily built during the pneumonia epidemic with higher requirements regarding diagnosis and treatment efficiency, hygiene and safety, and infection control.This study aims to identify how the Building Information Modeling (BIM) + Industrialized Building System (IBS) approach could rapidly deliver an infectious disease hospital and develop site epidemic spreading algorithms. Coronavirus-19 pneumonia construction site spreading algorithm model mind map and block diagram of the construction site epidemic spreading algorithm model were developed. BIM+IBS approach could maximize the repetition of reinforced components and reduce the number of particular components. Huoshenshan Hospital adopted IBS and BIM in the construction, which reduced the workload of on-site operations and avoided later rectification. BIM+IBS integrated information on building materials, building planning, building participants, and construction machinery, and realized construction visualization control and parametric design. The delivery of Huoshenshan Hospital was during the most critical period of the Coronavirus-19 pneumonia epidemic. The development of a construction site epidemic spreading algorithm provided theoretical and numerical support for prevention. The agent-based analysis on hospital evacuation observed "arched" congestion formed at the evacuation exit, indicating behavioral blindness caused by fear in emergencies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2979-2995
• /
• 2017

In recent years, there has been an increasing number of studies focused on identifying a set of spreaders to maximize the influence of spreading in complex networks. Although the k-core decomposition can effectively identify the single most influential spreader, selecting a group of nodes that has the largest k-core value as the seeds cannot increase the performance of the influence maximization because the propagation sphere of this group of nodes is overlapped. To overcome this limitation, we propose a neighborhood coreness cover and discount heuristic algorithm named "NCCDH" to identify a set of influential and decentralized seeds. Using this method, a node in the high-order shell with the largest neighborhood coreness and an uncovered status will be selected as the seed in each turn. In addition, the neighbors within the same shell layer of this seed will be covered, and the neighborhood coreness of the neighbors outside the shell layer will be discounted in the subsequent round. The experimental results show that with increases in the spreading probability, the NCCDH outperforms other algorithms in terms of the affected scale and spreading speed under the Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models. Furthermore, this approach has a superior running time.