Surfactant Induced Reservoir Wettability Alteration: Recent Theoretical and Experimental Advances in Enhanced Oil Recovery

Reservoir wettability plays an important role in various oil recovery processes. The origin and evolution of reservoir wettability were critically reviewed to better understand the complexity of wettability due to interactions in crude oil-brine-rock system, with introduction of different wetting states and their influence on fluid distribution in pore spaces. The effect of wettability on oil recovery of waterflooding was then summarized from past and recent research to emphasize the importance of wettability in oil displacement by brine. The mechanism of wettability alteration by different surfactants in both carbonate and sandstone reservoirs was analyzed, concerning their distinct surface chemistry, and different interaction patterns of surfactants with components on rock surface. Other concerns such as the combined effect of wettability alteration and interfacial tension (IFT) reduction on the imbibition process was also taken into account. Generally, surfactant induced wettability alteration for enhanced oil recovery is still in the stage of laboratory investigation. The successful application of this technique relies on a comprehensive survey of target reservoir conditions, and could be expected especially in low permeability fractured reservoirs and forced imbibition process

Object-based attention mechanism for color calibration of UAV remote sensing images in precision agriculture.

Color calibration is a critical step for unmanned aerial vehicle (UAV) remote sensing, especially in precision agriculture, which relies mainly on correlating color changes to specific quality attributes, e.g. plant health, disease, and pest stresses. In UAV remote sensing, the exemplar-based color transfer is popularly used for color calibration, where the automatic search for the semantic correspondences is the key to ensuring the color transfer accuracy. However, the existing attention mechanisms encounter difficulties in building the precise semantic correspondences between the reference image and the target one, in which the normalized cross correlation is often computed for feature reassembling. As a result, the color transfer accuracy is inevitably decreased by the disturbance from the semantically unrelated pixels, leading to semantic mismatch due to the absence of semantic correspondences. In this article, we proposed an unsupervised object-based attention mechanism (OBAM) to suppress the disturbance of the semantically unrelated pixels, along with a further introduced weight-adjusted Adaptive Instance Normalization (AdaIN) (WAA) method to tackle the challenges caused by the absence of semantic correspondences. By embedding the proposed modules into a photorealistic style transfer method with progressive stylization, the color transfer accuracy can be improved while better preserving the structural details. We evaluated our approach on the UAV data of different crop types including rice, beans, and cotton. Extensive experiments demonstrate that our proposed method outperforms several state-of-the-art methods. As our approach requires no annotated labels, it can be easily embedded into the off-the-shelf color transfer approaches. Relevant codes and configurations will be available at https://github.com/huanghsheng/object-based-attention-mechanis

API recommendation for event-driven Android application development

Ministry of Education, Singapore under its Academic Research Funding Tier

ABSTRACT Distributed Low-Cost Backbone Formation for Wireless Ad Hoc Networks

Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless networks. Previous methods are mostly designed to minimize the backbone size. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with a large cost. We then propose an efficient distributed method to construct a weighted sparse backbone with low cost. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes ’ costs are smooth or the network maximum node degree is bounded. We also show that with a small modification the constructed backbone is efficient for unicast: the total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than 3 (or 4) times of the least cost (or hop) path in the original communication graph. As a side product, we give an efficient overlay based multicast structure whose total cost is no more than 10 times of the minimum when the network is modeled by UDG. Our theoretical results are corroborated by our simulation studies

Truthful Multicast in Selfish Wireless Networks

In wireless network, it is often assumed that each individual wireless terminal or link will faithfully follow the prescribed protocols without any deviation – except, perhaps, for the faulty or malicious ones. Wireless terminals or links, often owned by individuals, will likely do what is most beneficial to their owners – act “selfishly”. Thus, it is more reasonable to expect that each selfish terminal will try to manipulate the algorithms or protocols for its owners ’ benefit, instead faithfully follow the designed protocols. Therefore, an algorithm or protocol intended for selfish wireless terminals or links must be designed. In this paper, we specifically study how to conduct efficient multicast in selfish wireless networks. We assume that each wireless terminal or communication link (called agent) will incur a cost when it transits some data, and the cost is known to the wireless terminal or communication link itself. For each of the widely used structures for multicast, we design a strategyproof multicast mechanism without using the well known VCG mechanism such that each agent has to truthfully report its cost to maximize its profit. Extensive simulations are conducted to study the practical performances of the proposed protocols regarding the actually network cost and total payment

Truthful multicast routing in selfish wireless networks

In wireless networks, it is often assumed that each individual wireless terminal will faithfully follow the prescribed protocols without any deviation – except, perhaps, for a few faulty or malicious ones. Wireless terminals, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act “selfishly”. Therefore, an algorithm or protocol intended for selfish wireless networks must be designed. In this paper, we specifically study how to conduct efficient multicast routing in selfish wireless networks. We assume that each wireless terminal or communication link will incur a cost when it transits some data. Traditionally, the VCG mechanism has been the only method to design protocols so that each selfish agent will follow the protocols for its own interest to maximize its benefit. The main contributions of this paper are two-folds. First, for each of the widely used multicast structures, we show that the VCG based mechanism does not guarantee that the selfish terminals will follow the protocol. Second, we design the first multicast protocols without using VCG mechanism such that each agent maximizes its profit when it truthfully reports its cost. Extensive simulations are conducted to study the practical performances of the proposed protocols regarding the actual network cost and total payment

OURS: Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks

We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strategyproofness (using weakly dominant strategy). In addition, we systematically study the unicast routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient unicast routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS). Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose