Please help me translate it with an expert in computer English, thank you

The operation of this expanded tracing event (reference number 00) in the first line. We.

There is a + character, so this is equivalent to an enqueue operating in the transfer queue. That one.

The second line (ref. 01) is the simulated time expression of seconds. As you may recall, we asked udpechoclientapplication to start sending packets in two seconds. Over here.

We see confirmation that this is indeed happening.

thenextlineoftheexampletrace （ reference02 ） telluswhichtracesourceoriginatedthis

The event (which represents the name in the trace). You can think of tracking down the namespace of a file, what kind of namespace you will have. The name of the root is nodelist.

This is equivalent to a nanosecond in container management-3 core**, which contains all.

node creates a script. Just as the file may have been in the root directory, we may have the number of nodes in the nodelist. The string nodelist 0, therefore, refers to.

In the zero node nodelist, we usually think of it as "node 0." At every node there is.

The listed devices are installed. The name that appears next to this list. You.

As you can see, this event trace comes from devicelist 0 which is zero device.

zerothpositionofthedevicelistfornodezero 。 recallthattheoperation + foundatreference

00 means that the enqueue action takes place on the device in the transmission queue. This one.

Reflected in the last section of the "trace road" this is txqueue enqueue.

The rest of the stitches should be fairly intuitive. Refer to the March 4 note.

The package is encapulated, a peer-to-peer protocol. References indicate, May 7.

The package has an IP version with 4 headers and comes from an IP address and more.

The destination is . The August 9 reference document indicates that this package has a UDP connector and eventually.

Reference 10 shows that the expected payload is 1024 bytes.

The next line of the trace file shows that the same packet was dequeued from being forwarded.

The queue is on the same node.

The tracking file in the third line shows that the package was received by the net device.

Nodes and Echo Servers. I've ** the event as follows.

Search for that kind of professional computer**.

prolog

Programming in the programming language (hereinafter referred to as "Prolog Logic") is a declaractive programming language with basic problem-solving algorithms that are based on repetitive determination. This language is known as the programming language of logic. The prolog in the program consists of a collection of preliminary reports, deductive reasoning on the evaluation of potential ranking algorithms.

All components from these reports are referred to as predicate constructions. A predicate consists of a predicate identifier.

Parental Bill, Mary).

It should be noted that in this predicate begins to argue with lowercase letters, even if they represent proper nouns. This is because the argument that prolog is constant, starting with a different point of view that it is mutable, and insists that constants and variables start with lowercase letters, starting with uppercase letters. (Here's the culture of the term prolog we use, where the term constant is used for more generic term denominations.)

More precisely, the term invoice (noteworthy loss.)

Faster (turtlesnails).

And in fact, a rabbit is faster than a turtle may represent a faster tortoise rabbit.

A prolog rule is a "means" statement. However, instead of writing the declaration x form y, the prolog programmer was chosen to write.

Is this the one from that database? Translate with translation software.

Keep in mind that the preamble system does not know the meaning of the predicate in the program, it is only symbolically manipulated to state in a way that perfectly follows the rules of reasoning of the resolution. Therefore, it is up to the programmer to describe the facts and rules of all the terms of the predicate related characteristics. In light of this, prolog facts are often used to determine a specific instance of a predicate, while rules are used to describe general principles.

It's about speaking before the predicate, and then the faster way. These two facts illustrate a particular instance of "fasterness", while the general rule describes the property. Note the fact that rabbits are faster than snails, although not specified, is the result of two facts combined with the rules.

In developing software using the Prolog language, the programmer's task is to develop facts and rules to describe the information that is known to collect. These facts and rules form the deductive system set up in the original report. Once this collection of statements is established, conjectures (called targets in prolog terms) may be raised by the system, usually through the keyboard of the computer.

When such a goal is submitted to the consequences of a preliminary statement. According to the descriptive statements we have collected, the relationship is faster for each goal.

Faster (turtle, snail).

Faster (rabbit, tortoise).

Faster (rabbit, snail).

It can also be so certain, because everyone is the logical result of speaking for the first time. The first two are the same facts in the initial statement, while the third needs to be deducted by the system with a certain degree of difficulty.

A more interesting example would be if we get that the target argument it provides is a variable rather than a constant. In this case, try to target the desired goal from the preamble from the initial report, while keeping the unifications track of doing so. Then, if the goal is to obtain a prolog, report these unifications.

For example, consider goals.

Faster (tile, snail).

In response to this situation, the report of the prolog.

Faster (turtle, snail).

In fact, this is a consequence of the first statement and is consistent with the goal of adopting unification.

Also, if we ask the prolog language to tell us a little more, it finds and reports the results.

Faster (rabbit, snail).

In contrast to this, we can ask for the prologue to find animal instances and propose a goal that is slower than that of rabbits.

Faster (rabbit, wide).

In fact, if we start with the goal.

Faster (v and w).

Prolog will eventually look for everything that can be done faster to export relationships from the initial report. This means that a single prolog program can be used to determine that a particular animal is faster than another, that finds those animals, that animals are slower than a given speed, that finds those animals, that animals are slower than a given speed, or that all relationships are found faster.

Remember, the prolog system doesn't know the meaning of the program predicate; It simply manipulates the content to solve the rules of reasoning in a completely symbolic way. It is therefore a predicate, fact, and rule of procedure to describe all relevant characteristic aspects. In this view, prolog data is often used to identify specific instances, and a predicate rule is used to describe general principles.

This is followed by a method that precedes the statement about "predicates faster." Two facts describe "fasterness" in specific cases, while rules describe property in general. Note the fact that :

The speed of a snail than a rabbit, although not explicit, is a consequence of the two facts combined with the rule.

When software development makes use of prolog's task is to develop a programmer with numerous facts and rules of information that are known. The initial report of these facts and rules is used to deduce the system. Once this is a collection of statements, established (known as the target speculative prolog term) can be presented to system-routinely a computer keyboard they need.

When this goal is presented to a preliminary report of the consequences. According to our set stated faster relationships, each group aims to be faster turtles and snails).

Faster (rabbits, turtles).

Fast (white rabbit, snail).

It could be that confirmation, because each one is a preliminary report of corollary consequences. The first two are identical to the initial statement of facts, while the third requires a certain degree of deductive system.

A more interesting example is to get us in the target variables, rather than their argument that they are constants. In these cases, Prolog wants to throw a brick on the goal from the initial report to track such a uniform requirement that this must be done. If the goal is to prolog reporting these unifications, it makes some sense.

For example, consider the goal.

Fast (w, snail).

In response to this, the prolog reports.

Faster turtles, snails).

In fact, it is a kind of preliminary report of the consequences and agree that the goal is adopted by unification.

In addition, if we ask prolog to tell us what it found and report the results.

Faster (rabbit, snial).

Instead, we can ask prolog to find instances of animals that are faster than a rabbit presenting a target.

Faster (rabbit, w).

In fact, if we start with the goal.

Faster (v, w).

Ultimately prolog pursues tireless efforts to also get a faster relationship from the initial report. This means that a prolog program can be used to confirm that a particular animal is faster than another, to find out that these animals are faster than a given animal, to find out that these animals are given faster than an animal or to discover all the relationships that are faster.

The upstairs is all machine-translated! If the landlord is not satisfied, you can send me a message, and I will do it for you when I have time. It's a little too long, and it's only 50 minutes.