一篇英文资料, 请各位帮我翻译一下, 谢了!~
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了一篇英文资料, 请各位帮我翻译一下, 谢了!~相关的知识,希望对你有一定的参考价值。
3.Control techniques
Today。the most advanced and practical control techniques are,based on open-loop approaches,designed to automate cranes and drive cranes along a pre-defined path.The most widely used of the open-loop control techniques are input shaping and optimal control techniques.
3.1 Input shaping techniques
Various forms of input shapers,convolved with reference commands,generate shaped input command,which drive cranes to move a set distance along a set path.The acceleration profile of the crane motion is designed to induce minimum payload pendulation during transpo rt,while the deceleration stage is designed to ensure freed om of residual oscillation near the end of the transport,and to deliver the payload at the target point.The techniques induce payload pendulation at least one half ofan oscillation cycle or integer multiples during each of the acceleration and deceleration stages.
Starr(1995)designed a symmetric two-step acceleration and deceleration profile to transfer a suspended object.The duration on the constant acceleration steps is assumed to be negligible relative to the period of the payload oscillation.A linear approximation method of the oscillation period is used to generate the two-step symmetric acceleration profile。
Parker et a1.(1 995)presented a quasi-static notch filter to control both the translation and rotation of a rotary tower crane。The frequency property of the notch filter varies with the variations of the cable length.Therefore,the filter can suppress the natural fequency components in reference commantis and efectively eliminate the residual
swing.Experimental results showed that the notch filter can reduce the transient payload oscillation throughout the maneuver,but the filter imposes time delays in the system and slows the response speed ofthe system。
谁能帮我翻译一下一份计算机专业的英文,谢谢
Prolog
The programming language Prolog (short for for PROgramming in LOGic) is a declaractive programming language whose underlying problem-solving algorithm is based on repeated resolution. Such languages are called logic programming languages. A program in Prolog consists of a collection of initial statements to which the underlying algorithm applies its deductive reasoning. The components from which these statements are constructed are called predicates. A predicate consists of a predicate identifier followed by a parenthetical statement listing the predicate's arguments. A single predicate represents a fact about its arguments, and its identifier is usually chosen to reflect this underlying semantics. Thus if we want to express the fact that Bill is Mary's parent, we can use the predicate form
parent (bill, mary)
Note that the arguments in this predicate start with lowercase letters, even though they represent proper nouns. This is because Prolog distinguishes arguments that are constants from arguments that are variable by insisting that constants begin with lowercase letters and variables begin with uppercase letters. (Here we have used the terminology of the prolog culture where the term constant is used in place of the more generic term literal. More precisely, the term bill (note the lowercase) is used in prolog to represent the literal that might be represented as "Bill" in a more generic notation. The term Bill (note the uppercase) is used in prolog to refer to a variable. )
Statements in a Prolog program are either facts or rules, each of which is terminated by a period. A fact consists of a single predicate. For example, the fact that a turtle is faster than a snail could be represented by the Prolog statement that a turtle is faster than a snail could be represented by the Prolog statement
faster (turtle. snail).
And the fact that a rabbit is faster than a turtle could be represented by
faster (rabbit,turtle).
A Prolog rule is an "implies" statement. However, instead of writing such a statement in the form X→Y, a Prolog programmer writes "Y if X," except that the symbol :- (a colon followed by a dash) is used in place of the word if. Thus the rule "X is old implies X is wise" might be expressed by a logician as
old (X) → wise (X)
But would be expressed in Prolog as
wise (X) :- old (X).
As another example, the rule
(faster (X, Y) AND faster (Y, Z) ) → faster (X, Z)
would be expressed in Prolog as
faster (X, Z) :- faster (X, Y), faster (Y, Z).
(The comma separating faster (X, Y) and faster (Y,Z) represents the conjunction AND. ) Although rules such as these are not in clause form, they are allowed in Prolog because they can be easily converted into clause form.
在编程语言编程》(以下简称《Prolog逻辑)是一种declaractive编程语言的基本解决问题的算法是基于重复的决心。这种语言被称为逻辑的编程语言。程序中Prolog由收藏的初步报告,对评估潜在的排名算法的演绎推理。所有元件都从这些报表被称为谓词构造。谓语由一个谓词标识符
家长的法案,玛丽)
需要注意的是,在这个谓语开始争论小写字母,即使他们代表专有名词。这是因为Prolog是常数的论点,从不同的观点是可变的,并坚持常数和变量小写字母开始,首先是大写的字母。(这里是我们所使用的术语prolog的文化,在术语常数使用的地方更通用术语面值。更准确的说,这个术语的发票(值得注意的是丧失
更加快速的(turtle.蜗牛)。
而事实上,一只兔子的速度比一只乌龟可能代表了
快乌龟兔子
一个Prolog规则是一个”意味着”声明。然而,取代的声明写X→形式Y,选择了Prolog程序员写 参考技术A 这个是那个数据库的那个吗?用翻译软件翻译吧
以上是关于一篇英文资料, 请各位帮我翻译一下, 谢了!~的主要内容,如果未能解决你的问题,请参考以下文章
急需以下内容翻译!各位高手帮帮忙啊!中文翻译成英文!不要机译!先谢了!