This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the ...This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.展开更多
This paper presents the design of software and hardware of Power Test without Disassembling System.The main system is based on the MSP4301232 of TI.Instant Rotational Speed is measured in the test system,Instantaneous...This paper presents the design of software and hardware of Power Test without Disassembling System.The main system is based on the MSP4301232 of TI.Instant Rotational Speed is measured in the test system,Instantaneous Acceleration and Instantaneous Power is calculated by using the feature of the MCU with the Least Square Method.At last,Testing Data and Error Analysis are measured.展开更多
This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassemb...This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.展开更多
The assembly of a protein complex is very important for its biological function,which can be investigated by determining the order of assembly/disassembly of its protein subunits.Although static structures of many pro...The assembly of a protein complex is very important for its biological function,which can be investigated by determining the order of assembly/disassembly of its protein subunits.Although static structures of many protein com-plexes are available in the protein data bank,their assembly/disassembly orders of subunits are largely unknown.In addi-tion to experimental techniques for studying subcomplexes in the assembly/disassembly of a protein complex,computa-tional methods can be used to predict the assembly/disassembly order.Since sampling is a nontrivial issue in simulating the assembly/disassembly process,coarse-grained simulations are more efficient than atomic simulations are.In this work,we developed computational protocols for predicting the assembly/disassembly orders of protein complexes via coarse-grained simulations.The protocols were illustrated via two protein complexes,and the predicted assembly/disassembly or-ders were consistent with the available experimental data.展开更多
文摘This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.
文摘This paper presents the design of software and hardware of Power Test without Disassembling System.The main system is based on the MSP4301232 of TI.Instant Rotational Speed is measured in the test system,Instantaneous Acceleration and Instantaneous Power is calculated by using the feature of the MCU with the Least Square Method.At last,Testing Data and Error Analysis are measured.
文摘This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.
基金This work was supported by the National Key Research and Development Program of China(2021YFA1301504)the Chinese Academy of Sciences Strategic Priority Research Program(XDB37040202)the National Natural Science Foundation of China(91953101).
文摘The assembly of a protein complex is very important for its biological function,which can be investigated by determining the order of assembly/disassembly of its protein subunits.Although static structures of many protein com-plexes are available in the protein data bank,their assembly/disassembly orders of subunits are largely unknown.In addi-tion to experimental techniques for studying subcomplexes in the assembly/disassembly of a protein complex,computa-tional methods can be used to predict the assembly/disassembly order.Since sampling is a nontrivial issue in simulating the assembly/disassembly process,coarse-grained simulations are more efficient than atomic simulations are.In this work,we developed computational protocols for predicting the assembly/disassembly orders of protein complexes via coarse-grained simulations.The protocols were illustrated via two protein complexes,and the predicted assembly/disassembly or-ders were consistent with the available experimental data.
