The Lp dual curvature measure was introduced by Lutwak,
Yang & Zhang in an attempt to unify the Lp Brunn–
Minkowski theory and the dual Brunn–Minkowski theory.
The characterization problem for Lp dual curvature measure,
called the Lp dual Minkowski problem, is a fundamental
problem in this unifying theory. The Lp dual Minkowski
problem contains the Lp Minkowski problem and the dual
Minkowski problem, two major problems in modern convex
geometry that remain open in general. In this paper, existence
results on the Lp dual Minkowski problem in the weak sense
will be provided. Moreover, existence and uniqueness of the
solution in the smooth category will also be demonstrated.
Quantitatively identifying direct dependencies between variables is an important task in data analysis, in particular for reconstructing various types of networks and causal relations in science and engineering. One of the most widely used criteria is partial correlation, but it can only measure linearly direct association and miss nonlinear associations. However, based on conditional independence, conditional mutual information (CMI) is able to quantify nonlinearly direct relationships among variables from the observed data, superior to linear measures, but suffers from a serious problem of underestimation,
in particular for those variables with tight associations in a network, which severely limits its applications. In this work, we propose a new concept, “partial independence,” with a new measure, “part mutual information” (PMI), which not only can overcome the problem of CMI but also retains the quantification properties of both mutual information (MI) and CMI. Specifically, we first defined PMI to measure nonlinearly direct dependencies between variables and then derived its relations with MI and CMI. Finally, we used a number of simulated data as benchmark examples to numerically demonstrate PMI features and further real gene expression data from Escherichia coli and yeast to reconstruct gene regulatory networks, which all validated the advantages of PMI for accurately quantifying nonlinearly direct associations in networks.
With the rapid development of internet economy, transparent logistics is stepping into a prosperity period with massive transportation data generated and collected every day. In this paper, we focus on the segmentation of GPS trajectory data generated in logistics transportation to analyze the vehicle behaviors and extract business affair information according to the vehicle behavior characteristics, which is challenging due to the complexity of trajectory data and unavailability of road information. We extract the stopping points from the trajectory data sequence based on the duration of nonmovement, and construct business time window and electronic fence by analyzing the driving habits of vehicles. Furthermore, we propose a probabilistic logic based data segmentation method (PLDSM) which not only helps finding all the business points but also assists in inferring the business affair categories. An efficient