| 词汇 | example_english_iteration |
| 释义 | Examples of iterationThese examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. The network was trained by processing 12 iterations of the complete training set. Lighting was also the subject of a computer simulation study, with five iterations undertaken before the final configuration of rooflight was determined. To obtain the actual fractal interpolant, one need to continue the iterations indefinitely. The integral equation can be effectively solved by means of successive iterations. If we fail to get a desired function in each of the iterations, we exit out of the algorithm reporting failure. Our estimate for the number of iterations gives a partial answer. Therefore, we are able to ignore the complicated distortion problem caused by multiple iterations and so the bounded distortion condition is not needed. Satisfying the constraints from these two levels is not a straightforward process and it requires numerous iterations. When two eigenvalues have nearly-equal moduli, it is obvious that very many iterations will be required for a direct solution. Suppose the iterations have proceeded so far that only contributions from the two nearly-equal eigenvalues remain. Further iterations of the diagram are therefore likely before the final versions are produced. The temporal expressive power of this system is limited to sequences, disjunction, and iterations of actions and each action is instantaneous. In many cases, fewer iterations may be required, but it is unlikely that using a more complex test of completion would be worthwhile. Successive iterations require fewer primes and the degree of parallelism becomes constrained. Running the model for twenty iterations allows it to settle at a consistent point. The algorithm needs only a few iterations to find the optimal tripods. Five iterations were performed with each of the five subsets used once as the test subset. The expected rate of an event type is estimated by the median value from all 500 iterations. The design procedure may need several iterations before a satisfied plant can be achieved. After two iterations in the first feedback loop, the keywords used for passage retrieval are first and adaptive. If a string passes the existence check, the next step is to simulate the system for maxit iterations using the candidate parameter vector. On successive runs, once the interaction of factors was established, the program did not reach convergence in the 21 admissible iterations. The lattice period function (g) is the smallest integer such that after (g) iterations all points in the lattice have returned to the initial position. Thus, they can play a crucial role mainly in the final iterations phase. The number of iterations required for each algorithm to converge was comparable. Each node consists of an iterated map function with a time-delay factor that schedules successive iterations. The number of iterations is much larger than other experiments reported in the literature, but the actual training time is much shorter. The number of subjects in a generation ranged from two to five, whereas the number of new generations (iterations) ranged from 27 to 67. The diagnostic calculation computes a target expectation that is used to evaluate how the algorithm has performed on its previous iterations. However, in finite precision arithmetic it takes many more iterations to get a small residual. Convergence and pre-images of limit points for coding trees for iterations of holomorphic maps. Again, it takes about 5 = iterations to obtain a solution. Numerical methods for the steady symmetric problem have in most cases involved iterations between the stream function and vorticity equations. In all of our work to date, this method has worked reliably with only a few iterations (typically 6 or less) required for each convergence. The velocity and pressure fields are calculated by two iterations. Subsequent iterations use previously computed eigenvectors corresponding to nearby parameter values. Convergence is slower than in the earlier calculations using free-surface boundary conditions, about a thousand iterations being needed to achieve comparable accuracy. A k-means algorithm with 1000 iterations was computed for each k value. Each run consisted of a large number of iterations, usually 10 000. The second equality is obtained by taking k iterations. The class of admissible submanifolds near to a hyperbolic orbit is preserved under iterations, if their dispersion is small enough. Accordingly, many iterations may often be needed in practical application to obtain sufficiently accurate results. The pseudovelocities are bounded by the physical velocities, so these subsequent iterations are also positive definite. The originality of the method resides in the way the iterations are done. Each loop can be given a bound that specifies how many concurrent iterations are allowed to take place. Their precision of solution normally increases with the number of iterations performed. The reported results are averages over all iterations. The number of iterations was typically in the hundreds and above. In the experiments, it was observed that the minimisation problem is solved in less than eight iterations on average. A way to reduce the number of iterations required for convergence is to adjust the step size as the solution approaches the optimal value. However, this method needs a huge number of iterations in computation. The finding is produced under three different iterations, suggesting that it is quite robust. The number of iterations is chosen to ensure that the limiting behavior of the model is not affected by the particular starting values. To this end, we proceed by induction on the number of iterations of the while loop. The way in which these iterations are described is quite elaborate in this respect. The article bears no trace of the false starts, uncertainties, and iterations of the research process. Table 3 gives the percentage change, over no feedback, after four iterations of feedback using each of the three evaluation techniques. As mentioned above, a dead-lock situation generally appears when the active geometrical constraints remain the same between two iterations of the path-planning process. During successive iterations, the algorithm reestimated the probability distributions for object and background. The number of iterations required and the fraction of realizations rejected progressively increase with the downstream distance and the radial position. In other words, these meters cannot be parsed straightforwardly as iterations of feet with partially identical properties with respect to quantity or branching. The graph shows characteristic values of 250 simulations, consisting of 1500 iterations each and ordered by the simulation mean. The number of iterations is chosen to be such that the grammar somewhat stabilizes, but low enough to avoid unnecessary cycles. Averaging these opportunity losses across all iterations gives the expected cost associated with existing decision uncertainty. The algorithm described above converged in five to ten iterations in all the computations done in this study. The average percentage error was 0.7%, 0.01% and 0.002% for the first, second and third joint respectively when the training was stopped at 30,000 iterations. We analyzed the first order kernels after two iterations of artefact removal and spatial averaging with 17% of the response of its six neighbors!. A comparison between iterations of one task may give multiple solutions that are produced, for example, by changing parameters in the models. The number of iterations is not limited by strict rules and the 'good' eigenvalue approximations are identified by some convergence tests. The last says in his astronomy lessons that for no planet of the solar system can the adjustment of the method go to three iterations. In the most extreme cases considered, h = 0.1 and 10, ten and fifty iterations are required to solve the integral equation. Starting from reasonably well-guessed initial values, it takes about 5 iterations t o obtain a solution. The number of needed iterations depends on both the extent with which gravity affects the flow and the amount of curvature of the gate. Generally, three or four iterations were required to ensure that the lefthand aide of (5) was less than a stipulated tolerance of lo-*. The procedure involves two main steps: a guess of initial values for integration, and iterations to reach the true solution. The first 4000 were discarded, so that posterior distributions were based on 55 000 iterations. The convergence of these estimates is then achieved by iterations over the whole chromosome. The iterations with increasing numbers of switch-off words lead to remarkable differences in attrition patterns. More iterations are needed to reach convergence in regions of the coronary network where large pressure gradients occur. Task dependencies and iterations are represented more clearly in the incidence matrix. There are many possible variations of the derived fixed point iterations. The panels show the bi-directional connections and activation states after 500 iterations, in different conditions. The mean identification time for nonliving things increased too, though, from 20.6 to 26 iterations (for both bottom-up and top-down noise). The term remaining iterations refers to the number of iterations not yet allocated to tasks. In particular, the successive iterations are different for diagonal and off-diagonal components. Second, solution of coupled momentum and density equations by means of simple successive iterations requires a method which enforces stability. After this the nonterminal with the highest count was separated into two and the resulting grammar was trained for 15 iterations. Significant iterations by looping between any two steps are possible, but no details are given. Each run of the model consists of twenty iterations. We accept convergence when the values associated with each gridpoint change by less than 0.0001 between successive iterations. We find that, given a good initial condition, iterations on the value function lead to monotonic convergence (as predicted by the contraction mapping theorem). In this variant, the different possible values of the multi-sets in the tree nodes are exposed in iterations. In past iterations of right-to-die dramas one might have expected to see a cover with the scales of justice and a stethoscope. The initial state is the same as for the top figures, and the function is computed after 1000 iterations of (2). The situation is substantially different when the iterations are audible. Thus, if the number of iterations exceeded 50 (only 39% of the sound events), then the precision magnitude was mapped onto the range [0.00001, 0.0001]. In the case at hand, the program reached convergence after 8 iterations. Notably, the fifth is kept intact in the tenor's opening viderunt, and only changed in the second and third iterations. We mention that for practical problems only a very low number of iterations per time step is necessary. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。