Search results

The compliance checking of Building Information Modeling (BIM) models is crucial throughout the lifecycle of construction. The increasing amount and complexity of information carried by BIM models have made compliance checking more challenging, and manual methods are prone to errors. Therefore, this study aims to propose an integrative conceptual framework for automated compliance checking of BIM models, allowing for the identification of errors within BIM models.

This study first analyzed the typical building standards in the field of architecture and fire protection, and then the ontology of these elements is developed. Based on this, a building standard corpus is built, and deep learning models are trained to automatically label the building standard texts. The Neo4j is utilized for knowledge graph construction and storage, and a data extraction method based on the Dynamo is designed to obtain checking data files. After that, a matching algorithm is devised to express the logical rules of knowledge graph triples, resulting in automated compliance checking for BIM models.

Case validation results showed that this theoretical framework can achieve the automatic construction of domain knowledge graphs and automatic checking of BIM model compliance. Compared with traditional methods, this method has a higher degree of automation and portability.

This study introduces knowledge graphs and natural language processing technology into the field of BIM model checking and completes the automated process of constructing domain knowledge graphs and checking BIM model data. The validation of its functionality and usability through two case studies on a self-developed BIM checking platform.

Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.

The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.

Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.

The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.

This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al., 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al., 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.

The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al., 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al., 2014; Zhang et al., 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.

This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.

Ad hoc mobile networks are commonplace in every aspect of our everyday life. They become essential in many industries and have uses in logistics, science and the military. However, because they operate mostly in open spaces, they are exposed to a variety of dangers. The purpose of this study is to introduce a novel method for detecting the MAC layer misbehavior.

The proposed novel approach is based on exponential smoothing for throughput prediction to address this MAC layer misbehavior. The real and expected throughput are processed using an exponential smoothing algorithm to identify this attack, and if these metrics exhibit a trending pattern, an alarm is then sent.

The effect of the IEEE 802.11 MAC layer misbehavior on throughput was examined using the NS-2 network simulator, as well as the approval of our novel strategy. The authors have found that a smoothing factor value that is near to 0 provides a very accurate throughput forecast that takes into consideration the recent history of the updated values of the real value. As for the smoothing factor values that are near to 1, they are used to identify MAC layer misbehavior.

According to the authors’ modest knowledge, this new scheme has not been proposed in the state of the art for the detection of greedy behavior in mobile ad hoc networks.

In the final step, the trust model is applied to the on-demand federated multipath distance vector routing protocol (AOMDV) to introduce path trust as a foundation for routing selection in the route discovery phase, construct a trusted path, and implement a path warning mechanism to detect malicious nodes in the route maintenance phase, respectively.

A trust-based on-demand multipath distance vector routing protocol is being developed to address the problem of flying ad-hoc network being subjected to internal attacks and experiencing frequent connection interruptions. Following the construction of the node trust assessment model and the presentation of trust evaluation criteria, the data packet forwarding rate, trusted interaction degree and detection packet receipt rate are discussed. In the next step, the direct trust degree of the adaptive fuzzy trust aggregation network compute node is constructed. After then, rely on the indirect trust degree of neighbouring nodes to calculate the trust degree of the node in the network. Design a trust fluctuation penalty mechanism, as a second step, to defend against the switch attack in the trust model.

When compared to the lightweight trust-enhanced routing protocol (TEAOMDV), it significantly improves the data packet delivery rate and throughput of the network significantly.

Additionally, it reduces the amount of routing overhead and the average end-to-end delay.

Strategic flexibility (SF) has become increasingly important for firms because of the fast changes in the external environment. In line with the practical importance of SF, an emerging research field has developed around it that has attempted to understand the nature of SF and the key relationships. The aim of this study is to unveil the semantic structure of the recent literature on SF and to suggest new promising areas for future research.

The authors conduct a systematic literature review with a bibliographic analysis technique, which allows authors to identify the main recent streams in the literature, as well as offer reflections and suggestions for future research.

The authors uncover three main emerging areas in the research on SF, namely SF as a dynamic capability, the role of knowledge management for SF and the relationship between a firm SF and the external environment. The authors put forward three avenues for future research on SF: Avenue 1. SF, business model innovation (BMI) and other dynamic capabilities (DC), Avenue 2. Digital technologies and SF/organizational agility and Avenue 3. SF and sustainability. Articles included in the special issue entitled “A strategic perspective on flexibility, agility and adaptability in the digital era” contribute to Avenue 2, thus paving the way for filling some of the identified gaps regarding the relationship between SF and digitalization.

To the best of authors’ knowledge, this is the first literature review on SF that uses a bibliometric approach to draw conclusions on the findings in the literature. The review contributes to the theoretical understanding of SF by illustrating and explicating core topics that have persisted over time, as well as by presenting three main avenues for further developing authors’ knowledge around SF.

Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction efficiency compared with conventional approaches. During the construction of prefabricated buildings, the overall efficiency largely depends on the lifting sequence and path of each prefabricated component. To improve the efficiency and safety of the lifting process, this study proposes a framework for automatically optimizing the lifting path of prefabricated building components using building information modeling (BIM), improved 3D-A* and a physic-informed genetic algorithm (GA).

Firstly, the industry foundation class (IFC) schema for prefabricated buildings is established to enrich the semantic information of BIM. After extracting corresponding component attributes from BIM, the models of typical prefabricated components and their slings are simplified. Further, the slings and elements’ rotations are considered to build a safety bounding box. Secondly, an efficient 3D-A* is proposed for element path planning by integrating both safety factors and variable step size. Finally, an efficient GA is designed to obtain the optimal lifting sequence that satisfies physical constraints.

The proposed optimization framework is validated in a physics engine with a pilot project, which enables better understanding. The results show that the framework can intuitively and automatically generate the optimal lifting path for each type of prefabricated building component. Compared with traditional algorithms, the improved path planning algorithm significantly reduces the number of nodes computed by 91.48%, resulting in a notable decrease in search time by 75.68%.

In this study, a prefabricated component path planning framework based on the improved A* algorithm and GA is proposed for the first time. In addition, this study proposes a safety-bounding box that considers the effects of torsion and slinging of components during lifting. The semantic information of IFC for component lifting is enriched by taking into account lifting data such as binding positions, lifting methods, lifting angles and lifting offsets.

Adequate means for easily viewing, browsing and searching knowledge graphs (KGs) are a crucial, still limiting factor. Therefore, this paper aims to present virtual properties as valuable user interface (UI) concept for ontologies and KGs able to improve these issues. Virtual properties provide shortcuts on a KG that can enrich the scope of a class with other information beyond its direct neighborhood.

Virtual properties can be defined as enhancements of shapes constraint language (SHACL) property shapes. Their values are computed on demand via protocol and RDF query language (SPARQL) queries. An approach is demonstrated that can help to identify suitable virtual property candidates. Virtual properties can be realized as integral functionality of generic, frame-based UIs, which can automatically provide views and masks for viewing and searching a KG.

The virtual property approach has been implemented at Bosch and is usable by more than 100,000 Bosch employees in a productive deployment, which proves the maturity and relevance of the approach for Bosch. It has successfully been demonstrated that virtual properties can significantly improve KG UIs by enriching the scope of a class with information beyond its direct neighborhood.

SHACL-defined virtual properties and their automatic identification are a novel concept. To the best of the author’s knowledge, no such approach has been established nor standardized so far.

This study aims to investigate the relationship between individual-level psychological resources and team resilience in the context of expatriate project management teams. It seeks to understand how personal psychological resources contribute to team resilience and explore the dynamic evolution mechanism of team resilience. The goal is to enhance team resilience among expatriates in a BANI (Brittle, Anxious, Nonlinear, and Incomprehensible) world, where organizations face volatile and uncertain conditions.

An online survey was applied for data collection, and 315 valid samples from Chinese expatriates in international construction projects were utilized for data analysis. A structural equation model (SEM) examines the relationships between personal psychological resources and team resilience. The study identifies five psychological factors influencing team resilience: Employee Resilience, Cross-cultural Adjustment, Self-efficacy, Social Support, and Team Climate. The hypothesized relationships are validated through the SEM analysis. Additionally, a fuzzy cognitive map (FCM) is constructed to explore the dynamic mechanism of team resilience formation based on the results of the SEM.

The SEM analysis confirms that employee resilience, cross-cultural adjustment, and team climate positively impact team resilience. Social support and self-efficacy also have positive effects on team climate. Moreover, team climate is found to fully mediate the relationship between self-efficacy and team resilience, as well as between social support and team resilience. The FCM model provides further insights into the dynamic evolution of team resilience, highlighting the varying impact effects of antecedents during the team resilience development process and the effectiveness of different combinations of intervention strategies.

This study contributes to understanding team resilience by identifying the psychological factors influencing team resilience in expatriate project management teams. The findings emphasize the importance of social support and team climate in promoting team resilience. Interventions targeting team climate are found to facilitate the rapid development of team resilience. In contrast, interventions for social support are necessary for sustainable, long-term high levels of team resilience. Based on the dynamic simulation results, strategies for cultivating team resilience through external intervention and internal adjustment are proposed, focusing on social support and team climate. Implementing these strategies can enhance project management team resilience and improve the core competitiveness of contractors in the BANI era.

Nanosensors have a wide range of applications because of their high sensitivity, selectivity and specificity. In the past decade, extensive and pervasive research related to nanosensors has led to significant progress in diverse fields, such as biomedicine, environmental monitoring and industrial process control. This led to better and more efficient detection and monitoring of physical and chemical properties at better resolution, opening new horizons in the development of novel technologies and applications for improved human health, environment protection, enhanced industrial processes, etc.

In this paper, the authors discuss the application of citation network analysis in the field of nanosensor research and development. Cluster analysis was carried out using papers published in the field of nanomaterial-based sensor research, and an in-depth analysis was carried out to identify significant clusters. The purpose of this study is to provide researchers to identify a pathway to the emerging areas in the field of nanosensor research. The authors have illustrated the knowledge base, knowledge domain and knowledge progression of nanosensor research using the citation analysis based on 3,636 Science Citation Index papers published during the period 2011 to 2021.

Among these papers, the bibliographic study identified 809 significant research publications, 11 clusters, 556 research sector keywords, 1,296 main authors, 139 referenced authors, 63 nations, 206 organizations and 42 journals. The authors have identified single quantum dot (QD)-based nanosensor for biological applications, carbon dot-based nanosensors, self-powered triboelectric nanogenerator-based nanosensor and genetically encoded nanosensor as the significant research hotspots that came to the fore in recent years. The future trend in nanosensor research might focus on the development of efficient and cost-effective designs for the detection of numerous environmental pollutants and biological molecules using mesostructured materials and QDs. It is also possible to optimize the detection methods using theoretical models, and generalized gradient approximation has great scope in sensor development.

The future trend in nanosensor research might focus on the development of efficient and cost-effective designs for the detection of numerous environmental pollutants and biological molecules using mesostructured materials and QDs. It is also possible to optimize the detection methods using theoretical models, and generalized gradient approximation has great scope in sensor development.

This is a novel bibliometric analysis in the area of “nanomaterial based sensor,” which is carried out in CiteSpace software.

Drawing on social network and information diffusion theories, the authors study the impact of the structural characteristics of a seller’s local social network on her promotion effectiveness in social commerce.

The authors define a local social network as one formed by a focal seller, her directly connected users and all links among these users. Using data from a large social commerce website in China, the authors build econometric models to investigate how the density, grouping and centralization of local social networks affect the number of likes received by products posted by sellers.

Local social networks with low density, grouping and centralization are associated with more likes on sellers’ posted products. The negative effects of grouping and centralization are reduced when density is high.

The paper deepens the understanding of the determinants of social commerce success from a network structure perspective. In particular, it draws attention to the role of sellers’ local social networks, forming a foundation for future research on social commerce.