Search results

The purpose of this paper is to provide a critical historical analysis of the business (mis)behaviors and influencing factors that discourage enduring cooperation between principals and agents, to introduce strategies that embrace the social values, economic motivation and institutional designs historically adopted to curtail dishonest acts in international business and to inform an improved principal–agent theory that reflects principal–agent reciprocity as shaped by social, political, cultural, economic, strategic and ideological forces

The critical historical research method is used to analyze Chinese compradors and the foreign companies they served in pre-1949 China.

Business practitioners can extend orthodox principal–agent theory by scrutinizing the complex interactions between local agents and foreign companies. Instead of agents pursuing their economic interests exclusively, as posited by principal–agent theory, they also may pursue principal-shared interests (as suggested by stewardship theory) because of social norms and cultural values that can affect business-related choices and the social bonds built between principals and agents.

The behaviors of compradors and foreign companies in pre-1949 China suggest international business practices for shaping social bonds between principals and agents and foreign principals’ creative efforts to enhance shared interests with local agents.

Understanding principal–agent theory’s limitations can help international management scholars and practitioners mitigate transaction partners’ dishonest acts.

A critical historical analysis of intermediary businesspeople’s (mis)behavior in pre-1949 (1840–1949) China can inform the generalizability of principal–agent theory and contemporary business strategies for minimizing agents’ dishonest acts.

Until now, a lot of research has been done and applied to provide security and original data from one user to another, such as third-party auditing and several schemes for securing the data, such as the generation of the key with the help of encryption algorithms like Rivest–Shamir–Adleman and others. Here are some of the related works that have been done previously. Remote damage control resuscitation (RDCR) scheme by Yan et al. (2017) is proposed based on the minimum bandwidth. By enabling the third party to perform the verification of public integrity. Although it supports the repair management for the corrupt data and tries to recover the original data, in practicality it fails to do so, and thus it takes more computation and communication cost than our proposed system. In a paper by Chen et al. (2015), using broadcast encryption, an idea for cloud storage data sharing has been developed. This technique aims to accomplish both broadcast data and dynamic sharing, allowing users to join and leave a group without affecting the electronic press kit (EPK). In this case, the theoretical notion was true and new, but the system’s practicality and efficiency were not acceptable, and the system’s security was also jeopardised because it proposed adding a member without altering any keys. In this research, an identity-based encryption strategy for data sharing was investigated, as well as key management and metadata techniques to improve model security (Jiang and Guo, 2017). The forward and reverse ciphertext security is supplied here. However, it is more difficult to put into practice, and one of its limitations is that it can only be used for very large amounts of cloud storage. Here, it extends support for dynamic data modification by batch auditing. The important feature of the secure and efficient privacy preserving provable data possession in cloud storage scheme was to support every important feature which includes data dynamics, privacy preservation, batch auditing and blockers verification for an untrusted and an outsourced storage model (Pathare and Chouragadec, 2017). A homomorphic signature mechanism was devised to prevent the usage of the public key certificate, which was based on the new id. This signature system was shown to be resistant to the id attack on the random oracle model and the assault of forged message (Nayak and Tripathy, 2018; Lin et al., 2017). When storing data in a public cloud, one issue is that the data owner must give an enormous number of keys to the users in order for them to access the files. At this place, the knowledge assisted software engineering (KASE) plan was publicly unveiled for the first time. While sharing a huge number of documents, the data owner simply has to supply the specific key to the user, and the user only needs to provide the single trapdoor. Although the concept is innovative, the KASE technique does not apply to the increasingly common manufactured cloud. Cui et al. (2016) claim that as the amount of data grows, distribution management system (DMS) will be unable to handle it. As a result, various proven data possession (PDP) schemes have been developed, and practically all data lacks security. So, here in these certificates, PDP was introduced, which was based on bilinear pairing. Because of its feature of being robust as well as efficient, this is mostly applicable in DMS. The main purpose of this research is to design and implement a secure cloud infrastructure for sharing group data. This research provides an efficient and secure protocol for multiple user data in the cloud, allowing many users to easily share data.

The methodology and contribution of this paper is given as follows. The major goal of this study is to design and implement a secure cloud infrastructure for sharing group data. This study provides an efficient and secure protocol for multiple user data in cloud, allowing several users to share data without difficulty. The primary purpose of this research is to design and implement a secure cloud infrastructure for sharing group data. This research develops an efficient and secure protocol for multiple user data in the cloud, allowing numerous users to exchange data without difficulty. Selection scheme design (SSD) comprises two algorithms; first algorithm is designed for limited users and algorithm 2 is redesigned for the multiple users. Further, the authors design SSD-security protocol which comprises a three-phase model, namely, Phase 1, Phase 2 and Phase 3. Phase 1 generates the parameters and distributes the private key, the second phase generates the general key for all the users that are available and third phase is designed to prevent the dishonest user to entertain in data sharing.

Data sharing in cloud computing provides unlimited computational resources and storage to enterprise and individuals; moreover, cloud computing leads to several privacy and security concerns such as fault tolerance, reliability, confidentiality and data integrity. Furthermore, the key consensus mechanism is fundamental cryptographic primitive for secure communication; moreover, motivated by this phenomenon, the authors developed SSDmechanismwhich embraces the multiple users in the data-sharing model.

Files shared in the cloud should be encrypted for security purpose; later these files are decrypted for the users to access the file. Furthermore, the key consensus process is a crucial cryptographic primitive for secure communication; additionally, the authors devised the SSD mechanism, which incorporates numerous users in the data-sharing model, as a result of this phenomena. For evaluation of the SSD method, the authors have considered the ideal environment of the system, that is, the authors have used java as a programming language and eclipse as the integrated drive electronics tool for the proposed model evaluation. Hardware configuration of the model is such that it is packed with 4 GB RAM and i7 processor, the authors have used the PBC library for the pairing operations (PBC Library, 2022). Furthermore, in the following section of this paper, the number of users is varied to compare with the existing methodology RDIC (Li et al., 2020). For the purposes of the SSD-security protocol, a prime number is chosen as the number of users in this work.

Despite the burgeoning popularity of virtual gifting in live streaming, research lacks an in-depth understanding of the drivers behind this behavior. Using para-social relationship (PSR), this study aims to capture viewers’ lively social feelings toward the streamer as the key factor leading to the purchase behavior of virtual gifts. It also aims to establish a theoretical link between PSR and viewers’ holistic experience in live streaming as captured by cognitive absorption and aims to investigates the role of technological features (i.e. viewer–streamer and viewer–viewer interactivity, streamer-level and viewer-level deep profiling and design aesthetics) in shaping viewers’ experience.

Based on 433 survey responses, this study employs a combination of structural equation modeling and neural networks to offer valuable insights into the relationships between the technological environment, viewer experience and viewer behavior.

Our results highlight the salience of PSR in promoting the purchase of virtual gifts through cognitive absorption and the importance of the technological environment in eliciting the viewer experience. This study sheds light on the development of PSR in a technological environment and its relationship with cognitive absorption.

By applying PSR to conceptualize viewers’ perceived connection with the streamer, this study extends the research on purchase behavior in the non-shopping context by providing an enlightened understanding of virtual gift purchase behavior in live streaming. Moreover, by theoretically linking PSR with cognitive absorption, virtual gift purchase and technological features of live streaming, it enriches the theory of PSR and bridges the gap between the design practice of supporting the IT infrastructure of live streaming and research.

Ready-mix concrete delivery problem (RMCDP), a specific version of the vehicle routing problem (VRP), is a relevant supply-chain engineering task for construction management with various formulations and solving methods. This problem can range from a simple scenario involving one source, one material and one destination to a more challenging and complex case involving multiple sources, multiple materials and multiple destinations. This paper presents an Internet of Things (IoT)-supported active building information modeling (BIM) system for optimized multi-project ready-mix concrete (RMC) delivery.

The presented system is BIM-based, IoT supported, dynamic and automatic input/output exchange to provide an optimal delivery program for multi-project ready-mix-concrete problem. The input parameters are extracted as real-time map-supported IoT data and transferred to the system via an application programming interface (API) into a mixed-integer linear programming (MILP) optimization model developed to perform the optimization. The obtained optimization results are further integrated into BIM by conventional project management tools. To demonstrate the features of the suggested system, an RMCDP example was applied to solve that included four building sites, seven eligible concrete plants and three necessary RMC mixtures.

The system provides the optimum delivery schedule for multiple RMCs to multiple construction sites, as well as the optimum RMC quantities to be delivered, the quantities from each concrete plant that must be supplied, the best delivery routes, the optimum execution times for each construction site, and the total minimal costs, while also assuring the dynamic transfer of the optimized results back into the portfolio of multiple BIM projects. The system can generate as many solutions as needed by updating the real-time input parameters in terms of change of the routes, unit prices and availability of concrete plants.

The suggested system allows dynamic adjustments during the optimization process, andis adaptable to changes in input data also considering the real-time input data. The system is based on spreadsheets, which are widely used and common tool that most stakeholders already utilize daily, while also providing the possibility to apply a more specialized tool. Based on this, the RMCDP can be solved using both conventional and advanced optimization software, enabling the system to handle even large-scale tasks as necessary.

Social commerce (s-commerce) offers community-based platforms that facilitate customer-to-customer interactions and the development of customers' social shopping-based experience. While prior research has addressed the role of customer engagement (CE) in boosting s-commerce-based sales and performance, insight into the effect of s-commerce attributes on CE remains tenuous. Addressing this gap, this study examines the role of specific s-commerce attributes (i.e. community, collaboration, interactivity and social dynamics) on CE, which is, in turn, proposed to impact customers' repurchase- and electronic word of mouth (eWOM) intention.

A web-based survey was deployed to target users of a popular s-commerce platform, Etsy.com. Partial least squares structural equation modeling (PLS-SEM) was, then, used to analyze the survey data collected from 390 users.

The results reveal that the four examined attributes positively affect CE. The findings also demonstrate CE's positive effect on customers' repurchase- and eWOM intention.

Though CE has been identified as a key s-commerce performance indicator, little remains known about the role of specific s-commerce attributes in driving CE, as, therefore, explored in this research. Specifically, the authors examine the role of s-commerce-based community, collaboration, interactivity and social dynamics on CE. Their analyses also corroborate that CE, in turn, drives customers' post-purchase (i.e. repurchase/eWOM) intention. Managerially, our findings can be used to develop more engaging s-commerce platforms.

Cultivating loyal customers is a pressing concern for streamers. The present study investigates how to build interpersonal relationships with streamers and whether different interpersonal relationship factors lead to repurchase intention and WOM intention in live streaming commerce. The moderating effect of gender is also examined.

A self-administered questionnaire was completed by 429 live streaming commerce users in mainland China. Partial least squares structural equation modeling was used to test the research hypotheses.

The results indicate that all four streamer attributes (expertise, authenticity, attractiveness, and homophily) have a positive influence on swift guanxi, and swift guanxi is effective in predicting both calculative commitment and affective commitment. In addition, all interpersonal relationship factors (swift guanxi, calculative commitment, and affective commitment) significantly affect repurchase intentions, with only affective commitment being linked to WOM intention. Also, the moderating role of gender was confirmed in expertise – swift guanxi, attractiveness – swift guanxi, cognitive commitment – repurchase intention and affective commitment – repurchase intention linkages.

This paper contributes to the live streaming commerce literature by integrating swift guanxi, calculative commitment, and affective commitment to understand the repurchase intention and WOM intention from the relationship-building process perspective. In addition, this paper enriches the source credibility and source attractiveness models by identifying gender boundaries on the effectiveness of these models in predicting swift guanxi.

User discontinuance on short-video platform has become increasingly prevalent in recent years. Short-video discontinuance refers to reduced use, controlled use or suspended use of the short-video platform. In this study, we examined factors associated with discontinuance behavior on short-video platform.

From the perspective of stressor–strain–outcome (SSO), we put forward a theoretical model integrating perceived information overload and perceived system feature overload (stressors), dissatisfaction (psychological strain), flow experience and regret to explain discontinuance behavior on short-video platform (behavioral outcome). We collected 482 survey data from Douyin users in China, and empirically examined the proposed research model via Partial least squares structural equation modeling (PLS-SEM) technique.

Our results demonstrated that perceived system feature overload exerts a positive effect on perceived information overload. Perceived system feature overload has a stronger influence on dissatisfaction than perceived information overload. Regret increases user dissatisfaction, while flow experience decreases user dissatisfaction. We also discovered that dissatisfaction and regret have significant positive effects on discontinuance behavior. Interestingly, flow exerts no significant influence on discontinuance behavior.

This study enriches the body of knowledge on social media discontinuance by revealing the interaction and effects of flow experience, dissatisfaction and regret on discontinuance. This study also extends the understanding on the complex role of flow experience in leading to social media discontinuance. Additionally, this study deepens the research on the interaction between perceived system feature overload and perceived information overload as well as their different influences on negative emotion.

Single-shot multi-category clothing recognition and retrieval play a crucial role in online searching and offline settlement scenarios. Existing clothing recognition methods based on RGBD clothing images often suffer from high-dimensional feature representations, leading to compromised performance and efficiency.

To address this issue, this paper proposes a novel method called Manifold Embedded Discriminative Feature Selection (MEDFS) to select global and local features, thereby reducing the dimensionality of the feature representation and improving performance. Specifically, by combining three global features and three local features, a low-dimensional embedding is constructed to capture the correlations between features and categories. The MEDFS method designs an optimization framework utilizing manifold mapping and sparse regularization to achieve feature selection. The optimization objective is solved using an alternating iterative strategy, ensuring convergence.

Empirical studies conducted on a publicly available RGBD clothing image dataset demonstrate that the proposed MEDFS method achieves highly competitive clothing classification performance while maintaining efficiency in clothing recognition and retrieval.

This paper introduces a novel approach for multi-category clothing recognition and retrieval, incorporating the selection of global and local features. The proposed method holds potential for practical applications in real-world clothing scenarios.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.