|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Investigation of X-1P coating on magnetic head to enhance the stubility of head/disk interface显示文摘Stable lubrication is essential to slider/disk interface of computer hard disk drive. Inertlubricant perfluoropolyether (PFPE) on magnetic hard disk in computer is still prone to catalyticdecomposition by Al2O3, which is one of the materials in slider. A partial fluorinated hexaphenoxycyclotriphosphazene chemical, X-1 P, was analyzed to research on its function to reduce the cata-lytic decomposition of lubricant. The surface free energy of X-1 P coated on head surface was alsoinvestigated. Contact start-stop (CSS) tester was employed to investigate the reflow effective ofX-1 P on lubricant PFPE. Results indicate that thermal stability and reflow of lubricant will be im-proved in the presence of X-1 P on the slider. | YANG Mingchu LUO Jianbin WEN Shizhu ZHANG Xiaoqing LI Yu I. Yagi TIAN Hong 1. State Key Laboratory of Tribology, Tsinghua University Beijing 100084, China 2. Material & Tribology Engineering Department, SAE Magnetics (H. K.) Ltd, Hong Kong, China | 2001 | Science China Mathematics2001，44，S1： | 4 |
| 2 | Structure-function analysis reveals a novel mechanism for regulation of histone demethylase LSD2/AOFI/KDMlb显示文摘 | Qi Zhang Shankang Qi Mingchu Xu Lin Yu Ye Tao Zengqin Deng Wei Wu Jiwen Li Zhongzhou Chen Jiemin Wong | 2013 | Cell Research2013，23，2： | 2 |
| 3 | Game-Theoretic Online Resource Allocation Scheme on Fog Computing for Mobile Multimedia Users显示文摘Fog computing is introduced to relieve the problems triggered by the long distance between the cloud and terminal devices. In this paper, considering the mobility of terminal devices represented as mobile multimedia users(MMUs) and the continuity of requests delivered by them, we propose an online resource allocation scheme with respect to deciding the state of servers in fog nodes distributed at different zones on the premise of satisfying the quality of experience(QoE) based on a Stackelberg game. Specifically, a multi-round of a predictably\unpredictably dynamic scheme is derived from a single-round of a static scheme. The optimal allocation schemes are discussed in detail, and related experiments are designed. For simulations, comparing with non-strategy schemes, the performance of the dynamic scheme is better at minimizing the cost used to maintain fog nodes for providing services. | Yingmo Jie Mingchu Li Cheng Guo Ling Chen | 2019 | China Communications2019，16，3： | 2 |
| 4 | On the 2-factor index of a graph 显示文摘 | Xiong Liming Li Mingchu | 2007 | Discrete Math2007，307，21： | 1 |
| 5 | A reversible information hiding scheme using left-right and up-down Chinese character representation显示文摘 | WANG Zhihui CHANG C C LIN C C LI Mingchu | 2009 | Journal of Systems and Software2009，82，8： | 1 |
| 6 | Flexible service selection with user-specific QoS support in serv- ice-oriented architecture 显示文摘 | ZHAO Laiping REN Yizhi LI Mingchu | 2012 | Journal of Network Computer Applications2012，35，3： | 1 |
| 7 | Hamiltonian cycles in 3-connected claw-free graphs显示文摘 | Mingchu LI | | 0，，03： | 1 |
| 8 | A note on the circumferences of 3-connected claw-free graphs显示文摘 | Mingchu LI | | 0，，： | 1 |
| 9 | Supereulerian index is stable under contractions and closures 显示文摘 | Xiong Liming Li Mingchu | 2010 | Ars Combinatoria2010，97，： | 1 |
| 10 | Hamiltonicity in 2-connected claw-free graphs显示文摘 | Mingchu LI | | 0，，03： | 1 |
| 11 | A novel weighted threshold secret image sharing scheme?显示文摘 | Mingchu Li Shu Ma Cheng Guo | 2015 | Security Comm. Networks2015，，17： | 1 |
| 12 | Magneto-elastohydro-dynamic lubrication of circular contacts at impact loading显示文摘 | Li Mingchu Wang Longli Chen Huisu | 2009 | Tribology International2009，42，2： | 1 |
| 13 | Vertex pancyclism in claw-free graphs显示文摘 | Li MingChu | 1998 | Discrete Math1998，，188： | 1 |
| 14 | Attribute‐based ring signcryption scheme显示文摘 | Zhenzhou Guo Mingchu Li Xinxin Fan | 2012 | Security Comm Networks2012，，6： | 1 |
| 15 | Honeypot and scan detection in intrusion detection system显示文摘 | Chunmei Yin Mingchu Li Jianbo Ma | 2004 | Electrical and Computer Engineering2004，，2： | 1 |
| 16 | Special section:Security on grids and distributed systems显示文摘 | Li Mingchu Cui Yongrui Tian Yuan | 2007 | Future Generation Computer Systems2007，23，6： | 1 |
| 17 | Backbone analysis and algorithm design for the quadratic assignment problem显示文摘As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin- ning state yet, this paper took the quadratic assignment problem (QAP) as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, i.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter- section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic―biased instance based approximate backbone (BI-AB), whose basic idea is as follows: firstly, con- struct a new biased instance for every QAP instance (the optimal solution of the new instance is also optimal for the original one); secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the re- search area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well. | JIANG He ZHANG XianChao CHEN GuoLiang LI MingChu | 2008 | Science in China(Series F)2008，51，5： | 1 |
| 18 | Longest Cycles in 2-Connected Quasi-Claw-Free Graphs显示文摘A graph G is called quasi-claw-free if it satisfies the property:d(x,y)=2 there exists a vertex u∈N(x)∩N(y)such that N[u]■N[x]∪N[y].In this paper,we show that every 2-connected quasi-claw-free graph of order n with G■F contains a cycle of length at least min{3δ+2,n},where F is a family of graphs. | Xiaodong CHEN Mingchu LI Xin MA | 2014 | Journal of Mathematical Research with Applications2014，34，1： | 0 |
| 19 | Path Cover in K_(1,4)-Free Graphs显示文摘For a graph G, a path cover is a set of vertex disjoint paths covering all the vertices of G, and a path cover number of G, denoted by p(G), is the minimum number of paths in a path cover among all the path covers of G. In this paper, we prove that if G is a K_(1,4)-free graph of order n and σ_(k+1)(G) ≥ n-k, then p(G) ≤ k, where σ_(k+1)(G) = min{∑v∈S d(v) : S is an independent set of G with |S| = k + 1}. | Mingda LIU Xiaodong CHEN Mingchu LI | 2019 | Journal of Mathematical Research with Applications2019，39，3： | 0 |
| 20 | Towards Cache-Assisted Hierarchical Detection for Real-Time Health Data Monitoring in IoHT显示文摘Real-time health data monitoring is pivotal for bolstering road services’safety,intelligence,and efficiency within the Internet of Health Things(IoHT)framework.Yet,delays in data retrieval can markedly hinder the efficacy of big data awareness detection systems.We advocate for a collaborative caching approach involving edge devices and cloud networks to combat this.This strategy is devised to streamline the data retrieval path,subsequently diminishing network strain.Crafting an adept cache processing scheme poses its own set of challenges,especially given the transient nature of monitoring data and the imperative for swift data transmission,intertwined with resource allocation tactics.This paper unveils a novel mobile healthcare solution that harnesses the power of our collaborative caching approach,facilitating nuanced health monitoring via edge devices.The system capitalizes on cloud computing for intricate health data analytics,especially in pinpointing health anomalies.Given the dynamic locational shifts and possible connection disruptions,we have architected a hierarchical detection system,particularly during crises.This system caches data efficiently and incorporates a detection utility to assess data freshness and potential lag in response times.Furthermore,we introduce the Cache-Assisted Real-Time Detection(CARD)model,crafted to optimize utility.Addressing the inherent complexity of the NP-hard CARD model,we have championed a greedy algorithm as a solution.Simulations reveal that our collaborative caching technique markedly elevates the Cache Hit Ratio(CHR)and data freshness,outshining its contemporaneous benchmark algorithms.The empirical results underscore the strength and efficiency of our innovative IoHT-based health monitoring solution.To encapsulate,this paper tackles the nuances of real-time health data monitoring in the IoHT landscape,presenting a joint edge-cloud caching strategy paired with a hierarchical detection system.Our methodology yields enhanced cache efficiency and data freshness.The corroborative numerical data accentuates the feasibility and relevance of our model,casting a beacon for the future trajectory of real-time health data monitoring systems. | Muhammad Tahir Mingchu Li Irfan Khan Salman AAl Qahtani Rubia Fatima Javed Ali Khan Muhammad Shahid Anwar | 2023 | Computers, Materials & Continua2023，77，11： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员