Search

Vib1, a member of the Ndt80/PhoG-like transcription factor family, has been shown to be essential for cellulase production of Trichoderma reesei. Here, we combined transcriptomic and genetic analyses to gain mechanistic insights into the roles of Vib1 during cellulose degradation. Our transcriptome analysis showed that the vib1 deletion caused 586 genes with decreased expression and 431 genes with increased expression on cellulose. The downregulated genes were enriched for Gene Ontology terms associated with carbohydrate metabolism, transmembrane transport, oxidoreductase activity, and transcription factor activity. Of the 258 genes induced by cellulose, 229 showed no or decreased expression in Δvib1 on cellulose, including almost all (hemi)cellulase genes, crucial sugar transporter genes (IDs:69957, 3405), and the genes encoding main transcriptional activators Xyr1 and Ace3. Additionally, Vib1 also regulated the expression of genes involved in secondary metabolism. Further comparison of the transcriptomes of Δvib1 and Δxyr1 in cellulose revealed that the genes regulated by Vib1 had much overlap with Xyr1 targets especially for the gene set induced by cellulose, presumably whose expression requires the cooperativity between Vib1 and Xyr1. Genetic evidence indicated that Vib1 regulates cellulase gene expression partially via Xyr1. Our results will provide new clues for strain improvement.

Payment systems play a significant role in our daily lives. They are an important driver of economic activities and a vital part of the banking infrastructure of any country. Several current payment systems focus on security and reliability but pay less attention to users’ needs and behaviors. For example, people may share their bankcards with friends or relatives to withdraw money for various reasons. This behavior can lead to a variety of privacy and security issues since the cardholder has to share a bankcard and other sensitive information such as a personal identification number (PIN). In addition, it is commonplace that cardholders may lose their cards, and may not be able to access their accounts due to various reasons. Furthermore, transferring money to an individual who has lost their bankcard and identification information is not a straightforward task. A user-friendly person-to-person payment system is urgently needed to perform secure and reliable transactions that benefit from current technological advancements. In this paper, we propose two secure fund transfer methods termed QuickCash Online and QuickCash Offline to transfer money from peer to peer using the existing banking infrastructure. Our methods provide a convenient way to transfer money quickly, and they do not require using bank cards or any identification card. Unlike other person-to-person payment systems, the proposed methods do not require the receiving entity to have a bank account, or to perform any registration procedure. We implement our QuickCash payment systems and analyze their security strengths and properties.

As a promising paradigm, mobile crowdsensing exerts the potential of widespread sensors embedded in mobile devices. The greedy nature of workers brings the problem of low-quality sensing data, which poses threats to the overall performance of a crowdsensing system. Existing works often tackle this problem with additional function components. In this paper, we systematically formulate the problem into a crowdsensing interaction process between a requestor and a worker, which can be modeled by two types of iterated games with different strategy spaces. Considering that the low-quality data submitted by the workers can reduce the requestor’s payoff and further decrease the global income, we turn to controlling the social welfare in the games. To that aim, we take advantage of zero-determinant strategy, based on which we propose two social welfare control mechanisms under both game models. Specifically, we consider the requestor as the controller of the games and, with proper parameter settings for the to-be-adopted zero-determinant strategy, social welfare can be optimized to the desired level no matter what strategy the worker adopts. Simulation results demonstrate that the requestor can achieve the maximized social welfare and keep it stable by using our proposed mechanisms.

Coverage and connectivity are two important performance evaluation indices for wireless sensor networks (WSNs). In this paper, we focus on the connected target k-coverage (CTC k ) problem in heterogeneous wireless sensor networks (HWSNs). A centralized connected target k-coverage algorithm (CCTC k ) and a distributed connected target k-coverage algorithm (DCTC k ) are proposed so as to generate connected cover sets for energy-efficient connectivity and coverage maintenance. To be specific, our proposed algorithms aim at achieving minimum connected target k-coverage, where each target in the monitored region is covered by at least k active sensor nodes. In addition, these two algorithms strive to minimize the total number of active sensor nodes and guarantee that each sensor node is connected to a sink, such that the sensed data can be forwarded to the sink. Our theoretical analysis and simulation results show that our proposed algorithms outperform a state-of-art connected k-coverage protocol for HWSNs.

Pocket switched networks (PSNs) take advantage of human mobility to deliver data. Investigations on real-world trace data indicate that human mobility shows an obvious spatial regularity: a human being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two HomE based Relay selectiOn (HERO) algorithms. Both algorithms input single data copy into the network at any time. In the basic HERO, only the first node encountered by the source and whose home overlaps a destination’s home is selected as a relay while the enhanced HERO keeps finding more optimal relay that visits the destination’s home with higher probability. The two proposed algorithms only require the relays to exchange the information of their home and/or the visiting frequencies to their home when two nodes meet. As a result, the information update is reduced and there is no global status information that needs to be maintained. This causes light loads on relays because of the low communication cost and storage requirements. Additionally, only simple operations are needed in the two proposed algorithms, resulting in little computation overhead at relays. At last, a theoretical analysis is performed on some key metrics and then the real-world based simulations indicate that the two HERO algorithms are efficient and effective through employing only one or a few relays.