A detailed experiment of 1-pixel bit reconfigurable ternary optical processor （TOP） is proposed in the paper. 42 basic operation units （BOUs） and 28 typical logic operators of the TOP are realized in the experimen...A detailed experiment of 1-pixel bit reconfigurable ternary optical processor （TOP） is proposed in the paper. 42 basic operation units （BOUs） and 28 typical logic operators of the TOP are realized in the experiment. Results of the test cases elaborately cover the every combination of BOUs and all the nine inputs of ternary processor. Both the experiment process and results analysis are given in this paper. The experimental results demonstrate that the theory of reconfiguring a TOP is valid and that the reconfiguration circuitry is effective.展开更多
Supplying the electronic equipment by exploiting ambient energy sources is a hot spot. In order to achieve the match between power supply and demands under the variance of environments at real time, a reconfigurable t...Supplying the electronic equipment by exploiting ambient energy sources is a hot spot. In order to achieve the match between power supply and demands under the variance of environments at real time, a reconfigurable technique is taken. In this paper, a dynamic power consumption model by using a lookup table as a unit is proposed. Then, we establish a system-level task scheduling model according to the task type. Based on single instruction multiple data （SIMD） architecture which contains a processing system and a control system with a Nios II processor, a practical dynamic reconfigurable system is built. The approach is evaluated on a hardware platform. The test results show that the system can automatically adjust the power consumption in case of external energy input changing. The utilization of the system dynamic power of their portion is from 80.05% to 91.75% during the first task assignment. During the entire processing cycle, the total energy efficiency is 97.67%.展开更多
The agile manufacturing is a new conception for rap id reaction to the consumers. One of its implements is establishing a virtual ente rprise (VE) around the task, where each manufacturing unit, or sub-task, probab ly...The agile manufacturing is a new conception for rap id reaction to the consumers. One of its implements is establishing a virtual ente rprise (VE) around the task, where each manufacturing unit, or sub-task, probab ly have at least one resource, or referred to as suppliers. Because each manufac turing unit might be carried out in different geographical places that implies t his probably gives rise to transportation cost, the selection of resources for e ach manufacturing unit must considers not only the manufacturing price of each r esource but also the transfer cost between any two potential resources. This pap er discusses the resource reconfiguration problem with two hypotheses: 1. Permit s one or more resources to attend the same manufacturing unit as long as the tot al cost can reach its least; 2. The freight contains the initial part, that is t he freight concave. Indeed, these hypotheses are much meaningful in the real wor ld. Furthermore, to simplify the solution for this problem, we propose two conce pts: assembly tree (AT) and combinatorial mode base (CMB). Formally an AT is a c omplete production line, which can ensure the parts equilibrium, and its capacit y is subjected to the least capacity of every resources and every path in it. In the end, we propose an implicit enumeration algorithm (IEA) by the use of CMB, including it is a heuristic algorithm for integer programming (HAIP) by the use of AT. The IEA can be outlined that for a determined combinatorial mode, if it h as not enumerated, we use the HAIP to get an near optima and corresponding CMB, marking every combinatorial mode extended from the CMB as enumerated, other cont inue a new iteration. The HAIP can be outlined that for a determined combinatori al mode, there are some determined number of AT, we select an AT with the le ast slope, and select the volume of this AT to its ultimate within its capacity, iterates this doing until the needed volume reached. In the end, we conclude th is paper and prospect the deep research based on GA thought.展开更多
Human acellular nerve allografts have a wide range of donor origin and can effectively avoid nerve injury in the donor area. Very little is known about one-stage reconstruction of digital nerve defects. The present st...Human acellular nerve allografts have a wide range of donor origin and can effectively avoid nerve injury in the donor area. Very little is known about one-stage reconstruction of digital nerve defects. The present study observed the feasibility and effectiveness of human acellular nerve allograft in the reconstruction of 〈 5-cm digital nerve defects within 6 hours after injury. A total of 15 cases of nerve injury, combined with nerve defects in 18 digits from the Department of Emergency were enrolled in this study. After dehridement, digital nerves were reconstructed using human acellular nerve allografts. The patients were followed up for 6-24 months after reconstruction. Mackinnon-Dellon static two-point discrimination results showed excellent and good rates of 89%. Semmes-Weinstein monofilament test demonstrated that light touch was normal, with an obvious improvement rate of 78%. These findings confirmed that human acellular nerve allograft for one-stage reconstruction of digital nerve defect after hand injury is feasible, which provides a novel trend for peripheral nerve reconstruction.展开更多
This paper presents a curve reconstruction algorithm based on discrete data points and normal vectors using B-splines.The proposed algorithm has been improved in three steps:parameterization of the discrete data point...This paper presents a curve reconstruction algorithm based on discrete data points and normal vectors using B-splines.The proposed algorithm has been improved in three steps:parameterization of the discrete data points with tangent vectors,the B-spline knot vector determination by the selected dominant points based on normal vectors,and the determination of the weight to balancing the two errors of the data points and normal vectors in fitting model.Therefore,we transform the B-spline fitting problem into three sub-problems,and can obtain the B-spline curve adaptively.Compared with the usual fitting method which is based on dominant points selected only by data points,the B-spline curves reconstructed by our approach can retain better geometric shape of the original curves when the given data set contains high strength noises.展开更多
This paper describes the study of a powered-coast-powered guidance recon¯guration(PCPGR)method used to solve the autonomous rescue problem for the mission pro¯le of a launch vehicle with a coasting phase whe...This paper describes the study of a powered-coast-powered guidance recon¯guration(PCPGR)method used to solve the autonomous rescue problem for the mission pro¯le of a launch vehicle with a coasting phase when the thrust drop fault occurs in the¯rst powered phase(FPP)of the¯nal stage.We¯rst described the constraints of the¯nal stage and the construction of the PCP guidance problem.Then we evaluated the adaptability of the guidance recon¯guration(GR)o®line with numerical optimization by adjusting the constraints of the FPP,the coast phase,and the second powered phase.To determine the fault state set where the rocket can enter the prescribed target orbit through the GR initiate,we proposed a Newton method-based rapid replanning method of the transfer orbit that transforms the complex multi-°ight phase trajectory planning problem into a feasible transfer orbit search problem to produce a fast solution onboard.Combined with the adaptive adjustment of the coasting time and the iterative guidance mode,we realized the autonomous online rescue of the payload.The simulation results showed that the proposed method achieved a reliable and rapid solution and improved a launch vehicle's adaptability to a thrust drop fault.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.61073049)the Shanghai Leading Academic Discipline Project(Grant No.J50103)the Doctorate Foundation of Education Ministry of China(Grant No.20093108110016)
文摘A detailed experiment of 1-pixel bit reconfigurable ternary optical processor （TOP） is proposed in the paper. 42 basic operation units （BOUs） and 28 typical logic operators of the TOP are realized in the experiment. Results of the test cases elaborately cover the every combination of BOUs and all the nine inputs of ternary processor. Both the experiment process and results analysis are given in this paper. The experimental results demonstrate that the theory of reconfiguring a TOP is valid and that the reconfiguration circuitry is effective.
基金supported by the National Natural Science Foundation of China under Grant No. 61176025 and No. 61006027the Fundamental Research Funds for the Central Universities under Grant No.ZYGX2012J003+1 种基金National Laboratory of Analogue Integrated Circuit Grants under Grants No. 9140C0901101002 and No. 9140C0901101003New Century Excellent Talents Program under Grant No.NCET-10-0297
文摘Supplying the electronic equipment by exploiting ambient energy sources is a hot spot. In order to achieve the match between power supply and demands under the variance of environments at real time, a reconfigurable technique is taken. In this paper, a dynamic power consumption model by using a lookup table as a unit is proposed. Then, we establish a system-level task scheduling model according to the task type. Based on single instruction multiple data （SIMD） architecture which contains a processing system and a control system with a Nios II processor, a practical dynamic reconfigurable system is built. The approach is evaluated on a hardware platform. The test results show that the system can automatically adjust the power consumption in case of external energy input changing. The utilization of the system dynamic power of their portion is from 80.05% to 91.75% during the first task assignment. During the entire processing cycle, the total energy efficiency is 97.67%.
文摘The agile manufacturing is a new conception for rap id reaction to the consumers. One of its implements is establishing a virtual ente rprise (VE) around the task, where each manufacturing unit, or sub-task, probab ly have at least one resource, or referred to as suppliers. Because each manufac turing unit might be carried out in different geographical places that implies t his probably gives rise to transportation cost, the selection of resources for e ach manufacturing unit must considers not only the manufacturing price of each r esource but also the transfer cost between any two potential resources. This pap er discusses the resource reconfiguration problem with two hypotheses: 1. Permit s one or more resources to attend the same manufacturing unit as long as the tot al cost can reach its least; 2. The freight contains the initial part, that is t he freight concave. Indeed, these hypotheses are much meaningful in the real wor ld. Furthermore, to simplify the solution for this problem, we propose two conce pts: assembly tree (AT) and combinatorial mode base (CMB). Formally an AT is a c omplete production line, which can ensure the parts equilibrium, and its capacit y is subjected to the least capacity of every resources and every path in it. In the end, we propose an implicit enumeration algorithm (IEA) by the use of CMB, including it is a heuristic algorithm for integer programming (HAIP) by the use of AT. The IEA can be outlined that for a determined combinatorial mode, if it h as not enumerated, we use the HAIP to get an near optima and corresponding CMB, marking every combinatorial mode extended from the CMB as enumerated, other cont inue a new iteration. The HAIP can be outlined that for a determined combinatori al mode, there are some determined number of AT, we select an AT with the le ast slope, and select the volume of this AT to its ultimate within its capacity, iterates this doing until the needed volume reached. In the end, we conclude th is paper and prospect the deep research based on GA thought.
基金supported by grants from the National Program on Key Basic Research Project of China(973 Program),No.2014CB542200
文摘Human acellular nerve allografts have a wide range of donor origin and can effectively avoid nerve injury in the donor area. Very little is known about one-stage reconstruction of digital nerve defects. The present study observed the feasibility and effectiveness of human acellular nerve allograft in the reconstruction of 〈 5-cm digital nerve defects within 6 hours after injury. A total of 15 cases of nerve injury, combined with nerve defects in 18 digits from the Department of Emergency were enrolled in this study. After dehridement, digital nerves were reconstructed using human acellular nerve allografts. The patients were followed up for 6-24 months after reconstruction. Mackinnon-Dellon static two-point discrimination results showed excellent and good rates of 89%. Semmes-Weinstein monofilament test demonstrated that light touch was normal, with an obvious improvement rate of 78%. These findings confirmed that human acellular nerve allograft for one-stage reconstruction of digital nerve defect after hand injury is feasible, which provides a novel trend for peripheral nerve reconstruction.
基金Supported by the National Natural Science Foundation of China(Nos.1187113711572081)the Program for Liaoning Innovation Talents in University(No.LCR2018001)
文摘This paper presents a curve reconstruction algorithm based on discrete data points and normal vectors using B-splines.The proposed algorithm has been improved in three steps:parameterization of the discrete data points with tangent vectors,the B-spline knot vector determination by the selected dominant points based on normal vectors,and the determination of the weight to balancing the two errors of the data points and normal vectors in fitting model.Therefore,we transform the B-spline fitting problem into three sub-problems,and can obtain the B-spline curve adaptively.Compared with the usual fitting method which is based on dominant points selected only by data points,the B-spline curves reconstructed by our approach can retain better geometric shape of the original curves when the given data set contains high strength noises.
基金supported by the National Nature Science Foundation of China(Grant No.62173301)the Young Elite Scientist Sponsorship Program by CAST(Grant No.YESS2000021).
文摘This paper describes the study of a powered-coast-powered guidance recon¯guration(PCPGR)method used to solve the autonomous rescue problem for the mission pro¯le of a launch vehicle with a coasting phase when the thrust drop fault occurs in the¯rst powered phase(FPP)of the¯nal stage.We¯rst described the constraints of the¯nal stage and the construction of the PCP guidance problem.Then we evaluated the adaptability of the guidance recon¯guration(GR)o®line with numerical optimization by adjusting the constraints of the FPP,the coast phase,and the second powered phase.To determine the fault state set where the rocket can enter the prescribed target orbit through the GR initiate,we proposed a Newton method-based rapid replanning method of the transfer orbit that transforms the complex multi-°ight phase trajectory planning problem into a feasible transfer orbit search problem to produce a fast solution onboard.Combined with the adaptive adjustment of the coasting time and the iterative guidance mode,we realized the autonomous online rescue of the payload.The simulation results showed that the proposed method achieved a reliable and rapid solution and improved a launch vehicle's adaptability to a thrust drop fault.
