Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Common LISP

Basic Functions. The fundamental symbolic operation which is used performs the permutations on lists of numbers. The Common Lisp supplied function ROTATEF is designed to do just this. An arbitrary number of arguments can be supplied to it, and it returns a list in which the first argument is at the end, and the others have been shifted one space to the left. An example of the application of this function, and the result displayed on the screen is,... [Pg.178]

Steele, G.L, Jr. "Common Lisp" Digital Press Burlington, MA, 1984. [Pg.187]

Programmers can access and update PGDB data directly by writing programs in the Java, Perl, and Common Lisp languages (13). [Pg.1036]

The Molecule-Designer is the software system constructed to implement the interactive and automatic procedures for the design of molecules discussed in Sections II and III. It consists of approximately 20,000 lines of LISP code with an additional 17,000-line databank. It is implemented in Common LISP on a LISP Machine, The system is divided into eight sections each corresponding to a section of the overall methodology. The... [Pg.304]

To find out whether your Scheme has the correct definition of atom , try (atom (quote ())) and make sure it returns f. In fact, the material is also suited for modern Lisps such as Common Lisp. To work with Lisp, you will also haw to add the function atom ... [Pg.202]

Moreover, you may need to modify the programs slightly. Typically, the material requires only a few changes. Suggestions about how to try the programs in the book are provided in the framenotes. framenotes preceded by S concern Scheme, those by L concern Common Lisp. [Pg.203]

Since LISP has been available in different variants, American National Standards Institute (ANSI) standardized a dialect of the LISP programming language in 1994 called Common Lisp (CL) [2]. Common Lisp is a language specification rather than an implementation. An example follows ... [Pg.40]

Steele, G.L., Common Lisp The Language, 2nd ed.. Digital Press, Bedford, MA, 1990. [Pg.58]

For the delivery environment, we continued to use KEE and Common Lisp as the software platform, but chose a conventional engineering workstation, Sun 3/60, as hardware. Sun 3/60 is powerful... [Pg.203]

SMP, just as Smax, associates with each object the list of its main characteristics value type, dimensions, initial value, transfer function, and whether or not it is memorizing. If the object is a vector, there may be different transfer functions associated to distinct slices of the vector. The general form of a transfer function is a set of conditional transfers, where all conditions must be mutually exclusive, and the union of all conditions is equal to 1 for non memorising objects. All the classical boolean functions are pre-defined in SMP, on scalars as well as vectors, and new functions are constructed by composition of existing ones, in standard prefix notation. SMP is coded as Common LISP property lists, and in this sense is more abstract than Blif-mv. [Pg.84]

Tanimoto, S.L. 1995. The Elements of Artificial Intelligence Using Common Lisp. Computer Science Press. Winston, P.H. 1992. Artificial Intelligence. Addison-Wesley, Reading, MA. [Pg.2087]

Table 2 shows the final result having total cost of 5,331,000. Combined running time of the Common Lisp coded UPPER-BOUND and AOC algorithms was 56 minutes on a SUN4. In this example, all the operators except one were in shared sets which implies that extensive stage jamming was in effect In this special case... [Pg.73]

The best results we have seen so far are those obtained by the Elf system which makes use of a simulated evolution approach. These results are considered near-optimal and were obtained after close to one thousand complete iterations of the evolution algorithm (one hour on a SUN 3/260, running Common Lisp). [Pg.277]

Software DNET/MS is written in common LISP, and it runs by loading the entire net in LISP working space. So, the necessary memory becomes very large il we have to treat a lot of molecules. An improvement of the system planned is to hold the net on a disk. [Pg.397]

Schottstaedt, B. (1994). Machine Tongues XVII CLM Music V meets Common Lisp, Computer Music Journal, 18, 2, 30-37. [Pg.248]

An object-oriented language that is connected to, or derived from, a procedural language base (C-f-1-, though a distinct language, was derived from C CLOS is an extension of Common LISP and incorporates all functions defined in this base language). [Pg.1948]

J. Lawless and M. Miller, Understanding CLOS The Common LISP Object System , Digital Press, Bedford, Massachusetts, 1991. [Pg.1960]

S. E. Keene, Object-oriented Programming in COMMON LISP , Addison-Wesley, New York, 1989. [Pg.1960]

The ASAM project developed a series of prototypes, beginning with SAM 0 in 1990 and ending with SAM 3.2 in October 1992. Macintosh computers with A3 screens were used, and implementation was done in Common Lisp and the Common Lisp Object System (CLOS) to maximise productivity. The prototyping approach was essentially incremental—each new prototype, generally speaking, had more functionality than its predecessor. Thus, SAM 0 was little more than a Toulmin form editor... [Pg.209]

The collision detection system is implemented on a Symbolics 3620 in Symbolics Common Lisp. Objects in the environment are modelled using spherelists [see 5]. The system provides the user with an OBJECT type for handling spherelists. The type contains current and next spherelists, a name used to identify the collection of spherelists, a mobility type ( mobile or fixed ), and a location of the center of the collection of spherelists to be used in the calculation of the approximate distance travelled by the spherelist over the last cycle. The next spherelist is used to hold the anticipated position of the OBJECT at the beginning of the next update cycle. In... [Pg.528]

The possibility of hosting the collision detection system on a VAX was explored. The Symbolics Common LISP version of the system was ported to VAX Common LISP and tested on a VAX 750. The average total cycle times were roughly comparable. The VAX-hosted system was not satisfactory, however, because of the stop-and-copy garbage collection used in VAX Common LISP. When dynamic memory is exhausted in VAX Common LISP, all processing is suspended until the copy operation to the free half of dynamic memory is completed. This suspension can last for several seconds. In a collision detection system, this sort of delay is simply not acceptable. [Pg.531]


See other pages where Common LISP is mentioned: [Pg.187]    [Pg.310]    [Pg.87]    [Pg.193]    [Pg.53]    [Pg.203]    [Pg.459]    [Pg.302]    [Pg.278]    [Pg.279]    [Pg.215]    [Pg.214]   
See also in sourсe #XX -- [ Pg.40 , Pg.53 ]




SEARCH



Lisp

© 2024 chempedia.info