At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that targe...At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.展开更多
Decarburized samples of grain oriented silicon steel were coated with alone and blended magnesias and submitted to the high temperature annealing. The magnesias and their blendings were characterized using granulometr...Decarburized samples of grain oriented silicon steel were coated with alone and blended magnesias and submitted to the high temperature annealing. The magnesias and their blendings were characterized using granulometry measurements, ignition loss and reactivity tests. After high temperature annealing, forsterite film morphology, magnetic properties and Goss deviation were also analyzed. Better magnetic properties and sharper Goss orientation were found in samples which had used blended magnesias. These results are explained by the magnesias particle size distributions, forsterite film formation and rate of inhibitors release.展开更多
This paper proposes a dynamic channel allocation scheme based on cognitive radio （CR）. Firstly, the channel probing based on MMSE criterion is implemented, with which the probability distribution of channels in use ...This paper proposes a dynamic channel allocation scheme based on cognitive radio （CR）. Firstly, the channel probing based on MMSE criterion is implemented, with which the probability distribution of channels in use by the primary user is given. Next, take the distances between the CR users and the primary user as basis to stratify the CR users, among the layers; the simulated annealing （SA） algorithm is used to implement the channel assigmnent. This algorithm differs from the well-known 0-1 matrix based allocation scheme, and keeps a good tradeoff between complexity, capacity as well as the fairness problems. The simulation results show that this algorithm can improve the allocation efficiency effectively.展开更多
To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of pa...To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.展开更多
The grain size, textures and grain boundary plane distributions in a cold-rolled and annealed ferritic stainless steel were investigated by means of EBSD techniques. The results show that, following cold rolling with ...The grain size, textures and grain boundary plane distributions in a cold-rolled and annealed ferritic stainless steel were investigated by means of EBSD techniques. The results show that, following cold rolling with the thickness reduction of 85%, relatively low temperature （780℃） annealing brings an extremely sluggish grain growth and no grain texture develops when the annealing time varies from 5 min to 480 min. The free energy reduction of the system is mainly caused by the grain boundary plane re-orientation in addition to minor grain growth because the distributions of grain boundary planes are moderately preferred on { 100} according to the five parameter analyses （FPA） concerning the grain boundary plane characteristics. However, in the case of high-temperature （1 000 ℃） annealing, the average grain size does not increase until annealing time is prolonged to 90 min, after which extensive grain growth occurs and strong {100}（hkl） texture emerges whereas nearly random grain boundary plane distributions are observed. The free energy reduction of the system is most likely attributed to the selective growth.展开更多
In this paper, the author at first develops a method to study convergence of the cascadealgorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), andthen applies the previous result on th...In this paper, the author at first develops a method to study convergence of the cascadealgorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), andthen applies the previous result on the convergence to characterizing compactly supportedrefinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriateinitial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).展开更多
文摘At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.
文摘Decarburized samples of grain oriented silicon steel were coated with alone and blended magnesias and submitted to the high temperature annealing. The magnesias and their blendings were characterized using granulometry measurements, ignition loss and reactivity tests. After high temperature annealing, forsterite film morphology, magnetic properties and Goss deviation were also analyzed. Better magnetic properties and sharper Goss orientation were found in samples which had used blended magnesias. These results are explained by the magnesias particle size distributions, forsterite film formation and rate of inhibitors release.
文摘This paper proposes a dynamic channel allocation scheme based on cognitive radio （CR）. Firstly, the channel probing based on MMSE criterion is implemented, with which the probability distribution of channels in use by the primary user is given. Next, take the distances between the CR users and the primary user as basis to stratify the CR users, among the layers; the simulated annealing （SA） algorithm is used to implement the channel assigmnent. This algorithm differs from the well-known 0-1 matrix based allocation scheme, and keeps a good tradeoff between complexity, capacity as well as the fairness problems. The simulation results show that this algorithm can improve the allocation efficiency effectively.
基金Supported by the National Natural Science Foundation of China(No.61401496)
文摘To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.
基金Project(50974147)supported by the National Natural Science Foundation of ChinaProject(2009ZRB01176)supported by the Natural Science Foundation of Shandong Province,China
文摘The grain size, textures and grain boundary plane distributions in a cold-rolled and annealed ferritic stainless steel were investigated by means of EBSD techniques. The results show that, following cold rolling with the thickness reduction of 85%, relatively low temperature （780℃） annealing brings an extremely sluggish grain growth and no grain texture develops when the annealing time varies from 5 min to 480 min. The free energy reduction of the system is mainly caused by the grain boundary plane re-orientation in addition to minor grain growth because the distributions of grain boundary planes are moderately preferred on { 100} according to the five parameter analyses （FPA） concerning the grain boundary plane characteristics. However, in the case of high-temperature （1 000 ℃） annealing, the average grain size does not increase until annealing time is prolonged to 90 min, after which extensive grain growth occurs and strong {100}（hkl） texture emerges whereas nearly random grain boundary plane distributions are observed. The free energy reduction of the system is most likely attributed to the selective growth.
文摘In this paper, the author at first develops a method to study convergence of the cascadealgorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), andthen applies the previous result on the convergence to characterizing compactly supportedrefinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriateinitial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).
