Commit | Line | Data |
---|---|---|
21a765d3 ML |
1 | ..... use tbl and troff \-ms |
2 | .if \nP=0 .IM | |
3 | .TL | |
4 | Updating Publication Lists | |
5 | .AU | |
6 | M. E. Lesk | |
7 | .NH | |
8 | Introduction. | |
9 | .PP | |
10 | .\".if \nP>0 .pn 14 | |
11 | This note describes several commands to update the | |
12 | publication lists. | |
13 | The data base consisting of these lists is kept in | |
14 | a set of files in | |
15 | the directory | |
16 | .I /usr/dict/papers | |
17 | on the Version 7 | |
18 | .UX | |
19 | system. | |
20 | The reason for having special commands to update these files is | |
21 | that they are indexed, and the only reasonable way to find the | |
22 | items to be updated is to use the index. | |
23 | However, altering the files | |
24 | destroys the usefulness of the index, | |
25 | and makes further editing difficult. | |
26 | So the recommended procedure is to | |
27 | .IP (1) | |
28 | Prepare additions, deletions, and changes in separate files. | |
29 | .IP (2) | |
30 | Update the data base and reindex. | |
31 | .LP | |
32 | Whenever you make changes, etc. it is necessary to run | |
33 | the ``add & index'' step before logging off; otherwise the | |
34 | changes do not take effect. | |
35 | The next section shows the format of the files | |
36 | in the data base. | |
37 | After that, the procedures for | |
38 | preparing additions, preparing changes, preparing deletions, | |
39 | and updating the public data base are given. | |
40 | .NH | |
41 | Publication Format. | |
42 | .PP | |
43 | The format of a data base entry is given completely in ``Some Applications | |
44 | of Inverted Indexes on UNIX'' by M. E. Lesk, | |
45 | the first part of this report, | |
46 | .if \nP=0 (also TM 77-1274-17) | |
47 | and is summarized here via a few examples. | |
48 | In each example, first the output format for an item is shown, | |
49 | and then the corresponding data base entry. | |
50 | .LP | |
51 | .DS | |
52 | .ti 0 | |
53 | Journal article: | |
54 | .fi | |
55 | .ll 5i | |
56 | A. V. Aho, D. J. Hirschberg, and J. D. Ullman, ``Bounds | |
57 | on the Complexity of the Maximal Common Subsequence Problem,'' | |
58 | .I | |
59 | J. Assoc. Comp. Mach., | |
60 | .R | |
61 | vol. 23, no. 1, pp. 1-12 (Jan. 1976). | |
62 | .nf | |
63 | .ll | |
64 | .sp | |
65 | %T Bounds on the Complexity of the Maximal Common | |
66 | Subsequence Problem | |
67 | %A A. V. Aho | |
68 | %A D. S. Hirschberg | |
69 | %A J. D. Ullman | |
70 | %J J. Assoc. Comp. Mach. | |
71 | %V 23 | |
72 | %N 1 | |
73 | %P 1-12 | |
74 | %D Jan. 1976 | |
75 | .if \nP=0 %M TM 75-1271-7 | |
76 | .if \nP>0 %M Memo abcd... | |
77 | .DE | |
78 | .DS | |
79 | .ti 0 | |
80 | Conference proceedings: | |
81 | .fi | |
82 | .ll 5i | |
83 | B. Prabhala and R. Sethi, ``Efficient Computation of Expressions with Common | |
84 | Subexpressions,'' | |
85 | .I | |
86 | Proc. 5th ACM Symp. on Principles of Programming Languages, | |
87 | .R | |
88 | pp. 222-230, Tucson, Ariz. (January 1978). | |
89 | .nf | |
90 | .ll | |
91 | .sp | |
92 | %A B. Prabhala | |
93 | %A R. Sethi | |
94 | %T Efficient Computation of Expressions with | |
95 | Common Subexpressions | |
96 | %J Proc. 5th ACM Symp. on Principles | |
97 | of Programming Languages | |
98 | %C Tucson, Ariz. | |
99 | %D January 1978 | |
100 | %P 222-230 | |
101 | .DE | |
102 | .DS | |
103 | .ti 0 | |
104 | Book: | |
105 | .fi | |
106 | .ll 5i | |
107 | B. W. Kernighan and P. J. Plauger, | |
108 | .I | |
109 | Software Tools, | |
110 | .R | |
111 | Addison-Wesley, Reading, Mass. (1976). | |
112 | .nf | |
113 | .ll | |
114 | .sp | |
115 | %T Software Tools | |
116 | %A B. W. Kernighan | |
117 | %A P. J. Plauger | |
118 | %I Addison-Wesley | |
119 | %C Reading, Mass. | |
120 | %D 1976 | |
121 | .DE | |
122 | .DS | |
123 | .ti 0 | |
124 | Article within book: | |
125 | .fi | |
126 | .ll 5i | |
127 | J. W. de Bakker, ``Semantics of Programming Languages,'' | |
128 | pp. 173-227 in | |
129 | .I | |
130 | Advances in Information Systems Science, Vol. 2, | |
131 | .R | |
132 | ed. J. T. Tou, Plenum Press, New York, N. Y. (1969). | |
133 | .nf | |
134 | .ll | |
135 | .sp | |
136 | %A J. W. de Bakker | |
137 | %T Semantics of programming languages | |
138 | %E J. T. Tou | |
139 | %B Advances in Information Systems Science, Vol. 2 | |
140 | %I Plenum Press | |
141 | %C New York, N. Y. | |
142 | %D 1969 | |
143 | %P 173-227 | |
144 | .DE | |
145 | .DS | |
146 | .ti 0 | |
147 | Technical Report: | |
148 | .fi | |
149 | .ll 5i | |
150 | F. E. Allen, ``Bibliography on Program Optimization,'' | |
151 | Report RC-5767, IBM T. J. Watson Research Center, | |
152 | Yorktown Heights, N. Y. (1975). | |
153 | .nf | |
154 | .ll | |
155 | .sp | |
156 | %A F. E. Allen | |
157 | %D 1975 | |
158 | %T Bibliography on Program Optimization | |
159 | %R Report RC-5767 | |
160 | %I IBM T. J. Watson Research Center | |
161 | %C Yorktown Heights, N. Y. | |
162 | .DE | |
163 | .DS | |
164 | .di xx | |
165 | .ti 0 | |
166 | Technical Memorandum: | |
167 | .fi | |
168 | .ll 5i | |
169 | A. V. Aho, B. W. Kernighan and P. J. Weinberg, | |
170 | ``AWK \- Pattern Scanning and Processing Language'', | |
171 | TM 77-1271-5, TM 77-1273-12, TM 77-3444-1 (1977). | |
172 | .nf | |
173 | .ll | |
174 | .sp | |
175 | %T AWK \- Pattern Scanning and Processing Language | |
176 | %A A. V. Aho | |
177 | %A B. W. Kernighan | |
178 | %A P. J. Weinberger | |
179 | %M TM 77-1271-5, TM 77-1273-12, TM 77-3444-1 | |
180 | %D 1977 | |
181 | .di | |
182 | .if \nP=0 .xx | |
183 | .rm xx | |
184 | .DE | |
185 | .LP | |
186 | Other forms of publication can be entered similarly. | |
187 | Note that conference | |
188 | proceedings are entered as if journals, | |
189 | with the conference name on a | |
190 | .I %J | |
191 | line. | |
192 | This is also sometimes appropriate for obscure publications | |
193 | such as series of lecture notes. | |
194 | When something is both a report and an article, or | |
195 | both a memorandum and an article, enter all necessary information | |
196 | for both; see the first article above, for example. | |
197 | Extra information (such as ``In preparation'' or ``Japanese translation'') | |
198 | should be placed on a line beginning | |
199 | .I %O . | |
200 | The most common use of %O lines now is for ``Also in ...'' to give | |
201 | an additional reference to a secondary appearance of the same paper. | |
202 | .PP | |
203 | Some of the possible fields of a citation are: | |
204 | .TS | |
205 | c c 5 c c | |
206 | a l a l . | |
207 | Letter Meaning Letter Meaning | |
208 | A Author K Extra keys | |
209 | B Book including item N Issue number | |
210 | C City of publication O Other | |
211 | D Date P Page numbers | |
212 | E Editor of book R Report number | |
213 | I Publisher (issuer) T Title of item | |
214 | J Journal name V Volume number | |
215 | .TE | |
216 | Note that | |
217 | .I %B | |
218 | is used to indicate the title | |
219 | of a book containing the article being entered; | |
220 | when an item is an entire book, the title should | |
221 | be entered with a | |
222 | .I %T | |
223 | as usual. | |
224 | .PP | |
225 | Normally, the order of items does not matter. The only exception is | |
226 | that if there are multiple authors (%A lines) the order of authors | |
227 | should be that on the paper. | |
228 | If a line is too long, it may be continued on to the next line; | |
229 | any line not beginning with % or . (dot) is assumed to be | |
230 | a continuation of the previous line. | |
231 | Again, see the first article above for an example of a long title. | |
232 | Except for authors, do not repeat any items; if two %J lines are | |
233 | given, for example, the first is ignored. | |
234 | Multiple items on the same file should be separated by blank lines. | |
235 | .PP | |
236 | Note that in formatted printouts of the file, the | |
237 | exact appearance of the items is determined by | |
238 | a set of macros and the formatting programs. | |
239 | Do not try to adjust fonts, punctuation, etc. by editing | |
240 | the data base; it is wasted effort. In case someone has | |
241 | a real need for a differently-formatted output, a new set | |
242 | of macros can easily be generated to provide alternative | |
243 | appearances of the citations. | |
244 | .NH | |
245 | Updating and Re-indexing. | |
246 | .PP | |
247 | This section describes the commands that are used to manipulate | |
248 | and change the data base. | |
249 | It explains the procedures for (a) finding references in the data base, | |
250 | (b) adding new references, (c) changing existing references, and (d) | |
251 | deleting references. | |
252 | Remember that all changes, additions, and deletions are done by preparing | |
253 | separate files and then running an `update and reindex' step. | |
254 | .PP | |
255 | .I | |
256 | Checking what's there now. | |
257 | .R | |
258 | Often you will want to know what is currently in the data base. | |
259 | There is a special command | |
260 | .I lookbib | |
261 | to look for things and print them | |
262 | out. | |
263 | It searches for articles based on words in the title, or the author's name, | |
264 | or the date. | |
265 | For example, you could find the first paper above with | |
266 | .DS | |
267 | lookbib aho ullman maximal subsequence 1976 | |
268 | .DE | |
269 | or | |
270 | .DS | |
271 | lookbib aho ullman hirschberg | |
272 | .DE | |
273 | .LP | |
274 | If you don't give enough words, several items will be found; | |
275 | if you spell some wrong, nothing will be found. | |
276 | There are around 4300 papers in the public file; you should | |
277 | always use this command to check when you are not sure | |
278 | whether a certain paper is there or not. | |
279 | .PP | |
280 | .I | |
281 | Additions. | |
282 | .R | |
283 | To add new papers, just type in, on one or more files, the citations | |
284 | for the new papers. | |
285 | Remember to check first if the papers are already in the data base. | |
286 | For example, if a paper has a previous memo version, this should | |
287 | be treated as a change to an existing entry, rather than | |
288 | a new entry. | |
289 | If several new papers are being typed on the same file, be | |
290 | sure that there is a blank line between each two papers. | |
291 | .PP | |
292 | .I | |
293 | Changes. | |
294 | .R | |
295 | To change an item, it should be extracted onto a file. | |
296 | This is done with the command | |
297 | .DS | |
298 | pub.chg key1 key2 key3 ... | |
299 | .DE | |
300 | where the items key1, key2, key3, etc. are | |
301 | a set of keys that will find the paper, | |
302 | as in the | |
303 | .I lookbib | |
304 | command. | |
305 | That is, if | |
306 | .DS | |
307 | lookbib johnson yacc cstr | |
308 | .DE | |
309 | will find a item (to, in this case, Computing Science Technical Report | |
310 | No. 32, ``YACC: Yet Another Compiler-Compiler,'' | |
311 | by S. C. Johnson) | |
312 | then | |
313 | .DS | |
314 | pub.chg johnson yacc cstr | |
315 | .DE | |
316 | will permit you to edit the item. | |
317 | The | |
318 | .I pub.chg | |
319 | command | |
320 | extracts the item onto a file named ``bibxxx'' where ``xxx'' | |
321 | is a 3-digit number, e.g. ``bib234''. | |
322 | The command will print the file name it has chosen. | |
323 | If the set of keys finds more than one paper (or no papers) an | |
324 | error message is printed and no file is written. | |
325 | Each reference to be changed must be extracted with a separate | |
326 | .I pub.chg | |
327 | command, and each will be placed on a separate file. | |
328 | You should then edit the ``bibxxx'' file as desired to change the item, | |
329 | using the UNIX editor. | |
330 | Do not delete or change the first line of the file, however, which begins | |
331 | .I %# | |
332 | and is a special code line to tell the update program | |
333 | which item is being altered. | |
334 | You may delete or change other lines, or add lines, as you wish. | |
335 | The changes are not actually made in the public data | |
336 | base until you run the update command | |
337 | .I pub.run | |
338 | (see below). | |
339 | Thus, if after extracting an item and modifying it, you decide | |
340 | that you'd rather leave things as they were, delete the | |
341 | ``bibxxx'' file, and your change request will disappear. | |
342 | .PP | |
343 | .I | |
344 | Deletions. | |
345 | .R | |
346 | To delete an entry from the data base, | |
347 | type the command | |
348 | .DS | |
349 | pub.del key1 key2 key3 ... | |
350 | .DE | |
351 | where the items key1, key2, etc. are a set | |
352 | of keys that will find the paper, as with the | |
353 | .I lookbib | |
354 | command. | |
355 | That is, if | |
356 | .DS | |
357 | lookbib aho hirschberg ullman | |
358 | .DE | |
359 | will find a paper, | |
360 | .DS | |
361 | pub.del aho hirschberg ullman | |
362 | .DE | |
363 | deletes it. | |
364 | Upper and lower case are equivalent in keys; | |
365 | the command | |
366 | .DS | |
367 | pub.del Aho Hirschberg Ullman | |
368 | .DE | |
369 | is an equivalent | |
370 | .I pub.del | |
371 | command. | |
372 | The | |
373 | .I pub.del | |
374 | command will print the entry being deleted. | |
375 | It also gives the name of a ``bibxxx'' file on which the deletion | |
376 | command is stored. | |
377 | The actual deletion is not done until the changes, additions, etc. | |
378 | are processed, as with the | |
379 | .I pub.chg | |
380 | command. | |
381 | If, after seeing the item to be deleted, you change your | |
382 | mind about throwing it away, delete the ``bibxxx'' file | |
383 | and the delete request disappears. | |
384 | Again, if the list of keys does not uniquely identify one paper, | |
385 | an error message is given. | |
386 | .PP | |
387 | Remember that the default versions of the commands described here | |
388 | edit a public data base. | |
389 | Do not delete | |
390 | items unless you are sure deletion is proper; usually this | |
391 | means that there are duplicate entries for the same paper. | |
392 | Otherwise, view requests for deletion with skepticism; even | |
393 | if one person has no need for a particular item in the data base, | |
394 | someone else may want it there. | |
395 | .PP | |
396 | If an item is correct, but should not appear in the ``List of Publications'' | |
397 | as normally produced, add the line | |
398 | .DS | |
399 | %K DNL | |
400 | .DE | |
401 | to the item. | |
402 | This preserves the item intact, but implies ``Do Not List'' to the | |
403 | to the commands that print publication lists. | |
404 | The DNL line is normally used for some technical reports, | |
405 | minor memoranda, or other | |
406 | low-grade publications. | |
407 | .PP | |
408 | .I | |
409 | Update and reindex. | |
410 | .R | |
411 | When you have completed a session of changes, you should | |
412 | type the command | |
413 | .DS | |
414 | pub.run file1 file2 ... | |
415 | .DE | |
416 | where the names ``file1'', ... are the new files of additions you | |
417 | have prepared. | |
418 | You need not list the ``bibxxx'' files representing changes and | |
419 | deletions; they are processed automatically. | |
420 | All of the new items are edited into the standard | |
421 | public data base, and then a new index is made. This process | |
422 | takes about one minute of processor time. | |
423 | The index is not made by re-analyzing and re-sorting the | |
424 | entire data base; the new or changed items are indexed | |
425 | in the usual way and then merged with the previous data files. | |
426 | A complete re-index would be much slower for small changes. | |
427 | .PP | |
428 | Normally, you should execute | |
429 | .I pub.run | |
430 | just before you logoff after performing | |
431 | some edit requests. | |
432 | However, if you don't, the various change request files remain | |
433 | in your directory | |
434 | until you finally do execute | |
435 | .I pub.run. | |
436 | When the changes are processed, the ``bibxxx'' files are deleted. | |
437 | It is not desirable to wait too long before processing changes, | |
438 | however, to avoid conflicts with someone else who wishes to change | |
439 | the same file. | |
440 | If executing | |
441 | .I pub.run | |
442 | produces the message ``File bibxxx too old'' | |
443 | it means that someone else has been editing the same file | |
444 | between the time you prepared your changes, and the time you typed | |
445 | .I pub.run. | |
446 | You must delete such old change files and | |
447 | re-enter them. | |
448 | .PP | |
449 | Note that although | |
450 | .I pub.run | |
451 | discards the ``bibxxx'' files after | |
452 | processing them, your files of additions are left around | |
453 | even after | |
454 | .I pub.run | |
455 | is finished. | |
456 | If they were typed in only for purposes of | |
457 | updating the data base, you may delete them | |
458 | after they have been processed by | |
459 | .I pub.run. | |
460 | .PP | |
461 | .I | |
462 | Example. | |
463 | .R | |
464 | Suppose, for example, that you wish to | |
465 | .IP (1) | |
466 | Add to the data base the memos ``The Dilogarithm Function of a Real Argument'' | |
467 | by R. Morris, and | |
468 | ``UNIX Software Distribution by Communication Link,'' | |
469 | by M. E. Lesk and A. S. Cohen; | |
470 | .IP (2) | |
471 | Delete from the data base the item | |
472 | ``Cheap Typesetters'', by M. E. Lesk, | |
473 | SIGLASH Newsletter, 1973; | |
474 | and | |
475 | .IP (3) | |
476 | Change ``J. Assoc. Comp. Mach.'' to ``Jour. ACM'' in the citation | |
477 | for Aho, Hirschberg, and Ullman shown above. | |
478 | .LP | |
479 | The procedure would be as follows. | |
480 | First, you would make a file | |
481 | containing the additions, | |
482 | here called ``new.1'', in the normal way using the UNIX editor. | |
483 | In the script shown below, the computer prompts are | |
484 | .if n underlined. | |
485 | .if t in italics. | |
486 | .DS | |
487 | .if n _\b$ ed new.1 | |
488 | .if t \f2$\f1 ed new.1 | |
489 | .if n _\b? | |
490 | .if t \f2?\f1 | |
491 | a | |
492 | %T The Dilogarithm Function of a Real Argument | |
493 | %A Robert Morris | |
494 | .if \nP=0 %M TM 78-1271-1 | |
495 | .if \nP>0 %M abcd | |
496 | %D 1978 | |
497 | ||
498 | %T UNIX Software Distribution by Communication Link | |
499 | %A M. E. Lesk | |
500 | %A A. S. Cohen | |
501 | .if \nP=0 %M TM 78-1274-1, 78-8234-1 | |
502 | .if \nP>0 %M abcd | |
503 | %D 1978 | |
504 | . | |
505 | w new.1 | |
506 | .if n _\b1_\b9_\b9 | |
507 | .if t \f2199\f1 | |
508 | q | |
509 | .DE | |
510 | Next you would specify the deletion, which would be done with the | |
511 | .I pub.del | |
512 | command: | |
513 | .DS | |
514 | .if n _\b$ pub.del lesk cheap typesetters siglash | |
515 | .if t \f2$\f1 pub.del lesk cheap typesetters siglash | |
516 | .ti 0 | |
517 | to which the computer responds: | |
518 | ||
519 | .if n W\b_i\b_l\b_l\b_ d\b_e\b_l\b_e\b_t\b_e\b_:\b_ (\b_f\b_i\b_l\b_e\b_ b\b_i\b_b\b_1\b_7\b_6\b_)\b_ | |
520 | .if t \f2Will delete: (file bib176)\f1 | |
521 | ||
522 | .if n %\b_T\b_ C\b_h\b_e\b_a\b_p\b_ T\b_y\b_p\b_e\b_s\b_e\b_t\b_t\b_e\b_r\b_s\b_ | |
523 | .if t \f2%T Cheap Typesetters\f1 | |
524 | .if n %\b_A\b_ M\b_.\b_ E\b_.\b_ L\b_e\b_s\b_k\b_ | |
525 | .if t \f2%A M. E. Lesk\f1 | |
526 | .if n %\b_J\b_ A\b_C\b_M\b_ S\b_I\b_G\b_L\b_A\b_S\b_H\b_ N\b_e\b_w\b_s\b_l\b_e\b_t\b_t\b_e\b_r\b_ | |
527 | .if t \f2%J ACM SIGLASH Newsletter\f1 | |
528 | .if n %\b_V\b_ 6\b_ | |
529 | .if t \f2%V 6\f1 | |
530 | .if n %\b_N\b_ 4\b_ | |
531 | .if t \f2%N 4\f1 | |
532 | .if n %\b_P\b_ 1\b_4\b_-\b_1\b_6\b_ | |
533 | .if t \f2%P 14-16\f1 | |
534 | .if n %\b_D\b_ O\b_c\b_t\b_o\b_b\b_e\b_r\b_ 1\b_9\b_7\b_3\b_ | |
535 | .if t \f2%D October 1973\f1 | |
536 | .DE | |
537 | And then you would extract the Aho, Hirschberg and Ullman paper. | |
538 | The dialogue involved is shown below. | |
539 | First run | |
540 | .I pub.chg | |
541 | to extract the paper; it responds by printing | |
542 | the citation and informing you that it was placed on file \f2bib123\f1. | |
543 | That file is then edited. | |
544 | .DS | |
545 | .if n _\b$ pub.chg aho hirschberg ullman | |
546 | .if t \f2$\f1 pub.chg aho hirschberg ullman | |
547 | .if n _\bE_\bx_\bt_\br_\ba_\bc_\bt_\bi_\bn_\bg _\ba_\bs _\bf_\bi_\bl_\be _\bb_\bi_\bb_\b1_\b2_\b3 | |
548 | .if t \f2Extracting as file bib123\f1 | |
549 | .if n _\b%_\bT _\bB_\bo_\bu_\bn_\bd_\bs _\bo_\bn _\bt_\bh_\be _\bC_\bo_\bm_\bp_\bl_\be_\bx_\bi_\bt_\by _\bo_\bf _\bt_\bh_\be _\bM_\ba_\bx_\bi_\bm_\ba_\bl | |
550 | .if t \f2%T Bounds on the Complexity of the Maximal\f1 | |
551 | .if n _\bC_\bo_\bm_\bm_\bo_\bn _\bS_\bu_\bb_\bs_\be_\bq_\bu_\be_\bn_\bc_\be _\bP_\br_\bo_\bb_\bl_\be_\bm | |
552 | .if t \f2Common Subsequence Problem\f1 | |
553 | .if n _\b%_\bA _\bA_\b. _\bV_\b. _\bA_\bh_\bo | |
554 | .if t \f2%A A. V. Aho\f1 | |
555 | .if n _\b%_\bA _\bD_\b. _\bS_\b. _\bH_\bi_\br_\bs_\bc_\bh_\bb_\be_\br_\bg | |
556 | .if t \f2%A D. S. Hirschberg\f1 | |
557 | .if n _\b%_\bA _\bJ_\b. _\bD_\b. _\bU_\bl_\bl_\bm_\ba_\bn | |
558 | .if t \f2%A J. D. Ullman\f1 | |
559 | .if n _\b%_\bJ _\bJ_\b. _\bA_\bs_\bs_\bo_\bc_\b. _\bC_\bo_\bm_\bp_\b. _\bM_\ba_\bc_\bh_\b. | |
560 | .if t \f2%J J. Assoc. Comp. Mach.\f1 | |
561 | .if n _\b%_\bV _\b2_\b3 | |
562 | .if t \f2%V 23\f1 | |
563 | .if n _\b%_\bN _\b1 | |
564 | .if t \f2%N 1\f1 | |
565 | .if n _\b%_\bP _\b1_\b-_\b1_\b2 | |
566 | .if t \f2%P 1-12\f1 | |
567 | .if \nP=0 .if n _\b%_\bM _\bT_\bM _\b7_\b5_\b-_\b1_\b2_\b7_\b1_\b-_\b7 | |
568 | .if \nP>0 .if n %\b_M\b_ M\b_e\b_m\b_o\b_ n\b_u\b_m\b_b\b_e\b_r\b_ | |
569 | .if \nP=0 .if t \f2%M TM 75-1271-7\f1 | |
570 | .if \nP>0 .if t \f2%M abcd\f1 | |
571 | .if n _\b%_\bD _\bJ_\ba_\bn_\b. _\b1_\b9_\b7_\b6 | |
572 | .if t \f2%D Jan. 1976\f1 | |
573 | ||
574 | .if n _\b$ ed bib123 | |
575 | .if t \f2$\f1 ed bib123 | |
576 | .if n _\b3_\b1_\b2 | |
577 | .if t \f2312\f1 | |
578 | /Assoc/s/ J/ Jour/p | |
579 | .if n _\b%_\bJ _\bJ_\bo_\bu_\br_\b. _\bA_\bs_\bs_\bo_\bc_\b. _\bC_\bo_\bm_\bp_\b. _\bM_\ba_\bc_\bh_\b. | |
580 | .if t \f2%J Jour. Assoc. Comp. Mach.\f1 | |
581 | s/Assoc.*/ACM/p | |
582 | .if n _\b%_\bJ _\bJ_\bo_\bu_\br_\b. _\bA_\bC_\bM | |
583 | .if t \f2%J Jour. ACM\f1 | |
584 | 1,$p | |
585 | .if n _\b%_\b# _\b/_\bu_\bs_\br_\b/_\bd_\bi_\bc_\bt_\b/_\bp_\ba_\bp_\be_\br_\bs_\b/_\bp_\b7_\b6 _\b2_\b3_\b3 _\b2_\b4_\b5 _\bc_\bh_\ba_\bn_\bg_\be | |
586 | .if t \f2%# /usr/dict/papers/p76 233 245 change\f1 | |
587 | .if n _\b%_\bT _\bB_\bo_\bu_\bn_\bd_\bs _\bo_\bn _\bt_\bh_\be _\bC_\bo_\bm_\bp_\bl_\be_\bx_\bi_\bt_\by _\bo_\bf _\bt_\bh_\be _\bM_\ba_\bx_\bi_\bm_\ba_\bl | |
588 | .if t \f2%T Bounds on the Complexity of the Maximal\f1 | |
589 | .if n _\bC_\bo_\bm_\bm_\bo_\bn _\bS_\bu_\bb_\bs_\be_\bq_\bu_\be_\bn_\bc_\be _\bP_\br_\bo_\bb_\bl_\be_\bm | |
590 | .if t \f2Common Subsequence Problem\f1 | |
591 | .if n _\b%_\bA _\bA_\b. _\bV_\b. _\bA_\bh_\bo | |
592 | .if t \f2%A A. V. Aho\f1 | |
593 | .if n _\b%_\bA _\bD_\b. _\bS_\b. _\bH_\bi_\br_\bs_\bc_\bh_\bb_\be_\br_\bg | |
594 | .if t \f2%A D. S. Hirschberg\f1 | |
595 | .if n _\b%_\bA _\bJ_\b. _\bD_\b. _\bU_\bl_\bl_\bm_\ba_\bn | |
596 | .if t \f2%A J. D. Ullman\f1 | |
597 | .if n _\b%_\bJ _\bJ_\bo_\bu_\br_\b. _\bA_\bC_\bM | |
598 | .if t \f2%J Jour. ACM\f1 | |
599 | .if n _\b%_\bV _\b2_\b3 | |
600 | .if t \f2%V 23\f1 | |
601 | .if n _\b%_\bN _\b1 | |
602 | .if t \f2%N 1\f1 | |
603 | .if n _\b%_\bP _\b1_\b-_\b1_\b2 | |
604 | .if t \f2%P 1-12\f1 | |
605 | .if \nP=0 .if n _\b%_\bM _\bT_\bM _\b7_\b5_\b-_\b1_\b2_\b7_\b1_\b-_\b7 | |
606 | .if \nP>0 .if n _\b%_\bM _\bM_\be_\bm_\bo _\bn_\bu_\bm_\bb_\be_\br | |
607 | .if \nP=0 .if t \f2%M TM 75-1271-7\f1 | |
608 | .if \nP>0 .if t \f2%M abcd\f1 | |
609 | .if n _\b%_\bD _\bJ_\ba_\bn_\b. _\b1_\b9_\b7_\b6 | |
610 | .if t \f2%D Jan. 1976\f1 | |
611 | ||
612 | w | |
613 | .if n _\b2_\b9_\b2 | |
614 | .if t \f2292\f1 | |
615 | q | |
616 | .if n _\b$ | |
617 | .if t \f2$\f1 | |
618 | .DE | |
619 | Finally, execute | |
620 | .I pub.run , | |
621 | making sure to remember that you | |
622 | have prepared a new file ``new.1'': | |
623 | .DS | |
624 | \f2$\f1 pub.run new.1 | |
625 | .DE | |
626 | Currently, this takes about 1 minute of 11/70 processor time. | |
627 | .NH | |
628 | Printing a Publication List | |
629 | .PP | |
630 | There are two commands for printing a publication list, | |
631 | depending on whether you want to print one person's list, | |
632 | or the list of many people. | |
633 | To print a list for one person, use the | |
634 | .I pub.indiv | |
635 | command: | |
636 | .DS | |
637 | pub.indiv M Lesk | |
638 | .DE | |
639 | This runs off the list for M. Lesk and puts it in file ``output''. | |
640 | Note that no `.' is given after the initial. | |
641 | In case of ambiguity two initials can be used. | |
642 | Similarly, to get the list for group of people, say | |
643 | .DS | |
644 | pub.org xxx | |
645 | .DE | |
646 | which prints all the publications of the members of organization | |
647 | .I xxx , | |
648 | taking the names for the list in the file | |
649 | .I /usr/dict/papers/centlist/xxx . | |
650 | This command should normally be run in the background; it takes | |
651 | perhaps 15 minutes. | |
652 | Two options are available with these commands: | |
653 | .DS | |
654 | pub.indiv \-p M Lesk | |
655 | .DE | |
656 | prints only the papers, leaving out unpublished notes, patents, etc. | |
657 | Also | |
658 | .DS | |
659 | pub.indiv \-t M Lesk | gcat | |
660 | .DE | |
661 | prints a typeset copy, instead of a computer printer copy. | |
662 | In this case it has been directed to an alternate typesetter with the | |
663 | `gcat' command. | |
664 | These options may be used together, and may be used with the | |
665 | .I pub.org | |
666 | command as well. | |
667 | For example, to print | |
668 | only the papers for all of organization zzz and typeset them, | |
669 | you could type | |
670 | .DS | |
671 | pub.center \-t \-p zzz | gcat & | |
672 | .DE | |
673 | These publication lists are printed double column with a citation style | |
674 | taken from a set of publication list macros; the macros, of course, can be | |
675 | changed easily to adjust the format of the lists. |