Frequency synchronization for OFDM is very important because the carrier frequency offset (CFO) will damage the *** on the correlation between the front half-symbol and the back half-symbol in BPSK modulation, a cost ...
详细信息
Frequency synchronization for OFDM is very important because the carrier frequency offset (CFO) will damage the *** on the correlation between the front half-symbol and the back half-symbol in BPSK modulation, a cost function is deduced which varies with the carrier frequency offset as a sine function, and then a new carrier frequency offset estimationa* algorithm is *** frequency offset estimation can be conducted based on this cost *** the same time, the method that simplifies iterative calculation is given, which makes thea* algorithm suitable for hardware implementation and practical *** results are also suitable for OFDM signal based on QPSK and 8PSK modulation.
With the remarkable increase in the number of DNA and proteins sequences, it is more important for the study of pattern matching in querying sequence patterns in the biological sequence database. To further raise the ...
详细信息
With the remarkable increase in the number of DNA and proteins sequences, it is more important for the study of pattern matching in querying sequence patterns in the biological sequence database. To further raise the performance of the pattern matchinga* algorithm, a fast exacta* algorithm (called ZTBMH), which is a variation of Zhu-Takaoka* algorithm, is presented. It absorbs the idea of Boyer-Moore-Horspoola* algorithm, which utilizes only bad character heuristic and reduces the number of comparisons, thus improves the performance in practice. The best, worst and average cases in time complexities of the newa* algorithm are also discussed in this paper. The experimental results show that the proposeda* algorithm works better than other compareda* algorithms, especially in case of small alphabets such as nucleotides sequences, and thus the proposeda* algorithm is quite applicable for exact pattern matching in biological sequences.
The Greenhouse Gases Observing Satellite (GOSAT) was successfully launched in January 2009, with the aim of providing global observations of greenhouse gases. We developed ana* algorithm to retrieve CO2 vertical profile...
详细信息
The Greenhouse Gases Observing Satellite (GOSAT) was successfully launched in January 2009, with the aim of providing global observations of greenhouse gases. We developed ana* algorithm to retrieve CO2 vertical profiles from the terrestrial radiation spectra at 700-800 cm(-1) and assessed its validity. For this purpose, we first computed GOSAT pseudomeasurement spectra and then performed CO2 retrieval simulations using the maximum a posteriori (MAP) method, with analytical data for temperature information. Our simulations with no uncertainty in the estimates of atmospheric conditions such as surface temperature, surface emissivity, and profiles of temperature, water vapor, and ozone showed that the retrieved CO2 profiles had an accuracy of 1% above 800 hPa, with little dependence on the a priori profiles. Introducing correlations between layers in an a priori error covariance matrix was important for CO2 retrieval especially above 200 hPa. Enhancing the correlations below 800 hPa was important for CO2 retrieval there. Selecting 100 channels based on CO2 information content for all layers, 10 channels for the region above 55 hPa, and 50 channels for the region below 800 hPa was sufficient to achieve CO2 retrieval with 1% accuracy from the troposphere through the stratosphere. Our simulations with possible errors in the atmospheric conditions showed that 1% accuracy was also achieved at 600-100 hPa in every latitude region, although the retrieved CO2 concentrations probably included up to 4% positive and negative biases at 30 degrees S-30 degrees N above 100 hPa and at mid-and high latitudes below 600 hPa, respectively.
To improve information retrieval speed, it is the key of minimizing traffic and every required visit peer on the view of reducing traffic, combining the merit of width first search won't lead to redundant and P...
详细信息
To improve information retrieval speed, it is the key of minimizing traffic and every required visit peer on the view of reducing traffic, combining the merit of width first search won't lead to redundant and P2P network's dynamic feature, We advanced adopting width first search in local bound-Broad first minimum spanning tree search. It can reduce redundant search packet in some scope. Meanwhile, It won't occupy much network resource in message exchange because of scope is small. The way have good feature in expansibility and robustness. It can adapt to dynamic change in P2P network.
The key driving force behind any capture-the-flag competition is the scoringa* algorithm;the Cyber Grand Challenge (CGC) was no different. In this article, we describe design considerations for the CGC events, how these...
详细信息
The key driving force behind any capture-the-flag competition is the scoringa* algorithm;the Cyber Grand Challenge (CGC) was no different. In this article, we describe design considerations for the CGC events, how thesea* algorithms intended to incentivize competitors, and effects these decisions had on the resulting gameplay.
This paper describes ana* algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. Thea* algorithm initially finds the roots of the zeroth order using an auxi...
详细信息
This paper describes ana* algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. Thea* algorithm initially finds the roots of the zeroth order using an auxiliary function that exhibits the same roots as the original cross-products but with better behavior for numerical root search with the Newton-Raphsona* algorithm. In order to find the roots for higher orders, thea* algorithm follows a pyramidal scheme using the interlacing property of the cross-product of Bessel functions. Thea* algorithm shows globally convergent behavior for a large range of values of the argument and of the order of the Bessel functions. The roots can be computed to any precision, limited only by the computer implementation, and the convergence is attained in six iterations per root in average, showing a much better performance than previous works for the calculation of these roots.
In this paper, we consider rainbow connection number of maximal outerplanar graphs (MOPS) ona* algorithmic aspect. For the (MOP) G, we give sufficient conditions to guarantee that rc(G) = diam(G). Moreover, we produce t...
详细信息
In this paper, we consider rainbow connection number of maximal outerplanar graphs (MOPS) ona* algorithmic aspect. For the (MOP) G, we give sufficient conditions to guarantee that rc(G) = diam(G). Moreover, we produce the graph with given diameter D and give their rainbow coloring in linear time. X. Deng et al. [4] give a polynomial timea* algorithm to compute the rainbow connection number of MOPS by the Maximal fan partition method, but only obtain a compact upper bound. J. Lauri [11] proved that, for chordal outerplanar graphs given an edge-coloring, to verify whether it is rainbow connected is NP-complete under the coloring, it is so for MOPs. Therefore we construct Central-cut spine of MOP G, by which we design ana* algorithm to give a rainbow edge coloring with at most 2rad(G) + 2 + c, 0 <= c <= rad(G) - 2 colors in polynomial time. (C) 2016 Elsevier B.V. All rights reserved.
We present two novela* algorithm features for the transient simulation of cyclic processes that exhibit cyclic steady state (CSS). In principle, thea* algorithm could be used for many cyclic process. Air separation using ...
详细信息
We present two novela* algorithm features for the transient simulation of cyclic processes that exhibit cyclic steady state (CSS). In principle, thea* algorithm could be used for many cyclic process. Air separation using rapid pressure swing adsorption (RPSA) is used as an illustration. The first feature of thea* algorithm is an a priori rational stopping criterion to determine the CSS unambiguously. The stopping criterion ensures that neither is progress towards CSS truncated prematurely nor is computer time wasted by simulating an unnecessarily large number of cycles. The second feature of thea* algorithm is a reduction of the number of cycles required to reach the CSS while ensuring that the CSS is certainly determined. The conditions where these two novela* algorithm features are applicable have been clearly identified. These two features could be employed regardless of the numerical methods used to solve the mathematical models, and regardless of the process in question, as long as certain desired conditions are fulfilled. (C) 2002 Elsevier Science Ltd. All rights reserved.
A newa* algorithm is presented which makes use of the first derivative and morphology of each T-wave, and compare its performance with that of manual measurements on a set of approximately 40 beats at the beginning of 1...
详细信息
A newa* algorithm is presented which makes use of the first derivative and morphology of each T-wave, and compare its performance with that of manual measurements on a set of approximately 40 beats at the beginning of 18 selected Holter tapes. As an example we present the results obtained from a 24-hour Holter ECG signal. It is found that thea* algorithm has better immunity to baseline interferences when the baseline differs from a flat line after T-end, a situation quite common in Holter ECG recordings.
A Memetica* algorithm (MA) is an evolutionarya* algorithm that includes one or more local search phases within its evolutionary *** the last decades,MAs have relied on the use of a variety of different methods as the loca...
详细信息
A Memetica* algorithm (MA) is an evolutionarya* algorithm that includes one or more local search phases within its evolutionary *** the last decades,MAs have relied on the use of a variety of different methods as the local improvement *** have shown that the local search method employed in a MA has significant influence on its *** overcome the restricted theoretical knowledge of a problem and mitigate the effects of an incorrect choice of local search method,we propose an adaptive MA: a memetica* algorithm based on k-Nearest Neighbor(k-NN) in this *** uses multi-memes(multi-local search methods) and adopts an adaptive method based on k-Nearest Neighbor to choose a local search method at ***,experiments on several continuous benchmark problems of diverse complexities show that the new approach is able to provide highly competitive results compared with othera* algorithm.
暂无评论