|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Novel Mobility Formula for Parallel Mechanisms Expressed with Mobility of General Link Group显示文摘The determination of virtual constraints is always one of the key and difficult problems in traditional mobility calculation.To make mobility calculation simple,considering avoiding virtual constraints,some new formulae have been presented,however these formulae can hardly intuitively reflect general link group’s restrictions on output member and its influences on independence of output parameters,which is premise to the judgment of the properties of mobility.Towards the problem to reveal the intrinsic relationship between the degree of freedom(DOF)of a mechanism,the link group,and the dimension of output parameters,also to avoid determination of virtual constraint,based on the new concepts of the'DOF of general link group'and'node parameters',a new formula in the calculation of the mobility of mechanisms is presented that is expressed with DOFs of the general link groups and rank of motion parameters of base point of the output link.It is named GOM(mobility of groups and output parameter)formula.On the basis of new concepts of'effective parameters'and'invalid parameters',a rule is put forward for solving the DOF of mechanisms with invalid parameters by GOM formula,that is,the base point parameters are the subset of effective parameters of link group.Thereafter,several examples are enumerated and the results coincide with the prototype data,which proves the validity of the proposed formula.Meanwhile,it is obtained that the necessary and sufficient condition for the judgment of output parameters independence is that each of the DOF of the link group is not less than zero.The proposed formula which is simple in calculation provides theoretical basis for the judgment of independence of output parameters and provides references for type synthesis of novel parallel mechanisms with independence requirements of their output parameters. | ZHANG Yitong LU Wenjuan MU Dejun YANG Yandong ZHANG Lijie ZENG Daxing | 2013 | Chinese Journal of Mechanical Engineering2013，26，6： | 14 |
| 2 | Wheat stripe rust resistance gene Yr24/Yr26:A retrospective review显示文摘The objective of this review is to describe events in China and elsewhere that are related to the discovery, genetic identification, use, and ultimate break-down of a single wheat gene for resistance to stripe rust, namely Yr24/Yr26. In our retrospective analysis there was an early assumption of at least three genes at or near the locus, which caused an erroneous presumption of genetic diversity for resistance. It is an example of another boom and bust cycle in plant breeding with races virulent to Yr26(V26 races) now being the majority race group in the Chinese Pst population. We have attempted to present our story in a historical and personal context demonstrating research inputs from different national and international groups, as well as some significant contemporary side issues. It covers the period from the late 1980 s to 2017, during which significant rapid advances in the molecular biology of host: pathogen genetics occurred. We attempt to describe both successes and drawbacks in our work. | Robert McIntosh Jingmei Mu Dejun Han Zhensheng Kang | 2018 | The Crop Journal2018，6，4： | 13 |
| 3 | New concept and new theory of mobility calculation for multi-loop mechanisms显示文摘In 2005,Gogu,a Frenchman,analyzed 35 different existing formulas for mobility calculation and pointed that the formulas for quick mobility calculation had some limitations and were not general.Therefore,looking for a general and simple mobility formula is still a hot topic in mechanisms.At the meantime,it is also an important topic to complete the mechanism theory.Gogu proposed a new method that can avoid determining virtual constraints in 2008,but the method is still not general.To solve the problem,this paper defines the new concepts of link-group rank,general-kinematic-pair rank,virtual pair,virtual loop,and virtual-loop rank,and gives a new simple and general formula.Our method converts multi-loop mechanisms into some independent virtual loops,simplifies the problem,avoids calculating virtual constraints,and reduces the calculation difficulty.It is proved that the new formula is simple,general and effective through the mobility analysis of several different kinds of mechanisms.The application of this formula will provide great convenience for general engineers in mobility calculation. | ZHANG YiTong & MU DeJun Mechanical Engineering College of Yanshan University,Qinhuangdao 066004,China | 2010 | Science China(Technological Sciences)2010，53，6： | 12 |
| 4 | SNP-based linkage mapping for validation of adult plant stripe rust resistance QTL in common wheat cultivar Chakwal 86显示文摘Wheat crops in China are constantly challenged by stripe rust. Deployment of cultivars with diverse resistances is the best strategy to control the disease. A recombinant inbred line(RIL) population derived from a cross between the resistant cultivar Chakwal 86 and susceptible landrace Mingxian 169 was studied in multiple environments to examine the underlying genetics and to identify quantitative trait loci(QTL) for stripe rust resistance.One hundred and twenty-eight RILs were genotyped with wheat 35 K SNP array and a genome-wide linkage map with 1480 polymorphic SNP markers, or bins, was constructed.Two major QTL on chromosomes 1BL and 3BS, and one minor QTL on 6BS had significant effects in reducing stripe rust severity. The QTL were validated using composite interval mapping(CIM) and inclusive composite interval mapping(ICIM). These methods explained59.0%–74.1% of the phenotype variation in disease response. The QTL on chromosome 1 BL was confirmed to be Yr29/Lr46 and the one on 3BS was the resistance allele identified in CIMMYT germplasm but was not Yr30/Sr2. The QTL on 6BS probably corresponded to previously known QTL. RILs with combined QTL were more resistant than those with single or no QTL. Kompetitive allele-specific PCR(KASP) assays for the QTL with largest effect QTL on chromosome 3BS were performed on a subset of RILs and 150 unrelated wheat lines. The QTL on 3BS with its linked KASP markers can be used in marker-assisted selection to improve stripe rust resistance in breeding programs. | Qingdong Zeng Jianhui Wu Shuo Huang Fengping Yuan Shengjie Liu Qilin Wang Jingmei Mu Shizhou Yu Li Chen Dejun Han Zhensheng Kang | 2019 | The Crop Journal2019，7，2： | 2 |
| 5 | Learning Multi Labels from Single Label——An Extreme Weak Label Learning Algorithm显示文摘This paper presents a novel algorithm for an extreme form of weak label learning, in which only one of all relevant labels is given for each training sample. Using genetic algorithm, all of the labels in the training set are optimally divided into several non-overlapping groups to maximize the label distinguishability in every group. Multiple classifiers are trained separately and ensembled for label predictions. Experimental results show significant improvement over previous weak label learning algorithms. | DUAN Junhong LI Xiaoyu MU Dejun | 2019 | Wuhan University Journal of Natural Sciences2019，24，2： | 1 |
| 6 | GPU-accelerated phase field simulation of directional solidification显示文摘The phase field simulation has been actively studied as a powerful method to investigate the microstructural evolution during the solidification.However,it is a great challenge to perform the phase field simulation in large length and time scale.The developed graphics processing unit(GPU)calculation is used in the phase filed simulation,greatly accelerating the calculation efficiency.The results show that the computation with GPU is about 36 times faster than that with a single Central Processing Unit(CPU)core.It provides the feasibility of the GPU-accelerated phase field simulation on a desktop computer.The GPU-accelerated strategy will bring a new opportunity to the application of phase field simulation. | GAO Ang HU YanSu WANG ZhiJun MU DeJun LI JunJie WANG JinCheng | 2014 | Science China(Technological Sciences)2014，57，6： | 1 |
| 7 | A Multi-Flow Information Flow Tracking Approach for Proving Quantitative Hardware Security Properties显示文摘Information Flow Tracking(IFT)is an established formal method for proving security properties related to confidentiality,integrity,and isolation.It has seen promise in identifying security vulnerabilities resulting from design flaws,timing channels,and hardware Trojans for secure hardware design.However,existing IFT methods tend to take a qualitative approach and only enforce binary security properties,requiring strict non-interference for the properties to hold while real systems usually allow a small amount of information flows to enable desirable interactions.Consequently,existing methods are inadequate for reasoning about quantitative security properties or measuring the security of a design in order to assess the severity of a security vulnerability.In this work,we propose two multi-flow solutions—multiple verifications for replicating existing IFT model and multi-flow IFT method.The proposed multi-flow IFT method provides more insight into simultaneous information flow behaviors and allows for proof of quantitative information flow security properties,such as diffusion,randomization,and boundaries on the amount of simultaneous information flows.Experimental results show that our method can be used to prove a new type of information flow security property with verification performance benefits. | Yu Tai Wei Hu Lu Zhang Dejun Mu Ryan Kastner | 2021 | Tsinghua Science and Technology2021，26，1： | 1 |
| 8 | Solutions for Supporting Qos in Database in Web Application servers显示文摘 | Lu Jianbo Dai Guanzhong Mu Dejun | 2012 | International Journal of Digital Content Technology and Its Applications2012，6，11： | 1 |
| 9 | Computer-aided structure decomposition theory of kinematic chains and its applications 显示文摘 | DING Huafeng HUANG Zhen MU Dejun | 2008 | Mechanism and Machine Theory2008，43，4： | 1 |
| 10 | An AP-DE Algorithm Based on Multi-step Gradient Method显示文摘Aim to improve the convergence of the adaptive filtering, based on the multi-step gradient method, a new affine pro jection algorithm with direction error is presented. The statistical behavior of the proposed algorithm is analyzed. The deterministic recursive equations for the weight error and for the Mean-square error(MSE) are derived in the weight update direction of the adaptive filtering. The steady-state MSE is also obtained.Simulation results show that the proposed algorithm improve the adaptive filtering convergence and corroborate the theoretical analytical results. | DAI Dameng MU Dejun | 2016 | Chinese Journal of Electronics2016，25，1： | 0 |
| 11 | Using Combinational Logic Function to Watermark IP Based on FPGA显示文摘In the field of digital circuit design, the extensive applications of reusable intellectual property (IP) simplify the design procedure based on very large scale field programmable gate array (FPGA), and shorten the time to market (TTM). However, the flexibility of reusable IP makes itself easy to be stolen and illegally distributed by intruders. The protection method proposed in this paper maps IP owner’s signature to combinational logic functions, and then implements these functions into unused lookup tables (LUTs) in the design based on FPGA, which can be used as a strong proof of IP’s ownership. The related experiment results show that this protection method has favorable characteristics such as low overhead, few effects on performance, and high security. | MIAO Sheng DAI Guanzhong MU Dejun LI Meifeng | 2006 | Wuhan University Journal of Natural Sciences2006，11，6： | 0 |
| 12 | Attribute-based keyword search encryption for power data protection显示文摘To protect the privacy of power data,we usually encrypt data before outsourcing it to the cloud servers.However,it is challenging to search over the encrypted data.In addition,we need to ensure that only authorized users can retrieve the power data.The attribute-based searchable encryption is an advanced technology to solve these problems.However,many existing schemes do not support large universe,expressive access policies,and hidden access policies.In this paper,we propose an attributebased keyword search encryption scheme for power data protection.Firstly,our proposed scheme can support encrypted data retrieval and achieve fine-grained access control.Only authorized users whose attributes satisfy the access policies can search and decrypt the encrypted data.Secondly,to satisfy the requirement in the power grid environment,the proposed scheme can support large attribute universe and hidden access policies.The access policy in this scheme does not leak private information about users.Thirdly,the security analysis and performance analysis indicate that our scheme is efficient and practical.Furthermore,the comparisons with other schemes demonstrate the advantages of our proposed scheme. | Xun Zhang Dejun Mu Jinxiong Zhao | 2023 | High-Confidence Computing2023，3，2： | 0 |
| 13 | An Algorithm for Bus Trajectory Extraction Based on Incomplete Data Source显示文摘 | DAI Dameng MU Dejun | 2012 | Chinese Journal of Electronics2012，21，4： | 0 |
| 14 | Preventing Dropping Packets Attack in Sensor Networks:A Game Theory Approach显示文摘Focusing on dropping packets attacks in sensor net-works,we propose a model of dropping packets attack-resistance as a repeated game based on such an assumption that sensor nodes are rational. The model prevents malicious nodes from attacking by establishing punishment mechanism,and impels sensor net-works to reach a collaborative Nash equilibrium. Simulation re-sults show that the devised model can effectively resist the drop-ping packets attacks(DPA) by choosing reasonable configuration parameters. | YANG Libin MU Dejun CAI Xiaoyan | 2008 | Wuhan University Journal of Natural Sciences2008，13，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员