Search

This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algorithm over widely used heuristics such as the Dynamic Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum (VSIDS). Experimental results further confirm the effectiveness of this heuristic strategy in problem-solving., Comment: 7 pages, 2 figures

An algorithm named InterOpt for optimizing operational parameters is proposed based on interpretable machine learning, and is demonstrated via optimization of shale gas development. InterOpt consists of three parts: a neural network is used to construct an emulator of the actual drilling and hydraulic fracturing process in the vector space (i.e., virtual environment); the Sharpley value method in interpretable machine learning is applied to analyzing the impact of geological and operational parameters in each well (i.e., single well feature impact analysis); and ensemble randomized maximum likelihood (EnRML) is conducted to optimize the operational parameters to comprehensively improve the efficiency of shale gas development and reduce the average cost. In the experiment, InterOpt provides different drilling and fracturing plans for each well according to its specific geological conditions, and finally achieved an average cost reduction of 9.7% for a case study with 104 wells., Comment: 29 pages, 12 figures, 3 tables, 5 appendices

AIMS A population pharmacokinetic (PK) analysis was performed to: (1) characterise the PK of unbound and total mycophenolic acid (MPA) and its 7-O-mycophenolic acid glucuronide (MPAG) metabolite, and (2) identify the clinically significant covariates that cause variability in the dose-exposure relationship to facilitate dose optimisation. METHODS A total of 740 unbound MPA (uMPA), 741 total MPA (tMPA) and 734 total MPAG (tMPAG) concentration-time data from 58 Chinese kidney transplant patients were analysed using a nonlinear mixed-effect model. The influence of covariates was tested using a stepwise procedure. RESULTS The PK of unbound MPA and MPAG were characterised by a two- and one-compartment model with first-order elimination, respectively. Apparent clearance of uMPA (CLuMPA/F) was estimated to be 852 L/h with a relative standard error (RSE) of 7.1%. The tMPA and uMPA were connected using a linear protein binding model, in which the protein binding rate constant (kB) increased non-linearly with the serum albumin (ALB) concentration. The estimated kB was 53.4 /h (RSE, 2.3%) for patients with ALB of 40 g/L. In addition, model-based simulation showed that changes in ALB substantially affected tMPA but not uMPA exposure. CONCLUSIONS The established model adequately described the population PK characteristics of the uMPA, tMPA, and MPAG. The estimated CLuMPA/F and unbound fraction of MPA (FUMPA) in Chinese kidney transplant recipients were comparable to those published previously in Caucasians. We recommend monitoring uMPA instead of tMPA to optimise mycophenolate mofetil (MMF) dosing for patients with lower ALB levels., Comment: 39 pages, 3 tables, 5 figures, 1 supplementary table and 1 supplementary figure

Symbolic Aggregate approximation (SAX) is a classical symbolic approach in many time series data mining applications. However, SAX only reflects the segment mean value feature and misses important information in a segment, namely the trend of the value change in the segment. Such a miss may cause a wrong classification in some cases, since the SAX representation cannot distinguish different time series with similar average values but different trends. In this paper, we present Trend Feature Symbolic Aggregate approximation (TFSAX) to solve this problem. First, we utilize Piecewise Aggregate Approximation (PAA) approach to reduce dimensionality and discretize the mean value of each segment by SAX. Second, extract trend feature in each segment by using trend distance factor and trend shape factor. Then, design multi-resolution symbolic mapping rules to discretize trend information into symbols. We also propose a modified distance measure by integrating the SAX distance with a weighted trend distance. We show that our distance measure has a tighter lower bound to the Euclidean distance than that of the original SAX. The experimental results on diverse time series data sets demonstrate that our proposed representation significantly outperforms the original SAX representation and an improved SAX representation for classification., Comment: 9 pages,ACM_IMCOM2019_CFP

Floods of research and practical applications employ social media data for a wide range of public applications, including environmental monitoring, water resource managing, disaster and emergency response.Hydroinformatics can benefit from the social media technologies with newly emerged data, techniques and analytical tools to handle large datasets, from which creative ideas and new values could be mined.This paper first proposes a 4W (What, Why, When, hoW) model and a methodological structure to better understand and represent the application of social media to hydroinformatics, then provides an overview of academic research of applying social media to hydroinformatics such as water environment, water resources, flood, drought and water Scarcity management. At last,some advanced topics and suggestions of water related social media applications from data collection, data quality management, fake news detection, privacy issues, algorithms and platforms was present to hydroinformatics managers and researchers based on previous discussion., Comment: 37pages

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate., Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in Communications, 2012