Minghui Liu

ORCID: 0000-0001-6513-0912
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Optimization Algorithms Research
  • Complexity and Algorithms in Graphs
  • Optimization and Variational Analysis
  • Grief, Bereavement, and Mental Health
  • Impact of Technology on Adolescents
  • COVID-19 and Mental Health
  • Chinese history and philosophy
  • Sparse and Compressive Sensing Techniques
  • Numerical methods for differential equations
  • Suicide and Self-Harm Studies
  • Psychological and Temporal Perspectives Research
  • China's Ethnic Minorities and Relations
  • Migration, Health and Trauma
  • Electromagnetic Simulation and Numerical Methods
  • Vietnamese History and Culture Studies
  • Wireless Sensor Networks and IoT
  • Industrial Technology and Control Systems
  • Advanced Computing and Algorithms
  • Family Caregiving in Mental Illness
  • Differential Equations and Numerical Methods
  • Commutative Algebra and Its Applications
  • Religion, Spirituality, and Psychology
  • Education and Critical Thinking Development
  • Educational Curriculum and Learning Methods
  • Child Development and Digital Technology

Central China Normal University
2012-2022

China Medical University
2021-2022

SAS Institute (United States)
2015-2017

University of North Carolina at Chapel Hill
2015

Nankai University
2009

University of Shanghai for Science and Technology
2005

The literature has shown that mobile phone addiction is an important risk factor for depression. However, the internal mechanisms of leading to depression are still not clear. This study examined mediating role sleep quality and moderating peer relationships in association between A sample 450 Chinese medical students were recruited complete measures addiction, depression, relationships. In this study, SPSS 25.0 macro PROCESS used conduct statistical analysis on collected data. results...

10.1186/s12888-022-04183-9 article EN cc-by BMC Psychiatry 2022-08-23

In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility SDP by elementary approach: reformulate any equality constrained system using only row operations, and rotations. When a is infeasible, the reformulated trivially infeasible. feasible, has strong duality with its Lagrange dual for all objective functions. As corollary, algorithms generate constraints infeasible SDPs...

10.1137/140972354 article EN SIAM Journal on Optimization 2015-01-01

Parents who have lost their only child are known as Shidu parents in China. Losing an is enormous tragedy for that can trigger severe depressive symptoms. Few studies explored the influence of cultural beliefs and social support on symptoms.This study aimed to explore relationship between culture-related grief beliefs, symptoms among rural China.This cross-sectional was conducted Sujiatun district Shenyang, Data were collected from November 2019 February 2020 228 parents. Questionnaires...

10.1080/20008198.2021.1945748 article EN cc-by-nc European journal of psychotraumatology 2021-01-01

There are many one-child families in China due to the policy. Parents who have lost their only child and unable conceive another or unwilling adopt a called Shidu parents China. The death of an puts at risk mental illness even suicide. Few studies explored influence cultural beliefs prolonged grief disorder on suicide ideation.This study involved rural from Sujiatun district Shenyang, Questionnaires consisted Prolonged Grief questionnaire - 13 (PG-13), Culture-related Beliefs Questionnaire...

10.1002/cpp.2768 article EN Clinical Psychology & Psychotherapy 2022-07-01

The purpose of this study was to explore the relationship between loneliness and anxiety, mediating role mobile phone addiction in relationship, whether moderated by gender among Chinese medical students. A cross-sectional conducted on March April 2021 Shenyang city China. In total, 595 students were surveyed complete an online questionnaire including demographic variables, usage information, loneliness, addiction, 553 samples effective for final analyses. SPSS macro PROCESS performed test...

10.1177/08944393221106934 article EN Social Science Computer Review 2022-06-07

In conic linear programming -- in contrast to the Lagrange dual is not an exact dual: it may attain its optimal value, or there be a positive duality gap. The corresponding Farkas' lemma also (it does always prove infeasibility). We describe duals, and certificates of infeasibility weak for LPs which are nearly as simple dual, but do rely on any constraint qualification. Some our duals generalize SDP Ramana, Klep Schweighofer context general LPs. row echelon form system equations: they...

10.48550/arxiv.1507.00290 preprint EN other-oa arXiv (Cornell University) 2015-01-01

To improve students' academic performance, it is important to explore the frequency and differences of learning activities in Science Chinese classes. Based on ICAP framework, this study designed coding scheme analyze two classes video recordings (science classes). Then χ2-test social network analysis are conducted. The results revealed that is: active > constructive passive instructive. number class more than class. Students tend operate, summarize, discuss communicate actively, but they...

10.1145/3582580.3582633 article EN 2022-12-16

In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility SDP by elementary approach: reformulate any system the form Ai*X = bi (i=1,...,m) (P) X >= 0 using only row operations, and rotations. When is infeasible, reformulated trivially infeasible. feasible, has strong duality with its Lagrange dual for all objective functions. As a corollary, algorithms generate constraints {\em...

10.48550/arxiv.1406.7274 preprint EN other-oa arXiv (Cornell University) 2014-01-01

In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility SDP by elementary approach: reformulate any system the form Ai*X = bi (i=1,...,m) (P) X >= 0 using only row operations, and rotations. When is infeasible, reformulated trivially infeasible. feasible, has strong duality with its Lagrange dual for all objective functions. As a corollary, algorithms generate constraints...

10.17615/fk92-1x19 article EN Carolina Digital Repository (University of North Carolina at Chapel Hill) 2015-01-01
Coming Soon ...