A natural language interface for computer aided design by T. Samad

By T. Samad

The appearance of machine aided layout and the proliferation of laptop aided layout instruments were instrumental in furthering the state-of-the­ artwork in built-in circuitry. carrying on with this growth, besides the fact that, calls for an emphasis on developing easy environments that facilitate the interplay among the dressmaker and the CAD device. the belief of this truth has triggered investigations into the appropriateness for CAD of a couple of user-interface applied sciences. One form of interface that has hitherto no longer been thought of is the typical language interface. it's our competition that traditional language interfaces may clear up a few of the difficulties posed by means of the expanding quantity and class of CAD instruments. This thesis represents step one in a study attempt directed in the direction of the eventual improvement of a normal language interface for the area of computing device aided layout. The breadth and complexity of the CAD area renders the duty of constructing a common language interface for the whole area past the scope of a unmarried doctoral thesis. accordingly, we have now initally focussed on a sub-domain of CAD. in particular, we've constructed a traditional language interface, named Cleopatra, for circuit-simulation post-processing. In different phrases, with Cleopatra a circuit-designer can extract and manage, in English, values from the output of a circuit-simulator (currently SPICE) with no manually having to move throughout the output documents produced via the simulator.

Show description

Read or Download A natural language interface for computer aided design PDF

Similar computers books

Compiler Construction

The complicated path happened from March four to fifteen, 1974 and was once organised by way of the Mathematical Institute of the Technical collage of Munich and the Leibniz Computing middle of the Bavarian Academy of Sciences, in co-operation with the eu groups, backed by means of the Ministry for examine and expertise of the Federal Republic of Germany and by way of the eu learn workplace, London.

Logical Foundations of Computer Science: Third International Symposium, LFCS '94 St. Petersburg, Russia, July 11–14, 1994 Proceedings

This quantity provides the refereed papers authorised for the overseas symposium Logical Foundations of desktop technology '94, good judgment at St. Petersburg, held in St. Petersburg, Russia in July 1994. The symposium was once the 3rd in a chain of joint efforts of logicians from either the previous Soviet Union and the West.

New Concepts for Parallel Object-Relational Query Processing

Over the past few years, parallel object-relational database administration structures have emerged because the major information administration know-how out there. those platforms are extensible via user-defined information kinds and user-defined performance for the knowledge. This paintings specializes in the effective parallel execution of user-defined performance.

Extra resources for A natural language interface for computer aided design

Sample text

21), if the initial probabilities lie between their respective limits? Should we restrict ourselves to cases, for which basic probability numbers exist, two further methods can be suggested. 23) shows an important favourable quality which the Dempster-Shafer rule lacks. 21) can be sufficient at all. As was pointed out earlier one should generally distinguish between the use of such rules in statistical inference and their use in diagnostic systems. The characteristic feature of the latter is the combination of pieces of evidence, each of which consists of an observation of one relevant attribute.

We denote for the combined probability distribution P(Ei): Sup~P(Ei) = Ui pes t I n f P(Ei) = Li. PES* These upper and lower limits can be calculated by means of an algorithm, which is described in the Appendix. 22). This will be demonstrated in the following example, which uses the values of the preceding example. 6944. 6667]. [] The result of these comparisons demonstrates that the Dempster-Shafer rule may be a great deal too optimistic. 21) is always possible if the application of the Dempster-Shafer rule is possible.

Ell. ,k. 21). " n~l(Bil) with B (11 being the symbol for concluding from the first source to subset Bil, from the second to Bi2 and so on. For Bil . . . Bit and for Bil N ... Cl Bil --= ¢ an analogous procedure to that used above is obvious. ,Bil are neither identical nor disjunct. Any combination rule for basic probability numbers re(B) affords a decision as how to make allowance for m(B~ l, ), if B~ l> is of this kind. NBil. This seems quite natural, as one would proceed in the same way if 46 experiments were described.

Download PDF sample

Rated 4.17 of 5 – based on 41 votes