In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper st...In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.展开更多
With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the rou...With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.展开更多
Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencie...Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencies in ABC regarding its local search ability and global search efficiency. Aiming at these deficiencies,an ABC variant named hybrid ABC(HABC) algorithm is proposed.Firstly, the variable neighborhood search factor is added to the solution search equation, which can enhance the local search ability and increase the population diversity. Secondly, inspired by the neuroscience investigation of real honeybees, the memory mechanism is put forward, which assumes the artificial bees can remember their past successful experiences and further guide the subsequent foraging behavior. The proposed memory mechanism is used to improve the global search efficiency. Finally, the results of comparison on a set of ten benchmark functions demonstrate the superiority of HABC.展开更多
Block-matching motion estimation plays an important role in video coding. The simple and efficient fast block-matching algorithm using Variable Shape Search (VSS) proposed in this paper is based on diamond search and ...Block-matching motion estimation plays an important role in video coding. The simple and efficient fast block-matching algorithm using Variable Shape Search (VSS) proposed in this paper is based on diamond search and hexagon search. The initial big diamond search is designed to fit the directional centre-biased characteristics of the real-world video se- quence, and the directional hexagon search is designed to identify a small region where the best motion vector is expected to locate. Finally, the small diamond search is used to select the best motion vector in the located small region. Experimental results showed that the proposed VSS algorithm can significantly reduce the computational complexity, and provide competitive computational speedup with similar distortion performance as compared with the popular Diamond-based Search (DS) algorithm in the MPEG-4 Simple Profile.展开更多
Multiple sequence alignments can be used in the template-based modelling of protein structures to build fragment-based assembly models. Therefore, useful functional information on the 3D structure of the anti-MCF-7 sc...Multiple sequence alignments can be used in the template-based modelling of protein structures to build fragment-based assembly models. Therefore, useful functional information on the 3D structure of the anti-MCF-7 scFv protein can be obtained using available bioinformatics tools. This paper utilises several commonly-used bioinformatics tools and databases, including BLAST (Basic Local Alignment Search Tool), GenBank, PDB (Protein Data Bank), KABAT numbering and SWISS-MODEL, to gain specific functional insights into the anti-MCF-7 scFv protein and the assembly of single-chain fragment variable (scFv) antibodies, which consist of a variable heavy chain (VH) and a variable light chain (VL) connected by the linker (Gly4-Ser)3. The linker has been built as a loop structure using the Insight II software. The accuracy of the loop structure has been evaluated using Root Mean Square Deviation (RMSD). The accuracies of the VL and VH template-based structures are enhanced by using the evaluation methods Verify3D, ERRAT and Ramchandran plotting, which measure the error in the residues. In the results, 100% of the light-chain residues scored above 0.2, whereas 88.5% of the heavy-chain residues’ scored above 0.15 in the Verify3D evaluation method. Meanwhile, using ERRAT, the alignments of both chains scored more than 70% in space. Additionally, the Ramchandran plot evaluation method showed large numbers of residues in the favoured areas in both chains;these findings demonstrated that all of the chosen templates were the best candidates.展开更多
In cloud computing system,it is a hot and hard issue to find the optimal task scheduling method that makes the processing cost and the running time minimum. In order to deal with the task assignment,a task interaction...In cloud computing system,it is a hot and hard issue to find the optimal task scheduling method that makes the processing cost and the running time minimum. In order to deal with the task assignment,a task interaction graph was used to analyze the task scheduling; a modeling for task assignment was formulated and a particle swarm optimization (PSO)algorithm embedded in the variable neighborhood search (VNS) to optimize the task scheduling was proposed. The experimental results show that the method is more effective than the PSO in processing cost,transferring cost, and running time. When the task is more complex,the effect is much better. So,the algorithm can resolve the task scheduling in cloud computing and it is feasible,valid,and efficient.展开更多
BACKGROUND: Phage display technology has become a vital tool in studies aimed at identifying molecules binding to a specific target. It enables the rapid generation and selection of high affinity, fully human antibody...BACKGROUND: Phage display technology has become a vital tool in studies aimed at identifying molecules binding to a specific target. It enables the rapid generation and selection of high affinity, fully human antibody product candidates to essentially any disease target appropriate for antibody therapy. In this study, we prepared the recombinant single-chain fragment variable ( ScFv) antibody to hepatitis B virus surface antigen (HBsAg) by the phage display technology for obtaining a virus-targeting mediator. METHODS: mRNA was isolated from B-lymphocytes from a healthy volunteer and converted into cDNA. The fragment variables of heavy and light chain were amplified separately and assembled into ScFv DNA with a specially constructed DNA linker by polymerase chain reaction. The ScFv DNA was ligated into the phagmid vector pCANT-AB5E and the ligated sample was transformed into competent E. coli TG1. The transformed cells were infected with M13K07 helper phage to form a human recombinant phage antibody library. The volume and recombinant rate of the library were evaluated by bacterial colony count and restriction analysis. After two rounds of panning with HBsAg. the phage clones displaying ScFv of the antibody were selected by enzyme-linked immunosorbant assay ( ELISA) from the enriched phage clones. The antigen binding affinity of the positive clone was detected by competition ELISA. HB2151 E. coli was transfected with the positive phage clone demonstrated by competition ELISA for production of a soluble form of the anti-HBsAg ScFv. ELISA assay was used to detect the antigen binding affinity of the soluble anti-HBsAg ScFv. Finally, the relative molecular mass of soluble anti-HBsAg ScFv was measured by SDS-PAGE. RESULTS: The variable heavy ( VH ) and variable light (VL) and ScFv DNAs were about 340bp, 320bp and 750bp, respectively. The volume of the library was up to 2 × 106 and 8 of 10 random clones were recombinants. Two phage clones could strongly compete with the original HBsAb for binding to HBsAg. Within 2 strong positive phage clones, the soluble anti-HBsAg ScFv from one clone was found to have the binding activity with HBsAg. SDS-PAGE showed that the relative molecular weight of soluble anti-HBsAg ScFv was 32 kDa. CONCLUSION: The anti-HBsAg ScFv successfully produced by phage antibody technology may be useful for broadening the scope of application of the antibody.展开更多
The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search（TS） algorithm.With the...The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search（TS） algorithm.With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space.The proposed algorithms are tested both on the randomly generated problems and on the real-life problems.Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.展开更多
The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved ...The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.展开更多
This paper treats the problem of chaos synchronization for uncertain Lorenz system via single state variable information of the master system. By the Lyapunov stability theory and adaptive technique, the derived contr...This paper treats the problem of chaos synchronization for uncertain Lorenz system via single state variable information of the master system. By the Lyapunov stability theory and adaptive technique, the derived controller is featured as follows: 1) only single state variable information of the master system is needed;2) chaos synchronization can also be achieved even if the perturbation is occurred in some parameters of the master chaotic system. Finally, the effectiveness of the proposed controllers is also illustrated by the simulations as well as rigorous mathematical proofs.展开更多
In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and...In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]展开更多
Uncertainty theory is a new branch of axiomatic mathematics for studying the subjective uncertainty. In uncertain theory, uncertain variable is a fundamental concept, which is used to represent imprecise quantities (u...Uncertainty theory is a new branch of axiomatic mathematics for studying the subjective uncertainty. In uncertain theory, uncertain variable is a fundamental concept, which is used to represent imprecise quantities (unknown constants and unsharp concepts). Entropy of uncertain variable is an important concept in calculating uncertainty associated with imprecise quantities. This paper introduces the single parameter entropy of uncertain variable, and proves its several important theorems. In the framework of the single parameter entropy of uncertain variable, we can obtain the supremum of uncertainty of uncertain variable by choosing a proper q. The single parameter entropy of uncertain variable makes the computing of uncertainty of uncertain variable more general and flexible.展开更多
In order to enhance the glutathione peroxidase（GPX） catalytic activity of the selenium-containing single-chain variable fragments（Se-scFv）, a novel human scFv was designed on the basis of the structure of human an...In order to enhance the glutathione peroxidase（GPX） catalytic activity of the selenium-containing single-chain variable fragments（Se-scFv）, a novel human scFv was designed on the basis of the structure of human antibody and optimized via bioinformatics methods such as homologous sequence analysis, three-dimensional（3D） model building, binding-site analysis and docking. The DNA sequence of the new human scFv was synthesized and cloned into the expression vector pET22b（＋）, then the scFv protein was expressed in soluble form in Escherichia coli BL21（DE3） and purified by Ni2＋-immobilized metal affinity chromatography（IMAC）. The serine residue of scFv in the active site was converted into selenocysteine（Sec） with the chemical modification method, thus, the human Se-scFv with GPX activity was obtained. The GPX activity of the Se-scFv protein was characterized. Compared with other Se-scFv, the new human Se-scFv showed similar efficiency for catalyzing the reduction of hydrogen peroxide by glutathione. It exhibited pH and temperature dependent catalytic activity and a typical ping-pong kinetic mechanism.展开更多
In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' ...In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.展开更多
Electromagnetic Spectrum(EMS)recognition is vital in spectrum control,interference location,electronic countermeasures,etc.However,samples of high-value targets are incredibly scarce,even single,and are easily overwhe...Electromagnetic Spectrum(EMS)recognition is vital in spectrum control,interference location,electronic countermeasures,etc.However,samples of high-value targets are incredibly scarce,even single,and are easily overwhelmed by noise and numerous low-value targets,resulting in poor recognition accuracy using traditional methods.Furthermore,the great similarity between samples from the same manufacturer,model,and batch,makes Specific Emitter Identification(SEI)with the EMS especially challenging.Based on the powerful extension and extraction ability of the Fractional Fourier Transform(FrFT)for detailed features,this paper proposes a novel algorithm for the EMS recognition under a single-sample condition.The proposed method constructs a feature matrix FrFT-M from the results of the FrFT under specific orders for each sample.Then,the most relevant item,obtained by analyzing the correlations among FrFT-Ms between the unidentified sample and known samples,determines the optimal recognition.Three simple tests are conducted,including two simulations considering fifteen basic waveforms and six typical radar signals,and one experiment using STM32 microcontroller boards.The detection results of simulated and experimental data show that the accuracies of all three cases are higher than 86%,even for samples of the same model.Our method is promising and may have significant value in other fields.展开更多
In this review, single-chain fragment variable construction using phage-display technology as a promising anticancer immunotherapy technology is described. Cloning and the specific bio-panning selection with phage dis...In this review, single-chain fragment variable construction using phage-display technology as a promising anticancer immunotherapy technology is described. Cloning and the specific bio-panning selection with phage display technology, as well as the use of the epidermal growth factor receptor (EGFR) at the surface of MCF-7 cells as the antigen for the straightforward specific selection of single chain Fvs, are discussed. Moreover, phage display technologies and their application are important for vaccine production and immunotherapy against viruses and cancers. Furthermore, expression of the gene will cause the production and expression of the protein in prokaryotic and eukaryotic cells, which can be used to detect anti-cancer single chain fragment variables (scFvs). Finally, homology modelling is described to show the three-dimensional scFv structure that verifies the Complementary-Determining-Regions (CDRs) on the surface of the model.展开更多
In this paper,single machine scheduling problems with variable processing time areraised.The criterions of the prolem considered are minimizing scheduling length of all jobs,flowtime and number of tardy jobs and so on...In this paper,single machine scheduling problems with variable processing time areraised.The criterions of the prolem considered are minimizing scheduling length of all jobs,flowtime and number of tardy jobs and so on.The complexity of the problem is determined.展开更多
This paper has compared variable selection method for multiple linear regression models that have both relative and non-relative variables in full model when predictor variables are highly correlated 0.999 . In this s...This paper has compared variable selection method for multiple linear regression models that have both relative and non-relative variables in full model when predictor variables are highly correlated 0.999 . In this study two objective functions used in the Tabu Search are mean square error （MSE） and the mean absolute error （MAE）. The results of Tabu Search are compared with the results obtained by stepwise regression method based on the hit percentage criterion. The simulations cover the both cases, without and with multicollinearity problems. For each situation, 1,000 iterations are examined by applying a different sample size n = 25 and 100 at 0.05 level of significance. Without multicollinearity problem, the hit percentages of the stepwise regression method and Tabu Search using the objective function of MSE are almost the same but slightly higher than the Tabu Search using the objective function of MAE. However with multicollinearity problem the hit percentages of the Tabu Search using both objective functions are higher than the hit percentage of the stepwise regression method.展开更多
In this article, we study the variable selection of partially linear single-index model(PLSIM). Based on the minimized average variance estimation, the variable selection of PLSIM is done by minimizing average varianc...In this article, we study the variable selection of partially linear single-index model(PLSIM). Based on the minimized average variance estimation, the variable selection of PLSIM is done by minimizing average variance with adaptive l1 penalty. Implementation algorithm is given. Under some regular conditions, we demonstrate the oracle properties of aLASSO procedure for PLSIM. Simulations are used to investigate the effectiveness of the proposed method for variable selection of PLSIM.展开更多
The difficulty of quantum key agreement is to realize its security and fairness at the same time.This paper presents a new three-party quantum key agreement protocol based on continuous variable single-mode squeezed s...The difficulty of quantum key agreement is to realize its security and fairness at the same time.This paper presents a new three-party quantum key agreement protocol based on continuous variable single-mode squeezed state.The three parties participating in the agreement are peer entities,making same contributions to the final key.Any one or two participants of the agreement cannot determine the shared key separately.The security analysis shows that the proposed protocol can resist both external and internal attacks.展开更多
基金supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB114 and 2023BAB094).
文摘In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.
基金supported by the Natural Science Foundation of Zhejiang Province(LY19A020001).
文摘With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.
基金supported by the National Natural Science Foundation of China(7177121671701209)
文摘Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencies in ABC regarding its local search ability and global search efficiency. Aiming at these deficiencies,an ABC variant named hybrid ABC(HABC) algorithm is proposed.Firstly, the variable neighborhood search factor is added to the solution search equation, which can enhance the local search ability and increase the population diversity. Secondly, inspired by the neuroscience investigation of real honeybees, the memory mechanism is put forward, which assumes the artificial bees can remember their past successful experiences and further guide the subsequent foraging behavior. The proposed memory mechanism is used to improve the global search efficiency. Finally, the results of comparison on a set of ten benchmark functions demonstrate the superiority of HABC.
文摘Block-matching motion estimation plays an important role in video coding. The simple and efficient fast block-matching algorithm using Variable Shape Search (VSS) proposed in this paper is based on diamond search and hexagon search. The initial big diamond search is designed to fit the directional centre-biased characteristics of the real-world video se- quence, and the directional hexagon search is designed to identify a small region where the best motion vector is expected to locate. Finally, the small diamond search is used to select the best motion vector in the located small region. Experimental results showed that the proposed VSS algorithm can significantly reduce the computational complexity, and provide competitive computational speedup with similar distortion performance as compared with the popular Diamond-based Search (DS) algorithm in the MPEG-4 Simple Profile.
文摘Multiple sequence alignments can be used in the template-based modelling of protein structures to build fragment-based assembly models. Therefore, useful functional information on the 3D structure of the anti-MCF-7 scFv protein can be obtained using available bioinformatics tools. This paper utilises several commonly-used bioinformatics tools and databases, including BLAST (Basic Local Alignment Search Tool), GenBank, PDB (Protein Data Bank), KABAT numbering and SWISS-MODEL, to gain specific functional insights into the anti-MCF-7 scFv protein and the assembly of single-chain fragment variable (scFv) antibodies, which consist of a variable heavy chain (VH) and a variable light chain (VL) connected by the linker (Gly4-Ser)3. The linker has been built as a loop structure using the Insight II software. The accuracy of the loop structure has been evaluated using Root Mean Square Deviation (RMSD). The accuracies of the VL and VH template-based structures are enhanced by using the evaluation methods Verify3D, ERRAT and Ramchandran plotting, which measure the error in the residues. In the results, 100% of the light-chain residues scored above 0.2, whereas 88.5% of the heavy-chain residues’ scored above 0.15 in the Verify3D evaluation method. Meanwhile, using ERRAT, the alignments of both chains scored more than 70% in space. Additionally, the Ramchandran plot evaluation method showed large numbers of residues in the favoured areas in both chains;these findings demonstrated that all of the chosen templates were the best candidates.
基金National Natural Science Foundation of China(No.61271114)The Key Programs of Science and Technology Research of He'nan Education Committee,China(No.12A520006)
文摘In cloud computing system,it is a hot and hard issue to find the optimal task scheduling method that makes the processing cost and the running time minimum. In order to deal with the task assignment,a task interaction graph was used to analyze the task scheduling; a modeling for task assignment was formulated and a particle swarm optimization (PSO)algorithm embedded in the variable neighborhood search (VNS) to optimize the task scheduling was proposed. The experimental results show that the method is more effective than the PSO in processing cost,transferring cost, and running time. When the task is more complex,the effect is much better. So,the algorithm can resolve the task scheduling in cloud computing and it is feasible,valid,and efficient.
基金This study was supported by grants from the National Natural Science Foundation of China (No. 30572213)and Student Innovation Program of Shanxi Medical University (No.200404).
文摘BACKGROUND: Phage display technology has become a vital tool in studies aimed at identifying molecules binding to a specific target. It enables the rapid generation and selection of high affinity, fully human antibody product candidates to essentially any disease target appropriate for antibody therapy. In this study, we prepared the recombinant single-chain fragment variable ( ScFv) antibody to hepatitis B virus surface antigen (HBsAg) by the phage display technology for obtaining a virus-targeting mediator. METHODS: mRNA was isolated from B-lymphocytes from a healthy volunteer and converted into cDNA. The fragment variables of heavy and light chain were amplified separately and assembled into ScFv DNA with a specially constructed DNA linker by polymerase chain reaction. The ScFv DNA was ligated into the phagmid vector pCANT-AB5E and the ligated sample was transformed into competent E. coli TG1. The transformed cells were infected with M13K07 helper phage to form a human recombinant phage antibody library. The volume and recombinant rate of the library were evaluated by bacterial colony count and restriction analysis. After two rounds of panning with HBsAg. the phage clones displaying ScFv of the antibody were selected by enzyme-linked immunosorbant assay ( ELISA) from the enriched phage clones. The antigen binding affinity of the positive clone was detected by competition ELISA. HB2151 E. coli was transfected with the positive phage clone demonstrated by competition ELISA for production of a soluble form of the anti-HBsAg ScFv. ELISA assay was used to detect the antigen binding affinity of the soluble anti-HBsAg ScFv. Finally, the relative molecular mass of soluble anti-HBsAg ScFv was measured by SDS-PAGE. RESULTS: The variable heavy ( VH ) and variable light (VL) and ScFv DNAs were about 340bp, 320bp and 750bp, respectively. The volume of the library was up to 2 × 106 and 8 of 10 random clones were recombinants. Two phage clones could strongly compete with the original HBsAb for binding to HBsAg. Within 2 strong positive phage clones, the soluble anti-HBsAg ScFv from one clone was found to have the binding activity with HBsAg. SDS-PAGE showed that the relative molecular weight of soluble anti-HBsAg ScFv was 32 kDa. CONCLUSION: The anti-HBsAg ScFv successfully produced by phage antibody technology may be useful for broadening the scope of application of the antibody.
基金supported by the Major State Basic Research Development Program of China (973 Program)(2002CB312205)the National Natural Science Foundation of China (60574077+2 种基金 60874071 60834004)the National High Technology Research and Development Program of China (863 Program) (2007AA04Z102)
文摘The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search（TS） algorithm.With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space.The proposed algorithms are tested both on the randomly generated problems and on the real-life problems.Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.
文摘The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.
文摘This paper treats the problem of chaos synchronization for uncertain Lorenz system via single state variable information of the master system. By the Lyapunov stability theory and adaptive technique, the derived controller is featured as follows: 1) only single state variable information of the master system is needed;2) chaos synchronization can also be achieved even if the perturbation is occurred in some parameters of the master chaotic system. Finally, the effectiveness of the proposed controllers is also illustrated by the simulations as well as rigorous mathematical proofs.
文摘In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]
文摘Uncertainty theory is a new branch of axiomatic mathematics for studying the subjective uncertainty. In uncertain theory, uncertain variable is a fundamental concept, which is used to represent imprecise quantities (unknown constants and unsharp concepts). Entropy of uncertain variable is an important concept in calculating uncertainty associated with imprecise quantities. This paper introduces the single parameter entropy of uncertain variable, and proves its several important theorems. In the framework of the single parameter entropy of uncertain variable, we can obtain the supremum of uncertainty of uncertain variable by choosing a proper q. The single parameter entropy of uncertain variable makes the computing of uncertainty of uncertain variable more general and flexible.
基金Supported by the National Natural Science Foundation of China(No.30970608)the Applicative Technological Project of Bureau of Science and Technology of Changchun City, China(No.2009045)+1 种基金the Development and Planning Major Program of Jilin Provincial Science and Technology Department, China(No.20100948)the Innovation Method Fund of China (No.2008IM040800)
文摘In order to enhance the glutathione peroxidase（GPX） catalytic activity of the selenium-containing single-chain variable fragments（Se-scFv）, a novel human scFv was designed on the basis of the structure of human antibody and optimized via bioinformatics methods such as homologous sequence analysis, three-dimensional（3D） model building, binding-site analysis and docking. The DNA sequence of the new human scFv was synthesized and cloned into the expression vector pET22b（＋）, then the scFv protein was expressed in soluble form in Escherichia coli BL21（DE3） and purified by Ni2＋-immobilized metal affinity chromatography（IMAC）. The serine residue of scFv in the active site was converted into selenocysteine（Sec） with the chemical modification method, thus, the human Se-scFv with GPX activity was obtained. The GPX activity of the Se-scFv protein was characterized. Compared with other Se-scFv, the new human Se-scFv showed similar efficiency for catalyzing the reduction of hydrogen peroxide by glutathione. It exhibited pH and temperature dependent catalytic activity and a typical ping-pong kinetic mechanism.
文摘In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.
基金supported in part by the National Natural Science Foundation of China(No.62293495)。
文摘Electromagnetic Spectrum(EMS)recognition is vital in spectrum control,interference location,electronic countermeasures,etc.However,samples of high-value targets are incredibly scarce,even single,and are easily overwhelmed by noise and numerous low-value targets,resulting in poor recognition accuracy using traditional methods.Furthermore,the great similarity between samples from the same manufacturer,model,and batch,makes Specific Emitter Identification(SEI)with the EMS especially challenging.Based on the powerful extension and extraction ability of the Fractional Fourier Transform(FrFT)for detailed features,this paper proposes a novel algorithm for the EMS recognition under a single-sample condition.The proposed method constructs a feature matrix FrFT-M from the results of the FrFT under specific orders for each sample.Then,the most relevant item,obtained by analyzing the correlations among FrFT-Ms between the unidentified sample and known samples,determines the optimal recognition.Three simple tests are conducted,including two simulations considering fifteen basic waveforms and six typical radar signals,and one experiment using STM32 microcontroller boards.The detection results of simulated and experimental data show that the accuracies of all three cases are higher than 86%,even for samples of the same model.Our method is promising and may have significant value in other fields.
文摘In this review, single-chain fragment variable construction using phage-display technology as a promising anticancer immunotherapy technology is described. Cloning and the specific bio-panning selection with phage display technology, as well as the use of the epidermal growth factor receptor (EGFR) at the surface of MCF-7 cells as the antigen for the straightforward specific selection of single chain Fvs, are discussed. Moreover, phage display technologies and their application are important for vaccine production and immunotherapy against viruses and cancers. Furthermore, expression of the gene will cause the production and expression of the protein in prokaryotic and eukaryotic cells, which can be used to detect anti-cancer single chain fragment variables (scFvs). Finally, homology modelling is described to show the three-dimensional scFv structure that verifies the Complementary-Determining-Regions (CDRs) on the surface of the model.
基金Supported by National Postdoctoral Science Foundation of P.R.China(9902)
文摘In this paper,single machine scheduling problems with variable processing time areraised.The criterions of the prolem considered are minimizing scheduling length of all jobs,flowtime and number of tardy jobs and so on.The complexity of the problem is determined.
文摘This paper has compared variable selection method for multiple linear regression models that have both relative and non-relative variables in full model when predictor variables are highly correlated 0.999 . In this study two objective functions used in the Tabu Search are mean square error （MSE） and the mean absolute error （MAE）. The results of Tabu Search are compared with the results obtained by stepwise regression method based on the hit percentage criterion. The simulations cover the both cases, without and with multicollinearity problems. For each situation, 1,000 iterations are examined by applying a different sample size n = 25 and 100 at 0.05 level of significance. Without multicollinearity problem, the hit percentages of the stepwise regression method and Tabu Search using the objective function of MSE are almost the same but slightly higher than the Tabu Search using the objective function of MAE. However with multicollinearity problem the hit percentages of the Tabu Search using both objective functions are higher than the hit percentage of the stepwise regression method.
文摘In this article, we study the variable selection of partially linear single-index model(PLSIM). Based on the minimized average variance estimation, the variable selection of PLSIM is done by minimizing average variance with adaptive l1 penalty. Implementation algorithm is given. Under some regular conditions, we demonstrate the oracle properties of aLASSO procedure for PLSIM. Simulations are used to investigate the effectiveness of the proposed method for variable selection of PLSIM.
基金Supported by Beijing Natural Science Foundation under Grant Nos.4182006,4162005National Natural Science Foundation of China under Grant Nos.61572053,61472048,61671087,U1636106,61602019,61502016
文摘The difficulty of quantum key agreement is to realize its security and fairness at the same time.This paper presents a new three-party quantum key agreement protocol based on continuous variable single-mode squeezed state.The three parties participating in the agreement are peer entities,making same contributions to the final key.Any one or two participants of the agreement cannot determine the shared key separately.The security analysis shows that the proposed protocol can resist both external and internal attacks.
