Decoupling for mixed-homogeneous polynomials in $\mathbb R^3$
We prove decoupling inequalities for mixed-homogeneous bivariate polynomials, which partially answers a conjecture of Bourgain, Demeter and Kemp.
math.CA↗
arXiv subjects
Jianhui Li
Publications and source records attributed to Jianhui Li.
Approximations and Bounds for (n, k) Fork-Join Queues: A Linear Transformation Approach
Compared to basic fork-join queues, a job in (n, k) fork-join queues only needs its k out of all n sub-tasks to be finished. Since (n, k) fork-join queues are prevalent in popular distributed systems, erasure coding based cloud storages, and modern network protocols like multipath routing, estimating the sojourn time of such queues is thus critical for the performance measurement and resource plan of computer clusters. However, the estimating keeps to be a well-known open challenge for years, and only rough bounds for a limited range of load factors have been given. In this paper, we developed a closed-form linear transformation technique for jointly-identical random variables: An order statistic can be represented by a linear combination of maxima. This brand-new technique is then used to transform the sojourn time of non-purging (n, k) fork-join queues into a linear combination of the sojourn times of basic (k, k), (k+1, k+1), ..., (n, n) fork-join queues. Consequently, existing approximations for basic fork-join queues can be bridged to the approximations for non-purging (n, k) fork-join queues. The uncovered approximations are then used to improve the upper bounds for purging (n, k) fork-join queues. Simulation experiments show that this linear transformation approach is practiced well for moderate n and relatively large k.
cs.PF↗
An Elementary Approach on Left-Orderability, Cables of Torus Knots and Dehn Surgery
Motivated by Clay and Watson's question on left-orderability of the fundamental group of the resultant space of an $r'$-surgery on the $(p, q)$-cable knots for $r' \in (pq-p-q,pq)$, this paper proves by elementary means that for specific pairs of $(p,q)$-cable knots of torus knots, $r' \in [pq-1,pq]$ gives a surgery yielding non-left orderable fundamental groups.
math.GT↗
Heterogeneous Metric Learning with Content-based Regularization for Software Artifact Retrieval
The problem of software artifact retrieval has the goal to effectively locate software artifacts, such as a piece of source code, in a large code repository. This problem has been traditionally addressed through the textual query. In other words, information retrieval techniques will be exploited based on the textual similarity between queries and textual representation of software artifacts, which is generated by collecting words from comments, identifiers, and descriptions of programs. However, in addition to these semantic information, there are rich information embedded in source codes themselves. These source codes, if analyzed properly, can be a rich source for enhancing the efforts of software artifact retrieval. To this end, in this paper, we develop a feature extraction method on source codes. Specifically, this method can capture both the inherent information in the source codes and the semantic information hidden in the comments, descriptions, and identifiers of the source codes. Moreover, we design a heterogeneous metric learning approach, which allows to integrate code features and text features into the same latent semantic space. This, in turn, can help to measure the artifact similarity by exploiting the joint power of both code and text features. Finally, extensive experiments on real-world data show that the proposed method can help to improve the performances of software artifact retrieval with a significant margin.
cs.LG↗