Query：
学者姓名：刘月
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
A complex square matrix is a ray pattern matrix if each of its nonzero entries has modulus 1. A ray pattern matrix naturally corresponds to a weighted-digraph. A ray pattern matrix A is ray nonsingular if for each entry-wise positive matrix K, A omicron K is nonsingular. A random model of ray pattern matrices with order n is introduced, where a uniformly random ray pattern matrix B is defined to be the adjacency matrix of a simple random digraph D-n,D- p whose arcs are weighted with i.i.d. random variables uniformly distributed over the unit circle in the complex plane. It is shown that p* (n) = 1/n is a threshold function for the random matrix M = I-B to be ray nonsingular, which is the same as the threshold function of the appearance of giant strong components in D-n,D-p.
Keyword ：
random digraph random digraph ray nonsingular ray nonsingular ray pattern matrix ray pattern matrix Threshold function Threshold function uniformly random uniformly random
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Yue , Chen, Ailian , Lin, Fenggen . Threshold function of ray nonsingularity for uniformly random ray pattern matrices [J]. | LINEAR & MULTILINEAR ALGEBRA , 2021 . |
| MLA | Liu, Yue 等. "Threshold function of ray nonsingularity for uniformly random ray pattern matrices" . | LINEAR & MULTILINEAR ALGEBRA (2021) . |
| APA | Liu, Yue , Chen, Ailian , Lin, Fenggen . Threshold function of ray nonsingularity for uniformly random ray pattern matrices . | LINEAR & MULTILINEAR ALGEBRA , 2021 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A complex square matrix is called a ray nonsingular matrix (RNS matrix) if its ray pattern implies that it is nonsingular. A matrix M = I -A(W) is called a cycle tree matrix if the adjacency structure of the cycles in the arc-weighted digraph W (with no multi-arcs or loops), which is described by the cycle graph of W, is a tree. In this paper, it is shown that if there is no positive cycle in W, then the cycle tree matrix M = I - A(W) is a forbidden structure for RNS if and only if M is not RNS. (C) 2020 Elsevier B.V. All rights reserved.
Keyword ：
Cycle tree matrix Cycle tree matrix Digraph Digraph Forbidden structure Forbidden structure Ray nonsingular Ray nonsingular Ray pattern Ray pattern
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Yue . Forbidden structures for ray nonsingularity among cycle tree matrices without positive cycles [J]. | DISCRETE MATHEMATICS , 2020 , 343 (7) . |
| MLA | Liu, Yue . "Forbidden structures for ray nonsingularity among cycle tree matrices without positive cycles" . | DISCRETE MATHEMATICS 343 . 7 (2020) . |
| APA | Liu, Yue . Forbidden structures for ray nonsingularity among cycle tree matrices without positive cycles . | DISCRETE MATHEMATICS , 2020 , 343 (7) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this work, the authors consider a homogeneous system of linear equations of the form A(alpha)(circle times N)x = 0 arising from the distinguishability of two quantum operations by N uses in parallel, where the coefficient matrix A(alpha) depends on a real parameter alpha. It was conjectured by Duan et al. that the system has a non-trivial nonnegative solution if and only if alpha lies in a certain interval R-N depending on N. The authors affirm the necessity part of the conjecture and establish the sufficiency of the conjecture for N <= 10 by presenting explicit non-trivial nonnegative solutions for the linear system.
Keyword ：
Parallel distinguishability Parallel distinguishability Quantum channels Quantum channels
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Chi-Kwong , Liu, Yue , Ma, Chao et al. A NOTE ON PARALLEL DISTINGUISHABILITY OF TWO QUANTUM OPERATIONS [J]. | ELECTRONIC JOURNAL OF LINEAR ALGEBRA , 2020 , 36 : 198-209 . |
| MLA | Li, Chi-Kwong et al. "A NOTE ON PARALLEL DISTINGUISHABILITY OF TWO QUANTUM OPERATIONS" . | ELECTRONIC JOURNAL OF LINEAR ALGEBRA 36 (2020) : 198-209 . |
| APA | Li, Chi-Kwong , Liu, Yue , Ma, Chao , Pelejo, Diane Christine . A NOTE ON PARALLEL DISTINGUISHABILITY OF TWO QUANTUM OPERATIONS . | ELECTRONIC JOURNAL OF LINEAR ALGEBRA , 2020 , 36 , 198-209 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A ray pattern matrix is a matrix whose nonzero entries are all unimodular. An n x n ray pattern matrix A is said to require the weak Perron-Frobenius property if for any n x n entrywise positive matrix K, the spectral radius rho(K circle A) is one of the eigenvalues of K circle A; to require the strong Perron-Frobenius property if rho(K circle A) is an algebraically simple eigenvalue of K circle A and the left and right eigenvectors associated to rho(K circle A) are strictly nonzero. In this paper, necessary and sufficient conditions for ray pattern matrices requiring the weak/strong Perron-Frobenius property are given. (C) 2019 Elsevier Inc. All rights reserved.
Keyword ：
Diagonally similar Diagonally similar Positive cycle Positive cycle Ray pattern Ray pattern Weak/strong Perron-Frobenius property Weak/strong Perron-Frobenius property
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Yue , Tang, Lidan . Ray pattern matrices requiring Perron-Frobenius properties [J]. | LINEAR ALGEBRA AND ITS APPLICATIONS , 2019 , 571 : 103-109 . |
| MLA | Liu, Yue et al. "Ray pattern matrices requiring Perron-Frobenius properties" . | LINEAR ALGEBRA AND ITS APPLICATIONS 571 (2019) : 103-109 . |
| APA | Liu, Yue , Tang, Lidan . Ray pattern matrices requiring Perron-Frobenius properties . | LINEAR ALGEBRA AND ITS APPLICATIONS , 2019 , 571 , 103-109 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A uniformly random ray pattern matrix A with a given zero nonzero pattern (described by a digraph D with no multi-arcs or loops) is the matrix whose nonzero entries are mutually independent random variables uniformly distributed over the unit circle S-1 in the complex plane. It is shown in this paper that the probability of I - A to be ray nonsingular is completely determined by the cycle graph cg(D) of D (i.e. the adjacency structure of the directed cycles in D) if cg(D) is a tree. A formula is given to compute the probability when cg(D) is a tree, and it is also shown that as the order of cg(D) tends to infinity, the limit of the probability is 0. (C) 2017 Elsevier Inc. All rights reserved.
Keyword ：
Cycle tree matrix Cycle tree matrix Digraph Digraph Ray nonsingular Ray nonsingular Ray pattern Ray pattern Uniform distribution Uniform distribution
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Yue . The ray nonsingularity of certain uniformly random ray patterns [J]. | LINEAR ALGEBRA AND ITS APPLICATIONS , 2018 , 537 : 302-317 . |
| MLA | Liu, Yue . "The ray nonsingularity of certain uniformly random ray patterns" . | LINEAR ALGEBRA AND ITS APPLICATIONS 537 (2018) : 302-317 . |
| APA | Liu, Yue . The ray nonsingularity of certain uniformly random ray patterns . | LINEAR ALGEBRA AND ITS APPLICATIONS , 2018 , 537 , 302-317 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we present an internal model approach for the leader-following rendezvous and connectivity preservation problem for a class of multi-agent systems, where both the follower and leader systems can be assumed to contain the strong nonlinearity, as well as the external disturbances and the parametric uncertainties. With the suitable choice of the potential function, two types of internal model based distributed controllers are developed for handling both cases of the certain and uncertain leaders, respectively. By innovatively constructing the intrinsical nonlinear relationship between the rendezvous error and the virtual rendezvous error, we can obtain the corresponding gain functions in both controllers that are able to conquer not only the strong nonlinearity of control plant but also the nonlinearity caused by the potential function. Finally, the validity of our design is illustrated by an example. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword ：
Connectivity preservation Connectivity preservation Internal model Internal model Multi-agent systems Multi-agent systems Nonlinear systems Nonlinear systems Rendezvous Rendezvous
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Dong, Yi , Su, Youfeng , Liu, Yue et al. An internal model approach for multi-agent rendezvous and connectivity preservation with nonlinear dynamics [J]. | AUTOMATICA , 2018 , 89 : 300-307 . |
| MLA | Dong, Yi et al. "An internal model approach for multi-agent rendezvous and connectivity preservation with nonlinear dynamics" . | AUTOMATICA 89 (2018) : 300-307 . |
| APA | Dong, Yi , Su, Youfeng , Liu, Yue , Xu, Shengyuan . An internal model approach for multi-agent rendezvous and connectivity preservation with nonlinear dynamics . | AUTOMATICA , 2018 , 89 , 300-307 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对谱任意问题的研究情况,找到了一个新的非零元个数最少的谱任意Ray模式矩阵,并且用幂零-中心化方法证明了该Ray模式矩阵是谱任意的.
Keyword ：
Ray模式 Ray模式 幂零-中心化方法 幂零-中心化方法 谱任意 谱任意
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 邓将武 , 刘月 . 一类非零元个数最少的谱任意Ray模式 [J]. | 福州大学学报（自然科学版） , 2018 , 46 (5) : 613-619 . |
| MLA | 邓将武 et al. "一类非零元个数最少的谱任意Ray模式" . | 福州大学学报（自然科学版） 46 . 5 (2018) : 613-619 . |
| APA | 邓将武 , 刘月 . 一类非零元个数最少的谱任意Ray模式 . | 福州大学学报（自然科学版） , 2018 , 46 (5) , 613-619 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
研究轴元复符号模式圈链矩阵(即所有元素都是来自{0,±1,±i},且其伴随有向图中所有圈的邻接结构为一条路的复方阵)的复符号非异性禁用结构,给出两端都是正圈的极小禁用轴元圈链阵的特征刻画.
Keyword ：
圈链矩阵 圈链矩阵 复符号模式 复符号模式 复符号非异 复符号非异 有向图 有向图 极小禁用 极小禁用 轴元阵 轴元阵
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈淑梅 , 刘月 . 包含正圈的复符号非异性极小禁用圈链 [J]. | 福州大学学报（自然科学版） , 2018 , 46 (5) : 606-612 . |
| MLA | 陈淑梅 et al. "包含正圈的复符号非异性极小禁用圈链" . | 福州大学学报（自然科学版） 46 . 5 (2018) : 606-612 . |
| APA | 陈淑梅 , 刘月 . 包含正圈的复符号非异性极小禁用圈链 . | 福州大学学报（自然科学版） , 2018 , 46 (5) , 606-612 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
提出一种基于张量分解的有影响力用户识别算法.该算法首先构建基于查询主题的用户交互关系张量,接着利用张量分解算法对用户行为进行预测,最后融合各种交互关系和用户的主题信息给出用户影响力的综合评判.实验结果表明,与非负矩阵分解相比,张量分解的挖掘精度提升了约10％,而与PageRank相比,张量分解的挖掘精度提升了约20％.
Keyword ：
主题相关度 主题相关度 互关系 互关系 张量 张量 用户影响力 用户影响力 社交媒介 社交媒介
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 唐昌宏 , 刘月 . 张量分解在用户影响力度量中的应用 [J]. | 福州大学学报（自然科学版） , 2016 , 44 (2) : 176-181 . |
| MLA | 唐昌宏 et al. "张量分解在用户影响力度量中的应用" . | 福州大学学报（自然科学版） 44 . 2 (2016) : 176-181 . |
| APA | 唐昌宏 , 刘月 . 张量分解在用户影响力度量中的应用 . | 福州大学学报（自然科学版） , 2016 , 44 (2) , 176-181 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
垃圾评论者在很大程度上误导潜在消费者和观点挖掘系统.目前检测垃圾评论者的方法主要是基于评论、评论者和商店之间的关系,忽略了评论者之间的关系.针对上述问题,提出了基于评论者多边图的产品垃圾评论者检测方法.首先,以每个评论者为节点,评论者之间的关系为边,构建评论者之间的关系图模型;其次,根据多边图模型,提出了一种基于PageRank的评论者互评估可信度模型来检测垃圾评论者;最后,采用卓越亚马逊和Resellerrating.com平台上的数据进行验证.结果表明:该模型能够更有效地识别出垃圾评论者,在一定程度上解决了难识别仅发表一条评论的评论者的可信度问题.
Keyword ：
互评估 互评估 可信度 可信度 垃圾评论者 垃圾评论者 多边图模型 多边图模型 评论关系 评论关系
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 徐小婷 , 魏晶晶 , 廖祥文 et al. 基于评论者关系的垃圾评论者识别研究 [J]. | 集美大学学报（自然科学版） , 2016 , 21 (2) : 146-152 . |
| MLA | 徐小婷 et al. "基于评论者关系的垃圾评论者识别研究" . | 集美大学学报（自然科学版） 21 . 2 (2016) : 146-152 . |
| APA | 徐小婷 , 魏晶晶 , 廖祥文 , 刘月 , 陈水利 . 基于评论者关系的垃圾评论者识别研究 . | 集美大学学报（自然科学版） , 2016 , 21 (2) , 146-152 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
