英语真会造词,一个brain drain就颇可玩味一番。它不是什么新词。《英汉大词典》早已收入,并提供一个释义:(因科学家、学者等向国外移居而造成的)人才流失,人才外流,智囊枯竭。brain drain原本是一个存在于第二、第三世界的现象。不料,...英语真会造词,一个brain drain就颇可玩味一番。它不是什么新词。《英汉大词典》早已收入,并提供一个释义:(因科学家、学者等向国外移居而造成的)人才流失,人才外流,智囊枯竭。brain drain原本是一个存在于第二、第三世界的现象。不料,近来在英国也冒出了这个问题: Britain must raise salaries and improve the career structure of scientists toplug(阻止)a brain drain. 本文的难句是: In a letter to the science journal Nature,Pierson and Cotgreave said thenumber of citations per article for the 252 scientists they had tracked weresignificantly higher for those who are living in the United Sates than for those whoremained in Britain. 读者朋友,当你遇到难句,经过思考分析,终于征服了它,你有怎样的感觉?下面我们提供上句的译文。你不妨先自译,而后再读我们的参考译文不迟。 参考译文: Pierson和Cotgreave在给《自然》这本科学杂志的一封信中说,对他们跟踪调查的252名科学家每篇文章被引用次数来看,那些已经移居美国的要比仍留居英国的要多得多。展开更多
In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation...In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.展开更多
In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical...In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.展开更多
The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other ...The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other fields. In the 0/1 MKP, a set of items is given, each with a size and value, which has to be placed into a knapsack that has a certain number of dimensions having each a limited capacity. The goal is to find a subset of items leading to the maximum total profit while respecting the capacity constraints. Even though the 0/1 MKP is well studied in the literature, we can just find a little number of recent review papers on this problem. Furthermore, the existing reviews focus particularly on some specific issues. This paper aims to give a general and comprehensive survey of the considered problem so that it can be useful for both researchers and practitioners. Indeed, we first describe the 0/1 MKP and its relevant variants. Then, we present the detailed models of some important real-world applications of this problem. Moreover, an important collection of recently published heuristics and metaheuristics is categorized and briefly reviewed. These approaches are then quantitatively compared through some indicative statistics. Finally, some synthetic remarks and research directions are highlighted in the conclusion.展开更多
Software product lines have recently been presented as one of the best promis-ing improvements for the efficient software development. Different research works contribute supportive parameters and negotiations regardi...Software product lines have recently been presented as one of the best promis-ing improvements for the efficient software development. Different research works contribute supportive parameters and negotiations regarding the prob-lems of producing a perfect software scheme. Traditional approaches or recy-cling software are not effective to solve the problems concerning software competence. Since fast developments with software engineering in the past few years, studies show that some approaches are getting extensive attention in both industries and universities. This method is categorized as the software product line improvement;that supports reusing of software in big organizations. Different industries are adopting product lines to enhance efficiency and reduce operational expenses by way of emerging product developments. This research paper is formed to offer in-depth study regarding the software engineering issues such as complexity, conformity, changeability, invisibility, time constraints, budget constraints, and security. We have conducted various research surveys by visiting different professional software development organizations and took feedback from the professional software engineers to analyze the real-time problems that they are facing during the development process of software systems. Survey results proved that complexity is a most occurring issue that most software developers face while developing software applications. Moreover, invisibility is the problem that rarely happens according to the survey.展开更多
Under the appropriate hypotheses subject to the unknown function and the free term, by means of our Lemma, we prove the rationality of order at x = ∞ on two sides for the characteristic singular integral equations wi...Under the appropriate hypotheses subject to the unknown function and the free term, by means of our Lemma, we prove the rationality of order at x = ∞ on two sides for the characteristic singular integral equations with solutions having singularities of higher order on the real axis X. We transform the equations into solving equivalent Riemann boundary value problems with solutions having singularities of higher order and with additional conditions on X. The solutions and the solvable conditions for the former are obtained from the latter.展开更多
文摘英语真会造词,一个brain drain就颇可玩味一番。它不是什么新词。《英汉大词典》早已收入,并提供一个释义:(因科学家、学者等向国外移居而造成的)人才流失,人才外流,智囊枯竭。brain drain原本是一个存在于第二、第三世界的现象。不料,近来在英国也冒出了这个问题: Britain must raise salaries and improve the career structure of scientists toplug(阻止)a brain drain. 本文的难句是: In a letter to the science journal Nature,Pierson and Cotgreave said thenumber of citations per article for the 252 scientists they had tracked weresignificantly higher for those who are living in the United Sates than for those whoremained in Britain. 读者朋友,当你遇到难句,经过思考分析,终于征服了它,你有怎样的感觉?下面我们提供上句的译文。你不妨先自译,而后再读我们的参考译文不迟。 参考译文: Pierson和Cotgreave在给《自然》这本科学杂志的一封信中说,对他们跟踪调查的252名科学家每篇文章被引用次数来看,那些已经移居美国的要比仍留居英国的要多得多。
基金supported by the Shanghai Applied Materials Foundation (Grant No.06SA18)
文摘In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.
文摘In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.
文摘The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other fields. In the 0/1 MKP, a set of items is given, each with a size and value, which has to be placed into a knapsack that has a certain number of dimensions having each a limited capacity. The goal is to find a subset of items leading to the maximum total profit while respecting the capacity constraints. Even though the 0/1 MKP is well studied in the literature, we can just find a little number of recent review papers on this problem. Furthermore, the existing reviews focus particularly on some specific issues. This paper aims to give a general and comprehensive survey of the considered problem so that it can be useful for both researchers and practitioners. Indeed, we first describe the 0/1 MKP and its relevant variants. Then, we present the detailed models of some important real-world applications of this problem. Moreover, an important collection of recently published heuristics and metaheuristics is categorized and briefly reviewed. These approaches are then quantitatively compared through some indicative statistics. Finally, some synthetic remarks and research directions are highlighted in the conclusion.
文摘Software product lines have recently been presented as one of the best promis-ing improvements for the efficient software development. Different research works contribute supportive parameters and negotiations regarding the prob-lems of producing a perfect software scheme. Traditional approaches or recy-cling software are not effective to solve the problems concerning software competence. Since fast developments with software engineering in the past few years, studies show that some approaches are getting extensive attention in both industries and universities. This method is categorized as the software product line improvement;that supports reusing of software in big organizations. Different industries are adopting product lines to enhance efficiency and reduce operational expenses by way of emerging product developments. This research paper is formed to offer in-depth study regarding the software engineering issues such as complexity, conformity, changeability, invisibility, time constraints, budget constraints, and security. We have conducted various research surveys by visiting different professional software development organizations and took feedback from the professional software engineers to analyze the real-time problems that they are facing during the development process of software systems. Survey results proved that complexity is a most occurring issue that most software developers face while developing software applications. Moreover, invisibility is the problem that rarely happens according to the survey.
基金Supported by the National Natural Science Foundation of China (10471107)the Specialized Research Fund for the Doctoral Program of Higher Education of China (20060486001)
文摘Under the appropriate hypotheses subject to the unknown function and the free term, by means of our Lemma, we prove the rationality of order at x = ∞ on two sides for the characteristic singular integral equations with solutions having singularities of higher order on the real axis X. We transform the equations into solving equivalent Riemann boundary value problems with solutions having singularities of higher order and with additional conditions on X. The solutions and the solvable conditions for the former are obtained from the latter.
