Search

Reducing food waste is an important initiative to ensure food security and mitigate climate change. Previous studies have largely ignored the influence of reference points on food waste behavior and the role of human-to-human relational interactions, failing to capture their role in guiding residents' food waste behavior (RFWBs). To address this gap, this study proposes a model that examines the role of reference dependence, normative internalization, and symbolic expectations in RFWBs, while introducing network embeddedness as a moderating variable. Using data collected from 981 respondents online, ordinary least squares were used to test the hypotheses. The results showed that reference dependence and normative internalization had a positive effect on reducing RFWBs with regression coefficients of 0.178 and 0.293 respectively, while symbolic expectations also had a positive effect on RFWBs with a regression coefficient of 0.227. Additionally, Network embeddedness played a significant moderating role in reference dependence, normative internalization, and symbolic expectations with RFWBs. This paper is theoretically innovative and the relevant findings fill the current research gap in the field of food waste, providing guidance and reference for government departments to formulate policies and promote residents to implement food waste reduction behaviors. [ABSTRACT FROM AUTHOR]

Our purpose is to prove the existence of periodic solutions for a competition Lotka-Volterra system on time scales, and one example is given to illustrate our results. [ABSTRACT FROM AUTHOR]

In wireless networks, an attacker can tune a receiver and tap the communication between two nodes. Whether or not some meaningful information is obtained by tapping a wireless connection depends on the transmission scheme. In this paper, we design some secure network coding by combining information-theoretic approaches with cryptographic approaches. It ensures that the wiretapper cannot get any meaningful information no matter how many channels are wiretapped. In addition, if each source packet is augmented with a hash symbol which is computed from a simple nonlinear polynomial function of the data symbols, then the probability of detecting the modification is very high. [ABSTRACT FROM AUTHOR]

From the perspectives of graph theory and combinatorics theory we obtain some new upper bounds on the number of encoding nodes, which can characterize the coding complexity of the network coding, both in feasible acyclic and cyclic multicast networks. In contrast to previous work, during our analysis we first investigate the simple multicast network with source rate h = 2, and then h ≥ 2. We find that for feasible acyclic multicast networks our upper bound is exactly the lower bound given by M. Langberg et al. in 2006. So the gap between their lower and upper bounds for feasible acyclic multicast networks does not exist. Based on the new upper bound, we improve the computational complexity given by M. Langberg et al. in 2009. Moreover, these results further support the feasibility of signatures for network coding. [ABSTRACT FROM AUTHOR]