arXiv subjects

Yanqing Wang

Publications and source records attributed to Yanqing Wang.

59 records · Page 4Linked to original sources

arXiv2014

On possible time singular points and eventual regularity of weak solutions to the fractional Navier-Stokes equations

In this paper, we intend to reveal how the fractional dissipation $(-Δ)^α$ affects the regularity of weak solutions to the 3d generalized Navier-Stokes equations. Precisely, it will be shown that the $(5-4α)/2α$ dimensional Hausdorff measure of possible time singular points of weak solutions on the interval $(0,\infty)$ is zero when $5/6\leα< 5/4$. To this end, the eventual regularity for the weak solutions is firstly established in the same range of $α$. It is worth noting that when the dissipation index $α$ varies from $5/6$ to $ 5/4$, the corresponding Hausdorff dimension is from $1$ to $0$. Hence, it seems that the Hausdorff dimension obtained is optimal. Our results rely on the fact that the space $H^α$ is the critical space or subcritical space to this system when $α\geq5/6$.

math.AP↗

arXiv2014

On the length of Golomb Ruler: A function construction approach based on difference triangle

Since the significance of Golomb Ruler Problem in some context, we proposes a function construction approach based on difference triangle to generate near-optimal Golomb rulers. Let x1, x2, ..., xn be an increasing sequence of integers, where x1 = 0, which satisfies the following conditions: if abs(xi-xj) = abs(xp-xq) then {i, j} = {p,q}. Our objective is to find the order of minimum xn for any given n. In this paper, the two results in a paper are both improved. In addition, it will be shown that the length of Golomb Ruler have been shortened to a half, and that the satisfying sequence can not be generated by such a quadratic formula as $xi = ai^2+bni+ci+dn^2+en+f$ for any rational a, b, c, d, e and f.

math.NT↗

arXiv2014

On measuring team stability in cooperative learning: An example of consecutive course projects on software engineering

Cooperative learning theory has shown that stable membership is a hallmark of effective work teams. According to relation strength and social network centrality, this paper proposes an approach to measure team stability reasons in consecutive cooperative learning. Taking consecutive course projects of software engineering in a university as examples, we examine the relation between team stability and learning performance in consecutive cooperative learning from two parts: learning score and learning satisfaction. Through empirical analysis, it arrives at the conclusion that learning score is in weak positive correlation with team stability. Through questionnaire and interviews, it finds out 78% of the students did not value the importance of team stability, and 67% of the teachers never recommend the students to keep stable teams. Finally, we put forward an expected correlation model of learning performance as future work and discuss instability as well.

cs.CY↗

arXiv2014

Solving reviewer assignment problem in software peer review: An approach based on preference matrix and asymmetric TSP model

Optimized reviewer assignment can effectively utilize limited intellectual resources and significantly assure review quality in various scenarios such as paper selection in conference or journal, proposal selection in funding agencies and so on. However, little research on reviewer assignment of software peer review has been found. In this study, an optimization approach is proposed based on students' preference matrix and the model of asymmetric traveling salesman problem (ATSP). Due to the most critical role of rule matrix in this approach, we conduct a questionnaire to obtain students' preference matrices and convert them to rule matrices. With the help of software ILOG CPLEX, the approach is accomplished by controlling the exit criterion of ATSP model. The comparative study shows that the assignment strategies with both reviewers' preference matrix and authors' preference matrix get better performance than the random assignment. Especially, it is found that the performance is just a little better than that of random assignment when the reviewers' and authors' preference matrices are merged. In other words, the majority of students have a strong wish of harmonious development even though high-level students are not willing to do that.

cs.DL↗

arXiv2014

A Motivation Model of Peer Assessment in Programming Language Learning

Peer assessment is an efficient and effective learning assessment method that has been used widely in diverse fields in higher education. Despite its many benefits, a fundamental problem in peer assessment is that participants lack the motivation to assess others' work faithfully and fairly. Non-consensus is a common challenge that makes the reliability of peer assessment a primary concern in practices. This research proposes a motivation model that uses review deviation and radicalization to identify non-consensus in peer assessment. The proposed model is implemented as a software module in a peer code review system called EduPCR4. EduPCR4 is able to monitor this measure and trigger teacher's arbitration when it detects possible non-consensus. An empirical study conducted in a university-level C programming course showed that the proposed model and its implementation helped to improve the peer assessment practices in many aspects.

cs.CY↗