an algorithm can call an algorithm for a sub-solution 翻译

An SE-tree-based prime implicant generation algorithm* 中的SE-tree-based 应该怎么翻译?

英语翻译
We begin by analyzing the error bounds for our algorithm and showing that it converges more closely to the ground truth for an appropriately chosen aperiodic pixel layout than for a periodic one.

英语翻译
The 3n + 1 problem
Consider the following algorithm to generate a sequence of numbers.Start with an integer n.If n is even,divide by 2.If n is odd,multiply by 3 and add 1.Repeat this process with the new value of n,terminating when n = 1.For example,the following sequence of numbers will be generated for n = 22:
22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
It is conjectured (but not yet proven) that this algorithm will terminate at n = 1 for every integer n.Still,the conjecture holds for all integers up to at least 1,000,000.
For an input n,the cycle-length of n is the number of numbers generated up to and including the 1.In the example above,the cycle length of 22 is 16.Given any two numbers i and j,you are to determine the maximum cycle length over all numbers between i and j,including both endpoints.
Input
The input will consist of a series of pairs of integers i and j,one pair of integers per line.All integers will be less than 1,000,000 and greater than 0.
Output
For each pair of input integers i and j,output i,j in the same order in which they appeared in the input and then the maximum cycle length for integers between and including i and j.These three numbers should be separated by one space,with all three numbers on one line and with one line of output for each line of input.
Sample Input
1 10
100 200
201 210
900 1000
Sample Output
1 10 20
100 200 125
201 210 89
900 1000 174

翻译,IT句子英文翻译
1. discuss fast-factoringalgorithm can be used to break RSA algorithm.

英语翻译
Critical parameters of a genetic algorithm are size of the population,mutation rate,number of iterations (i.e.generations),etc.In this study,population size of 50,crossover rate of 1.0,mutation rate of 0.1,bit number for each variable of 16 and number of generations of 2500 are employed.Optimization history with iterations for warpage is shown in Fig.7.Since GA converges to an optimum after about 250 iterations,optimization history only up to 250 iterations is demonstrated in Fig.7.Warpage values on reference points for before and afteroptimization arecompared in Table 6.As seen inTable6,warpage values at most of the reference points are reduced significantly although they are slightly increased at some points.When maximum warpage is considered,it is seen that maximum warpage on the lamp base model,which is2.47mm before the optimization,is reduced to 1.32mm by 46.5% after optimization.In Table6,(-)and (no sign,i.e.+) values indicate reduction and increase in warpage respectively at reference points.
加上这一段基本就要全部完成了,

英语翻译
the AUTO model algorithm is a method of energizing the second stage gas valve based on the recent average of the heating duty cycle .during a typical heating day,the low to high stage delay is determined by using the average calculated duty cycle from the table below.

英语翻译
卡尔曼滤波是一个“optimal recursive data processing algorithm(最优化自回归数据处理算法)’,它是根据上一状态的估计值和当前状态的观测值推出当前状态的估计值的滤波方法,是一种递推的过程.
首先引入一个离散控制过程的系统.该系统可用一个线性随机微分方程（Linear Stochastic Difference equation）来描述：
X(k)=A X(k-1)+B(U(k)+W(k)) （10）
再加上系统的测量值：
Y(k)=C X(k)+V(k) （11）
其中：X(k)——k时刻的系统状态,
U(k)——k时刻对系统的控制量.
A和B——系统参数,对于多模型系统,他们为矩阵.
Y(k)——k时刻的测量值,
C——测量系统的参数,对于多测量系统,C为矩阵.
W(k)和V(k)——过程和测量的噪声.他们被假设成高斯白噪声(White Gaussian Noise),他们的协方差（covariance ）分别是Q,R.

高分求英文翻译,机器走开
The paper deals with the new algorithm of animation of 3D model of the human head in combination with its global motion. The designed algorithm is very fast and with low calculation requirements, because it does not need the synthesis of the input videosequence for estimation of the animation parameters as well as the parameters of global motion. The used 3D model Candide generates different expressions using its animation units which are controlled by the animation parameters. These ones are estimated on the basis of optical flow without the need of extracting of the feature points in the frames of the input videosequence because they are given by the selected vertices of the animation units of the calibrated 3D model Candide. The established multiple iterations inside the designed animation algorithm of 3D model of the human head between two successive frames significantly improved its accuracy above all for the large motion.

英语翻译
Design an algorithm that will read an array of 200 characters and display to the screen a count of the occurrences of each of the five vowels (a,e,i,o,u) in the array

英语翻译
3.PROPOSED ALGORITHM
The proposed dynamic evolutionary algorithm exploits evolutionary progress history to adapt the current population to the new environment.The algorithm introduces shifts in the decision space,the so-called relocations,which try to account for the estimated amount of change in the objective space.A complete description of the proposed algorithm is presented in detail next.represents the DOP we want to optimize; represents the -dimensional decision vector,and denotes the th-dimension decision variable.A nomenclature table is given in Appendix A for quick reference.For the discussion of this paper,the DOP is assumed to be a maximization problem.Note that a minimization problem can be converted into a maximization problem by multiplying with .denotes the child’s evolutionary progress in the th-dimension of the decision variable with respect to its parents.It is measured as the difference between the th-dimension decision variable of a child and that of the centroid of its parents.This can be mathematically expressed as (2) The evolutionary fitness progress,,of a child with respect to its parents is measured as the difference between the fitness,,of a child and the interpolated fitness of its parents.The interpolation is based on the distance between a child and its parents .The farther a parent is from its child,the lesser is its contribution to the interpolated fitness,as shown in (3a)–(4) at the bottom of the page.The average evolutionary progress in the th-dimension decision variable of a child can be obtained as the weighted sum of the child’s and the average evolutionary progress in the th-dimension decision variable of its parents.The same is true for the child’s average evolutionary fitness progress ,except that we use the interpolated value of its parents’ average fitness progress,as shown in (5) and (6) at the bottom of the next page,where denotes the total number of generations either from the start of an evolutionary process or the last occurrence of change,whichever was more recent,up to the current generation.On the other hand,represents the weight given to previous evolutionary progresses relative to the current one.Using ,the weighted average is equivalent to taking a simple average of all the individual progresses (total sum divided by number of generation).This means that the effect of all the previous and values starting from the recent occurrence of change is accumulated and does not diminish through time.

计算机算法的题
Develop an algorithm which takes as input a single 9-digit integer representing a Social Insurance Numbers (SIN) and determines whether or not it is valid.The algorithm should output if the SIN is valid or not.The rules determining the validity of a SIN are best described in an example.Consider the number 620187252 as a possible SIN number.Positions specified below are read from right to left and counting starts from 1.
1.Multiply every even positioned digit by 2.
(2x2=4,1x2=2,7x2=14,5x2=10)
2.For each result from step 1 add all the digits from each result together.
(4+2+1+4+1+0 = 12)
3.Add the last 4 odd positioned digits of the SIN together.
(6+0+8+2 = 16)
Page 4 of 4
4.Add the results of steps 2 and 3 together.
(12+16 = 28)
5.Subtract the units digit of the total from step 4 from 10,unless the units digit is 0,in which case use it.
(10-8 = 2)
6.A SIN is valid if the digit from step 5 is the same as the least significant digit in the SIN and the most significant digit matches a used region digit according to the following list:
0 not used
1 Atlantic Provinces
2 Quebec
3 not used
4 Ontario
5 not used
6 Prairie Provinces
7 British Columbia
8 not used
9 not used
(in the example,the SIN is a valid number which was issued in the Prairie Provinces)

英文翻译 急~~~在线等
One of the data mining algorithm decision trees are used in profiling as a predictive model that, as its name implies, can be viewed as a tree. Specifically each branch of the tree is a classification question and the leaves of the tree are partitions of the dataset with their classification (Berson et. al., 2000). From a business perspective decision trees can be viewed as creating a segmentation of the original dataset (each segment would be one of the leaves of the tree). Segmentation of customers, products, and sales regions is something that marketing managers have been doing for many years. In the past this segmentation has been performed in order to get a high level view of a large amount of data - with no particular reason for creating the segmentation except that the records within each segmentation was somewhat similar to each other. In this case the segmentation is done for a particular reason - namely for the prediction of some important piece of information. The records that fall within each segment fall there because they have similarity with respect to the information being predicted - not just that they are similar - without similarity being well defined. These predictive segments that are derived from the decision tree also come with a description of the characteristics that define the predictive segment. Thus the decision trees and the algorithms that create them may be complex; the results can be presented in an easy to understand way that can be quite useful to the business user. Decision tree algorithms were suitable for profiling because they are visual and easy-to-understand, easily interpretable, and they allow establishment of rules. With the series of rules obtained from decision trees would be possible to create profiles of firms and then classify firms in terms of levels of financial distress by using such profiles. For each profile the most important financial distress signals as an early warning, which affected the financial position.

英语翻译
Compound Phase-stepping Algorithm by Lissajous Figures Technique
and Iterative Least-squares Fitting

急需查询文章是否被EI检索.
Research and Improvement of the Algorithm to Extract Association Rules Based on Concept Lattice
Shi-min Zhang

谁能帮忙查下这篇文章的EI检索号：An Algorithm for medical imaging Identification Based on Edge Detec

英语翻译

The most popular exact inference algorithm is a variant of the Junction Treealgorithm,
called Eelief Propagation (BP) [53].In BP,we propagate a set of messages carrying the in-
teraction information through a tree modeluntil they achieve consistency.The marginals or
modes of the model distribution can becomputed from those messages.Two key compogents
in the BP algorithm are the way thatmessages are exchanged between neighboring nodes and the global protocol for the message propagation [41,89].
从第二段开始 图片为准,请参照图片,

英语翻译
Use Psendocodeto write an algorithm:Read a number N,then multiply all the numbers from 1 toN (for example :if N is 5 then add 1*2*3*4*5),Print out the final product.

请问一个英语改错问题?
Customer watermark embedding algorithm is based on DWT.Make four wavelet decompositions on the original image,and add appropriate strength watermark information to the low frequency wavelet coefficients of the fourth decomposition,so that we can obtain a solution containing a watermark image after IDWT.The watermark embedding formula is:
V'i = Vi + αWi （2）
Wherein,Vi is the original image information and V'i is the watermarked image information,Wi is the watermark information,α is the embedding strength.According to the inverse process of the embedding watermark,we can easily extract the watermark.This method is simple and practical,and robustness.The study of watermark embedding algorithm based on the wavelet domain has considerable depth,this article does not describe them in detail,the specific process steps refer to the literature [7].Customer watermark embedding process is shown in Figure 3.
请问上面一段话,请改正,

The basic notion of what’s an algorithm
能不能分析这个of后面的英语结构语法

请问这篇文章是否被ei收录?
名字《lmproved jpda algorithm with measurements adaptively ***ed》,

英语翻译
This learning algorithm maps the low dimensional datasets to the high dimensional feature space,and aims to solve a binary problem by searching an optimal hyperplane which can separate two datasets with the largest margin in the high dimensional space.
这种学习算法把低维数据集映射到高维特征空间,并且旨在通过搜索一个最优超平面来解决一个二进制（二元）问题,这个超平面能用高维空间最大间隔分开2个数据集.
As shown in Fig.2,the optimal hyper plane is defined by wx06x + b = 0,where x is the point lying in the hyperplane,w is the parameter for the orientation of hyperplane,and b is a scalar threshold which represents the bias from the margins
如图2（Fig2）所示,最优超平面由wx06x+ b = 0定义,其中x是超平面上的一个点,w是超平面取向（定位）参数,b是一个标量阈值,代表间隔偏差（边缘偏差）.

求这篇论文的中文译文：《An Efficient k-Means Clustering Algorithm:Analysis and Implementation》
如题,求《An Efficient k-Means Clustering Algorithm:Analysis and Implementation》的中文版论文,作者是
Tapas Kanungo,Nathan S.和Angela Y.Wu,

英语翻译
整句话是这样的：Before the data reconciliation algorithm was implemented in the distributed control system of the respective plant

一个句子可以用多个连词么
This scheduling algorithm always chooses the
users who have best channel conditions,so it guarantees the system throughput,
however fairness among users is very bad.

帮忙看下这篇文章是否被EI收录
new algorithm of encryption in non-cooperation IFF system,可以查到已被IEEE xplore出版并被INSPEC收录,可查不到是否被EI或是ISTP收录,
文章详细信息如下:
A new algorithm of encryption in non-cooperation IFF system
Ya Zhang Bo Li ShiZhong Li
Mech.& Electron.Eng.Inst.,North Univ.of China,Taiyuan;
This paper appears in:Wireless Communication and Sensor Networks,2008.WCSN 2008.Fourth International Conference on
Publication Date:27-29 Dec.2008
On page(s):129-130
Location:Allahabad,
ISBN:978-1-4244-3327-8
INSPEC Accession Number:10459330
Digital Object Identifier:10.1109/WCSN.2008.4772696
Current Version Published:2009-02-06
如果被EI收录,请告知收录号

数据结构多选题,求解
1、An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria:
A.Input/Output
B.Definiteness
C.Finiteness
D.Effectiveness

英语翻译
DNA computing based RNA genetic algorithm with applications in
parameter estimation of chemical engineering processes

帮忙查一下本文EI检索号?谢谢 New Discrete Particle Swarm Algorithm for Traveling Salesman Problem

求助一道计算机算法题目
Part D:(10 Marks)
D.1 Write an algorithm of a program that will generate figures of n lines like in the
example for n=4 that is shown below.The input n is obtained from the user.
______*
____* * *
__* * * * *
* * * * * * *
You can use the following commands:
 PrintStar– prints the ‘*’ character.
 PrintSpace – prints one space (‘ ’) at a time.
 GoToNextLine – allows you to go to the next time.
Your algorithm will need to have for loops,one nested into another.
Sample output:
Enter the number of rows:4
______*
____* * *
__* * * * *
* * * * * * *

英语翻译
As expected,the algorithm performs very well,as seen in the case of the LIN-maximizing algorithm perform- ing best for purely-relevance seeking users (and similarly for the MAX-maximizing algorithm and diversity-seeking users).However,an important result of the experiment is that even when the amount of diversity the user requires is unknown,the combination algorithm is able to learn the amount of diversity the user wants.It performs nearly as well as the case where the user’s diversity needs are known,as can be seen in the last row of the table.This shows that the combination algorithm is able to learn the trade- off between relevance and diversity that the user is looking for.This is very encouraging as it allows for the method to be used in scenarios where there is no a priori information about the desired amount of diversity.While related to re- cent work on extrinsic diversity [13],our method is an online learning technique and utilizes much weaker feedback than methods in [13] do.

帮忙查EI收录否：Algorithm of diffraction for standing tree based on the uniform geometrical theo

英语翻译
In this paper,an image-stabilization algorithm is presented that
is specifically oriented toward video-surveillance applications.
The proposed approach is based on a novel motion-
compensation method that is an adaptation of a well-known
image-stabilization algorithm for visualization purposes to
video-surveillance applications.In particular,the illustrated
methods take into account the specificity of typical video-
surveillance applications,where objects moving in a scene ofen
cover a large part of an image thus causing the failure of classic
image-stabilization techniques.In the second part of the paper,
evaluation methods for image stabilization algorithms are
discussed.