Datasets:

---

anton-l

/

commoncrawl_tex

like 1

http://itex.coastal.cheswick.com/itex_server/latex/pg/40130/40130.tex

cheswick.com

CC-MAIN-2017-17

application/x-tex

crawl-data/CC-MAIN-2017-17/segments/1492917118477.15/warc/CC-MAIN-20170423031158-00181-ip-10-145-167-34.ec2.internal.warc.gz

\documentclass[12pt]{book} \usepackage{parskip} \usepackage[T1]{fontenc} \usepackage[latin1]{inputenc} %% \usepackage{mathptmx} % times roman %%\usepackage{lucidabr} % lucida bright \usepackage{pos} % generate iTeX page position data \usepackage[pdftex,bookmarks=true,bookmarksopen=true, bookmarksnumbered=true,bookmarksopenlevel=3, colorlinks,urlcolor=blue,linkcolor=blue, pdftitle={A Day with John Milton}, pdfauthor={May Byron}, citecolor=blue]{hyperref} \newcommand{\mdsh}[1]{\mbox{#1}\linebreak[1]} \newcommand{\nodate}{\date{}}\nodate \newcommand{\gutchapter}[1]{% \cleardoublepage \chapter{#1} \markboth{A Day with John Milton}{#1} } % \setcounter{chapter}{1} \begin{document} \pagenumbering{alph} % bogus, never shown, names don't collide with below \title{A Day with John Milton} \author{May Byron} \maketitle \pagenumbering{roman} \frontmatter The Project Gutenberg EBook of A Day with John Milton, by May Byron This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org/license Title: A Day with John Milton Author: May Byron Release Date: July 3, 2012 [EBook \#40130] Language: English Character set encoding: ASCII *** START OF THIS PROJECT GUTENBERG EBOOK A DAY WITH JOHN MILTON *** This text was converted to LaTeX by means of \textbf{GutenMark} software (version Jul 12 2014). The text has been further processed by software in the iTeX project, by Bill Cheswick. \cleardoublepage \tableofcontents \cleardoublepage \mainmatter \pagenumbering{arabic} \gutchapter{Produced by Juliet Sutherland, Steven Brown and the Online Distributed Proofreading Team at http://www.pgdp.net} [Illustration: Colour plate of book cover] [Illustration: Byron portrait plate] \textit{Paradise} \textit{lost}. \textit{Bk}. XII. \textit{Painting by S. Meteyard.} ``They, hand in hand, with wandering steps and slow, Through Eden took their solitary way.'' (\textit{Paradise Lost. Bk. XII.}) [Illustration: Paradise lost plate] A \textit{day} \textit{with} \textit{John} \textit{Milton} \textit{By} \textit{may} \textit{Byron} [Illustration: ``Angel'' plate] HODDER \& STOUGHTON \textit{In the same Series.} \begin{quotation} \textit{Tennyson.} \textit{Browning.} \textit{E. B. Browning.} \textit{Burns.} \textit{Byron.} \textit{Longfellow.} \textit{Whittier.} \textit{Rossetti.} \textit{Shelley.} \textit{Scott.} \textit{Coleridge.} \textit{Morris.} \textit{Wordsworth.} \textit{Whitman.} \textit{Keats.} \textit{Shakespeare.}\end{quotation} \gutchapter{A DAY WITH JOHN MILTON} About four o'clock on a September morning of 1665,---when the sun was not yet shining upon his windows facing the Artillery Fields, and the autumnal dew lay wet upon his garden leaves,---John Milton awoke with his customary punctuality, and, true to his austere and abstemious mode of life, wasted no time over comfortable indolence. He rose and proceeded to dress, with the help of his manservant Greene. For, although he was but fifty-four years in age, his hands were partly crippled with gout and chalkstones, and his eyes, clear, bright and blue as they had always been to outward seeming, were both stone-blind. Milton still retained much of that personal comeliness which had won him, at Cambridge, the nickname of ``Lady of Christ's College.'' His original red and white had now become a uniform pallor; his thick, light brown hair, parted at the top, and curling richly on his shoulders---(no close-cropt Roundhead this!)---was beginning to fade towards grey. But his features were noble and symmetrical; he was well-built and well-proportioned; and he was justified in priding himself upon a personal appearance which he had never neglected or despised. In his own words, he was ``neither large nor small: at no time had he been considered ugly; and in youth, with a sword by his side, he had never feared the bravest.'' Such was the man who now, neatly dressed in black, was led into his study, upon the same floor as his bedroom,---a small chamber hung with rusty green,---and there, seated in a large old elbow-chair, received the morning salutations of his three daughters. One after another they entered the room, and each bestowed a characteristic greeting upon her father. Anne, the eldest, a handsome girl of twenty, was lame, and had a slight impediment in her speech. She bade him good-morning with a stammering carelessness, enquired casually as to his night's rest, and stared out of window, palpably bored at the commencement of another monotonous, irksome day. Mary, the second, ---dark, impetuous, and impatient,---was in a state of smouldering rebellion. She addressed him in a tone of almost insolent mock-civility, ---he must needs have been deaf as well as blind not to detect the unfilial dislike beneath her words. Ten-year-old Deborah, the most affectionate of the three, ventured to kiss her father, even to stroke his long, beautiful hair, and to re-tie the tassels of his collar. ``Mary will read to me this morning,'' said Milton, gravely inclining his head in acknowledgment of Deborah's attentions. The dark girl, with a mutinous shrug of her shoulders, sat down and began to read aloud, in a hard, uninterested voice, out of the great leather-bound Hebrew Old Testament which lay upon the table. And not one single sentence did she understand---not one word of what she was reading. John Milton's theories of education, which he had expounded at length in pamphlets, were a curious blend of the practical and the ideal. Vastly in advance of his time in his demand for a practical training, he had evolved that ``fine definition which has never been improved upon,''---``I call a complete and generous education that which fits a man to perform, justly, skilfully and magnanimously, all the offices, both private and public, of peace and war.'' But he made no allowances for slowness or stupidity: all his schemes were based upon the existence of scholars equally gifted with himself. And he entirely left out of all calculations, much as a Mahommedan might, that complex organism the female mind. He wished it, one must conjecture, to remain a blank. So his daughters had received no systematic schooling, only some sort of home-instruction from a governess. And he had himself trained them to read aloud in five or six languages,---French, Italian, Latin, Greek, Hebrew and even Syriac,---in total ignorance of the meaning. ``One tongue,'' observed Milton brusquely, almost brutally, ``is enough for any woman.'' Mary read on, steadily, stolidly, sullenly, for a full hour. The others had left the room and were busy upon household tasks. At the conclusion of two chapters, ``Leave me,'' commanded Milton, ``I would be alone now for contemplation,''---and Mary willingly escaped to breakfast. The great poet reclined in his chair,---wrapt in such solemn and melancholy meditation as might have served as the model for his own \textit{Penseroso}. A severe composure suffused his fine features, a serious sadness looked out of his unclouded eyes; his entire expression was ``that of English intrepidity mixed with unutterable sorrow.'' For Milton was a bitterly disappointed man. It was not merely his comparative poverty,---because the Restoration, besides depriving him of his post as Latin or Foreign Secretary to the Commonwealth Council of State, had reduced his means from various sources almost to vanishing point. Nor was his melancholy mainly the result of his affliction; that he had deliberately incurred, and was as deliberately enduring. Constant headaches, late study, and perpetual recourse to one nostrum after another, had eventuated in the certainty of total blindness if he persisted in his mode of work. \begin{quotation} ``The choice lay before me between dereliction of a supreme duty and loss of eyesight; ... and I therefore concluded to employ the little remaining eyesight I was to enjoy in doing this, the greatest service to the common weal it was in my power to render.''\end{quotation} No: it was not a personal matter which could sadden John Milton to the very roots of his stern, ambitious, courageous soul. It was the contravention of all that he held most dear in life,---the frustration, as he conceived it, of that liberty which was his very heart's blood by the Restoration of the Stuart monarchy. He had resolved, in his own words, to transfer into the struggle for liberty ``all my genius and all the strength of my industry.'' It appeared that he had flung away both in vain. The Stuart monarchy, to him, lay monstrously black, overshadowing all the land, like his own conception of Satan. The Restoration was not merely the political defeat of his party, it was the total defeat of the principles, of the religious and social ideals, with which Milton's life was bound up. He had always stood aloof from the other salient men of the time. Of Cromwell he had practically no personal knowledge: with the bulk of the Presbyterians he was openly at enmity. ``Shut away behind a barrier of his own ideas,'' he did not care to associate with men of less lofty intellectual standing. But now he was even more isolated. Since the downfall of the Puritan regime, he of necessity ``stood alone, and became the party himself.'' And he presented, in his \textit{Samson Agonistes}, ``the intensest utterance of the most intense of English poets---the agonised cry of the beaten party,'' condensed into the expression of one unflinching and heroic soul. Upon the mysterious and inscrutable decrees of Providence, which had laid in the dust what seemed to him the very cause of God, Milton sat and pondered, in a despondency so profound, a disappointment so poignant, that his own great lines had sought in vain to voice it: \begin{quotation} ``... I feel my genial spirits droop, My hopes all flat: Nature within me seems In all her functions weary of herself; My race of glory run, and race of shame, And I shall shortly be with them that rest.''\end{quotation} (\textit{Samson Agonistes}). Yet his indomitable spirit was by no means quenched in despair: and an outlet was now open to him at last, which for eighteen years he had foregone,---the outlet of poetic expression. He was conscious of his capacity to travel and to traverse the regions which none had dared explore save Dante. And with that tremendous chief of pioneers he was measuring himself, man to man. He was able, above the turmoil of faction and the tumult of conflicting troubles, to weigh \begin{quotation} ``... his spread wings, at leisure to behold Far off the empyreal Heaven, extended wide In circuit, undetermined square or round, With opal towers and battlements adorned Of living sapphire, once his native seat.''\end{quotation} (\textit{Paradise Lost}). That Milton had been silent for so long a period was due, firstly to his preoccupation with political and polemical questions, into which he had thrown the whole weight of his mind; and, secondly, to the effect of his own firm resolve that the great epic, which, he had always secretly intended, should be the outcome of matured and ripened powers: the apotheosis of all that was worthiest in him: the full fruit of his strenuous life. He had long since arrived at that conclusion, never surpassed in its terseness and truth, that true poetry must be ``simple, sensuous, impassioned,''---words which might serve as the text and touchstone of art. ``And long it was not after'' when he ``was confirmed in this opinion, that he who would not be frustrate of his hope to write well hereafter in laudable things, ought himself to be a true poem.'' For poetry, to John Milton, was no sounding brass or tinkling cymbal; in his hand ``the thing became a trumpet,'' apt to seraphic usages and the rallying of celestial cohorts. Therefore, when he ceased to touch the ``tender stops of various quills'' that trembled into silence in \textit{Lycidas}, it was not as one discomfited of his attainment. Rather it was as one convinced of a mighty purpose, and patiently awaiting the just time of its fulfilment. The ``woodnotes wild'' of \textit{Comus}, the exquisitely stippled \textit{genre} painting of \textit{Allegro} and \textit{Penseroso}, were mere childish attempts compared with that monumental work to which Milton firmly proposed to devote the fruition of his genius. And now, having become a man through mental and physical experience even more than through the passage of years, he had put away childish things. He had resolved at last upon, and had at last undertaken, the one subject most congenial to his taste, and most suitable to his style and diction. \textit{Paradise Lost} was the triumphant offspring of his brain. It had sprung, like light, from chaos. Out of the darkness of poverty, blindness and defeat arose the poem which was to set him on the pinnacles of Parnassus. ``You make many enquiries as to what I am about'' he wrote in bygone years to his old schoolfellow, Charles Diodati. ``What am I thinking of? Why with God's help, of immortality! Forgive the word, I only whisper it in your ear. Yes, I am pluming my wings for a flight.'' Nor was this the idle boasting of an egotist, the empty imagination of a dreamer. Consumed by ``the desire of honour and repute and universal fame, seated,'' as he put it, ``in the breast of every true scholar,'' Milton sedulously and assiduously had prepared himself for the achievement of his aims. That he should ``strictly meditate the thankless Muse'' required a certain self-control. ``To scorn delights and live laborious days'' is not the customary delight of a handsome young scholar, expert in swordsmanship as in languages. To equip himself for his self-chosen task, still a misty, undefined prospect in the remotest future, required strenuous and disciplined study; and necessitated his forgoing too frequently the scenes of rustic happiness which he had pictured so charmingly in \textit{L'Allegro},---absenting himself from ``The groves and ruins, and the beloved village elms ... where I too, among rural scenes and remote forests, seemed as if I could have grown and vegetated through a hidden eternity.'' And this, though Milton had neither the eye nor the ear of a born nature-lover, was in itself a sufficient deprivation and sacrifice. For beauty appealed to him with a most earnest insistence,---and the purer, the more abstract form it took, the more urgent was that appeal. ``God has instilled into me, at all events,'' he declared, ``a vehement love of the beautiful. Not with so much labour is Ceres said to have sought Proserpine, as I am wont, day and night, to search for the idea of the beautiful through all forms and faces of things, and to follow it leading me on with certain assured traces.'' Yet not alone among ``forms and faces'' was he predestined to discover that Absolute Beauty. The passionate love of music, so frequently characteristic of a great linguist, which led him into sound-worlds as well as sight-worlds, was fated to remain with him, an incalculable consolation, when ``forms and faces'' could be no more seen. And into the vocabulary of \textit{Paradise Lost}, that incomparably rich vocabulary, with its infallible ear for rhythm, for phrase, for magnificent consonantal effects and the magic of great names that reverberate through open vowels,---into this he poured forth his whole sense of beautiful sound, ``as the wakeful bird Sings darkling, and in shadiest covert hid, Tunes her nocturnal note.'' \textit{Paradise Lost} remains, as has been observed, ``The elaborated outcome of all the best words of all antecedent poetry---the language of one who lives in the companionship of the great and the wise of all past time, equally magnificent in verbiage, whether describing man, or God, or the Arch-Enemy visiting'' this pendent world, when Thither, full fraught with mischievous revenge, Accursed, and in a cursed hour, he lives. At seven o'clock the body-servant Greene re-entered, followed by Mrs. Milton, the poet's third wife, and by Mary Fisher, their maid-servant, bringing in his breakfast, a light, slight repast. Mrs. Milton, \textit{nee} Elizabeth Minshull, of Nantwich, was a comely, active, capable woman, ``of a peaceful and agreeable humour,'' so far at least as her husband was concerned: for she shared the traditional destiny of a stepmother in not ``hitting it off'' with the first wife's daughters. Her golden hair and calm commonsense were in striking contrast, alike with the dark beauty and petulant spirit of Mary Powell, and with the fragile sweetness of Catherine Woodcock, Milton's former spouses. If she did not in her heart confirm her husband's celebrated theory of the relative position of man and wife,---``He for God only, she for God in him,''---(which, it has been said, ``condenses every fallacy about woman's true relation to her husband and to her Maker"), she managed very adroitly to convey an impression of entire acquiescence in the will of her lord. And at least she was entirely adequate as a housewife. Had Milton ever encountered that ``not impossible She'' whom he portrayed in his ideal Eve? or was this latter a mere visionary abstract of great qualities, ``to show us how divine a thing a woman may be made''? Neither of his three wives, nor yet that ``very handsome and witty gentlewoman,'' Miss Davis, to whom he had at one time paid his addresses, conformed to this description: one cannot even conjecture that it was a \textit{pasticcio} of their respective fine attributes. Mrs. Milton, third of that name, as she bustled and busied herself about the study, was by no means a new Eve. She regarded her husband's ambitions and achievements with that good natured tolerance so characteristic of the materially-minded. Only genius can appreciate genius; and the man who shut himself away from his \textit{confreres} in scholarship and literature was not likely to unbosom himself to his housewifely, provincial wife. COMUS. \textit{Painting by S. Meteyard.} Sabrina rises attended by water nymphs, ``By the rushy-fringed bank, Where grows the willow and the osier dank,'' (\textit{Comus}). [Illustration: Comus colour plate] The manservant Greene, breakfast being concluded, read aloud, or wrote to his master's dictation for some hours. This had formerly been the girls' daily office, but they were revolting more and more,---the whole position was becoming untenable, for they resented the presence of their stepmother as much as they disliked the duties which fettered them to their father's side, and forced them to parrot-like, futile drudgery in unknown tongues. To-day, however, Greene was relieved of the task, for which he was manifestly but ill-fitted, by the entrance of Milton's two favourite visitors. No celebrity ever had fewer friends. From all who might have called themselves such, he was separated by hostility of party, rancour of sect or by that almost repellent isolation of character to which reference has already been made. When at the highest of his political fame, he had almost boasted himself of this ``splendid isolation,''---``I have very little acquaintance with those in power, inasmuch as I keep very much to my own house, and prefer to do so.'' At heart a Republican beyond the conception of any Roundhead,---cherishing a form of religion so recondite that it could be classed under no heading, since he ignored both public worship and family prayer,---having given offence to all and sundry by his outspoken theories upon divorce and divine right,---Milton presented to most men a dangerous personality. And most of all now, when the wits of the Restoration roues could be sharpened upon him, and when the heathen, as he considered them, roistered and ruffled it through the city that had ``returned to her wallowing in the mire.'' Yet those who had sat at his feet as pupils, retained a singular affection for their former master. For all such young folk as adopted the disciple's attitude, the stern self-contained man had a very soft spot in his heart. With such, he was not only instructive, but genial, almost cheerful; and they alone could move him to the only utterances which were neither ``solemn, serious or sad.'' Chief among his former pupils were those who now made entrance---Henry Lawrence and Cyriac Skinner. It may be guessed, therefore, with what pleasure the blind poet received these loyal and affectionate men. His pensive face became transformed with interest and animation, as with gentle courtesy and unfeigned delight he turned his sightless eyes from one speaker to another. Upon every subject he had a ready flow of easy, colloquial conversation, seasoned with shrewd satire: his deep and musical voice ran up and down the whole gamut of worthy topics. Sometimes he fell into the stately, almost stilted diction of his great prose pamphlets,---sometimes he spoke in racy English vernacular,---sometimes, warming to his subject, he assumed an almost fiery eloquence. But when, at twelve o'clock, he was escorted downstairs to dinner in the parlour, the metamorphosis was complete. This was no longer the brooding introspective man of the early morning, but one ``extreme pleasant in his conversation,'' almost merry in society so congenial,---the life of the party: abstinent, but not ascetic, having a healthy, human enjoyment of the dishes set before him. ``These are the victuals most to my liking,'' he observed as he ate, ``being seasonable and withal of no great cost. For that which is of great rarity or richness, and must be procured with care or toil, hath no temptation for me.'' ``I do always my best, Mr. Milton,'' replied his wife, ``that you shall be well satisfied: and methinks to-day I have hit your taste right fairly.'' ``God ha' mercy, Betty,'' said Milton, regarding her with an air of kindly tolerance, ``I see thou wilt perform according to thy promise in providing me such dishes as I think fit while I live; and when I die, thou knowest I have left thee all.'' Here Anne, Mary and Deborah sat up very straight, and directed looks of fury and astonishment towards their stepmother. ``Talk not o' dying, in God's name, man,'' responded the embarrassed Betty, ``we have enough to do to make shift to live, nowadays,'' and she hastily pressed her good but simple fare, homely Cheshire dishes well-prepared, upon the two guests. ``Such a many learned foreign folk have visited our poor house these latter days,---time hath failed me for my cheese-cakes,---and of the havercakes I made two days agone, why, not a crumb is left. But eat, my masters, eat and drink. Though these be but country victuals, none of your Court kickshaws, I warrant you they are fresh and savoury. I would commend you, now, to this rabbit pie---'' ``Peace, Betty, peace. The woman prates o' pies like a pie (magpie) herself. What saith the Apostle? \textit{I suffer not a woman to speak} in presence of the man's authority. Ha' done, good Betty, with thy harping on kitchen matters,---let thy savoury messes be companioned with a sauce of silence.'' Temporary eclipse of Mrs. Milton: obvious and malevolent satisfaction of Anne and Mary: desperately suppressed inclination to giggle on the part of little Deborah: and a desire to cover up the situation with talk, as regards kindly Lawrence and courtly Skinner. The ``foreign folk'' were no new thing. Milton's fame, indeed, was European: as a prose-writer and pamphleteer, be it understood, not as a poet. Had he not refuted and put to shame the most erudite scholars of the day? Foreign \textit{savants} of note, therefore, who might be visiting London, were desirous to acquaint themselves with so powerful a personality: and the little house in the Artillery Walk was the rendezvous for many distinguished persons. They found their host no such recluse as town-talk might have led them to imagine, but one ready and willing to converse with them,---an English gentleman to the backbone, a scholar and artist to the finger-tips. His Continental tours and Italian sojourns had made him less insular than most of his compatriots, and his vast range of reading had imparted a certain cosmopolitanism to his exceedingly individual lines of thought. The visitors found him, moreover, employed upon a work so important, and of a theme so lofty, as might well give them pause, considering the circumstances under which it was being accomplished: and whatever their particular religious tenets might be, they could not fail to admire the magnitude of his aim in composing \textit{Paradise Lost},---``To justify the ways of God to men.'' PARADISE LOST. BK. II \textit{Painting by S. Meteyard.} ``Satan with less toil, and now with ease, ... Weighs his spread wings, at leisure to behold ... This pendent world in bigness as a star Of smallest magnitude.'' (\textit{Paradise Lost. Bk. II.}) [Illustration: Satan in paradise colour plate] Dinner despatched, the master of the house, led by his devoted friends, went out into the garden. A garden was the desideratum of his existence, and he had never been without one; for in seventeenth-century London every house was fitly furnished in this respect. Here Milton was in the habit of taking that steady exercise which was a \textit{sine qua non} to a sedentary and gouty man. He made a point of walking up and down out of doors, in cold weather, for three or four hours at a time,---sometimes composing his majestic lines, sometimes merely meditating. When weary with walking, he would come in and either dictate what he had conceived, or would take further exercise in a swing. In really warm weather, he received his visitors sitting outside his house door, wrapped in a coarse grey overcoat---gazing out upon the fields of the Artillery ground with those ``unblemished eyes'' that belied their own clear beauty---``the only point,'' as he said, ``in which I am against my will a hypocrite.'' To-day, being cool and cloudy, allowed but intermittent periods in the open air. Milton, Lawrence and Skinner paced slowly to and fro, deep in enthralling intercourse, until three o'clock: when the rain and Thomas Elwood arrived simultaneously, and the other two men departed to their respective avocations. Thomas Elwood was a young Quaker of twenty-three, who was acting in some degree as honorary secretary to Milton. Himself of a defective education, and having been expelled from his father's house on account of his religious opinions, he was only too glad to take a lodging in the neighbourhood, and, by reading aloud to Milton every afternoon, acquire an amount of information and a variety of learning, which by no other means could he have obtained. And there was also a tacit sympathy between them, insomuch as Milton was, more and more, as life went on, inclining towards the Quaker tenets,---in those days, \textit{bien entendu}, viewed with horror and detestation by the majority of men. Having re-entered the house, ``We will not read as yet, Tom,'' Milton said, ``I desire greatly to comfort myself with sweet sounds. Bring me into the withdrawing-room, and place me at the organ. A little bellows-blowing will not hurt thee, Tom. And let my wife attend me, that we may have song withal. She hath a good voice, though a poor ear.'' Seated at his beloved instrument, the blind man steeped himself in the principal pleasure that was left him. Milton's father, stout Puritan though he might be, was an accomplished musician, and had taught his son to play in early youth. The austerities of a narrow dogma had not been able to crush out the inveterate artistry of either father or son: and now the devotee of ``divinest Melancholy'' was able to solace himself with such lovely concords, such ``anthems clear,'' ``As may with sweetness, through mine ear, Dissolve me into ecstasies, And bring all heaven before mine eyes.'' Sometimes he sang as he played; sometimes Mrs. Milton, with her clear unemotional notes, sang to his accompaniment. Presently, that Elwood should not be wearied in his blowing, he quitted the organ for the bass-viol, on which he was no mean performer. At the conclusion of his playing he sat with a rapt, transfigured face, such as might well have called forth the Italian's encomium, thirty years before,---``If thy piety were equal to thy understanding, figure, eloquence, beauty and manners, verily thou wouldest not be an Angle but an Angel!'' ``And, now, good Tom,'' quoth Milton to the young man, ``let us to work: the day moves on apace.'' They went upstairs to the study. ``Before we read, I have some forty lines to set down,'' continued the poet, ``all day they have been knocking for admission, and with that last music they made entrance. Needs must I house them now in ink and paper.'' ``I am instant at thy bidding, friend,'' and Elwood seated himself with dutiful alacrity at the table. Milton, placing himself obliquely athwart his elbow-chair, with one leg thrown across the arm, dictated forty lines, almost in a breath,---they burst from him, as it would seem, in a stream no longer to be restrained. ``Gently, gently, good sir!'' exclaimed Elwood, ``slow-witted and slow fingered I may be,---but I cannot keep pace with thee!'' A grim smile hovered over Milton's full lips, ``Out of practice, Tom,'' he replied indulgently, ``it is a long while since I required this service at thy hands. From the autumnal to the vernal equinox, as I have told thee, my muse lies dumb, and silent as the moon, When she deserts the night, Hid in her vacant interlunar cave. But now the winter is overpast, the singing of birds is heard in our land, and she too awakes and sings. With the vernal equinox my thoughts flow free as Helicon.'' Then, with slow and deliberate diction, he repeated the lines once more: and, having had them read aloud to him, he compressed, condensed, concentrated every thought and phrase, and reduced them to twenty. ``There is more to come?'' queried Elwood, his quill poised ready to write. ``No more. Not one word more at present,'' replied Milton, sighing as though somewhat exhausted. His inspiration was entirely intermittent: and sometimes he would lie awake all night, trying, but without success, to complete one single line to his liking. ``They please me not wholly, these lines,'' he continued, ``much remains to be done before I set them down to be changed no more.'' ``Not every man would say so,'' replied Elwood, ``the learning and erudition whereof these few lines alone give witness, would supply many with just cause for boasting throughout a lifetime.'' Milton shook his head. ``Pomp and ostentation of reading,'' he remarked, ``is admired among the vulgar: but in matters of religion, he is learnedest who is plainest.'' IL PENSEROSO. \textit{Painting by S. Meteyard.} \begin{quotation} ``And may at last my weary age Find out the peaceful hermitage, The hairy gown and mossy cell, Where I may sit and rightly spell Of every star that heaven doth show.''\end{quotation} (\textit{Il Penseroso.}) [Illustration: Il Penseroso colour plate] ``Yet, Mr. Milton, thee hast the reputation of such scope and range of wisdom, as the greatest scholar in Europe might fitly envy. To me, I confess, in my poor unlettered ignorance, it is not conceivable in what manner thee acquired so great and witty powers.'' ``I gathered them not of mine own strength,'' said Milton, ``but they were mine for the asking and endeavour, and any man may obtain them in like fashion. I ceased not, nor will cease, in devout prayer to the Holy Spirit, that can enrich with all utterance and knowledge, and send out his Seraphim with the hallowed fire of His altar, to touch and purify the lips of whom He pleases. To this must be added select reading, and steady observation, and insight into all seemly and generous acts and affairs.... And now, good Tom, to reading.'' Elwood took up the Latin author which he was at present engaged upon, and proceeded with it. Whenever the preternaturally acute ear of Milton detected, by Elwood's intonation, that he did not quite understand a sentence, he would stop him, examine him, and elucidate the difficult passage. By and by, ``You will find a saying very similar to that,'' he observed, ``in Virgil his Fourth Eclogue. Fetch down the book, and let us hear what the Mantuan hath written therein.'' Elwood searched along the bookshelves, but to no avail. ``Friend,'' said he, ``thy Virgil is no longer here. Yesterday I handled it myself,---to-day it is vanished. So is the Lucretius.'' A frown contracted Milton's splendid brow. ``These women-kind,'' he muttered like rumbling thunder, ``they are verily the root of all evil. Bid me hither my wife and daughters, and Mary Fisher the maid moreover.'' The first and the last, being summoned, arrived in all haste, and disavowed any knowledge of the missing books. Anne and Mary Milton, it appeared, were gone out marketing: but little Deborah, being strictly cross-examined, confessed that she had seen sister Anne carrying books away from the study last night when their father had retired: the wherewithal for ``marketing'' was easily obtained in this way. Milton groaned in his ineptitude. ``How have I deserved this treacherous dealing at their hands? Lord, how long shall I be \begin{quotation} dark in light exposed To daily fraud, contempt, abuse, and wrong, Within doors and without, still as a fool In power of others, never in my own?\end{quotation} (\textit{Samson Agonistes}). Here, by a happy coincidence, there was a sturdy hammering heard at the front door, and Andrew Marvell was ushered in, ``I am out of my due time,'' said he, ``for it is not yet gone six,''---(six to eight P.M. being Milton's best time for receiving visitors). ``Yet to so old an offender as myself, John, I know thou wilt make an exception.'' Marvell was the one friend of his own type and standing, the one constant and inalienable comrade, upon whose fidelity the blind man could rely. He had formerly been Milton's colleague under the Cromwellian Government: and was his kindred spirit, so far as anyone could claim such relationship with the frozen heights of the poet's intellect. With him, during the next two hours---the learned physician Paget joining them, and Elwood listening in respectful silence to the converse of these mighty men---Milton forgot the vexations of his ill-assorted household. He assured his friends that he was truly far happier now, in poverty, infirmity and neglect, occupied solely upon his long-projected masterpiece, than during the eighteen years of his manly prime, when his mind and pen were solely employed upon the controversies which he now professed to hate. ``Never again,'' he declared, ``shall earthly ambitions interrupt and thwart me: never now shall I endure to leave a calm and pleasing solitariness, fed with cheerful and confident thoughts, to embark in a tumbled sea of noises and hoarse disputes. Cast out of my fool's Paradise of fame not worth the finding, shall, not I and the hope whereunto I am wedded explore some fair and fragrant tract of outer Eden? Even as I have set forth the banishment of our first parents: \begin{quotation} Some natural tears they dropped, but wiped them soon; The world was all before them, where to choose Their place of rest, and Providence their guide. They, hand in hand, with wandering steps and slow, Through Eden took their solitary way.\end{quotation} (\textit{Paradise Lost}). I and my espoused hope indeed do tread through Eden.'' The four men now, at eight o'clock, went down to supper: a very spare and frugal meal, so far as Milton was concerned: for all he consumed was a little light wine, a piece of bread and a few olives. His flow of speech was still unwearied, his spirits as near vivacity as they could approach it, when his friends rose to take leave. ``The night is yet young,'' said Paget, ``but I know that nowadays you seek rest early.'' ``That is so,'' Milton assented, ``since I am no longer able to study o' nights, and since the best of secretaries,''---he smiled towards Elwood---``must needs grow weary of a blind man's whims, I were as well in bed as out of it. Moreover, I can compose my lines to better advantage lying down.'' ``One thing, at least, you are spared,'' Marvell told him, ``darkness cannot discommode your doings, nor doth the eye-weariness of the midnight student afflict you with grievous brow-aches in the morning as of old.'' Milton answered, ``My darkness hitherto, by the singular kindness of God, amid rest and studies, and the voices and greetings of friends, has been much easier to bear than that deathly one. What should prevent me from resting in the belief that eyesight lies not in eyes alone, but enough for all purposes in God's leading and providence? And to you now I bid farewell, with a mind not less brave and steadfast than if I were Lynceus himself for keenness of sight.'' In a short space of time he was at rest in his darkened room; not as yet drowsy, but revolving great phrases, and deriving a greater joy from these lonely silences of the night-watches than could ever accrue to him by day. Gradually the aisles and bowers of the Paradise which his mental eyes enjoyed took upon them more and more the lovely similitude of rural England. The greennesses and sweetnesses of his childhood's home, the Buckinghamshire village, were fused into the ``eternal spring'' of the primeval garden. And from the ``glassy, cool, translucent wave'' of the river that ran through Eden, ``by the rushy-fringed bank Where grows the willow and the osier dank,'' arose ``Sabrina, attended by water-nymphs'' as once he saw her rise in \textit{Comus}, and sang the sightless bard to sleep with the plashing of water-music. [Illustration: ``Rose''] \textit{Printed by Percy Lund, Humphries \& Co., Ltd.} \textit{Bradford and London.} \textit{10322} ==================== Transcriber's Notes: Some illustration's captions have been moved out of the paragraph. The following captions have been added: Illustration: Colour plate of book cover; Illustration: Byron portrait plate; Illustration: Paradise lost plate; Illustration: ``Angel'' plate; Illustration: Comus colour plate; Illustration: Satan in paradise colour plate; Illustration: Il Penseroso colour plate; Illustration: ``Rose''. The following noted Illustration was removed: Dropped Cap ``A'' at start of text --- ``About ...'' Spelling has been made consistent throughout. \gutchapter{End of the Project Gutenberg EBook of A Day with John Milton, by May Byron} *** END OF THIS PROJECT GUTENBERG EBOOK A DAY WITH JOHN MILTON *** ***** This file should be named 40130.txt or 40130.zip ***** This and all associated files of various formats will be found in: http://www.gutenberg.org/4/0/1/3/40130/ Produced by Juliet Sutherland, Steven Brown and the Online Distributed Proofreading Team at http://www.pgdp.net Updated editions will replace the previous one---the old editions will be renamed. Creating the works from public domain print editions means that no one owns a United States copyright in these works, so the Foundation (and you!) can copy and distribute it in the United States without permission and without paying copyright royalties. Special rules, set forth in the General Terms of Use part of this license, apply to copying and distributing Project Gutenberg-tm electronic works to protect the PROJECT GUTENBERG-tm concept and trademark. Project Gutenberg is a registered trademark, and may not be used if you charge for the eBooks, unless you receive specific permission. If you do not charge anything for copies of this eBook, complying with the rules is very easy. You may use this eBook for nearly any purpose such as creation of derivative works, reports, performances and research. They may be modified and printed and given away---you may do practically ANYTHING with public domain eBooks. Redistribution is subject to the trademark license, especially commercial redistribution. *** START: FULL LICENSE *** THE FULL PROJECT GUTENBERG LICENSE PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK To protect the Project Gutenberg-tm mission of promoting the free distribution of electronic works, by using or distributing this work (or any other work associated in any way with the phrase ``Project Gutenberg"), you agree to comply with all the terms of the Full Project Gutenberg-tm License (available with this file or online at http://gutenberg.org/license). \gutchapter{Section 1. General Terms of Use and Redistributing Project Gutenberg-tm electronic works} 1.A. By reading or using any part of this Project Gutenberg-tm electronic work, you indicate that you have read, understand, agree to and accept all the terms of this license and intellectual property (trademark/copyright) agreement. If you do not agree to abide by all the terms of this agreement, you must cease using and return or destroy all copies of Project Gutenberg-tm electronic works in your possession. If you paid a fee for obtaining a copy of or access to a Project Gutenberg-tm electronic work and you do not agree to be bound by the terms of this agreement, you may obtain a refund from the person or entity to whom you paid the fee as set forth in paragraph 1.E.8. 1.B. ``Project Gutenberg'' is a registered trademark. It may only be used on or associated in any way with an electronic work by people who agree to be bound by the terms of this agreement. There are a few things that you can do with most Project Gutenberg-tm electronic works even without complying with the full terms of this agreement. See paragraph 1.C below. There are a lot of things you can do with Project Gutenberg-tm electronic works if you follow the terms of this agreement and help preserve free future access to Project Gutenberg-tm electronic works. See paragraph 1.E below. 1.C. The Project Gutenberg Literary Archive Foundation ("the Foundation'' or PGLAF), owns a compilation copyright in the collection of Project Gutenberg-tm electronic works. Nearly all the individual works in the collection are in the public domain in the United States. If an individual work is in the public domain in the United States and you are located in the United States, we do not claim a right to prevent you from copying, distributing, performing, displaying or creating derivative works based on the work as long as all references to Project Gutenberg are removed. Of course, we hope that you will support the Project Gutenberg-tm mission of promoting free access to electronic works by freely sharing Project Gutenberg-tm works in compliance with the terms of this agreement for keeping the Project Gutenberg-tm name associated with the work. You can easily comply with the terms of this agreement by keeping this work in the same format with its attached full Project Gutenberg-tm License when you share it without charge with others. 1.D. The copyright laws of the place where you are located also govern what you can do with this work. Copyright laws in most countries are in a constant state of change. If you are outside the United States, check the laws of your country in addition to the terms of this agreement before downloading, copying, displaying, performing, distributing or creating derivative works based on this work or any other Project Gutenberg-tm work. The Foundation makes no representations concerning the copyright status of any work in any country outside the United States. 1.E. Unless you have removed all references to Project Gutenberg: 1.E.1. The following sentence, with active links to, or other immediate access to, the full Project Gutenberg-tm License must appear prominently whenever any copy of a Project Gutenberg-tm work (any work on which the phrase ``Project Gutenberg'' appears, or with which the phrase ``Project Gutenberg'' is associated) is accessed, displayed, performed, viewed, copied or distributed: This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org/license 1.E.2. If an individual Project Gutenberg-tm electronic work is derived from the public domain (does not contain a notice indicating that it is posted with permission of the copyright holder), the work can be copied and distributed to anyone in the United States without paying any fees or charges. If you are redistributing or providing access to a work with the phrase ``Project Gutenberg'' associated with or appearing on the work, you must comply either with the requirements of paragraphs 1.E.1 through 1.E.7 or obtain permission for the use of the work and the Project Gutenberg-tm trademark as set forth in paragraphs 1.E.8 or 1.E.9. 1.E.3. If an individual Project Gutenberg-tm electronic work is posted with the permission of the copyright holder, your use and distribution must comply with both paragraphs 1.E.1 through 1.E.7 and any additional terms imposed by the copyright holder. Additional terms will be linked to the Project Gutenberg-tm License for all works posted with the permission of the copyright holder found at the beginning of this work. 1.E.4. Do not unlink or detach or remove the full Project Gutenberg-tm License terms from this work, or any files containing a part of this work or any other work associated with Project Gutenberg-tm. 1.E.5. Do not copy, display, perform, distribute or redistribute this electronic work, or any part of this electronic work, without prominently displaying the sentence set forth in paragraph 1.E.1 with active links or immediate access to the full terms of the Project Gutenberg-tm License. 1.E.6. You may convert to and distribute this work in any binary, compressed, marked up, nonproprietary or proprietary form, including any word processing or hypertext form. However, if you provide access to or distribute copies of a Project Gutenberg-tm work in a format other than ``Plain Vanilla ASCII'' or other format used in the official version posted on the official Project Gutenberg-tm web site (www.gutenberg.org), you must, at no additional cost, fee or expense to the user, provide a copy, a means of exporting a copy, or a means of obtaining a copy upon request, of the work in its original ``Plain Vanilla ASCII'' or other form. Any alternate format must include the full Project Gutenberg-tm License as specified in paragraph 1.E.1. 1.E.7. Do not charge a fee for access to, viewing, displaying, performing, copying or distributing any Project Gutenberg-tm works unless you comply with paragraph 1.E.8 or 1.E.9. 1.E.8. You may charge a reasonable fee for copies of or providing access to or distributing Project Gutenberg-tm electronic works provided that - You pay a royalty fee of 20\%% of the gross profits you derive from the use of Project Gutenberg-tm works calculated using the method you already use to calculate your applicable taxes. The fee is owed to the owner of the Project Gutenberg-tm trademark, but he has agreed to donate royalties under this paragraph to the Project Gutenberg Literary Archive Foundation. Royalty payments must be paid within 60 days following each date on which you prepare (or are legally required to prepare) your periodic tax returns. Royalty payments should be clearly marked as such and sent to the Project Gutenberg Literary Archive Foundation at the address specified in Section 4, ``Information about donations to the Project Gutenberg Literary Archive Foundation.'' - You provide a full refund of any money paid by a user who notifies you in writing (or by e-mail) within 30 days of receipt that s/he does not agree to the terms of the full Project Gutenberg-tm License. You must require such a user to return or destroy all copies of the works possessed in a physical medium and discontinue all use of and all access to other copies of Project Gutenberg-tm works. - You provide, in accordance with paragraph 1.F.3, a full refund of any money paid for a work or a replacement copy, if a defect in the electronic work is discovered and reported to you within 90 days of receipt of the work. - You comply with all other terms of this agreement for free distribution of Project Gutenberg-tm works. 1.E.9. If you wish to charge a fee or distribute a Project Gutenberg-tm electronic work or group of works on different terms than are set forth in this agreement, you must obtain permission in writing from both the Project Gutenberg Literary Archive Foundation and Michael Hart, the owner of the Project Gutenberg-tm trademark. Contact the Foundation as set forth in Section 3 below. 1.F. 1.F.1. Project Gutenberg volunteers and employees expend considerable effort to identify, do copyright research on, transcribe and proofread public domain works in creating the Project Gutenberg-tm collection. Despite these efforts, Project Gutenberg-tm electronic works, and the medium on which they may be stored, may contain ``Defects,'' such as, but not limited to, incomplete, inaccurate or corrupt data, transcription errors, a copyright or other intellectual property infringement, a defective or damaged disk or other medium, a computer virus, or computer codes that damage or cannot be read by your equipment. 1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES --- Except for the ``Right of Replacement or Refund'' described in paragraph 1.F.3, the Project Gutenberg Literary Archive Foundation, the owner of the Project Gutenberg-tm trademark, and any other party distributing a Project Gutenberg-tm electronic work under this agreement, disclaim all liability to you for damages, costs and expenses, including legal fees. YOU AGREE THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE FOUNDATION, THE TRADEMARK OWNER, AND ANY DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL, PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF THE POSSIBILITY OF SUCH DAMAGE. 1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND --- If you discover a defect in this electronic work within 90 days of receiving it, you can receive a refund of the money (if any) you paid for it by sending a written explanation to the person you received the work from. If you received the work on a physical medium, you must return the medium with your written explanation. The person or entity that provided you with the defective work may elect to provide a replacement copy in lieu of a refund. If you received the work electronically, the person or entity providing it to you may choose to give you a second opportunity to receive the work electronically in lieu of a refund. If the second copy is also defective, you may demand a refund in writing without further opportunities to fix the problem. 1.F.4. Except for the limited right of replacement or refund set forth in paragraph 1.F.3, this work is provided to you `AS-IS' WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF MERCHANTIBILITY OR FITNESS FOR ANY PURPOSE. 1.F.5. Some states do not allow disclaimers of certain implied warranties or the exclusion or limitation of certain types of damages. If any disclaimer or limitation set forth in this agreement violates the law of the state applicable to this agreement, the agreement shall be interpreted to make the maximum disclaimer or limitation permitted by the applicable state law. The invalidity or unenforceability of any provision of this agreement shall not void the remaining provisions. 1.F.6. INDEMNITY --- You agree to indemnify and hold the Foundation, the trademark owner, any agent or employee of the Foundation, anyone providing copies of Project Gutenberg-tm electronic works in accordance with this agreement, and any volunteers associated with the production, promotion and distribution of Project Gutenberg-tm electronic works, harmless from all liability, costs and expenses, including legal fees, that arise directly or indirectly from any of the following which you do or cause to occur: (a) distribution of this or any Project Gutenberg-tm work, (b) alteration, modification, or additions or deletions to any Project Gutenberg-tm work, and (c) any Defect you cause. \gutchapter{Section 2. Information about the Mission of Project Gutenberg-tm} Project Gutenberg-tm is synonymous with the free distribution of electronic works in formats readable by the widest variety of computers including obsolete, old, middle-aged and new computers. It exists because of the efforts of hundreds of volunteers and donations from people in all walks of life. Volunteers and financial support to provide volunteers with the assistance they need, are critical to reaching Project Gutenberg-tm's goals and ensuring that the Project Gutenberg-tm collection will remain freely available for generations to come. In 2001, the Project Gutenberg Literary Archive Foundation was created to provide a secure and permanent future for Project Gutenberg-tm and future generations. To learn more about the Project Gutenberg Literary Archive Foundation and how your efforts and donations can help, see Sections 3 and 4 and the Foundation web page at http://www.pglaf.org. \gutchapter{Section 3. Information about the Project Gutenberg Literary Archive Foundation} The Project Gutenberg Literary Archive Foundation is a non profit 501(c)(3) educational corporation organized under the laws of the state of Mississippi and granted tax exempt status by the Internal Revenue Service. The Foundation's EIN or federal tax identification number is 64-6221541. Its 501(c)(3) letter is posted at http://pglaf.org/fundraising. Contributions to the Project Gutenberg Literary Archive Foundation are tax deductible to the full extent permitted by U.S. federal laws and your state's laws. The Foundation's principal office is located at 4557 Melan Dr. S. Fairbanks, AK, 99712., but its volunteers and employees are scattered throughout numerous locations. Its business office is located at 809 North 1500 West, Salt Lake City, UT 84116, (801) 596-1887, email business@pglaf.org. Email contact links and up to date contact information can be found at the Foundation's web site and official page at http://pglaf.org For additional contact information: Dr. Gregory B. Newby Chief Executive and Director gbnewby@pglaf.org \gutchapter{Section 4. Information about Donations to the Project Gutenberg Literary Archive Foundation} Project Gutenberg-tm depends upon and cannot survive without wide spread public support and donations to carry out its mission of increasing the number of public domain and licensed works that can be freely distributed in machine readable form accessible by the widest array of equipment including outdated equipment. Many small donations (\$1 to \$5,000) are particularly important to maintaining tax exempt status with the IRS. The Foundation is committed to complying with the laws regulating charities and charitable donations in all 50 states of the United States. Compliance requirements are not uniform and it takes a considerable effort, much paperwork and many fees to meet and keep up with these requirements. We do not solicit donations in locations where we have not received written confirmation of compliance. To SEND DONATIONS or determine the status of compliance for any particular state visit http://pglaf.org While we cannot and do not solicit contributions from states where we have not met the solicitation requirements, we know of no prohibition against accepting unsolicited donations from donors in such states who approach us with offers to donate. International donations are gratefully accepted, but we cannot make any statements concerning tax treatment of donations received from outside the United States. U.S. laws alone swamp our small staff. Please check the Project Gutenberg Web pages for current donation methods and addresses. Donations are accepted in a number of other ways including checks, online payments and credit card donations. To donate, please visit: http://pglaf.org/donate Section 5. General Information About Project Gutenberg-tm electronic works. Professor Michael S. Hart is the originator of the Project Gutenberg-tm concept of a library of electronic works that could be freely shared with anyone. For thirty years, he produced and distributed Project Gutenberg-tm eBooks with only a loose network of volunteer support. Project Gutenberg-tm eBooks are often created from several printed editions, all of which are confirmed as Public Domain in the U.S. unless a copyright notice is included. Thus, we do not necessarily keep eBooks in compliance with any particular paper edition. Most people start at our Web site which has the main PG search facility: http://www.gutenberg.org This Web site includes information about Project Gutenberg-tm, including how to make donations to the Project Gutenberg Literary Archive Foundation, how to help produce our new eBooks, and how to subscribe to our email newsletter to hear about new eBooks. \end{document}

http://www.ipm.ac.ir/papers/pdf/abs7988.tex

ipm.ac.ir

CC-MAIN-2021-49

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-49/segments/1637964360803.6/warc/CC-MAIN-20211201143545-20211201173545-00210.warc.gz

\documentclass[12pt]{article} \usepackage{amsmath,amssymb,amsfonts} \begin{document} Considering a piezo-plasma-like medium with hexagonal symmetry whose main symmetry axis is parallel to the $z$-axis and approximating it by an isotropic medium, the coupling of the elastic waves with plasma preoperties of the medium is studied. In this case, the coupled surface quasi-elasto-electromagnetic wave propagating on the interface of a piezoelectric with vacuum, making use of the mirror reflection model, is investigated. It is shown that the piezo-effect can result in the plasma damping of the elastic oscillations. \end{document}

http://www.conferences.hu/mtns2010/sample_new.tex

conferences.hu

CC-MAIN-2019-04

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2019-04/segments/1547584336901.97/warc/CC-MAIN-20190123172047-20190123194047-00231.warc.gz

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %2345678901234567890123456789012345678901234567890123456789012345678901234567890 % 1 2 3 4 5 6 7 8 \documentclass[letterpaper, 10pt, conference]{ieeeconf} \IEEEoverridecommandlockouts % This command is only % needed if you want to % use the \thanks command \overrideIEEEmargins % See the \addtolength command later in the file to balance the column lengths % on the last page of the document % The following packages can be found on http:\\www.ctan.org %\usepackage{graphics} % for pdf, bitmapped graphics files %\usepackage{epsfig} % for postscript graphics files %\usepackage{mathptmx} % assumes new font selection scheme installed %\usepackage{times} % assumes new font selection scheme installed %\usepackage{amsmath} % assumes amsmath package installed %\usepackage{amssymb} % assumes amsmath package installed \title{\LARGE \bf Preparation of Papers for IEEE Sponsored Conferences \& Symposia } %\author{ \parbox{3 in}{\centering Huibert Kwakernaak* % \thanks{*Use the $\backslash$thanks command to put information here}\\ % Faculty of Electrical Engineering, Mathematics and Computer Science\\ % University of Twente\\ % 7500 AE Enschede, The Netherlands\\ % {\tt\small h.kwakernaak@autsubmit.com}} % \hspace*{ 0.5 in} % \parbox{3 in}{ \centering Pradeep Misra** % \thanks{**The footnote marks may be inserted manually}\\ % Department of Electrical Engineering \\ % Wright State University\\ % Dayton, OH 45435, USA\\ % {\tt\small pmisra@cs.wright.edu}} %} \author{Huibert Kwakernaak and Pradeep Misra% <-this % stops a space \thanks{This work was not supported by any organization}% <-this % stops a space \thanks{H. Kwakernaak is with Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, 7500 AE Enschede, The Netherlands {\tt\small h.kwakernaak@autsubmit.com}}% \thanks{P. Misra is with the Department of Electrical Engineering, Wright State University, Dayton, OH 45435, USA {\tt\small pmisra@cs.wright.edu}}% } \begin{document} \maketitle \thispagestyle{empty} \pagestyle{empty} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{abstract} These instructions provide basic guidelines for preparing camera-ready (CR) Proceedings-style papers. This document is itself an example of the desired layout for CR papers (inclusive of this abstract). The document contains information regarding desktop publishing format, type sizes, and type faces. Style rules are provided that explain how to handle equations, units, figures, tables, references, abbreviations, and acronyms. Sections are also devoted to the preparation of the references and acknowledgments. \end{abstract} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{INTRODUCTION} Your goal is to simulate, as closely as possible, the usual appearance of typeset papers. This document provides an example of the desired layout and contains information regarding desktop publishing format, type sizes, and type faces. \subsection{Full-Size Camera-Ready (CR) Copy} If you have desktop publishing facilities, (the use of a computer to aid in the assembly of words and illustrations on pages) prepare your CR paper in full-size format, on paper 21.6 x 27.9 cm (8.5 x 11 in or 51 x 66 picas). It must be output on a printer (e.g., laser printer) having 300 dots/in, or better, resolution. Lesser quality printers, such as dot matrix printers, are not acceptable, as the manuscript will not reproduce the desired quality. \subsubsection{Typefaces and Sizes:} There are many different typefaces and a large variety of fonts (a complete set of characters in the same typeface, style, and size). Please use a proportional serif typeface such as Times Roman, or Dutch. If these are not available to you, use the closest typeface you can. The minimum typesize for the body of the text is 10 point. The minimum size for applications like table captions, footnotes, and text subscripts is 8 point. As an aid in gauging type size, 1 point is about 0.35 mm (1/72in). Examples are as follows: \subsubsection{Format:} In formatting your original 8.5" x 11" page, set top and bottom margins to 25 mm (1 in or 6 picas), and left and right margins to about 18 mm (0.7 in or 4 picas). The column width is 88 mm (3.5 in or 21 picas). The space between the two columns is 5 mm(0.2 in or 1 pica). Paragraph indentation is about 3.5 mm (0.14 in or 1 pica). Left- and right-justify your columns. Cut A4 papers to 28 cm. Use either one or two spaces between sections, and between text and tables or figures, to adjust the column length. On the last page of your paper, try to adjust the lengths of the two-columns so that they are the same. Use automatic hyphenation and check spelling. Either digitize or paste your figures. \begin{table} \caption{An Example of a Table} \label{table_example} \begin{center} \begin{tabular}{|c||c|} \hline One & Two\\ \hline Three & Four\\ \hline \end{tabular} \end{center} \end{table} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{UNITS} Metric units are preferred for use in IEEE publications in light of their international readership and the inherent convenience of these units in many fields. In particular, the use of the International System of Units (SI Units) is advocated. This system includes a subsystem the MKSA units, which are based on the meter, kilogram, second, and ampere. British units may be used as secondary units (in parenthesis). An exception is when British units are used as identifiers in trade, such as, 3.5 inch disk drive. \addtolength{\textheight}{-3cm} % This command serves to balance the column lengths % on the last page of the document manually. It shortens % the textheight of the last page by a suitable amount. % This command does not take effect until the next page % so it should come on the page before the last. Make % sure that you do not shorten the textheight too much. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{ADDITIONAL REQUIREMENTS} \subsection{Figures and Tables} Position figures and tables at the tops and bottoms of columns. Avoid placing them in the middle of columns. Large figures and tables may span across both columns. Figure captions should be below the figures; table captions should be above the tables. Avoid placing figures and tables before their first mention in the text. Use the abbreviation ``Fig. 1'', even at the beginning of a sentence. Figure axis labels are often a source of confusion. Try to use words rather then symbols. As an example write the quantity ``Inductance", or ``Inductance L'', not just. Put units in parentheses. Do not label axes only with units. In the example, write ``Inductance (mH)'', or ``Inductance L (mH)'', not just ``mH''. Do not label axes with the ratio of quantities and units. For example, write ``Temperature (K)'', not ``Temperature/K''. \subsection{Numbering} Number reference citations consecutively in square brackets \cite{c1}. The sentence punctuation follows the brackets \cite{c2}. Refer simply to the reference number, as in \cite{c3}. Do not use ``ref. \cite{c3}'' or ``reference \cite{c3}''. Number footnotes separately in superscripts\footnote{This is a footnote} Place the actual footnote at the bottom of the column in which it is cited. Do not put footnotes in the reference list. Use letters for table footnotes (see Table I). \subsection{Abbreviations and Acronyms} Define abbreviations and acronyms the first time they are used in the text, even after they have been defined in the abstract. Abbreviations such as IEEE, SI, CGS, ac, dc, and rms do not have to be defined. Do not use abbreviations in the title unless they are unavoidable. \subsection{Equations} Number equations consecutively with equation numbers in parentheses flush with the right margin, as in (1). To make your equations more compact you may use the solidus (/), the exp. function, or appropriate exponents. Italicize Roman symbols for quantities and variables, but not Greek symbols. Use a long dash rather then hyphen for a minus sign. Use parentheses to avoid ambiguities in the denominator. Punctuate equations with commas or periods when they are part of a sentence: $$\Gamma_2 a^2 + \Gamma_3 a^3 + \Gamma_4 a^4 + ... = \lambda \Lambda(x),$$ where $\lambda$ is an auxiliary parameter. Be sure that the symbols in your equation have been defined before the equation appears or immediately following. Use ``(1),'' not ``Eq. (1)'' or ``Equation (1),'' except at the beginning of a sentence: ``Equation (1) is ...''. \begin{figure}[thpb] \centering %\includegraphics[scale=1.0]{figurefile} \caption{Inductance of oscillation winding on amorphous magnetic core versus DC bias magnetic field} \label{figurelabel} \end{figure} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{CONCLUSIONS AND FUTURE WORKS} \subsection{Conclusions} This is a repeat. Position figures and tables at the tops and bottoms of columns. Avoid placing them in the middle of columns. Large figures and tables may span across both columns. Figure captions should be below the figures; table captions should be above the tables. Avoid placing figures and tables before their first mention in the text. Use the abbreviation ``Fig. 1'', even at the beginning of a sentence. Figure axis labels are often a source of confusion. Try to use words rather then symbols. As an example write the quantity ``Inductance", or ``Inductance L'', not just. Put units in parentheses. Do not label axes only with units. In the example, write ``Inductance (mH)'', or ``Inductance L (mH)'', not just ``mH''. Do not label axes with the ratio of quantities and units. For example, write ``Temperature (K)'', not ``Temperature/K''. \subsection{Future Works} This is a repeat. Position figures and tables at the tops and bottoms of columns. Avoid placing them in the middle of columns. Large figures and tables may span across both columns. Figure captions should be below the figures; table captions should be above the tables. Avoid placing figures and tables before their first mention in the text. Use the abbreviation ``Fig. 1'', even at the beginning of a sentence. Figure axis labels are often a source of confusion. Try to use words rather then symbols. As an example write the quantity ``Inductance", or ``Inductance L'', not just. Put units in parentheses. Do not label axes only with units. In the example, write ``Inductance (mH)'', or ``Inductance L (mH)'', not just ``mH''. Do not label axes with the ratio of quantities and units. For example, write ``Temperature (K)'', not ``Temperature/K''. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{ACKNOWLEDGMENTS} The authors gratefully acknowledge the contribution of National Research Organization and reviewers' comments. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% References are important to the reader; therefore, each citation must be complete and correct. If at all possible, references should be commonly available publications. \begin{thebibliography}{99} \bibitem{c1} J.G.F. Francis, The QR Transformation I, {\it Comput. J.}, vol. 4, 1961, pp 265-271. \bibitem{c2} H. Kwakernaak and R. Sivan, {\it Modern Signals and Systems}, Prentice Hall, Englewood Cliffs, NJ; 1991. \bibitem{c3} D. Boley and R. Maier, "A Parallel QR Algorithm for the Non-Symmetric Eigenvalue Algorithm", {\it in Third SIAM Conference on Applied Linear Algebra}, Madison, WI, 1988, pp. A20. \end{thebibliography} \end{document}

https://texlive.info/CTAN/macros/generic/cptex/cp8859w.sty

texlive.info

CC-MAIN-2022-49

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-49/segments/1669446710684.84/warc/CC-MAIN-20221128235805-20221129025805-00182.warc.gz

% % TeX-Definitionen fĀr die Code Page ISO-8859-1 (Latin 1) % mit Erweiterungen von Microsoft Windows % % (C) 1994 FuturaSoft (Martin KrĄmer, D-49179 Ostercappeln) % % Changes between Version 1.1 and 1.0: % - adding the options `original' and `german' for german quotes % \typeout{Document Style Option `cp8859w' Version 1.1 <1 Mar 1994>.} % % \@ifundefined{selectcodepage}{\input cp.sty}{} \activateuppercharset \newcodepage{8859w}{ \selectcodepage[original]{8859} \makeactive{"082-"08C,"093-"09C,"09F} \mapchar{^^82}{\glq} \mapchar{^^83}{\florin} \mapchar{^^84}{\glqq} \mapchar{^^85}{\dots} \mapchar{^^86}{\dag} \mapchar{^^87}{\ddag} \mapchar{^^88}{\^{}} \mapchar{^^89}{\perthousand} \mapchar{^^8a}{\v S}\lcchar{^^9a} \mapchar{^^8b}{\flq} \mapchar{^^8c}{\OE}\lcchar{^^9c} % \mapchar{^^93}{\lqq} \mapchar{^^94}{\rqq} \mapchar{^^95}{\mathsymbol{\bullet}} \mapchar{^^96}{\endash} \mapchar{^^97}{\emdash} \mapchar{^^98}{\~{}} \mapchar{^^99}{\trademark} \mapchar{^^9a}{\v s}\ucchar{^^8a} \mapchar{^^9b}{\frq} \mapchar{^^9c}{\oe}\ucchar{^^8c} % \mapchar{^^9f}{\"Y}\lcchar{^^ff} % \mapchar{^^ff}{\"y}\ucchar{^^9f} % % Zuruecksetzen der Original-Definitionen % \def\cporiginal{% \mapchar{^^91}{\lq}% \mapchar{^^93}{\lqq}} % % Modifizierte Definitionen fuer die Benutzung von dt. Anfuehrungszeichen % \def\cpgerman{% \mapchar{^^91}{\grq}% \mapchar{^^93}{\grqq}} }%\end{newcodepage} % % Einstellen der Code Page von Microsoft Windows % \selectcodepage{8859w}

https://www.authorea.com/users/328559/articles/455780/download_latex

authorea.com

CC-MAIN-2021-39

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-39/segments/1631780058373.45/warc/CC-MAIN-20210927060117-20210927090117-00487.warc.gz

\documentclass[10pt]{article} \usepackage{fullpage} \usepackage{setspace} \usepackage{parskip} \usepackage{titlesec} \usepackage[section]{placeins} \usepackage{xcolor} \usepackage{breakcites} \usepackage{lineno} \usepackage{hyphenat} \PassOptionsToPackage{hyphens}{url} \usepackage[colorlinks = true, linkcolor = blue, urlcolor = blue, citecolor = blue, anchorcolor = blue]{hyperref} \usepackage{etoolbox} \makeatletter \patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{% \errmessage{\noexpand\@combinedblfloats could not be patched}% }% \makeatother \usepackage{natbib} \renewenvironment{abstract} {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize} {\bigskip} \titlespacing{\section}{0pt}{*3}{*1} \titlespacing{\subsection}{0pt}{*2}{*0.5} \titlespacing{\subsubsection}{0pt}{*1.5}{0pt} \usepackage{authblk} \usepackage{graphicx} \usepackage[space]{grffile} \usepackage{latexsym} \usepackage{textcomp} \usepackage{longtable} \usepackage{tabulary} \usepackage{booktabs,array,multirow} \usepackage{amsfonts,amsmath,amssymb} \providecommand\citet{\cite} \providecommand\citep{\cite} \providecommand\citealt{\cite} % You can conditionalize code for latexml or normal latex using this. \newif\iflatexml\latexmlfalse \providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}% \AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{float} \begin{document} \title{Pinning down the evidence for acupuncture for recurrent urinary tract infection (UTI). (Mini-commentary on BJOG-20-0142.R1)} \author[1]{Rufus Cartwright}% \author[2]{Pawel Miotla}% \affil[1]{Oxford University Hospitals NHS Foundation Trust}% \affil[2]{Medical University of Lublin}% \vspace{-1em} \date{\today} \begingroup \let\center\flushleft \let\endcenter\endflushleft \maketitle \endgroup \sloppy Mini-commentary on BJOG-20-0142.R1: Acupuncture for recurrent urinary tract infection in women: A systematic review and meta-analysis \textbf{Pinning down the evidence for acupuncture for recurrent urinary tract infection (UTI)} Rufus Cartwright,\textsuperscript{1} Pawel Miotla\textsuperscript{2} 1) Oxford University Hospitals NHS Foundation Trust, Oxford, UK 2) Medical University of Lublin, Lublin, Lubelskie, Poland. Email: rufus.cartwright@gmail.com UTI is among the most common bacterial infections, accounting for around one quarter of all antibiotic prescriptions. At least one quarter of women who experience a UTI will also go on to have a confirmed recurrence within six months, thereby meeting the definition for recurrent UTI {[}Foxman B. \emph{Am J Public Health} . 1990;80:331-3{]}. While antibiotics remain widely effective both for treatment and prevention of recurrence, we face significant antibiotic resistance, with high rates of primary resistance in urine cultures, and knock on effects on bloodstream sepsis, particularly from drug resistant \emph{E. coli} . Effective non-antibiotic approaches in recurrent UTI treatment or prophylaxis would be very attractive both for individual patients and from the population perspective {[}Sihra N et al. \emph{Nat Rev Urol.}2018;15:750-76{]}. This systematic review {[}Qin X et al. \emph{BJOG} 2020 https://doi.org/10.1111/1471-0528.16315{]} updates earlier reviews of the topic, including the only two RCTs of acupuncture for prophylaxis of recurrent UTI, and adding three more recent RCTs that have tested acupuncture for treatment of upper or lower tract infection. The authors assert on the basis of two unblinded trials, a GRADE rating of low certainty in an estimated RR of 0.39 with acupuncture compared to no treatment for prevention of recurrence over six months. The authors suggest on the basis of a single partially blinded trial, a GRADE rating of moderate certainty in an estimated RR of 0.45 for acupuncture compared to sham acupuncture for prevention of recurrence over six months. Skeptics might have further rated down the certainty in estimates, noting few events, wide confidence intervals, high risk of bias, and uncertainty about selective outcome reporting or publication bias. For the issue of treatment of active UTI, among women with a recurrent UTI, readers may be even more skeptical. The authors identify that while acupuncture might reduce symptoms of cystitis, it is implausible that it should treat bacterial cystitis or upper tract infection. On the basis of three unblinded trials, the authors suggest a GRADE rating of low certainty in a RR of 1.92 for a composite definition of cure with either needle acupuncture (one trial) or moxibustion (two trials) compared to antibiotics. On the basis of one trial, they also suggest very low certainty in a 2-day reduction in symptom duration. None of these trials are available in English, and the authors do not specify in the characteristics of included studies, but these studies may provide only indirect evidence for the patients seen in gynaecological practice. One trial is explicitly for chronic pyelonephritis, one is for chronic UTI (unclear if upper or lower tracts), and the single trial for recurrent bacterial cystitis demonstrates no benefit in composite cure. All three trials have extremely low rates of cure with antibiotics (22.9-35.0\%). Again then, we might further rate down the evidence on the basis of indirectness, as it may not apply for the typical uncomplicated recurrent bacterial cystitis seen in gynaecology. Given the lack of biological plausibility, and very low confidence in the evidence base, it is unsurprising that current guidance does not recommend use of acupuncture for prevention or treatment of UTI {[}EAU. Urological Infections Guidelines. https://uroweb.org/guideline/urological-infections/ Accessed 27 May 2020{]}. A change in confidence can only come from adequately blinded, appropriately powered RCTs, but there will be little appetite from funders based on the current evidence. \textbf{Disclosures:} Rufus Cartwright- no conflict of interests; Pawel Miotla- consultant for Adamed, Angelini, Astellas, Bayer, Bionorica. Completed disclosure of interest forms are available to view online as supporting information. \selectlanguage{english} \FloatBarrier \end{document}

https://ctan.math.washington.edu/tex-archive/info/examples/Math-E/06-20-3.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656104628307.87/warc/CC-MAIN-20220705205356-20220705235356-00359.warc.gz

%% %% An UIT Edition example %% %% Example 06-20-3 on page 123. %% %% Copyright (C) 2010 Herbert Voss %% %% It may be distributed and/or modified under the conditions %% of the LaTeX Project Public License, either version 1.3 %% of this license or (at your option) any later version. %% %% See http://www.latex-project.org/lppl.txt for details. %% %% %% ==== % Show page(s) 1 %% \documentclass[]{exaarticle} \pagestyle{empty} \setlength\textwidth{375.57637pt} \AtBeginDocument{\setlength\parindent{0pt}} \StartShownPreambleCommands \usepackage{amsmath,calc} \StopShownPreambleCommands \begin{document} \setlength\fboxsep{0pt} \setlength\abovedisplayskip{10pt}\setlength\belowdisplayskip{10pt} \fbox{\parbox{\linewidth}{\setlength\fboxsep{5pt}% \begin{xxalignat}{2} \framebox[0.125\columnwidth]{xxalignat} &= \framebox[0.125\columnwidth]{x} & \framebox[0.125\columnwidth]{x} &= \framebox[0.125\columnwidth]{x}\\ \framebox[0.125\columnwidth]{xxalignat} &= \framebox[0.1\columnwidth]{x} & \framebox[0.1\columnwidth]{x} &= \framebox[0.1\columnwidth]{x} \end{xxalignat}}} \end{document}

http://dlmf.nist.gov/25.11.E32.tex

nist.gov

CC-MAIN-2017-22

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2017-22/segments/1495463608726.4/warc/CC-MAIN-20170527001952-20170527021952-00099.warc.gz

\[\int_{0}^{a}x^{n}\mathop{\psi\/}\nolimits\!\left(x\right)\mathrm{d}x=(-1)^{n-1% }\mathop{\zeta\/}\nolimits'\!\left(-n\right)+(-1)^{n}h(n)\frac{B_{n+1}}{n+1}-% \sum_{k=0}^{n}(-1)^{k}\binom{n}{k}h(k)\frac{B_{k+1}(a)}{k+1}a^{n-k}+\sum_{k=0}% ^{n}(-1)^{k}\binom{n}{k}\mathop{\zeta\/}\nolimits'\!\left(-k,a\right)a^{n-k},\]

http://armagnac.tuxfamily.net/kaosfantasy/frundis-common/preamble-tex-en.tex

tuxfamily.net

CC-MAIN-2022-05

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-05/segments/1642320303385.49/warc/CC-MAIN-20220121131830-20220121161830-00224.warc.gz

% ---> Chargement de la class \documentclass[12pt,openany]{book} % ---> Packages utilisés \usepackage{fontspec} \usepackage{microtype} \usepackage{polyglossia} \usepackage{emoji} % probando % \setemojifont{ } % probando \setmainlanguage{english} % \usepackage{verse} \usepackage{graphicx} \usepackage{nopageno} % \usepackage{pdflscape} % \usepackage{verbatim} \usepackage{titlesec} \usepackage{pdfpages} \usepackage{hyperref} \usepackage{fancyhdr} \usepackage{chngcntr} \hypersetup{colorlinks=true,citecolor=black,filecolor=black,linkcolor=black,urlcolor=black} \setlength{\oddsidemargin}{-20pt} % Pour imprimer ---> \usepackage[twoside,paperwidth=14.851cm, paperheight=20.997cm, right=35pt, left=65pt, top=40pt, bottom=43pt]{geometry} % Pour la version grande ---> % \usepackage[paperwidth=12cm, paperheight=18cm, right=32.5pt, left=32.5pt, top=42pt, bottom=48pt]{geometry} \widowpenalty=3000 \clubpenalty=3000 \hyphenpenalty=10000 \hbadness=10000 \sloppy \raggedbottom \frenchspacing \pagestyle{fancy} \renewcommand{\headrulewidth}{0pt} \lhead[]{}\chead[]{}\rhead[]{} \lfoot[]{}\cfoot[\thepage]{\thepage} \rfoot[]{} % FIN DU PREAMBULE -----------------------------------------------------

http://ftp.t.ring.gr.jp/archives/text/CTAN/graphics/pgf/base/tex/tikzlibraryplothandlers.code.tex

ring.gr.jp

CC-MAIN-2020-10

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2020-10/segments/1581875146681.47/warc/CC-MAIN-20200227094720-20200227124720-00261.warc.gz

% Copyright 2006 by Till Tantau % % This file may be distributed and/or modified % % 1. under the LaTeX Project Public License and/or % 2. under the GNU Public License. % % See the file doc/generic/pgf/licenses/LICENSE for more details. \ProvidesFileRCS{tikzlibraryplothandlers.code.tex} \usepgflibrary{plothandlers}% \endinput

https://fsi.cs.fau.de/dw/_media/pruefungen/grundstudium/bfs_2015-02-03_braindump.tex

fau.de

CC-MAIN-2022-21

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-21/segments/1652662636717.74/warc/CC-MAIN-20220527050925-20220527080925-00213.warc.gz

\documentclass[10pt,fleqn,DIV12,headinclude,footinclude,pagesize,headlines=3] {scrreprt} % 10pt font size % fleq left-aligned formulas % headinclude head is part of the text area % footinclude foot is part of the text area % pagesize automatic page size calculation % headlines spacing between headline and body \usepackage{scrpage2} \usepackage[utf8]{inputenc} \usepackage[ngerman]{babel} \usepackage[T1]{fontenc} \usepackage[margin=2cm]{geometry} \usepackage{paralist} \usepackage{listings} \usepackage{hyperref} \usepackage{titlesec} \pagestyle{scrplain} \usepackage{lastpage} \usepackage{xcolor} \usepackage{tikz} \usetikzlibrary{arrows,automata} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx} \usepackage{wasysym} \usepackage{sectsty} \chapterfont{\Large} \clearscrheadfoot{} \usepackage[framemethod=default]{mdframed} \newcommand{\q}[1]{\begin{mdframed}[linewidth=1.5pt]#1\end{mdframed}} \setkomafont{pageheadfoot}{\footnotesize} \ihead[Berechenbarkeit und formale Sprachen - Klausurenbraindump \\ WS2014/15]{} \ohead[Babaam!]{} % footer texts \cfoot[Seite: \pagemark]{} % ]{\pagemark} \ofoot[Gesamt: \pageref{LastPage}]{} % separation line styles \setheadsepline{.8pt} \setfootsepline{0pt} \lstset{ backgroundcolor=\color{lightgray}, rulecolor=\color{black}, tabsize=2, basicstyle=\fontfamily{pcr}\selectfont\footnotesize\color{black} } \usepackage{etoolbox} \makeatletter \patchcmd{\chapter}{\if@openright\cleardoublepage\else\clearpage\fi}{}{}{} \makeatother \author{Energyptos} \title{Braindump ws1415} \begin{document} \tableofcontents \newpage \chapter{Aufgabe 1: MC [6 Punkte]} \q{\ Zeigen Sie oder widerlegen Sie die folgenden Aussagen (die jeweiligen Beweise sind "au"serst kurz): \begin{itemize} \item[a)] F"ur jeden deterministischen endlichen Automaten A gibt es einen nichtdeterministischen Kellerautomaten A', der das Komplement der Sprache L akzeptiert, also $L(A') = \Sigma^* \backslash L(A)$. \item[b)] Es ist unbekannt ob es eine unentscheidbare aber rekursiv aufzählbare Sprache in NP gibt. \item[c)] $L_{1}, L_{2}$ sind unentscheidbar, daraus folgt, da"s $L_{1} \cup L_{2}$ unentscheidbar ist. \end{itemize} Schreiben sie erst "`Stimmt"' oder "`Stimmt nicht"' und begr"unden sie ihre Entscheidung anschlie"send. } \chapter{Aufgabe 2: Reduktion} \q{\ \begin{itemize} \item[a)] Geben Sie die Definition des initialen Halteproblems an: \[H_{\epsilon}:=\{\] \item[b)] $L_{2b} = \left\{\mbox{<}M\mbox{>}\#z \;\middle|\; M \mbox{ hält genau für 2 verschiedene Eingaben } z_1,z_2 \in \mbox{bin}(n) \mbox{ mit } z_1 \neq z_2 \right\}$\\ Zeigen Sie, da"s $L_{2b}$ unentscheidbar ist. Benutzen Sie hierfür, da"s $H_{\epsilon}$ unentscheidbar ist. Bedenken sie, dass "<=>" aus "<=" und "=>" besteht. \end{itemize} } \chapter{Aufgabe 3: Pumping} \q{ \begin{itemize} \item[a)] Definieren sie kontextfreie Pumpeigenschaft für eine Sprache L aus dem Alphabet $\Sigma$ \item[b)] Zeigen Sie, da"s $L_{3b} = \left\{ z = \{a,b\}^* \; \middle| \; |z| \geq 4 \mbox{ und $|z|$ ist nicht durch 3 teilbar} \right\}$ die kontextfreie Pumpeigenschaft hat. \item[c)] Zeigen Sie, da"s $L_{3c} = \left\{ 0^k \smiley^l 0^{2k} \; \middle| \; 0 \leq k < l \right\}$ die kontektfreie Pumpeigenschaft nicht hat. \end{itemize} } \newpage \chapter{Aufgabe 4: Automaten} \q{ Gegeben sei der folgende nichtdeterministische endliche Automat A mit $\Sigma = \{a,b\}$: \begin{center} \begin{tikzpicture}[->,>=stealth',shorten >=1pt,auto,node distance=2.8cm, semithick] \node[initial,state] (A) {$q_0$}; \node[state] (B) [right of=A] {$q_1$}; \node[state] (C) [below of=A] {$q_2$}; \node[state,accepting] (D) [right of=C] {$q_3$}; \node[state,accepting] (E) [right of=D] {$q_4$}; \node[state] (F) [right of=B] {$q_5$}; \path (A) edge [loop above] node {$a | b$} (A) edge node {$\epsilon$} (B) edge node {1} (C) (B) edge node {0} (F) edge node {1} (C) (C) edge node {0} (D) (D) edge [bend right] node {0} (E) (E) edge [bend right] node {1} (D) (F) edge node {1} (E); \end{tikzpicture} \end{center} \begin{itemize} \item[a)] Konstruieren Sie mit dem Verfahren aus der Vorlesung (es muss erkennbar sein!) einen zu A "aquivalenten deterministischen endlichen Automaten A'. Zeichnen sie nur die vom Startzustand aus erreichbaren Zust"ande. \item[b)] \[A_{4}=A_{2} \cup \{A_{3} \circ A_{2}\}*\] Hier kommt noch ein bisschen mehr Text und noch 2Mal schematisch der A2 und einmal der A3 zum verbinden... folgt irgendwann! \end{itemize} } \chapter{Aufgabe 5: CYK} \q{\ \begin{itemize} \item[a)] Geben Sie die formal die rekursive Definition des CYK-Algorithmus an. \[ V(i,i) := \] \[ V(i,j) := \] \item[b)] Vervollst"andigen Sie die Tabelle f"ur die gegebene Grammatik $G$ und die Eingabe $baaba$. Woran können sie erkennen, dass das Wort Element der Sprache L ist? $G$:\\ \begin{tabular}[c]{ll} $S \rightarrow AB \vert BC$ & $A \rightarrow BA \vert a$\\ $B \rightarrow CC \vert b$ & $C \rightarrow AB \vert a$\\ \end{tabular} \newline \newline \begin{tabular}[c]{|c|c|c|c|c|} \hline b & a & a & b & a \\ \hline \{B\} & \{A,C\} & \{A,C\} & \{B\} & \{A,C\} \\ \hline \{S,A\} & \{B\} & \{S,C\} & \{S,A\} & \\ \hline $\emptyset$ & \{B\} & \{B\} & &\\ \hline $\emptyset$ & V(2,4) & & &\\ \hline V(1,5) & & & &\\ \hline \end{tabular} \item[c)] Zeichnen Sie einen Syntaxbaum fuer das Wort $baaba$. \end{itemize} } \newpage \chapter{Aufgabe 6: P=NP} \q{\ \begin{itemize} \item[a)] Geben sie die Definition f"ur das in der Vorlesung besprochene Problem Vertex-Cover (VC) an. \[VC := \{ \] \item[b)] Gegeben ist die Sprache \textsc{FastAlleGleich} \[ FG = \left\{\mbox{bin}(a_{1})\#\ldots\#\mbox{bin}(a_{n}) \; \middle|\; n \geq 2,\; a_{1} \neq a_{n},\; \forall i \in \{ 2,\ldots,n-1 \}: a_{1}=a_{i} \right\} \] Zeigen Sie: $FG \leq_{p} SAT$ \item[c)] Angenommen P=NP, zeigen Sie: $SAT \leq_{p} FG$. \newline Begr"unden Sie unter Verwendung der Definition von NP-Vollst"andigkeit, da"s $FG$ dann NP-vollst"andig ist. \end{itemize} } \end{document}

https://fifthestate.anarchistlibraries.net/library/378-summer-2008-african-road-anarchism.tex

anarchistlibraries.net

CC-MAIN-2021-25

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-25/segments/1623488539764.83/warc/CC-MAIN-20210623165014-20210623195014-00238.warc.gz

\documentclass[DIV=12,% BCOR=0mm,% headinclude=false,% footinclude=false,open=any,% fontsize=10pt,% oneside,% paper=210mm:11in]% {scrbook} \usepackage{fontspec} \setmainfont[Script=Latin]{CMU Serif} \setsansfont[Script=Latin,Scale=MatchLowercase]{CMU Sans Serif} \setmonofont[Script=Latin,Scale=MatchLowercase]{CMU Typewriter Text} % global style \pagestyle{plain} \usepackage{microtype} % you need an *updated* texlive 2012, but harmless \usepackage{graphicx} \usepackage{alltt} \usepackage{verbatim} % http://tex.stackexchange.com/questions/3033/forcing-linebreaks-in-url \PassOptionsToPackage{hyphens}{url}\usepackage[hyperfootnotes=false,hidelinks,breaklinks=true]{hyperref} \usepackage{bookmark} \usepackage[shortlabels]{enumitem} \usepackage{tabularx} \usepackage[normalem]{ulem} \def\hsout{\bgroup \ULdepth=-.55ex \ULset} % https://tex.stackexchange.com/questions/22410/strikethrough-in-section-title % Unclear if \protect \hsout is needed. Doesn't looks so \DeclareRobustCommand{\sout}[1]{\texorpdfstring{\hsout{#1}}{#1}} \usepackage{wrapfig} \usepackage{indentfirst} % remove the numbering \setcounter{secnumdepth}{-2} % remove labels from the captions \renewcommand*{\captionformat}{} \renewcommand*{\figureformat}{} \renewcommand*{\tableformat}{} \KOMAoption{captions}{belowfigure,nooneline} \addtokomafont{caption}{\centering} \usepackage{polyglossia} \setmainlanguage{english} % footnote handling \usepackage[fragile]{bigfoot} \usepackage{perpage} \DeclareNewFootnote{default} \DeclareNewFootnote{B} \MakeSorted{footnoteB} \renewcommand*\thefootnoteB{(\arabic{footnoteB})} \deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~} % avoid breakage on multiple <br><br> and avoid the next [] to be eaten \newcommand*{\forcelinebreak}{\strut\\*{}} \newcommand*{\hairline}{% \bigskip% \noindent \hrulefill% \bigskip% } % reverse indentation for biblio and play \newenvironment*{amusebiblio}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newenvironment*{amuseplay}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newcommand*{\Slash}{\slash\hspace{0pt}} \addtokomafont{disposition}{\rmfamily} \addtokomafont{descriptionlabel}{\rmfamily} % forbid widows/orphans \frenchspacing \sloppy \clubpenalty=10000 \widowpenalty=10000 % http://tex.stackexchange.com/questions/304802/how-not-to-hyphenate-the-last-word-of-a-paragraph \finalhyphendemerits=10000 % given that we said footinclude=false, this should be safe \setlength{\footskip}{2\baselineskip} \title{The African Road to Anarchism?} \date{} \author{Jim Feast} \subtitle{Will the collapse of government rule in countries like The Gambia lead to\dots{} The African Road to Anarchism?} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={The African Road to Anarchism?},% pdfauthor={Jim Feast},% pdfsubject={Will the collapse of government rule in countries like The Gambia lead to\dots{} The African Road to Anarchism?},% pdfkeywords={Fifth Estate \#378, Summer 2008}% } \begin{document} \begin{titlepage} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge The African Road to Anarchism?\par}}% \vskip 1em {\usekomafont{subtitle}{Will the collapse of government rule in countries like The Gambia lead to\dots{} The African Road to Anarchism?\par}}% \vskip 2em {\usekomafont{author}{Jim Feast\par}}% \vskip 1.5em \vfill \strut\par \end{center} \end{titlepage} \cleardoublepage My experiences on a recent trip to The Gambia on Africa’s west-central coast, brought to mind the historic leftist dream that the state will wither away once workers have overturned capitalism. Here’s an irony of history. In the last 15 years, in the industrially undeveloped world, the state has withered away, not because of its supersession, but due to the extension of global capitalism. Talk of state collapse on capital’s periphery doesn’t mean governments have completely vanished, but that many states have diminished from being the totalized agencies of control we experience in Northern tier countries. Following my February journey to what is officially titled The Republic of The Gambia, Africa’s smallest nation, the counterintuitive idea occurred to me that (relative) state collapse may well presage an anti-authoritarian twist to the future of peripheral nations. For reasons of comparison, let’s contrast the recent history of South America and sub-Saharan Africa. Most nations in these regions have long been locked in relationships of unequal exchange with the industrialized world, selling raw materials cheaply and buying back manufactured items at jacked-up rates, meanwhile running up a debt burden both on these imports and to finance mostly corrupt government programs. The one obvious way for these nations to escape dependency was to siphon money from the raw materials sector to jump-start heavy industry, protected behind tariff walls. Although this was only successful in a few states, the imposition of structural adjustment in the 1980s demanded by the World Bank and the IMF to satisfy outstanding loans, ended its strategic use. The creditor Western banking institutions (in return for continued loans), made the nations under their direction scuttle industrialization programs in favor of renewed emphasis on raw material extraction, plus unbrick tariff walls to ease the entry of Western imports. The social consequences were enormous. Shuttering of factories meant the massive lay off of workers as did the downsizing of the government. The dispossessed entered the ballooning urban informal sector, joined by peasants who the new emphasis on capitalist (that is, capital intensive) agriculture had made redundant. Mike Davis in \emph{Planet of Slums} argues that these nations, locked into runaway urbanization and impoverishment, have little hope of escaping their downward course. Those who occupy the command centers can handily hold onto wealth and power because the mass of poor are too steeped in the day-to-day battle for survival to organize coherent resistance. By contrast, the authors of the anthology, \emph{Another Production Is Possible: Beyond the Capitalist Canon}, edited by Boaventura de Sousa Santos, see examples of the poor fighting back. For these thinkers, the poor, realizing the new world order has no place for them, often opt to jettison capitalist economic structures or ignore their legal strictures. The former route is represented by the creation of a solidarity economy comprised of worker owned and managed cooperatives, which now form a portion of many South American economies. These formations, in the words of Another Production contributors, strive to “replace the autocracy that characterizes capitalist production\dots{}with participatory democracy within production units. The goal is to expand the field of action of democracy from the political to the economic field.” Ignoring legal strictures is typified by the Movement of Landless Workers in Brazil, active since the late 1980s. Comprised of “lumpen peasantry”--dispossessed, floating farm laborers--the group has seized unused latifundi, holding and farming them until the government legalizes the take-over. The movement’s most dramatic action occurred in April 1996 when 15,000 people (!) invaded and occupied farmlands in Parana province, which they hold to this day. If we compare South America to Africa in terms of their likelihood of leading the charge to replace global capital, it would have to be said that in South America the poor have been better able to fight off state repression with their more vigorous labor and peasant organizations. Yet Africa, as we will see, seems in some ways better predisposed to turn the collapse of the state and the depredations of the money economy in a positive direction. First, it is often not realized that in sub-Saharan Africa, aside from in the minority of countries with a large, white settler population and valuable resources (such as diamonds or copper), there was little penetration of capitalist agricultural forms or government into the interior. In the colonial era, as Africanist Alex Thomson notes, “the imperial powers had only limited goals. There was no desire to invest resources to ensure the state could project its authority into every corner of the new colonies.” And, after independence, settler states excepted, Goran Hyden, in African Politics in Comparative Perspective, states, “Elsewhere, Africans remained only marginally affected by the market. They increasingly traded in the market, but their base was still a homestead and family farm where a subsistence ethos prevailed.” Secondly, such limited links was in the interest of the colonists, who purposely created a semi-working class. Thomson states, “Mine owners and farm managers rely on the fact that peasants [who come to work temporarily] are also producing for themselves back on their smallholdings (farmed in their absence by their families) As workers have this additional source of subsistence, wages can be kept low.” The salient points are these. No matter how wide the impact of world capitalism, much of sub-Saharan Africa has not been effectively shaped by state or market power. Moreover, while in South America there is a struggle to develop an alternative economy, in the parts of Africa under discussion, a robust subsistence economy, unconcerned with profit and capital expansion, continues to exist. On our trip to The Gambia to visit our daughter, Ana, a Peace Corps volunteer, we went up country to a North River Fula village. Drawing upon Ana’s knowledge--she has lived in the village for 18 months and speaks the Fula language--we were able to get a firsthand view of life in a non-monetarized, subsistence culture. We saw that while there were people who left the village to seek work in the capital, many chose to stay home, existing at a subsistence level but with ample amounts of time for religious and cultural practices, including socializing while drinking grinty (green tea) and eating peanuts. Life is simple. The Fula raise cattle, and grow millet and peanuts. Meals are either millet (breakfast and dinner) or rice (lunch), spiced up with “wicked” sauce. Fresh milk accompanies all repasts. That’s it for variety. Food is taken by hand, without utensils. A triply brewed grinty, made in child-size teapots and drunk from shot glasses, is the beverage for leisure time. Water for washing clothes and bathing is drawn from a well and carried home in a bucket. Houses are made from dried red clay, dug from a nearby pit and shaped and set in a wooden mold. Home furnishings are spartan, consisting solely of a bed. In capitalist society, money earned may be spent on friends and family, but a large part is customarily invested in the earner’s own future. In the subsistence economy, by contrast, an individual who has acquired wealth feeds it back into the whole community, not only as a form of conspicuous consumption, but in recognition that all good fortune arises, not via personal initiative (primarily), but through one’s participation in a collectivity. Hyden underlines this point by citing an anthropologist, who “shows how [African] individuals who have recently acquired their wealth spend lavishly on such private ceremonies as funerals and weddings to demonstrate their commitment to local institutions of kinship.” Such focus on the ceremonies of gift-giving was evident in our village. As a present to our hosts, we brought a 50 kilo bag of rice. The day after we arrived, a special ritual took place to give thanks to Allah and divide the grain between the seven compounds that made up the unit. The local Muslim preacher first led the group in prayer, each of us holding out our arms, palms upward, in a receiving gesture. Then the rice was evenly distributed between seven large pots. After the division of the food, a second prayer was offered. In such a world where the giving and taking of gifts plays such a big role, cooperation (in farming, herding and decision-making) takes precedence over individualism, a rare trait in such societies. This was clear in the Fulas’ attitude toward individual possession. When a villager wants to borrow something, say a scissors, he or she goes to the owner’s house, asks and receives it. If the owner is out, the visitor still takes the scissors. All parties see this as acceptable practice. This openness extends to land. One night we saw a villager burning a field in preparation for planting. I asked the man, Immagi, I was standing with--those who went to high school spoke English--whose land this was. He, replied, “It’s his if he works on it.” He elaborated, “All land is free.” Village solidarity is constantly cemented by rituals of hospitality, at weddings, births and in the reception of guests. When we arrived mid-evening, everyone from the compound, from babies toted by mothers to the respected elders, came to our house to welcome us and ask, “How is your day?” The next afternoon we went to each compound to sit, pass the time and eat peanuts. This, by the way, is the most striking feature of the non-money environment, passing time. Great chunks of the day are reserved for socializing. What one gets in abundance is the time to chat, to discuss, dispute, joke, josh, sing, reminisce and dream with others. The hottest part of the day--average temperature is 90 to 100 degrees year-round--and in the long, breeze-blessed evenings, everyone hangs out. On the negative side, the Fula have a patriarchal society as evidenced in the fact that the women have more chores. This is true throughout the region. Hyden cites a study that notes women provide nearly three-quarters of the labor in food production. In this village, at least, this is not acutely alienated labor. When women work washing clothes or pounding millet, for instance, it is done in the compound’s open center, under a tree and in company with other women with whom they carry on a lively dialogue. Work and conversation blend. Let’s return to the point about the work cultures of the marginalized. Mike Davis envisions a future in which the ultra-poor, massed into mega-metropolises cling by their fingernails to the unraveling edges of the capitalist system. But de Sousa Santos and his fellow authors argue that, facing an option of generalized immiseration, the excluded are beginning to cast around for alternative economies. The reinvigoration of a still intact subsistence sector offers one such alternative. But we can go further by providing a more in-depth examination of the state’s withering. As suggested, this change does not entail the complete dismantling of government functions, which are immediately taken over by the democratic institutions of the poor. Rather, what is happening in Africa is a tripartite devolution that encompasses: 1) a fundamental reorganization of state structures; 2) a depletion of the government’s ability to rule; and 3) a loss of sovereignty. 1. Since independence, most sub-Saharan African countries have been one-party states, headed by corrupt strong men who rule by combining military coercion with the distribution of favors to well-placed followers. In his study of African political systems, Hyden says that, as in any political system, the most stable one-party states depend more on a network of supportive clients than on violence. The intelligent strong man sees that not only his immediate cronies (who staff the state) but regional and tribal leaders of every significant stripe must be cultivated by financing infrastructural projects (that offer prime opportunities for graft) in their bailiwicks. This creates a rough and ready democracy, though only among elite factions. But with structural adjustment policies forced upon these nations, this form of government has ceased to exist because funds to sustain the patronage networks are no longer there. In a movement to shore up elite rule, there has been a widespread morphing into multi-party democracies. From 1988 to 1999 the number of states in sub-Saharan Africa featuring multi-party elections went from 9 to 45. This temporarily and cynically solves two problems for state rule. It restores a patina of legitimacy to a system that can no longer provide either patronage or (see below) welfare services to its citizens, and reinvigorates it by dividing clients among the competing parties, so each political grouping has need to siphon fewer funds since it serves a smaller client base. 2. Another loss of state power is the inability of it to provide minimal welfare to the citizenry, such as education and medical care, which structural adjustment programs eliminate as too costly. While some of these services are taken over by international relief organizations, most that are continued are done so by groups from the distressed society itself. In other words, as Thomson puts it, “Declining state capacity required civil society to increase its self sufficiency.” The once-repressed women’s groups, trade unions, farmers associations, and other grassroots networks are assuming greater responsibility in social and economic life. To put this more graphically, let me refer to the Fula village again. In our settlement, there was a women’s group made up of females from all ‘seven compounds that had set up an organization to sell “soured” milk (something like yogurt), which they took by cab to Banjul and peddled in office buildings. Ideally, as the government becomes less able to provide services, it is groups like this women’s band--not merely as entrepreneurs, but as directors of village\Slash{}city contact--that will come to the fore as more democratic creators of social networks. 3. The state, which at independence, could set economic policies, now has lost this aspect of its sovereignty, since it is now being ruled by the diktats of international monetary agencies. Nonetheless, the very poverty of sub-Saharan Africa means that the retrenchment demanded of the countries there will not equal what is seen in South America. While, for example, in the 1990s, Brazil and Argentina saw the vast proletarianization of their middle classes, Africa does not have a middle class of any dimension to be downsized. Moreover, many of the African countries (such as The Gambia) lack the infrastructure or valuable natural resources to make them super attractive to the predators of international capital. Julius Nyerere, the first president of Tanzania after independence, called for an “African road to socialism,” in which his country would return to the communist structures of village life without having to pass through capitalism. His hopes were never realized, but it could be that a different type of social structure is now on the horizon. The standard history of Western Europe depicts a move from feudal to democratic states, which simultaneously become more representative and extend their reach farther into society. The change in Africa, by contrast, entails a move from dictatorial to more representative democracies, concomitant with a diminishment of the state’s power over society. So, what about an “African road to anarchism,” whereby the money economy and the state, which are in a condition of partial collapse or withdrawal, cede more and more functions to non-monetarized, non-statist village communities that are organized on the basis of mutual aid? Anything else is Davis’ grim vision of a planet of slums, or worse, a generalized Somalia or Iraq. % begin final page \clearpage % new page for the colophon \thispagestyle{empty} \begin{center} \bigskip \includegraphics[width=0.25\textwidth]{fe-logo.pdf} \bigskip \end{center} \strut \vfill \begin{center} Jim Feast The African Road to Anarchism? Will the collapse of government rule in countries like The Gambia lead to\dots{} The African Road to Anarchism? \bigskip \href{https://www.fifthestate.org/archive/378-summer-2008/african-road-anarchism}{\texttt{https://www.fifthestate.org/archive/378-summer-2008/african-road-anarchism}} Fifth Estate \#378, Summer 2008 \bigskip \textbf{fifthestate.anarchistlibraries.net} \end{center} % end final page with colophon \end{document}

https://www.zentralblatt-math.org/matheduc/en/?id=727&type=tex

zentralblatt-math.org

CC-MAIN-2019-30

text/plain

application/x-tex

crawl-data/CC-MAIN-2019-30/segments/1563195529481.73/warc/CC-MAIN-20190723172209-20190723194209-00115.warc.gz

\input zb-basic \input zb-matheduc \iteman{ZMATH 2016f.00317} \itemau{Niermann, Anne} \itemti{Professional knowledge of teachers in mathematics and science education. ``\dots you really have to know about the matter". (Professionswissen von Lehrerinnen und Lehrern des Mathematik- und Sachunterrichts. ``\dots man muss schon von der Sache wissen.".)} \itemso{Bad Heilbrunn: Verlag Julius Klinkhardt (ISBN 978-3-7815-2144-5/pbk). 230~p. (2016).} \itemab Publisher's description: ``\dots man muss schon von der Sache wissen. Nicht einfach nur Buch auf und los geht's." Das Professionswissen von Lehrerinnen und Lehrern hat einen ma{\ss}geblichen Einfluss auf den Lernerfolg der Sch\"ulerinnen und Sch\"uler. Aber worin unterscheidet sich das Wissen intra- und interindividuell sowie insbesondere auch interdisziplin\"ar? Und woran liegt das? Nach der Diskussion verschiedener Sichtweisen von Kompetenz, Professionalit\"at und des Wissens von Lehrerinnen und Lehrern wird ein eigenes psychologisch-kompetenztheoretisches Modell des Professionswissens vorgestellt. Auf dieser Grundlage basiert auch die empirische Studie, die anhand von qualitativen Interviews sowie erg\"anzenden Fragb\"ogen das fachliche, fachdidaktische und allgemein-didaktische Wissen von 25 Lehrerinnen und Lehrern des Mathematik- und Sachunterrichts an Grundschulen in den Blick nimmt. Dabei geht es vor allem um die Frage, welche Unterschiede und Gemeinsamkeiten das Professionswissen auszeichnen und wie sich diese in Mustern verdichten lassen. Zudem werden die Ursachen f\"ur bestimmte Auspr\"agungen im Professionswissen der Lehrerinnen und Lehrer untersucht. \itemrv{~} \itemcc{C49 D39 B50 A70} \itemut{} \itemli{} \end

http://git.dwarfstd.org/?p=dwarf-doc.git;a=blob_plain;f=dwarf5/latexdoc/attributesbytag.tex;hb=21b67226b7f195a97f2ee99e8c5f371a770fcc97

dwarfstd.org

CC-MAIN-2022-40

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-40/segments/1664030335254.72/warc/CC-MAIN-20220928113848-20220928143848-00457.warc.gz

\chapter[Attributes by Tag (Informative)]{Attributes by Tag Value (Informative)} \label{chap:attributesbytagvalueinformative} The list below enumerates the attributes that are most applicable to each type of debugging information entry. DWARF does not in general require that a given debugging information entry contain a particular attribute or set of attributes. Instead, a DWARF producer is free to generate any, all, or none of the attributes described in the text as being applicable to a given entry. Other attributes (both those defined within this document but not explicitly associated with the entry in question, and new, vendor-defined ones) may also appear in a given debugging information entry. Therefore, the list may be taken as instructive, but cannot be considered definitive. In the following table, \addtoindex{DECL} \livetarg{chap:DECL}{} means include all three of the \addtoindex{declaration coordinates} %\addtoindexx{declaration coordinates|see % {DW\_AT\_decl\_file, DW\_AT\_decl\_line, DW\_AT\_decl\_column}} \DWATdeclcolumn, \DWATdeclfile{} and \DWATdeclline. \label{tab:attributesbytag} \setlength{\extrarowheight}{0.1cm} \begin{longtable}{l|p{8cm}} \caption{Attributes by tag value} \\ \hline \bfseries TAG name&\bfseries Applicable attributes\\ \hline \endfirsthead \bfseries TAG name&\bfseries Applicable attributes \\ \hline \endhead \hline \emph{Continued on next page} \endfoot \hline \endlastfoot \DWTAGaccessdeclaration{} &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ \hline \DWTAGarraytype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbitstride{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATordering{} \\ &\DWATrank{} \\ &\DWATsibling{} \\ &\DWATspecification{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGatomictype &\livelink{chap:DECL}{DECL} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGbasetype &\livelink{chap:DECL}{DECL} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbinaryscale{} \\ &\DWATbitoffset{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatabitoffset{} \\ &\DWATdatalocation{} \\ &\DWATdecimalscale{} \\ &\DWATdecimalsign{} \\ &\DWATdescription{} \\ &\DWATdigitcount{} \\ &\DWATencoding{} \\ &\DWATendianity{} \\ &\DWATname{} \\ &\DWATpicturestring{} \\* &\DWATsibling{} \\* &\DWATsmall{} \\* \hline \DWTAGcallsite &\DWATcallcolumn \\* &\DWATcallfile \\* &\DWATcallline \\* &\DWATcallorigin \\ &\DWATcallpc \\ &\DWATcallreturnpc \\ &\DWATcalltailcall \\ &\DWATcalltarget \\* &\DWATcalltargetclobbered \\* &\DWATtype \\* \hline \DWTAGcallsiteparameter &\DWATcalldatalocation \\* &\DWATcalldatavalue \\* &\DWATcallparameter \\* &\DWATcallvalue \\ &\DWATlocation \\ &\DWATname \\* &\DWATsibling \\* &\DWATtype \\* \hline \DWTAGcatchblock &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\ &\DWATentrypc{} \\ &\DWAThighpc{} \\ &\DWATlowpc{} \\ &\DWATranges{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ \hline \DWTAGclasstype &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATaccessibility{} \\* &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATsignature{} \\ &\DWATspecification{} \\ &\DWATstartscope{} \\ &\DWATvisibility{} \\ \hline \DWTAGcoarraytype &\livelink{chap:DECL}{DECL} \\* &\DWATname{} \\* &\DWATdescription{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGcommonblock &\livelink{chap:DECL}{DECL} \\* &\DWATdeclaration{} \\* &\DWATdescription{} \\* &\DWATlinkagename{} \\ &\DWATlocation{} \\ &\DWATname{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATvisibility{} \\ \hline \DWTAGcommoninclusion &\livelink{chap:DECL}{DECL} \\* &\DWATcommonreference{} \\* &\DWATdeclaration{} \\* &\DWATsibling{} \\ &\DWATvisibility{} \\ \hline \DWTAGcompileunit &\DWATaddrbase{} \\ &\DWATbasetypes{} \\ &\DWATcompdir{} \\ &\DWATdwoid{} \\ &\DWATdwoname{} \\ &\DWATentrypc{} \\ &\DWATidentifiercase{} \\ &\DWAThighpc{} \\ &\DWATlanguage{} \\ &\DWATlowpc{} \\ &\DWATmacros{} \\ &\DWATmainsubprogram{} \\ &\DWATname{} \\ &\DWATproducer{} \\ &\DWATranges{} \\ &\DWATrangesbase{} \\ &\DWATsegment{} \\ &\DWATstmtlist{} \\* &\DWATstroffsetsbase{} \\* &\DWATuseUTFeight{} \\ \hline \DWTAGcondition &\livelink{chap:DECL}{DECL} \\ &\DWATname{} \\ &\DWATsibling{} \\ \hline \DWTAGconsttype &\livelink{chap:DECL}{DECL} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGconstant &\livelink{chap:DECL}{DECL} \\* &\DWATaccessibility{} \\* &\DWATconstvalue{} \\* &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATendianity{} \\ &\DWATexternal{} \\ &\DWATlinkagename{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGdwarfprocedure &\DWATlocation{} \\ \hline \DWTAGdynamictype &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin \\* &\DWATallocated \\* &\DWATassociated \\ &\DWATdatalocation \\ &\DWATdescription \\ &\DWATname \\ &\DWATtype \\ &\DWATsibling \\ \hline \DWTAGentrypoint &\livelink{chap:DECL}{DECL} \\ &\DWATaddressclass{} \\ &\DWATdescription{} \\ &\DWATframebase{} \\ &\DWATlinkagename{} \\ &\DWATlowpc{} \\ &\DWATname{} \\ &\DWATreturnaddr{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATstaticlink{} \\ &\DWATtype{} \\ \hline \DWTAGenumerationtype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbitstride{} \\ &\DWATbytesize{} \\ &\DWATbytestride{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATenumclass{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATsignature{} \\ &\DWATspecification{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGenumerator &\livelink{chap:DECL}{DECL} \\ &\DWATconstvalue{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ \hline \DWTAGfiletype &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATallocated{} \\* &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGformalparameter &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATartificial{} \\ &\DWATconstvalue{} \\ &\DWATdefaultvalue{} \\ &\DWATdescription{} \\ &\DWATendianity{} \\ &\DWATisoptional{} \\ &\DWATlocation{} \\ &\DWATname{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATtype{} \\ &\DWATvariableparameter{} \\ \hline \DWTAGfriend &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATfriend{} \\ &\DWATsibling{} \\ \hline % Please keep in synch with DW_TAG_subrange_type. \DWTAGgenericsubrange &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATaccessibility{} \\* &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbitstride{} \\ &\DWATbytesize{} \\ &\DWATbytestride{} \\ &\DWATcount{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATlowerbound{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATthreadsscaled{} \\ &\DWATtype{} \\* &\DWATupperbound{} \\* &\DWATvisibility{} \\ \hline \DWTAGimporteddeclaration &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATdescription{} \\ &\DWATimport{} \\ &\DWATname{} \\* &\DWATsibling{} \\* &\DWATstartscope{} \\* \hline \DWTAGimportedmodule &\livelink{chap:DECL}{DECL} \\* &\DWATimport{} \\* &\DWATsibling{} \\* &\DWATstartscope{} \\ \hline \DWTAGimportedunit &\DWATimport{} \\ \hline \DWTAGinheritance &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATdatamemberlocation{} \\ &\DWATsibling{} \\* &\DWATtype{} \\* &\DWATvirtuality{} \\* \hline \DWTAGinlinedsubroutine &\DWATabstractorigin{} \\ &\DWATcallcolumn{} \\ &\DWATcallfile{} \\ &\DWATcallline{} \\ &\DWATconstexpr{} \\ &\DWATentrypc{} \\ &\DWAThighpc{} \\ &\DWATlowpc{} \\ &\DWATranges{} \\ &\DWATreturnaddr{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATtrampoline{} \\ \hline \DWTAGinterfacetype &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATdescription{} \\ &\DWATname{} \\* &\DWATsibling{} \\* &\DWATstartscope{} \\* \hline \DWTAGlabel &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATdescription{} \\* &\DWATlowpc{} \\ &\DWATname{} \\ &\DWATsegment{} \\ &\DWATstartscope{} \\ &\DWATsibling{} \\ \hline \DWTAGlexicalblock &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATdescription{} \\* &\DWATentrypc{} \\ &\DWAThighpc{} \\ &\DWATlowpc{} \\ &\DWATname{} \\ &\DWATranges{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ \hline \DWTAGmember &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATartificial{} \\ &\DWATbitoffset{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatabitoffset{} \\ &\DWATdatamemberlocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATmutable{} \\ &\DWATname{} \\ &\DWATsibling{} \\* &\DWATtype{} \\* &\DWATvisibility{} \\* \hline \DWTAGmodule &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATentrypc{} \\ &\DWAThighpc{} \\ &\DWATlowpc{} \\ &\DWATname{} \\ &\DWATpriority{} \\ &\DWATranges{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\* &\DWATspecification{} \\* &\DWATvisibility{} \\ \hline \DWTAGnamelist &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATdeclaration{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATvisibility{} \\ \hline \DWTAGnamelistitem &\livelink{chap:DECL}{DECL} \\ &\DWATnamelistitem{} \\ &\DWATsibling{} \\ \hline \DWTAGnamespace &\livelink{chap:DECL}{DECL} \\ &\DWATdescription{} \\ &\DWATextension{} \\ &\DWATname{} \\* &\DWATsibling{} \\* &\DWATstartscope{} \\* \hline \DWTAGpackedtype &\livelink{chap:DECL}{DECL} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGpartialunit &\DWATaddrbase{} \\* &\DWATbasetypes{} \\* &\DWATcompdir{} \\ &\DWATdescription{} \\ &\DWATentrypc{} \\ &\DWATidentifiercase{} \\ &\DWAThighpc{} \\ &\DWATlanguage{} \\ &\DWATlowpc{} \\ &\DWATmacros{} \\ &\DWATmainsubprogram{} \\ &\DWATname{} \\ &\DWATproducer{} \\ &\DWATranges{} \\ &\DWATrangesbase{} \\ &\DWATsegment{} \\ &\DWATstmtlist{} \\ &\DWATstroffsetsbase{} \\ &\DWATuseUTFeight{} \\ \hline \DWTAGpointertype &\livelink{chap:DECL}{DECL} \\* &\DWATaddressclass{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGptrtomembertype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaddressclass{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATcontainingtype{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATtype{} \\ &\DWATuselocation{} \\ &\DWATvisibility{} \\ \hline \DWTAGreferencetype &\livelink{chap:DECL}{DECL} \\* &\DWATaddressclass{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGrestricttype &\livelink{chap:DECL}{DECL} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGrvaluereferencetype &\livelink{chap:DECL}{DECL} \\* &\DWATaddressclass{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGsettype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATstartscope{} \\ &\DWATsibling{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGsharedtype &\livelink{chap:DECL}{DECL} \\* &\DWATcount{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGstringtype &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATaccessibility{} \\* &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATstringlength{} \\* &\DWATstringlengthbitsize{} \\* &\DWATstringlengthbytesize{} \\* &\DWATvisibility{} \\* \hline \DWTAGstructuretype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATsignature{} \\ &\DWATspecification{} \\* &\DWATstartscope{} \\* &\DWATvisibility{} \\* \hline \DWTAGsubprogram &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATaccessibility{} \\ &\DWATaddressclass{} \\ &\DWATartificial{} \\ &\DWATcallingconvention{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATelemental{} \\ &\DWATentrypc{} \\ &\DWATexplicit{} \\ &\DWATexternal{} \\ &\DWATframebase{} \\ &\DWAThighpc{} \\ &\DWATinline{} \\ &\DWATlinkagename{} \\ &\DWATlowpc{} \\ &\DWATmainsubprogram{} \\ &\DWATname{} \\ &\DWATobjectpointer{} \\ &\DWATprototyped{} \\ &\DWATpure{} \\ &\DWATranges{} \\ &\DWATrecursive{} \\ &\DWATreference{} \\ &\DWATreturnaddr{} \\ &\DWATrvaluereference{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATspecification{} \\ &\DWATstartscope{} \\ &\DWATstaticlink{} \\ &\DWATtrampoline{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\* &\DWATvirtuality{} \\* &\DWATvtableelemlocation{} \\* \hline \DWTAGsubrangetype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbitstride{} \\ &\DWATbytesize{} \\ &\DWATbytestride{} \\ &\DWATcount{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATlowerbound{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATthreadsscaled{} \\ &\DWATtype{} \\* &\DWATupperbound{} \\* &\DWATvisibility{} \\ \hline \DWTAGsubroutinetype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATaddressclass{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATprototyped{} \\ &\DWATreference{} \\ &\DWATrvaluereference{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGtemplatealias &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATsignature{} \\ &\DWATstartscope{} \\* &\DWATtype{} \\* &\DWATvisibility{} \\* \hline \DWTAGtemplatetypeparameter &\livelink{chap:DECL}{DECL} \\ &\DWATdefaultvalue{} \\ &\DWATdescription{} \\ &\DWATname{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGtemplatevalueparameter{} &\livelink{chap:DECL}{DECL} \\ &\DWATconstvalue{} \\ &\DWATdefaultvalue{} \\ &\DWATdescription{} \\ &\DWATname{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGthrowntype &\livelink{chap:DECL}{DECL} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATdatalocation{} \\ &\DWATsibling{} \\ &\DWATtype{} \\ \hline \DWTAGtryblock &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATentrypc{} \\ &\DWAThighpc{} \\ &\DWATlowpc{} \\ &\DWATranges{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ \hline \DWTAGtypedef &\livelink{chap:DECL}{DECL} \\* &\DWATabstractorigin{} \\* &\DWATaccessibility{} \\* &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGtypeunit &\DWATlanguage{} \\* &\DWATstmtlist{} \\* &\DWATstroffsetsbase{} \\* &\DWATuseUTFeight{} \\* \hline \DWTAGuniontype &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATallocated{} \\ &\DWATassociated{} \\ &\DWATbitsize{} \\ &\DWATbytesize{} \\ &\DWATdatalocation{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATname{} \\ &\DWATsibling{} \\ &\DWATsignature{} \\ &\DWATspecification{} \\* &\DWATstartscope{} \\* &\DWATvisibility{} \\* \hline \DWTAGunspecifiedparameters &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATartificial{} \\ &\DWATsibling{} \\ \hline \DWTAGunspecifiedtype &\livelink{chap:DECL}{DECL} \\ &\DWATdescription{} \\ &\DWATname{} \\ \hline \DWTAGvariable &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATartificial{} \\ &\DWATconstexpr{} \\ &\DWATconstvalue{} \\ &\DWATdeclaration{} \\ &\DWATdescription{} \\ &\DWATendianity{} \\ &\DWATexternal{} \\ &\DWATlinkagename{} \\ &\DWATlocation{} \\ &\DWATname{} \\ &\DWATsegment{} \\ &\DWATsibling{} \\ &\DWATspecification{} \\ &\DWATstartscope{} \\ &\DWATtype{} \\ &\DWATvisibility{} \\ \hline \DWTAGvariant &\livelink{chap:DECL}{DECL} \\ &\DWATaccessibility{} \\ &\DWATabstractorigin{} \\ &\DWATdeclaration{} \\ &\DWATdiscrlist{} \\* &\DWATdiscrvalue{} \\* &\DWATsibling{} \\* \hline \DWTAGvariantpart &\livelink{chap:DECL}{DECL} \\ &\DWATabstractorigin{} \\ &\DWATaccessibility{} \\ &\DWATdeclaration{} \\ &\DWATdiscr{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGvolatiletype{} &\livelink{chap:DECL}{DECL} \\* &\DWATsibling{} \\* &\DWATtype{} \\* \hline \DWTAGwithstmt &\DWATaccessibility{} \\* &\DWATaddressclass{} \\* &\DWATdeclaration{} \\* &\DWATentrypc{} \\* &\DWAThighpc{} \\* &\DWATlocation{} \\* &\DWATlowpc{} \\* &\DWATranges{} \\* &\DWATsegment{} \\* &\DWATsibling{} \\* &\DWATtype{} \\* &\DWATvisibility{} \\* \end{longtable}

https://sea.theanarchistlibrary.org/library/malaysian-comrades-banner-drop-action-by-malaysian-comrades-en.tex

theanarchistlibrary.org

CC-MAIN-2021-25

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-25/segments/1623487640324.35/warc/CC-MAIN-20210618165643-20210618195643-00637.warc.gz

\documentclass[DIV=12,% BCOR=0mm,% headinclude=false,% footinclude=false,open=any,% fontsize=10pt,% oneside,% paper=210mm:11in]% {scrbook} \usepackage[noautomatic]{imakeidx} \usepackage{microtype} \usepackage{graphicx} \usepackage{alltt} \usepackage{verbatim} \usepackage[shortlabels]{enumitem} \usepackage{tabularx} \usepackage[normalem]{ulem} \def\hsout{\bgroup \ULdepth=-.55ex \ULset} % https://tex.stackexchange.com/questions/22410/strikethrough-in-section-title % Unclear if \protect \hsout is needed. Doesn't looks so \DeclareRobustCommand{\sout}[1]{\texorpdfstring{\hsout{#1}}{#1}} \usepackage{wrapfig} % avoid breakage on multiple <br><br> and avoid the next [] to be eaten \newcommand*{\forcelinebreak}{\strut\\*{}} \newcommand*{\hairline}{% \bigskip% \noindent \hrulefill% \bigskip% } % reverse indentation for biblio and play \newenvironment*{amusebiblio}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newenvironment*{amuseplay}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newcommand*{\Slash}{\slash\hspace{0pt}} % http://tex.stackexchange.com/questions/3033/forcing-linebreaks-in-url \PassOptionsToPackage{hyphens}{url}\usepackage[hyperfootnotes=false,hidelinks,breaklinks=true]{hyperref} \usepackage{bookmark} \usepackage{fontspec} \usepackage{polyglossia} \setmainlanguage{english} \setmainfont{FreeSerif.otf}[Script=Latin,% Ligatures=TeX,% Path=/usr/share/fonts/opentype/freefont/,% BoldFont=FreeSerifBold.otf,% BoldItalicFont=FreeSerifBoldItalic.otf,% ItalicFont=FreeSerifItalic.otf] \setmonofont{cmuntt.ttf}[Script=Latin,% Ligatures=TeX,% Scale=MatchLowercase,% Path=/usr/share/fonts/truetype/cmu/,% BoldFont=cmuntb.ttf,% BoldItalicFont=cmuntx.ttf,% ItalicFont=cmunit.ttf] \setsansfont{cmunss.ttf}[Script=Latin,% Ligatures=TeX,% Scale=MatchLowercase,% Path=/usr/share/fonts/truetype/cmu/,% BoldFont=cmunsx.ttf,% BoldItalicFont=cmunso.ttf,% ItalicFont=cmunsi.ttf] \newfontfamily\englishfont{FreeSerif.otf}[Script=Latin,% Ligatures=TeX,% Path=/usr/share/fonts/opentype/freefont/,% BoldFont=FreeSerifBold.otf,% BoldItalicFont=FreeSerifBoldItalic.otf,% ItalicFont=FreeSerifItalic.otf] \renewcommand*{\partpagestyle}{empty} % global style \pagestyle{plain} \usepackage{indentfirst} % remove the numbering \setcounter{secnumdepth}{-2} % remove labels from the captions \renewcommand*{\captionformat}{} \renewcommand*{\figureformat}{} \renewcommand*{\tableformat}{} \KOMAoption{captions}{belowfigure,nooneline} \addtokomafont{caption}{\centering} \deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~} \addtokomafont{disposition}{\rmfamily} \addtokomafont{descriptionlabel}{\rmfamily} \frenchspacing % avoid vertical glue \raggedbottom % this will generate overfull boxes, so we need to set a tolerance % \pretolerance=1000 % pretolerance is what is accepted for a paragraph without % hyphenation, so it makes sense to be strict here and let the user % accept tweak the tolerance instead. \tolerance=200 % Additional tolerance for bad paragraphs only \setlength{\emergencystretch}{30pt} % (try to) forbid widows/orphans \clubpenalty=10000 \widowpenalty=10000 % given that we said footinclude=false, this should be safe \setlength{\footskip}{2\baselineskip} \title{Banner Drop Action by Malaysian Comrades} \date{October 2020} \author{Malaysian Comrades} \subtitle{} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={Banner Drop Action by Malaysian Comrades},% pdfauthor={Anonymous},% pdfsubject={},% pdfkeywords={Malaysia; protest}% } \begin{document} \begin{titlepage} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge Banner Drop Action by Malaysian Comrades\par}}% \vskip 1em \vskip 2em {\usekomafont{author}{Malaysian Comrades\par}}% \vskip 1.5em \vfill {\usekomafont{date}{October 2020\par}}% \end{center} \end{titlepage} \cleardoublepage \tableofcontents % start a new right-handed page \cleardoublepage \section{English} We were told by friends in Malaysia that the transmission of the COVID-19 pandemic has gradually subsided since the pandemic struck earlier this year. Until the \href{https://www.nst.com.my/news/nation/2020/10/630119/pm-sabah-election-was-unavoidable}{Sabah state election was held on September 26}. Power-mad politicians have campaigned in Sabah which at that time was spreading brutally this pandemic. Politicians from Peninsular Malaysia, who originally came from controlled areas, entered Sabah which at the time was experiencing a contagious outbreak had campaigned to ensure their party won. And then \href{https://www.malaymail.com/news/malaysia/2020/10/05/from-the-east-coast-to-varsities-list-of-places-covid-positive-minister-zul/1909813}{brought the epidemic of the disease back to the Peninsular} thus triggering new infections and clusters when the virus spreads again. As a result of politicians not taking care of these SOPs and quarantine, the situation in Malaysia today is getting worse where the people are restless with the new wave that is hitting soon. Politicians are blaming the people again for the new wave as if the people are not following the SOP and social distancing. Malaysians to some extent began to reject these irresponsible politicians because they did not take seriously the issue of involving the health of the people. The people are fed up with dirty politics and political coups that are more important than the health of the people. Because of that, the people began to show their dissatisfaction through various mediums, to make politicians aware of the courage to take responsibility for the no and the mistakes they have made. Friends there demanded that these politicians step down from their respective seats because they had failed in managing the well-being of the people. \emph{Salute Malaysian friends!} \section{Bahasa Melayu} Kami diberitahu oleh kawan-kawan di Malaysia bahawa penularan pandemik COVID-19 telah beransur reda sejak pandemik melanda awal tahun ini. https:\Slash{}\Slash{}www.nst.com.my\Slash{}news\Slash{}nation\Slash{}2020\Slash{}10\Slash{}630119\Slash{}pm-sabah-election-was-unavoidablePolitikus-politikus dari Semenanjung Malaysia, yang asalnya datang dari kawasan yang terkawal, memasuki Sabah yang pada ketika itu sedang mengalami penularan wabak telah turun berkempen bagi memastikan parti mereka menang. Dan kemudiannya membawa pulang wabak penyakit ini semula ke Semenanjung sehingga mencetuskan penularan dan kluster baharu apabila virus tersebut merebak semula. Akibat politikus yang tidak menjaga SOP dan kuarantin ini, keadaan Malaysia hari ini semakin meruncing di mana rakyat kembali gelisah dengan gelombang baru yang melanda. Politikus-politikus akhirnya menyalahkan rakyat semula akibat penularan kembali seolah-olah rakyat yang tidak mengikuti SOP dan penjarakkan sosial. Rakyat Malaysia sedikit sebanyak mula menolak ahli-ahli politik yang tidak bertanggungjawab ini kerana tidak memandang serius tentang perihal melibatkan kesihatan rakyat. Rakyat sudah muak dengan politik kotor dan rampasan kuasa politik yang lebih diutamakan berbanding kesihatan rakyat. Kerana itu rakyat mula menunjukkan rasa ketidakpuasan hati mereka melalui pelbagai medium, untuk menyedarkan politikus agar berani bertanggungjawab atas tidakkan dan kesalahan yang telah mereka lakukan. Kawan-kawan di sana menuntut agar politikus ini berundur dari kerusi masing-masing kerana mereka telah gagal dalam mengendali kesejahteraan rakyat. \emph{Salut Rakyat Malaysia!} \section{Banner Drops} \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-1.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-2.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-3.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-4.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-5.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-6.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-8.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-9.jpg} \end{figure} \clearpage \begin{figure}[p] \centering \includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{m-c-malaysian-comrades-banner-drop-action-by-malay-10.jpg} \end{figure} \clearpage % begin final page \clearpage % new page for the colophon \thispagestyle{empty} \begin{center} \smallskip Anti-Copyright \bigskip \includegraphics[width=0.25\textwidth]{/var/lib/amusewiki/repo/sea/site_files/sea_pdf_image.png} \bigskip \end{center} \strut \vfill \begin{center} Malaysian Comrades Banner Drop Action by Malaysian Comrades October 2020 \bigskip https:\Slash{}\Slash{}bandilangitim.noblogs.org\Slash{}2020\Slash{}10\Slash{}08\Slash{}banner-drop-action-by-malaysian-comrades\Slash{} \bigskip \textbf{sea.theanarchistlibrary.org} \end{center} % end final page with colophon \end{document} % No format ID passed.

https://ctan.math.utah.edu/ctan/tex-archive/macros/latex/contrib/europasscv/example/europasscv_bib_en.tex

utah.edu

CC-MAIN-2022-27

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103036099.6/warc/CC-MAIN-20220625190306-20220625220306-00035.warc.gz

% !TEX encoding = UTF-8 % !TEX program = pdflatex % !TEX spellcheck = en_GB \documentclass[english,a4paper]{europasscv} \usepackage[english]{babel} \usepackage[backend=biber,autolang=hyphen,sorting=none,style=numeric,maxbibnames=99,doi=false,isbn=false,maxcitenames=2]{biblatex} \usepackage{csquotes} \usepackage{europasscv-bibliography} \bibliography{europasscv_example} % in the bibliography, mark all occurrences in bold: \ecvbibhighlight{Smith Testington}{Katie Middlename}{K. M.} \ecvname{Katie Smith} \ecvaddress{12 Strawberry Hill, Dublin 8 Éire/Ireland} \ecvmobile{+353 555 123 555} \ecvtelephone{+353 127 6689} \ecvworkphone{+353 999 888 777} \ecvemail{smith@kotmail.com another@email.com} \ecvhomepage{www.myhomepage.com www.another-homepage.com} % \ecvgitpage{www.git.example.org} % \ecvgithubpage{www.github.com/smith} % \ecvgitlabpage{www.gitlab.com/smith} % \ecvlinkedinpage{www.linkedin.com/in/katie-smith} % \ecvorcid[label, link]{0000-0000-0000-0000} \ecvim{AOL Messenger}{katie.smith} \ecvim{Google Talk}{ksmith} % \ecvgender{Female} \ecvdateofbirth{1 March 1975} \ecvnationality{Irish} % \ecvpicture[width=3.8cm]{picture.jpg} % \date{} \begin{document} \begin{europasscv} \ecvpersonalinfo \ecvbigitem{Job applied for}{European project manager} \ecvsection{Work experience} \ecvtitle{August 2002 -- Present}{Independent consultant} \ecvitem{}{National Youth Council of Ireland\newline 3 Montague Street, Dublin 2, D02 V327, Ireland} \ecvitem{}{Evaluation of European Commission youth training support measures for youth national agencies and young people} \ecvtitle{March 2002 -- July 2002}{Internship} \ecvitem{}{European Commission, Youth Unit, DG Education and Culture \newline 200, Rue de la Loi, 1049 Brussels (Belgium)} \ecvitem{}{ \begin{ecvitemize} \item evaluating youth training programmes and the partnership between the Council of Europe and European Commission \item organizing and running a 2 day workshop on non-formal education for Action 5 large scale projects focusing on quality, assessment and recognition \item contributing to the steering sroup on training and developing action plans on training for the next 3 years. Working on the Users Guide for training and the support measures \end{ecvitemize} } \ecvitem{}{\ecvhighlight{Business or sector}\quad European institution} \ecvtitle{Oct 2001 -- Feb 2002}{Researcher / Independent Consultant} \ecvitem{}{Council of Europe, Budapest (Hungary)} \ecvitem{}{Working in a research team carrying out in-depth qualitative evaluation of the 2 year Advanced Training of Trainers in Europe using participant observations, in-depth interviews and focus groups. Work carried out in training courses in Strasbourg, Slovenia and Budapest.} \ecvsection{Education and training} \ecvtitlelevel{1997--2001}{PhD - Thesis Title: ``Young People in the Construction of the Virtual University'', Empirical research on e-learning}{ISCED~6} \ecvitem{}{Trinity College Dublin, The University of Dublin, Ireland This is a citation to my PhD Thesis \cite{smith_phd}.} \ecvtitle{1993--1997}{Bachelor of Science in Sociology and Psychology} \ecvitem{}{Trinity College Dublin, The University of Dublin, Ireland} \ecvitem{}{ \begin{ecvitemize} \item sociology of risk \item sociology of scientific knowledge / information society \item anthropology \item E-learning and Psychology \item research methods \end{ecvitemize} } \pagebreak \ecvsection{Personal skills} \ecvmothertongue{English} \ecvlanguageheader \ecvlanguage{French}{C1}{C2}{B2}{C1}{C2} \ecvlanguagecertificate{Diplôme d'études en langue française (DELF) B1} \ecvlastlanguage{German}{A2}{A2}{A2}{A2}{A2} \ecvlanguagefooter \ecvblueitem{Communication skills}{ \begin{ecvitemize} \item team work: I have worked in various types of teams from research teams to national league hockey. For 2 years I coached my university hockey team \item mediating skills: I work on the borders between young people, youth trainers, youth policy and researchers, for example running a 3 day workshop at CoE Symposium ``Youth Actor of Social Change'', and my continued work on youth training programmes \item intercultural skills: I am experienced at working in a European dimension such as being a rapporteur at the CoE Budapest ``youth against violence seminar'' and working with refugees. \end{ecvitemize} } \ecvblueitem{Organisational / managerial skills}{ \begin{ecvitemize} \item whilst working for a Brussels based refugee NGO ``Convivial'' I organized a ``Civil Dialogue'' between refugees and civil servants at the European Commission 20th June 2002 \item during my PhD I organised a seminar series on research methods \end{ecvitemize} } \ecvdigitalcompetence{\ecvBasic}{\ecvIndependent}{\ecvProficient}{\ecvIndependent}{\ecvBasic} \ecvblueitem{Computer skills}{ \begin{ecvitemize} \item competent with most Microsoft Office programmes \item experience with HTML \end{ecvitemize} } \ecvblueitem{Other skills}{Creating pieces of Art and visiting Modern Art galleries. Enjoy all sports particularly hockey, football and running. Love to travel and experience different cultures.} \ecvblueitem{Driving licence}{A, B} \nocite{*} \renewcommand{\section}[2]{\ecvsection{#2}} \printbibtabular[title=Publications] \end{europasscv} \end{document}

http://dlmf.nist.gov/28.23.E9.tex

nist.gov

CC-MAIN-2015-32

application/x-tex

crawl-data/CC-MAIN-2015-32/segments/1438042989826.86/warc/CC-MAIN-20150728002309-00039-ip-10-236-191-2.ec2.internal.warc.gz

\[\mathop{{\mathrm{Mc}^{(j)}_{2m+1}}\/}\nolimits\!\left(z,h\right)=(-1)^{m+1}% \left({\mathop{\mathrm{ce}_{2m+1}\/}\nolimits^{\prime}}\!\left(\tfrac{1}{2}\pi% ,h^{2}\right)\right)^{-1}\mathop{\coth\/}\nolimits z\sum_{\ell=0}^{\infty}(2% \ell+1)A_{2\ell+1}^{2m+1}(h^{2}){\cal C}_{2\ell+1}^{(j)}(2h\mathop{\sinh\/}% \nolimits z),\]

https://doc.libelektra.org/api/current/latex/doc_help_elektra-spec_md.tex

libelektra.org

CC-MAIN-2020-10

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2020-10/segments/1581875146647.82/warc/CC-MAIN-20200227033058-20200227063058-00000.warc.gz

spec is a special namespace that describes via metadata the semantics of individual keys. Most importantly it\+: \begin{DoxyEnumerate} \item describes which keys are of interest to the application \item describes the metadata to be copied to every key \item describes how the cascading lookup works \item describes the mount points including the plugins needed for them \end{DoxyEnumerate} It is, however, not limited to this but can express any other key database semantics (new plugins might be necessary, though). The most simple use is to enlist all keys that will be used by an application and maybe give a description for them (we use ini syntax in this document)\+: \begin{DoxyCode}{0} \DoxyCodeLine{[mykey]} \DoxyCodeLine{} \DoxyCodeLine{[folder/anotherkey]} \DoxyCodeLine{description = set this key if you want another behavior} \end{DoxyCode} So Keys in {\ttfamily spec} allow us to specify which keys are read by the application. The description key will be copied (referred to) to {\ttfamily folder/anotherkey} of any namespace, so that it can easily be accessed. Other features are directly implemented in {\ttfamily ks\+Lookup}. When cascading keys (those starting with {\ttfamily /}) are used following features are now available (in the metadata of respective {\ttfamily spec}-\/keys)\+: \begin{DoxyItemize} \item {\ttfamily override/\#}\+: use these keys {\itshape in favor} of the key itself (note that {\ttfamily \#} is the syntax for arrays, e.\+g. {\ttfamily \#0} for the first element, {\ttfamily \#\+\_\+10} for the 11th and so on) \item {\ttfamily namespace/\#}\+: instead of using all namespaces in the predefined order, one can specify which namespaces should be searched in which order \item {\ttfamily fallback/\#}\+: when no key was found in any of the (specified) namespaces the {\ttfamily fallback}-\/keys will be searched \item {\ttfamily default}\+: this value will be used if nothing else was found \end{DoxyItemize} E.\+g. \begin{DoxyCode}{0} \DoxyCodeLine{[promise]} \DoxyCodeLine{default=20} \DoxyCodeLine{fallback/\#0=/somewhere/else} \DoxyCodeLine{namespace/\#0=user} \end{DoxyCode} \begin{DoxyEnumerate} \item When this file is mounted to {\ttfamily spec/sw/app/\#0} we specify, that for the key {\ttfamily /sw/app/\#0/promise} only the namespace {\ttfamily user} should be used. \item If this key was not found, but {\ttfamily /somewhere/else} is present, we will use this key instead. The {\ttfamily fallback} technique is very powerful\+: it allows us to have (recursive) links between applications. In the example above, the application is tricked in receiving e.\+g. the key {\ttfamily user/somewhere/else} when {\ttfamily promise} was not available. \item The value {\ttfamily 20} will be used as default, even if no configuration file is found. \end{DoxyEnumerate} Note that the fallback, override and cascading works on {\itshape key level}, and not like most other systems have implemented, on configuration {\itshape file level}. You can tag any key using the {\ttfamily check} metadata so that it will be validated. For example\+: \begin{DoxyCode}{0} \DoxyCodeLine{[folder/anotherkey]} \DoxyCodeLine{check/validation = abc.*} \DoxyCodeLine{check/validation/message = def does not start with abc} \end{DoxyCode} In the spec namespace you can also specify mount points. First you need the metakey {\ttfamily mountpoint} and a configuration file name. Otherwise, it basically works in the same way as the contracts in plugins using {\ttfamily infos} and {\ttfamily config}\+: \begin{DoxyCode}{0} \DoxyCodeLine{[]} \DoxyCodeLine{mountpoint=file.abc} \DoxyCodeLine{config/plugin/code/escape = 40} \DoxyCodeLine{config/plugin/lua\#abc/script = abc\_storage.lua} \DoxyCodeLine{infos/author = Markus Raab} \DoxyCodeLine{infos/needs = resolver\_abc rename code lua\#abc} \DoxyCodeLine{infos/recommends = hexcode} \end{DoxyCode} \begin{DoxyItemize} \item \mbox{\hyperlink{doc_tutorials_application-integration_md}{see application integration tutorial (towards end)}} \item \mbox{\hyperlink{doc_tutorials_namespaces_md}{see namespaces tutorial}} \item \mbox{\hyperlink{doc_help_elektra-namespaces_md}{elektra-\/namespaces(7)}} \item \mbox{\hyperlink{doc_help_elektra-cascading_md}{elektra-\/cascading(7)}} \end{DoxyItemize}

http://parnaseo.uv.es/RefBase/search.php?sqlQuery=SELECT%20author%2C%20title%2C%20type%2C%20year%2C%20publication%2C%20abbrev_journal%2C%20volume%2C%20issue%2C%20pages%2C%20keywords%2C%20abstract%2C%20thesis%2C%20editor%2C%20publisher%2C%20place%2C%20abbrev_series_title%2C%20series_title%2C%20series_editor%2C%20series_volume%2C%20series_issue%2C%20edition%2C%20language%2C%20author_count%2C%20online_publication%2C%20online_citation%2C%20doi%2C%20serial%2C%20area%20FROM%20refs%20WHERE%20serial%20%3D%201651%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=25&rowOffset=&wrapResults=1&citeOrder=&citeStyle=PARNASEO&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

uv.es

CC-MAIN-2022-21

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2022-21/segments/1652662521041.0/warc/CC-MAIN-20220518021247-20220518051247-00542.warc.gz

%&LaTeX \documentclass{article} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{Carrasco2000} Carrasco, F. (2000). Celestina como libro sagrado: Perspectivas de su recepci{\'o}n en el siglo XVI. En M. Freixas, \& S. Iriso Ariz (Eds.), \textit{Actas del VIII Congreso Internacional de la AHLM} (pp. 515--522). Santander: Consejer{\'\i}a de Cultura de Cantabria. \end{thebibliography} \end{document}

https://kylebarbour.org/pub/cv-kylebarbour.tex

kylebarbour.org

CC-MAIN-2021-17

application/octet-stream

application/x-tex

crawl-data/CC-MAIN-2021-17/segments/1618038056869.3/warc/CC-MAIN-20210410105831-20210410135831-00506.warc.gz

\documentclass{kyle-cv} \author{Kyle Barbour} \title{CV: Kyle Barbour} \name{Kyle Barbour, MD} \email{kyle\_barbour@urmc.rochester.edu} \phone{(415) 238-9953} \addr{601 Elmwood Ave. Box 655} \city{Rochester, NY 14642} \www{https://kylebarbour.org} \begin{document} \myheader %%%%%%%%%%%%%%%%%%%% \section{Education} %%%%%%%%%%%%%%%%%%%% \begin{itemize} \job{University of Rochester Department of Emergency Medicine}{Rochester, NY}{Residency, Emergency Medicine}{(expected) 2021} \begin{work} \item{Member, buprenorphine induction and naloxone distribution guideline committee} \end{work} \job{University of California, Irvine School of Medicine}{Irvine, CA}{MD}{2018} \begin{work} \item{Graduation with distinction in service} \item{Gold Humanism Honor Society, Senior Humanitarian Award} \item{ACEP National Outstanding Medical Student} \item{ Committee member: Honors and Promotions; Peer Review (elected conflict resolution body); Associated Medical Student Government} \item{Emergency Medicine Interest Group: Senior Student Advisor (2017 -- 2018), VP Advising (2016 -- 2017), VP Operations (2015 -- 2016)} \end{work} \job{University of California, Berkeley}{Berkeley, CA}{BA, Molecular and Cell Biology, Neurobiology Emphasis}{2012} \begin{work} \item{Highest distinction in general scholarship} \item{Honors in Molecular and Cell Biology, research thesis: ``Long-term effects of neonatal sevoflurane on recognition memory in rats,'' Stratmann Laboratory} \end{work} \end{itemize} %%%%%%%%%%%%%%%%%%%% \section{Experience} %%%%%%%%%%%%%%%%%%%% \begin{itemize} \job{Orange County Needle Exchange Program (OCNEP)}{Santa Ana, CA}{Founder, Board of Directors and Steering Committee Member}{October 2014 -- May 2018} \begin{work} \item{Led and designed the implementation of the first needle exchange in Orange County, raising over \$170,000, ensuring financial and organizational sustainability, earning 501(c)(3) nonprofit status, building relationships with city authorities, public health, media, police, and other key stakeholders, and becoming the first program to be certified by the California Department of Public Health} \item{Oversaw cultural, logistical, operational, financial, overdose prevention, community engagement, and media program arms; all organized on democratic lines} \item{Built strong community coalition of injection drug users, homeless individuals, faculty, community members, elected officials, law enforcement, students, neighborhood organizations, and other needle exchanges to develop program while maintaining a strong harm reduction orientation} \item{Established multiple public health research studies regarding efficacy of needle exchanges on improving safe disposal of used needles, understanding needs of injection drug users, and building naloxone distribution overdose prevention programs} \end{work} \job{San Francisco Suicide Prevention}{San Francisco, CA}{Hotline Counselor}{August 2012 -- July 2014} \begin{work} \item{Trained new counselors, provided emotional support and emergency intervention for individuals from around the world in suicidal and mental health crises via telephone and internet chat counseling} \item{Provided social service referrals, HIV/AIDS-related emotional support, and substance use support through the 211, San Francisco Behavioral Health Access, HIV/AIDS Nightline, and Drug and Relapse hotlines} \end{work} \job{Marin General Hospital Emergency Department}{Greenbrae, CA}{Emergency Department Technician}{July 2012 -- July 2014} \begin{work} \item{Provided emergency medical care, assessment, and assistance with triage of patients in a team-based emergency department and trauma center} \item{Frequently practiced skills included patient assessment, triage assistance, wound care, splinting, ECGs, patient monitoring, and assistance with sterile procedures, among other skills} \end{work} \job{Bay Area Mountain Rescue Unit (BAMRU)}{Stanford, CA}{EMT, Operations Officer, Field Member}{May 2011 -- July 2014} \begin{work} \item{Third highest ranking unit member, responsible for overseeing the safety, efficacy, and efficiency of all BAMRU operations} \item{Operations leader and active member on missing person and evidence search missions in mountainous, high altitude, snow and ice, wilderness, and urban environments} \item{Thousands of hours of searches and trainings, fully endorsed in all wilderness search techniques, leader of technical rescue, search operations, and wilderness travel trainings; member of the technical standards committee, former maintainer of unit activity records} \end{work} \job{Black Rock City Emergency Services}{Black Rock City, NV}{EMT, 911 Dispatcher}{August -- September 2011 -- 2015} \begin{work} \item{Treat medical emergencies in the field and clinic at Burning Man, a 50,000+ person event in the Nevada desert} \item{911 dispatcher for medical, fire, and law enforcement emergencies} \end{work} \job{University of California, San Francisco Department of Anesthesia}{San Francisco, CA}{Research Assistant, Stratmann Laboratory}{October 2010 -- May 2012} \begin{work} \item{Designed, managed, and executed a research project on the effects of neonatal sevoflurane on postnatal neuron development} \item{Collaborator on several projects related to the long-term neurocognitive and memory effects of neonatal general anesthesia in rats} \item{Techniques included tissue preparation and examination, animal handling, and multiple behavioral and cognitive testing tasks, among others} \end{work} \job{California Explorer Search and Rescue}{San Mateo, CA}{EMT, Search and Rescue Technician}{September 2005 -- May 2012} \begin{work} \item{Team leader and active member on missing person search missions in wilderness and urban environments; promoted to Certified Member, highest unit rank} \item{Completed over 400 hours of searches and training, including specialized training in navigation and search strategy} \end{work} \end{itemize} %%%%%%%%%%%%%%%%%%%% \section{Academic publications {\hfill \scriptsize \em \href{http://orcid.org/0000-0002-4751-0302}{ORCID: 2-4751-0302}}} %%%%%%%%%%%%%%%%%%%% \begin{olindent} \item McQuade M, \textbf{Barbour K}, Betstadt S, Harrington A (2019). Intubation and intensive care after laminaria anaphylaxis in second trimester abortion. \textit{American Journal of Emergency Medicine}, in press. doi: \href{https://doi.org/10.1016/j.ajem.2019.158409}{10.1016/j.ajem.2019.158409} \item \textbf{Barbour K}$^*$, McQuade M$^*$, Somasundaram S, Chakravarthy B (2018). Emergency physician resistance to a take-home naloxone program led by community harm reductionists. \textit{American Journal of Emergency Medicine}, 36(11): 2110 -- 2112. doi: \href{https://doi.org/10.1016/j.ajem.2018.03.036}{10.1016/j.ajem.2018.03.036} \item \textbf{Barbour K}, Pe\~na J (2018). Pediatric pulmonary abscess. \textit{Journal of Education and Teaching in Emergency Medicine}, 3(2): V41--42. doi: \href{https://doi.org/10.21980/J83S6Q}{10.21980/J83S6Q} \item \textbf{Barbour K}, McQuade M, Brown B (2017). Students as effective harm reductionists and needle exchange organizers. \textit{Substance Abuse Treatment, Prevention, and Policy}, 12(1): 15. doi: \href{https://doi.org/10.1186/s13011-017-0099-0}{10.1186/s13011-017-0099-0} \item Stratmann G, Lee J, Sall JW, \ldots, \textbf{Barbour K} (22/34), \ldots Ghetti S (2014). Effect of general anesthesia in infancy on long-term recognition memory in humans and rats. \textit{Neuropsychopharmacology}, 39(10): 2275 -- 2287. doi: \href{https://doi.org/10.1038/npp.2014.134}{10.1038/npp.2014.134} \item Ramage TM, Chang FL, Shih J, \ldots, \textbf{Barbour K} (7/20), \ldots Sall JW (2013). Distinct long-term neurocognitive outcomes after equipotent sevoflurane or isoflurane anesthesia of immature rats. \textit{British Journal of Anaesthesia}, 110(S1): i39 -- i46. doi: \href{https://doi.org/10.1093/bja/aet103}{10.1093/bja/aet103} \end{olindent} \fn{*}{indicates joint first authorship.} %%%%%%%%%%%%%%%%%%%% \section{Other publications} %%%%%%%%%%%%%%%%%%%% \begin{olindent} \item AIDS United, HRH413 (Ford Z, Tilley J, \textbf{Barbour K}, Giambrone A, Fuller NM, Hashmall S, contributing authors and editors). \href{https://www.aidsunited.org/webinars/developing-media-strategies-for-ssps}{The right hit: developing effective media strategies at syringe services programs}. \textit{AIDS United}. April 18, 2019. \item \textbf{Barbour K}. \href{http://www.huffingtonpost.com/kyle-barbour/landmark-decision-opens-f b 9224494.html}{Landmark decision opens first needle exchange in conservative Orange County}. \textit{Huffington Post}. February 13, 2016. \item \textbf{Barbour K}. \href{http://www.huffingtonpost.com/kyle-barbour/harm-reduction-is-essenti b 8359864.html}{Harm reduction is essential to combat the addiction epidemic}. \textit{Huffington Post}. October 22, 2015. \end{olindent} %%%%%%%%%%%%%%%%%%%% \section{Selected presentations} %%%%%%%%%%%%%%%%%%%% \begin{olindent} \item Ford Z, Tilley J, \textbf{Barbour K}, Giambrone A, Fuller NM, Hashmall S. \href{https://www.aidsunited.org/webinars/developing-media-strategies-for-ssps}{The right hit: developing effective media strategies at syringe services programs}. Webinar presenter. AIDS United, 2019. \item \textbf{Barbour K} and McQuade M, Mogi J, Louthan M, Butler K, Alarc\'on J, Brown B. Choices and perspectives of people who inject drugs on syringe litter in resource-poor settings without safe disposal options (also called \textit{Syringe litter: mythology, blame, and power}, with Augustine D, Newark C). Presenter. National Harm Reduction Conference, New Orleans, 2018. \item Newark C, McQuade M, Laguna S, \textbf{Barbour K}, Augustine D. ``You're just little girls'': handling hostility from police and other authorities against harm reduction programs. Roundtable facilitator. National Harm Reduction Conference, New Orleans, 2018. \item Ziegenhorn S, \textbf{Barbour K}, McQuade M, Tookes H. Leveraging ``legitimacy'': growing radical harm reduction advocates among medical students and physicians. Presenter. National Harm Reduction Conference, New Orleans, 2018. \item \textbf{Barbour K}, McQuade M, Somasundaram S, Chakravarthy B. Facilitating an emergency department take-home naloxone program through involvement of community-based harm reductionists. Presenter. American College of Emergency Physicians Scientific Assembly, Washington DC, 2017. Abstract in \textit{Annals of Emergency Medicine}, 70(4): S168. doi: \href{https://doi.org/10.1016/j.annemergmed.2017.07.310}{10.1016/j.annemergmed.2017.07.310} \item \textbf{Barbour K}, McQuade M. Building a needle exchange in the desert: community, legal, and operational aspects of the Orange County Needle Exchange Program (OCNEP). Presenter. National Harm Reduction Conference, San Diego, 2016. \item Showalter D, \textbf{Barbour K}, Wilson B. Volunteers, collectives, and outlaws: supporting informal harm reduction in a period of partial mainstreaming. Roundtable facilitator. National Harm Reduction Conference, San Diego, 2016. \item \textbf{Barbour K}, McQuade M, Alarc\'on J, Ewald I, Brown B. Obstacles in harm reduction implementation: lessons from founding the Orange County Needle Exchange Program. Presenter. American Public Health Association Annual Meeting, Chicago, 2015. \item McQuade M, \textbf{Barbour K}, Alarc\'on J, Ewald I, Brown B. Clean needles save lives: a conversation about needle exchange. Presenter. Substance Use Disorders Statewide Conference, Garden Grove, 2015.\end{olindent} %%%%%%%%%%%%%%%%%%%% \section{Selected teaching} %%%%%%%%%%%%%%%%%%%% \begin{ol} \item Emergency department buprenorphine induction (in a nutshell). Lecturer. University of Rochester Department of Emergency Medicine, Rochester, 2019. \item Intravenous line placement. Instructor, Emergency Medicine Procedural Experience. University of Rochester School of Medicine, Rochester, 2018. \itemrange{1} Harm reduction, structural violence, and student activism. Guest lecturer. California State University, Fullerton Department of Sociology, Fullerton, 2017, 2018. \item Sexually transmitted infections and HIV/AIDS. Guest lecturer. East Los Angeles College, Los Angeles, 2017. \itemrange{1} Introduction to harm reduction and needle exchange. Guest lecturer. University of California, Irvine Department of Anthropology, Irvine, Mar 2016, Nov 2016. \item Harm reduction as solidarity in practice. Guest lecturer. University of Southern California School of Social Work, Irvine, 2016. \itemrange{1} Culturally-aware harm reduction practices with people who use drugs and sex workers. Instructor. Orange County Needle Exchange Program training seminar, Irvine, 2015, 2016. \item FAST scan. Instructor. Ultrafest, University of California, Irvine School of Medicine, Irvine, 2016. \item Ultrasound elective. Course instructor. University of California, Irvine School of Medicine, Irvine, 2015 -- 2016. \item Cardiac ultrasound. Instructor. Ultrafest, University of California, Irvine School of Medicine, Irvine, 2015. \item Harm reduction and needle exchange mentorship. Instructor. Orange County Needle Exchange Program, Santa Ana, 2015 -- 2018. \end{ol} %%%%%%%%%%%%%%%%%%%% \section{Selected media interviews} %%%%%%%%%%%%%%%%%%%% \begin{olindent} \item Wiley, Michelle. \href{https://www.kqed.org/news/11659999/orange-countys-only-needle-exchange-program-seeks-to-go-mobile}{Orange County's only needle exchange program seeks to go mobile}. Radio interview. \textit{California Report}, KQED NPR, April 5, 2018. \item Carreon, Mary. \href{http://www.ocweekly.com/news/orange-countys-first-needle-exchange-tries-to-bring-hope-to-a-wretched-situation-7792505}{Piercing the problem: Orange County's first needle exchange tries to bring hope to a wretched situation}. Front page interview. \textit{Orange County Weekly}, January 5, 2017. \item Chandler, Jenna. \href{http://www.ocregister.com/articles/drug-716050-county-overdoses.html}{Fatal drug overdoses reach 10-year high in Orange County}. Interview. \textit{Orange County Register}, May 16, 2016. \item Banerjee, Dhruba. \href{https://pillsonkuci.wordpress.com/2016/03/02/march-1-kyle-and-marissa/}{Kyle and Marissa, Orange County Needle Exchange Program}. Radio interview. \textit{PILLS}, KUCI, March 1, 2016. \item Kandil, Caitlin Yoshiko. \href{http://www.latimes.com/socal/weekend/news/tn-wknd-et-0221-needle-exchange-20160219-story.html}{County gets its first needle-exchange program}. Interview. \textit{Los Angeles Times}, February 19, 2016. \item Chandler, Jenna. \href{http://www.ocregister.com/articles/orange-704319-county-syringes.html}{Volunteers to distribute clean needles to drug users in Santa Ana}. Interview. \textit{Orange County Register}, February 16, 2016. \item Carreon, Mary. \href{http://www.ocweekly.com/news/oc-makes-history-with-first-needle-exchange-program-6976736}{OC makes history with first needle exchange program}. Interview. \textit{Orange County Weekly}, February 16, 2016. \item Rodriguez, Sal. \href{http://www.ocregister.com/articles/drug-689383-health-public.html}{O.C. overdue for a needle-exchange program}. Interview. \textit{Orange County Register}, October 27, 2015. \item Newell, Shane. \href{http://www.ocregister.com/articles/exchange-670503-needle-santa.html}{State denies county's first needle exchange program in Santa Ana; organizers might appeal}. Interview. \textit{Orange County Register}, July 7, 2015. \item Iverson, Dave. \href{http://www.ocregister.com/articles/exchange-670503-needle-santa.html}{In My Experience: Emergency Responders}. Panelist. \textit{NPR Forum}, KQED, June 7, 2013. \end{olindent} %%%%%%%%%%%%%%%%%%%% \section{Selected organizational grants and awards} %%%%%%%%%%%%%%%%%%%% \begin{ol} \itemrange{2} \textbf{Most Influential Student Group}, UC Irvine, 2018, 2017, 2016: OCNEP elected by the Associated Medical Student Government and student body for its work preventing HIV and opioid overdoses \item \textbf{Syringe Access Fund}, AIDS United, 2017: Awarded \$35,000 over two years to continue and expand OCNEP's mission \item \textbf{Campus/Community Partnership Award}, Engage UCI, 2017: Awarded to one organization annually for exceptional work in service of their community \item \textbf{Syringe Exchange Supply Clearinghouse grant}, California Department of Public Health, 2016: Over \$120,000 in supplies awarded to OCNEP in sustainable, annual funding for its harm reduction work \itemrange{1} \textbf{Medical Student Community Leadership Grant}, California Medical Association Foundation, 2016, 2015: Awarded to OCNEP for outstanding community service and leadership \item \textbf{Elizabeth Taylor AIDS Foundation grant}, 2015: Over \$20,000 awarded to OCNEP for its work preventing HIV and opioid overdoses \end{ol} %%%%%%%%%%%%%%%%%%%% \section{Selected scholarships and awards} %%%%%%%%%%%%%%%%%%%% \begin{ol} \item \textbf{Senior Humanitarian Award}, UC Irvine, 2018: Awarded by vote of the medical student body to one graduating senior who embodies humanitarian integrity and practice \item \textbf{National Outstanding Medical Student Award}, American College of Emergency Physicians, 2018: Awarded to 4 nominated medical students nationally \item \textbf{Gold Humanism Honor Society}, 2017: Awarded to senior medical students for demonstrated excellence in clinical care, leadership, compassion, and dedication to service \item \textbf{Summer Fellowship}, Arnold P. Gold Foundation, 2015: Awarded for outstanding community service and leadership in public health \item \textbf{1st Place, Annual Creative Writing Contest}, UC Irvine School of Medicine, 2015: Awarded for \textit{Two Months}, a poem published in Plexus, the UC Irvine Health humanities journal \item \textbf{Setting a Higher Standard Award}, BAMRU, 2013: Awarded for leadership and commitment to mountain rescue \item \textbf{Summer Undergraduate Research Fellowship}, UC Berkeley, 2011: Awarded to selected undergraduate researchers for full-time independent summer research projects \itemrange{1} \textbf{Biology Fellows Program}, UC Berkeley, Spring 2011, Fall 2011: Given to selected promising undergraduate researchers \itemrange{1} \textbf{Leadership Award}, UC Berkeley Alumni Association, 2011 -- 2012, 2010 -- 2011: Given to selected undergraduates based on demonstrated leadership \end{ol} %%%%%%%%%%%%%%%%%%%% \section{Certifications, skills, and memberships} %%%%%%%%%%%%%%%%%%%% \begin{description} \item[Professional memberships:] {\footnotesize American Academy of Emergency Medicine (2014); American Public Health Association (2015); American College of Emergency Physicians (2016)} \item[Medicine and mental health:] {\footnotesize Emergency Medical Technician, former (NREMT \#B2085593, CA EMT \#E086820); Wilderness First Responder, former; Applied Suicide Intervention Skills Training certified; trained suicide hotline counselor; merit badges: BLS, ACLS, PALS, NRP, ATLS, ENLS} \item[Search and rescue:] {\footnotesize CalOES Type 1 alpine rescue resource; Mountain Rescue Association team member; Managing the Lost Person Incident certified; FCC amateur radio licensed (Technician 2, KJ6MHY); FEMA ICS 100, 200, and NIMS 700; San Mateo County Sheriff and CalEMA sworn disaster service worker} \item[Community outreach:] {\footnotesize Experienced radio host, interviewer, music librarian, and coordinator, particularly regarding policy affecting marginalized communities} \item[Research:] {\footnotesize Proficient in survey methodology; consent procedures; naloxone training and distribution; harm reduction techniques; subject recruitment in marginalized and underserved populations} \item[Software:] {\footnotesize Ubuntu and Debian GNU/Linux, LaTeX, HTML/CSS; webmaster and postmaster for the Orange County Needle Exchange Program and the UC Irvine Emergency Medicine Interest Group} \end{description} \end{document}

http://idl.iscram.org/search.php?sqlQuery=SELECT%20author%2C%20title%2C%20type%2C%20year%2C%20publication%2C%20abbrev_journal%2C%20volume%2C%20issue%2C%20pages%2C%20keywords%2C%20abstract%2C%20thesis%2C%20editor%2C%20publisher%2C%20place%2C%20abbrev_series_title%2C%20series_title%2C%20series_editor%2C%20series_volume%2C%20series_issue%2C%20edition%2C%20language%2C%20author_count%2C%20online_publication%2C%20online_citation%2C%20doi%2C%20serial%2C%20area%20FROM%20refs%20WHERE%20serial%20%3D%201647%20ORDER%20BY%20created_date%20DESC%2C%20created_time%20DESC%2C%20modified_date%20DESC%2C%20modified_time%20DESC%2C%20serial%20DESC&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=25&rowOffset=&wrapResults=1&citeOrder=creation-date&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

iscram.org

CC-MAIN-2020-34

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2020-34/segments/1596439735990.92/warc/CC-MAIN-20200806001745-20200806031745-00450.warc.gz

%&LaTeX \documentclass{article} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{PengXia_etal2018} Peng Xia, Ji Ruan, \& Dave Parry. (2018). Virtual Reality for Emergency Healthcare Training. In Kristin Stock, \& Deborah Bunker (Eds.), \textit{Proceedings of ISCRAM Asia Pacific 2018: Innovating for Resilience -- 1st International Conference on Information Systems for Crisis Response and Management Asia Pacific.} (pp. 494--503). Albany, Auckland, New Zealand: Massey Univeristy. \end{thebibliography} \end{document}

https://pharmascope.org/ijrps/article/download/3890/10270

pharmascope.org

CC-MAIN-2021-04

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-04/segments/1610703515075.32/warc/CC-MAIN-20210118154332-20210118184332-00506.warc.gz

\documentclass[twocolumn,twoside]{article} \makeatletter\if@twocolumn\PassOptionsToPackage{switch}{lineno}\else\fi\makeatother \usepackage{amsfonts,amssymb,amsbsy,latexsym,amsmath,tabulary,graphicx,times,xcolor} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Following additional macros are required to function some % functions which are not available in the class used. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{url,multirow,morefloats,floatflt,cancel,tfrupee} \makeatletter \AtBeginDocument{\@ifpackageloaded{textcomp}{}{\usepackage{textcomp}}} \makeatother \usepackage{colortbl} \usepackage{xcolor} \usepackage{pifont} \usepackage[nointegrals]{wasysym} \urlstyle{rm} \makeatletter %%%For Table column width calculation. \def\mcWidth#1{\csname TY@F#1\endcsname+\tabcolsep} %%Hacking center and right align for table \def\cAlignHack{\rightskip\@flushglue\leftskip\@flushglue\parindent\z@\parfillskip\z@skip} \def\rAlignHack{\rightskip\z@skip\leftskip\@flushglue \parindent\z@\parfillskip\z@skip} %Etal definition in references \@ifundefined{etal}{\def\etal{\textit{et~al}}}{} %\if@twocolumn\usepackage{dblfloatfix}\fi \usepackage{ifxetex} \ifxetex\else\if@twocolumn\@ifpackageloaded{stfloats}{}{\usepackage{dblfloatfix}}\fi\fi \AtBeginDocument{ \expandafter\ifx\csname eqalign\endcsname\relax \def\eqalign#1{\null\vcenter{\def\\{\cr}\openup\jot\m@th \ialign{\strut$\displaystyle{##}$\hfil&$\displaystyle{{}##}$\hfil \crcr#1\crcr}}\,} \fi } %For fixing hardfail when unicode letters appear inside table with endfloat \AtBeginDocument{% \@ifpackageloaded{endfloat}% {\renewcommand\efloat@iwrite[1]{\immediate\expandafter\protected@write\csname efloat@post#1\endcsname{}}}{\newif\ifefloat@tables}% }% \def\BreakURLText#1{\@tfor\brk@tempa:=#1\do{\brk@tempa\hskip0pt}} \let\lt=< \let\gt=> \def\processVert{\ifmmode|\else\textbar\fi} \let\processvert\processVert \@ifundefined{subparagraph}{ \def\subparagraph{\@startsection{paragraph}{5}{2\parindent}{0ex plus 0.1ex minus 0.1ex}% {0ex}{\normalfont\small\itshape}}% }{} % These are now gobbled, so won't appear in the PDF. \newcommand\role[1]{\unskip} \newcommand\aucollab[1]{\unskip} \@ifundefined{tsGraphicsScaleX}{\gdef\tsGraphicsScaleX{1}}{} \@ifundefined{tsGraphicsScaleY}{\gdef\tsGraphicsScaleY{.9}}{} % To automatically resize figures to fit inside the text area \def\checkGraphicsWidth{\ifdim\Gin@nat@width>\linewidth \tsGraphicsScaleX\linewidth\else\Gin@nat@width\fi} \def\checkGraphicsHeight{\ifdim\Gin@nat@height>.9\textheight \tsGraphicsScaleY\textheight\else\Gin@nat@height\fi} \def\fixFloatSize#1{}%\@ifundefined{processdelayedfloats}{\setbox0=\hbox{\includegraphics{#1}}\ifnum\wd0<\columnwidth\relax\renewenvironment{figure*}{\begin{figure}}{\end{figure}}\fi}{}} \let\ts@includegraphics\includegraphics \def\inlinegraphic[#1]#2{{\edef\@tempa{#1}\edef\baseline@shift{\ifx\@tempa\@empty0\else#1\fi}\edef\tempZ{\the\numexpr(\numexpr(\baseline@shift*\f@size/100))}\protect\raisebox{\tempZ pt}{\ts@includegraphics{#2}}}} %\renewcommand{\includegraphics}[1]{\ts@includegraphics[width=\checkGraphicsWidth]{#1}} \AtBeginDocument{\def\includegraphics{\@ifnextchar[{\ts@includegraphics}{\ts@includegraphics[width=\checkGraphicsWidth,height=\checkGraphicsHeight,keepaspectratio]}}} \DeclareMathAlphabet{\mathpzc}{OT1}{pzc}{m}{it} \def\URL#1#2{\@ifundefined{href}{#2}{\href{#1}{#2}}} %%For url break \def\UrlOrds{\do\*\do\-\do\~\do\'\do\"\do\-}% \g@addto@macro{\UrlBreaks}{\UrlOrds} \edef\fntEncoding{\f@encoding} \def\EUoneEnc{EU1} \makeatother \def\floatpagefraction{0.8} \def\dblfloatpagefraction{0.8} \def\style#1#2{#2} \def\xxxguillemotleft{\fontencoding{T1}\selectfont\guillemotleft} \def\xxxguillemotright{\fontencoding{T1}\selectfont\guillemotright} \newif\ifmultipleabstract\multipleabstractfalse% \newenvironment{typesetAbstractGroup}{}{}% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage[authoryear]{natbib} \newif\ifnokeywords\nokeywordsfalse \makeatletter\input{size10-pointfive.clo}\makeatother% \definecolor{kwdboxcolor}{RGB}{242,242,242} \usepackage[hidelinks,colorlinks=true,allcolors=blue]{hyperref} \linespread{1} \def\floatpagefraction{0.8} \usepackage[paperheight=11.69in,paperwidth=8.26in,top=1in,bottom=1in,left=1in,right=.75in,headsep=24pt]{geometry} \usepackage{multirow-custom} \makeatletter \def\hlinewd#1{% \noalign{\ifnum0=`}\fi\hrule \@height #1% \futurelet\reserved@a\@xhline} \def\tbltoprule{\hlinewd{1pt}\\[-14pt]} \def\tblbottomrule{\noalign{\vspace*{6pt}}\hline\noalign{\vspace*{2pt}}} \def\tblmidrule{\hline\noalign{\vspace*{2pt}}} \let\@articleType\@empty \let\@journalDoi\@empty \let\@journalVolume\@empty \let\@journalIssue\@empty \let\@crossMarkLink\@empty \let\@receivedDate\@empty \let\@acceptedDate\@empty \let\@revisedDate\@empty \let\@publishedDate\@empty \let\@copyrightYear\@empty \let\@firstPage\@empty \def\articleType#1{\gdef\@articleType{#1}} \def\journalDoi#1{\gdef\@journalDoi{#1}} \def\crossMarkLink#1{\gdef\@crossMarkLink{#1}} \def\receivedDate#1{\gdef\@receivedDate{#1}} \def\acceptedDate#1{\gdef\@acceptedDate{#1}} \def\revisedDate#1{\gdef\@revisedDate{#1}} \def\publishedDate#1{\gdef\@publishedDate{#1}} \def\copyrightYear#1{\gdef\@copyrightYear{#1}} \def\journalVolume#1{\gdef\@journalVolume{#1}} \def\journalIssue#1{\gdef\@journalIssue{#1}} \def\firstPage#1{\gdef\@firstPage{#1}} \def\author#1{% \gdef\@author{% \hskip-\dimexpr(\tabcolsep)\hskip5pt% \parbox{\dimexpr\textwidth-1pt}% {\fontsize{11}{13}\selectfont\raggedright #1}% }% } \usepackage{pharmascope-abs} \usepackage{caption} \usepackage{lastpage} \usepackage{fancyhdr} \usepackage[noindentafter,explicit]{titlesec} \usepackage{fontspec} \setmainfont[% BoldFont=cambriab.otf,% ItalicFont=CAMBRIAI.otf,% BoldItalicFont=CAMBRIAZ.otf]{Cambria.otf} \lefthyphenmin = 3 \def\title#1{% \gdef\@title{% \vspace*{-40pt}% \ifx\@articleType\@empty\else{\fontsize{10}{12}\scshape\selectfont\hspace{8pt}\@articleType\hfill\mbox{}\par\vspace{2pt}}\fi% \minipage{\linewidth} \hrulefill\\[-0.7pt]% \mbox{~}\hspace{5pt}\parbox{.1\linewidth}{\includegraphics[width=75pt,height=50pt]{ijrps_logo.png}}\hfill \fcolorbox{kwdboxcolor}{kwdboxcolor}{\parbox{.792\linewidth}{% \begin{center}\fontsize{17}{17}\selectfont\scshape\vskip-7pt International Journal of Research in Pharmaceutical Sciences\hfill\end{center}% \vspace*{-10pt}\hspace*{4pt}{\fontsize{8}{9}\selectfont Published by JK Welfare \& Pharmascope Foundation\hfill Journal Home Page: \href{http://www.pharmascope.org/ijrps}{\color{blue}\underline{\smash{www.pharmascope.org/ijrps}}}}\hspace*{4pt}\mbox{}}}% \par\vspace*{-1pt}\rule{\linewidth}{1.3pt}% \endminipage% \par\vspace*{9.2pt}\parbox{.98\linewidth}{\linespread{.9}\raggedright\fontsize{14}{17}\selectfont #1}% \vspace*{-8pt}% } } \setlength{\parindent}{0pt} \setlength{\parskip}{0.4pc plus 1pt minus 1pt} \def\abbrvJournalTitle{Int. J. Res. Pharm. Sci.} \fancypagestyle{headings}{% \renewcommand{\headrulewidth}{0pt}% \renewcommand{\footrulewidth}{0.3pt} \fancyhf{}% \fancyhead[R]{% \fontsize{9.12}{11}\selectfont\RunningAuthor,\ \abbrvJournalTitle,\ \ifx\@journalVolume\@empty X\else\@journalVolume\fi% \ifx\@journalIssue\@empty\else(\@journalIssue)\fi% ,\ \ifx\@firstPage\@empty 1\else\@firstPage\fi-\pageref*{LastPage}% }% \fancyfoot[LO,RE]{\fontsize{9.12}{11}\selectfont\textcopyright\ International Journal of Research in Pharmaceutical Sciences}% \fancyfoot[RO,LE]{\fontsize{9.12}{11}\selectfont\thepage} }\pagestyle{headings} \fancypagestyle{plain}{% \renewcommand{\headrulewidth}{0pt}% \renewcommand{\footrulewidth}{0.3pt}% \fancyhf{}% \fancyhead[R]{% \fontsize{9.12}{11}\selectfont\RunningAuthor,\ \abbrvJournalTitle,\ \ifx\@journalVolume\@empty X\else\@journalVolume\fi% \ifx\@journalIssue\@empty\else(\@journalIssue)\fi% ,\ \ifx\@firstPage\@empty 1\else\@firstPage\fi-\pageref*{LastPage}% }% \fancyfoot[LO,RE]{\fontsize{9.12}{11}\selectfont\textcopyright\ International Journal of Research in Pharmaceutical Sciences}% \fancyfoot[RO,LE]{\fontsize{9.12}{11}\selectfont\thepage} \ifx\@firstPage\@empty\else\setcounter{page}{\@firstPage}\fi } \def\NormalBaseline{\def\baselinestretch{1.1}} \usepackage{textcase} \setcounter{secnumdepth}{0} \titleformat{\section}[block]{\bfseries\boldmath\NormalBaseline\filright\fontsize{10.5}{13}\selectfont} {\thesection} {6pt} {\MakeTextUppercase{#1}} [] \titleformat{\subsection}[block]{\bfseries\boldmath\NormalBaseline\filright\fontsize{10.5}{12}\selectfont} {\thesubsection} {6pt} {#1} [] \titleformat{\subsubsection}[block]{\NormalBaseline\filright\fontsize{10.5}{12}\selectfont} {\thesubsubsection} {6pt} {#1} [] \titleformat{\paragraph}[block]{\NormalBaseline\filright\fontsize{10.5}{10}\selectfont} {\theparagraph} {6pt} {#1} [] \titleformat{\subparagraph}[block]{\NormalBaseline\filright\fontsize{10.5}{12}\selectfont} {\thesubparagraph} {6pt} {#1} [] \titlespacing{\section}{0pt}{.5\baselineskip}{.5\baselineskip} \titlespacing{\subsection}{0pt}{.5\baselineskip}{.5\baselineskip} \titlespacing{\subsubsection}{0pt}{.5\baselineskip}{.5\baselineskip} \titlespacing{\paragraph}{0pt}{.5\baselineskip}{.5\baselineskip} \titlespacing{\subparagraph}{0pt}{.5\baselineskip}{.5\baselineskip} \captionsetup[figure]{skip=1.4pt,font=bf,labelsep=colon,justification=raggedright,singlelinecheck=false} \captionsetup[table]{skip=1.4pt,font=bf,labelsep=colon,justification=raggedright,singlelinecheck=false} \def\bibyear#1{#1} %\def\bibjtitle#1{#1} %%Publisher request \def\bibauand{} \setlength\bibsep{3pt} \setlength\bibhang{8pt} \makeatother \date{} \usepackage{float} \begin{document} \def\RunningAuthor{Rajesh S R et al.} \firstPage{503} \articleType{Original Article} \receivedDate{31 Jul 2020} \acceptedDate{02 Sep 2020} \revisedDate{09 Oct 2020} \journalVolume{2020, 11 (SPL4)} \journalDoi{ijrps.v11iSPL4.3890} \copyrightYear{2020} \def\authorCount{3} \def\affCount{1} \def\journalTitle{International Journal of Research in Pharmaceutical Sciences} \title{A Fuzzy clustering Approach for Micro Aneurysm Lesion Detection in Diabetic Retinopathy} \author{Rajesh~S~R\textsuperscript{*}, Kanniga~E, Sundararajan~M~\\[5pt]{Department of Electronics \& Communication/ Instrumentation Engineering, Bharath Institute of Higher Education and Research, Chennai-600073, Tamil Nadu, India }} \begin{abstract} Diabetic retinopathy (DR) be the significant difficulty of diabetes, and micro aneurysm (MA) is an earliest diabetic retinopathy lesion, making early detection of MA a key factor in diabetic retinopathy. DR is a direct or indirect effect on human vision caused by chronic diabetes. During its early stages DR is asymptomatic, and the late diagnosis leads to undeviating vision loss. The computer-assisted diagnosis helps with prompt and effective care, with the aid of medical photos. MA mark the beginning of DR making it a vital screening stage for this disorder. Diabetic retinopathy is a persistent infection of eye that can be the reason of blindness unless it is diagnosed and treated in due course. Early discovery with analysis of diabetic retinopathy is vital to vision preservation of patient. Precise recognition of MA be the crucial method towards early diagnosis of DR, since they occur as the first symptom of the disease. The segmentation of MA is performed using the Fuzzy C algorithm, and the extraction of features is performed with Gray Level Co-occurrence Matrix ( GLCM) as the set of characteristic for KNN. This technique aims to improve classification accuracy within an ensemble. A procedure is suggested here that recognizes the first DR sign called MA using images from the retinal fundus. Effective diagnosis of DR is very critical in the defense of patients' right to see. The procedure proposed is tested using publicly available databases of retinal images and greater accuracy is achieved. \end{abstract}\def\keywordstitle{Keywords} \begin{keywords}Classifier,\newline Databases,\newline Diabetic retinopathy,\newline Fundus,\newline GLCM \end{keywords} \twocolumn[ \maketitle {\printKwdAbsBox}] \makeatletter\textsuperscript{*}Corresponding Author\par Name:\ Rajesh~S~R~\\ Phone:\ ~\\ Email:\ msrajan69@gmail.com \par\vspace*{-11pt}\hrulefill\par{\fontsize{12}{14}\selectfont ISSN: 0975-7538}\par% \textsc{DOI:}\ \href{https://doi.org/10.26452/\@journalDoi}{\textcolor{blue}{\underline{\smash{https://doi.org/10.26452/\@journalDoi}}}}\par% \vspace*{-11pt}\hrulefill\\{\fontsize{9.12}{10.12}\selectfont Production and Hosted by}\par{\fontsize{12}{14}\selectfont Pharmascope.org}\par% \vspace*{-7pt}{\fontsize{9.12}{10.12}\selectfont\textcopyright\ \@copyrightYear\ $|$ All rights reserved.}\par% \vspace*{-11pt}\rule{\linewidth}{1.2pt} \makeatother \section{ Introduction} DR is a chronic disease that based on the number and types of lesions on the retina. Therefore, these lesions need either to monitor DR or to assess its progression. MA is the most extreme and often the first lesions to develop as a result of DR. Diabetic retinopathy is divided in 4 phases: severe non-proliferational retinopathy in the first step. Secondly, moderate retinopathy with no proliferation. Firstly, there is severe non-proliferative retinopathy, with proliferative retinopathy in the final stage \unskip~\citep{966826:21077023}. The first of four stages of DR is non-proliferative diabetic retinopathy (NPDR) as the smallest regions of the retinal blood flow have ballon-like inflammation. Blindness will be treated if DR progresses at this point. Yet blood vessels that feed the eye are blocked by progression of the disease, leading to blindness. Any blood flow is then blocked, leaving the retina inadequate for blood\unskip~\citep{966826:21077032}. Proliferative Diabetic Retinopathy (PDR) is a retinal blood vessel damaging condition. This permits the emission of vascular endothelial growth factor (VEGF). The VEGF is a material that induces abnormal formation of blood vessels on the surface of the retina. These vessels be able to quick bleed and retinal friction as well as separation. Such anomalous blood vessels occasionally turn into a danger even if the individual does not know there is a problem. Such approaches to early warning signs are discussed by different diagnose techniques \unskip~\citep{966826:21077031}. Early treatment helps to treat illnesses. In, Figure~\ref{f-a004d14d51a5} the different retinal characteristics of macula, optic nerves, blood vessels, and glass are shown. Formulated neural network model distinguish the found figure as a secure image along with a DR image \unskip~\citep{966826:21077029}. The DR identification proposal incorporates the mutual advantages of the DR morphology classification method (blood vessel segmentation), Watershed Transformation (Optic Disk segmentation), in addition to GLCM. Diagnosis of retinopathy requires effective microaneurysm identification \unskip~\citep{966826:21077027}. Typically, the basic approach to automatic detection of microaneurysms has four stages, 1) image pre-processing 2) candidate extraction 3) feature extraction and 4) classification According to the various MA shapes and colors, the most important steps are candidate extraction and feature extraction. The total expected research contribution is given below, \begin{enumerate} \item \relax Enhanced blood vessel identification through morphological iterative method. \item \relax To create a a fuzzy C-means clustering algorithm with pre-processed image. \item \relax Application of GLCM with KNN classifier for mass retinopathy screening. \end{enumerate} Due to DR, several regions on the retina are affected, causing vision loss. Additional characteristics such as hemorrhages, microaneurysms and exudates arise in eyes due to retinal changes \unskip~\citep{966826:21077020}. Microaneurysm identification is one of DR's most important steps. Microaneurysm refers to the first clear signs of the presence of DR. If abnormal new blood vessels (neovascularization) form as part of Proliferative Diabetic Retinopathy (PDR) at the back of the eye, they may burst and bleed as well as blur. Diabetic people can develop MA as an early symptom\unskip~\citep{966826:21077022,966826:21077026}. Automatic detection of DR lesions such as MA may lead to early diagnosis and screening in digital fundus images \unskip~\citep{966826:21077024,966826:21077015}. This paper proposes an automatic, accurate approach to classify MA. MAs are small swellings on the surface of tiny blood vessels, as seen in Figure~\ref{f-324c0d5a0bf6}. Such tiny swellings split, causing blood to leak into surrounding tissue. In human retina color fundus photographs, MA appear as small, circular red dot from capillaries \unskip~\citep{966826:21077021}. MA occur as remote points, i.e. detached as vascular tree, since capillaries are not visible in images of color fundus. Their diameter is usually 10 to 100 micrometers, but is often less than 125 micrometers, minor than vein width \unskip~\citep{966826:21077033}. These tiny aneurysms cause bleeding and blood rupture. From the viewpoint of image processing, automated recognition of MA is a daunting assignment because of similar color and scale as vessels, but with variable dimension and are frequently so small that they can easily be confused with image noise \unskip~\citep{966826:21077028}. Either a red lesion is MA or a tiny dot hemorrhage is hard to tell. In angiography, fluorescence is the only way to be sure. Invasive treatment involves the patient being injected with a contrast agent. This article looks on segmenting preprocessed image MA with FCM and extracting features using wavelet, segmented image GLCM \unskip~\citep{966826:21077030,966826:21077018}. Present DIP-induced diabetic retinopathy diagnostic approaches have certain drawbacks. Most red lesions is similar to blood vessels, causing distinction complicated. MAs typically have very small size and low background variability, rendering MA identification a difficult activity. The main barrier in retina to red lesion identification is MA segmentation in the low-contrast zone and white lesions. When one has cataract, macular degeneration, glaucoma, or further eye disease, it is hard to spot diabetic retinopathy. \section{Experimental Methodology} Health contribution data are split into two categories of medical treatment: data where illness is present and data where infection is not diagnosed. Sensitivity and consistency tests are used to determine the quality of medication. The criteria True Positive (TP), True Negative (TN), False Positive (FP), and False Negative (FN) used to diagnose the disease are several. Fundus fluorescein angiography (FA) and OCT (Optical Coherence Tomography) are the major retinal imaging methods. NPDR 's major symptom begins in MAs and the large dilatations of small blood vessels. Normally laser detection (photocoagulation) is very effective in preventing vision loss. Present DR screening devices favor retinal background images. OCT is widely used as a reference standard for DME evaluation. A technique is suggested here identifying the first DR sign called MAs using retinal fundus pictures. Effective DR diagnosis is crucial to preserving patient vision skills. The proposed retinopathy discovery model includes mainly three process, pre-processing, feature extraction, and classification. Preprocessing is central to image processing recognition techniques include low contrast due to eye background morphology, non- illumination, opaque media within the eye, camera wide angle optics, pupil size dissimilarity, sensor array structure and eye movement when image capture. Preprocessing thus plays a significant function image analysis of funds. Preprocessing technique major purpose is to enhance the possibility of illness detection through visual evaluation along with computer-aided retinal image segmentation. Figure~\ref{f-2109e49204a7} demonstrates the proposed process structure. Fuzzy C is a clustering algorithm for retinal image input from segment MAs and subsequently, texture analysis is performed and the characteristics are given toward KNN, to categorize the images as regular or MA-based. \section{Results and Discussion} \bgroup \fixFloatSize{images/1579396a-5037-4984-92db-396e33592964-upicture1.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/1579396a-5037-4984-92db-396e33592964-upicture1.png}{\includegraphics{images/1579396a-5037-4984-92db-396e33592964-upicture1.png}}{} \makeatother \caption{\boldmath {Illustration of various features on a typical retinopathic image }} \label{f-a004d14d51a5} \end{figure*} \egroup \bgroup \fixFloatSize{images/9f3bf8fe-1ec2-418a-a1dc-62bafe1292ea-upicture2.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/9f3bf8fe-1ec2-418a-a1dc-62bafe1292ea-upicture2.png}{\includegraphics{images/9f3bf8fe-1ec2-418a-a1dc-62bafe1292ea-upicture2.png}}{} \makeatother \caption{\boldmath {Image of Microaneurysm}} \label{f-324c0d5a0bf6} \end{figure*} \egroup \bgroup \fixFloatSize{images/771d0f9d-9850-44db-8577-6bbb4e45d65e-upicture3.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/771d0f9d-9850-44db-8577-6bbb4e45d65e-upicture3.png}{\includegraphics{images/771d0f9d-9850-44db-8577-6bbb4e45d65e-upicture3.png}}{} \makeatother \caption{\boldmath {Proposed method for early detection of DR}} \label{f-2109e49204a7} \end{figure*} \egroup \bgroup \fixFloatSize{images/b067e398-b489-4566-b958-8260182be1a6-upicture4.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/b067e398-b489-4566-b958-8260182be1a6-upicture4.png}{\includegraphics{images/b067e398-b489-4566-b958-8260182be1a6-upicture4.png}}{} \makeatother \caption{\boldmath {Image pre-processing of Input image and Gamma corrected image}} \label{f-c999466dedd7} \end{figure*} \egroup \bgroup \fixFloatSize{images/f330dcff-38aa-46e1-a20d-b06507183b18-upicture5.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/f330dcff-38aa-46e1-a20d-b06507183b18-upicture5.png}{\includegraphics{images/f330dcff-38aa-46e1-a20d-b06507183b18-upicture5.png}}{} \makeatother \caption{\boldmath {Green channel output and AHE output}} \label{f-e0f9678f8c2e} \end{figure*} \egroup \bgroup \fixFloatSize{images/0c6cc879-23c9-4bea-b20d-8aa05e99f538-upicture6.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/0c6cc879-23c9-4bea-b20d-8aa05e99f538-upicture6.png}{\includegraphics{images/0c6cc879-23c9-4bea-b20d-8aa05e99f538-upicture6.png}}{} \makeatother \caption{\boldmath {Segmentation output using FCM and Image after removal of blood vessel and other regions larger in size}} \label{f-2e4fac97e8f7} \end{figure*} \egroup \bgroup \fixFloatSize{images/b7ad499b-68c4-45a6-bfa4-50b5cf0de013-upicture7.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/b7ad499b-68c4-45a6-bfa4-50b5cf0de013-upicture7.png}{\includegraphics{images/b7ad499b-68c4-45a6-bfa4-50b5cf0de013-upicture7.png}}{} \makeatother \caption{\boldmath {Approximated DWT image results of first stage using DIARETDB1 Database}} \label{f-0ffb878c1c32} \end{figure*} \egroup \bgroup \fixFloatSize{images/88e32b81-66fa-4ca3-a96b-3a891ecf9378-upicture8.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/88e32b81-66fa-4ca3-a96b-3a891ecf9378-upicture8.png}{\includegraphics{images/88e32b81-66fa-4ca3-a96b-3a891ecf9378-upicture8.png}}{} \makeatother \caption{\boldmath {Thresholded image, MA lesion extracted region using DIARETDB1 database and MA lesion extracted region using ROC database}} \label{f-10f13a48f186} \end{figure*} \egroup \bgroup \fixFloatSize{images/0d9a2ef2-4b86-4439-a550-a52bbb046e0f-upicture9.png} \begin{figure*}[!htbp] \centering \makeatletter\IfFileExists{images/0d9a2ef2-4b86-4439-a550-a52bbb046e0f-upicture9.png}{\includegraphics{images/0d9a2ef2-4b86-4439-a550-a52bbb046e0f-upicture9.png}}{} \makeatother \caption{\boldmath {ROC plot of RF classifier and SVM classifier }} \label{f-c2e6f727a623} \end{figure*} \egroup DIARETDB1 (DIAbetic RETinopathy Database Calibration Level 1) and ROC (Retinal Online Challenge) are two publicly available retinal image databases. DIARETDB1 consists of 89 color fundus images, 84 of which contain moderate non-proliferative signs of diabetic retinopathy, and 5 contain no DR signs. Image was taken using a 50-degree Field-Of camera with different image settings. These refer to a logical realistic situation where images are similar and the overall efficiency of diagnostic methods can be calculated. Image pre-processing is a prerequisite for detecting fundus image-related anomalies to improve MA visibility in the fundus image. Variation in color and brightness of fundus photographs attributes with photography settings. Firstly, gamma correction had done to all image for these variations, given in Figure~\ref{f-c999466dedd7}. As the contrast in MAs / haemorrhages / blood vessels and context as in Figure~\ref{f-e0f9678f8c2e} is enhanced, the gamma-corrected image removes the green channel. The suggested solution further improves the contrast between green channels by transforming values using Adaptive Histogram Equalizing (AHE). AHE is a method for enhancing image spatial contrast. The adaptive approach computes histograms that are identical to ordinary histogram equalization for distinct image sections and reallocate image buoyancy values. Therefore, it is important to enhance an image 's local contrast and provide more details. Clustering deals with the process of arranging the collection of objects in a way that similar cluster objects be closer to one another than objects in other clusters. Clusters seeking are the best centers in iterative method \unskip~\citep{966826:21077014}. Fuzzy clustering is a muddy logic technique that enables clusters to flexibly distribute data points \unskip~\citep{966826:21077012}. The Universe entity that fit Fuzzy set by membership range ranging real values 0 to 1, depending on Fuzzy Algebra. Data points have granted limited membership by fuzzy clustering into several neighboring clusters. Membership rates reflect the degree to which data point and cluster interact. Using membership format, different clusters are allocated data points. And the key point of fuzzy clustering is not uniformly partitioning data points within a cluster collection \unskip~\citep{966826:21077019}. Membership rates are accomplished by using distance metrics calculating the distance between a point and a cluster center. \begin{table*}[!htbp] \caption{\boldmath {Features of MAs and hemorrhages extracted for proposed DR recognition} } \label{tw-25ef9ccd5065} \def\arraystretch{1.1} \ignorespaces \centering \begin{tabulary}{\linewidth}{p{\dimexpr.1952\linewidth-2\tabcolsep}p{\dimexpr.3839\linewidth-2\tabcolsep}p{\dimexpr.4209\linewidth-2\tabcolsep}} \tbltoprule \rowcolor{kwdboxcolor}Sl. No & Feature & Depiction\\ \tblmidrule 1 & Area of object & The maximum number of pixels in the field\\ 2 & Perimeter of object & Apply all the pixels to the edge of the object\\ 3 & Circularity & Candidate's roundness\\ 4 & Number of objects & Total number of interruptions in the area\\ 5 & Aspect Ratio & Major axis and minor axis length ratio\\ \tblbottomrule \end{tabulary}\par \end{table*} Fuzzy C method is the major fuzzy clustering algorithm used by Bezdek to adjust a crisp clustering approach. Here, Fuzzy C algorithm is applied to remove candidates as a result of deleting regions without MA-like characteristics \unskip~\citep{966826:21077016}. The Fuzzy C-Means algorithm is typically a straightforward implementation of the K-Means clustering algorithm's fuzzy logic. As shown in Figure 6, MAs are segmented with the blood vessels by applying Fuzzy C on the preprocessed picture means clustering algorithm. Additional blood vessels and other larger sections are removed to isolate MAs \unskip~\citep{966826:21077025}. Input data is converted into function extraction features package. When the same functionality is removed, as an alternative of full input size, the feature set is required to take out pertinent information and execute the preferred task with this abridged illustration. Texture characteristics are extracted from DWT and first order statistics using GLCM (Gray Level Co-occurrence Matrix). Most texture analyzes use GLCM approach. Using GLCM eliminates the image's second-order statistic texture functionality. GLCM is a tabulation of how much a picture displays various combinations of gray pixel rates. GLCM is sensitive to the texture samples being examined, and may reduce the number of gray concentrations. GLCM's most common textural characteristics are contrast, homogeneity, correlation, entropy, and strength. Using DWT and GLCM, the segmented image draws 12 functions, and is applied in the categorization to distinguish between MA and non-MA pixels. \begin{table}[!htbp] \caption{\boldmath {Different Features accuracy using Random Forest Classifier} } \label{tw-ef89501085b9} \def\arraystretch{1.1} \ignorespaces \centering \begin{tabulary}{\linewidth}{LLL} \tbltoprule \rowcolor{kwdboxcolor}Features & Diaretdb1 \mbox{}\protect\newline Database & ROC Database \\ \tblmidrule GLCM features & 89\% & 86\% \\ DWT features & 88\% & 86\% \\ Image patches & 90\% & 88\% \\ Combined & 95\% & 94\% \\ \tblbottomrule \end{tabulary}\par \end{table} \begin{table}[!htbp] \caption{\boldmath {Different Features accuracy using SVM Classifier3} } \label{tw-1e88482f7bd2} \def\arraystretch{1.1} \ignorespaces \centering \begin{tabulary}{\linewidth}{LLL} \tbltoprule \rowcolor{kwdboxcolor}Features & Diaretdb1 \mbox{}\protect\newline Database & ROC Database \\ \tblmidrule GLCM features & 89\% & 87\% \\ DWT features & 89\% & 86\% \\ Image patches & 91\% & 89\% \\ Combined & 96\% & 92\% \\ \tblbottomrule \end{tabulary}\par \end{table} After extracting an item, the classifier KNN is used for classification. KNN Classifier, while defining n neighbors as MA pixels, p = n / k determines the later likelihood of the query pixel being a MA pixel itself \unskip~\citep{966826:21077017}. Distance is calculated in optimized function space using Euclidean metric to locate nearest neighbors. The test process features are separated from an unknown image and provided to the classifier for finding MAs. The first-stage DWT results are shown in Figure~\ref{f-0ffb878c1c32}. The adjacent neighbor regulation tries to calculate approximately the subsequent probabilities of sample selection. A high k-value is optimal for consistent estimates. However, when every nearest k neighbors are near as much as necessary for problem collection, can the majority labels of their neighbors estimate their probability for posteriori. Therefore, a balance must be found that k's value relates to just a little portion of training samples. The features of MAs and hemorrhages extracted for proposed DR recognition are shown in Table~\ref{tw-25ef9ccd5065}. First, color fundus images are resized to 640 x 480 pixels from different sources. Images are transformed to gray to reduce processing time. The photograph consists of three retinal fundus canals: red, green and blue. The big difference among blood vessels with background, besides the biggest difference among optic disk and tissue within the retina make the green channel of the RGB image slightly luminous and the choroid venous tissue visible before processing red channel. However, retinal vessels are transparent and show low contrast comparing to green channel. The gray image is utilized to locate optical disks. Blue channel is not used to distinguish, as it produces additional noise as well as fewer information regarding retina's morphological organization. Table~\ref{tw-ef89501085b9} displays fundus images analysis and the quality of Random Forest Classifier output images, including MAs and hemorrhages. Table~\ref{tw-1e88482f7bd2} displays the accuracy of functions using SVM Classifier. The accuracy of the outcome of the proposed DR detection algorithm depends on the sensitivity and specificity assessed. DIABET DB1 and ROC databases (Healthy and DR files) took one hundred thirty images. Among these, 67 eye images were used as training samples, and 63 as test samples. Samples count is randomly selected in the test set and training set, giving the proposed algorithm robustness. The study samples amount is selected further than test samples, as shown in Figure~\ref{f-10f13a48f186} for better classification model preparation. ROC displays a graphical plot showing a classifier device's predictive potential as its degree of change of discrimination, as seen in Figure~\ref{f-c2e6f727a623}. Scheming true positive figure with false positive produces the ROC curve. Accuracy is the proportion of correct instances. \begin{eqnarray*}Accuracy=TP=\frac{TN}{\left(TP+TN+FP+FN\right)} \end{eqnarray*} where TP - True Positive, TN - True Negative, FP - False Positive, FN - False Negative. DR-affected retinal fundus picture is found to include nearly circular bright spots, including haemorrhages and MAs. However, only certain vascular residues exist in a healthy eye fundus image. The proposed DR detection system has 29, 28, 4 and 2 true positive, false positive, and false negatives. The system's reactivity and specificity were calculated as 88\% and 94\% respectively. The results obtained from this method are compared to a few existing methods which claim to be better than the methods considered. \section{Conclusions} This article detailed an early detection method for DR from color fundus image for DR screening. The sensitivity and specificity values obtained suggest that this system is suitable for detecting non-proliferative diabetes retinopathy. Here, a method for detecting MAs on retinal images was presented, with texture features analysis on the pre-processed image's segmented output. When considering only segmented tests for extracting and classifying features, the processed pixels count is greatly decreased. Five haemorrhage and MAs trained the DR detection model, making the proposed system robust and effective. This study has two main modules, one performing image segmentation, which is called the stage of candidate extraction, and the other performing KNN classification using Fuzzy C-Means (FCM) clustering algorithm. The reduction of wider blood vessels and further areas eliminates false positives. The proposed method reached 84\% sensitivity at 5 false positives per picture. The technique may be extended to detect other anomalies like hemorrhage, exudates, etc. The device could also identify optical disks and blood vessels. Other classifiers will increase the method's sensitivity. Proposing a system for detecting PDR by taking abnormal blood vessels and cotton wools from color fundus images is the future work. \section{Acknowledgement} I am thankful to all staff of Electronics \& Communication/ Instrumentation Engineering department, Bharath Institute of Higher Education and Research for supporting this work. \textbf{Funding Support} The authors declare that they have no funding support for this study. \textbf{Conflict of Interest} The authors declare that they have no conflict of interest for this study. \bibliographystyle{pharmascope_apa-custom} \bibliography{\jobname} \end{document}

http://voodoo-circle.sourceforge.net/doc_for_developers/latex/c__micro__greater__or__equal_8h_source.tex

sourceforge.net

CC-MAIN-2018-13

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-13/segments/1521257647406.46/warc/CC-MAIN-20180320111412-20180320131412-00638.warc.gz

\hypertarget{c__micro__greater__or__equal_8h}{ \section{c\_\-micro\_\-greater\_\-or\_\-equal.h} \label{c__micro__greater__or__equal_8h}\index{c\_\-micro\_\-greater\_\-or\_\-equal.h@{c\_\-micro\_\-greater\_\-or\_\-equal.h}} } \begin{DoxyCode} 00001 \textcolor{comment}{/***************************************************************************} 00002 \textcolor{comment}{ c\_micro\_greater\_or\_equal.h - description} 00003 \textcolor{comment}{ -------------------} 00004 \textcolor{comment}{ begin : Thu May 10 2007} 00005 \textcolor{comment}{ copyright : (C) 2004-2010 Marian VooDooMan Meravy} 00006 \textcolor{comment}{ email : ghostvoodooman -a.T= users (dot) sourceforge.net} 00007 \textcolor{comment}{ ***************************************************************************/} 00008 00009 \textcolor{comment}{/***************************************************************************} 00010 \textcolor{comment}{} 00011 \textcolor{comment}{VooDoo cIRCle - an IRC (ro)bot} 00012 \textcolor{comment}{Copyright (C) 2004-2010 Marian VooDooMan Meravy} 00013 \textcolor{comment}{ (ghostvoodooman -a.T= users (dot) sourceforge.net)} 00014 \textcolor{comment}{} 00015 \textcolor{comment}{This program is free software; you can redistribute it and/or} 00016 \textcolor{comment}{modify it under the terms of the GNU General Public License} 00017 \textcolor{comment}{as published by the Free Software Foundation; either version 2} 00018 \textcolor{comment}{of the License, or (at your option) any later version.} 00019 \textcolor{comment}{} 00020 \textcolor{comment}{This program is distributed in the hope that it will be useful,} 00021 \textcolor{comment}{but WITHOUT ANY WARRANTY; without even the implied warranty of} 00022 \textcolor{comment}{MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the} 00023 \textcolor{comment}{GNU General Public License for more details.} 00024 \textcolor{comment}{} 00025 \textcolor{comment}{You should have received a copy of the GNU General Public License} 00026 \textcolor{comment}{along with this program; if not, write to the Free Software} 00027 \textcolor{comment}{Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.} 00028 \textcolor{comment}{} 00029 \textcolor{comment}{****************************************************************************/} 00030 \textcolor{comment}{} 00031 \textcolor{comment}{/*!} 00032 \textcolor{comment}{ \(\backslash\)file} 00033 \textcolor{comment}{ \(\backslash\)brief Class 'c\_micro\_greater\_or\_equal'} 00034 \textcolor{comment}{*/} 00035 00036 \textcolor{preprocessor}{#ifndef C\_MICRO\_GREATER\_OR\_EQUAL\_H\_\_} 00037 \textcolor{preprocessor}{}\textcolor{preprocessor}{#define C\_MICRO\_GREATER\_OR\_EQUAL\_H\_\_} 00038 \textcolor{preprocessor}{} 00039 \textcolor{preprocessor}{#if defined(HAVE\_CONFIG\_H)} 00040 \textcolor{preprocessor}{}\textcolor{preprocessor}{# include <config.h>} 00041 \textcolor{preprocessor}{#endif} 00042 \textcolor{preprocessor}{} 00043 \textcolor{preprocessor}{#include <string>} 00044 \textcolor{preprocessor}{#include <vector>} 00045 \textcolor{preprocessor}{#include <stack>} 00046 \textcolor{preprocessor}{#include <list>} 00047 \textcolor{preprocessor}{#include <map>} 00048 \textcolor{preprocessor}{#include <algorithm>} 00049 00050 \textcolor{preprocessor}{#include "../utils/memleak.h"} 00051 00052 \textcolor{preprocessor}{#include "../params.h"} 00053 00054 \textcolor{preprocessor}{#include "\hyperlink{c__micro_8h}{c_micro.h}"} 00055 \textcolor{comment}{} 00056 \textcolor{comment}{/*!} 00057 \textcolor{comment}{ \(\backslash\)brief Microcode class: greater than or equal class} 00058 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00059 \textcolor{comment}{ \(\backslash\)version 1} 00060 \textcolor{comment}{ \(\backslash\)date 2006-03-16} 00061 \textcolor{comment}{*/} \hypertarget{c__micro__greater__or__equal_8h_source_l00062}{}\hyperlink{classc__micro__greater__or__equal}{00062} \textcolor{keyword}{class }\hyperlink{classc__micro__greater__or__equal}{c_micro_greater_or_equal} : \textcolor{keyword}{public} \hyperlink{classc__micro}{c_micro} 00063 \{ \hypertarget{c__micro__greater__or__equal_8h_source_l00064}{}\hyperlink{classc__micro__greater__or__equal_a9d76eb3c6683e056259f3169ebf8ef55_a9d76eb3c6683e056259f3169ebf8ef55}{00064} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__greater__or__equal_a9d76eb3c6683e056259f3169ebf8ef55_a9d76eb3c6683e056259f3169ebf8ef55}{input1_}; \textcolor{comment}{//!< Left-hand side variable index} \hypertarget{c__micro__greater__or__equal_8h_source_l00065}{}\hyperlink{classc__micro__greater__or__equal_ac21cb1e606dac904ef509ceb28de7ad2_ac21cb1e606dac904ef509ceb28de7ad2}{00065} \textcolor{comment}{} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__greater__or__equal_ac21cb1e606dac904ef509ceb28de7ad2_ac21cb1e606dac904ef509ceb28de7ad2}{input2_}; \textcolor{comment}{//!< Right-hand side variable index} \hypertarget{c__micro__greater__or__equal_8h_source_l00066}{}\hyperlink{classc__micro__greater__or__equal_a47ff0a31d88e240bf929044faae2becb_a47ff0a31d88e240bf929044faae2becb}{00066} \textcolor{comment}{} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__greater__or__equal_a47ff0a31d88e240bf929044faae2becb_a47ff0a31d88e240bf929044faae2becb}{output_}; \textcolor{comment}{//!< Output variable index} 00067 \textcolor{comment}{}\textcolor{keyword}{public}: 00068 \textcolor{comment}{} 00069 \textcolor{comment}{ /*!} 00070 \textcolor{comment}{ \(\backslash\)brief Constructor} 00071 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00072 \textcolor{comment}{ \(\backslash\)version 1} 00073 \textcolor{comment}{ \(\backslash\)date 2006-03-16} 00074 \textcolor{comment}{ \(\backslash\)param input1 Left-hand side variable index} 00075 \textcolor{comment}{ \(\backslash\)param input2 Right-hand side variable index} 00076 \textcolor{comment}{ \(\backslash\)param output Output variable index} 00077 \textcolor{comment}{ */} \hypertarget{c__micro__greater__or__equal_8h_source_l00078}{}\hyperlink{classc__micro__greater__or__equal_a85d850ef45a366030f97139a17d8ff38_a85d850ef45a366030f97139a17d8ff38}{00078} \hyperlink{classc__micro__greater__or__equal_a85d850ef45a366030f97139a17d8ff38_a85d850ef45a366030f97139a17d8ff38}{c_micro_greater_or_equal}(\hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} input1, \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} input2, \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} output) 00079 : \hyperlink{classc__micro}{c_micro}(), \hyperlink{classc__micro__greater__or__equal_a9d76eb3c6683e056259f3169ebf8ef55_a9d76eb3c6683e056259f3169ebf8ef55}{input1_}(input1), \hyperlink{classc__micro__greater__or__equal_ac21cb1e606dac904ef509ceb28de7ad2_ac21cb1e606dac904ef509ceb28de7ad2}{input2_}(input2), \hyperlink{classc__micro__greater__or__equal_a47ff0a31d88e240bf929044faae2becb_a47ff0a31d88e240bf929044faae2becb}{output_}(output) 00080 \{ 00081 \} 00082 \textcolor{comment}{} 00083 \textcolor{comment}{ /*!} 00084 \textcolor{comment}{ \(\backslash\)brief Copy-constructor} 00085 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00086 \textcolor{comment}{ \(\backslash\)version 1} 00087 \textcolor{comment}{ \(\backslash\)date 2006-08-18} 00088 \textcolor{comment}{ */} 00089 \hyperlink{classc__micro__greater__or__equal_a85d850ef45a366030f97139a17d8ff38_a85d850ef45a366030f97139a17d8ff38}{c_micro_greater_or_equal}(\textcolor{keyword}{const} \hyperlink{classc__micro__greater__or__equal}{c_micro_greater_or_equal}& orig); 00090 \textcolor{comment}{} 00091 \textcolor{comment}{ /*!} 00092 \textcolor{comment}{ \(\backslash\)brief Copy} 00093 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00094 \textcolor{comment}{ \(\backslash\)version 1} 00095 \textcolor{comment}{ \(\backslash\)date 2006-08-18} 00096 \textcolor{comment}{ */} 00097 \hyperlink{classc__micro}{c_micro}* \hyperlink{classc__micro__greater__or__equal_ae43c6eebcb018fe0672f3f6584bf9347_ae43c6eebcb018fe0672f3f6584bf9347}{copy}(); 00098 \textcolor{comment}{} 00099 \textcolor{comment}{ /*!} 00100 \textcolor{comment}{ \(\backslash\)brief Destructor} 00101 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00102 \textcolor{comment}{ \(\backslash\)version 1} 00103 \textcolor{comment}{ \(\backslash\)date 2006-03-16} 00104 \textcolor{comment}{ */} \hypertarget{c__micro__greater__or__equal_8h_source_l00105}{}\hyperlink{classc__micro__greater__or__equal_a3f028e0f021552bfc8f55c911c3e95ef_a3f028e0f021552bfc8f55c911c3e95ef}{00105} \textcolor{keyword}{virtual} \hyperlink{classc__micro__greater__or__equal_a3f028e0f021552bfc8f55c911c3e95ef_a3f028e0f021552bfc8f55c911c3e95ef}{~c_micro_greater_or_equal}() \{ ; \} 00106 \hypertarget{c__micro__greater__or__equal_8h_source_l00107}{}\hyperlink{classc__micro__greater__or__equal_a9923a10f34393c83e617c856fc2d5893_a9923a10f34393c83e617c856fc2d5893}{00107} \hyperlink{microcode__shared_8h_aa113573c119d012d5a635b5de22a224e_aa113573c119d012d5a635b5de22a224e}{e_micro_type} \hyperlink{classc__micro__greater__or__equal_a9923a10f34393c83e617c856fc2d5893_a9923a10f34393c83e617c856fc2d5893}{get_type}() 00108 \{ 00109 \textcolor{keywordflow}{return} MICRO\_GREATER\_OR\_EQUAL; 00110 \} 00111 00112 \textcolor{keywordtype}{bool} \hyperlink{classc__micro__greater__or__equal_a855a416b08c05ba6be4854a47efee5ea_a855a416b08c05ba6be4854a47efee5ea}{perform}(\hyperlink{classc__micro__symbol__table}{c_micro_symbol_table}* symbols, \hyperlink{classc__micro__error}{c_micro_error}*& error, \hyperlink{classc__module}{c_module}* this\_module, \textcolor{keyword}{const} \textcolor{keywordtype}{string}& debug); 00113 00114 \textcolor{keyword}{virtual} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__greater__or__equal_a3c90c1aa98dfbc0f168e53bc2b611a1e_a3c90c1aa98dfbc0f168e53bc2b611a1e}{get_output}(); 00115 00116 \textcolor{keywordtype}{void} \hyperlink{classc__micro__greater__or__equal_a13339b8ad0839a22e10fd7dcafc4d4c5_a13339b8ad0839a22e10fd7dcafc4d4c5}{add_inputs}(vector<var\_sym\_index\_t>& inputs); 00117 \textcolor{keywordtype}{void} \hyperlink{classc__micro__greater__or__equal_a4eee8dc993bed9fd7fff00269c9072e8_a4eee8dc993bed9fd7fff00269c9072e8}{optimize_output}(\textcolor{keyword}{const} vector<var\_sym\_index\_t>& inputs); 00118 \}; 00119 00120 \textcolor{preprocessor}{#endif} 00121 \textcolor{preprocessor}{} \end{DoxyCode}

https://anarhisticka-biblioteka.net/library/raoul-vaneigem-pozeli-sve-ne-ocekujes-nista.tex

anarhisticka-biblioteka.net

CC-MAIN-2022-05

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-05/segments/1642320304810.95/warc/CC-MAIN-20220125100035-20220125130035-00425.warc.gz

\documentclass[DIV=12,% BCOR=10mm,% headinclude=false,% footinclude=false,open=any,% fontsize=11pt,% twoside,% paper=a4]% {scrbook} \usepackage{microtype} \usepackage{graphicx} \usepackage{alltt} \usepackage{verbatim} \usepackage[shortlabels]{enumitem} \usepackage{tabularx} \usepackage[normalem]{ulem} \def\hsout{\bgroup \ULdepth=-.55ex \ULset} % https://tex.stackexchange.com/questions/22410/strikethrough-in-section-title % Unclear if \protect \hsout is needed. Doesn't looks so \DeclareRobustCommand{\sout}[1]{\texorpdfstring{\hsout{#1}}{#1}} \usepackage{wrapfig} % avoid breakage on multiple <br><br> and avoid the next [] to be eaten \newcommand*{\forcelinebreak}{\strut\\*{}} \newcommand*{\hairline}{% \bigskip% \noindent \hrulefill% \bigskip% } % reverse indentation for biblio and play \newenvironment*{amusebiblio}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newenvironment*{amuseplay}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newcommand*{\Slash}{\slash\hspace{0pt}} % http://tex.stackexchange.com/questions/3033/forcing-linebreaks-in-url \PassOptionsToPackage{hyphens}{url}\usepackage[hyperfootnotes=false,hidelinks,breaklinks=true]{hyperref} \usepackage{bookmark} \usepackage{fontspec} \usepackage{polyglossia} \setmainlanguage{croatian} \setmainfont{LinLibertine_R.otf}[Script=Latin,% Path=/usr/share/fonts/opentype/linux-libertine/,% BoldFont=LinLibertine_RB.otf,% BoldItalicFont=LinLibertine_RBI.otf,% ItalicFont=LinLibertine_RI.otf] \setmonofont{cmuntt.ttf}[Script=Latin,% Scale=MatchLowercase,% Path=/usr/share/fonts/truetype/cmu/,% BoldFont=cmuntb.ttf,% BoldItalicFont=cmuntx.ttf,% ItalicFont=cmunit.ttf] \setsansfont{cmunss.ttf}[Script=Latin,% Scale=MatchLowercase,% Path=/usr/share/fonts/truetype/cmu/,% BoldFont=cmunsx.ttf,% BoldItalicFont=cmunso.ttf,% ItalicFont=cmunsi.ttf] \newfontfamily\croatianfont{LinLibertine_R.otf}[Script=Latin,% Path=/usr/share/fonts/opentype/linux-libertine/,% BoldFont=LinLibertine_RB.otf,% BoldItalicFont=LinLibertine_RBI.otf,% ItalicFont=LinLibertine_RI.otf] % footnote handling \usepackage[fragile]{bigfoot} \usepackage{perpage} \DeclareNewFootnote{default} \renewcommand*{\partpagestyle}{empty} % global style \pagestyle{plain} \usepackage{indentfirst} % remove the numbering \setcounter{secnumdepth}{-2} % remove labels from the captions \renewcommand*{\captionformat}{} \renewcommand*{\figureformat}{} \renewcommand*{\tableformat}{} \KOMAoption{captions}{belowfigure,nooneline} \addtokomafont{caption}{\centering} \DeclareNewFootnote{B} \MakeSorted{footnoteB} \renewcommand*\thefootnoteB{(\arabic{footnoteB})} \deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~} \addtokomafont{disposition}{\rmfamily} \addtokomafont{descriptionlabel}{\rmfamily} \frenchspacing % avoid vertical glue \raggedbottom % this will generate overfull boxes, so we need to set a tolerance % \pretolerance=1000 % pretolerance is what is accepted for a paragraph without % hyphenation, so it makes sense to be strict here and let the user % accept tweak the tolerance instead. \tolerance=200 % Additional tolerance for bad paragraphs only \setlength{\emergencystretch}{30pt} % (try to) forbid widows/orphans \clubpenalty=10000 \widowpenalty=10000 % given that we said footinclude=false, this should be safe \setlength{\footskip}{2\baselineskip} \title{Poželi sve, ne očekuj ništa} \date{2009.} \author{Raoul Vaneigem i Hans Ulrich Obrist} \subtitle{Razgovor sa Raoulom Vaneigemom} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={Poželi sve, ne očekuj ništa},% pdfauthor={Raoul Vaneigem; Hans Ulrich Obrist},% pdfsubject={Razgovor sa Raoulom Vaneigemom},% pdfkeywords={situacionizam}% } \begin{document} \begin{titlepage} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge Poželi sve, ne očekuj ništa\par}}% \vskip 1em {\usekomafont{subtitle}{Razgovor sa Raoulom Vaneigemom\par}}% \vskip 2em {\usekomafont{author}{Raoul Vaneigem i Hans Ulrich Obrist\par}}% \vskip 1.5em \vfill {\usekomafont{date}{2009.\par}}% \end{center} \end{titlepage} \cleardoublepage \tableofcontents % start a new right-handed page \cleardoublepage \chapter{Uvod} Raoul Vaneigem (nizozemski Raul Vaneihem ili francuski Raul Vanegem), belgijski je pisac i filozof, rođen 1934. Studirao je romanistiku u Bruxellesu te sudjelovao u Situacionističkoj internacionali od 1961. do 1970. On i Guy Debord (Gi Debor) bili su dvojica glavnih teoretičara situacionističkoga pokreta, a Vaeneigemovi slogani 1968. godine često su ispisivani na zidovima Pariza. Njegova je najpoznatija knjiga \emph{Revolucija svakodnevnoga života}, koja je tiskana iste godine kad i Debordova knjiga \emph{Društvo spektakla} (1967). Nakon što je napustio situacioniste, napisao je niz polemičkih knjiga braneći ideju slobodnoga i samoregulativnoga društvenoga poretka. Godine 2009. za časopis \emph{e-flux} intervjuirao ga je istaknuti poznavalac suvremene umjetnosti i kustos Hans Ulrich Obrist. \chapter{Razgovor sa Raoulom Vaneigemom} HANS ULRICH OBRIST: Upravo sam bio kod Edouarda Glissanta (Eduara Glisona) i Patricka Chamoiseaua (Patrika Šamoazoa), koji su napisali obraćanje Baracku Obami.\footnote{Édouard Glissant i Patrick Chamoiseau, \emph{L’Intraitable Beauté du monde: adresse à Barack Obama} (Beskompromisna lepota sveta: obraćanje Baraku Obami; Galaade Éditions, Paris, 2009). Esej dvojice kreolskih književnika s Martinika, u kojem su izrazili svoju nadu u drugačiju, humaniju politiku Bele kuće, posle izbora Obame za predsednika SAD, i pozvali na osnivanje međunarodnog tribunala za finansijske zločine i pravedniju raspodelu resursa, koja bi vodila računa o interesima najsiromašnijih. (Nap. AG; ostale napomene: H. U. Obrist)} Koji bi bio vaš apel i\Slash{}ili savjet Obami? RAOUL VANEIGEM: Odbijam održavanje bilo kakvih odnosa s ljudima na vlasti. Slažem se sa zapatistima iz Chiapasa (ćiapasa) koji ne žele imati nikakvog posla ni s državom ni s njenim gospodarima, međunarodnim mafijama. Pozivam na građanski neposluh kako bi lokalne zajednice mogle organizirati, koordinirati i početi same proizvoditi prirodnu energiju, prirodnije poljodjelstvo i komunalne usluge koje bi konačno bile oslobođene muljaža vlada ljevice i desnice. S druge strane, pozdravljam sam poziv Chamoiseaua, Glissanta i njihovih prijatelja za omogućavanje egzistencije u kojoj bi poezija ponovno otkrivenoga života uklonila smrtni stisak robnog tržišta. HANS ULRICH OBRIST: Možete li nam reći nešto o svojim počecima? Kako ste počeli sudjelovati u okviru situacionizma i koji je bio vaš temeljni doprinos? Lik Henrija Lefebvrea (Anrija Lefevra) bio je nezaobilazan na početku vaše suradnje sa Situacionističkom internacionalom. Što vam je on tada značio? Zašto ste mu poslali poetske eseje? RAOUL VANEIGEM: Najprije bih razjasnio da je situacionizam ideologija koju su situacionisti jednoglasno odbijali. Pojam „situacionizma“ bio je tek identifikacijski simbol. Njegova svojstvenost nas je čuvala od pogrešnog vjerovanja u gomile ideologa. Nemam ništa zajedničko sa spektakularnim oživljavanjem projekta koji je, barem u mojem slučaju, neprekidno revolucionaran. Moje učešće u skupini koje više nema bilo je važno za moj osobni razvoj, razvoj koji sam osobno održavao u duhu situacionističkog projekta u njegovom najrevolucionarnijem obliku. Vlastita radikalnost oslobađa me bilo kakvih etiketa. Odrastao sam u okruženju u kojem je naš borbeni duh podgrijavala svijest radničke klase i prilično vesela predodžba postojanja. Zadivila me Lefebvreova \emph{Kritika svakidašnjeg života}. Kada je objavljena \emph{Somme et le reste} (Iznos i ostatak), poslao sam mu neku vrstu eseja o „poeziji i revoluciji“, što je bio pokušaj objedinjavanja radikalnih koncepata, letrističkog jezika, glazbe i filmskih slika, i to priznavanjem da svi imaju zajedničku moć da uzbibaju ljudska srca. Lefebvre je ljubazno odgovorio tako što me povezao s Guyjem Debordom, koji me odmah pozvao u Pariz. Nas dvojica smo bili vrlo različitih temperamenata, ali smo se tijekom razdoblja od gotovo deset godina složili u vezi s potrebom dokidanja potrošačkog društva i zasnivanja jednog novog društva na načelima samoupravljanja, gdje bi život stavio izvan snage preživljavanje i egzistencijalistički duhovni nemir koji ono stvara. HANS ULRICH OBRIST: Koji situacionistički projekti još nisu realizirani? RAOUL VANEIGEM: Psihogeografija, stvaranje situacija, dokidanje grabežljivog ponašanja. Radikalnost, koja nas stalno i iznova motivira unatoč nekim nedostacima, i dalje je izvor nadahnuća do dana današnjega. Njezini utjecaji se tek počinju pokazivati u autonomnim skupinama koje se sada ozbiljno bore s kolapsom financijskog kapitalizma. HANS ULRICH OBRIST: Situacionistička internacionala definirala je situacioniste kao osobe posvećene stvaranju situacija. Što su te situacije konkretno vama značile? Kako biste definirali situacionistički projekt 2009? RAOUL VANEIGEM: Naša je skupina samim svojim načinom života i razmišljanja već radila na shemi situacije, poput desantnih jedinica iza neprijateljskih crta. Vojna metafora dvojbene je naravi, ali jasno ocrtava našu volju da svakodnevni život lišimo kontrole i smrtnoga stiska gospodarstva temeljenog na profitabilnom izrabljivanju čovjeka. Oformili smo „rizičnu skupinu“ koja je bila svjesna neprijateljstva dominantnoga svijeta, potrebe za radikalnim lomom, kao i opasnosti prepuštanja paranoji koja nastaje kod ljudi pod opsadom. Pokazivanjem svojih ograničenja i slabosti, situacionističko iskustvo možemo također gledati kao kritičku meditaciju o novoj vrsti društva čiji su obrisi nastali na temelju Pariške komune, Mahnovog pokreta i Republike vijeća koju su uništili Lenjin i Trocki, slobodarskih zajednica u Španjolskoj, koje je kasnije dokrajčila Komunistička partija. Situacionistički projekt nije usmjeren na ono što slijedi nakon odbacivanja potrošačkog društva i nastanka istinski ljudskog društva. Više je usredotočen na rasvjetljavanje načina na koji životni stil može dokinuti preživljavanje, grabežljivo ponašanje, vlast, trgovinu i impotenciju. HANS ULRICH OBRIST: Vi i Guy Debord glavni ste akteri situacionističkog pokreta. Kako vidite ulogu Deborda i svoju ulogu? RAOUL VANEIGEM: Ne vidim ih kao uloge. Situacionizam u svojoj najapsurdnijoj inačici teži upravo tome (ili, prema francuskoj verziji: To je upravo onaj najveći apsurd, na koji je situacionizam ukazivao; nap. AG) – da budemo svedeni na lutke od papira koje je onda moguće suprotstaviti prema uobičajenom radnom postupku spektakla. Ja sam samo glasnogovornik radikalne svijesti, između ostaloga. Samo radim ono što mogu kako bih osigurao da otpor tržišnoj eksploataciji bude pretvoren u ofenzivu života, kao i da umjetnost življenja ukloni ruševine ugnjetavanja. HANS ULRICH OBRIST: Zbog čega ste istupili iz skupine? RAOUL VANEIGEM: Nakon okupacijskih pokreta iz svibnja 1968. znali smo da slijedi oporavak. Znali smo za mehanizme otuđenja koji bi ugrozili naše zamisli i prikladno ih uklopili u kulturološku slagalicu. Na zadnjoj konferenciji u Veneciji postalo nam je jasno da nismo uspjeli slomiti te mehanizme, da su oni zapravo slamali nas iznutra. Skupina se rasipala, konferencija u Veneciji je upozorila na njenu sve veću beskorisnost, a jedini izneseni odgovori bili su u skladu s parodijom samih sebe u koju smo zapali. Nesloga se pojačala do te mjere da je dolazilo do paranoidnih denuncijacija, do izdaje radikalnosti, do kršenja revolucionarnoga duha, do zanemarivanja savjesti. To doba katarze i anateme daleko je iza nas, ali moglo bi biti korisno ispitati kako smo to posijali sjeme neuspjeha zbog kojega je skupina na koncu platila tako visoku cijenu. Međutim, taj brodolom nije tek nanio na obale zaborava sve nas koji smo sudjelovali u toj pustolovini. Skupina je nestala na način koji je omogućio pojedincima da konsolidiraju svoju radikalnost ili pak da je se odreknu ili da utonu u prijevaru radikalizma. Ja sam pokušao analizirati našu eksperimentalnu avanturu u tekstu \emph{Entre le deuil du monde et la joie de vivre} (Između tugovanja za svijetom i radosti života, 2008). HANS ULRICH OBRIST: Dosta ste pisali o životu, a ne o preživljavanju. U čemu je razlika? RAOUL VANEIGEM: Preživljavanje je život na proračunu. Sustav izrabljivanja prirode i čovjeka, započet još u srednjem neolitiku intenzivnom zemljoradnjom, prouzročio je involuciju u kojoj je kreativnost – kvaliteta imanentna ljudskom rodu – nadomještena radom, stvaranjem gramzive vlasti. Kreativan život, koji se bio počeo razvijati tijekom paleolitika, propao je i nestao pod surovom borbom za opstanak. Od tada je grabež, koja definira životinjsko ponašanje, pokretač svih ekonomskih mehanizama. HANS ULRICH OBRIST: Kako su po vama život i društvo evoluirali do danas, više od četrdeset godina nakon svibnja ‘68? RAOUL VANEIGEM: Svjedoci smo kolapsa financijskog kapitalizma. To je bilo lako predvidjeti. Čak i među ekonomistima, gdje idiota ima čak i više nego u političkoj sferi, bilo je mnogo njih koji su zvonili na uzbunu desetak godina. Naša je situacija paradoksalna: snage represije u Europi nisu nikada bile ovoliko oslabljene, ali ni izrabljivane mase nisu nikada bile ovako pasivne. Međutim, pobunjenička svijest uvijek spava s jednim okom otvorenim. Arogancija, nesposobnost i nemoć vladajućih klasa na koncu će je probuditi iz sna, što vrijedi i za razvoj najradikalnijih momenata iz svibnja 1968. u našim srcima i dušama. HANS ULRICH OBRIST: Vaša nova knjiga vodi nas na putovanje „između tugovanja za svijetom i radosti života“. Osvrćete se na svibanj ‘68. Što je ostalo od svibnja ‘68? Je li sve to u cijelosti prisvojeno? RAOUL VANEIGEM: Čak i to što danas vidimo kako na brzinu krpaju reciklirane ideologije i stare vjerske slabosti i serviraju ih da bi nahranili sveopći očaj na kojem zarađuju naši bajni čelnici, neće moći duže vrijeme skrivati civilizacijsku promjenu koju je otkrio svibanj 1968. Raskid s patrijarhalnim vrijednostima je konačan. Na putu smo prema kraju izrabljivanja prirode, rada, trgovine, grabeži, razdvojenosti od samih sebe, žrtvovanja, krivnje, odustajanja od sreće, idoliziranja novca, vlasti, hijerarhije, prezira prema ženama i straha od njih, obmanjivanja djece, intelektualne kontrole, despotizma vojske i policije, religija, ideologija, represije i kobnih posljedica psihičke napetosti. To nije tek puka činjenica, nego proces koji traje i jednostavno traži od nas više opreza, svijesti i solidarnosti sa životom. Trebamo napraviti novu bazu kako bismo mogli rekonstruirati, i to na ljudskim temeljima, svijet uništen neljudskošću kulta robnog tržišta. HANS ULRICH OBRIST: Što mislite o današnjem vremenu, godine 2009? Jean-Pierre Page (Žan Pjer Paž) je upravo objavio knjigu \emph{Penser l’après crise} (Razmišljanje o dobu nakon krize). Po njemu sve treba iznova osmisliti. On tvrdi da se stvara novi svijet, u kojem je prekinut pokušaj uspostave globalizacije pod vodstvom SAD-a. RAOUL VANEIGEM: Agrarna privreda Staroga režima u Francuskoj bila je fosilizirana forma koju je razorila novonastala slobodna trgovina od revolucije 1789. nadalje. Slično tome, spekulativni kapitalizam koji se poigrava dionicama, a čiji slom sada vidimo, ubrzo će biti zamijenjen kapitalizmom osvježenim proizvodnjom nezagađujuće prirodne energije, povratkom na iskoristive vrijednosti, organsku poljoprivredu, na brzinu zakrpan javni sektor te na licemjerno moraliziranje trgovine. Budućnost pripada samoupravnim zajednicama koje proizvode neophodne robe i usluge za sve (prirodna energija, bioraznolikost, obrazovanje, domovi zdravlja, promet, metalna i tekstilna industrija\dots{}). Cilj je da se proizvodi za nas, za naše potrebe, odnosno, ne više prodaje radi, i to roba koju smo trenutačno prisiljeni kupovati po tržišnim cijenama, iako su je osmislili i napravili radnici. Vrijeme je za raskid sa zakonima političkoga reketa koji je krivac za vlastiti bankrot, kao i onaj naše egzistencije. HANS ULRICH OBRIST: Je li ovo nekakav rat nove vrste, kako to tvrdi Page? Ekonomski Treći svjetski rat? RAOUL VANEIGEM: U ratu smo, tako je, ali to nije ekonomski rat. Na djelu je svjetski rat protiv ekonomije. Protiv ekonomije koja se tisućama godina temelji na izrabljivanju prirode i čovjeka, kao i protiv zakrpanoga kapitalizma koji će pokušati spasiti svoju kožu ulaganjem u prirodnu energiju i natjerati nas da plaćamo veće cijene za ono što će nakon stvaranja novih sredstava proizvodnje biti besplatno, npr. vjetar, sunce i energija biljaka i tla. Ako ne odbacimo ekonomsku stvarnost i ne zamijenimo je onom ljudskom, još jedanput ćemo dopustiti tržišnom barbarstvu da ostane na životu. HANS ULRICH OBRIST: Joseph Stiglitz (Džozef Stiglic) se u svojoj knjizi \emph{Uspjeh globalizacije} zalaže za reorganizaciju globalizacije u skladu s većom pravednošću, a radi smanjenja neravnoteže u svijetu. Što vi mislite o globalizaciji? Kako se možemo riješiti profita kao motiva i umjesto toga težiti dobrobiti? Kako možemo pobjeći od imperativa razvitka? RAOUL VANEIGEM: Moralno opravdavanje profita je iluzija i prijevara. Mora doći do odlučnog raskida s gospodarskim sustavom koji stalno širi propast i uništenje, a istovremeno se usred neprekidne oskudice pretvara da omogućava izrazito hipotetsko blagostanje. Ljudski odnosi moraju zamijeniti i poništiti trgovinske odnose. Građanski neposluh znači zanemarivanje odluka vlade koja potkrada svoje građane da bi pomogla utaje financijskog kapitalizma. Zašto bismo plaćali poreze državi koja podupire bankare-gangstere, poreze koji se uzaludno koriste da bi se začepile rupe korupcije, kada bismo ih umjesto toga mogli koristiti za samoupravljanje u mrežama slobodne vlasti u svim lokalnim zajednicama? Izravna demokracija samoupravnih vijeća ima sva prava da ignorira dekrete korumpirane parlamentarne demokracije. Građanski neposluh prema državi koja nas pljačka jest pravo. Na nama je da izvučemo korist iz ove epohalne promjene kako bismo stvorili zajednice u kojima želja za životom nadvladava tiraniju novca i vlasti. Ne trebamo se brinuti ni za državni dug, kojim se prikriva masivna zloporaba javnog interesa, ni za derivat profita koji nazivaju „razvitkom“. Od sada cilj lokalnih zajednica treba biti proizvodnja za vlastite potrebe i svojim snagama, i to sve robe od društvene vrijednosti, uz zadovoljavanje potreba svih ljudi – autentičnih potreba, naime, a ne potreba koje je ustvrdila konzumeristička propaganda. HANS ULRICH OBRIST: Edouard Glissant naglašava razliku između globalnosti i globalizacije. Globalizacija iskorjenjuje razlike i homogenizira, dok je globalnost globalni dijalog koji stvara razlike. Što vi mislite o njegovom poimanju globalnosti? RAOUL VANEIGEM: Po meni bi to trebalo značiti djelovanje na lokalnoj i globalnoj razini kroz savez zajednica u kojoj našu korumpiranu parlamentarnu demokraciju s tobožnjim lokalpatriotski usmjerenim korištenjem državnog novca zamjenjuje superiornija izravna demokracija. Osnivat će se lokalni odbori, koji će poduzimati radnje u korist okoliša i svakodnevnog života svih nas. Situacionisti to zovu „stvaranjem situacija koje isključuju bilo kakvo vraćanje“. HANS ULRICH OBRIST: Bi li trenutačni pobačaji globalizacije mogli imati iste opasne posljedice kao i pobačaji prethodne globalizacije iz 1930-ih? Napisali ste da je ono što je već bilo nepodnošljivo ‘68, kada je gospodarstvo bilo u ekspanziji, danas još nepodnošljivije. Smatrate li da bi sadašnje ekonomsko beznađe moglo natjerati nove generacije na pobunu? RAOUL VANEIGEM: Kriza 1930-ih bila je ekonomske naravi. Danas smo pak suočeni s implozijom ekonomije kao sustava upravljanja. Na djelu je kolaps tržišne civilizacije i pojava ljudske civilizacije. Sadašnje previranje označava duboku promjenu: referentne točke staroga patrijarhalnoga svijeta nestaju. Umjesto toga se filtriraju, doduše još uvijek oskudno i bezglavo, početni znaci životnoga stila koji je istinski ljudske naravi, savez s prirodom koji staje na kraj njenom izrabljivanju, silovanju i pljačkanju. Najgori bi bio nedostatak svijesti o životu i manjak senzibiliteta, kao i nasilje bez savjesti. Mafijama koje se bave reketom ništa nije profitabilnije od kaosa, beznađa, samoubilačke pobune i nihilizma koje širi plaćenićka pohlepa, pri čemu je novac, čak i kada je obezvrijeđen uslijed panike, i dalje jedina vrijednost. HANS ULRICH OBRIST: Immanuel Wallerstein u svojoj knjizi \emph{Utopisti} tvrdi da naš svjetski sustav prolazi kroz strukturalnu krizu. On predviđa da će biti potrebno još nekih dvadeset do pedeset godina da ga zamijeni jedan demokratskiji i ravnopravniji sustav. Vjeruje da budućnost pripada „odtrženim“, besplatnim institucijama (po uzoru na, recimo, narodne knjižnice). Stoga se moramo suprotstaviti plasiranju vode i zraka na tržište.\footnote{Immanuel Wallerstein, \emph{Utopistics: Or, Historical Choices of the Twenty-first Century} (New York: The New Press, 1998).} Što vi mislite o tome? RAOUL VANEIGEM: Ne znam koliko će tekući preobražaj trajati (no nadam se da neće predugo, jer bih volio to doživjeti). Međutim, siguran sam da će novi savez sa silama života i prirode širiti jednakost i besplatnost. Moramo nadići svoju prirodnu ozlojeđenost zbog prisvajanja naše vode, zraka, tla, okoliša, biljaka i životinja u korist profita. Moramo osnovati kolektive koji su u stanju upravljati prirodnim izvorima u korist ljudskih, a ne tržišnih interesa. Taj proces preraspodjele koji predviđam ima i svoje ime: samoupravljanje, koje je u praksi okušano više puta u neprijateljski naklonjenim povijesnim kontekstima. U ovom trenutku, s obzirom na imploziju potrošačkog društva, čini se da je to jedino rješenje kako za pojedince, tako i društvo. HANS ULRICH OBRIST: U svojim ste tekstovima opisali imperativ rada kao neljudsko, gotovo životinjsko stanje. Smatrate li da je tržišno orijentirano društvo regresija? RAOUL VANEIGEM: Kao što sam to već rekao, evolucija u doba paleolitika značila je razvoj kreativnosti, koja je karakteristika ljudske vrste, jer probija okvire svoje izvorne animalnosti. Međutim, za vrijeme neolitika osmozni je odnos prema prirodi sve više slabio, budući da se intenzivna poljoprivreda počela temeljiti na pljačkanju i izrabljivanju prirodnih dobara. Tada se pojavila i religija kao institucija, društvo se raslojilo, počela je vladavina patrijarhata, preziranja žena, a svećenici i kraljevi su kumovali nizu ratova, oskudici i nasilju. Stvaralaštvo je zamijenjeno radom, život preživljavanjem, uživanje životinjskom grabeži koju ekonomija prisvajanja otuđuje, uzdiže i produhovljuje. U tom smislu tržišna civilizacija doista jest regresija u kojoj tehnički napredak ima prednost u odnosu na ljudski napredak. HANS ULRICH OBRIST: Što je po vama život u razvoju? RAOUL VANEIGEM: Napredovanje od preživljavanja, borbe za opstanak i grabežljivosti prema novoj umjetnosti življenja preuređenjem svijeta na dobrobit svih nas. HANS ULRICH OBRIST: Moji intervjui često imaju naglasak na povezanosti umjetnosti i arhitekture\Slash{} urbanizma ili književnosti i arhitekture\Slash{} urbanizma. Možete li mi reći nešto o Birou jedinstvenog urbanizma? RAOUL VANEIGEM: To je više bio nekakav koncept negoli projekt. Tema je bila nužna obnova našeg društvenog tkiva, koje je iznimno razorio smrtni stisak tržišta. Ta obnova ide ruku pod ruku s obnovom svakodnevnog života koju trebaju provesti pojedinci. To je i sama bit psihogeografije – strastveno i kritičko otkrivanje onoga što u našem okruženju treba uništiti, podvrći \emph{détournementu} (deturnamanu),\footnote{\emph{Détournement}: skretanje, diverzija nekog sadržaja, ka željenom smislu ili ishodu. Uz \emph{dérive} („prolazak“), koji se javlja malo dalje u tekstu, jedan od ključnih pojmova iz teorije i prakse letrističke\Slash{} situacionističke grupe. (AG)} obnoviti. HANS ULRICH OBRIST: Po vama urbanizam zapravo ne postoji? RAOUL VANEIGEM: Urbanizam je ideološko planiranje i kontrola pojedinaca i društva putem ekonomskog sustava koji izrabljuje čovjeka i Zemlju i pretvara život u robu. Opasnost u danas sve snažnijem pokretu samoizgradnje kuća leži u tome što se više pozornosti daje štednji novca nego poeziji novoga stila življenja. HANS ULRICH OBRIST: Kako vidite gradove u 2009? Kakav bi bio jedinstveni urbanizam za treće tisućljeće? Kakvu budućnost gradova predviđate? Koji vam je najdraži grad? Kažete da je Oarystis grad želja.\footnote{Raoul Vaneigem, \emph{Preliminary Notes on a Project for the Construction of Oarystis, the City of Desire} (2002), [[http:\Slash{}\Slash{}www.notbored.org\Slash{}oarystis.html][http:\Slash{}\Slash{}www.notbored.org\Slash{}oarystis.html] (AG)} Oarystis nadahnuće crpi iz svijeta djetinjstva i ženstvenosti. U Oarystisu ništa nije statično. John Cage je jednom rekao da, baš kao što je to slučaj i s prirodom, „čovjek nikada ne dolazi do točke uobličenosti ili zgotovljenosti. Situacija se svodi na stalnu nepredvidivu promjenu.“\footnote{Navedeno u Richard Kostelanetz, \emph{Conversing with Cage}, 2nd ed. , New York: Routledge, 2003, 34.} Slažete li se s Cageom? RAOUL VANEIGEM: Volim neobavezne šetnje Venecijom i Pragom. Dragi su mi i Mantova, Rim, Bologna, Barcelona i neke četvrti Pariza. Nije mi toliko bitna sama arhitektura koliko ljudska toplina koju je njena ljepota uspjela sačuvati. Čak je i Bruxelles, koji su toliko uništili investitori i sramotni arhitekti (a nemojmo zaboraviti da je u dijalektu Bruxellesa riječ „arhitekt“ ustvari uvreda), uspio zadržati nekoliko krasnih bistroa. Šetnja od jednoga do drugoga daje Bruxellesu neki šarm koji mu je urbanizam potpuno oduzeo. Oarystis koji opisujem nije idealan grad ili prostor kao uzorak (jer su svi uzorci totalitarni). To je tek nezgrapna i naivna gruba skica kao podloga eksperimenta za koji se još uvijek nadam da bi jednom mogao biti ostvaren, pa se stoga slažem s Johnom Cageom. Tu se ne radi o nekakvom dijagramu, nego o eksperimentalnom prijedlogu po kojem se stvaranje okruženja podudara sa stvaranjem vlastite budućnosti pojedinaca. HANS ULRICH OBRIST: Zasniva li se Oarystis na prirodnoj energiji poput metabolističkih gradova? S Remom Koolhaasom radim na knjizi o japanskim metabolistima. Kada sam pročitao vaš izvrstan tekst o Oarystisu, prisjetio sam se tog pokreta iz 1960-ih, posebice plutajućih gradova, Kikutakeovih vodenih gradova. Je li Oarystis metabolistički grad? RAOUL VANEIGEM: Kada je Oarystis objavljen, arhitekt Philippe Rothier (Filip Rotje) i Diane Hennebert (Dian Enber), koja je tada bila voditeljica Muzeja arhitekture u Bruxellesu, s pravom su me kritizirali zbog ignoriranja maštovitih projekata novog naraštaja neimara. Sada, kada se stari svijet ruši, fuzija besplatne prirodne energije, tehnika samoizgradnje stambenih jedinica i ponovno otkrivanje senzualnih oblika bit će presudno važno. Stoga je korisno prisjetiti se da tehnička inventivnost mora proizlaziti iz ponovnog otkrivanja života pojedinaca i kolektiva. To znači da je samoupravljanje ono što omogućava istinski preokret i zanosnu inventivnost. Pojedinci i odbori s pomoću njega upravljaju svojim životima i okolišem putem izravne demokracije. Pružimo neograničenu slobodu imaginarnoga djetinjstvu i djeci u nama. HANS ULRICH OBRIST: Prije nekoliko godina intervjuirao sam Constanta (Konstana) u vezi s Novim Babilonom. O čemu ste vi razgovarali s Constantom i kakvo je vaše viđenje Novog Babilona danas? RAOUL VANEIGEM: Nisam upoznao Constanta, koji je, ako se ne varam, bio izbačen iz Situacionističke internacionale prije mojeg pristupanja. Mana Novoga Babilona je u tome što daje prednost tehnologiji nad stvaranjem pojedinačnog i kolektivnog načina života, što je nužan temelj svih arhitektonskih zamisli. Zanimaju me samo oni arhitektonski projekti koji se bave stvaranjem svakodnevnog života. HANS ULRICH OBRIST: Kako gradovi budućnosti mogu pridonijeti bioraznolikosti? RAOUL VANEIGEM: Nadahnjujući se Alphonsom Allaisom (Alfonsom Aleom), poticanjem prodiranja sela u gradove. Stvaranjem zona organske poljoprivrede, vrtova, povrtnjaka i poljoprivrednih gospodarstava unutar urbanih prostora. Na kraju, imamo toliko birokratskih i parazitskih objekata koji jedva čekaju prepustiti mjesto plodnoj i ugodnoj zemlji na korist svima. Arhitekti i bespravni stanari, izgradite nam viseće vrtove u kojima ćemo šetati, jesti i živjeti! HANS ULRICH OBRIST: Oarystis ima oblik labirinta, ali je i pod utjecajem Venecije i njenih javnih trgova. Možete li mi reći nešto o oblikovanju Oarystisa? RAOUL VANEIGEM: Naši unutarnji prostornovremenski odnosi su poput labirinta. U njima smo svi mi istodobno Tezej, Arijadna i Minotaur. Naš \emph{dérive} (deriv)\footnote{\emph{Dérive}: šetnja, ali više u smislu „prolazak“ kroz neki gradski ambijent, da bi se otkrila njegova „psihogeografska“ svojstva (potencijal za buđenje strasti, igru, refleksiju, stvaranje novih situacija), kao što je to naglašeno u situacionističkim tekstovima na tu temu („Naše situacije biće lišene budućnosti, \emph{prolasci}“, \emph{Izveštaj o konstruisanju situacija}, 1957) ili u Deborovim filmovima („O \emph{prolasku} nekoliko osoba kroz prilično kratku jedinicu vremena“, 1959). (AG)} može povećati svjesnost, pozornost, harmoniju i sreću samo ako izvanjski prostornovremenski odnosi osiguraju meandre koji mogu prizvati moguće tokove naše budućnosti, poput neke vrste analogije ili jeke, naklonjene igri života, sprječavajući njenu inverziju u igru smrti. HANS ULRICH OBRIST: Hoće li muzeji biti ukinuti? Možete li nam reći nešto o amfiteatru sjećanja? Je li to prosvjed protiv zaborava? RAOUL VANEIGEM: Muzeji pate od toga što su to zatvoreni prostori u kojima su djela neiskorištena. Slikarstvo, kiparstvo i glazba pripadaju ulici, poput fasada koje nas promatraju i oživljavaju kada ih pozdravimo. Baš kao u životu i u ljubavi, učenje je neprestani tok koji uživa privilegij navodnjavanja i oplođivanja našeg senzibiliteta. Ništa nije zaraznije od stvaranja. Međutim, prošlost sa sobom također nosi svu nečistoću naše neljudskosti. Što da napravimo s tim? Nekakav muzej užasa, barbarizma prošlosti? Pokušao sam odgovoriti na pitanje „obaveze sjećanja“ u \emph{Ni pardon, ni talion} (Ni oprost, ni odmazda): \begin{quote} „Odmalena nas tjeraju da obožavamo velikane, od kojih su većina bili obični cinični ili prepredeni ubojice. Povijest koju podučavaju u školama i raspačavaju u prebujnoj i hagiografskoj literaturi primjer je obmane. Pomodan pojam za to je negacionizam. Možda ne negira da su plinske komore doista postojale, možda više ne diže spomenike u slavu Staljina, Maoa ili Hitlera, ali i dalje ustrajno slavi surove osvajače: Aleksandra, zvanog Veliki – čiji je mentor bio Aristotel, kako se to s ponosom ističe – pa Julija Cezara, Džingisa Kana, Tamerlana, Napoleona, gomile generala, koljača naroda, beznačajnih tirana u gradovima i državama, suce-mučitelje, Javerte (Haverte) svake vrste, prevrtljive diplomate, silovatelje i ubojice u najmu vjera i ideologija. Toliko je toga uzvišenoga isklesano od podlosti, pokvarenosti i opakosti. Ne želim reći da bismo trebali razrovati avenije službene povijesti i umjesto toga popločati sporedne uličice. Ne treba nam pročišćena povijest, nego znanje koje crpi sasvim jasne činjenice koje su zamagljene, i to već generacijama, neprekidnim raslojavanjem predrasuda. Ne pozivam na intelektualni sud radi proglašavanja krivnje hrpe nepoželjnika bizarno postavljenih na pijedestale i slavljene u lakrdijaškim panteonima službenog sjećanja. Samo želim vidjeti i popis njihovih zlodjela te da se inventaru njihovih neukusnih hvalospjeva dodaju i njihove žrtve, kao i uspomena na one koji su im se suprotstavili. Ne želim reći da bi ime Francisca Ferrera trebalo prebrisati ono njegovog ubojice, Alfonsa XIII, ali bi u najmanju ruku valjalo znati sve o obojici. Kako se i dalje usuđuju gajiti u udžbenicima bilo kakvo poštovanje za Bonapartu, koji je odgovoran za pogibiju milijuna ljudi, za Louisa XIV, koljača seljaka i progonitelja protestanata i slobodoumnih? Za Kalvina – ubojicu Jacquesa Grueta (Žaka Griea) i Michela Serveta (Mišela Servea) – i diktatora Ženeve, čiji su stanovnici jednoga dana odlučili u čast Sébastiena Castelliona (Sebastiana Kasteliona)\footnote{Sébastien Castellión (1515–1563), francuski teolog, Kalvinov suparnik, kritičar njegovog dogmatizma i despotske vladavine; takođe, zagovornik verske tolerancije i razdvajanja crkve i države. (AG)} uništiti grbove i simbole tako bezvrijednoga štovanja? Premda je Španjolska srušila spomenike frankizma i promijenila nazive ulica koje je nametnuo fašizam, još uvijek nekako toleriramo da se prema nebu Pariza uzdiže Sacré-Coeur („Sakre ker“, sveto srce), čija odvratna arhitektura slavi razbijanje Komune.\footnote{Bazilika Presvetog Srca Isusovog je namerno podignuta na vrhu Monmartra, tako da dominira tim najbuntovijim delom Pariza, u kojem je i počeo ustanak iz 1871. Prema deklaraciji Parlamenta, iz 1873, a na zahtev tadašnjeg pariskog nadbiskupa, Bazilika je trebalo da „okaje zločine pariske Komune“, u koje je crkva pre svega ubrajala pogubljenje pariskog nadbiskupa Georgesa Darboya od strane komunara. Kasnije je to bilo ublaženo zvaničnim tumačenjem, koje je ušlo i u turističke vodiče, po kojem taj hram navodno podignut u čast svih 58.000 žrtava Francusko-Pruskog rata 1870. i građanskog rata 1871. (AG)} U Belgiji još postoje avenije i spomenici u čast kralja Leopolda II, jednog od najciničnijih kriminalaca devetnaestoga stoljeća, čija je politika ‘crvene gume’\footnote{Ili „krvave gume“. Belgijske kolonijalne vlasti su ostale upamćene po strahovitom teroru nad urođeničkim stanovništvom prisiljenim na rad na plantažama kaučuka. (AG)} – koju su javno osudili Mark Twain, Roger Casement (Rodžer Kejsment) (koji je to platio životom),\footnote{Izveštaj Rogera Casementa (1864–1916), tadašnjeg britanskog konzula u Francuskom Kongu, iz 1904, o stanju u „Slobodnoj državi Kongo“, presudno je uticao na oduzimanje prava na privatnu eksploataciju te teritorije belgijskom kralju Leopoldu II i prenošenje svih ovlašćenja na belgijski Parlament i lokalnu kolonijalnu administraciju. Ipak, Casement je pogubljen kao irski nacionalista, posle ustanka u Irskoj 1916, a ne zbog svog angažmana u Belgijskom Kongu. (AG).} Edward Dene Morel (Edvard Din Morel) i u novije vrijeme Adam Hochschild (Hoksčajld) – do sada nije uznemirila gotovo ničiju savjest. Ovo nije poziv da se dignu u zrak njegovi kipovi ili da se uklone natpisi u njegovu slavu. Ovo je poziv stanovnicima Belgije i Konga da dezinficiraju javne površine uklanjanjem ljage jednog od najgorih pokrovitelja kolonijalnoga divljaštva. Paradoksalno je to što ja vjerujem da zaborav može biti produktivan kada je riječ o počiniteljima nehumanih djela. Zaborav koji ne briše spomen, koji ne precrtava sjećanje, koji nije nametnuta odluka, nego koji pak nastaje spontanim osjećajem gađenja, poput izbjegavanja pseće kakice na nogostupu u zadnji čas. Želio bih da huškači brutalnosti iz prošlosti budu zakopani u veo svojih zala kada se otkrije njihova nehumanost. Sjećanje na zločine treba zbrisati sjećanje na kriminalce.“\footnote{Raoul Vaneigem, \emph{Ni pardon, ni talion: La question de l’impunité dans les crimes contre l’humanité}, Paris: Editions La Découverte, 2009.} \end{quote} HANS ULRICH OBRIST: Učenje se svodi na napuštanje škola i izlazak na ulice. Postaju li ulice Thinkbeltovi? \emph{Potteries Thinkbelt} Cedrica Pricea (Sedrika Prajsa) koristili su napuštene željezničke pruge za „skočne“ škole. Što je i gdje je učenje danas? RAOUL VANEIGEM: Učenje je trajan proces za sve nas, bez obzira na dob. Znatiželja hrani žeđ za znanjem. Poriv za podučavanjem proizlazi iz zadovoljstva prenošenja života. To nije ni nametanje niti nekakav odnos snaga, nego čisti dar, poput života, od kojega i teče. Ekonomski totalitarizam je otrgnuo učenje od života, čija bi kreativna savjest ono trebalo biti. Želimo svugdje sijati tu poeziju znanja koja se sama nudi. Protivimo se školi kao hermetičnom prostoru (nekoć vojarna, a danas tržište robova). Moramo otkriti nomadsko učenje. HANS ULRICH OBRIST: Kako predviđate razvoj sveučilišta u 21. stoljeću? RAOUL VANEIGEM: Sveučilište će odumrijeti. Likvidirat će ga traganje za univerzalnim znanjem i njegovo svakodnevno korištenje, jer je ionako uvijek bio tek njegova blijeda lakrdija. HANS ULRICH OBRIST: Možete li mi reći nešto o načelu besplatnosti (jer me to izrazito zanima; kao kustos oduvijek vjerujem da bi muzeji trebali biti besplatni – Umjetnost za sve, kako su to kazali Gilbert i George). RAOUL VANEIGEM: Besplatnost je jedino apsolutno oružje kojim se može razbiti silni stroj samorazaranja koji je pokrenulo potrošačko društvo, a čija implozija još uvijek traje, poput smrtonosnog plina, uz mentalitet vezan za materijalni aspekt, pohlepu, financijsku dobit, profit i grabež. Muzeji i kultura nedvojbeno trebaju biti besplatni, ali isto vrijedi i za javne usluge, koje su trenutačno plijen prevarantskih multinacionalnih kompanija i država. Besplatni vlakovi, autobusi, podzemne željeznice, besplatna zdravstvena skrb, besplatno školovanje, besplatna voda, zrak, struja, besplatna energija, a sve to putem alternativnih mreža koje valja zasnovati. Kako se besplatnost bude širila, nove mreže solidarnosti iskorijenit će smrtni stisak robnog tržišta. Razlog je u tome što je život dar, besplatan, neprekidno stvaranje koje nam zloćudno profitiranje tržišta uskraćuje. HANS ULRICH OBRIST: A gdje je ljubav u Oarystisu? RAOUL VANEIGEM: Svugdje. Ljubavna veza, podjednako i složena i jednostavna, služit će kao modul novih odnosa solidarnosti koji će prije ili kasnije dokinuti sebičnu proračunatost, konkurenciju, nadmetanje i grabež, uzroke dehumanizacije naših društava. HANS ULRICH OBRIST: A gdje je tu grad mrtvih? U šumi, a ne na groblju? RAOUL VANEIGEM: Tako je, u šumi, u auditoriju u kojem će glasovi mrtvih govoriti usred bujne prirode, gdje se život stvara stalno i iznova. HANS ULRICH OBRIST: Sanjate li i neke druge utopijske gradove osim Oarystisa? Možda nekakvu konkretnu utopiju vezanu za grad? RAOUL VANEIGEM: Ne, ali i dalje me drži nada da bi takvi projekti mogli probujati i biti ostvareni jednoga dana, kada počnemo obnavljati svijet razoren reketaškom mafijom. HANS ULRICH OBRIST: Godine 1991. osnovao sam muzej Roberta Walsera, šetološki muzej, u Švicarskoj. Oduvijek me fascinira vaše poimanje šetnje. Možete li reći nešto o svojim gradskim šetnjama s Debordom i bez njega? Nešto o Walseru (valzeru)? Jesu li vas nadahnuli i drugi šetolozi? RAOUL VANEIGEM: Iznimno cijenim Roberta Walsera, kao uostalom i mnogi drugi. Njegova lucidnost i osjećaj za dérive očarali su Kafku. Oduvijek sam fasciniran dugim putovanjem na koje se Hölderlin zaputio nakon svog prekida s Diotimom. Obožavam Chatwinove \emph{Pjevane staze}, u kojima on nekako uspijeva pretvoriti najbezazleniju šetnju u izražavanje putova sudbine, kao da smo usred australske divljine. Isto tako poštujem i šetnje Léon-Paula Farguea (Leona-Pola Farga) i učenje Hérona de Villefossea (Erona de Vilfosa). Moj niz psihogeografskih dérivea s Guyjom Debordom u Parizu, Barceloni, Bruxellesu, Beerselu (Beršelu) i Antwerpenu bili su iznimni trenuci, kombinacija teoretskih špekulacija, senzibiliteta, kritičke analize bića i mjesta te vedro uživanje u piću. Naše matične luke bili su ugodni bistroi toplog ozračja, utočišta u kojima je čovjek mogao biti ono što jest jer je osjećao u zraku nešto od autentičnog života, koliko god on bio krhak i kratkotrajan. Raspoloženje je bilo identično onome koje nas je vodilo u našim lunjanjima ulicama i uličicama, kroz vijuganje užitka koje smo mjerili svakim korakom u smislu onoga što bi trebalo da ga još malo razvijemo i poboljšamo. Imam osjećaj da će kvartovi koje su uništili likovi poput Haussmanna (Osmana), Pompidoua i drugi barbari koji su dirali u nekretnine jednog dana sami žitelji obnoviti u duhu radosti i života koje su nekoć gajili. HANS ULRICH OBRIST: Kakve mogućnosti vidite za ukidanje otuđenja i \emph{détournement} u 2009? RAOUL VANEIGEM: U vremenu smo nezapamćenoga kaosa u materijalnom i moralnom smislu. Ljudske vrijednosti će morati korigirati učinke jedine vrijednosti koja do danas prevladava – novca. Međutim, implozija financijskog totalitarizma znači da je ta valuta, koja nas vrlo sputava, sada osuđena na devalvaciju i gubitak bilo kakva značenja. Apsurdnost novca postaje konkretna. Postupno će ga zamijeniti novi oblici razmjene, koji će ubrzati njegov nestanak i dovesti do ekonomije darivanja. HANS ULRICH OBRIST: Kakve su okolnosti za dijalog 2009? Ima li izlaza iz ovog sustava izolacije? RAOUL VANEIGEM: Dijalog s vlastima nije ni moguć ni poželjan. Vlast oduvijek djeluje jednostrano, organizira kaos, širi strah, prisiljava pojedince i zajednice na sebično i slijepo povlačenje. Možemo očekivati da ćemo zasnovati nove mreže solidarnosti i nove interventne odbore radi dobrobiti svih nas i svakoga od nas. To će zamijeniti odredbe države i njenih mafijaško-političkih hijerarhija. Glas proživljene poezije izbrisat će i zadnje preostale odjeke diskursa u kojem su riječi u službi profita. HANS ULRICH OBRIST: U svojim novijim knjigama razmatrate svoje postojanje i privremenost. Homogenizirajuće snage globalizacije homogeniziraju vrijeme i obratno. Kako raskrstiti s tim? Možete li nam reći nešto o privremenosti sreće u pojmovnom smislu? RAOUL VANEIGEM: Ekonomija utemeljena na produktivnosti i profitu usadila je u proživljenu ljudsku stvarnost zasebnu stvarnost ustrojenu prema njenim vodećim mehanizmima: grabeži, konkurenciji i nadmetanju, stjecanju i borbi za vlast i opstanak. Takvo neprirodno ljudsko ponašanje smatra se prirodnim već tisućama godina. Privremenost crpljenja, erozije, umora i propadanja utvrđuje se radom, aktivnošću koja dominira i kvari sve ostale. Privremenost želja, ljubavi i stvaranja ima koncentraciju koja slama privremenost preživljavanja uvjetovanog radom. Privremenost novca zamijenit će privremenost želja, iskustvo s druge strane ogledala, prolaz prema teritorijima koji nisu ucrtani na mape. HANS ULRICH OBRIST: Je li život bezvremenska kategorija? RAOUL VANEIGEM: Ne tvrdim da jest. Međutim, budući da je preživljavanje tek stalna agonija iz koje izbavljenje nudi prijevremena smrt, oprirođeni život koji gaji sve svoje potencijale strasti i stvaranja sigurno bi imao dovoljno vitalnosti za znatno odgađanje svojeg kraja. HANS ULRICH OBRIST: \emph{Revolucija svakidašnjeg života} bila je okidač za svibanj ‘68, a već ste u drugim intervjuima kazali da je to vaša ključna knjiga koju stalno dopunjujete. Je li ta knjiga bila pravo otkriće? Kako je promijenila tok vašeg rada? Što ste radili prije nje? RAOUL VANEIGEM: Knjigu je potaknula moja tadašnja hitna potreba za novim pogledom na svijet i samoga sebe, da bih se izvukao iz stanja preživljavanja, ali ne samoubojstvom. Zbog tog kritičkog osvrta na potrošačko društvo, koje je tako nemilosrdno kvarilo i uništavalo život, postao sam svjestan što me pogoni. Usto mi je vrlo brzo postalo jasno da to nije tek nekakav samoljubiv projekt, nego i da su mnogi čitatelji u njemu našli i svoje velike probleme. HANS ULRICH OBRIST: \emph{Revolucija svakidašnjeg života} završava optimistično: „Možemo ishoditi svijet užitka, a nemamo što izgubiti doli dosade.“\footnote{Raoul Vaneigem, \emph{The Revolution of Everyday Life}, trans. Donald Nicholson-Smith (Welcombe, UK: Rebel Press, 2001), 279. Orig., \emph{Traité de savoir-vivre à l’usage des jeunes générations} (Rasprava o svakodnevnom životu za dobro mlade generacije), 1967.} Jeste li još uvijek optimist? RAOUL VANEIGEM: Scutenaire (Skitener) je napisao sljedeće: „Pesimisti, čemu ste se ono nadali?“ Nisam ni pesimist ni optimist. Pokušavam ostati odan načelu: poželi sve, ali ne očekuj ništa. HANS ULRICH OBRIST: Koja je najnovija inačica knjige? RAOUL VANEIGEM: \emph{Entre le deuil du monde et la joie de vivre} (Između tugovanja za svijetom i radosti života). HANS ULRICH OBRIST: Na kojoj knjizi sada radite? RAOUL VANEIGEM: Volio bih da imam mogućnosti dovršiti \emph{Rječnik krivovjerja} radi objašnjenja i ispravljanja povijesnih elemenata u \emph{Pokretu slobodnog duha} i \emph{Otporu kršćanstvu}. HANS ULRICH OBRIST: Pitanje privremenosti nas vodi i do Prousta i njegova upitnika. Kako biste vi definirali sreću 2009.? RAOUL VANEIGEM: Sve intenzivniji i strasniji život u sve intenzivnijem svijetu. Onima koji se podsmjehuju mojoj ekstatičnoj otvorenosti mogu odgovoriti izrekom koja mi je veliko ohrabrenje: „Želja za drugačijim životom već je sam taj život.“\footnote{Raoul Vaneigem, „Le désir d’une vie autre est déjà cette vie-là“, \emph{Cahiers internationaux de symbolisme} 119–121 (2008): 193–194.} HANS ULRICH OBRIST: Imate li neostvarenih projekata? Nenapisanih knjiga ili neostvarenih projekata u drugim područjima, neostvarenih arhitektonskih projekata? RAOUL VANEIGEM: Prioritet mi je da živim sve bolje u sve humanijem svijetu. Rado bih izgradio „urbano selo“ Oarystisa, ali nisam od onih koji samo strpljivo čekaju, poput Fouriera (Furijea) u Kraljevskoj palači, da nekakav milijarder odluči financirati projekt da bi koji trenutak kasnije sve izgubio zbog financijskoga kraha. HANS ULRICH OBRIST: A što je s vašom suradnjom s drugim umjetnicima, slikarima, kiparima, projektantima, filmašima? RAOUL VANEIGEM: Ne surađujem ni sa kim. Katkada prijateljima umjetnicima dam poneki tekst, ali ne kao komentar njihova rada, nego kao kontrapunkt. Umjetnost me uzbuđuje kada u njoj osjetim da nadvladava samu sebe, nešto što se očituje izvan njenih okvira; kada njeguje tračak života koji cvate kao istinska želja, intuicija nove umjetnosti življenja. HANS ULRICH OBRIST: Možete li mi reći nešto o Bruxellesu? Što vam Bruxelles znači? Gdje pišete? RAOUL VANEIGEM: Živim na selu, uz vrt i šumu u kojima je ritam godišnjih doba zadržao svoju ljepotu. Bruxelles kao grad su uništili urbanisti i arhitekti koje plaćaju investitori. Još uvijek ima nekoliko četvrti u kojima se može fino prošetati. Volim dosta krasnih kafića, u kojima mogu uživati u izvrsnim domaćim pivima. HANS ULRICH OBRIST: Slažete li se s Geremekovim stavom da je Europa velika briga XXI stoljeća? RAOUL VANEIGEM: Ne zanima me ovakva Europa kojom vladaju reketaške birokracije i korumpirane demokracije. S druge strane, regije me zanimaju kada nisu obojane regionalističkom ideologijom i provode samoupravljanje i izravnu demokraciju. Ne osjećam se ni Belgijancem ni Europljaninom. Jedina domovina je konačno suvereno čovječanstvo. HANS ULRICH OBRIST: Koristili ste se brojnim pseudonimima. \emph{Je est un autre} (ž est an otr; ja sam drugi)?\footnote{Arthur Rimbaud (Rembo), Lettre de Rimbaud à Paul Demeny („Lettre du voyant“, \emph{Pismo vidovitog}), 15. maj 1871. (AG)} Kako nalazite ili birate pseudonime? Koliko ste pseudonima koristili do sada? Imate li cijeli popis? RAOUL VANEIGEM: Ne vodim nikakav zapisnik o tome. Sve prepuštam nadahnuću trenutka. Korištenje pseudonimima ne nosi nikakve tajne. Prije bi se reklo da je riječ o distanciranju, najčešće kod naručenih djela. To mi omogućava da se zabavim i istodobno ublažim svoje trajne financijske probleme, koje nikada nisam htio rješavati kompromisom sa svijetom spektakla. HANS ULRICH OBRIST: Vašu knjigu \emph{Dictionnaire de citations pour servir au divertissement et a l’intelligence du temps} (Rječnik citata za zabavu i inteligenciju našeg doba) koriste brojni umjetnici i arhitekti. Odakle vam ideja za nju? RAOUL VANEIGEM: Prijedlog mi je dao moj prijatelj Pierre Drachline (Pjer Drašlin), koji radi za izdavačku kuću Cherche Midi. HANS ULRICH OBRIST: Često kritizirate pokrete za zaštitu okoliša, koji pokušavaju zamijeniti postojeći kapitalizam nekim drugim kapitalizmom. Što mislite o Josephu Beuysu (Jozefu Bojsu)? Koje nekapitalističke projekte ili pokrete podupirete? RAOUL VANEIGEM: Tobože nam nude biogoriva, pod uvjetom da pristanemo na transgenično uzgajanje uljane repice. Ekoturizam će ubrzati pljačkanje naše biosfere. Grade vjetroelektrane bez ikakve koristi za korisnike. To su područja u kojima je moguća intervencija. Prirodna dobra pripadaju nama, besplatna su i moraju biti korištena tako da služe slobodi života. Na zajednicama će biti da osiguraju vlastitu energiju i budu neovisne što se tiče hrane kako bi se svugdje lišile kontrole multinacionalnih kompanija i njihovih vazala na vlasti. Polaganje prava na prirodnu energiju za naše potrebe znači najprije vraćanje naše vlastite egzistencije. Naša kreativnost će nas osloboditi rada. HANS ULRICH OBRIST: Na kraju, premda to nije najmanje važno, Rilke je napisao onu divnu knjižicu savjeta mladim pjesnicima. Što biste vi savjetovali mladim filozofima-spisateljima 2009? RAOUL VANEIGEM: Da na svoj život primijene kreativnost koju koriste u radu. Da slijede put srca, onoga što je najživlje u njima. \chapter[{Prustov upitnik za Raoula Vaneigema}]{Prustov upitnik za Raoula Vaneigema\footnote{Sastavni deo intervjua, ali koji nije emitovan na radiju. (AG)}} \begin{quote} \emph{Koja je vaša glavna lična crta?}\forcelinebreak Lenjost. \emph{Koju osobinu najviše cenite kod muškaraca?}\forcelinebreak Velikodušnost, u paru s ljudskom predstavom o životu. \emph{Koju osobinu najviše cenite kod žena?}\forcelinebreak Ljubav i ljubav prema životu. \emph{Koja je vaša omiljena vrlina?}\forcelinebreak Kreativnost. \emph{Koja je vaša najveća mana?}\forcelinebreak Nedostatak samopouzdanja. \emph{Koja je vaša omiljena aktivnost?}\forcelinebreak Otvaranje sebe prema životu, tako da se život može otvoriti i u meni. \emph{Kako izgleda vaš san o sreći?}\forcelinebreak Da ostvarim sopstvene želje tako što ću ostvarivati želje voljenih. \emph{Šta bi za vas bila najveća nesreća?}\forcelinebreak Da ne doprinesem sreći svih. \emph{Šta biste voleli da budete?}\forcelinebreak Ja, sa sve više i više života u sebi. \emph{Gde biste voleli da živite?}\forcelinebreak Svuda gde vlada istinska ljudskost. \emph{Koji je vaš omiljeni cvet?}\forcelinebreak Volim ih sve, ali slaba tačka mi je starinska ruža. \emph{Koja je vaša omiljena ptica?}\forcelinebreak Volim ih sve, ali posebno mi je drag kos, koji peva uveče. \emph{Koji su vaši omiljeni prozni pisci?}\forcelinebreak Montaigne, La Boétie, Shakespeare, Diderot, Kafka, Artaud, Benjamin, Orwell, Zweig. \emph{Koji su vaši omiljeni pesnici?}\forcelinebreak Villon, Blake, Hölderlin, Nerval, Fourier. \emph{Koji je vaš omiljeni junak iz književnosti?}\forcelinebreak Hyperion. (Iz istoimenog Hölderlinovog romana.) \emph{Koja je vaša omiljena junakinja iz književnosti?}\forcelinebreak Mala Kaethchen iz Heilbronna. (\emph{Käthchen von Heilbronn}, drama Heinricha von Kleista.) \emph{Ko su vaši omiljeni kompozitori?}\forcelinebreak Mozart, Boccherini. \emph{Ko su vaši omiljeni slikari?}\forcelinebreak Giorgione, Turner, Goya, Van Gogh. \emph{Ko su vaši istorijski heroji?}\forcelinebreak Eloi Pruystinck, Sebastian Castellio, Edouard Carouy and André Soudy, Albert Libertad, Flores Magón, Alexandre Marius Jacob, Jan Valtin. \emph{Ko su vaše istorijske heroine?}\forcelinebreak Olympe de Gouges, Claire Démar, Louise Michel, Qurratulain. \emph{Koja su vaša omiljena imena?}\forcelinebreak Ariane, Chiara, Ariel, Tristan. \emph{Šta mrzite više od svega?}\forcelinebreak Dobrovoljno ropstvo. \emph{Koje istorijske figure najviše prezirete?}\forcelinebreak Sve tirane, koljače ljudi, one koji izazivaju ljudsku patnju i one koji ih slave. \emph{Kojem se vojnom podvigu najviše divite?}\forcelinebreak Nijednom. \emph{Kakvoj reformi pridajete najveći značaj?}\forcelinebreak Onoj koja humanizuje čoveka. \emph{Koji biste prirodni dar voleli da imate?}\forcelinebreak Sposobnost da bolje širim ljudsko shvatanje života. \emph{Kako biste voleli da umrete?}\forcelinebreak Mirno, u vreme koje sam izabarem. \emph{U kakvom se stanju duha trenutno nalazite?}\forcelinebreak U nesigurnoj ravnoteži između onoga što jesam i onoga što bih voleo da budem. \emph{Za koje greške imate najviše razumevanja?}\forcelinebreak Nema grešaka, samo propusta, koje treba ispravljati. \emph{Koji je vaš moto?}\forcelinebreak Poželi sve, ne očekuj ništa. \end{quote}     % begin final page \clearpage % if we are on an odd page, add another one, otherwise when imposing % the page would be odd on an even one. \ifthispageodd{\strut\thispagestyle{empty}\clearpage}{} % new page for the colophon \thispagestyle{empty} \begin{center} Anarhistička biblioteka \smallskip Anti-Copyright \bigskip \includegraphics[width=0.25\textwidth]{logo-yu} \bigskip \end{center} \strut \vfill \begin{center} Raoul Vaneigem i Hans Ulrich Obrist Poželi sve, ne očekuj ništa Razgovor sa Raoulom Vaneigemom 2009. \bigskip Hans Ulrich Obrist, \emph{In Conversation with Raoul Vaneigem}. S francuskog preveo Eric Anglès, E-flux Journal \#6, 05\Slash{} 2009. \href{https://www.e-flux.com/journal/06/61400/in-conversation-with-raoul-vaneigem/}{https:\Slash{}\Slash{}www.e-flux.com\Slash{}journal\Slash{}06\Slash{}61400\Slash{}in-conversation-with-raoul-vaneigem\Slash{}} Preveo Denis Gracin, 2013. Ovaj intervju je emitovan na Trećem programu Hrvatskog radija, 16. III 2013. Prevod dodatka („Prustov upitnik za Raoula Vaneigema“, iz istog intrevjua, koji nije emitovan preko radija): Aleksa Golijanin, 2013. \bigskip \textbf{anarhisticka-biblioteka.net} \end{center} % end final page with colophon \end{document} % No format ID passed.

http://ftp.wh2.tu-dresden.de/ctan/info/Publishing_With_TeX/pwt.tab

tu-dresden.de

CC-MAIN-2023-14

application/octet-stream

application/x-tex

crawl-data/CC-MAIN-2023-14/segments/1679296949097.61/warc/CC-MAIN-20230330035241-20230330065241-00032.warc.gz

\input blue.tex \loadindexmacros \report \hfuzz15pt \bluechapter Tabular Material \beginsummary BLUe's format provides btable for the class of (simple) bordered tables. It will be shown that this model can be used to format a wide variety of tables. Difference in representation can be obtained via attributes, i.e., without changing the markup. Customization of the macro can be done by modification of the separators for the caption, the columns, and the like. The diversity of tabular material in general has been illustrated by a kaleidoscope of tables borrowed from literature. For the latter group the markup is not necessarily restricted to btable or halign. The example of how Knuth marked up real-life tables is illustrated by his font charts. \endsummary The backbone of \bluetex's tables is |\btable|, to format a bordered table. Other \TeX niques for formatting tables will be dealt with too. The formatting of tables with simultaneous row and column spans is a subject for the `educated layman,' not for the faint-hearted. \bluehead Bordered table A bordered table consists of a caption, a header, row stubs, a table proper, and a footer, all with parameterized separators. Special cases occur when some of the elements are absent. Abstraction from a ruled and a non-ruled table is realized at the user level. Ruled can be specified either as horizontal, vertical or both. Dotted rules, also the partial ones, can be specified. No variation in the line thicknesss has been coded. Framing has been treated just as if a general document element has to be framed. I chose to leave the caption and the footer outside the frame.\ftn{However, we can frame any document element, can't we?} The positioning of the elements can be specified as centered, flushed left, or flushed right. A ^{template} is provided by default. Caption, border (first, header, row stubs), and footer can be specified; all mutual orthogonal and independent of \cs{data}. ^^{bordered table model} \bluesubhead Model {\def\btablecaption{$\leftarrow$\hfill C a p t i o n\hfill$\rightarrow$} \def\first{\hbox to6ex{\hss First\hss}} \def\header{\hbox to18ex{\hss Header\hss}} \def\rowstblst{{\hfil$\vcenter to20ex{\vss\offinterlineskip \fifo rowstblst\ofif\vss}$}} \def\data{$\vcenter{\offinterlineskip\hbox{Table}\kern1ex\hbox{Proper}}$} \def\footer{$\leftarrow$\hfill{\small F o o t e r}\hfill\hfill\hfill$\rightarrow$} \def\fifo#1{\ifx\ofif#1\ofif\fi\process{#1}\fifo}\def\ofif#1\fifo{\fi} \def\process#1{\hbox to0pt{\hss#1\hss}\kern.5ex} \nonframed $$\vcenter{\btable\data}$$ }%end scope \TeX nically caption and footer are \cs{hbox}-es and table proper is an \cs{vbox}. The separators of caption and footer are default \cs{medskip} and \cs{smallskip}. \bluesubhead Markup tags \bitem tags ^|\beginbtable| and |\endbtable|, or the shortcut |\btable|, and the column and row separator ^|\cs|, and ^|\rs| \bitem defs to be redefined ^|\btablecaption|, ^|\first|, ^|\header|, ^|\footer|, ^|\rowstblst|, (all defined empty by default) \bitem table markup tags, ^|\logms|, ^{logical multispan} to span a number of {\em logical\/} columns \bitem attributes \itemitem{--} ^|\ruled|, ^|\hruled|, ^|\vruled|, ^|\dotruled| \hfill Default:\hbox to13ex{\hfil^|\nonruled|} \itemitem- ^|\framed|, ^|\dotframed| \hfill Default:\hbox to13ex{\hfil^|\nonframed|} \itemitem- ^|\fll| (flushed left), ^|\flr| (flushed right) \hfill Default:\hbox to13ex{\hfil^|\ctr|} \bitem token variables ^|\prebtable|, ^|\postbtable| for positioning the table within the context.{\parindent0pt\ftn{In practice the math display is used most of the time.}} \smallbreak By the way the above model is an example of the markup of a bordered table.\ftn{Admittedly a little complicated. Simpler examples will follow.} The markup reads as follows. \beginverbatim \def\btablecaption{$\leftarrow$\hfill C a p t i o n\hfill$\rightarrow$} \def\first{\hbox to6ex{\hss First\hss}} \def\header{\hbox to18ex{\hss Header\hss}} \def\rowstblst{{\hfil$\vcenter to20ex{\vss\offinterlineskip \fifo rowstblst\ofif\vss}$}} \def\process#1{\hbox to0pt{\hss#1\hss}\kern.5ex} \def\data{$\vcenter{\offinterlineskip\hbox{Table}\kern1ex\hbox{Proper}}$} \def\footer{$\leftarrow$\hfill{\small F o o t e r}\hfill\hfill\hfill $\rightarrow$} $$\vcenter{\btable\data}$$ !endverbatim \thissubhead{\runintrue} \bluesubhead Customization\par \cs{$\langle X\rangle$sep} are parameters, which govern the kind of ^{separators}. The following are defaults to be customized. \beginverbatim \def\cellsize{\cvsize=4ex\tsht=.775\cvsize\tsdp=.225\cvsize} \def\colsepsurround{\kern.5em}\def\captionsep{\medskip}\def\rowstbsep{\vrule} \def\headersep{\hrule}\def\footersep{\smallskip}\def\template{} !endverbatim The positioning of the elements in the cells is parameterized by \cs{lft} and \cs{rgt}. They are equal to \cs{hfil} by default. A nice application is to make these equal to \$ in such a way that data can be processed in math mode. The empty template looks curious. The explanation is: when empty\Dash i.e., a user did not provide one\Dash a standard template will be used. \vfill\eject \bluehead Use of btable macro There are some pitfalls that I know of and that a user might like to be aware of. ^^{btable, pitfalls} \bitem When \cs{header}, \cs{footer} and the like are defined they keep their value. So when you don't have a header in the next table, be sure that this definition is empty. \bitem Most of the time I used definitions with \cs{btable} instead of token variables. Beware. \bitem To specify the row stub list separately from the data might yield a first column and a data part of unequal size. \bitem The ^|\cs| is ambiguous. In \bluetex{} it has the function to yield the argument as control sequence, while within btable the meaning is the column separator. \bitem When verbatims are also part of the data process the table on the fly via \cs{beginbtable} \dots\thinspace \cs{endbtable}. However, there is a problem when the header and footer have to be processed on the fly too. \bitem In the markup of the table in the appendix `History of Changes,' the problems are the right line distances in a \cs{vtop}. The latter as element in the table. It is caused by the \cs{tstrut}, table strut, which is inserted at the end of each table row. See the script how to circumvent this problem. \bitem The attribute \cs{dotruled} is not so general as \cs{ruled} or \cs{vruled}, because we lack the primitive \cs{vdotfill} as a dotted alternative for \cs{vrule}. For horizontal rules \TeX{} provides the primitives \cs{hrule} with the dotted variant \cs{dotfill}. \smallbreak In the examples of use below the invocation of \cs{data} could have been hidden. However, in order to remain compatible with the situation where a user wishes to forget about \cs{data} and provide the table entries directly as argument to \cs{btable}, I refrained from that. \blueexample Just data, magic squares $$\def\data{2\cs7\cs6\rs 9\cs5\cs1\rs 4\cs3\cs8} \vcenter{\framed\ruled\btable\data}\qquad\qquad\qquad \def\data{16\cs 3\cs 2\cs13\rs 5\cs 10\cs 11\cs 8\rs 9\cs 6\cs 7\cs12\rs 4\cs 15\cs 14\cs 1} \def\template{\colsepsurround\lft{\oldstyle##}\rgt &&\lft##\rgt&\lft{\oldstyle##}\rgt\cr} \ruled\framed\setbox0=\btable\data%for measuring sizes \vcenter{\dotruled\dotframed\btable\data}\qquad$$ via \begincenterverbatim $$\def\data{2\cs7\cs6\rs 9\cs5\cs1\rs 4\cs3\cs8} \vcenter{\framed\ruled\btable\data}\qquad\qquad\qquad \def\data{16\cs 3\cs 2\cs13\rs 5\cs 10\cs 11\cs 8\rs 9\cs 6\cs 7\cs12\rs 4\cs 15\cs 14\cs 1} \def\template{\colsepsurround\lft{\oldstyle##}\rgt &&\lft##\rgt&\lft{\oldstyle##}\rgt\cr} \ruled\framed\setbox0=\btable\data%for measuring sizes \vcenter{\dotruled\dotframed\btable\data}\qquad$$ !endcenterverbatim Remark. To introduce the ^|\oldstyle| elegantly I added a template for the ^|\halign|. For doing this, awareness of the physical columns is needed. Logically we are talking about a {\oldstyle3}${*}${\oldstyle3} and {\oldstyle4}${*}${\oldstyle4} table. Note that for dotted variants much more work has to be done. \blueexample Data plus header, \TB{} {\oldstyle246} ^^{data with header} $$\def\header{\hfill Year\hfill\cs \hfill World Population\hfill} \def\data{8000 B.C.\cs 5,000,000\rs 50 A.D.\cs200,000,000} \flr\nonframed\vruled\vcenter{\btable\data}\qquad \ruled\vcenter{\framed\btable\data}$$ via the nearly descriptive markup \beginverbatim \def\header{\hfill Year\hfill\cs \hfill World Population\hfill} \def\data{8000 B.C.\cs 5,000,000\rs 50 A.D.\cs200,000,000} $$\flr\vruled\vcenter{\btable\data}\qquad\ruled\framed\vcenter{\btable\data}$$ !endverbatim \exercise How come that the left table contains a \cs{hrule}? \answer The header separator is not influenced by the ruled attributes. \blueexample Data with row stubs, \TB{} {\oldstyle232} ^^{data with row stubs} \nonruled\nonframed\ctr%defaults \begindemo \def\rowstblst{{Horizontal lists} {Vertical lists}{Math lists}} \def\rowstbsep{}%Customization \def\data{Chapter 14\rs Chapter 15\rs Chapter 17} $$\btable\data$$ !yields \def\rowstblst{{Horizontal lists} {Vertical lists} {Math lists}} \def\rowstbsep{} \def\data{Chapter 14\rs Chapter 15\rs Chapter 17} \btable\data \enddemo \exercise How can we obtain the same table without the use of \cs{rowstblst}? \answer Just consider all as data. \beginverbatim Alternative \def\data{Horizontal lists \cs Chapter 14\rs Vertical lists\hfill\cs Chapter 15\rs Math lists\hfill \cs Chapter 16} $$\btable\data$$ !endverbatim %end exercise \blueexample Data, row stubs, header, caption and footer ^^{data with header, row stubs, caption and footer} \nonruled\nonframed $$\def\data{11\cs12\rs 21\cs22} \vcenter{\framed\btable\data} \qquad \def\header{\logms2\hfill Header\hfill} \def\rowstblst{{$1^{st}$ row} {$2^{nd}$ row}} \vcenter{\btable\data} \qquad \def\btablecaption{Caption} \def\footer{Footer} \vcenter{\dotruled\btable\data} \qquad \vcenter{\ruled\framed\btable\data} $$ after data definition, |\def\data| |{11\cs12\rs| |21\cs22}|, via\ftn{Note the invariance of the {\tt\char92data} specification.} \begincenterverbatim $$\vcenter{\framed\btable\data} \qquad \def\header{\logms2\hfill Header\hfill} \def\rowstblst{{$1^{st}$ row} {$2^{nd}$ row}} \vcenter{\btable\data} \qquad \def\btablecaption{Caption} \def\footer{Footer} \vcenter{\dotruled\btable\data} \qquad \vcenter{\ruled\framed\btable\data}$$ !endcenterverbatim The above example shows in a nutshell the essential possibilities of the \cs{btable} macro. It is my favorite, although other nice and powerful examples are still to come. \blueexample Walter's spreadsheet, \TB{} {\oldstyle244} No preamble has to be defined. ^^{spreadsheet} $$ \def\data{1\cs\logms2Adjusted gross income \dotfill\cs \$4,000\rs 2\cs Zero bracket amount for \rs \cs a single individual \dotfill\cs\hfill\$2,300\cs \rs 3\cs Earned income \dotfill\cs \hfill\underbar{ 1,500}\cs \rs 4\cs\logms2Substract line 3 from line 2 \dotfill\cs\hfill\underbar{ 800}\rs 5\cs Add lines 1 and 4. Enter here \rs \cs\logms2and on Form 1040, line 35 \dotfill\cs\$4,800} \def\colsepsurround{\kern.5ex}\cvsize=3ex \fll\btable\data $$ The above is marked up, as a 4-column table, via \beginverbatim \def\data{1\cs\logms2Adjusted gross income \dotfill\cs \$4,000\rs 2\cs Zero bracket amount for \rs \cs a single individual \dotfill\cs\hfill\$2,300\cs \rs 3\cs Earned income \dotfill\cs \hfill\underbar{ 1,500}\cs \rs 4\cs\logms2Substract line 3 from line 2 \dotfill\cs\hfill\underbar{ 800}\rs 5\cs Add lines 1 and 4. Enter here \rs \cs\logms2and on Form 1040, line 35 \dotfill\cs\$4,800} \def\colsepsurround{\kern.5ex}\cvsize=3ex $$\fll\btable\data$$ !endverbatim \blueexample Spreadsheet digression It happens that tables\Dash read budgets\Dash set by \AllTeX{} suffer from a simple addition flaw. Can't we add a {\em little\/} spreadsheet functionality to \TeX, i.e., let \TeX{} do the additions?\ftn{Courtesy Phil Taylor's Trigonometry \TeX, for the idea to use dimen vars and how to remove the pt. Remember that \TeX{} allows {\oldstyle16} bit fixed-point arithmetic. It is limited to absolute values $<$ {\oldstyle16384}.} \begingroup \newdimen\a\newdimen\b\newdimen\c \begindemo \def\data{r1\cs \ass\a{1.23} \rs r2\cs\ubp{\ass\b{4.56}}\rs \cs\cs\sumup{\a\b}\global\c\dimen0\rs \cs\cs\ubm{\ass\a{3.14}}\rs \cs\cs\minus\c\a} $$\btable\data$$ !yields \def\ass#1#2{\global#1=#2pt#2} \def\sumup#1{\global\dimen0=0pt \let\process\processsum\fifo#1\ofif} \def\processsum#1{\global\advance\dimen0#1\relax} \def\ofif#1\fifo{\fi\nodim\the\dimen0} \def\minus#1#2{\global \dimen0#1\global\advance\dimen0-#2 \nodim\the\dimen0} %\nodim, i.e. \xs, strips pt from % dimension quantity {\catcode`\p=12 \catcode`\t=12 \gdef\xs#1pt{#1}} \def\nodim{\expandafter\xs} %\underbar extended by + and - \def\ubp#1{\underbar{#1}\rlap {\lower.8ex\hbox{\thinspace\small$+$}}} \def\ubm#1{\underbar{#1}\rlap {\lower.8ex\hbox{\thinspace\small$-$}}} % \def\data{r1 \cs \ass\a{1.23} \rs r2 \cs\ubp{\ass\b{4.56}}\rs \cs\cs\sumup{\a\b}\global\c\dimen0\rs \cs\cs\ubm{\ass\a{3.14}}\rs \cs\cs\minus\c\a} $$\btable\data$$ \enddemo \endgroup with auxiliaries \beginverbatim \newdimen\a\newdimen\b\newdimen\c \def\ass#1#2{\global#1=#2pt#2} \def\sumup#1{\global\dimen0=0pt\let\process\processsum\fifo#1\ofif} \def\processsum#1{\global\advance\dimen0#1\relax} \def\ofif#1\fifo{\fi\nodim\the\dimen0} \def\minus#1#2{\global\dimen0#1\global\advance\dimen0-#2\nodim\the\dimen0} %\nodim, i.e. \xs, strips pt from % dimension quantity {\catcode`\p=12 \catcode`\t=12 \gdef\xs#1pt{#1}} \def\nodim{\expandafter\xs} %\underbar extended by + and - \def\ubp#1{\underbar{#1}\rlap{\lower.8ex\hbox{\thinspace\small$+$}}} \def\ubm#1{\underbar{#1}\rlap{\lower.8ex\hbox{\thinspace\small$-$}}} !endverbatim \blueexample Part of AAP's table, AAP {\oldstyle1989} Subtle is the header part and the alignments on the signs. ^^{AAP table} \def\nl{\hfil\strut\break\strut} {% \catcode`?=\active \def?{\kern1.1ex} % \def\btablecaption{AAP's table:\qquad Job Changes 1973--1980\hfill} \def\rowstblst{{Texas}{Maryland}} \def\header{\copy1\cs\copy2\cs\copy3} \setbox1=\vtop{\noindent\hsize14ex Gain/Loss of\nl hospitals \nl since 1973} \setbox2=\vtop{\noindent\hsize13ex Total No\nl of CEO Job\nl Changes\nl 1973--90\strut} \setbox3=\vtop{\noindent\hsize10ex Survival\nl Rate of\nl CEO's} \def\data{$+20$\cs---\cs22\%\rs $+?5$\cs 42\cs24\%} \def\footer{Source: David Kinzer, `Turnover etc.} $$\btable\data$$ }obtained via \beginverbatim \def\btablecaption{AAP's table:\qquad Job Changes 1973--1980\hfill} \def\rowstblst{{Texas}{Maryland}} \def\header{\copy1\cs\copy2\cs\copy3} \def\data{$+20$\cs---\cs22\%\rs $+?5$\cs 42\cs24\%} \def\footer{Source: David Kinzer, `Turnover etc.} $$\btable\data$$ !endverbatim with auxiliaries \beginverbatim \def\nl{\hfil\strut\break\strut} \catcode`?=\active \def?{\kern1.1ex} \setbox1=\vtop{\noindent\hsize14ex Gain/Loss of\nl hospitals \nl since 1973} \setbox2=\vtop{\noindent\hsize13ex Total No\nl of CEO Job\nl Changes\nl 1973--90} \setbox3=\vtop{\noindent\hsize10ex Survival\nl Rate of\nl CEO's} !endverbatim Remark. With longer footnotes put the text in a \cs{vtop}, with \cs{hsize} set to \cs{thsize}.\ftn{The table proper is first set in a box, and this box is measured yielding \cs{thsize} and \cs{tvsize}. After this the \cs{header} and \cs{footer} are set using the \cs{thsize}.} \blueexample AT\&T table diversions, \TB{} {\oldstyle247} Subtle is the alignment on the dot via the use of `?', \`a la Knuth, and the |\llap\$|, and |\rlap*|. ^^{ATT table} \def\rowstblst{} {\def\btablecaption{AT\&T Common Stock\hfill} \def\header{Year\cs Price\cs Dividend} \catcode`?=\active \def?{\kern1.1ex} \def\data{1971\cs41--54\cs\llap\$2.60\rs 2\cs41--54\cs 2.70\rs 3\cs46--55\cs 2.87\rs 4\cs40--53\cs 3.24\rs 5\cs45--52\cs 3.40\rs 6\cs51--59\cs ?.95\rlap*} \def\footer{* (first quarter only)} $$\framed\vcenter{\vbox{\small\btable\data}}\qquad\qquad \def\btablecaption{} \def\header{\logms3 \hfil AT\&T Common Stock\hfil\rs \hfill Year\hfill\cs\hfill Price\hfill\cs \hfill Dividend\hfill} \vcenter{\flr\ruled\btable\data}$$ } via \begincenterverbatim \def\btablecaption{AT\&T Common Stock} \def\header{Year\cs Price\cs Dividend} \catcode`?=\active \def?{\kern1.1ex} \def\data{1971\cs41--54\cs\llap\$2.60\rs 2\cs41--54\cs 2.70\rs 3\cs46--55\cs 2.87\rs 4\cs40--53\cs 3.24\rs 5\cs45--52\cs 3.40\rs 6\cs51--59\cs ?.95\rlap*} \def\footer{* (first quarter only)} $$\framed\vcenter{\vbox{\small \btable\data}}\qquad\qquad % \def\btablecaption{} \def\header{\logms3 \hfil AT\&T Common Stock\hfil\rs \hfill Year\hfill\cs \hfill Price\hfill\cs \hfill Dividend\hfill} \vcenter{\flr\ruled\btable\data}$$ !endcenterverbatim \blueexample Pittman's deterministic multiplication table Typographically and in other programming languages a trifle. In \TeX\ the coding matters. ^^{multiplication table} \def\header{} \def\rowstblst{} \def\btablecaption{}\def\first{}\def\footer{} \newcount\rcnt \newcount\ccnt \newcount\tnum \newcount\mrow \newcount\mcol \rcnt1 \ccnt1 \def\rows{\global\ccnt1 \cols \global\advance\rcnt1 \ifnum\rcnt>\mrow\swor\fi\rs\rows} \def\swor#1\rows{\global\rcnt1 \global\ccnt1 \fi} \def\cols{\tnum\rcnt \multiply\tnum\ccnt \the\tnum \global\advance\ccnt1 \ifnum\ccnt>\mcol\sloc\fi\cs\cols} \def\sloc#1\cols{\fi} % \mrow2 \mcol3 $$\nonruled\nonframed \vcenter{\btable\rows}\qquad\qquad \def\first{$\times$} \def\header{\row} \def\row{\the\ccnt\global\advance\ccnt1 \ifnum\ccnt>\mcol\wor\fi\cs\row} \def\wor#1\row{\fi} \def\rowstblst{{Anything, non-empty}} \def\nxtrs{\the\rcnt\rss} \vcenter{\btable\rows}\qquad\qquad % \mrow3 \mcol4 \def\rowstblst{{Anything, non-empty}} \framed\vcenter{\btable\rows} $$ via \beginverbatim \newcount\rcnt\newcount\ccnt\newcount\tnum\newcount\mrow\newcount\mcol \rcnt1 \ccnt1 \mrow2 \mcol3 \def\rows{\global\ccnt1 \cols \global\advance\rcnt1 \ifnum\rcnt>\mrow\swor\fi\rs\rows} \def\swor#1\rows{\global\rcnt1 \global\ccnt1 \fi} \def\cols{\tnum\rcnt\multiply\tnum\ccnt\the\tnum\global\advance\ccnt1 \ifnum\ccnt>\mcol\sloc\fi\cs\cols} \def\sloc#1\cols{\fi} $$\mrow2 \mcol3 \vcenter{\btable\rows}\qquad\qquad % \def\first{$\times$} \def\header{\row} \def\row{\the\ccnt\global\advance\ccnt1 \ifnum\ccnt>\mcol\wor\fi\cs\row} \def\wor#1\row{\fi} %\def\rowstblst{{1}{2}}%Fully automated via the two defs \def\rowstblst{{Anything, non-empty}} \def\nxtrs{\the\rcnt\rss} \vcenter{\btable\rows}\qquad\qquad % \mrow3 \mcol4 %\def\rowstblst{{1}{2}{3}}%Fully automated via the two defs \def\rowstblst{{Anything, non-empty}} \def\nxtrs{\the\rcnt\rss} \framed\vcenter{\btable\rows}$$ !endverbatim %Back to defaults \def\header{}\def\rowstblst{}\def\btablecaption{}\def\first{}\def\footer{} \vfill\eject \bluehead Kaleidoscope Some examples of special tables are given in order to illustrate the diversity. The markup is not restricted to the use of \cs{btable}. With respect to programming, the deterministic tables and the tables which update the computer memory, deserve special attention. The latter category is induced by {\em computer\/} typography. \blueexample Young tableaux, irregular shape, Knuth {\oldstyle1973} ^^{Young tableaux} \begindemo \newdimen\csize\csize=3ex \newcount\cnt \def\young#1{\hbox{\vrule\vtop{\hrule \offinterlineskip\halign{&\vbox {\hbox to\csize{\strut\hss##\hss \vrule}\hrule}\cr%template #1\crcr}}}}%end \young \catcode`'=13\relax \def'{\global\advance\cnt1 \the\cnt} \def\data{'&'&'&'\cr'&'&'\cr'} \young\data \def\data{7&8&9&10\cr9&11\cr16\cr} \young\data !yields \newdimen\csize\csize=3ex \newcount\cnt \def\young#1{\hbox{\vrule\vtop{\hrule \offinterlineskip\halign{&\vbox {\hbox to\csize{\strut\hss##\hss \vrule}\hrule}\cr%template #1\crcr}}}}%end \young \catcode`'=13\relax \def'{\global\advance\cnt1 \the\cnt} \def\data{'&'&'&'\cr'&'&'\cr'} \leavevmode\qquad\young\data\qquad \def\data{7&8&9&10\cr9&11\cr16\cr} \young\data \enddemo \blueexample Pascal triangle, a deterministic table ^^{Pascal triangle} \begindemo $$\displaylines{1\cr 1\quad1\cr 1\quad2\quad1\cr 1\quad3\quad3\quad1\cr}$$ !yields\hsize=10em $$\displaylines{1\cr 1\quad1\cr 1\quad2\quad1\cr 1\quad3\quad3\quad1\cr}$$ \enddemo \exercise The Pascal triangle is deterministic. Write a macro |\def\pascal#1{...}| which provides the table with the order as argument. \answer The macro and auxiliaries read as follows. \thisverbatim{\unmc} \beginverbatim \newcount\n \newcount\rcnt \newcount\ccnt \newcount\tentry\newcount\prev % \def\pascal#1{\n#1 \def\0{1} \ccnt1 \loop\ea\xdef\csname\the\ccnt\endcsname{0} \ifnum\ccnt<\n \advance\ccnt1 \repeat\rcnt0 \ccnt0 \displaylines{\rows}} % \def\rows{\global\advance\rcnt1 \ifnum\rcnt>\n \swor\fi \nxtrow\rows} % \def\swor#1\rows{\fi} % \def\nxtrow{1 \ccnt1 \prev1 \loop\ifnum\ccnt<\rcnt \tentry\prev \prev\csname\the\ccnt\endcsname \advance\tentry\prev \ea\xdef\csname\the\ccnt\endcsname{\the\tentry} \quad\the\tentry \advance\ccnt1 \repeat\cr} !endverbatim %above blank line terminates answer. \blueexample Tower of Hanoi, deterministic The process of replacement of the disks will be printed by the invocation of |\hanoi<n>|, $n$ an integer. No user markup is needed. ^^{tower\ of\ Hanoi} \begindemo \hanoi2 %or \beginhanoi2\endhanoi !yields \hanoi2 \enddemo \blueexample Chart, \TB{} ex{\oldstyle22}.{\oldstyle14} {\oldstyle248} ^^{chart}%but elaborated differently. {\small \newdimen\dist \dist=2\baselineskip \def\ent#1{\hbox{\vbox to 0pt {\vss\hbox to10ex{\quad\strut#1\hss} \hrule}}} \def\vl#1{\hbox{\vrule height#1\dist depth0pt}}%Vertical Line of prop. size \def\bl#1{\kern#1\dist}%BLank of prop. size %Balanced $$\offinterlineskip \vcenter{\ent{abc}} \vcenter{\ent{de} \vl2 \ent{fg}} \vcenter{\ent{hij} \vl1 \ent{klm} \bl1 \ent{nop} \vl1 \ent{qrs}} \quad%Nearly balanced tree; pruning a branch \vcenter{\ent{abc}} \vcenter{\ent{de} \vl2 \ent{fg}} \vcenter{\ent{hij} \vl{.5} %\bl{.5}<-| % \ent{klm} | \bl{1.5}% <-| \ent{nop} \vl1 \ent{qrs}}$$ }%end scope via the following alternative code without \cs{halign} \begincenterverbatim \newdimen\dist \dist=2\baselineskip \def\ent#1{\hbox{\vbox to0pt{\vss\hbox to10ex{\quad \strut#1\hss}\hrule}}} \def\vl#1{\hbox{\vrule height#1\dist depth0pt}} \def\bl#1{\kern#1\dist}%BLank of proper size %Balanced $$\offinterlineskip \vcenter{\ent{abc}} \vcenter{\ent{de} \vl2\ent{fg}} \vcenter{\ent{hij}\vl1\ent{klm}\bl1\ent{nop}\vl1\ent{qrs}} \quad%Nearly balanced tree; pruning a branch \vcenter{\ent{abc}} \vcenter{\ent{de} \vl2\ent{fg}} \vcenter{\ent{hij}\vl{.5}%\bl{.5}\ent{klm} \bl{1.5}\ent{nop}\vl1\ent{qrs}}$$ !endcenterverbatim \blueexample Binary tree The nodes are identified via Dewey's decimal notation, similar to a ToC in a book. For example, node {\oldstyle11} is the left most node at the first level. The user must supply within the environment ^|\beginbintree| \cs{endbintree} the pairs of node numbers and node contents, with at the end the level of the tree. A node which is not specified will not show. The syntax of the invocation reads \begincenterverbatim \beginbintree<nodeno><nodevalue> ... <nodeno><nodevalue> <levelno>\endbintree !endcenterverbatim $$\thisbintree{\tophns13ex} \beginbintree{00}1{11}6{12}7{21}2{22}3{23}4 2\endbintree \raise13ex\hbox{$\buildrel heap\over \longrightarrow$} \thisbintree{\tophns13ex} \beginbintree{00}7{11}6{12}4{21}3{22}2{23}1 2\endbintree $$ \begincenterverbatim $$\thisbintree{\tophns13ex} \beginbintree{00}1{11}6{12}7{21}2{22}3{23}4 2\endbintree \raise13ex\hbox{$\buildrel heap\over \longrightarrow$} \thisbintree{\tophns13ex} \beginbintree{00}7{11}6{12}4{21}3{22}2{23}1 2\endbintree $$ !endcenterverbatim \blueexample Dewey's decimal notation $$\beginbintree{00}{$root$} {11}{$n_{11}$} {12}{$n_{12}$} {21}{$n_{21}$} {22}{$n_{22}$} {23}{$n_{23}$} {24}{$n_{24}$} {35}{$n_{35}$} {36}{$n_{36}$} {49}{$n_{49}$} {410}{$n_{410}$} 4\endbintree$$ \vskip-2.5\bigskipamount \begincenterverbatim $$\beginbintree{00}{$root$} {11}{$n_{11}$}{12}{$n_{12}$} {21}{$n_{21}$}{22}{$n_{22}$}{23}{$n_{23}$}{24}{$n_{24}$} {35}{$n_{35}$}{36}{$n_{36}$} {49}{$n_{49}$}{410}{$n_{410}$} 4\endbintree$$ !endcenterverbatim \blueexample Bitstreams as names of nodes ^^|\beginbt|\thisbt{\xoffset{-400}}%Interactive binary tree traversal \beginbt 1 NTG member? 10 Plain TeX ie? 100 Honoured? 1000 cgl 1001 HH 101 On board? 1010 Chair? 10100 Erik 10101 Secretary? 101010 Gerard 101011 Treasurer? 1010110 Wietse 1010111 Dark? 10101110 JLB 10101111 FG 1011 Anonymous 11 Just a friend 8 \endbt The above b(inary)t(ree)\ftn{Courtesy Bernd Raichle.} is not foolproof and suffers from overprinting of the leaves with a tree of depth {\oldstyle10} or so. Note that the specification of the nodes is on a line by line basis\Dash \cs{obeylines} is on\Dash and that each node and its contents is separated by a space. The last line must contain the number of levels\Dash used to create the niche for the tree\Dash and the closing tag \cs{endbt}, again separated by a space. By adopting these conventions no curly braces were needed.\ftn{The above ideas emerged from an interactive traversal of a binary tree in a guess who-is-who game. The programming is such that it can be extended easily to a trinary or higher-order tree. The overprinting drawback remains, however. Alexander Calder might have appreciated these `mobiles,' \winksmiley.} \begincenterverbatim \thisbt{\xoffset{-400}} \beginbt 1 NTG member? 10 Plain TeX ie? 100 Honoured? 1000 Kees 1001 HH 101 On board? 1010 Chair? 10100 Erik 10101 Secretary? 101010 Gerard 101011 Treasurer? 1010110 Wietse 1010111 Dark? 10101110 JLB 10101111 FG 1011 Anonymous 11 Just a friend 8 \endbt \bye !endcenterverbatim There are some special tree packages. Gurari is strong with respect to diagrams in general and trees in particular. \blueexample Maze %Labyrinth via TeX, just an experiment feb 92. %Assumed is a closed rule on top and to the right %| and _ denote the rules to mark the labyrinth %Labyrinth proper \thisverbatim{\catcode`\|=12 } ^^{maze} \begindemo \catcode`|=13 \def|{\vrule} \catcode`_=13 \def_{\hrulefill} $$\vcenter{\hbox{\vtop{\hrule \offinterlineskip \halign{&\hbox to\csize{\vrule height\csize width0pt#\hfil}\cr |&_&|_& \cr &|&_& \cr |&|_&_&|\cr |_& &_&_\cr}%end \halign }\vrule%end \vbox }%end \hbox !yields \newdimen\csize \csize=3ex \catcode`|=13 \def|{\vrule} \catcode`_=13 \def_{\hrulefill} \qquad\hbox{\vtop{\offinterlineskip \hrule\halign{&\hbox to\csize {\vrule height\csize width0pt #\hfil}\cr |&_&|_& \cr &|&_& \cr |&|_&_&|\cr |_& &_&_\cr}%end \halign }\vrule%end \vbox }%end \hbox \enddemo \blueexample Crosswords: puzzle, clues and solution ^^{crosswords} \begincrosswords $$\bdata% P*On DEk* *n*S Edit \edata \vcenter{\sevenrm\csize=3ex\crw} \vcenter{\parindent=5ex \vtop{\hsize=21ex\obeylines Across 2 Switch mode 3 Knuth 6 Prior to \TeX}} \vcenter{\parindent=3ex \vtop{\hsize=25ex\obeylines Down 1 Public domain 2 All right 4 All comes to it 5 Atari type}} \vcenter{\fiverm\csize=3ex\sol}$$ \endcrosswords The above is obtained essentially via \begincenterverbatim \begincrosswords $$\bdata% P*On DEk* *n*S Edit \edata \vcenter{\sevenrm\csize=3ex\crw} <Clues> \vcenter{\fiverm\csize=3ex\sol}$$ \endcrosswords !endcenterverbatim \blueexample Much alignment occurs in typesetting mathematics Aligned equations in display, matrices, and the complex commutative diagrams. This has been dealt with elsewhere, for example Knuth {\oldstyle1984}, and Spivak {\oldstyle1989}. Also typesetting of program texts requires vertical alignment. \blueexample Chess boards The first board has been marked up via ^|\leaders|,\ftn{Courtesy David Salomon.} horizontally and vertically. ^^{chess} The second is obtained via (a degenerate use of \winksmiley ) the crossword macro. {\newdimen\unitlength \unitlength3ex \begindemo \unitlength3ex \boxit{\vbox{\leaders \vbox{\offinterlineskip \hbox{\leaders\hbox{% \kern\unitlength \vrule width\unitlength height\unitlength }\hskip8\unitlength }\hbox{\leaders\hbox{\vrule width\unitlength height\unitlength \kern\unitlength }\hskip8\unitlength }}\vskip8\unitlength}} !yields \boxit{\vbox{\leaders \vbox{\offinterlineskip \hbox{\leaders\hbox{% \kern\unitlength \vrule width\unitlength height\unitlength }\hskip8\unitlength }\hbox{\leaders\hbox{\vrule width\unitlength height\unitlength \kern\unitlength }\hskip8\unitlength }}\vskip8\unitlength}} \enddemo} \begindemo \begincrosswords \obeyspaces\let =\space \csize=3ex \bdata% 8 * * * * 7* * * * 6 * * * * 5* * * * 4 * * * * 3* * * * 2 * * * * 1* * * * *ABCDEFGH \edata \sol \endcrosswords !yields \begincrosswords \obeyspaces\let =\space \csize=3ex \bdata% 8 * * * * 7* * * * 6 * * * * 5* * * * 4 * * * * 3* * * * 2 * * * * 1* * * * *ABCDEFGH \edata \sol \endcrosswords \enddemo \exercise How can we add field indicators on top and to the right? \answer Extend the data by the numbers at the end of each row, and copy the last row also on top. \beginverbatim \bdata% *ABCDEFGH* 8 * * * *8 7* * * * 7 6 * * * *6 5* * * * 5 4 * * * *4 3* * * * 3 2 * * * *2 1* * * * 1 *ABCDEFGH* \edata !endverbatim \exercise How can we diminish the ^{optical illusion} of the border? \answer Make the border thicker. For example via |\boxit{\boxit{\sol}}|. Why don't you develop a nice border macro? \exercise How can we add pieces to the board? \answer Chess pieces are available in a font. Similar to the letters in the solution of the crosswords we can put in pieces. For example let us assume for simplicity's sake that K denotes the white king then the following yields the requested result. \beginverbatim \begincrosswords \obeyspaces\let =\space \csize=3ex \bdata% 8 * * * * 7* * * * 6 * * * * 5* * * * 4 *K* * * 3* * * * 2 * * * * 1* * * * *ABCDEFGH \edata \boxit{\boxit{\sol}} \endcrosswords !endverbatim %blank line is needed, to close answer. The above entails that we are on the way to generate any board and just add the pieces, all based on the crosswords macro approach. \blueexample Optical illusion Again a nice application of the use of ^|\leaders|,\ftn{For \cs{soto} and and \cs{sot} see the script file.} horizontally and vertically. When I submitted my crosswords macro to \TUB{} it was refused because of the wiggling of the frame!?! There the similar effect is on with neighbouring black and white squares. The black squares look smaller than the white squares, yielding a ^{wiggling illusion}. \newdimen\unitlength \unitlength5ex \newbox\soto\setbox\soto\vbox{\hrule height1exwidth5ex\relax \hbox to5ex{\vrule width1exdepth0pt\relax \hss\vrule height3exwidth1exdepth0pt}% \hrule height1exwidth5ex\relax} {\newdimen\unitlength \unitlength5ex \newbox\sot \setbox\sot\vbox to\unitlength{\vss \hbox to\unitlength{\hss \vrule height.6\unitlength width.6\unitlength depth0pt\hss}% \vss} \smallskip \begindemo \boxit{\vbox{\leaders\vbox{% \offinterlineskip\hbox{\leaders \hbox{\copy\soto\copy\sot}% \hskip30ex}% \hbox{\leaders \hbox{\copy\sot\copy\soto}% \hskip30ex}}% \vskip30ex}} !yields \boxit{\vbox{\leaders\vbox{\offinterlineskip \hbox{\leaders\hbox{\copy\soto\copy\sot}\hskip30ex}% \hbox{\leaders\hbox{\copy\sot\copy\soto}\hskip30ex}}% \vskip30ex}} \enddemo \blueexample Soto's kinetic art \begindemo \leavevmode %background \hbox{\xleaders\hbox to.5ex{\hss \vrule height6\unitlength\hss }\hskip6\unitlength }\kern-6\unitlength %the squares \boxit{\vbox{\offinterlineskip \leaders\hbox{\leaders\copy\sot \hskip6\unitlength }\vskip6\unitlength}} !yields \leavevmode \hbox{\xleaders\hbox to.5ex{\hss \vrule height6\unitlength\relax\hss }\hskip6\unitlength}\kern-6\unitlength %the squares \boxit{\vbox{\offinterlineskip \leaders\hbox{\leaders\copy\sot \hskip6\unitlength}\vskip6\unitlength}} \enddemo } \blueexample Row and/or column spans, partial horizontal rules ^^{row\ and\ column\ spans} %Fill-in form bridge \nonruled\ctr\framed \def\rowstblst{} {\small%\defaults \newcount\bcnt \def\lines{\global\advance\bcnt by1 \ifnum\bcnt=3 et cetera\hidewidth \senil\fi\the\bcnt.\cs\cs\cs\cs\cs\cs\rs\lines} \def\senil#1\lines{\fi} \thisbtable{ \def\ghostrow{\omit\colsepsurround% \vbox to0pt{\vss\hbox to5ex{\hss Pair\hss}\vskip.5ex \hbox to5ex{\hss No\hss}\vss}\prs\logms2\lineglue\srp \vbox to0pt{\vss\hbox to5ex{\hss Re-\hss}\vskip.5ex \hbox to5ex{\hss sults\hss}\vss}\prs\logms2\lineglue\srp \vbox to0pt{\vss\hbox to15ex{\hss Game \dots\hss}\vskip1.5ex \hbox to15ex{\hss MP$\,$s\hss}\vss}\colsepsurround\cr} \def\header{\cs\logms2\hfil Contract\hfil\cs \cs\logms2\hfil Scores\hfil\cs\grs \cs N--S\cs E--W\cs\cs N--S\cs E--W\cs} } $$ \framed\ruled\btable\lines$$ }%end scope \beginverbatim \newcount\bcnt \def\lines{\global\advance\bcnt by1 \ifnum\bcnt=3 et cetera\hidewidth \senil\fi\the\bcnt.\cs\cs\cs\cs\cs\cs\rs\lines} \def\senil#1\lines{\fi} \thisbtable{ \def\ghostrow{\omit\colsepsurround% \vbox to0pt{\vss\hbox to5ex{\hss Pair\hss}\vskip.5ex \hbox to5ex{\hss No\hss}\vss}\prs\logms2\lineglue\srp \vbox to0pt{\vss\hbox to5ex{\hss Re-\hss}\vskip.5ex \hbox to5ex{\hss sults\hss}\vss}\prs\logms2\lineglue\srp \vbox to0pt{\vss\hbox to15ex{\hss Game \dots\hss}\vskip1.5ex \hbox to15ex{\hss MP$\,$s\hss}\vss}\colsepsurround\cr} \def\header{\cs\logms2\hfil Contract\hfil\cs \cs\logms2\hfil Scores\hfil\cs\grs \cs N--S\cs E--W\cs\cs N--S\cs E--W\cs} } $$ \framed\ruled\btable\lines$$ !endverbatim \exercise How many rows does the header have? \answer Descriptive {\oldstyle1}, visual {\oldstyle2}, and for plain \TeX\ formatting {\oldstyle3}. It is all a matter of point of view. \exercise The above ^{recursive markup} of the data is elegant, especially when the table is large. Simplify the markup by abandoning the independence of size, i.e., provide the data explicitly instead of recursively. \answer The `data' can be defined as follows. \beginverbatim \def\data{1.\cs\cs\cs\cs\cs\cs\rs 2.\cs\cs\cs\cs\cs\cs\rs et cetera\hidewidth} !endverbatim \blueexample Bridge pair match scheme, with special `first' element $$\def\first{\thispicture{\unitlength=6ex \xdim{1.4}\ydim{1}}% \lower1.5ex\hbox\beginpicture%(1.4, 1)(0,-.1) \put( 0.0, 0.0){\small \strut Round}% \put( 1.4, 0.575){\llap{\small Game}}% \put( 1.4, 0.1){\line(-2, 1){1.4}}% \endpicture\lower2ex\null} \def\header{% 1--3 \cs 4--6 \cs 7--9 \cs 10--12\cs13--15\cs 16--18 \cs 19--21} \def\rowstblst{{1.}{2.}{et cetera}} \def\data{% 1--2 \cs \cs \cs2: 3--4\cs \cs3: 5--6 \cs4: 7--8\rs 4: 8--3\cs1: 1--6\cs \cs \cs2: 5--7 \cs \cs3: 2--4\rs %\cs \cs \cs \cs \cs \cs \rs } \framed\ruled\btable\data $$via \beginverbatim \def\first{\thispicture{\unitlength=6ex\xdim{1.4}\ydim{1}}% \lower1.5ex\hbox\beginpicture%(1.5, 1)(0,-.1) \put( 0.0, 0.0){\small \strut Round}% \put( 1.4, 0.575){\llap{\small Game}}% \put( 1.4, 0.1){\line(-2, 1){1.4}}% \endpicture \lower2ex\null } \def\header{% 1--3 \cs 4--6 \cs 7--9 \cs 10--12\cs13--15\cs 16--18 \cs 19--21} \def\rowstblst{{1.}{2.}{et cetera}} \def\data{% 1--2 \cs \cs \cs2: 3--4\cs \cs3: 5--6 \cs4: 7--8\rs 4: 8--3\cs1: 1--6\cs \cs \cs2: 5--7 \cs \cs3: 2--4\rs %\cs \cs \cs \cs \cs \cs \rs } \framed\ruled\btable\data !endverbatim Remark. The need for centering the first row is induced by \cs{first}. It is elegant to solve the problem for that in ^|\first|. \exercise How can we center the numbers in the first column? \answer Add \cs{hfil} in the \cs{rowstblst} via \beginverbatim \def\rowstblst{{\hfil1.}{\hfil2.}{et cetera}} !endverbatim Another solution is the following template \beginverbatim \def\template{\colsepsurround\hfil##\hfil&&\lft##\rgt\cr} !endverbatim \blueexample Alignment at decimal points Generally this is done by introducing an extra column for the dot, and flushing right the digits left and flushing left the digits right of it. It comes from the wish not to print non-significant leading zeroes, and to suppress zeroes behind the point for exact numbers. {\oldstyle3}.{\oldstyle5} means exactly 3${1\over2}$. {\oldstyle3}.{\oldstyle500} means accurate to three digits. I would mark up the numbers separately and insert Knuth's `?', \TB{} {\oldstyle240}\dash{\oldstyle241}, for non-signicant zeroes, automatically. The latter can also be done by programming the editor by a template consisting of sufficient ?-s followed by the decimal point. The numbers required can be brought in by overtyping the template. Related to ^{alignment at decimal point}s is ^{alignment at number sign}s,\ftn{Another column for the signs offends the structure. At a lower level one could think of {\tt\char92scs}, a Sign Column Separator, but that is not nice either.} see the AAP table. \blueexample Nested table A ruled table with unruled tables as data is incorporated in the chapter `Creating an index,' to illustrate the ordering choices. See the script. ^^{nested table} \blueexample Nested, and interrupted table with updating of memory From the user level one would say: aligned material connected by text, where the latter in the case at hand is the status of the play. For the markup see the script. \beginbridge {\small %bridge data \def\LFTINF{Puzzle} \def\RGTINF{\vtop{\hbox{6NT,} \hbox{by East}}} % \Ns={KQ76}\Es={T9}\Ss={8542}\Ws={AJ3} \Nh={J98} \Eh={A2}\Sh={QT74}\Wh={K653} \Nd={J942}\Ed={T5}\Sd={Q876}\Wd={AK3} \Nc={65}\Ec={KJ9xxxx}\Sc={2}\Wc={AQT} \showgame \LEADS\bplay h4! & hK & h8 & h2 & --& 1\LEADW\cr cA & c5 & cx & c2 & --& 2\cr cQ & c6 & cx & s2 & --& 3\cr cT & h9 & cK & s4 & --& 4\LEADE\cr cJ & s5 & s3 & s6 & --& 5\cr c9 & s8 & h5 & s7 & --& 6\cr cx & d6 & sJ & d2 & --& 7\cr \bintermezzo \def\RGTINF{\vtop{\hbox to 0pt{NS squeezed on\hss} \hbox to 0pt{\cl\ continuation?\hss} \hbox to 7ex{\hss}}} %phantom for alignment \Ec={{\ooalign{\hfil\raise.07ex% \hbox{x}\hfil\crcr\mathhexbox20D}}} \showgame \Ec={x} \eintermezzo cx & h7 & h6 & hJ & --& 8\cr \omit et cetera \hidewidth \cr \eplay }%end of scope \endbridge Tables which also require updating of memory occur with typesetting of chess, for example Tutelaers {\oldstyle1992}, or GO, Ko{\l}odziejska {\oldstyle1991}. \blueexample Fill-in forms The registration forms for the various \TeX{} conferences are captivating. Now and then I ponder about the e-mail equivalents of the traditional snail forms, especially what (and how they) should be filled in. Redefine a list of empty definitions? \blueexample Time tables Railway, bus, \dots\thinspace, and the use of rotated fonts. This is a \PS{} issue. \blueexample No markup For simple tables the data can be specified {\em without\/} \cs{cs}-s, and \cs{rs}-s, i.e., without explicit markers for column and row separators. These can be inserted by \TeX, see \TB{} {\oldstyle249}. For special cases, for example centering texts\ftn{See the implementation of \cs{center} in the file.} and crosswords, this is handy. ^^{no markup} \thissubhead{\runintrue} \bluesubhead Pondering about lists\par makes you realize that the table proper data forms a nested list with \cs{rs} and \cs{cs}, respectively first level and second level separators. One could also adopt |<cr>| and {\tt\char32} for that, in other words allow natural data provision. \blueexample Simultaneous row spans Simultaneous column spans can be marked up in \cs{btable} by \cs{logms}---for logical columns, as an extension to \cs{multispan} for \cs{halign}. ^^{row\ spans} For row spans start from \cs{valign}, the transposition of \cs{halign}. A little more than the analogy of transposition is needed. From the \TeX-nl list the following example of spans over rows. \begindemo \hbox{\vrule\valign{&\hrule\vfil \noindent\hsize15ex\strut \xsp#\xsp\vfil\hrule\cr \multispan3{\hrule\vfil \vbox{\noindent\hsize15ex\strut \xsp This\\ \xsp looks\\ \xsp problematic}}\vfil \hrule& Doesn't it?\cr \noalign{\vrule} \hfill22 &%space needed \hfill12 & \hfill1943 & \hfill190 \cr}\vrule} %with auxiliary \def\xsp{\hbox{ }} !yields \def\xsp{\hbox{ }} \hbox{\vrule\valign{&\hrule\vfil \noindent\hsize15ex\strut \xsp#\xsp\vfil\hrule\cr \multispan3{\hrule\vfil \vbox{\noindent\hsize15ex\strut \xsp This\\ \xsp looks\\ \xsp problematic}}\vfil \hrule& Doesn't it?\cr \noalign{\vrule} \hfill22 &%space needed \hfill12 & \hfill1943 & \hfill190 \cr}\vrule} \enddemo As can be seen from this difficult example, we have to fall back on lower level details now and then. \exercise Modify the above towards a ^|\vtable| macro, such that we can use the attributes \cs{ruled}, \cs{vruled}, \cs{hruled}, with default \cs{nonruled}, and \cs{framed} and \cs{nonframed}.^^|\valign| \answer As a parameter I provided the \cs{hsize} of the table entries. For row spans the \cs{logms}, logical multispan, has been used, similar as for \cs{btable}. \beginverbatim \def\xsp{\hbox{ }} \def\vruled{\def\colsep{\vrule}\def\rowsep{}} \def\hruled{\def\colsep{}\def\rowsep{\hrule}} \def\ruled{\def\colsep{\vrule}\def\rowsep{\hrule}} \def\nonruled{\def\colsep{}\def\rowsep{}} \def\framed{\let\frameit\boxit} \def\nonframed{\def\frameit##1{##1}} \def\rs{&\null\rowsepsurround\rowsep\rowsepsurround&} \def\cs{\lcs\noalign{\colsep}} \def\lcs{\rowsepsurround\cr} \def\top{\null\vskip.5em} \def\bot{\vskip.5em} \def\ctr{\def\lft{\hfil}} \def\fll{\def\lft{}} \def\flr{\def\lft{\hfill}} %Macro \def\vtable#1{\frameit{\hbox{\valign{\top\noindent \hsize#1\lft##\bot &&##&\hsize#1\top\noindent\lft##\bot\cr \data}}}} %Defaults \nonframed\nonruled\ctr \def\rowsepsurround{\vskip.1ex} %Examples \def\data{1 \rs 2\rs 3\cs 4 \rs 5\rs 6\cs 314\rs271\rs \lcs} \vtable{7ex} \smallskip \def\data{\logms3{\hsize7ex\null \vfil\noindent\hfil1\hfil\vfil}\cs C\rs G\rs L\cs 22\rs12\rs1943\lcs} \ruled\vtable{7ex} \smallskip \def\data{\logms3{\hsize15ex\null \vfil\noindent\xsp This\\ \xsp looks\\ \xsp problematik\vfil}\cs O\rs A\rs G\cs 16\rs11\rs1954\lcs} \framed\ruled\vtable{5ex} !endverbatim %end answer \blueexample Macroscopic markup vtable, based on valign {%Example with macroscopic \vtable markup \def\xsp{\hbox{ }} \def\vruled{\def\colsep{\vrule}\def\rowsep{}} \def\hruled{\def\colsep{}\def\rowsep{\hrule}} \def\ruled{\def\colsep{\vrule}\def\rowsep{\hrule}} \def\nonruled{\def\colsep{}\def\rowsep{}} \def\framed{\let\frameit\boxit} \def\nonframed{\def\frameit##1{##1}} \def\rs{&\null\rowsepsurround\rowsep\rowsepsurround&} \def\cs{\lcs\noalign{\colsep}} \def\lcs{\rowsepsurround\cr} \def\top{\null\vskip.5em} \def\bot{\vskip.5em} \def\ctr{\def\lft{\hfil}} \def\fll{\def\lft{}} \def\flr{\def\lft{\hfill}} %Macro \def\vtable#1{\frameit{\hbox{\valign{\top\noindent \hsize#1\lft##\bot &&##&\hsize#1\top\noindent\lft##\bot\cr \data}}}} %Defaults \nonframed\nonruled\ctr \def\rowsepsurround{\vskip.1ex} \begindemo \def\data{\logms3{\hsize15ex \vfil\noindent\xsp This\\ \xsp looks\\ \xsp problematic \vfil}\rs\omit\hsize15ex \vfil\noindent \xsp Doesn't it?\vfil\cs O\rs A\rs G\rs 189\cs \rs 16\rs11\rs1954\lcs} \framed\ruled\vtable{5ex} !yields \def\data{\logms3{\hsize15ex \vfil\noindent\xsp This\\ \xsp looks\\ \xsp problematic \vfil}\rs \omit\hsize15ex\vfil\noindent \xsp Doesn't it?\vfil\cs O\rs A\rs G\rs \cs \rs16\rs11\rs1954\lcs} \framed\ruled\vtable{5ex} \enddemo} \blueexample Regular use vtable based on valign {\begindemo \def\vtable#1{\frameit{\hbox {\valign{\top\noindent \hsize#1\lft##\bot &&##&\hsize#1\top \noindent\lft ##\bot\cr \data}}}} \def\data{anatoly\rs andre\rs alex \cs beatrici\rs bernd\lcs} \nonframed\vtable{20ex} !yields \def\vruled{\def\colsep{\vrule}\def\rowsep{}} \def\hruled{\def\colsep{}\def\rowsep{\hrule}} \def\ruled{\def\colsep{\vrule}\def\rowsep{\hrule}} \def\nonruled{\def\colsep{}\def\rowsep{}} \def\framed{\let\frameit\boxit} \def\nonframed{\def\frameit##1{##1}} \def\rs{&\null\rowsepsurround\rowsep\rowsepsurround&} \def\cs{\lcs\noalign{\colsep}} \def\lcs{\rowsepsurround\cr} \def\top{\null\vskip.1em} \def\bot{\vskip.1em} \def\ctr{\def\lft{\hfil}} \def\fll{\def\lft{}} \def\flr{\def\lft{\hfill}} % \def\rowsepsurround{\vskip.1ex} % \def\vtable#1{\frameit{\hbox {\valign{\top\noindent \hsize#1\lft##\bot &&##&\hsize#1\top \noindent\lft ##\bot\cr \data}}}} \def\data{anatoly\rs andre\rs alex \cs beatrici\rs bernd\lcs} \nonframed\vtable{20ex} \enddemo} The advantage of \cs{valign} for this case is that when a name is inserted in a column that column can grow without adaptation of the markup for the other cells. \blueexample Simultaneous row and column spans These require more work. ^^{row\ and\ column\ spans} \newbox\block \setbox\block=\hbox{$2*3$} \def\data{\logms3\cs14\grs \logms3\cs24\rs 31\cs32\cs33\cs34} \def\btablecaption{Caption} \def\rowstblst{{row 1}{row 2}{\hfil $\Rightarrow$}} \def\header{\logms4 Header\hfil$\Downarrow$} \def\footer{Footer} \thisbtable{\def\ghostrow{\ifx\empty\rowstblst \else\omit\lineglue\ea\srp\fi \logms3\hfil\vbox to0pt{\vss \copy\block\vss}\hfil\prs\lineglue\cr\nxtrs} } $$\vcenter{\framed\ruled\btable\data} \qquad\qquad %\setbox\block=\hbox{$3*3$} \def\data{\logms3\hfil\cs14\grs \logms3\hfil$3*3$\hfil\cs24\grs \logms3\hfil\cs34\rs 41\cs42\cs43\cs44} \thisbtable{\def\ghostrow{\ifx\empty\rowstblst \else\omit\lineglue\ea\srp\fi \logms3\hfil\prs\lineglue\cr \ifx\empty\rowstblst\else\ea\nxtrs\fi}} \def\btablecaption{Caption} \def\header{\logms4 Header\hfil$\Downarrow$\ } \def\rowstblst{{row 1}{row 2}{row 3}{\hfil$\Rightarrow$}} \def\footer{Footer} \vcenter{\ruled\framed\btable\data} $$ \exercise How to markup the above with simultaneous row and column spans? \answer Because of the separation of concerns we only have to concentrate on the data. My approach is to look at a block\Dash here $2{*}3$\Dash as a ghost to be overprinted. A natural way is to introduce the concept of a ghostrow, which will be invoked by the ghostrow separator \cs{grs}. So first mark up for the data with the hole in the table and include the \cs{grs}. Then provide \cs{ghostrow}. In order to do the latter gracefully, we also need the concept of partial row separator, \cs{prs}, and its mirror, \cs{srp}, to handle partial lines. \beginverbatim \setbox\block=\hbox{$2*3$} \def\data{\logms3\cs14\grs \logms3\cs24\rs 31\cs32\cs33\cs34} \def\btablecaption{Caption} \def\rowstblst{{row 1}{row 2}{\hfil $\Rightarrow$}} \def\header{\logms4 Header\hfil$\Downarrow$} \def\footer{Footer} \thisbtable{\def\ghostrow{\ifx\empty\rowstblst \else\omit\lineglue\ea\srp\fi \logms3\hfil\vbox to0pt{\vss \copy\block\vss}\hfil\prs\lineglue\cr\nxtrs} }\vcenter{\framed\ruled\btable\data}$$ % %and the 3*3 block can be obtained via % %\setbox\block=\hbox{$3*3$} \def\data{\logms3\hfil\cs14\grs \logms3\hfil$3*3$\hfil\cs24\grs \logms3\hfil\cs34\rs 41\cs42\cs43\cs44} \thisbtable{\def\ghostrow{\ifx\empty\rowstblst \else\omit\lineglue\ea\srp\fi \logms3\hfil\prs\lineglue\cr \ifx\empty\rowstblst\else\ea\nxtrs\fi}} \def\btablecaption{Caption} \def\header{\logms4 Header\hfil$\Downarrow$\ } \def\rowstblst{{row 1}{row 2}{row 3}{\hfil$\Rightarrow$}} \def\footer{Footer} $$\vcenter{\ruled\framed\btable\data}$$ !endverbatim \begingroup \blueexample Gnonoms In \TUB{} a discussion about the following kind of rules within tables\Dash so-called ^{gnonoms}\Dash emerged. \newcount\rowno \rowno1 \thisverbatim{\unmc} \begindemo \newcount\columnno \columnno1 \def\data{1\cs3\cs5\rs 1\cs4\cs7\rs 1\cs5\cs9\lrs} \def\cs{\hss\vrule\ifnum \columnno<\rowno width0pt\fi\relax &\global\advance\columnno1 } \def\rs{\hss\vrule\relax\cr \global\advance\rowno1 \global\columnno1 } \def\lrs{\hss\vrule\relax\cr} \halign{&\vbox to12pt{\hbox to12pt {\hss\strut#}\vss\hrule\ifnum \rowno<\columnno width0pt\fi}\cr \data} !yields\offinterlineskip \newcount\columnno \columnno1 \def\data{1\cs3\cs5\rs 1\cs4\cs7\rs 1\cs5\cs9\lrs} \def\cs{\hss\vrule\ifnum \columnno<\rowno width0pt\fi\relax &\global\advance\columnno1 } \def\rs{\hss\vrule\relax\cr \global\advance\rowno1 \global\columnno1 } \def\lrs{\hss\vrule\relax\cr} $$\vbox{\halign{&\vbox to12pt{\hbox to12pt{\hss\strut#}\vss\hrule \ifnum\rowno<\columnno width0pt\fi\relax}\cr \data}}\qquad\qquad$$ \enddemo % %Coding with the deterministic behaviour absorbed, reads as follows. \newcount\rowno \rowno1 \newcount\columnno \columnno1 \newcount\tnum \newcount\diff \diff1 \newcount\n \def\rows{\global\tnum1 \global\advance\diff1 \cols \ifnum\rowno=\n\lrs\swor\fi \rs\rows} \def\swor#1\rows{\fi} \def\cols{\the\tnum \global\advance\tnum\diff \ifnum\columnno=\n\sloc\fi \cs\cols} \def\sloc#1\cols{\fi} \def\cs{\hss\vertrule \ifnum \columnno<\rowno width0pt\fi\relax &\global\advance\columnno1 } \def\rs{\hss\vertrule\relax\cr \global\advance\rowno1 \global\columnno1 } \def\lrs{\hss\vertrule\relax \global\columnno1 \global\rowno1 \global\diff1 \cr} % \def\gnonoms#1{\n#1 \offinterlineskip \halign{&\vbox to12pt{\hbox to15pt {\hss\strut\oldstyle##}\vss\horrule \ifnum\rowno<\columnno width0pt\fi\relax}\cr \rows}} \let\vertrule\vrule \let\horrule\hrule \exercise Each entry of the table obeys the formula $$entry_{i,j}=2j-1+(i-1)(j-1).$$ A little backside of the envelope calculation-\Dash or just look closer at the table\Dash shows that elements in neighbouring columns differ by $i+1$. Format this table as function of the size, i.e., with the elements generated automatically. \answer A solution reads as follows (Similar approach as to Pittman's multiplication tables.) \thisverbatim{\unmc} \beginverbatim \newcount\rowno \rowno1 \newcount\columnno \columnno1 \newcount\tnum \newcount\diff \diff1 \newcount\n \def\rows{\global\tnum1 \global\advance\diff1 \cols \ifnum\rowno=\n\lrs\swor\fi \rs\rows} \def\swor#1\rows{\fi} \def\cols{\the\tnum \global\advance\tnum\diff \ifnum\columnno=\n\sloc\fi \cs\cols} \def\sloc#1\cols{\fi} \def\cs{\hss\vertrule \ifnum \columnno<\rowno width0pt\fi\relax &\global\advance\columnno1 } \def\rs{\hss\vertrule\relax\cr \global\advance\rowno1 \global\columnno1 } \def\lrs{\hss\vertrule\relax \global\columnno1 \global\rowno1 \global\diff1 \cr} % \def\gnonoms#1{\n#1 \offinterlineskip \halign{&\vbox to12pt{\hbox to15pt {\hss\strut\oldstyle##}\vss\horrule \ifnum\rowno<\columnno width0pt\fi\relax}\cr \rows}} \let\vertrule\vrule \let\horrule\hrule $$\vtop{\gnonoms2}\qquad \vtop{\gnonoms5}\qquad \vtop{\gnonoms{10}}$$ \bye !endverbatim \exercise Playing longer with the gnonoms can yield the following graphical results. Modify the above in order to obtain this graph. \def\vertrule{\vrule width1ex} \def\horrule{\hrule height 1ex} \def\cols{\ifnum\columnno=\n\sloc\fi \cs\cols} $$\vtop{\gnonoms3}\qquad \vtop{\gnonoms5}\qquad \vtop{\gnonoms{7}}$$ \answer The following redefinitions yield the results. \beginverbatim \def\vertrule{\vrule width1ex} \def\horrule{\hrule height 1ex} \def\cols{\ifnum\columnno=\n\sloc\fi \cs\cols} $$\vtop{\gnonoms3}\qquad \vtop{\gnonoms5}\qquad \vtop{\gnonoms7}$$ !endverbatim \endgroup \bluesubhead Font charts Font tables can be formatted via ^|\beginchart| and |\endchart|. This markup is used in \TB{} {\oldstyle468}--{\oldstyle526}, for the font tables of the Appendices C and F, and in {\tt testfont.tex}, which comes along with \MF. \blueexample ASCII table, \TB{} {\oldstyle367} \beginverbatim \beginchart{\global\count@='41\tentt \def\chartstrut{\lower4.3pt\vbox to13.6pt{}}} &\oct{00x}&&NUL&&SOH&&STX&&ETX&&EOT&&ENQ&&ACK&&BEL&&\oddline0 &\oct{03x}&&CAN&&EM&&SUB&&ESC&&FS&&GS&&RS&&US&\evenline &\oct{04x}&&SP&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\oddline2 &\oct{05x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\:&\evenline \noalign{\vskip2ex\line{\hfil et cetera\hfil} \vskip2.5ex\hrule \global\advance\count@ 64 } &\oct{16x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\oddline7 &\oct{17x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&DEL&\evenline \endchart !endverbatim resulting in the partial ASCII table {\catcode`\@=11 \beginchart{\global\count@='41\postdisplaypenalty=0 \tentt \def\chartstrut{\lower4.3pt\vbox to13.6pt{}}} &\oct{00x}&&NUL&&SOH&&STX&&ETX&&EOT&&ENQ&&ACK&&BEL&&\oddline0 &\oct{03x}&&CAN&&EM&&SUB&&ESC&&FS&&GS&&RS&&US&\evenline &\oct{04x}&&SP&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\oddline2 &\oct{05x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\:&\evenline \noalign{\vskip2ex\line{\hfil et cetera\hfil} \vskip2.5ex\hrule\global\advance\count@ 64 } &\oct{16x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&\oddline7 &\oct{17x}&&\:&&\:&&\:&&\:&&\:&&\:&&\:&&DEL&\evenline \endchart } %Blank line is needed \bluesubsubhead Why bother about font charts? Well, \dots\thinspace a lot can be learned from \cs{beginchart} for the markup of classes of tables. \bitem Font charts belong to the class of bordered tables \bitem the template is hidden from the user \bitem the data can be provided separately and processed on the fly \bitem the default value of \cs{displaypenalty} can be redefined via \cs{displaypenalty} |<number>| as argument of \cs{beginchart} \bitem \cs{beginchart} is parameterized over the fonts \bitem ^|\normalchart| keeps automatically track of the positions in the font chart. \smallbreak In short, the macros show how \bitem to mark up classes of tables \bitem to hide an \cs{halign} template \bitem to use two-part macros \bitem to cope with options and defaults \bitem to parameterize over fonts, and \bitem to minimize markup. \smallbreak \blueexample Markup for Appendix F {\oldstyle427}\dash{\oldstyle432} \beginverbatim \beginchart{\postdisplaypenalty=0 \tenrm} %or \tenit, \tentt, \tenit, \tensy, \tenex \normalchart \endchart !endverbatim resulting in, for the ^{font chart} \cs{tenrm} \beginchart{\postdisplaypenalty=0 \tenrm} \normalchart \endchart \noindent The default value of \cs{postdisplaypenalty} is -{\oldstyle10000}, to enforce a page break. \exercise How can we get a print of \LaTeX's ^{line\ font}s? Why don't you print ^|\oldstyle| too, just for the fun of it? \answer Similarly, as follows. \beginverbatim \font\tenln=line10 \font\tenlnw=linew10 \beginchart{\postdisplaypenalty=0 \tenln} \normalchart \endchart \beginchart\tenlnw \normalchart \endchart !endverbatim %end of answer The argument of \cs{beginchart} is used among other things to control the kind of table: \cs{tenrm}, \cs{tenit}, \cs{tentt}, \cs{teni}, \cs{tensy}, or \cs{tenex}. The data for normal font tables is provided via |\def\normalchart{...}|. As a consequence the markup for the other tables in \TB{} Appendix F is surprisingly simple. \exercise How come that Knuth decided to implement an ordinary argument after \cs{beginchart}? If you look at \cs{begindisplay} nearly the same coding structure is used, but there the argument is optional. Subtle, very subtle these coding schemes. \answer There is no much use in providing an optional one. The font is needed and {\sl must\/} be specified. %end answer \bluesubhead Ordering table for indexing The most curious of all tables is not a table but generated each time. ^^{ordering table} \thisverbatim{\catcode`\|=12 \catcode`\!=12 \catcode`\~=0 } \begincenterverbatim \def\otindex{%Parameters: Ordering `table' \ea\chardef\csname ot \endcsname=0 %Bulk according to ASCII \def\process##1{\ea\chardef \csname ot##1\endcsname=`##1 } % \fifo abcdefghijklmnopqrstuvwxyz\ofif \chardef\otij=`y \chardef\otIJ=`y % \fifo!"##$&'()*+,-./0123456789:;<=>?@ []_`\ofif % \def\process##1{\ea\chardef \csname ot##1\endcsname=\lccode`##1 } \uppercase{\fifo abcdefghijklmnopqrstuvwxyz\ofif}} ~endcenterverbatim %Back to defaults \def\header{}\def\rowstblst{}\def\btablecaption{}\def\first{}\def\footer{} \endinput

http://voodoo-circle.sourceforge.net/doc_for_developers/latex/c__online__user_8cpp.tex

sourceforge.net

CC-MAIN-2018-05

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-05/segments/1516084887600.12/warc/CC-MAIN-20180118190921-20180118210921-00100.warc.gz

\hypertarget{c__online__user_8cpp}{ \section{c\_\-online\_\-user.cpp File Reference} \label{c__online__user_8cpp}\index{c\_\-online\_\-user.cpp@{c\_\-online\_\-user.cpp}} } Class 'c\_\-online\_\-user'. {\ttfamily \#include \char`\"{}../params.h\char`\"{}}\par {\ttfamily \#include \char`\"{}../utils/memleak.h\char`\"{}}\par {\ttfamily \#include \char`\"{}../utils/my\_\-assert.h\char`\"{}}\par {\ttfamily \#include \char`\"{}../compat.h\char`\"{}}\par {\ttfamily \#include \char`\"{}c\_\-online\_\-user.h\char`\"{}}\par {\ttfamily \#include \char`\"{}../utils/precomp.h\char`\"{}}\par Include dependency graph for c\_\-online\_\-user.cpp: \nopagebreak \begin{figure}[H] \begin{center} \leavevmode \includegraphics[width=174pt]{c__online__user_8cpp__incl} \end{center} \end{figure} \subsection{Detailed Description} Class 'c\_\-online\_\-user'. Definition in file \hyperlink{c__online__user_8cpp_source}{c\_\-online\_\-user.cpp}.

http://dlmf.nist.gov/24.16.E12.tex

nist.gov

CC-MAIN-2014-10

application/x-tex

crawl-data/CC-MAIN-2014-10/segments/1393999636902/warc/CC-MAIN-20140305060716-00079-ip-10-183-142-35.ec2.internal.warc.gz

\[\mathop{B_{{n}}\/}\nolimits\!\left(x\right)=B_{{n,\chi_{0}}}(x-1),\]

http://ftp2.fr.pureftpd.org/pub/CTAN/macros/latex/contrib/nath/nath.sty

pureftpd.org

CC-MAIN-2023-14

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2023-14/segments/1679296945472.93/warc/CC-MAIN-20230326111045-20230326141045-00051.warc.gz

% NATH.STY --- a LaTeX document style implementing NAtural maTH notation % % Copyright (c) 1996-2003 by Michal Marvan % \ifx\nathstyle\undefined \else \typeout{NATH.STY will not be loaded twice.} \expandafter\endinput \fi \newlinechar`\^^J \typeout{^^JNath as of 21 March 2003 ^^JImplementing NAtural maTH notation} % % U s a g e % % \documentstyle[nath]{article} % % or % % \documentclass{article} % \usepackage{nath} % % % L i c e n s e % % Nath is a free software distributed under the terms of the GNU General % Public License <http://www.gnu.org/copyleft/gpl.html> as published by % the Free Software Foundation; either version 2 of the License, or % (at your option) any later version. % % In particular, Nath comes with ABSOLUTELY NO WARRANTY. % % O p t i o n s % % Options may be also set in the body by \nathstyle. \def\nathstyle#1{\@for\@tempa:={#1}\do{\expandafter\nathstyle@\@tempa==\relax}% \ignorespaces} \def\on@@@{on} \def\off@@@{off} \def\nathstyle@#1=#2=#3{\def\@tempa{#1}% \expandafter\ifx\csname if#1\endcsname\relax \n@err{Unknown nath style}{I am ignoring the option `#1' in \nathstyle} \else \def\@tempb{#2}% #3 is `\relax' or `=' \ifx\@tempb\empty \csname #1true\endcsname \else \ifx\@tempb\on@@@ \csname #1true\endcsname \else \ifx\@tempb\off@@@ \csname #1false\endcsname \else \n@err{Invalid argument in \string\nathstyle}% {Nath style argument must be either name or name=on or name=off}% \fi\fi\fi \fi} \newif\ifgeometry \newif\iftensors \newif\ifleqno \newif\ifdebug \newif\ifsilent % % E r r o r m e s s a g e s a n d w a r n i n g s % % Nath errors are marked by a black box, sometimes wrongly placed. \def\natherrormark{\hbox{\vrule \@height\prorated@ em \@width\prorated@ ex}} \def\n@err#1#2{\errhelp\expandafter{#2}\errmessage{#1}\natherrormark} \def\n@warning#1{\ifsilent\else\typeout{Nath Warning: #1\on@line.}\fi} \ifx\Nath\undefined\else \n@warning{NATH.STY will not be loaded again} \expandafter\endinput\fi % % F o n t s % % This style does not introduce any new fonts. It is recommended (but not % required) to have a standard set of AMS fonts introduced independently. % % D i m e n s i o n s % % A new dimension called \mex (math ex) is equal to 1 ex prorated % according to the level of \mathcount@ (see currstyle) \newdimen\mex \mex=1ex % Approximately, 1 mex = 8 mu, but can be used where mu cannot, e.g, % with \ifdim, height, depth, width, etc. \def\prorated@{\ifcase\mathcount@ 1 \or.7 \else.5 \fi} % % P r o t e c t e d d e f s % % I want that all math commands are robust: \newtoks\protect@toks \def\pdef#1{\protect@toks=\expandafter{\the\protect@toks \pdef@#1}% \def#1} \def\pdef@#1{\def#1{\protect#1}} % ... even begin and end \let\o@begin\begin \pdef\begin{\o@begin} \let\o@end\end \pdef\end{\o@end} % Macro to make an existing command robust \def\makerobust#1{% \expandafter\let\csname @o@\expandafter\@gobble\string #1\endcsname=#1 \edef#1{\noexpand\protect \expandafter\noexpand\csname @o@\expandafter\@gobble\string #1\endcsname}} % Making composed math symbols robust: \makerobust\cong \makerobust\notin % % C o n t r o l m a c r o s % % Here is a global version of TeX's loop macro: \def\g@loop#1\repeat{\gdef\g@body{#1}\g@iterate} \def\g@iterate{\g@body\global\let\gnext=\g@iterate \else \global\let\gnext=\relax \fi \gnext} % Some tests put their result into \ifresult@ \newif\ifresult@ \def\old#1{\csname o@#1\endcsname} % % S t a c k s % \def\put@#1#2{\edef#2{#1\relax#2}} \def\get@#1#2{\expandafter\get@@#2\endget@@#1#2} \def\get@@#1\relax#2\endget@@#3#4{\edef#3{#1}\edef#4{#2}} % % M a t h c o d e s % % Many characters are live (\mathcode = "8000) in math mode. % After saving their original mathcodes: \edef\mc@lparenthesis{\mathchar\the\mathcode`(\relax} \edef\mc@rparenthesis{\mathchar\the\mathcode`)\relax} \edef\mc@lbrack{\mathchar\the\mathcode`[\relax} \edef\mc@rbrack{\mathchar\the\mathcode`]\relax} \edef\mc@comma{\mathchar\the\mathcode`,\relax} \edef\mc@semicolon{\mathchar\the\mathcode`;\relax} \edef\lt{\mathchar\the\mathcode`<\relax} \edef\gt{\mathchar\the\mathcode`>\relax} \edef\mc@factorial{\mathchar\the\mathcode`!\relax} \edef\mc@slash{\mathchar\the\mathcode`/\relax} \edef\vert{\mathchar\the\mathcode`|\relax} % we assign new ones: \mathcode`\(="8000 \mathcode`\[="8000 \mathcode`\<="8000 \mathcode`\)="8000 \mathcode`\]="8000 \mathcode`\>="8000 \mathcode`\,="8000 \mathcode`\;="8000 \mathcode`\^="8000 \mathcode`\!="8000 \mathcode`\`="8000 \mathcode`\_="8000 % Before defining live characters, one must call \livechars@ to % set catcodes to 13 (active). \def\livechars@{ \catcode`\(=13 \catcode`\[=13 \catcode`\<=13 \catcode`\)=13 \catcode`\]=13 \catcode`\>=13 \catcode`\,=13 \catcode`\;=13 \catcode`\!=13 \catcode`\`=13} \def\killchars@{ \catcode`\(=12 \catcode`\[=12 \catcode`\<=12 \catcode`\)=12 \catcode`\]=12 \catcode`\>=12 \catcode`\,=12 \catcode`\;=12 \catcode`\!=12 \catcode`\`=12} % Here are the definitions: \livechars@ \def({\delim@l 1\ch@lparenthesis} \def){\delim@r 1\ch@rparenthesis} \def[{\delim@l 1\o@lbrack} \def]{\delim@r 1\o@rbrack} \def!{\factorial} \def,{\@comma} \def;{\@semicolon} \def`{\abbreviation} % Every math calls \mathoptions@on to set live definition of <, > % depending on the current value of ifgeometry; and to set % fontdimens according to the current value of iftensors % The following control sequences contain \def\mathoptions@on{% \ifgeometry % if geometry=on \def<{\delim@l 1\o@langle}% \def>{\delim@r 1\o@rangle}% \else % if geometry=off \def<{\lt}% \def>{\gt}% \fi \iftensors % if tensors=on \edef\fdviii@textfontiii{\the\fontdimen8\textfont3}% \edef\fdxiii@textfontii{\the\fontdimen13\textfont2}% \edef\fdxiv@textfontii{\the\fontdimen14\textfont2}% \edef\fdxv@textfontii{\the\fontdimen15\textfont2}% \edef\fdxvi@textfontii{\the\fontdimen16\textfont2}% \fontdimen 8\textfont3=.075ex% 1/4 of min superscript/subscript clearance \fontdimen13\textfont2=1.3ex% min superscript shift in displaystyle \fontdimen14\textfont2=1.3ex% min superscript shift otherwise \fontdimen15\textfont2=1.3ex% min superscript shift in restricted style \fontdimen16\textfont2=.65ex% min subscript shift if no superscript \fontdimen17\textfont2=0ex% min subscript shift if no superscript \relax \fi } \def\mathoptions@off{% \iftensors \fontdimen 8\textfont3=\fdviii@textfontiii \fontdimen13\textfont2=\fdxiii@textfontii \fontdimen14\textfont2=\fdxiv@textfontii \fontdimen15\textfont2=\fdxv@textfontii \fontdimen16\textfont2=\fdxvi@textfontii \relax \fi} \killchars@ % % D o l l a r s % % Math mode is inline or displayed. % Top level macros to start either mode are: % To start use % ---------------- ------------------------ % inline math $ ... $ % displayed math $$ ... $$ or \[ ... \] % or math environments such % as equation, eqns, eqns* % The $ is active (catcode = 13). % % The original $ (catcode = 3) is stored in \o@dollar. % \o@math is the original $ followed by \relax. % \o@display is the original double $$. \let\o@dollar=$ \def\o@math{\o@dollar\relax} % calls \everymath \def\o@display{\o@dollar\o@dollar} % calls \everydisplay % \everymath and \everydisplay \everymath{} % keep empty \everydisplay{} % keep empty \catcode`\$=13 \def$#1${\@@dollar{#1}} \pdef\@@dollar#1{% \ifmmode\else\begingroup\fi % no begingroup if closing $ \def\next{#1}% \ifx\next\empty % if $$ \ifmmode % if closing $$ \] \def\next{\endgroup\ignorespaces}% \else \[ \def\next{\relax}% \fi \else % if $; #1 = the whole content between $'s \imath@{#1}% \let\next\endgroup \fi \next} \catcode`\$=3 % $'s eventually call internal commands to start math mode, which are % \imath@{ ... } % ... \dmathoff@ \def\dmathon@{\o@math \setbox\sizebox\delimstrut@ % initialize sizebox \begingroup \mathoptions@on \displayon@ % start displayed } % \dmathoff@ == end displayed style % end group \def\dmathoff@{\enddisplaydelims@ \mathoptions@off \endgroup \o@math} \def\imath@#1{\mathoptions@on\o@math\inline{#1}\o@math\mathoptions@off} \def\(#1\){\imath@{#1}} % The math environment is disabled \def\math{\n@err{Disabled environment. Use $ to begin math} {I am inserting $ to start inline math mode.}\o@math} \def\endmath{\n@err{Obsolete command. Use $ to end math.} {I am inserting $ to end inline math mode.}\o@math} % % G e n e r i c d i s p l a y m a t h m a c r o % % $$, \[, \], and all displayed math environments use low-level macros % make@eq/endmake@eq to format a displayed formula. % Usage: % % \o@display \make@eq % ... % \endmake@eq \o@display % There is a dimension register called \mathindent to control the % positioning. If \mathindent > 0, formulas are left-indented that % amount, otherwise they are centered. \newdimen\mathindent \mathindent=4pc \newdimen\disp@box@width \newdimen\disp@width \let\o@label=\label % store the original \label \newif\ifmultiline@ \let\o@eqno=\eqno % store the TeX's \eqno \let\o@leqno=\leqno % store the TeX's \leqno \def\make@eq{% \global\let\do@eqno=\curr@eqno \def\the@eqlabel{}% \def\label##1{\gdef\the@eqlabel{##1}}% \display@true \nodisplay@false \protectinline@false \ifdim\mathindent<0pc % if centered then nothing \else % if flushleft \disp@box@width=\linewidth \advance\disp@box@width -\mathindent \disp@width=\disp@box@width \advance\disp@width -\mathindent \hbox to \disp@width\bgroup \vbox\bgroup % \ifdebug\hrule\fi \hsize\disp@box@width \parindent=0pt \parfillskip=0pt \leavevmode\o@math \fi \global\multiline@false \setbox0 \vbox\bgroup} % starting (multiline) vbox \def\endmake@eq{\egroup % ending (multiline) vbox \ifeqnumbering@ \ifmultiline@ \vcenter{\box0} % make the equation number vertically centered \else \box0 \fi \ifdim\mathindent<0pc % if centered \ifleqno\else \o@eqno{\do@eqno}\fi \else % if flushleft \o@math \hfil\null \ifleqno\else \hfil\null\hfil \hbox{\do@eqno} \fi \egroup \hss\egroup \fi \ifleqno \o@leqno{\do@eqno} \fi \else % if no numbering \ifdim\mathindent<0pc % if centered \box0 \else \box0\o@math \hfil \null\egroup \hss \egroup \fi \fi } % The purpose of the vbox with parfillskip = 0 and triple filling % is that the equation number will go on the line following the % formula if the formula is too long. % Catch the global option `leqno': \def\ds@leqno{\leqnotrue} % % D i s p l a y l i n e s a n d b l o c k s % % A single natural-width hbox with displayed material inside % is produced by \displayline@. % Here is the skip between adjacent displaylines \newskip\interdisplayskip \interdisplayskip=1.67 ex % An empty displayline must not produce any vertical space. % Empty is if of length < or = to zero \def\displayline@{\setbox0\hbox\bgroup \o@math\dcurrstyle@} \def\enddisplayline{\o@math\egroup \ifdim\wd0>0pt \box0 \else \box0 \vskip-\interdisplayskip \fi} % The formula inside may actually be a wall-return block, i.e., % may be multiline. % A multiline block is a top-aligned vbox, followed by new line. % The command to start a block is \wall, the command to end it % is \return. Adjacent returns must not generate an empty line. % % \wall % formula; lines separated with \\ % \return % \newif\ifinnerwall@ % if inside another wall-return block \innerwall@false % We define generic \d@wall and \d@return here. Actual wall and return % are defined in displaydelims, after some escape machinery. \def\d@wall#1{\hbox\bgroup %\ifdebug\vrule\@width 1pt\fi \vtop\bgroup\offinterlineskip \if0#1 % if wall \edef\pad@{\relax} \else % if shifted \edef\pad@{\pad@\@cdr#1\@nil} \fi \innerwall@true \displayline@ } \def\d@return{\enddisplayline \egroup % end vtop %\ifdebug\vrule \@width 1pt\fi \egroup % end hbox \ifinnerwall@ \curr@cr \fi } %Inside any wall-return block, \\ should be \d@cr: \def\d@cr#1{\enddisplayline\vskip\interdisplayskip \global\multiline@true \displayline@ #1 % may be \pad@ or \relax } %If \wall is misplaced \newif\ifwallallowed@ \wallallowed@true % % D i s p l a y m a t h e n v i r o n m e n t s % % A single equation; unnumbered: % % $$ complete formula $$ % or % \[ complete formula \] % numbered: % % \begin{equation} complete formula \end{equation} % A pile of equations; unnumbered: % % \begin{eqns*} % complete formulas separated with \\ % \end{eqns*} % numbered: % % \begin{eqns} % complete formulas separated with \\ % \end{eqns} % holding the same number; followed by a letter: % % \begin{eqnabc} % complete formulas separated with \\ % \end{eqnabc} % The environments set ifeqnumbering@ % and call make@eq. % $$, \[ and \begin{equation} start a wall-return block. % This means that \def\[{\begingroup \global\eqnumbering@false \curr@cr@is@wall@cr \o@display\make@eq\hbox\bgroup\dmathon@\wall\mathopen{}} \def\]{\return\dmathoff@\egroup\endmake@eq\o@display \endgroup\ignorespaces} \newif\ifeqnumbering@ % global \def\equation{\begingroup \global\eqnumbering@true \curr@cr@is@wall@cr \o@display\make@eq\hbox\bgroup\dmathon@\wall\mathopen{}} \def\endequation{\return\dmathoff@\egroup\endmake@eq\o@display \endgroup \global\@ignoretrue} % Unnumbered equation for backward compatibility \expandafter\def\csname equation*\endcsname{\[} \expandafter\def\csname endequation*\endcsname{\]\global\@ignoretrue} % Important! The \mathopen{} after \wall protects active characters from % being scanned prematurely. \def\eqns{\begingroup \belowdisplayskip@=\belowdisplayskip \belowdisplayskip=0pt \belowdisplayshortskip=0pt \global\eqnumbering@true \def\curr@cr{\eqns@cr \global\eqnumbering@true} \let\\\curr@cr \postdisplaypenalty=9999 \belowdisplayshortskip=\belowdisplayskip \o@display\make@eq\hbox\bgroup\dmathon@} \def\endeqns{\dmathoff@\egroup \endmake@eq\o@display \vskip\belowdisplayskip@ \endgroup \global\@ignoretrue \noindent} \expandafter \def\csname eqns*\endcsname{\begingroup \belowdisplayskip@=\belowdisplayskip \belowdisplayskip=0pt \belowdisplayshortskip=0pt \global\eqnumbering@false \def\curr@cr{\eqns@cr \global\eqnumbering@false} \let\\\curr@cr \postdisplaypenalty=10000 \belowdisplayshortskip=\belowdisplayskip \o@display\make@eq\hbox\bgroup\dmathon@} \expandafter \def\csname endeqns*\endcsname{\endeqns} \def\eqns@cr{\dmathoff@\egroup\endmake@eq\o@display \hrule\@height 0pt \abovedisplayshortskip=0pt plus 0pt minus 0pt \vglue\intereqnsskip \hrule\@height 0pt \o@display \make@eq\hbox\bgroup\dmathon@} \def\nonumber{\global\eqnumbering@false} \def\numbered{\global\eqnumbering@true} \newskip\intereqnsskip \intereqnsskip=1ex \newskip\belowdisplayskip@ % % E q u a t i o n n u m b e r i n g % % Displaymath (namely \endmake@eq) calls \do@eqno to create the % equation number. At the beginning of each display, \do@eqno is % set to \curr@eqno. Numbering macros should define \curr@eqno, % while \eqno changes \do@eqno directly. % \do@eqno calls \make@eqno, a generic command to make its % argument into both the equation number and the currentlabel. \def\make@eqno#1{\def\make@eqno@{#1} % \rm removed thanks to E.H. Lohse \def\@currentlabel{\make@eqno@} \ifx\the@eqlabel\empty \n@warning{No label in equation (#1)} \else \ifeqnumbering@ \o@label{\the@eqlabel} \else \n@warning{Label occurs in an unnumbered formula} \fi \fi \hbox{\rm(\make@eqno@)% \ifnum\overfullrule>0 % if draft \hbox to 0pt{\hglue 1pc``{\tt\the@eqlabel}''\hss}% \fi}% } % The command \eqno defines \do@eqno to call \make@eqno on the % \eqno's argument. \def\eqno#1{\global\eqnumbering@true \gdef\do@eqno{\make@eqno{#1}}} % Default \curr@eqno creates the default numbering (N), where % N is the current value of \theequation, stepped each time % \curr@eqno is called. \def\curr@eqno{\refstepcounter{equation} \make@eqno{\theequation}} % subabc is an environment to change numbering from (1), (2), (3) % to (1a), (1b), (1c), i.e., to (NL) where N is the value of % \theequation (stepped only when the environment starts) and L is % the letter corresponding to the current value of the counter % eqnabc (stepped each time \curr@eqno is called, starting % from 0 in the beginning of subabc). \newcount\c@eqnabc \def\subabc{\refstepcounter{equation} \c@eqnabc=0 \def\curr@eqno{\refstepcounter{eqnabc} \make@eqno{\theequation\alph{eqnabc}}} } \def\endsubabc{\global\@ignoretrue} % % A l i g n m e n t e n v i r o n m e n t s % \newskip\displaylineskip \newskip\displaybaselineskip \newdimen\displaylineskiplimit \displaylineskip=1.2ex plus 0.2ex \displaybaselineskip=3.8ex plus 0.2ex \displaylineskiplimit=.01ex \def\dmstrut@{\hbox{\vrule\@height 1.7ex\@depth .7ex\@width 0ex}} \newdimen\eqnnumlowering@ \def\eqnarray{% \global\let\do@eqno=\curr@eqno \def\the@eqlabel{}% \def\label##1{\gdef\the@eqlabel{##1}}% \x@eqnarray} \expandafter\def\csname eqnarray*\endcsname{\def\@eqnarray@cr{\cr} \x@eqnarray} \def\x@eqnarray{% \ifdim\mathindent<\z@ \mathindent=-\mathindent \n@warning{Negative \mathindent in eqnarray} \fi \o@display\make@eq \def\curr@cr{\@eqnarray@cr \global\multiline@false \global\eqnumbering@true \global\let\do@eqno=\curr@eqno} \let\\\curr@cr \global\eqnumbering@true \vbox\bgroup %%%% \ddelimalign@errhelp \displaydefs@ \lineskip\displaylineskip \baselineskip\displaybaselineskip \lineskiplimit\displaylineskiplimit \ialign to\disp@box@width \bgroup \gdef\missing@tabs{&&&}% \hfil\hbox{\wallallowed@false\dmathon@\dmstrut@##\dmathoff@}% \tabskip 0pt \gdef\missing@tabs{&&}% &\hfil\hbox{\wallallowed@false\o@dollar\null##\null\o@dollar}\hfil \tabskip 0pt \gdef\missing@tabs{&}% &\setbox0\vbox{\hbox{\o@dollar\dmathon@\dmstrut@\mathopen{}##\dmathoff@ \o@dollar}}% \global\eqnnumlowering@=0pt \global\advance\eqnnumlowering@\dp0 \box0\hfil \tabskip 0pt plus 1000pt \gdef\missing@tabs{}% &\setbox0\llap{##}% \ifmultiline@ \lower.5\eqnnumlowering@\box0 \else \box0 \fi \tabskip 0pt\crcr} \def\endeqnarray{ \@eqnarray@cr \egroup\egroup \global\eqnumbering@false \endmake@eq\o@display \global\@ignoretrue} \expandafter\def\csname endeqnarray*\endcsname{\endeqnarray} \def\@eqnarray@cr{\missing@tabs \ifeqnumbering@\do@eqno\fi \global\@eqnswtrue\crcr } \def\eqnsabc{\subabc\eqns} \def\endeqnsabc{\endeqns\endsubabc} \def\eqnarrayabc{\subabc\eqnarray} \def\endeqnarrayabc{\endeqnarray\endsubabc} \def\ddelimalign@errhelp{\def\ldelim@errhelp{% Alignments interfere badly with display mode of delimiters. ^^JEvery alignment cell must be balanced. ^^JWhen cells are as follows: ^^J alignment A & B1 \\ & B2 \\ & ... endalignment ^^Jthen alignment may be replaced with ^^J ... A \wall B1 \\ B2 \\ ... \return} \let\rdelim@errhelp\ldelim@errhelp} % The purpose of LaTeX alignment math environments eqnarray % and eqnarray* is, basically, to align binary relation symbols % in two typographically relevant situations: % % (1) a long formula broken into n lines; % (2) a pile of n distinct formulas, one below another. % In case (1), a single wall-return block provides a simple solution % that saves the 2n alignment symbols `&' required by eqnarray: % % A \wall = B1 \\ % = B2 \\ % ... % % = Bn \return % % In case (2), the alignment of relation symbols is somewhat % controversial; this style provides limited support for it. % % P a r a g r a p h i t e m s % \expandafter\ifx\csname paritemwd\endcsname\relax \newdimen\paritemwd\paritemwd=2pc \fi \def\paritem#1{% \ifmmode \ifdisplay@ \ifdim\mathindent<0pt % if centered formula \ifleqno % equation numbers on the left \paritem@leqno{#1} \else \n@err{Disallowed \string\paritem} {Sorry, I am not programmed to handle this case. ^^JSet \mathindent to a positive length to circumvent the problem.} \fi \else % if left-aligned formula \ifleqno % equation numbers on the left \paritem@leqno{#1} \else \llap{\hbox to \mathindent{\paritem@{#1}\hfil}} \fi \fi \else \n@err{Misplaced \string\paritem} {It is disallowed to start \paritem in inline math mode} \fi \else \par\noindent\paritem@{#1}\kern 1ex \fi \ignorespaces} \def\paritem@#1{\hbox to\paritemwd{\hss\rm#1}\ignorespaces} \def\paritem@leqno#1{ \ifeqnumbering@ \n@warning{Left numbering superseded by \string\paritem} \else \global\eqnumbering@true \fi \global\def\do@eqno{\paritem@{#1}} } % % M a t h m o d e s % % The four math styles of plain TeX (displaystyle, textstyle, scriptstyle, % scriptscriptstyle) are abandoned. % We distinguish two math mode: inline and displayed. % They must always apply to a whole subformula and it is not possible to % switch between them arbitrarily. % While in math mode, % to start use % ---------------- ------------------------ % inline style \inline{ ... } % displayed style \displayed{ ... } % displayed \newif\ifnodisplay@ \def\displayon@{% \ifnodisplay@ \n@err{Misplaced displayed}% {Do not start display mode between inline delimiters.}% \else \mspaces@ \displaydelims@ \dcurrstyle@ \fi} \def\displayoff@{\enddisplaydelims@} \pdef\displayed#1{\displayon@#1\displayoff@} \def\mspaces@{\relax} % Inline -- I want that user macros expand to reveal Nath behind them \newif\ifprotectinline@ \protectinline@true \pdef\inline#1{% \begingroup \ifprotectinline@ \begingroup \the\protect@toks \def\protect{\noexpand} \xdef\inline@{\noexpand\wrapfrac@{ #1}} \endgroup \protectinline@false \else \def\inline@{\wrapfrac@{#1}}% \fi \display@false \inlinedelims@\icurrstyle@ \inline@ \ldelim@warningcheck{\idelimlevel@}% \endgroup} % We need a script level count \newcount\mathcount@ % means the level of sub- and super-script (0,1,2,...) % and an \ifdisplay \newif\ifdisplay@ % if a displayed formula % We store the four math style switches for future use. \let\o@displaystyle=\displaystyle \let\o@textstyle=\textstyle \let\o@scriptstyle=\scriptstyle \let\o@scriptscriptstyle=\scriptscriptstyle % We redefine \displaystyle and \textstyle; their original effect is disabled. % \displaystyle is useful in the context of the principle of smallest fences. % % We also redefine \scriptstyle and \scriptscriptstyle to advance \mathcount@ % by 1 and 2, respectively. % Observe that \scriptstyle\scriptstyle now has the same effect as % \scriptscriptstyle \def\displaystyle{\setbox0 \hbox{\vrule\@height 3.2\mex \@depth 2\mex \@width 1pt}% \resizebox@0} \let\textstyle\relax \def\scriptstyle{\advance\mathcount@1 \currstyle@} \def\scriptscriptstyle{\advance\mathcount@2 \currstyle@} % % M a t h s i z e s % \newdimen\delimaxis@ \newdimen\strutsize@ \delimaxis@=.3ex \strutsize@=2.1ex \def\delimstrut@{\hbox{\@tempdima=\delimaxis@ \@tempdimb=\delimaxis@ \advance\@tempdima .5\strutsize@ \advance\@tempdimb -.5\strutsize@ \vrule height\prorated@\@tempdima depth\prorated@\@tempdimb width 0pt}} \def\dcurrstyle@{\display@true \ifcase\mathcount@ \o@displaystyle \mex=1ex \or\o@scriptstyle \mex=.7ex \else\o@scriptscriptstyle \mex=.5ex \fi} \def\icurrstyle@{\display@false \ifcase\mathcount@ \o@textstyle \mex=1ex \or\o@scriptstyle \mex=.7ex \else\o@scriptscriptstyle \mex=.5ex \fi} \def\currstyle@{% \ifcase\mathcount@ \mex=1ex \ifdisplay@\o@displaystyle \else\o@textstyle \fi \or\o@scriptstyle \mex=.7ex \else\o@scriptscriptstyle \mex=.5ex \fi} % One step smaller than currstyle is \iscriptstyle@: \def\iscriptstyle@{\display@false\scriptstyle} \def\currstyle@hbox#1{% \ifdisplay@ \hbox{\dmathon@\dcurrstyle@ #1% \global\setbox\sizebox@\box\sizebox \dmathoff@}% \resizebox@{\sizebox@}% \else \hbox{\imath@{\icurrstyle@#1}}% \fi} \def\scriptstylehbox@#1{\hbox{\imath@{\iscriptstyle@#1}}} % Frame around a subformula \let\o@fbox\fbox \pdef\framed#1{\o@fbox{\o@math\currstyle@hbox{#1}\o@math}} % A repeated sizebox: \def\samesize@{\mathopen{}\copy\sizebox} % We redefine \mathpalette and \mathchoice, although they are no % more needed \def\mathpalette#1#2{{#1\currstyle@{#2}}} \def\mathchoice#1#2#3#4{% \ifcase\mathcount@ \ifdisplay@ #1 \else #2 \fi \or #3 \else #4 \fi } % % R e s t r i c t e d m o d e % \newif\iftoprestricted@ \toprestricted@true \newif\ifbotrestricted@ \botrestricted@true % % T e x t % \newtoks\curr@rm % global needed? \pdef\text#1{\mathclose{}\text@ \hbox\expandafter{\protect\the\curr@rm #1}\mathopen{} \penalty\punctpenalty\relax} % Fixed 5.9.2002 thanks to Hedevang Lohse \def\text@{% \ifcase\mathcount@ \global\curr@rm\expandafter{\the\textfont0 }% \or \global\curr@rm\expandafter{\the\scriptfont0 }% \else \global\curr@rm\expandafter{\the\scriptscriptfont0 }% \fi} % % S i z i n g c o m m a n d s % % The size of delimiters is determined by the ``heavy'' part of the % sub formula enclosed. ``Ignorable'' elements (sub- and superscripts, % diacritics) do not contribute. % We use a local box register called \sizebox. Although empty, % it has its height and depth, equal to the height and depth of the % ``main part'' of the current subformula in displayed style. \newbox\sizebox % local \newbox\sizebox@ % global \def\setsize@#1{% \ifdisplay@ \setbox0\hbox{\o@math\dcurrstyle@#1\o@math}% \resizebox@{0}% \fi} % Called by \setsize@ and \currstyle@hbox, the command \resizebox@ compares % vertical dimensions of \sizebox to those of box#1 and sets them to % whichever is bigger. \def\resizebox@#1{% \ifdim\ht\sizebox<\ht#1 \ht\sizebox=\ht#1 \fi \ifdim\dp\sizebox<\dp#1 \dp\sizebox=\dp#1 \fi} % A debugging tool - visualize vertical dimensions of certain boxes \def\showverticaldimensionsofthebox#1{% \hbox{\vrule \@height \ht#1 \@depth \dp#1 \@width .667pt}} % Sizing commands for every large operator from TeXbook p. 435 \let\o@sum=\sum \let\o@prod=\prod \let\o@coprod=\coprod \let\o@int=\int \let\o@oint=\oint \let\o@bigcap=\bigcap \let\o@bigcup=\bigcup \let\o@bigsqcup=\bigsqcup \let\o@bigvee=\bigvee \let\o@bigwedge=\bigwedge \let\o@bigodot=\bigodot \let\o@bigotimes=\bigotimes \let\o@bigoplus=\bigoplus \let\o@biguplus=\biguplus \pdef\big@op#1{\setsize@{#1}\mathop{#1}} \def\sum{\big@op\o@sum} \def\prod{\big@op\o@prod} \def\coprod{\big@op\o@coprod} \def\oint{\big@op\o@oint\nolimits} \def\bigcap{\big@op\o@bigcap} \def\bigcup{\big@op\o@bigcup} \def\bigsqcup{\big@op\o@bigsqcup} \def\bigvee{\big@op\o@bigvee} \def\bigwedge{\big@op\o@bigwedge} \def\bigodot{\big@op\o@bigodot} \def\bigotimes{\big@op\o@bigotimes} \def\bigoplus{\big@op\o@bigoplus} \def\biguplus{\big@op\o@biguplus} % \int sticks to any following \int. \pdef\int{\setsize@\o@int \int@stick} \def\int@stick{\afterassignment\int@stick@\let\next=} \def\int@stick@{ \ifx\next\int \def\next@comm{\intop\int@kern\int} \else \def\next@comm{\intop\nolimits\next} \fi \next@comm} \def\int@kern{\ifdisplay@ \kern-1.4\mex \else \kern -.9\mex \fi} % % L i v e d e l i m i t e r s % % Every delimiter stands for itself. No additional presentation markup % (such as \biggl,\biggr or \left,\right) is needed. % Warning: In math mode [,] no more denote optional arguments. \newcount\idelimlevel@ % Store \TeX's delimiters for character tests \let\ch@lparenthesis=( \let\ch@rparenthesis=) \let\ch@lbrack=[ \let\ch@rbrack=] \let\ch@langle=< \let\ch@rangle=> \let\o@lbrack=\lbrack \let\o@rbrack=\rbrack \let\o@lfloor=\lfloor \let\o@lceil=\lceil \let\o@rfloor=\rfloor \let\o@rceil=\rceil \def\o@lbrace{\delimiter"4266308 } \let\{=\o@lbrace \def\o@rbrace{\delimiter"5267309 } \let\}=\o@rbrace \let\o@langle=\langle \let\o@rangle=\rangle \let\o@uparrow=\uparrow \let\o@downarrow=\downarrow \let\o@updownarrow=\updownarrow \let\o@Uparrow=\Uparrow \let\o@Downarrow=\Downarrow \let\o@Updownarrow=\Updownarrow \let\o@backslash=\backslash \let\o@vert=| \let\o@Vert=\Vert \pdef\{{\delim@l 1\o@lbrace} \pdef\}{\delim@r 1\o@rbrace} \pdef\lvert{\delim@l 1|} \pdef\rvert{\delim@r 1|} \pdef\lVert{\delim@l 1\Vert} \pdef\rVert{\delim@r 1\Vert} \pdef\lbrack{\delim@l 1\o@lbrack} \pdef\rbrack{\delim@r 1\o@rbrack} \pdef\langle{\delim@l 1\o@langle} \pdef\rangle{\delim@r 1\o@rangle} \pdef\lbrace{\delim@l 1\o@lbrace} \pdef\rbrace{\delim@r 1\o@rbrace} \pdef\lfloor{\delim@l 1\o@lfloor} \pdef\rfloor{\delim@r 1\o@rfloor} \pdef\lceil{\delim@l 1\o@lceil} \pdef\rceil{\delim@r 1\o@rceil} \pdef\lBrack{\delim@l 2\o@lbrack} \pdef\rBrack{\delim@r 2\o@rbrack} \pdef\lAngle{\delim@l 2\o@langle} \pdef\rAngle{\delim@r 2\o@rangle} \pdef\lFloor{\delim@l 2\o@lfloor} \pdef\rFloor{\delim@r 2\o@rfloor} \pdef\lCeil{\delim@l 2\o@lceil} \pdef\rCeil{\delim@r 2\o@rceil} % Null delimiters \pdef\lnull{\delim@l 0.} \pdef\rnull{\delim@r 0.} % Obsolete commands: \let\Big\relax \let\Bigg\relax \let\Bigl\left \let\Biggl\left \let\Bigr\right \let\Biggr\right \let\Bigm\middle \let\Biggm\middle % % L e f t, r i g h t a n d m i d d l e % % Store \TeX's definitions \let\o@left=\left \let\o@right=\right \let\@stop=. % Here is the new definition for \left: \livechars@ \pdef\left#1{\left@#1} \def\left@{\afterassignment\left@@\let\next=} \def\left@@{\ifx\next\@stop \lnull\else \ifx\next|\delim@l 1\o@vert \else \ifx\next\|\delim@l 1\o@Vert \else \ifx\next\vert\delim@l 1\o@vert \else \ifx\next\Vert\delim@l 1\o@Vert \else \ifx\next\ch@rbrack\delim@l 1\o@rbrack \else \next \fi\fi\fi\fi\fi\fi} % Here is the new definition for \right: \pdef\right#1{\right@#1} \def\right@{\afterassignment\right@@\let\next=} \def\right@@{\ifx\next\@stop \rnull\else \ifx\next|\delim@r 1\o@vert \else \ifx\next\|\delim@r 1\o@Vert \else \ifx\next\vert\delim@r 1\o@vert \else \ifx\next\Vert\delim@r 1\o@Vert \else \ifx\next\ch@lbrack\delim@r 1\o@lbrack \else \next \fi\fi\fi\fi\fi\fi} % Here is the new definition for \middle % (a bug fixed 21 Sept. 2002 thanks to E.H. Lohse) \pdef\middle#1{\mathrel{}\middle@#1\mathrel{}} \def\middle@#1{\def\next{#1} \ifx\next\@stop \else \ifx\next\o@vert\delim@m 1\o@vert \else \delim@m 1#1% \fi\fi} \killchars@ % Some other middle delimiters: \def\mid{\middle|} % % D o u b l e % \pdef\double{\afterassignment\double@@\let\next=} \def\double@@{% \ifx\next\ch@lbrack\delim@l 2\o@lbrack \else \ifx\next\ch@langle\delim@l 2\o@langle \else \ifx\next\ch@rbrack\delim@r 2\o@rbrack \else \ifx\next\ch@rangle\delim@r 2\o@rangle \else \ifx\next|\delim@m 2\o@vert \else \ifx\next\vert\delim@m 2\o@vert \else \ifx\next/\delim@m 2/ \else \ifx\next\backslash\delim@m 2\backslash \else \n@err{Missing delimiter}{\double must be followed by [,],<,> or |} \fi\fi\fi\fi\fi\fi\fi\fi} \pdef\ldouble{\afterassignment\ldouble@@\let\next=} \def\ldouble@@{\ifx\next\@stop \lnull\else \ifx\next|\delim@l 2\o@vert \else \ifx\next\vert\delim@l 2\o@vert \else \n@err{Missing delimiter}{\ldouble must be followed by |}\lnull \fi\fi\fi} \pdef\rdouble{\afterassignment\rdouble@@\let\next=} \def\rdouble@@{\ifx\next\@stop \rnull\else \ifx\next|\delim@r 2\o@vert \else \ifx\next\vert\delim@r 2\o@vert \else \n@err{Missing delimiter}{\rdouble must be followed by |}\rnull \fi\fi\fi} \def\Mid{\double|} % % T r i p l e % \pdef\triple#1{\triple@ #1} \def\triple@{\afterassignment\triple@@\let\next=} \def\triple@@{% \ifx\next\ch@lbrack\delim@l 3\o@lbrack \else \ifx\next\ch@langle\delim@l 3\o@langle \else \ifx\next\ch@rbrack\delim@r 3\o@rbrack \else \ifx\next\ch@rangle\delim@r 3\o@rangle \else \ifx\next|\delim@m 3\o@vert \else \ifx\next\vert\delim@m 3\o@vert \else \ifx\next\vert\delim@m 3\o@vert \else \ifx\next/\delim@m 3/ \else \ifx\next\backslash\delim@m 3\backslash \else \n@err{Missing delimiter}{\triple must be followed by [,],<,> or |} \fi\fi\fi\fi\fi\fi\fi\fi\fi} \pdef\ltriple#1{\ltriple@ #1} \def\ltriple@{\afterassignment\ltriple@@\let\next=} \def\ltriple@@{\ifx\next\@stop \lnull\else \ifx\next|\delim@l 3\o@vert \else \ifx\next\vert\delim@l 3\o@vert \else \n@err{Missing delimiter}{\ltriple must be followed by |}\lnull \fi\fi\fi} \pdef\rtriple#1{\rtriple@ #1} \def\rtriple@{\afterassignment\rtriple@@\let\next=} \def\rtriple@@{\ifx\next\@stop \rnull\else \ifx\next|\delim@r 3\o@vert \else \ifx\next\vert\delim@r 3\o@vert \else \n@err{Missing delimiter}{\rtriple must be followed by |}\rnull \fi\fi\fi} % % N e s t e d d e l i m i t e r s % % Here is a count to count nesting of delimiters \newcount\ddelimlevel@ % Missing delimiters checking \def\rdelim@error{\n@err{Unmatched right delimiter}% \rdelim@errhelp \ddelimlevel@=0} \def\rdelim@errhelp{Delimiters must be balanced within groups and alignment cells. ^^JI am ignoring whatever is superfluous.} \def\ldelim@error#1{\n@err{Unmatched \number#1 left delimiter(s)}% \ldelim@errhelp \\\ddcount@@=#1 \loop\ifnum\ddcount@@>0 \rnull \advance\ddcount@@-1 \repeat} \def\ldelim@errhelp{Delimiters must be balanced within groups and alignment cells. ^^JI am inserting `)' for every missing left delimiter. ^^JLots of error messages may follow; better fix it before going on.} \def\ldelim@warningcheck#1{\ifnum#1>0 \n@warning{Unmatched \number#1 left delimiter(s)}% \fi} \def\mdelim@error{\n@err{Misplaced \string\middle}% {This command must occur between a left and a right delimiter. ^^JDoesn't, so I am ignoring it.}% \ddelimlevel@=0} % Default mode of delimiters \def\defaultdelims@{% \def\delim@l##1##2{\if##10\else\o@left##2\o@right.\fi}% \def\delim@r##1##2{\if##10\else\o@left##2\o@right.\fi}% \def\delim@m##1##2{\if##10\else\o@left##2\o@right.\fi}% } \defaultdelims@ % % D i s p l a y d e l i m i t e r s % % Displayed material is put into box registers numbered by \ddelim@count % starting from \firstddelim@no. All they are hboxes. % Token registers with the same numbers contain material whose typesetting % is postponed. They may be: % (i) extensible tokens (left and middle; e.g., delimiters). % Typesetting of extensibles is postponed until their size is % known (after the same level right delimiter is found); % (ii) escape tokens = interspersed macros (such as \wall, \return, etc.). % Typesetting postponed until all box registers are ejected. \newcount\ddelim@count % \firstddelim@no is set by \setfirstddelim@no to the first unused % box and toks register pair. % Every \displaydelims@ calls \setfirstddelim@no. \def\setfirstddelim@no{% \edef\firstddelim@no{\the\count14 }% unused box register \ifnum\firstddelim@no<\the\count15 % \edef\firstddelim@no{\the\count15 }% unused toks register \fi} % The commands to fill the hboxes are \startddelimbox@ and \finishddelimbox@. \def\startddelimbox@{\hbox\bgroup\o@math \ifnum\ddelim@count<\insc@unt % if less than the insertion count \else \n@err{Formula too large}% {No free box to store the next chunk of displayed material. ^^JThe rest of the formula will be ignored. ^^JDivide big formulas into small parts.}% \o@math\egroup \fi \dcurrstyle@ \mathopen{} } \def\finishddelimbox@{\mathclose{} \o@math\egroup} % To distinguish between extensibles and escape tokens, they start with % control sequence \ext@tok and \esc@tok, respectively. % The nth token register may be tested by % % \if\ext@tok\first@tok{n} yes \else no \fi % % etc. \def\ext@tok{1} \def\esc@tok{2} \def\@car#1#2\@nil{#1} % LaTeX's definition \def\@cdr#1#2\@nil{#2} % LaTeX's definition \def\@cadr#1#2#3\@nil{#2} \def\first@tok#1{\expandafter\@car\the\toks#1\relax \noexpand\@nil} \def\second@tok#1{\expandafter\@cadr\the\toks#1\relax \noexpand\@nil} \def\tail@toks#1{\expandafter\@cdr\the\toks#1\relax \noexpand\@nil} \def\first@token#1{\expandafter\@car#1\relax \noexpand\@nil} \def\second@token#1{\expandafter\@cadr#1\relax \noexpand\@nil} \def\tail@tokens#1{\expandafter\@cdr#1\relax \noexpand\@nil} % \displaydelims@ is called by \displayon@ to start display mode of % delimiters, which includes defining \delim@l, \delim@r and % \delim@m within displayed formulas and starting the first delimbox. \def\displaydelims@{\global\setbox\sizebox@\delimstrut@ \displaydefs@ \setfirstddelim@no \ddelim@count=\firstddelim@no % the first dbox has this number \ddelimlevel@=0 % \def\f@stack{\relax}% initiating \f@stack \def\ht@stack{\relax}% initiating \ht@stack \def\dp@stack{\relax}% initiating \dp@stack \toks\number\ddelim@count={\ext@tok 0x}% void extensible token \put@{\number\ddelim@count}\f@stack % store the number of the starting box \setbox\number\ddelim@count\startddelimbox@ % now inside ddelimbox } \def\displaydefs@{% \let\delim@l=\ddelim@l \let\delim@m=\ddelim@m \let\delim@r=\ddelim@r} \def\ddelim@l#1#2{\mathopen{} \finishddelimbox@ % now outside ddelimbox \put@{\the\ht\sizebox}\ht@stack % save height of sizebox \put@{\the\dp\sizebox}\dp@stack % save depth of sizebox \setbox\sizebox\delimstrut@% set minimal size of delimiters \advance\ddelimlevel@ by 1 \advance\ddelim@count by 1 % left delimiter -> extensible token: \toks\number\ddelim@count={\ext@tok#1#2}% \put@{\number\ddelim@count}\f@stack % store the number of the starting box \setbox\number\ddelim@count\startddelimbox@ % now inside ddelimbox } \def\ddelim@m#1#2{% \ifnum\ddelimlevel@>-1 \finishddelimbox@ % now outside ddelimbox \advance\ddelim@count by 1 % middle delimiter -> extensible token: \toks\number\ddelim@count={\ext@tok#1#2}% \setbox\number\ddelim@count\startddelimbox@ % now inside ddelimbox \else \mdelim@error#2% \fi} \def\ddelim@r#1#2{\ifnum\ddelimlevel@<1 \rdelim@error \fi \finishddelimbox@ % now outside ddelimbox \advance\ddelimlevel@ by -1 \ifnum\ddelimlevel@>-1 % if not error \unite@dboxes#1#2% unite box registers on this delimlevel; % append #1 times #2 \fi \setbox0\copy\sizebox % save the sizebox in box0, then let it grow: \sizebox@grow \advance\ddelim@count by 1 % empty delimiter -> extensible token: \toks\number\ddelim@count={\ext@tok 0.}% emptying toks ddelim@count \setbox\number\ddelim@count\startddelimbox@ % now inside ddelimbox % eject the sizebox as stored in box0 -- for placement of sub- and % superscripts: \box0} \def\checkleftdelims@{\ifnum\ddelimlevel@>0 \ldelim@error{\ddelimlevel@}\fi} \def\enddisplaydelims@{\checkleftdelims@ \finishddelimbox@ % now outside ddelimbox \unite@dboxes 0.% unite all box registers \eject@dboxes } % Called by \delim@r, the command \unite@dboxes runs through box registers % between \f@ddelim and the current value of \ddelim@count. Collapsed % into a single hbox is every contiguous interval of hboxes, interspersed % with extensible elements that were stored in token registers and in #1, % adjusted to the size of the current \ddelimstrutbox. % Two global counts are needed: \newcount\ddcount@ % to count boxes to be collapsed; global \newcount\ddcount@@ % to count boxes to gather the former; local \def\unite@dboxes#1#2{% now outside ddelimbox; #1#2 = the right delimiter \get@\f@ddelim\f@stack \global\ddcount@=\f@ddelim % set ddcount@ to starting position \ddcount@@=\f@ddelim % set ddcount@@ to starting position \advance\ddelim@count 1 % starting box number ddcount@@ \setbox\number\ddcount@@\hbox\bgroup % now inside ddelimbox \g@loop\ifnum\ddcount@<\ddelim@count \if\ext@tok\first@tok{\number\ddcount@}\relax % if extensible element \if0\second@tok{\number\ddcount@}\relax % if `0' then do nothing \else % else eject the resized extensible \expandafter\size@\the\toks\number\ddcount@\relax \fi \unhbox\number\ddcount@ % unbox the box \else \if\esc@tok\first@tok{\number\ddcount@}\relax % else if escape element \egroup % finishing box number ddcount@@; now outside ddelimbox \advance\ddcount@@ by 1 % moving toks ddcount@ to toks ddcount@@ -- if unequal \ifnum\ddcount@=\ddcount@@ \else \toks\number\ddcount@@=\expandafter{\the\toks\number\ddcount@}% \toks\number\ddcount@={\ext@tok 0.}% emptying toks ddcount@ \fi % starting box ddcount@@: \setbox\number\ddcount@@\hbox\bgroup % now inside ddelimbox \unhbox\number\ddcount@ \else \n@err{Unexpected contents in toks \number\ddcount@}{Shocked? Me too.}% \fi \fi \global\advance\ddcount@ by 1 \repeat \size@ \ext@tok#1#2 \delimtype@right\relax % resized right delimiter \egroup % now outside ddelimbox \toks\f@ddelim={\ext@tok 0.}% emptying toks f@ddelim \ddelim@count=\ddcount@@} % % D e l i m i t e r g r o w t h % \newdimen\delimincrement@ \newcount\delimgrowth@ \def\delimgrowth{\afterassignment\delimgrowth@@\delimgrowth@} \def\delimgrowth@@{\ifnum\delimgrowth@<1 \delimgrowth@=1 \n@warning{\string\delimgrowth\space must be a positive natural number}% \fi \delimincrement@=.66ex \divide\delimincrement@ by \delimgrowth@} \def\sizebox@grow{\@tempdima=\ht\sizebox \advance\@tempdima\delimincrement@ %\relax \ht\sizebox=\@tempdima \@tempdima=\dp\sizebox \advance\@tempdima\delimincrement@ %\relax \dp\sizebox=\@tempdima \get@\@tempa\ht@stack \ifdim\the\ht\sizebox<\@tempa \ht\sizebox=\@tempa\fi \get@\@tempa\dp@stack \ifdim\the\dp\sizebox<\@tempa \dp\sizebox=\@tempa\fi } % Called by the last \delim@r, the command \eject@dboxes ejects all the % box and token registers filled. Uses the global count \ddcount@ \newcount\ddcount@ % global \def\eject@dboxes{\global\ddcount@=\firstddelim@no{}% \box\number\ddcount@ \g@loop\ifnum\ddcount@<\ddelim@count \global\advance\ddcount@ by 1 \if\ext@tok\first@tok{\number\ddcount@}\relax \n@err{Forgotten extensible \number\ddcount@\space}% {An internal error, induced by the previous errors. ^^JSomething will be lost.} \else \if\esc@tok\first@tok{\number\ddcount@}\relax \tail@toks{\number\ddcount@}\relax \else\n@err{Unable to eject \number\ddcount@}% {Sorry, the box or toks have never been filled. ^^JIs an internal error and should never happen.}% \fi \fi \box\number\ddcount@ \repeat} % % S i z i n g d e l i m i t e r s % % The following commands are called by \unite@dboxes. % Parameters: % % #1 = always \ext@tok, hence ignored % if #2 = ":" then sizable fraction % #3 = numerator and #4 = denominator % otherwise % #2 = number of repetitions (from 0 to 9), % #3 = a delimiter % #4 = a type (\delimtype@right or \relax) \def\size@#1#2#3#4{% \if:#2\relax % if a numeric fraction \o@math\size@frac{#3}{#4}\relax\o@math \else % else a delimiter \if0#2\relax % zero repetitions -- do nothing \else \ifx#4\delimtype@right % if right delimiter, set sizebox \setbox0\hbox{\o@math \extend@delim#2#3\sizebox\o@math}% %%% \ht\sizebox=\ht0 \dp\sizebox=\dp0 % \box0 % \else \o@math \extend@delim#2#3\sizebox \o@math \fi \fi \fi} % % E x t e n d i n g d e l i m i t e r s % % Not all expressions have their height equal to depth. So we put % the expression in a vcenter, create delimiters that match the vcenter, % and then shift the delimiter vertically the appropriate amount. % A surprise was that [ sometimes acquired bigger size than (. % So I had to modify the procedure: first extend [, then (. % The three arguments to \extend@delim are: % #1 = the number of repetitions % #2 = a delimiter % #3 = a box register of zero width, or -1 to indicate base size % Setting values of \delimiterfactor and \delimitershortfall such that % \delimfactor works well: \delimiterfactor=920 \delimitershortfall=3pt % Not all expressions have their height equal to depth. So we put % the expression in a vcenter, create delimiters that match the vcenter, % and then shift the delimiter vertically the appropriate amount. % A surprise was that [ sometimes acquired bigger size than (. % So I had to modify the procedure: first extend [, then (. % The three arguments to \extend@delim are: % #1 = the number of repetitions % #2 = a delimiter % #3 = a box register of zero width, or -1 to indicate base size \def\extend@delim#1#2#3{% \ifnum#1<1 % do absolutely nothing \else\begingroup % do box0 = extended delimiter \nulldelimiterspace=0pt \ifnum#3<0 % if #3 not a box register \setbox0\hbox{\o@math\icurrstyle@\o@left#2\o@right.\o@math}% \@tempdima=0pt \else % if #3 = box register \setbox\@tempboxa\hbox{\o@math\vcenter{\copy#3}\o@math}% \@tempdima=\ht\@tempboxa %\hbox{\the\@tempdima/\the\dp\@tempboxa}% \ifdim\@tempdima>3\mex \checkangle@{#2}% \ifresult@\n@warning{angle brackets do not grow that size}\fi \fi \advance\@tempdima -\ht#3 \setbigstrutbox@ \setbox0\hbox{\o@math\icurrstyle@\o@left#2 \ifdim\ht\@tempboxa>.86\ht\bigstrut@box \vrule height \ht\bigstrut@box width 0pt \fi \ifdim\dp\@tempboxa>.86\dp\bigstrut@box \vrule depth \dp\bigstrut@box width 0pt \fi \box\@tempboxa\o@right.\o@math}% \fi % now copy box0 #1 times \count@=1 \loop\ifnum\count@<#1 \lower\@tempdima\copy0 \hskip -.75\wd0 \hskip .25\mex \advance\count@ 1 \repeat \lower\@tempdima\box0 \endgroup \fi} % Check for an angle bracket \def\checkangle@#1{\def\@tempa{#1} \def\@tempb{\o@langle} \ifx\@tempa\@tempb\result@true \else \def\@tempb{\o@rangle} \ifx\@tempa\@tempb\result@true \else \result@false \fi\fi} % % E s c a p e c o m m a n d s % % Escape commands are ones that, if not stored, would interfere with the % display mode. \def\wall@cr{\checkpunct@ \ifpunct@ \global\punct@false \ifnum\ddelimlevel@>0 % elements of a list \store@ec{\d@cr{\pad@}}{}% padded \mathopen{} % new expression \else % separate equations \store@ec{\d@cr{\relax}}{}% unpadded \mathopen{} % new expression \fi \else % broken formula \store@ec{\d@cr{\pad@}}{}% padded \mkern-\thickmuskip \mathinner{} % continuing expression \fi} \def\curr@cr@is@wall@cr{\def\curr@cr{\wall@cr}\let\\\curr@cr} \def\wall{\mathrel{} \ifwallallowed@ \ifdisplay@ \store@ec{\d@wall{0}}{\let\\\wall@cr}% \else \n@warning{Non-display. I am ignoring the misplaced \string\wall}% \fi \else \n@err{Misplaced \string\wall}{\wall is disallowed here}% \fi \mathopen{} } \def\return{\checkpunct@ \ifdisplay@ \store@ec{\d@return}{\let\\\curr@cr} \else \n@warning{Non-display. I am ignoring the misplaced \string\return}% \fi \ifpunct@ \global\punct@false \mathopen{} \else \mkern-\thickmuskip \mathinner{} \fi } % \padded is another form of \wall. % \padded{A} prefixes each line except the first with A. % Typically A is a void box or a kern. % Nested \padded have cummulative effect. \def\padded#1{% \ifwallallowed@ \ifdisplay@ \store@ec{\d@wall{1#1}}{\let\\\wall@cr}% \else \n@warning{Non-display. I am ignoring the misplaced \string\padded}% \fi \else \n@err{Misplaced \string\padded}{\padded is disallowed here}% \fi \mathopen{} } \def\pad@{} % \store@ec is the generic command to store an escape command #1 in token % registers. It also performs #2 while outside ddelimbox. \def\store@ec#1#2{\finishddelimbox@ % now outside ddelimbox \advance\ddelim@count 1 \toks\number\ddelim@count={\esc@tok#1}% #1 -> escape token #2% keep % here \setbox\number\ddelim@count\startddelimbox@ % now inside ddelimbox } % % I n l i n e d e l i m i t e r s % \newcount\big@ \big@=0 \newcount\big@@ \big@@=0 \newbox\bigstrut@box \mathchardef\biglbracket@="0302 %% \biglbracket@ is of fixed size in LaTeX !! \def\setbigstrutbox@{\setbox\bigstrut@box \hbox{\o@math\vcenter{\hbox{\o@math\icurrstyle@ \mathchar\biglbracket@\o@math}}\o@math} \setbox\bigstrut@box\hbox{\vrule height\prorated@\ht\bigstrut@box depth\prorated@\dp\bigstrut@box width 0pt} } \pdef\big{\advance\big@ 1\relax} \pdef\bigg{\advance\big@ 2\relax} \pdef\biggg{\advance\big@ 3\relax} \def\bigl{\big\left} \def\biggl{\bigg\left} \let\bigm=\middle \let\biggm=\middle \let\bigr=\right \let\biggr=\right % inline mode \def\inlinedelims@{% \idelimlevel@=0\relax \big@=0\relax \big@@=0\relax \let\delim@l=\idelim@l \let\delim@m=\idelim@m \let\delim@r=\idelim@r } \def\idelim@l#1#2{\mathopen{} \nodisplay@true \advance\idelimlevel@ by 1 \ifnum\big@>0 \advance\big@@\big@ \ifnum\idelimlevel@>\big@@ \n@err{Misplaced \string\big} {Too late for \big -- a big must not occur inside a non-big} \fi \ifnum\idelimlevel@<1 \n@err{Misplaced \string\big} {\big must not occur on negative level of fencing.} \fi \fi \big@=0 \ifnum\idelimlevel@>\big@@ \extend@delim#1#2{-1} % normal size \else \ifnum\idelimlevel@<1 \extend@delim#1#2{-1} % normal size \else \setbigstrutbox@ \extend@delim#1#2\bigstrut@box \fi \fi \mathopen{}} \def\idelim@m#1#2{\mathclose{} \nodisplay@true \big@=0 \ifnum\idelimlevel@>\big@@ \extend@delim#1#2{-1} % normal size \else \ifnum\idelimlevel@<1 \extend@delim#1#2{-1} % normal size \else \setbigstrutbox@ \extend@delim#1#2\bigstrut@box \fi \fi \mathopen{}} \def\idelim@r#1#2{\mathclose{} \big@=0 \ifnum\idelimlevel@>\big@@ \extend@delim#1#2{-1} % normal size \else \ifnum\idelimlevel@<1 \extend@delim#1#2{-1} % normal size \else \setbigstrutbox@ \extend@delim#1#2\bigstrut@box \advance\big@@ -1 \fi \fi \advance\idelimlevel@ by -1 \mathclose{}} % % A u x i l i a r y p r o c e d u r e s % \def\replacebindelims@#1#2{\begingroup \idelimlevel@=0\relax \def\delim@l##1##2{#2\advance\idelimlevel@ by 1 \setbox0\hbox\bgroup\o@math}% \def\delim@r##1##2{\mathclose{}\advance\idelimlevel@ by -1 \o@math\egroup}% \def\delim@m##1##2{}% \def\inlineopen@{#2\advance\idelimlevel@ by 1 \setbox0\hbox\bgroup\o@math}% \def\inlineclose@{\mathclose{}\advance\idelimlevel@ by -1 \o@math\egroup}% #1 \endgroup} % % S u b s c r i p t s a n d s u p e r s c r i p t s % \let\o@sp^ \let\o@sb_ % (MathTime macros destroy plain TeX's \sp,\sb) \catcode`\^=13 \catcode`\_=13 \pdef_#1{\o@sb{\display@false\advance\mathcount@ 1 \inline{#1}}} \pdef^#1{\o@sp{\display@false\advance\mathcount@ 1 \inline{#1}}} \catcode`\^=12 \catcode`\_=12 % % P a r s i n g o f s u b - a n d s u p e r s c r i p t s % % The comand \parse@ detects whether sub- or superscripts follow. % If yes, then \sb@true or \sp@true is set and the arguments % are stored in \sb@toks or \sp@toks, respectively. % Then \afterparse@ is executed. \newtoks\sp@toks \newtoks\sb@toks \newif\ifsb@ \newif\ifsp@ \def\parse@{\sb@false\sp@false \def\next@comm{\afterassignment\parse@@\let\next=} \next@comm} \def\parse@@{% \ifx\next_ \ifsb@\n@err{Double subscript}{The notation x_y_z is ambiguous.} \else\sb@true \fi \def\next@comm{\sb@@} \else \ifx\next^ \ifsp@\n@err{Double superscript}{The notation x^y^z is ambiguous.} \else\sp@true \fi \def\next@comm{\sp@@} \else \def\next@comm{\afterparse@} \fi \fi \next@comm} \def\sp@@#1{\sp@toks={#1} \afterassignment\parse@@\let\next=} \def\sb@@#1{\sb@toks={#1} \afterassignment\parse@@\let\next=} \def\parse@next{\parse@\next} % % O p e r a t o r s % % \mathop is redefined to stop misinterpretation of following Bins % as unary operators (cf. TeXbook, p. 170). \let\o@mathop\mathop % The following definition determines spacing between Op and Bin. % (According to [TeXBook, p. 170], ``such case never arises, % so plain TeX leaves it undefined, making the Bin into unary.'') \newif\iflimits@ \limits@true \pdef\mathop#1{% \ifnum\mathcount@>0 % in sub- and superscripts \def\next@comm{\o@mathop{#1}} % just @mathop \else \def\mathop@arg{#1} \def\afterparse@{\mathop@@} \sb@false\sp@false \ifdisplay@\limits@true\else\limits@false\fi \def\next@comm{\afterassignment\mathop@\let\next=} \fi \next@comm} \def\mathop@{\def\next@comm{\parse@next} \ifx\next\limits \ifdisplay@ \limits@true \else \iflimits@ \else \n@warning{Ignoring inline \string\limits}\fi \fi \def\next@comm{\parse@} \else \ifx\next\nolimits \limits@false \def\next@comm{\parse@}\fi \fi \next@comm} \def\mathop@@{\mathoptest@ % sets \ifresult@ true if a left delimiter follows \ifresult@ \iflimits@ \o@mathop{\mathop@arg}\mathop@@@l \else \o@mathop{\mathop@arg}\nolimits\mathop@@@ \fi \else \iflimits@ \mathinner{\o@mathop{\mathop@arg}\mathop@@@l} \else \mathinner{\mathop@arg}\mathop@@@ \fi \fi \next} \catcode`\^=13 \catcode`\_=13 \def\mathop@@@{% \ifsp@ ^{\hbox{\edef\@tempa{\noexpand\imath@{\the\sp@toks}}% \def\\{,\ }\@tempa}} \fi \ifsb@ _{\hbox{\edef\@tempa{\noexpand\imath@{\the\sb@toks}}% \def\\{,\ }\@tempa}} \fi} \def\mathop@@@l{\limits \ifsp@ ^{\lmathop@@@l@{\the\sp@toks}} \fi \ifsb@ _{\lmathop@@@l@{\the\sb@toks}} \fi} \def\lmathop@@@l@#1{\vbox{\let\\=\crcr \baselineskip=0pt \lineskip=2pt \edef\@tempa{\vbox{\noexpand\ialign{% \hfil\noexpand\imath@{####}\hfil\crcr #1 \crcr}}} \@tempa}} \catcode`\^=12 \catcode`\_=12 \catcode`\(=13 \catcode`\[=13 \catcode`\<=13 \newif\iftesting@ \testing@false \def\mathoptest@{% \iftesting@ \result@true \else \result@false \ifx\next\ch@lparenthesis\result@true \else \ifx\next\ch@lbrack\result@true \else \ifx\next<\result@true \else \ifx\next\{\result@true \else \ifx\next\left\result@true \else \ifx\next\langle\result@true \else \ifx\next\lfloor\result@true \else \ifx\next\lceil\result@true \else \ifx\next\mathopen\result@true \fi\fi\fi\fi\fi\fi\fi\fi\fi \fi} % \lvert and \lVert are intentionally omitted \catcode`\(=12 \catcode`\[=12 \catcode`\<=12 % % A b b r e v i a t i o n s % \newcount\abbrevlength@ \pdef\abbreviation{\def\abbrev@@{}\abbrevlength@=0 \def\abbrev@@@{\afterassignment\abbrev@\let\abbrev@next= }% \result@false\abbrev@@@} \long\def\abbrev@{% \ifx`\abbrev@next \result@false \else \edef\next{\meaning\abbrev@next} \expandafter\letter@test\next\endletter@test \fi \ifresult@ \edef\abbrev@@{\abbrev@@\theletter@} \advance\abbrevlength@ 1\relax \else \ifnum\abbrevlength@>1 \ifnum\mathcount@>0 \o@mathop\bgroup \else \mathinner\bgroup \fi \else\bgroup \fi {\rm \abbrev@@\kern 0pt} \def\abbrev@@@{\egroup\result@false \mathclose{}\mathopen{}\mathop{}\nolimits\abbrev@next} \fi \abbrev@@@} \def\letter@test #1#2#3#4#5\endletter@test{ \if l#4\result@true\letter@test@#5 \else\result@false\fi} \def\letter@test@#1#2#3#4#5#6{\def\theletter@{#6}} % % S p e c i a l s y m b o l s % % Inequalities %\let\leq=\le \let\geq=\ge %\let\leqq=\le \let\geqq=\ge % factorial \def\factorial{\mc@factorial\mathopen{}\mathinner{}} % vingl \pdef\vin{\mathrel{\hbox{\hglue .1\mex \vrule \@height .06\mex \@width 1\mex \vrule \@height 1.33\mex \@width .06\mex \hglue .4\mex}}} \pdef\niv{\mathrel{\hbox{\hglue .2\mex \vrule \@height 1.33\mex \@width .06\mex \vrule \@height .06\mex \@width 1\mex \hglue .5\mex}}} \def\stackrel#1#2{\mathrel{\limits@true\mathop{#2}\limits^{\rm #1}}} %%%%%%%%%% \makerobust\stackrel % % E x p a n d a b l e b a r s a n d a r r o w s % % Save even if not needed \let\o@overline=\overline \let\o@underline=\underline \newdimen\er@wd \def\er@sep{.06ex} \def\er@gap{.33\mex} \def\er@short{.6\mex} \def\er@rulewd{.05ex} \def\er@minwd{.6\mex} \def\er@kerna{.15\mex} \def\er@kernb{.15\mex} \def\overline#1{\setmathtype@{#1}% {\o@er@{#1}{\leaders\hrule \@height\er@rulewd \hfill}} } \def\underline#1{\setmathtype@{#1}% {\u@er@{#1}{\leaders\hrule \@height\er@rulewd \hfill}} } \def\overrightarrow#1{\setmathtype@{#1}% {\o@er@{#1}{\o@math\iscriptstyle@ \longrightarrowfill\o@math}} } \def\underrightarrow#1{\setmathtype@{#1}% {\u@er@{#1}{\o@math\iscriptstyle@ \longrightarrowfill\o@math}} } \def\overleftarrow#1{\setmathtype@{#1}% {\o@er@{#1}{\o@math\iscriptstyle@ \longleftarrowfill\o@math}} } \def\underleftarrow#1{\setmathtype@{#1}% {\u@er@{#1}{\o@math\iscriptstyle@ \longleftarrowfill\o@math}} } \def\overleftrightarrow#1{\setmathtype@{#1}% {\o@er@{#1}{\o@math\iscriptstyle@ \longleftrightarrowfill\o@math}} } \def\underleftrightarrow#1{\setmathtype@{#1}% {\u@er@{#1}{\o@math\iscriptstyle@ \longleftrightarrowfill\o@math}} } % Inside \pdef\o@er@#1#2{\inlineopen@ \begingroup \setbox0\currstyle@hbox{\toprestricted@true #1} \er@wd=\wd0 \advance\er@wd-\er@short \ifdim \er@wd<\er@minwd \er@wd=\er@minwd \fi \kern\er@kerna \hbox to\wd0{\hss \vbox{\offinterlineskip \vglue\er@sep \hbox to\er@wd{#2}% \vskip\er@gap \hbox to\er@wd{\hss\box0\hss}}% \hss} \kern\er@kernb \endgroup \inlineclose@} \pdef\u@er@#1#2{\inlineopen@ \begingroup \setbox0\currstyle@hbox{\botrestricted@true #1} \er@wd=\wd0 \advance\er@wd -\er@short \ifdim \er@wd<\er@minwd \er@wd=\er@minwd \fi \kern\er@kerna \hbox to\wd0{\hss \vtop{\offinterlineskip \hbox to\er@wd{\hss\box0\hss} \vskip\er@gap \hbox to\er@wd{#2}% \vglue\er@sep}% \hss} \kern\er@kernb \endgroup \inlineclose@} \def\longrightarrowfill{\axis@@@\hfill\mskip-6mu\rightarrow} \def\longleftarrowfill{\leftarrow\mskip-6mu\axis@@@\hfill} \def\longleftrightarrowfill{\leftarrow\mskip-6mu \axis@@@\hfill\mskip-6mu\rightarrow} % Setting math type \def\setmathtype@#1#2{ \setbox0\hbox{\o@math \setmathtype@@@000 x#1x\o@math} \@tempdima=\wd0 \setbox0\hbox{\o@math \setmathtype@@@100 x#1x\o@math} \ifdim\wd0>\@tempdima \o@mathop{#2} \else \setbox0\hbox{\o@math \setmathtype@@@010 x#1x\o@math} \ifdim\wd0>\@tempdima \mathrel{#2} \else \setbox0\hbox{\o@math \setmathtype@@@001 x#1x\o@math} \ifdim\wd0>\@tempdima \mathbin{#2} \else \mathord{#2} \fi \fi \fi} \def\setmathtype@@@#1#2#3{\thinmuskip=#1mu \thickmuskip=#2mu \medmuskip=#3mu \relax} % % M u l t i p l e a n d e x t e n s i b l e a c c e n t s % % Extensible accents: \let\o@hat=\hat \let\o@widehat=\widehat \let\o@tilde=\tilde \let\o@widetilde=\widetilde \let\o@bar=\bar \def\widebar#1{\ifdim\wd0<\prorated@ em \mathaccent"07B {#1} \else \mathaccent"07C {#1} \fi} % Limits of extensibility: % % narrow accent % threshold = \widethr@ % wide accent % threshold = \wrapthr@ % attached accent \def\widethr@{1.6ex} \def\wrapthr@{5.8\mex} % Non-extensible accents \let\o@dot=\dot \let\o@ddot=\ddot \let\o@breve=\breve \let\o@check=\check \def\uo{\mathaccent"017 } % Multiple accents \newtoks\acc@toks % toks to store a sequence of accents in reverse order \newif\ifextacc@ \pdef\hat{\acc@toks={\H@} \extacc@true \acc@@} \pdef\tilde{\acc@toks={\T@} \extacc@true \acc@@} \pdef\bar{\acc@toks={\B@} \extacc@true \acc@@} \pdef\dot{\acc@toks={\D@} \extacc@false \acc@@} \pdef\ddot{\acc@toks={\DD@} \extacc@false \acc@@} \pdef\breve{\acc@toks={\BR@} \extacc@false \acc@@} \pdef\check{\acc@toks={\CH@} \extacc@false \acc@@} % Defaults are printable (for debugging purposes) \def\H@{H} \def\T@{T} \def\B@{B} \def\D@{D} \def\DD@{DD} \def\BR@{BR} \def\CH@{CH} % See TeXbook p. 374 for the trick with \expandafter: \def\acc@@#1{\def\next@comm{\acc@@} \def\@tempa{#1} \def\@tempb{\hat} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \H@\the\acc@toks} \else \def\@tempb{\tilde} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \T@\the\acc@toks} \else \def\@tempb{\bar} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \B@\the\acc@toks} \else \def\@tempb{\dot} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \D@\the\acc@toks} \extacc@false \else \def\@tempb{\ddot} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \DD@\the\acc@toks} \extacc@false \else \def\@tempb{\breve} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \BR@\the\acc@toks} \extacc@false \else \def\@tempb{\check} \ifx \@tempa\@tempb \acc@toks=\expandafter{\expandafter \CH@\the\acc@toks} \extacc@false \else \def\next@comm{\acc@@@{#1}} \fi \fi \fi \fi \fi \fi \fi \next@comm} \def\acc@@@#1{ \inlineopen@ \setbox0\currstyle@hbox{#1} \ifdim\wd0>\wrapthr@ % long \wrap@@@acc{#1} \else \checkcompound@{#1}% #1=accented material \ifcompound@ % not a single character \ifextacc@ \ifdim\wd0>\widethr@ \wide@@@acc{#1} \else \@@@acc{#1} \fi \acc@kern \else \wrap@@@acc{#1} \fi \else % single character \ifdim\wd0>\widethr@ \wide@@@acc{#1} \else \@@@acc{#1} \fi \acc@kern \fi \fi \inlineclose@} \def\acc@kern {\mkern1.2mu } % Checking if single character \newif\ifcompound@ \def\checkcompound@#1{\compound@false \edef\fdxxii@textfontii{\the\fontdimen22\textfont2}% \fontdimen22\textfont2=300pc \setbox\@tempboxa\hbox{\o@math\defaultdelims@ \def\frac{xx\@gobbletwo} #1\o@math} \@tempdima=\ht\@tempboxa \setbox\@tempboxa\hbox{\o@math\defaultdelims@ \def\frac{xx\@gobbletwo} \o@mathop{#1}\o@math} \ifdim\ht\@tempboxa=\@tempdima \compound@true \fi \fontdimen22\textfont2=\fdxxii@textfontii } % Attaching accents to #1, putting parentheses around if necessary. \def\wrap@@@acc#1{ \setbox\@tempboxa\currstyle@hbox{\nodisplay@false \replacebindelims@{#1}{x}} \ifdim\wd\@tempboxa>2\mex \ifdisplay@ \currstyle@hbox{(#1)} \else (\inline{#1}) \fi \samesize@^{\wrap@@@acc@} \else \ifdisplay@ \currstyle@hbox{#1} \else \inline{#1} \fi \samesize@^{\wrap@@@acc@} \fi } \def\wrap@@@acc@{\begingroup \def\H@{\land} \def\T@{\sim} \def\B@{-} \def\D@{\raise.5\mex\hbox{\bf.}} \def\DD@{\raise.5\mex\hbox{\bf..}} \def\BR@{\smile} \def\CH@{\lor} \the\acc@toks \endgroup} % Stacked accents \newdimen\xheight@ \def\acc@def#1#2#3#4{\def#1{\fontdimen5 #4=\@tempdima \ifcompound@ % if compound \rlap{\o@math#2{\currstyle@hbox{#3}}\o@math} \else % if single character \rlap{\currstyle@hbox{#2{#3}}} \fi \advance\@tempdima\@tempdimb}} \def\xacc@def#1#2#3#4{\def#1{\begingroup \advance\@tempdima 1.5\@tempdimb \fontdimen5 #4=\@tempdima \ifcompound@ % if compound \rlap{\o@math#2{\currstyle@hbox{#3}}\o@math} \else \rlap{\currstyle@hbox{#2{#3}}} \fi \endgroup \fontdimen5 #4=\xxheight@ \advance\@tempdima\@tempdimb}} \def\wide@@@acc#1{% uses fontdimens \ifcase\mathcount@ \def\acc@font{\textfont3 } \def\xacc@font{\textfont0 } \or \def\acc@font{\scriptfont3 } \def\xacc@font{\scriptfont0 } \else \def\acc@font{\scriptscriptfont3 } \def\xacc@font{\scriptscriptfont0 } \fi \edef\xheight@{\the\fontdimen5\acc@font}% \edef\xxheight@{\the\fontdimen5\xacc@font}% \@tempdima=\xheight@ \@tempdimb=-.55\@tempdima \acc@def{\H@}{\o@widehat}{#1}\acc@font \acc@def{\T@}{\o@widetilde}{#1}\acc@font \xacc@def{\B@}{\widebar}{#1}\xacc@font \acc@def{\D@}{\o@dot}{#1}\xacc@font \acc@def{\DD@}{\o@ddot}{#1}\xacc@font \acc@def{\BR@}{\o@breve}{#1}\xacc@font \acc@def{\CH@}{\o@check}{#1}\xacc@font \the\acc@toks \currstyle@hbox{#1} \fontdimen5\acc@font=\xheight@ \fontdimen5\xacc@font=\xxheight@ } \def\@@@acc#1{% uses fontdimens! \ifcase\mathcount@ \def\acc@font{\textfont0 } \or \def\acc@font{\scriptfont0 } \else \def\acc@font{\scriptscriptfont0 } \fi \edef\xheight@{\the\fontdimen5\acc@font}% \@tempdima=\xheight@ \@tempdimb=-.55\@tempdima \acc@def{\H@}{\o@hat}{#1}\acc@font \acc@def{\T@}{\o@tilde}{#1}\acc@font \acc@def{\B@}{\o@bar}{#1}\acc@font \acc@def{\D@}{\o@dot}{#1}\acc@font \acc@def{\DD@}{\o@ddot}{#1}\acc@font \acc@def{\BR@}{\o@breve}{#1}\acc@font \acc@def{\CH@}{\o@check}{#1}\acc@font \the\acc@toks \currstyle@hbox{#1} \fontdimen5\acc@font=\xheight@ } \let\inlineopen@\relax \let\inlineclose@\relax % % E x p a n d a b l e h o r i z o n t a l a r r o w s % \def\longrightarrow@#1#2{\mathrel{\mathopen-\axis@@ \axis@{#1}{#2} \axis@@\mathclose\rightarrow}} \def\longleftarrow@#1#2{\mathrel{\mathopen\leftarrow\axis@@ \axis@{#1}{#2} \axis@@\mathclose-}} \def\longleftrightarrow@#1#2{\mathrel{\mathopen\leftarrow\axis@@ \axis@{#1}{#2} \axis@@\mathclose\rightarrow}} \pdef\to{\def\afterparse@{ \longrightarrow@{\ifsp@\sp@toks@\fi}{\ifsb@\sb@toks@\fi}\next} \sb@false\sp@false \def\next@comm{\afterassignment\parse@next\let\next=} \next@comm} \pdef\ot{\def\afterparse@{ \longleftarrow@{\ifsp@\sp@toks@\fi}{\ifsb@\sb@toks@\fi}\next} \sb@false\sp@false \def\next@comm{\afterassignment\parse@next\let\next=} \next@comm} \pdef\otto{\def\afterparse@{ \longleftrightarrow@{\ifsp@\sp@toks@\fi}{\ifsb@\sb@toks@\fi}\next} \sb@false\sp@false \def\next@comm{\afterassignment\parse@next\let\next=} \next@comm} \pdef\mapsto{\mathrel{\mapstochar}\nobreak\mathclose{}\mathopen{}\to} % \nobreak inserted thanks to E.H. Lohse \def\sp@toks@{\edef\@tempa{\noexpand\noexpand\noexpand\inline{\the\sp@toks}} \@tempa} \def\sb@toks@{\edef\@tempa{\noexpand\noexpand\noexpand\inline{\the\sb@toks}} \@tempa} \def\axis@#1#2{\setbox0\scriptstylehbox@{\protectinline@true #1} \er@wd=\wd0 \setbox\@tempboxa\scriptstylehbox@{\protectinline@true #2} \ifdim\wd\@tempboxa>\er@wd \er@wd=\wd\@tempboxa\fi \@tempdima=\ht\@tempboxa \advance\@tempdima\dp\@tempboxa \advance\@tempdima-.42\mex \vtop{\offinterlineskip \hbox{\vbox{\hbox to\er@wd{\hss\box0\hss}% \vskip -.26\mex \hbox to\er@wd{\axis@@@\hfill}}} \vskip -.26\mex \hbox to\er@wd{\hss\box\@tempboxa\hss}} } \def\axis@@{\mkern-4.5mu %%% mkern setting adjusted 24 Sept. 2002 \axis@@@\mskip 3mu plus \arrow@expandability mu %%% thanks to E.H. Lohse \mkern-4.5mu} \def\axis@@@{% \cleaders\hbox{\o@math\mkern-3mu \icurrstyle@\mathord- \mkern-3mu\o@math}} \def\arrow@expandability{1.2} % % R o o t s % \def\o@sqrt{\radical"270370 } \pdef\sqrt#1{\inlineopen@\kern.4\mex\root@{}{#1}\inlineclose@} % \def changed to \pdef on 25 Sept. 2002 thanks to Michal Malek \pdef\root#1#2{\inlineopen@\kern.5\mex\root@{#1}{#2}\inlineclose@} % \def changed to \pdef on 25 Sept. 2002 thanks to Michal Malek \def\root@#1#2{% \setbox0\currstyle@hbox{\toprestricted@true #2 \vrule \@height 1.6\mex \@depth0pt \@width 0pt} % mathstrut's top \setbox\@tempboxa\hbox{\o@math\currstyle@ \ifdisplay@ \@tempdima=.6\dp\sizebox@ % bottom is half of that of sizebox \else \@tempdima=.2\mex % bottom is a bit below the baseline \fi \setbox\@tempboxa\hbox to\wd0{% \vrule \@height\ht0 \@depth\@tempdima \@width 0pt\hss}% \global\setbox\sizebox@\copy\@tempboxa \setbox\@tempboxa\hbox{\o@math\currstyle@\o@sqrt{\box\@tempboxa}\o@math}% \@tempdima=\ht\@tempboxa \advance\@tempdima-\dp\@tempboxa \advance\@tempdima 1.6\mex \raise.4\@tempdima\hbox{\advance\mathcount@2\imath@{#1}}% \kern-.3\mex \box\@tempboxa \o@math} % tempboxa := the radical sign with #1 and without #2 \resizebox@{\sizebox@} % sizebox matches top of #2 and bottom at @tempdima \setbox0\hbox to\wd\@tempboxa{\hss\box0} % box0 = #1 shifted right \setbox0\vbox{\offinterlineskip \vskip-.1\mex \@tempdima=\ht\@tempboxa \dimen@=\dp\@tempboxa \advance\@tempdima \dimen@ \advance\@tempdima -.55\mex \box\@tempboxa \vskip -\@tempdima \box0} % box0 = the result \box0\kern.3\mex\relax % space following the root } % % U n d e r b r a c e a n d o v e r b r a c e % % Underbrace and overbrace are designed as escape commands, because they % may extend accross unbalanced delimiters: \def\@underbrace#1{\o@mathop{\vtop{% \ialign{##\crcr \o@math\hfil\dcurrstyle@{#1}\hfil\o@math\crcr \noalign{\kern 3pt\nointerlineskip} \upbracefill \crcr \noalign{\kern 3pt}}}}\limits} \def\underbrace#1#2#3{\null\! \def\@tempa{#2}\def\@tempb{_}% \ifx\@tempa\@tempb \b@ubrace@#1\e@ubrace@{#3}\! \else\n@err{Missing _ after \string\underbrace} {Wrong syntax. I expected something like \underbrace{...}_{...}} #1 \fi} \def\b@ubrace@{% \ifdisplay@ \store@ec{\b@ubrace@@}{} \else \b@ubrace@@ \fi} \def\b@ubrace@@{\setbox0\hbox\bgroup} \def\e@ubrace@#1{% \ifdisplay@ \store@ec{\e@ubrace@@{#1}}{} \else \e@ubrace@@{#1} \fi} \def\e@ubrace@@#1{\egroup\@underbrace{\box0}_{#1}} \def\@overbrace#1{\o@mathop{\vbox{% \ialign{##\crcr \noalign{\kern 3pt\nointerlineskip} \downbracefill \crcr \noalign{\kern 3pt}\crcr \o@math\hfil\dcurrstyle@{#1}\hfil\o@math\crcr}}}\limits} \def\overbrace#1#2#3{\null\! \def\@tempa{#2}\def\@tempb{^}% \ifx\@tempa\@tempb \b@obrace@#1\e@obrace@{#3}\! \else\n@err{Missing ^ after \string\overbrace} {Wrong syntax. I expected something like \overbrace{...}^{...}} #1 \fi} \def\b@obrace@{% \ifdisplay@ \store@ec{\b@obrace@@}{} \else \b@obrace@@ \fi} \def\b@obrace@@{\setbox0\hbox\bgroup} \def\e@obrace@#1{% \ifdisplay@ \store@ec{\e@obrace@@{#1}}{} \else \e@obrace@@{#1} \fi} \def\e@obrace@@#1{\egroup\@overbrace{\box0}^{#1}} % % F r a c t i o n s % % This is tricky. % See Natural TeX notation in mathematics, % in: Proc. Conf. EuroTeX 2001, Kerkrade, 23--27 September 2001; % online at www.ntg.nl/eurotex/proceedings.html \let\o@over=\over \let\o@atop=\atop \let\o@choose=\choose \def\over{\n@err{Disabled command \string\over } {No more a valid command. Replace {A \over B} with \frac A B.}} \def\atop{\n@err{Disabled command \string\atop } {No more a valid command. Use array instead.}} \def\choose{\n@err{Disabled command \string\choose } {No more a valid command. Replace {A \choose B} with \binom A B.}} % \frac is defined here \pdef\frac#1#2{% \checknumeric@{#1#2} \ifdisplay@ \ifresult@ % numeric extensible \ext@frac{#1}{#2} \else \d@Frac{#1}{#2} \fi \else \inlinefrac@{#1}{#2} \fi } % displayed fraction with setsize. \newdimen\htdecrement@ % global \newdimen\dpdecrement@ % global \def\d@Frac#1#2{\begingroup \setbox\@tempboxa\hbox{\o@math\dcurrstyle@ {\setbox0\currstyle@hbox{\vrule\@depth .7\mex\@width 0pt \botrestricted@false #1}% \@tempdima=\ht0 \advance\@tempdima-\ht\sizebox@ \global\htdecrement@=\@tempdima % \@tempdima=\dp0 \advance\@tempdima .5ex \dp0=\@tempdima \box0 \above\fracrulethickness@ \setbox0\currstyle@hbox{\vrule\@height 2\mex\@width 0pt \toprestricted@false #2}% \@tempdimb=\dp0 \advance\@tempdimb-\dp\sizebox@ \global\dpdecrement@=\@tempdimb % \@tempdimb=\ht0 \advance\@tempdimb .5ex \ht0=\@tempdimb \box0 }% \o@math}% \setbox0\copy\@tempboxa \iftoprestricted@ \else \@tempdimb=\ht0 \advance\@tempdimb .4\mex \ht0=\@tempdimb \fi \ifbotrestricted@ \else \@tempdimb=\dp0 \advance\@tempdimb .5\mex \dp0=\@tempdimb \fi \box0 % print \@tempdima=\ht\@tempboxa \advance\@tempdima-\htdecrement@ \ht\@tempboxa=\@tempdima \@tempdima=\dp\@tempboxa \advance\@tempdima-\dpdecrement@ \dp\@tempboxa=\@tempdima \global\setbox\sizebox@\copy\@tempboxa \endgroup \resizebox@{\sizebox@}} \newdimen\fracrulethickness@ \fracrulethickness@=.3pt \def\shillingsign@{/} \def\inlinefrac@#1#2{% \checkcompact@{#1}{\medmuskip=0mu\thickmuskip=0mu\thinmuskip=0mu}% \ifresult@ \wrapfrac@{#1} \else (\wrapfrac@{#1}) \fi \shillingsign@ \checkcompact@{\mathord{}#2}{\medmuskip=0mu\thickmuskip=0mu}% \ifresult@ \wrapfrac@{#2} \else (\wrapfrac@{#2}) \fi } % Extensible fractions are middle delimiters: \def\ext@frac#1#2{\mathinner{}\ddelim@m:{{#1}{#2}}\mathinner{}} % Here is the command to size a numeric fraction: small if sizebox fits % into some bounds. The bounds themselves are bigger than smallest size % parentheses. \def\size@frac#1#2{% \ifdim\ht\sizebox>2.3\mex {\dcurrstyle@{#1\o@over#2}} \else \ifdim\dp\sizebox>1.4\mex {\dcurrstyle@{#1\o@over#2}} \else {\icurrstyle@{#1\o@over#2}} \fi \fi } % Here is a macro to recognize a numeric argument. The criterion is that after % removal of all characters 0--9 the typeset box is of height no greater than % 1/2 ex. \def\checknumeric@#1{\setbox0\hbox{\defaultdelims@ \o@math\removenums@{#1}\o@math} \ifdim\ht0>.5ex\relax \global\result@false \else\global\result@true \fi} \def\removenums@#1{\begingroup \def\frac##1##2{X} \uccode``=`| \uccode`0=`.\uccode`1=`.\uccode`2=`.\uccode`3=`.\uccode`4=`. \uccode`5=`.\uccode`6=`.\uccode`7=`.\uccode`8=`.\uccode`9=`.\uppercase{#1} \endgroup} \def\checkcompact@#1#2{\setbox\@tempboxa\hbox{\o@math \def\frac##1##2{\mskip\medmuskip} \lowercase{\remove@ss\replacebindelims@{#1}{\mathord{}}}\o@math} \@tempdima=\wd\@tempboxa \setbox\@tempboxa\hbox{\o@math\def\frac##1##2{\mskip\medmuskip} #2 \remove@compact{\remove@ss\replacebindelims@{#1}{\mathord{}}}\o@math} \advance\@tempdima-\wd\@tempboxa \ifdim\@tempdima>0pt \relax\result@false\else\result@true\fi} \catcode`\^=13 \catcode`\_=13 \def\remove@ss{\def^##1{}\def_##1{}} \catcode`\^=12 \catcode`\_=12 \def\remove@compact#1{\begingroup \def\shillingsign@{} \def\backslash{} \def\vert{} \def\Vert{} \def\uparrow{} \def\Uparrow{} \def\downarrow{} \def\Downarrow{} \def\updownarrow{} \def\Updownarrow{} \removeslashes@{#1}\endgroup} \def\removeslashes@#1{\lccode`/=` \lccode`|=` \lowercase{#1}} \newdimen\wrapfrac@dim \newbox\wrapfrac@box \def\wrapfrac@#1{% \begingroup \@wrapfrac\mathopen{}#1 \relax\mathclose{}\frac\relax\relax\frac \endgroup } % \relax after #1 added 4.4.2001 % space after #1 added 7.5.2001 \def\@wrapfrac#1\frac#2#3#4\frac{% \def\frac@test{#2}\def\@relax{\relax} \ifx\frac@test\@relax #1 \def\next@frac{} \else \@@wrapfrac{#1}{#2}{#3}{#4} \def\next@frac{\next@frac@#4\frac} \fi \next@frac} \newif\ifwrap@ \def\@@wrapfrac#1#2#3#4{% \checknumeric@{#2#3} \ifresult@ #1{#2\o@over#3} \def\next@frac@{\@wrapfrac} \else \def\next@frac@{\@wrapfrac\mathord{}} \wrap@false % to be true iff #4 starts with Ord, Op, Open, Inner \setbox\wrapfrac@box\hbox{\o@math\mathord{}#4\mathinner{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\mathrel{}#4\mathinner{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt \wrap@true\fi \ifwrap@ % relax \else % now \wrap@false; to be true if #1 ends with Ord, Op, Close, Inner \setbox\wrapfrac@box\hbox{\o@math\mathinner{}#1\mathopen{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\mathinner{}#1\mathrel{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt \wrap@true\fi \ifwrap@ % now #1 ends with Ord, Op, Close, Inner % now \wrap@true; check whether #1 ends with +,-,\pm,\mp \setbox\wrapfrac@box\hbox{\o@math\testing@true \def\pm{=}\def\mp{=} \uccode`+=`=\uccode`-=`= \uppercase{#1}\mathclose{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\testing@true \def\pm{=}\def\mp{=} \uccode`+=`=\uccode`-=`= \uppercase{#1}\mathopen{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt \wrapexception@{#2} \ifresult@\wrap@true \else\wrap@false \fi \fi \ifwrap@ % now Ord, Op, Close, Inner; test whether Inner \setbox\wrapfrac@box\hbox{\o@math\testing@true\mathinner{}#1\mathclose{} \o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\testing@true\mathinner{}#1\mathpunct{} \o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt \result@true % #1 ends with Inner \else % now test whether #1 ends with a digit \checkwrapexception@{#1} \fi \ifresult@ % if wrapexception \wrapexception@{\uccode`.=`+ % make numbers into Bins \uccode`0=`+ \uccode`1=`+ \uccode`2=`+ \uccode`3=`+ \uccode`4=`+ \uccode`5=`+ \uccode`6=`+ \uccode`7=`+ \uccode`8=`+ \uccode`9=`+ \uppercase{#2}} \ifresult@\wrap@true \else\wrap@false \fi \else \wrap@true \fi \fi \else % now #1 ends with Bin, Rel, Open, Punct \setbox\wrapfrac@box\hbox{\o@math\mathinner{}#1\mathclose{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\mathinner{}#1\mathrel{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt % #1 ends with Bin* \wrapexception@{#2} \ifresult@\wrap@true \else\wrap@false \fi \else \wrap@false \fi \fi \fi \ifwrap@ #1(\inlinefrac@{#2}{#3}) \else #1\mathopen{}\inlinefrac@{#2}{#3}\mathclose{} \fi \fi} % Called when #1 ends with Ord, Op, Close, Inner; checks whether % it ends with a digit. \def\checkwrapexception@#1{% checks whether #1 ends with a digit \result@false \setbox\wrapfrac@box\hbox{\o@math\testing@true \uccode`0=`= \uccode`1=`= \uccode`2=`= \uccode`3=`= \uccode`4=`= \uccode`5=`= \uccode`6=`= \uccode`7=`= \uccode`8=`= \uccode`9=`= \uppercase{#1}\mathclose{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\testing@true \uccode`0=`= \uccode`1=`= \uccode`2=`= \uccode`3=`= \uccode`4=`= \uccode`5=`= \uccode`6=`= \uccode`7=`= \uccode`8=`= \uccode`9=`= \uppercase{#1}\mathopen{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim<0pt \result@true \else \fi} \def\wrapexception@#1{% checks whether #1 starts with Bin \result@false \setbox\wrapfrac@box\hbox{\o@math\mathord{}#1\mathclose{}\o@math} \wrapfrac@dim=\wd\wrapfrac@box \setbox\wrapfrac@box\hbox{\o@math\mathinner{}#1\mathclose{}\o@math} \advance\wrapfrac@dim-\wd\wrapfrac@box \ifdim\wrapfrac@dim=0pt \result@true \fi} % % A r g u m e n t p l a c e h o l d e r % \pdef\adot{\checkpunct@\mathclose{} \ifpunct@\else\mkern 1.8mu\fi {\cdot}\, \mathopen{}} % % S p a c e s % % Firstly, disable spacefactor -- this makes typesetting easier. % (US TeXperts may wish to restore.) \frenchspacing % Secondly, we redefine `\ ' to produce breakable space in math mode. % To be used after a punctuation, which itself adds a thinmuskip. \def\space@{{} } \def\mspace@{\mskip 2.4mu plus 3.6mu minus 1.8mu} \def\ {\ifmmode\penalty0\mspace@\else\space@\fi} % Quads are 1pc long: \def\quad{\null\hskip1pc\relax} \def\qquad{\null\hskip2pc\relax} \def\qqquad{\null\hskip3pc\relax} % Nath also introduces a new environment to set math material tight. \def\tight{\def\mspaces@{\thinmuskip=2.4mu \medmuskip=1.2mu \thickmuskip=4.5mu \def\mspace@{\mskip 1.5mu}% \def\quad{\null\hskip .6pc\relax}% \def\qquad{\null\hskip 1.2pc\relax}% \def\qqquad{\null\hskip 1.8pc\relax}% }} \def\endtight{\global\@ignoretrue} % % P u n c t u a t i o n % \newif\ifpunct@ % global \def\punctpenalty{12756} % Earth's diameter in kilometers (> 10000) \def\@comma{\mc@comma\penalty\punctpenalty\relax} \def\@semicolon{\mc@semicolon\penalty\punctpenalty\relax} \def\checkpunct@{\ifnum\lastpenalty=\punctpenalty\relax \global\punct@true \else \global\punct@false \fi} \let\o@dots\dots \pdef\dots{% \ifmmode \checkpunct@ \ifpunct@ \ldots \global\punct@false \else \cdots \fi \else \o@dots \fi} % % A r r a y % \let\o@array=\array \let\o@endarray=\endarray \newif\iflasthline@ \global\lasthline@false \pdef\array{\hskip-\arraycolsep \def\@arstrut{} \let\hline\arr@hline \amp@count=0 \setbox0\hbox\bgroup \ifdisplay@\else\advance\mathcount@ 1 \n@warning{Array in in-line mode} \fi \o@math\o@array} % \@arraycr is \\, but must insert a strut at the end of the line \def\arraystrut{\vrule height 1.9\mex depth .75\mex width 0pt} \def\@arraycr{\mathclose{} % no math space \hbox{\arraystrut}% \arraycr@@} \def\arraycr@@{\crcr % nothing if following another \cr or \halign \def\@amp{\hbox{\vrule height\arrayrowsep width 0pt}} \@tempcnta=\amp@count \loop\ifnum\@tempcnta>1 \edef\@amp{\@amp&} % line sep \advance\@tempcnta-1 \repeat \@amp \cr} \pdef\endarray{% may follow after \hline; corrected 18 March 2003 \iflasthline@ \else \hbox{\arraystrut} \fi \o@endarray % LaTeX's \endarray \o@math\egroup \@tempdima=\ht0 \advance\@tempdima -.15ex \ht0=\@tempdima \@tempdima=\dp0 \advance\@tempdima -.15ex \dp0=\@tempdima \resizebox@{0}\box0 \hskip-\arraycolsep\relax} \newcount\hline@num \pdef\arr@hline{\noalign\bgroup % begin noalign \hline@num=1 \result@false \def\hline@@@{\afterassignment\hline@ \global\let\hline@@=}% \hline@@@} \def\hline@{ \ifx\hline@@\hline \result@false \advance\hline@num 1\relax \else \result@true \ifx\hline@@\end \global\lasthline@true \else \global\lasthline@false \fi \fi \ifresult@ \@tempcnta=\hline@num \loop\ifnum \@tempcnta > 0 \hrule height \arrayrulewidth \vskip \doublerulesep \vskip -\arrayrulewidth \advance \@tempcnta -1 \repeat \vskip -\doublerulesep \egroup % end noalign \iflasthline@ % if the bottom line \else \arraycr@@ \mathopen{\hbox{\arraystrut}} \fi \def\hline@@@{\hline@@} \fi \hline@@@} \doublerulesep=\arrayrulewidth % \@arrayclassz now uses display mode, and % calls \@addamp if \@lastchclass = 4 \def\@arrayclassz{\ifcase\@lastchclass\@acolampacol \or\@ampacol \or \or \or\@addamp \or\@acolampacol \or\@firstampfalse\@acol \fi \edef\@preamble{\@preamble \ifcase \@chnum \hfil\protect\dmathon@\@sharp\protect\dmathoff@\hfil \or \protect\dmathon@\@sharp\protect\dmathoff@\hfil \or \hfil\protect\dmathon@\@sharp\protect\dmathoff@ \fi} } % New \arraycolsep. \let\arraycolsepdim=\arraycolsep \def\arraycolsep{\prorated@\arraycolsepdim} % New \arrayrowsepdim \newdimen\arrayrowsepdim \arrayrowsepdim=.4ex \def\arrayrowsep{\prorated@\arrayrowsepdim} % Counting &'s \newcount\amp@count \def\@addamp{% \if@firstamp \amp@count=1 \@firstampfalse \else \advance\amp@count by 1 \edef\@preamble{\@preamble &}% \fi} % Cases is arrays \def\cases{\displayon@\{\hskip.5ex \array{ll}} \def\endcases{\endarray\right.\displayoff@} % % M a t r i c e s % \pdef\matrix{\setbox0\hbox\bgroup\o@math \ifdisplay@\else \advance\mathcount@ 1 \n@warning{Matrix in in-line mode} \fi \vcenter\bgroup %\vskip-.00005ex \let\\=\crcr \baselineskip=2.7\mex \lineskip=1.2\mex \ialign\bgroup &\hfil\hbox{\dmathon@##\dmathoff@}\hfil\hskip2\mex\crcr} \pdef\endmatrix{\crcr\egroup %\vskip-.00005ex \egroup \o@math\hskip-2\mex\egroup \resizebox@{0}\box0} %\def\suppressminus@{\afterassignment\suppressminus@@\let\next=} %\def\@@@minus{-} %\def\suppressminus@@{\if\next\@@@minus \llap{$-$}\let\next\relax\fi \next} % Binom is a matrix: \pdef\binom#1#2{% \ifdisplay@ (\matrix\inline{#1}\\\inline{#2}\endmatrix) \else \advance\mathcount@ 1 \vcenter{\hbox{\o@math\biglp@\o@math}} \displayed{\matrix\inline{#1}\\\inline{#2}\endmatrix} \vcenter{\hbox{\o@math\bigrp@\o@math}} \fi} \mathchardef\biglp@="0300 \mathchardef\bigrp@="0301 % % T a b l e o f c o n t e n t s % \let\o@addcontentsline\addcontentsline \def\addcontentsline#1#2#3{% \begingroup \def\acl@{#3}% \the\protect@toks \def\protect{\noexpand}% \edef\acl@{\acl@}% \o@addcontentsline{#1}{#2}{\acl@}% \endgroup } % % A M S - L a T e X % % Detecting AmSLaTeX \ifx\primfrac\undefined \else \typeout{} \typeout{AmSLaTeX detected.} \typeout{Do not expect too much from this combination.} \typeout{Consult Nath Guide if things go bad.} \gdef\resetMathstrut@{} \let\over=\@@over % restore \over \let\above=\@@above % restore \above \fi % % I n i t i a l i z a t i o n % \catcode`\$=13 \geometryfalse \silentfalse \frenchspacing % % T h e l o g o % \def\Nath{$`Nath$} % % E n d % \endinput

http://dlmf.nist.gov/13.2.E36.tex

nist.gov

CC-MAIN-2014-10

application/x-tex

crawl-data/CC-MAIN-2014-10/segments/1394011215089/warc/CC-MAIN-20140305092015-00028-ip-10-183-142-35.ec2.internal.warc.gz

\[\mathop{\mathscr{W}\/}\nolimits\left\{z^{{1-b}}\mathop{{\mathbf{M}}\/}% \nolimits\!\left(a-b+1,2-b,z\right),\mathop{U\/}\nolimits\!\left(a,b,z\right)% \right\}=-\ifrac{z^{{-b}}e^{z}}{\mathop{\Gamma\/}\nolimits\!\left(a-b+1\right)},\]

http://ctan.math.utah.edu/tex-archive/macros/latex2e/contrib/scratch3/scratch3-fr.tex

utah.edu

CC-MAIN-2020-34

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2020-34/segments/1596439737225.57/warc/CC-MAIN-20200807202502-20200807232502-00302.warc.gz

% !TeX encoding = ISO-8859-1 % Ceci est la documentation du package "scratch3" % % Fichier compilé avec pdflatex \documentclass[french,a4paper,10pt]{article} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage[margin=2cm]{geometry} \usepackage[bottom]{footmisc} \usepackage{libertine,boites,tikz,enumitem,MnSymbol,babel,xspace,listings,scratch3} \usepackage[scaled=0.8]{luximono} \frenchbsetup{og=«,fg=»} \def\SCRATCH{\texttt{scratch}\xspace} \def\SSCRATCH{\texttt{\scrname}\xspace} \makeatletter \def\code{\expandafter\code@i\string} \def\code@i#1{% \begingroup \par\nobreak\medskip\parindent0pt \leftskip.1\linewidth \catcode`\^^I 13 \begingroup\lccode`\~`\^^I \lowercase{\endgroup\def~{\leavevmode\space\space\space\space}}% \let\do\@makeother \dospecials \ttfamily\small\@noligs \make@car@active\<{$\langle$\begingroup\itshape}% \make@car@active\>{\endgroup$\rangle$}% \obeylines\obeyspaces \def\code@ii##1#1{##1\par\medbreak\endgroup}% \code@ii } \long\def\grab@toks#1\relax{\gdef\right@content{#1}} \newcommand\disable@lig[1]{% \catcode`#1\active \begingroup \lccode`\~`#1\relax \lowercase{\endgroup\def~{\leavevmode\kern\z@\string#1}}% } \newcommand\make@car@active[1]{% \catcode`#1\active \begingroup \lccode`\~`#1\relax \lowercase{\endgroup\def~}% } \newcommand\exemple{% \begingroup \parskip\z@ \exemple@} \newcommand\exemple@{% \medbreak\noindent \begingroup \let\do\@makeother\dospecials \make@car@active\ { {}}% \make@car@active\^^M{\par\leavevmode}% \make@car@active\^^I{\space\space}% \make@car@active\,{\leavevmode\kern\z@\string,}% \make@car@active\-{\leavevmode\kern\z@\string-}% \make@car@active\>{\leavevmode\kern\z@\string>}% \make@car@active\<{\leavevmode\kern\z@\string<}% \@makeother\;\@makeother\!\@makeother\?\@makeother\:% neutralise frenchb \exemple@@ } \newcommand\exemple@@[1]{% \def\@tempa##1#1{\exemple@@@{##1}}% \@tempa } \newcommand\exemple@@@[1]{% \xdef\the@code{#1}% \endgroup \begingroup \fboxrule0.4pt \fboxsep=5pt \let\breakboxparindent\z@ \def\bkvz@top{\hrule\@height\fboxrule}% \def\bkvz@bottom{\hrule\@height\fboxrule}% \let\bkvz@before@breakbox\relax \def\bkvz@set@linewidth{\advance\linewidth\dimexpr-2\fboxrule-2\fboxsep\relax}% \def\bkvz@left{\vrule\@width\fboxrule\kern\fboxsep}% \def\bkvz@right{\kern\fboxsep\vrule\@width\fboxrule}% \breakbox \kern.5ex\relax \begingroup \ttfamily\small\the@code\par \endgroup \kern3pt \hrule height0.1pt width\linewidth depth0.1pt \vskip5pt \newlinechar`\^^M\everyeof{\noexpand}\scantokens{#1}\par \endbreakbox \endgroup \medbreak \endgroup } \begingroup \catcode`\<13 \catcode`\>13 \gdef\verb{\relax\ifmmode\hbox\else\leavevmode\null\fi \bgroup \verb@eol@error \let\do\@makeother \dospecials \verbatim@font\@noligs \catcode`\<13 \catcode`\>13 \def<{\begingroup$\langle$\itshape}\def>{\/$\rangle$\endgroup}% \@ifstar\@sverb\@verb} \endgroup \def\longfrscrdate@i#1/#2/#3\@nil{\number#3\relax\ifnum\number#3=1 \noexpand\ier\fi\space \ifcase#2 \or janvier\or février\or mars\or avril\or mai\or juin\or juillet\or aout\or septembre\or octobre\or novembre\or décembre\fi\space#1} \edef\longfrscrdate{\expandafter\longfrscrdate@i\scrdate\@nil} \makeatother \begingroup \catcode`\_11 \gdef\cleval#1#2{% \bigbreak\noindent \hbox to .25\linewidth{% \color{teal}\bfseries\ttfamily \detokenize{#1}=$\langle$\detokenize{#2}$\rangle$\hss}\kern2.5em (\textit{Défaut} : {\color{teal}\ttfamily \skv_eearg\skv_ifempty{\useKV[\scrname]{#1}} {\detokenize{{}}} {\detokenize\expandafter\expandafter\expandafter{\useKV[\scrname]{#1}}}}\unskip)% \par\nobreak } \endgroup \def\suffixe#1{\begingroup\sffamily\bfseries\color{scr#1}#1\endgroup} \newenvironment{version}[2] {% \paragraph{\hbox to 4em {v\hskip1pt #1\hfill}#2}\hskip0pt \par \catcode`\>13 \begingroup\lccode`\~`\> \lowercase{\endgroup\let~}\item \begin{itemize}% } {% \end{itemize}% } \begin{document} \parindent=0pt \thispagestyle{empty} \begin{titlepage} \begingroup \centering \null\vskip.25\vsize {\large\bfseries L'extension pour \LaTeX\medbreak \Huge \begin{scratch}[line width=1.5pt]\blockmove\scrname\end{scratch}\par} \bigbreak v \scrver \smallbreak \longfrscrdate \vskip1.5cm Christian \bsc{Tellechea}\par \texttt{unbonpetit@netc.fr}\par \endgroup \vskip2cm \leftskip=.2\linewidth \rightskip=.2\linewidth \small Cette extension permet de dessiner des empilements de blocs similaires à ceux que l'on trouve dans le logiciel de programmation \emph{visuelle} « \SCRATCH v3\footnote{Le logiciel que l'on peut utiliser en ligne à \texttt{https://scratch.mit.edu/}} ». \end{titlepage} \parindent0pt \section{Avant propos} La présente extension intitulée \SSCRATCH, est une évolution de l'extension \SCRATCH qui imitait la version 2 du logiciel. Depuis janvier~2019, le logiciel est passé à la version~3 et l'extension \SCRATCH est donc devenue obsolète et non maintenue.\medbreak Cette version de \SSCRATCH étant la première, elle est susceptible d'être immature, c'est-à-dire de contenir des bugs, des incohérences ou des effets non désirés. Si cela se produit, je remercie les utilisateurs de bien vouloir me le faire savoir par email ou \emph{via} le « bugtracker » de \texttt{gitlab} à l'adresse \begin{center} \texttt{\detokenize{https://framagit.org/unbonpetit/scratch3/issues}} \end{center} Les utilisateurs les plus attentifs auront sans doute remarqué que seuls les blocs de type «stylo» sont disponibles parmi ceux qui sont dorénavant considérés comme «extension». Il s'agit, pour l'instant, d'un choix délibéré... \paragraph{Attention} Il est fortement déconseillé de charger les packages \SCRATCH et \SSCRATCH en raison de plusieurs définitions communes qu'ils partagent et qui conduiraient inévitablement à des dysfonctionnements. L'erreur qui survient ---~et le refus de charger le deuxième~--- lorsqu'on tente de charger ces deux packages ne doivent pas être désactivés par une modification de leurs codes.\medbreak L'extension \SSCRATCH requiert les extensions \texttt{simplekv} et \texttt{ti\textit kz} qui sont automatiquement chargées si cela s'avère nécessaire.\medbreak Fidèle à mes convictions, la documentation de cette extension n'est disponible qu'en français. \section{L'environnement \SCRATCH} Pour dessiner un programme comme le fait \SCRATCH, il faut ouvrir un environnement «\SCRATCH» et écrire dans cet environnement les macros correspondant aux \emph{blocs} que l'on veut y mettre : \code|\begin{scratch} macros pour dessiner des blocs \end{scratch}| Comme le savent ceux qui enseignent l'algorithmique et la programmation avec le très-à-la-mode\footnote{Je ne déteste rien de plus comme langage de programmation que ce \emph{truc} vaguement graphique, ultra limité et contre-productif dans l'apprentissage du codage qu'est \SCRATCH et que l'éducation nationale veut à tout prix imposer. Je ne compte bien évidemment pas me plier à ce nouveau dogme ridicule et ne l'utiliserai ni ne l'enseignerai; je considère que les élèves méritent mieux que \SCRATCH --~ADA, java ou lua par exemple~-- comme entrée dans le monde de la programmation.} logiciel « \SCRATCH », les programmes sont construits avec des briques, appelés «blocs», qui peuvent s'emboiter les uns sur les autres. Ces blocs sont de plusieurs couleurs, chacune correspondant à un type d'instruction que l'on retrouve dans les menus de \SCRATCH. J'ai pris le parti d'écrire des macros ayant comme argument le texte qui figure dans le bloc. Ce faisant, on a plus de liberté que dans \SCRATCH où les blocs ont des textes prédéfinis, mais cette liberté permet d'utiliser cette extension quelle que soit la langue dans laquelle on écrit. Enfin, j'ai cherché le bon compromis entre complexité du code et qualité des dessins obtenus avec cette extension: ils \emph{ressemblent} à ceux du logiciel \SCRATCH, mais le but de cette extension n'est \emph{pas} la ressemblance absolue au pixel près! \section{Les blocs normaux} Ces blocs sont les plus courants et possèdent une encoche d'emboitement, femelle en haut et mâle en bas. Les macros permettant de dessiner ces blocs ont des noms de la forme \verb|\block<suffixe>| et ont un seul argument obligatoire qui est le texte que l'on souhaite mettre dans le bloc. Par exemple, un bloc bleu (correspondant au menu «mouvement») a un suffixe \suffixe{move}, et est dessiné grâce à la macro \verb|\blockmove{<texte>}|. Ainsi, dans l'environnement \SCRATCH, écrire \verb|\blockmove{Bonjour le monde}| donne \begin{center}\begin{scratch}\blockmove{Bonjour le monde}\end{scratch}\end{center} La police d'écriture dans chaque bloc est la police « \textsf{sans serif} » qui est définie dans le document au moment où l'environnement est appelé : pratiquement, cela signifie que la macro \verb|\sffamily| est exécutée avant que le texte des blocs ne soit composé. La clé «\texttt{pre text}» (voir page~\pageref{pre text}), modifiable par l'utilisateur, contient par défaut le code exécuté avant que du texte ne soit affiché, c'est-à-dire \verb|\sffamily|. Dans cette documentation, la police sans serif est «\textsf{biolinum}». La plupart des dimensions des blocs sont proportionnelles à la taille de la police en cours. On peut donc jouer sur la taille de la police (via les classiques macros \verb|\small|, \verb|\large|, \verb|\footnotesize|, etc) pour modifier la taille des blocs\footnote{Il y a aussi la clé «\texttt{scale}» pour mettre le dessin à l'échelle que l'on souhaite, voir page~\pageref{cle-scale}} . Voici un inventaire des tous les blocs disponibles, empilés les uns sous les autres : \exemple/Voici un algorithme bizarre : \begin{scratch} \blockmove{bloc de mouvement} \blocklook{bloc d'apparence} \blocksound{bloc de son} \blockpen{bloc de stylo} \blockvariable{bloc de variable} \blocklist{bloc de liste} \blockevent{bloc d'événement} \blockcontrol{bloc de contrôle} \blocksensing{bloc de capteur} \end{scratch}/ Il faut donc retenir cette logique : les suffixes \suffixe{move}, \suffixe{look}, \suffixe{sound}, \suffixe{pen}, \suffixe{variable}, \suffixe{list}, \suffixe{event}, \suffixe{control} et \suffixe{sensing} correspondent aux couleurs des blocs. Il existe aussi le suffixe \suffixe{operator} qui n'a pas été montré précédemment puisqu'aucun bloc n'existe pour la fonction «opérateurs». \section{Les ovales} Les « ovales » sont, selon le code graphique de \SCRATCH, censés contenir des variables que l'utilisateur spécifie lui-même (comme des nombres ou du texte) : \begin{center} \begin{scratch} \blockmove{tourner de \turnleft{} de \ovalnum{45} degrés} \blocklook{penser à \ovalnum{Hmm..} pendant \ovalnum{2} secondes} \end{scratch} \end{center} Les variables peuvent être prédéfinies dans \SCRATCH ou créées par l'utilisateur et dans ce cas, les ovales sont de couleur identique à la couleur du thème auquel appartient la variable: \begin{center} \begin{scratch} \blocklook{penser à \ovalsensing{réponse}} \blockmove{aller à x: \ovaloperator{\ovalmove{ abscisse x} + \ovalnum{1}} y: \ovalmove{ordonnée y}} \end{scratch} \end{center} Ces variables peuvent également être spécifiques aux blocs concernés, sélectionnées parmi plusieurs possibilités, auquel cas l'ovale est de couleur plus sombre que le bloc et se termine avec une flèche de sélection : \begin{center} \begin{scratch} \blocksound{jouer le son \ovalsound*{Meow}} \blockcontrol{créer un clone de \ovalcontrol*{moi même}} \end{scratch} \end{center} Au niveau des macros utilisées : \begin{itemize} \item la macro \verb|\ovalnum{<nombre>}| dessine un ovale à fond blanc; \item la macro \verb|\oval<suffixe>| trace un ovale de la couleur de \verb|<suffixe>|; \item en version étoilée, \verb|\oval<suffixe>*| trace un ovale de couleur plus sombre avec une flèche de sélection; \item les macros \verb|\turnleft| et \verb|\turnright| dessinent des flèches de rotation dans les blocs \verb|\blockmove|. \end{itemize} \exemple/Ovales de toutes sortes : \begin{scratch} \blockmove{tourner de \turnleft{} de \ovalnum{45} degrés} \blocklook{penser à \ovalnum{Hmm..} pendant \ovalnum{2} secondes} \blocklook{penser à \ovalsensing{réponse}} \blockmove{aller à x: \ovaloperator{\ovalmove{ abscisse x} + \ovalnum{1}} y: \ovalmove{ordonnée y}} \blocksound{jouer le son \ovalsound*{Meow}} \blockcontrol{créer un clone de \ovalcontrol*{moi même}} \end{scratch}/ Toutes les macros de la forme \verb|\oval<suffixe>| sont utilisables \emph{en dehors} de l'environnement \SCRATCH: \exemple/Voici une variable simple «\ovalmove{direction}», une variable sélectionnée «\ovalsound*{Meow}»./ Il faut signaler que les blocs de suffixes \suffixe{operator}, \suffixe{variable} , \suffixe{list} ou \suffixe{moreblocks} ne peuvent avoir d'ovales de sélection. N'ayant pas de sens pour \SCRATCH, une erreur sera émise si une macro étoilée \verb|\oval<suffixe>*| est utilisée, et visuellement, cela se traduira par une couleur de remplissage du bloc en rouge. \medbreak Un ovale rempli de couleur et accessible avec la macro \verb|\pencolor{<couleur>}| permet de sélectionner la couleur du stylo: \exemple/\begin{scratch} \blockpen{stylo en position d'écriture} \blockpen{mettre la couleur du style à \pencolor{red!75!black}} \blockmove{avancer de \ovalnum{25}} \end{scratch}/ \section{Les blocs de début} Ces blocs sont de la couleur \suffixe{event} pour la plupart (macro \verb|\blockinit|), mais il existe aussi un bloc de début de couleur \suffixe{control} (macro \verb|\blockinitclone|). Le drapeau vert est dessiné avec la macro \verb|\greenflag|. \exemple/Voici un début : \begin{scratch} \blockinit{quand \greenflag est cliqué} \blockmove{suite de l'algorithme...} \end{scratch} et un autre : \begin{scratch} \blockinitclone{quand je commence comme un clone} \blocklook{enfiler le costume de clown !} \end{scratch}/ \section{Les rectangles} Un menu déroulant contenant des valeurs prédéfinies est symbolisé par un rectangle dont la couleur reprend celle du bloc dans lequel il se trouve. Pour ce faire, la macro \verb|\selectmenu{<texte>}| doit être exécutée : \exemple/\begin{scratch} \blockinit{Quand je reçois \selectmenu{message 1}} \blocksound{ajouter \ovalnum{10} à l'effet \selectmenu{hauteur}} \blocklook{mettre l'effet \selectmenu{couleur} à \ovalnum{0}} \blockvariable{mettre \selectmenu{ma_variable} à \ovalnum{10}} \end{scratch}/ \section{Les losanges et les blocs de test} Dans la symbolique graphique de \SCRATCH, les losanges contiennent des valeurs booléennes ayant vocation à se retrouver dans un bloc de test. Pour dessiner de tels objets booléens, les macros \verb|\bool<suffixe>{<texte>}| sont utilisées où les \verb|<suffixes>| représentent les couleurs correspondant à la fonction du booléen tracé : \suffixe{list}, \suffixe{sensing} ou \suffixe{operator}. Les blocs de test sont de deux types,selon qu'ils possèdent ou pas une branche « else». \code|\blockif{<texte du test>} {<instructions si test vrai>}| et \code|\blockifelse{<texte du test>} {<instructions si test vrai>} {<instructions si test faux>}| \exemple/Conditions : \begin{scratch} \blockif{si \booloperator{\ovalmove{abscisse x} < \ovalnum{7}} alors} {\blockmove{aller à \selectmenu{position aléatoire}} \blocklook{basculer sur costume \selectmenu{costume 4}} } \blockmove{aller à \selectmenu{pointeur souris}} \end{scratch} et \begin{scratch} \blockifelse{si \boolsensing{couleur \pencolor{blue!65} touchée ?} alors} {\blockmove{avancer de \ovalnum{2}} \blocksound{jouer le son \selectmenu{miaou}} } {\blockvariable{mettre \ovalvariable{total} à \ovaloperator{\ovalvariable{total} + \ovalnum{1}}} \blocksound{arrêter tous les sons} } \blockmove{aller à \selectmenu{pointeur souris}} \end{scratch}/ La macros \verb|\pencolor| et celles de la forme \verb|\bool<suffixe>| sont utilisables \emph{en dehors} d'un environnement \SCRATCH : \exemple/Une couleur : \pencolor{cyan}.\par Un booléen : \boollist{liste \selectmenu{malist} contient \ovalnum{foobar}}.\par Un autre : \booloperator{\booloperator{\ovalvariable{varx} > \ovalnum{1}} et \booloperator{\ovalvariable{varx} < \ovalnum{5}}}./ La macro \verb|\boolempty[<dimension>]| permet de tracer un losange vide. L'argument optionnel est une \verb|<dimension>| qui vaut \verb|2em| par défaut. \exemple/\begin{scratch} \blockifelse{si \boolempty[3em] alors} {\blocklook{dire \ovalnum{le test est vrai}}} {\blocklook{dire \ovalnum{le test est faux}}} \end{scratch}/ \section{Les blocs de fin} Ces blocs sont susceptibles de clore un algorithme et n'ont donc pas d'encoche mâle dans leur partie basse. Ils ne peuvent être que du type \suffixe{control} et sont dessinés avec la macro \verb|\blockstop{<texte>}| \exemple/\begin{scratch}\blockstop{supprimer ce clone}\end{scratch} ou \begin{scratch}\blockstop{stop \selectmenu{ce script}}\end{scratch}/ \section{Les blocs de répétition} Ces blocs sont de deux types, selon que la répétition est prévue pour s'arrêter ou pas (boucle infinie). Ils seront dessinés par les macros \verb|\blockrepeat| et \verb|\blocinfloop| ayant chacune \emph{deux} arguments : le premier étant le \verb|<texte>| du bloc et le second la suite d'instructions à répéter. \exemple/\begin{scratch} \blockpen{stylo en position d'écriture} \blockrepeat{répéter \ovalnum{4} fois} { \blockmove{avancer de \ovalnum{10}} \blockmove{tourner \turnright{} de \ovalnum{90} degrés} } \end{scratch} et \begin{scratch} \blockpen{stylo en position d'écriture} \blockinfloop{répéter indéfiniment} { \blockmove{s'orienter à \ovaloperator{nombre aléatoire entre \ovalnum{0} et \ovalnum{359}}} \blockmove{avancer de \ovaloperator{nombre aléatoire entre \ovalnum{1} et \ovalnum{10}}} \blockif{si \boolsensing{\selectmenu{bord} touché?}} { \blockmove{aller à x: \ovalnum{0} y: \ovalnum{0}} } } \end{scratch}/ \section{Les blocs de définition} Les « procédures », ayant le suffixe \suffixe{moreblocks}, permettent d'étendre les maigres possibilités données au programmeur en \SCRATCH. \exemple/\begin{scratch} \initmoreblocks{définir \namemoreblocks{trace_carré \ovalmoreblocks{coté_carré}}} \blockrepeat{répéter \ovalnum4 fois} {\blockmove{avancer de \ovalmoreblocks{coté_carré}} \blockmove{tourner \turnleft{} de \ovalnum{90} degrés} } \end{scratch} puis \begin{scratch} \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blockpen{relever le stylo} \blockmove{aller à x: \ovalnum0 y: \ovalnum0} \blockmove{s'orienter à \ovalnum{90} degrés} \blockpen{stylo en position d'écriture} \blockrepeat{répéter \ovalnum{10} fois} { \blockmoreblocks{trace carré \ovalnum{50}} \blockmove{avancer de \ovalnum{10}} \blockmove{tourner \turnleft{} de \ovalnum{36} degrés} } \end{scratch}/ À l'intérieur d'un \verb|\namemoreblocks|, on peut mettre \verb|\ovalmoreblocks| pour spécifier un argument de type nombre ou texte ou bien \verb|\boolmoreblocks| pour un argument de type booléen. \section{Bloc invisible} Bien que ce genre de bloc n'existe pas avec \SCRATCH, cette fonctionnalité peut s'avérer utile. On insère un espace vide avec \verb|\blockspace[<coeff>]|. L'espace verticale insérée est égale à la hauteur normale d'un bloc multipliée par le \verb|<coeff>|, valeur optionnelle qui vaut 1 par défaut. \exemple/\begin{scratch} \blockmove{ci-dessous, une espace d'un bloc} \blockspace \blockmove{ci dessous, une espace égale à la moitié d'un bloc} \blockspace[0.5] \blockmove{la suite} \end{scratch}/ \section{Personnalisation} Plusieurs \verb|<paramètres>| peuvent être réglés par l'utilisateur selon la syntaxe \verb|<clé>=<valeur>|. Cas paramètres peuvent être spécifiés dans : \begin{itemize} \item l'argument optionnel de l'environnement \verb|\begin{scratch}[<paramètres>]| auquel cas les \verb|<paramètres>| ne s'appliquent qu'à cet environnement; \item l'argument de la macro \verb|\setscratch{<paramètres>}| pour spécifier des \verb|<paramètres>| pour les environnements \SCRATCH à venir; \item l'argument de \verb|\setdefaultscratch{<paramètres>}| pour spécifier des \verb|<paramètres>| \emph{par défaut}. \end{itemize} Il existe la macro \verb|\resetscratch| qui remet à leur valeur par défaut tous les \verb|<paramètres>| de \SCRATCH, pour annuler les effets d'une macro \verb|\setscratch|.\bigbreak Voici les \verb|<paramètres>| disponibles : \cleval{else word}{caractères} Représente est le mot qui est inséré dans la branche « else » d'un bloc de test. \cleval{pre text}{code}\label{pre text} C'est le \verb|code| qui est exécuté avent que du texte ne soit affiché par \SSCRATCH. \cleval{x sep}{dimension} Représente l'espace horizontale insérée entre les bords droit et gauche du texte du bloc et les bords droits et gauche du bloc. La valeur est ramenée si nécessaire dans l'intervalle [3pt ; 1em]. \cleval{y sepsup}{dimension} Représente l'espace verticale insérée entre le bas de l'encoche femelle et le bord supérieur du texte du bloc. La valeur est ramenée si nécessaire dans l'intervalle [3pt ; 3ex]. \cleval{y sepinf}{dimension} Représente l'espace verticale insérée entre le bas du bloc et le bord inférieur du texte du bloc. La valeur est ramenée si nécessaire dans l'intervalle [3pt ; 3ex]. \cleval{line width}{dimension} Représente l'épaisseur des lignes de relief des blocs et le double des lignes de relief des losanges booléens. La valeur est ramenée si nécessaire dans l'intervalle [0pt ; 5pt]. \cleval{loop width}{dimension} Représente est la largeur de la barre verticale des blocs de répétition ou de test. La valeur est ramenée si nécessaire dans l'intervalle [3pt ; 3em]. \cleval{loop height}{dimension} Représente est l'épaisseur des barres horizontales « else » et inférieure des blocs de répétition ou de test. La valeur est ramenée si nécessaire dans l'intervalle [3pt ; 3ex]. \cleval{corner}{dimension} Représente la dimension des chanfreins des blocs. La valeur est ramenée si nécessaire dans l'intervalle [0.33333ex ; 1ex]. \cleval{notch}{dimension} Représente la largeur des encoches. La valeur est ramenée si nécessaire dans l'intervalle [0.33333em ; 3em]. \cleval{scale}{coefficient}\label{cle-scale} Représente l'échelle à laquelle est représenté le dessin. La valeur est ramenée si nécessaire dans l'intervalle [0.2 ; 5]. Les blocs ovales ou losanges, qui peuvent se trouver à l'extérieur de l'environnement scrtach, sont affectés par la valeur de \texttt{scale} : \exemple/\setscratch{scale=1}Échelle 1 : \ovalvariable{var} et \booloperator{\ovalmove{abscisse x} < \ovalnum{7}}\par Échelle 0.75 :\setscratch{scale=.75} : \ovalvariable{var} et \booloperator{\ovalmove{abscisse x} < \ovalnum{7}}\par Échelle 1.25 :\setscratch{scale=1.25} : \ovalvariable{var} et \booloperator{\ovalmove{abscisse x} < \ovalnum{7}}/ \cleval{init arcangle}{angle} Représente l'angle avec l'horizontale de l'arc de cercle tracé dans la partie haute des blocs de départ. La valeur est ramenée si nécessaire dans l'intervalle [20 ; 40]. \cleval{init arclength}{dimension} Représente la longueur horizontale de l'arc de cercle tracé dans la partie haute des blocs de départ. La valeur est ramenée si nécessaire dans l'intervalle [3em ; 8em]. \cleval{print}{booléen} Lorsque ce booléen est vrai, les dessins se font en noir et blanc de façon à pouvoir être dirigés vers une impression en noir et blanc. \exemple/\begin{scratch} \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \begin{scratch}[print] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch}/ \cleval{fill blocks}{booléen} Ce booléen n'est pris en compte que lorsque le booléen \verb|print| est vrai. Si \verb|fill blocks| est vrai, tous les dessins (sauf les ovales contenant des nombres) seront remplis avec un gris choisi avec la clé suivante. \cleval{fill gray}{taux de gris} Lorsque \verb|fill blocks| est vrai, ce taux de blanc dans le gris (nombre compris entre 0 pour noir et 1 pour blanc) est utilisé pour définir une couleur de remplissage des dessins. La valeur est ramenée si nécessaire dans l'intervalle [0 ; 1]. \exemple/\begin{scratch} \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \begin{scratch}[print,fill blocks] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \begin{scratch}[print,fill blocks,fill gray=0.66] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch}/ \cleval{contrast}{entier} Lorsque l'option \verb|print| est vraie, cet entier, compris entre 0 et 100 inclus, qualifie la différence de teinte entre les lignes de relief et la teinte de gris de ces blocs, spécifiée par la clé \texttt{fill gray}. L'entier 0 sélectionne la couleur spécifiée par \texttt{fill gray} tandis que 100 trace les lignes en noir. La valeur est ramenée si nécessaire dans l'intervalle [0 ; 100]. \cleval{text color}{couleur} Lorsque \verb|fill blocks| est vrai, cette couleur sera utilisée pour le texte des blocs. \cleval{flag gray}{taux de gris} Lorsque \verb|print| est vrai, ce taux de gris est utilisé pour la couleur du drapeau tracé avec \verb|\greenflag| ainsi que pour la flèche se trouvant au bas des blocs de répétition. La valeur est ramenée si nécessaire dans l'intervalle [0 ; 1]. \exemple/\begin{scratch}[print,fill blocks,fill gray=0.66] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \begin{scratch}[print,fill blocks,fill gray=0.33,text color=white,flag gray=0.66] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch}/ \cleval{line gray}{taux de gris} Lorsque \verb|print| est vrai, ce taux de gris est utilisé pour la couleur des lignes de relief. La valeur est ramenée si nécessaire dans l'intervalle [0 ; 1]. \cleval{num blocks}{booléen} Lorsque ce booléen est vrai, les blocs sont numérotés. \cleval{num sep}{dimension} Cette clé contient l'espacement entre les numéros de blocs et leur frontière gauche. La valeur est ramenée si nécessaire dans l'intervalle [0pt ; 1.5em]. \cleval{num start}{entier} Cette clé contient le premier numéro du bloc. La macro \verb|\numblock| est chargée d'imprimer les numéros de ligne. Elle admet un argument (le numéro de ligne) et permet, lorsqu'elle est redéfinie, de personnaliser la numérotation : choix de la couleur, de la police, de sa taille et des effets applicables à son argument. Par défaut, cette macro est définie par \begin{center} \verb|\newcommand*\numblock[1]{\color{black}\footnotesize\bfseries#1}| \end{center} Dans l'environnement \SCRATCH, entre des instructions \SCRATCH, on peut activer ou désactiver la numérotation \emph{pour le dessin en cours} à l'aide de \begin{center} \verb|\setscratch{num blocks=<booléen>}| \end{center} \exemple/\begin{scratch}[num blocks] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \renewcommand*\numblock[1]{\color{blue!80}\itshape#1} \begin{scratch}[num blocks,num start=3] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} puis \renewcommand*\numblock[1]{\fboxsep=0.5pt\fbox{\bfseries#1}} \begin{scratch}[num blocks=false] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \setscratch{num blocks=true} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch}/ \cleval{baseline}{alignement} Cette clé contient la consigne d'alignement du dessin tout entier, c'est-à-dire : \begin{itemize} \item la lettre «\verb|c|» auquel cas, le dessin est centré sur la ligne de base \item un entier qui spécifie un numéro de bloc existant : la numérotation est cohérente avec l'entier initial contenu dans la clé \verb|num start|. Dans ce cas, la ligne de base choisie est celle du texte contenu dans le bloc portant le numéro choisi. \end{itemize} \exemple/Défaut : \begin{scratch} \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} bloc 3 : \begin{scratch}[baseline=3] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch} centré \begin{scratch}[baseline=c] \blockinit{Quand \greenflag est cliqué} \blockpen{effacer tout} \blocksound{jouer le son \ovalsound*{Meow}} \blockmove{ajouter \ovalnum{5} à \ovalvariable{abscisse}} \end{scratch}/ \section{Mot de la fin} Le code de cette extension démontre mon immense ignorance de ti\textit kz/pgf et les méthodes de programmation qui lui sont propres que décidément, je ne comprendrai jamais! C'est sans doute le trop grand éloignement avec la logique de \TeX{} et la documentation de ti\textit kz/pgf, aussi indigeste qu'illisible, qui explique cette incompatibilité d'humeur et mon désintérêt à l'égard de ti\textit kz. Toujours est-il que cette extension fonctionne, avec une lenteur certaine que j'attribue autant à ma programmation hasardeuse qu'à la lenteur intrinsèque de ti\textit kz. Toute remarque, remontée de bug ---~je n'ose pas dire amélioration du code~---, demande d'implémentation de fonctionnalité est bien évidemment bienvenue; j'invite les utilisateurs à m'en faire part \emph{via} email à \texttt{unbonpetit@netc.fr} \section{Historique} \begin{version}{0.1}{19/02/2019} >Première version. \end{version} \begin{version}{0.11}{10/03/2019} >Correction d'un bug dans \verb|\scr_blockloop| : la couleur \verb|\scr_current_blockcolor| y est désormais définie; >Correction d'un bug dans \verb|\boolmoreblocks| : la couleur est correcte et \verb|rounded corners| désormais est nul pour le tracé d'un losange. \end{version} \begin{version}{0.12}{18/05/2019} >Correction d'un bug dans \verb|\ovalnum|; >Correction d'un bug dans \verb|\scr_ovalbox|. \end{version} \begin{version}{0.13}{01/07/2019} >Mise en place de \verb|\relax| pour éviter le bug de \verb|\lastkern| avec Xe\LaTeX. \end{version} \begin{version}{0.14}{01/10/2019} >Gestion de l'échelle (via clé "\texttt{scale}") améliorée. >Hors de l'environnement, les ovales et les losanges sont affectés par la clé "\texttt{scale}" si elle est spécifiée via \verb|\setscratch|. >Erreur de tracé corrigée dans \verb|\scr_blockloop|. >Nouveau losange vide : \verb|\boolempty[<dimension>]|. \end{version} \begin{version}{0.15}{05/03/2020} >Bug corrigé dans les blocs normaux: l'échelle est désormais réinitialisée si besoin. \end{version} \begin{version}{0.16}{20/03/2020} >Le bug corrigé dans la v0.15 est fautif, \verb|scr_scale| est désormais initialisée dans \verb|\initmoreblocks|. \end{version} \begin{version}{0.17}{27/04/2020} >Quelques petites modifications pour ne plus appeler aucune macro privée de simplekv et sa version 0.2. \end{version} \end{document}

http://edshare.soton.ac.uk/2427/1/MA309ex5_1.tex

soton.ac.uk

CC-MAIN-2022-05

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-05/segments/1642320301263.50/warc/CC-MAIN-20220119033421-20220119063421-00616.warc.gz

\documentclass[a4paper,12pt]{article} \begin{document} \parindent=0pt QUESTION List those residues mod 15 which are coprime with 15. Hence write down the value of $\phi(15)$ and check it against the formula obtained in cor.5.4. ANSWER We must omit all multiples of 3 and 5, so the remains residues are 1,2,4,7,8,11,13,14 showing that $\phi(15)=8$. The formula gives $\phi(15)=15\left(1-\frac{1}{3}\right)\left(1-\frac{1}{5}\right)=15\left(\frac{2}{3}\right)\left(\frac{4}{5}\right)=8$, agreeing with our previously obtained value. \end{document}

http://utam.gg.utah.edu/tutorials/example.tex

utah.edu

CC-MAIN-2017-39

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2017-39/segments/1505818689624.87/warc/CC-MAIN-20170923104407-20170923124407-00116.warc.gz

\documentstyle[12pt]{article} \input psfig.sty \setlength{\oddsidemargin}{.25in} \setlength{\evensidemargin}{.25in} \setlength{\topmargin}{0.0in} \setlength{\textwidth}{6.0in} \setlength{\textheight}{8.5in} \title{\bf An Example for UTAM Report\\} \author{Chaiwoot Boonyasiriwat} \begin{document} \date{\today} \maketitle \vspace{1cm} \begin{centering} \section*{ABSTRACT} \end{centering} Put your abstract here.\\\\ \begin{centering} \section*{INTRODUCTION} \end{centering} Put your introduction here. When you want to begin a new paragraph, just put a blank line in your latex file. This paragraph is an example.\\\\ \begin{centering} \section*{THEORY} \end{centering} Put your theory here. Here are some examples for putting some Math. symbols or equations. Example 1: $x = 10.$ Example 2: \[r_i = x_i^2 * y_i^2. \] Example 3: \begin{equation} f({\bf x}) = \left\{ \begin{array}{cl} 0 & ; ||{\bf x}||_2 = 0 \\ 1 & ; ||{\bf x}||_2 > 0 \end{array} \right\. \end{equation} \\\\ \begin{centering} \section*{RESULTS} \end{centering} Put your results here. Here is an example of how your can refer to your figure. Figure~\ref{vel} shows the Marmousi velocity model. By using the Latex reference, you don't have to worry about numbering your figures because it's automatic. \\\\ \begin{centering} \section*{SUMMARY} \end{centering} Put your summary here.\\\\ \begin{centering} \section*{ACKNOWLEDGMENTS} \end{centering} Put your acknowledgements here.\\\\ \begin{centering} \section*{REFERENCES} \end{centering} \begin{description}{\leftmargin 0.5in} \item Bregman, N. D., Bailey, R. C., and Chapman, C. H., 1989, Crosshole seismic tomography: Geophysics, Vol. 54, 200-215. \end{description} \begin{figure} \centerline{\psfig{figure=vel.eps,width=6.0in,height=3.0in}} \caption{Marmousi velocity model. Model dimension is $921 \times 301$. Spatial steps in X- and Z-coordinates are 10 meters.} \label{vel} \end{figure} \end{document}

http://acutrials.ocom.edu/search.php?sqlQuery=SELECT%20author%2C%20title%2C%20type%2C%20year%2C%20publication%2C%20abbrev_journal%2C%20volume%2C%20issue%2C%20pages%2C%20keywords%2C%20abstract%2C%20thesis%2C%20editor%2C%20publisher%2C%20place%2C%20abbrev_series_title%2C%20series_title%2C%20series_editor%2C%20series_volume%2C%20series_issue%2C%20edition%2C%20language%2C%20author_count%2C%20online_publication%2C%20online_citation%2C%20doi%2C%20serial%2C%20area%20FROM%20refs%20WHERE%20serial%20%3D%202327%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=20&rowOffset=&wrapResults=1&citeOrder=&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

ocom.edu

CC-MAIN-2019-47

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2019-47/segments/1573496668787.19/warc/CC-MAIN-20191117041351-20191117065351-00482.warc.gz

%&LaTeX \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{vonDeneen_etal2015} von Deneen, K. M., Wei Qin, Peng Liu, Minghao Dong, Peng Chen, Huisheng Xie, et al. (2015). Connectivity Study of the Neuromechanism of Acute Acupuncture Needling during fMRI in {\textquotedblleft}Overweight{\textquotedblright} Subjects. \textit{Evid Based Complement Altern Med}, , 1--12. \end{thebibliography} \end{document}

https://people.maths.bris.ac.uk/~matyd/GroupNames/289/C19sC16_sgps.tex

bris.ac.uk

CC-MAIN-2021-43

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-43/segments/1634323585305.53/warc/CC-MAIN-20211020090145-20211020120145-00590.warc.gz

\documentclass[11pt]{amsart} \usepackage{amssymb,tikz} \usetikzlibrary{positioning} \usepackage[colorlinks=false,urlbordercolor=white]{hyperref} \def\gn#1#2{{$\href{http://groupnames.org/\#?#1}{#2}$}} \def\gn#1#2{$#2$} % comment this line out to get html links \tikzset{sgplattice/.style={inner sep=1pt,norm/.style={red!50!blue},char/.style={blue!50!black}, lin/.style={black!50}},cnj/.style={black!50,yshift=-2.5pt,left=-1pt of #1,scale=0.5,fill=white}} \begin{document} \begin{tikzpicture}[scale=1.0,sgplattice] \node[char] at (1,0) (1) {\gn{C1}{C_1}}; \node[char] at (1.88,0.803) (2) {\gn{C2}{C_2}}; \node[char] at (0.125,0.803) (3) {\gn{C19}{C_{19}}}; \node[char] at (1.88,1.76) (4) {\gn{C4}{C_4}}; \node[char] at (0.125,1.76) (5) {\gn{C38}{C_{38}}}; \node[char] at (1.88,2.71) (6) {\gn{C8}{C_8}}; \node[char] at (0.125,2.71) (7) {\gn{C76}{C_{76}}}; \node at (1.88,3.66) (8) {\gn{C16}{C_{16}}}; \node[char] at (0.125,3.66) (9) {\gn{C152}{C_{152}}}; \node[char] at (1,4.46) (10) {\gn{C19:C16}{C_{19}{\rtimes}C_{16}}}; \draw[lin] (1)--(2) (1)--(3) (2)--(4) (2)--(5) (3)--(5) (4)--(6) (4)--(7) (5)--(7) (6)--(8) (6)--(9) (7)--(9) (8)--(10) (9)--(10); \node[cnj=8] {19}; \end{tikzpicture} \end{document}

http://dlmf.nist.gov/1.9.E22.tex

nist.gov

CC-MAIN-2017-17

application/x-tex

crawl-data/CC-MAIN-2017-17/segments/1492917122174.32/warc/CC-MAIN-20170423031202-00465-ip-10-145-167-34.ec2.internal.warc.gz

\[\mathop{\cos\/}\nolimits n\theta+i\mathop{\sin\/}\nolimits n\theta=(\mathop{% \cos\/}\nolimits\theta+i\mathop{\sin\/}\nolimits\theta)^{n},\]

http://people.eecs.berkeley.edu/~russell/slides/chapter14.tex

berkeley.edu

CC-MAIN-2018-05

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-05/segments/1516084886815.20/warc/CC-MAIN-20180117043259-20180117063259-00679.warc.gz

\documentstyle[fleqn,epsf,aima-slides]{article} \begin{document} \begin{huge} \titleslide{Uncertainty}{Chapter 14} \sf %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Outline} \blob Uncertainty \blob Probability \blob Syntax \blob Semantics \blob Inference rules %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Uncertainty} Let action $A_t$ = leave for airport $t$ minutes before flight\\ Will $A_t$ get me there on time? Problems:\al 1) partial observability (road state, other drivers' plans, etc.)\al 2) noisy sensors (KCBS traffic reports)\al 3) uncertainty in action outcomes (flat tire, etc.)\al 4) immense complexity of modelling and predicting traffic Hence a purely logical approach either\\ \phantom{or }1) risks falsehood: ``$A_{25}$ will get me there on time''\\ or 2) leads to conclusions that are too weak for decision making:\nl ``$A_{25}$ will get me there on time if there's no accident on the bridge\nl and it doesn't rain and my tires remain intact etc etc.'' ($A_{1440}$ might reasonably be said to get me there on time\\ but I'd have to stay overnight in the airport $\ldots$) %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Methods for handling uncertainty} \u{Default} or \u{nonmonotonic} logic:\al Assume my car does not have a flat tire\al Assume $A_{25}$ works unless contradicted by evidence\\ Issues: What assumptions are reasonable? How to handle contradiction? \u{Rules with fudge factors}:\al $A_{25} \mapsto_{0.3}$ get there on time\al $Sprinkler \mapsto_{0.99} WetGrass$\al $WetGrass \mapsto_{0.7} Rain$\\ Issues: Problems with combination, e.g., $Sprinkler$ causes $Rain$?? \u{Probability}\al Given the available evidence,\nl $A_{25}$ will get me there on time with probability 0.04\\ Mahaviracarya (9th C.), Cardamo (1565) theory of gambling (\u{Fuzzy logic} handles {\em degree of truth} NOT uncertainty e.g.,\al $WetGrass$ is true to degree 0.2) %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Probability} Probabilistic assertions {\em summarize} effects of\al \u{laziness}: failure to enumerate exceptions, qualifications, etc.\al \u{ignorance}: lack of relevant facts, initial conditions, etc. \u{Subjective} or \u{Bayesian} probability:\\ Probabilities relate propositions to one's own state of knowledge\nl e.g., $P(A_{25} | \mbox{no reported accidents}) = 0.06$ These are \u{not} assertions about the world Probabilities of propositions change with new evidence:\nl e.g., $P(A_{25} | \mbox{no reported accidents},\ \mbox{5 a.m.}) = 0.15$ (Analogous to logical entailment status $KB \models \alpha$, not truth.) %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Making decisions under uncertainty} Suppose I believe the following: \begin{eqnarray*} P(A_{25}\mbox{ gets me there on time} | \ldots) &=& 0.04 \\ P(A_{90}\mbox{ gets me there on time} | \ldots) &=& 0.70 \\ P(A_{120}\mbox{ gets me there on time} | \ldots) &=& 0.95 \\ P(A_{1440}\mbox{ gets me there on time} | \ldots) &=& 0.9999 \end{eqnarray*} Which action to choose? Depends on my \u{preferences} for missing flight vs. airport cuisine, etc. \u{Utility theory} is used to represent and infer preferences \u{Decision theory} = utility theory + probability theory %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Axioms of probability} For any propositions $A$, $B$ 1. $0 \leq P(A) \leq 1$\\ 2. $P(True) = 1$ and $P(False) = 0$\\ 3. $P(A \lor B) = P(A) + P(B) - P(A\land B)$ \vspace*{0.2in} \epsfxsize=0.45\textwidth \fig{\file{figures}{axiom3-venn.ps}} de Finetti (1931): an agent who bets according to probabilities that violate these axioms can be forced to bet so as to lose money regardless of outcome. %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Syntax} Similar to propositional logic: possible worlds defined by assignment of values to \u{random variables}. \u{Propositional} or \u{Boolean} random variables\al e.g., $Cavity$ (do I have a cavity?)\\ Include propositional logic expressions\al e.g., $\lnot Burglary \lor Earthquake$ \u{Multivalued} random variables\al e.g., $Weather$ is one of $\<sunny,rain,cloudy,snow\>$\\ Values must be exhaustive and mutually exclusive Proposition constructed by assignment of a value:\al e.g., $Weather \eq sunny$; also $Cavity \eq true$ for clarity %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Syntax contd.} \u{Prior} or \u{unconditional probabilities} of propositions\al e.g., $P(Cavity) = 0.1$ and $P(Weather \eq sunny) = 0.72$\\ correspond to belief prior to arrival of any (new) evidence \u{Probability distribution} gives values for all possible assignments:\al $\pv(Weather) = \<0.72,0.1,0.08,0.1\>$ (\u{normalized}, i.e., sums to 1) \u{Joint probability distribution} for a set of variables gives\\ values for each possible assignment to all the variables\al $\pv(Weather,Cavity)$ = a $4 \times 2$ matrix of values: \[\begin{array}{l|cccc} \hfil Weather \eq & sunny & rain & cloudy & snow \\ \hline Cavity \eq true & & & & \\ Cavity \eq false & & & & \end{array}\] %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Syntax contd.} \u{Conditional} or \u{posterior probabilities}\al e.g., $P(Cavity | Toothache) = 0.8$\al i.e., \u{\u{given that $Toothache$ is all I know}} Notation for conditional distributions:\al $\pv(Weather | Earthquake)$ = 2-element vector of 4-element vectors If we know more, e.g., $Cavity$ is also given, then we have\al $P(Cavity | Toothache,Cavity) = 1$\\ Note: the less specific belief {\em remains valid} after more evidence arrives, but is not always {\em useful} New evidence may be irrelevant, allowing simplification, e.g.,\al $P(Cavity | Toothache,49ersWin) = P(Cavity | Toothache) = 0.8$\\ This kind of inference, sanctioned by domain knowledge, is crucial %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Conditional probability} Definition of conditional probability: \[ P(A|B) = \frac{P(A\land B)}{P(B)} \mbox{ if } P(B) \neq 0 \] \u{Product rule} gives an alternative formulation:\al $P(A\land B) = P(A|B)P(B) = P(B|A)P(A)$ A general version holds for whole distributions, e.g.,\al $\pv(Weather,Cavity) = \pv(Weather|Cavity) \pv(Cavity)$\\ (View as a $4\times 2$ set of equations, {\em not} matrix mult.) \u{Chain rule} is derived by successive application of product rule:\al $\pv(X_1,\ldots,X_n) = \pv(X_1,\ldots,X_{n-1})\ \pv(X_n | X_1,\ldots,X_{n-1})$\nl = $\pv(X_1,\ldots,X_{n-2})\ \pv(X_{n_1} | X_1,\ldots,X_{n-2})\ \pv(X_n | X_1,\ldots,X_{n-1})$\nl = $\ldots$\nl = $\myprod_{i\eq 1}^n \pv(X_i | X_1,\ldots,X_{i-1})$ %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Bayes' Rule} Product rule $P(A\land B) = P(A|B)P(B) = P(B|A)P(A)$ \[ {}\implies \mbox{\u{Bayes' rule }} P(A|B) = \frac{P(B|A)P(A)}{P(B)} \] Why is this useful??? For assessing \u{diagnostic} probability from \u{causal} probability: \[ P(Cause|Effect) = \frac{P(Effect|Cause)P(Cause)}{P(Effect)} \] E.g., let $M$ be meningitis, $S$ be stiff neck: \[ P(M|S) = \frac{P(S|M)P(M)}{P(S)} = \frac{0.8 \times 0.0001}{0.1} = 0.0008 \] Note: posterior probability of meningitis still very small! %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Normalization} Suppose we wish to compute a posterior distribution over $A$\\ given $B\eq b$, and suppose $A$ has possible values $a_1 \ldots a_m$ We can apply Bayes' rule for each value of $A$:\al $P(A\eq a_1|B\eq b) = P(B\eq b|A\eq a_1)P(A\eq a_1)/P(B\eq b)$\al $\ldots$\al $P(A\eq a_m|B\eq b) = P(B\eq b|A\eq a_m)P(A\eq a_m)/P(B\eq b)$\\ Adding these up, and noting that $\mysum_i P(A\eq a_i|B\eq b) = 1$: \[1/P(B\eq b) = 1/\mysum_i P(B\eq b|A\eq a_i)P(A\eq a_i)\] This is the \u{normalization factor}, constant w.r.t.~$i$, denoted $\alpha$: \[ \pv(A|B\eq b) = \alpha \pv(B\eq b | A)\pv(A) \] Typically compute an unnormalized distribution, normalize at end\al e.g., suppose $\pv(B\eq b | A)\pv(A) = \<0.4,0.2,0.2\>$\nl then $\pv(A|B\eq b) = \alpha \<0.4,0.2,0.2\> = \frac{\<0.4,0.2,0.2\>}{0.4+0.2+0.2} = \<0.5,0.25,0.25\>$ %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Conditioning} Introducing a variable as an extra condition: \[ P(X|Y) = \mysum_z P(X|Y,Z\eq z) P(Z\eq z|Y) \] Intuition: often easier to assess each specific circumstance, e.g.,\\ $P(RunOver|Cross)$\al = $P(RunOver|Cross,Light\eq green)P(Light\eq green|Cross)$\al + $P(RunOver|Cross,Light\eq yellow)P(Light\eq yellow|Cross)$\al + $P(RunOver|Cross,Light\eq red)P(Light\eq red|Cross)$ When $Y$ is absent, we have \u{summing out} or \u{marginalization}: \[ P(X) = \mysum_z P(X|Z\eq z) P(Z\eq z) = \mysum_z P(X,Z\eq z) \] In general, given a joint distribution over a set of variables, the distribution over any subset (called a \u{marginal} distribution for historical reasons) can be calculated by summing out the other variables. %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Full joint distributions} A \u{complete probability model} specifies every entry in the joint distribution for all the variables $\mbf{X} = X_1,\ldots,X_n$\\ I.e., a probability for each possible world $X_1\eq x_1,\ldots,X_n\eq x_n$ (Cf. complete theories in logic.) E.g., suppose $Toothache$ and $Cavity$ are the random variables: \[\begin{array}{l|cc} & Toothache\eq true & Toothache\eq false \\ \hline Cavity \eq true & 0.04 & 0.06 \\ Cavity \eq false & 0.01 & 0.89 \end{array}\] Possible worlds are mutually exclusive $\implies$ $P(w_1 \land w_2) = 0$\\ Possible worlds are exhaustive $\implies$ $w_1 \lor \cdots \lor w_n$ is $True$\nl hence $\mysum_i P(w_i) = 1$ %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Full joint distributions contd.} 1) For any proposition $\phi$ defined on the random variables\nl $\phi(w_i)$ is true or false 2) $\phi$ is equivalent to the disjunction of $w_i$s where $\phi(w_i)$ is true Hence $P(\phi) = \mysum_{\{w_i:\ \phi(w_i)\}} P(w_i)$ I.e., the unconditional probability of any proposition is computable as the sum of entries from the full joint distribution Conditional probabilities can be computed in the same way as a ratio: \[ P(\phi|\xi) = \frac{P(\phi\land \xi)}{P(\xi)} \] E.g., \[ P(Cavity |Toothache) = \frac{P(Cavity \land Toothache)}{P(Toothache)} = \frac{0.04}{0.04+0.01} = 0.8 \] %%%%%%%%%%%% Slide %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \heading{Inference from joint distributions} Typically, we are interested in \al the posterior joint distribution of the \u{query variables} $\mbf{Y}$\al given specific values $\mbf{e}$ for the \u{evidence variables} $\mbf{E}$ Let the \u{hidden variables} be $\mbf{H} = \mbf{X} - \mbf{Y} - \mbf{E}$ Then the required summation of joint entries is done by summing out the hidden variables: \[ \pv(\mbf{Y}|\mbf{E}\eq \mbf{e}) = \alpha \pv(\mbf{Y},\mbf{E}\eq \mbf{e}) = \alpha \mysum_{\smbf{h}} \pv(\mbf{Y},\mbf{E}\eq \mbf{e},\mbf{H}\eq \mbf{h}) \] The terms in the summation are joint entries because $\mbf{Y}$, $\mbf{E}$, and $\mbf{H}$ together exhaust the set of random variables Obvious problems:\al 1) Worst-case time complexity $O(d^n)$ where $d$ is the largest arity\al 2) Space complexity $O(d^n)$ to store the joint distribution\al 3) How to find the numbers for $O(d^n)$ entries??? \end{huge} \end{document}

https://hashman.ca/tex/article.tex

hashman.ca

CC-MAIN-2018-51

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2018-51/segments/1544376828501.85/warc/CC-MAIN-20181217091227-20181217113227-00392.warc.gz

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % Sample assignment template with counters - article.tex % % By Elana Hashman for CUMC -- CCEM 2013, July 2013 % % % % Commercial use prohibited. For personal or non-commercial use only. % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentclass[10pt,english]{article} \usepackage[T1]{fontenc} \usepackage[latin9]{inputenc} \usepackage[letterpaper]{geometry} \geometry{verbose,bmargin=3cm,lmargin=2.75cm,rmargin=2.85cm} \usepackage{fancyhdr} \usepackage{lastpage} \usepackage{babel} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{mathrsfs} %% Automatic Problem Numbering \newcounter{pblm} \setcounter{pblm}{1} \newcommand{\problem}{{\bf Problem \arabic{pblm}. }\stepcounter{pblm}} \newcommand{\soln}{\emph{Solution.}} \pagestyle{fancy} \fancyhead[L]{Name Here} \fancyhead[c]{Course XXX -- Assignment X} \fancyhead[R]{\today} \cfoot{\thepage\ of \pageref{LastPage}} \setlength{\parindent}{0mm} \setlength{\parskip}{3mm} \setlength{\jot}{2mm} \begin{document} { \bf \Large Course XXX -- Assignment X.}\\ { \large Name Here \\[2mm] Due: \today} Acknowledgements: none?\\[2mm] \problem \soln\\ \problem \soln \end{document}

https://people.maths.bris.ac.uk/~matyd/GroupNames/320/C40.10C8_sgps.tex

bris.ac.uk

CC-MAIN-2021-25

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-25/segments/1623487629632.54/warc/CC-MAIN-20210617072023-20210617102023-00219.warc.gz

\documentclass[11pt]{amsart} \usepackage{amssymb,tikz} \usetikzlibrary{positioning} \usepackage[colorlinks=false,urlbordercolor=white]{hyperref} \def\gn#1#2{{$\href{http://groupnames.org/\#?#1}{#2}$}} \def\gn#1#2{$#2$} % comment this line out to get html links \tikzset{sgplattice/.style={inner sep=1pt,norm/.style={red!50!blue},char/.style={blue!50!black}, lin/.style={black!50}},cnj/.style={black!50,yshift=-2.5pt,left=-1pt of #1,scale=0.5,fill=white}} \begin{document} \begin{tikzpicture}[scale=1.0,sgplattice] \node[char] at (15.2,0) (1) {\gn{C1}{C_1}}; \node[norm] at (4.75,1.09) (2) {\gn{C2}{C_2}}; \node[char] at (11.8,1.09) (3) {\gn{C2}{C_2}}; \node[norm] at (25.8,1.09) (4) {\gn{C2}{C_2}}; \node[char] at (18.8,1.09) (5) {\gn{C5}{C_5}}; \node[char] at (9.38,2.93) (6) {\gn{C2^2}{C_2^2}}; \node[char] at (13.2,2.93) (7) {\gn{C4}{C_4}}; \node[char] at (21.1,2.93) (8) {\gn{C4}{C_4}}; \node at (1.62,2.93) (9) {\gn{C4}{C_4}}; \node at (28.9,2.93) (10) {\gn{C4}{C_4}}; \node[norm] at (5.5,2.93) (11) {\gn{C10}{C_{10}}}; \node[char] at (17.2,2.93) (12) {\gn{C10}{C_{10}}}; \node[norm] at (25,2.93) (13) {\gn{C10}{C_{10}}}; \node[norm] at (22,5.44) (14) {\gn{C8}{C_8}}; \node[norm] at (24.6,5.44) (15) {\gn{C8}{C_8}}; \node[norm] at (8.5,5.44) (16) {\gn{C2xC4}{C_2{\times}C_4}}; \node[char] at (13.9,5.44) (17) {\gn{C2xC4}{C_2{\times}C_4}}; \node[norm] at (3.12,5.44) (18) {\gn{C8}{C_8}}; \node[norm] at (27.4,5.44) (19) {\gn{C8}{C_8}}; \node[norm] at (5.88,5.44) (20) {\gn{C2xC4}{C_2{\times}C_4}}; \node[char] at (11.2,5.44) (21) {\gn{C2xC10}{C_2{\times}C_{10}}}; \node[char] at (19.2,5.44) (22) {\gn{C20}{C_{20}}}; \node[char] at (16.6,5.44) (23) {\gn{C20}{C_{20}}}; \node at (30,5.44) (24) {\gn{C20}{C_{20}}}; \node at (0.5,5.44) (25) {\gn{C20}{C_{20}}}; \node[char] at (18.8,8.38) (26) {\gn{C2xC8}{C_2{\times}C_8}}; \node[char] at (9.38,8.38) (27) {\gn{C4^2}{C_4^2}}; \node[char] at (14.1,8.38) (28) {\gn{C2xC8}{C_2{\times}C_8}}; \node at (28.1,8.38) (29) {\gn{C16}{C_{16}}}; \node at (0.125,8.38) (30) {\gn{C16}{C_{16}}}; \node at (2.38,8.38) (31) {\gn{C16}{C_{16}}}; \node at (30.4,8.38) (32) {\gn{C16}{C_{16}}}; \node[norm] at (4.75,8.38) (33) {\gn{C40}{C_{40}}}; \node[norm] at (23.4,8.38) (34) {\gn{C40}{C_{40}}}; \node[norm] at (25.8,8.38) (35) {\gn{C40}{C_{40}}}; \node[char] at (16.4,8.38) (36) {\gn{C2xC20}{C_2{\times}C_{20}}}; \node[norm] at (11.8,8.38) (37) {\gn{C2xC20}{C_2{\times}C_{20}}}; \node[norm] at (7.12,8.38) (38) {\gn{C2xC20}{C_2{\times}C_{20}}}; \node[norm] at (21.1,8.38) (39) {\gn{C40}{C_{40}}}; \node[char] at (16.9,11.2) (40) {\gn{C4xC8}{C_4{\times}C_8}}; \node at (7.25,11.2) (41) {\gn{C2xC16}{C_2{\times}C_{16}}}; \node at (23.2,11.2) (42) {\gn{C2xC16}{C_2{\times}C_{16}}}; \node[norm] at (0.875,11.2) (43) {\gn{C5:2C16}{C_5\rtimes_2C_{16}}}; \node[char] at (20,11.2) (44) {\gn{C2xC40}{C_2{\times}C_{40}}}; \node[norm] at (4.12,11.2) (45) {\gn{C5:2C16}{C_5\rtimes_2C_{16}}}; \node[norm] at (26.4,11.2) (46) {\gn{C5:2C16}{C_5\rtimes_2C_{16}}}; \node[char] at (13.6,11.2) (47) {\gn{C2xC40}{C_2{\times}C_{40}}}; \node[char] at (10.5,11.2) (48) {\gn{C4xC20}{C_4{\times}C_{20}}}; \node[norm] at (29.6,11.2) (49) {\gn{C5:2C16}{C_5\rtimes_2C_{16}}}; \node at (18.8,13.2) (50) {\gn{C16:5C4}{C_{16}\rtimes_5C_4}}; \node[norm] at (25.8,13.2) (51) {\gn{C2xC5:2C16}{C_2{\times}C_5\rtimes_2C_{16}}}; \node[char] at (11.8,13.2) (52) {\gn{C4xC40}{C_4{\times}C_{40}}}; \node[norm] at (4.75,13.2) (53) {\gn{C2xC5:2C16}{C_2{\times}C_5\rtimes_2C_{16}}}; \node[char] at (15.2,14.3) (54) {\gn{C40.10C8}{C_{40}._{10}C_8}}; \draw[lin] (1)--(2) (1)--(3) (1)--(4) (1)--(5) (2)--(6) (3)--(6) (4)--(6) (3)--(7) (3)--(8) (2)--(9) (4)--(10) (2)--(11) (5)--(11) (3)--(12) (5)--(12) (4)--(13) (5)--(13) (8)--(14) (8)--(15) (6)--(16) (10)--(16) (6)--(17) (7)--(17) (8)--(17) (7)--(18) (7)--(19) (6)--(20) (9)--(20) (12)--(21) (13)--(21) (6)--(21) (11)--(21) (12)--(22) (8)--(22) (12)--(23) (7)--(23) (13)--(24) (10)--(24) (9)--(25) (11)--(25) (14)--(26) (15)--(26) (17)--(26) (16)--(27) (17)--(27) (20)--(27) (17)--(28) (18)--(28) (19)--(28) (19)--(29) (18)--(30) (18)--(31) (19)--(32) (23)--(33) (18)--(33) (15)--(34) (22)--(34) (23)--(35) (19)--(35) (23)--(36) (17)--(36) (21)--(36) (22)--(36) (24)--(37) (16)--(37) (21)--(37) (25)--(38) (20)--(38) (21)--(38) (14)--(39) (22)--(39) (26)--(40) (27)--(40) (28)--(40) (28)--(41) (30)--(41) (31)--(41) (28)--(42) (29)--(42) (32)--(42) (30)--(43) (33)--(43) (34)--(44) (36)--(44) (26)--(44) (39)--(44) (31)--(45) (33)--(45) (35)--(46) (29)--(46) (35)--(47) (36)--(47) (28)--(47) (33)--(47) (36)--(48) (37)--(48) (27)--(48) (38)--(48) (35)--(49) (32)--(49) (40)--(50) (41)--(50) (42)--(50) (46)--(51) (47)--(51) (49)--(51) (42)--(51) (47)--(52) (48)--(52) (40)--(52) (44)--(52) (45)--(53) (47)--(53) (41)--(53) (43)--(53) (50)--(54) (51)--(54) (52)--(54) (53)--(54); \node[cnj=9] {2}; \node[cnj=10] {2}; \node[cnj=24] {2}; \node[cnj=25] {2}; \node[cnj=29] {5}; \node[cnj=30] {5}; \node[cnj=31] {5}; \node[cnj=32] {5}; \node[cnj=41] {5}; \node[cnj=42] {5}; \node[cnj=50] {5}; \end{tikzpicture} \end{document}

https://eden.one/tex/2180.tex

eden.one

CC-MAIN-2022-21

application/octet-stream

application/x-tex

crawl-data/CC-MAIN-2022-21/segments/1652662517018.29/warc/CC-MAIN-20220517063528-20220517093528-00151.warc.gz

\documentclass{mitschrift} \title{Die deutsche Sozialdemokratie} \author{Jan Bruners} \date{} \begin{document} \maketitle \tableofcontents \clearpage \section{Die Tradition des gemeinsamen Aufstiegs (1890–1914)} Die Sozialdemokratie entstand als „neue“ Partei in der zweiten Hälfte des 19. Jahrhunderts, wobei es in diesem Sinne kaum ältere Parteien gab. Zwar hatte es in verschiedenen Landesparlamenten schon seit 1816 Fraktionen gegeben, aber feste Parteistrukturen entwickelten sich erst im Parlament in der Frankfurter Paulskirche 1848. Der 1863 von Ferdinand Lassalle gegründete Allgemeine Deutsche Arbeiterverein besaß bereits eine kontinuierliche Parteiorganisation. Das war bereits ein großer Fortschritt gegenüber den unorganisierten politischen Bewegungen in den deutschen Fürstenstaaten. Die Arbeiterbewegung war damit Vorreiter der politischen Organisierung. Schon vor 1848 hatten sich Arbeiter gewerkschaftlich zusammengeschlossen und waren während der Revolution in deutschen Städten auf die Barrikaden gegangen. Die Restauration führte zu einer Rückdrängung dieser Entwicklung, unter anderem durch gerichtliche Verfahren wie den Kommunistenprozeß 1852 in Köln. Der Rheinländer Lassalle, ein Sohn reicher jüdischer Kaufleute aus Breslau, hatte früh erkannt, daß dem Bürgertum die Kraft zur revolutionären Umwälzung der Verhältnisse fehlte und setzte mit der Gründung seines Arbeitervereins politisch auf die Masse der Unterschicht. Der Handwerker August Bebel und der Bürger Karl Liebknecht folgten 1869 mit einer Parteigründung in Eisenach. 1876 fusionierten die beiden Arbeiterorganisationen in Gotha zur Sozialistischen Arbeiterpartei Deutschlands. Zwei Jahre später erließ der Reichskanzler Otto von Bismarck das Sozialistengesetz, das den Anhängern der Partei jede politische Propaganda verbot und sie als Reichsfeinde diffamierte. Bis zu seiner Aufhebung 1890 durch den Reichstag bewirkte das Gesetz vor allem eine Solidarisierung der verfolgten Arbeiter, so daß die SPD nach ihrer Wiederzulassung zur Reichstagswahl 1890 prozentual die meisten Stimmen erhielt. Allerdings blieb ihr politischer Einfluß durch das in den meisten deutschen Ländern geltende Dreiklassen-Wahlrecht weit hinter ihrem Stimmenanteil zurück. Auf ihrem Parteitag in Erfurt verabschiedete die SPD 1891 ein Parteiprogramm, das mit kleineren Modifikationen bis zum Parteitag von Bad Godesberg 1959 Bestand haben sollte. Den ersten Teil hatte Karl Kautsky in Anlehnung an das Kommunistische Manifest von Karl Marx und Friedrich Engels verfaßt. Er bestand in einer Analyse der ökonomischen, sozialen und politischen Situation als Begründung für die Existenz der SPD. Kautsky beschrieb die Zwangsläufigkeit der Monopolisierung, die Konzentration des Kapitals und die Entstehung von Klassengegensätzen. Aus diesen Entwicklungen müsse eine Krise der kapitalistischen Produktionsweise folgen. Als Beleg dienten ihm die krisenhaften Konjunkturschwankungen der frühen Industrialisierung. Der zweite Teil (formuliert von Eduard Bernstein) stellte eine stichwortartige Aufstellung der Ziele der SPD dar. Die Sozialdemokratie wolle den Klassenkampf zwischen Bourgeoisie und Proletariat politisch organisieren, um den Klassengegensatz und jede Art von Ausbeutung und Unterdrückung einer Klasse, einer Rasse oder eines Geschlechts zu beenden. Erstmals trat hier eine politische Gruppierung mit dem Anspruch an, ihre Ziele nicht nur für sich bzw. ihre Klientel, sondern für die gesamte Gesellschaft zu verwirklichen. Bernstein forderte im einzelnen ein allgemeines gleiches und geheimes Wahlrecht (auch für Frauen), die Schlichtung internationaler Konflikte durch Schiedsgerichte, Meinungs- und Versammlungsfreiheit, ein Ende der Diskriminierung der Frau, die Unentgeltlichkeit des Schuklunterrichts, der Lehrmittel und der Verpflegung in den Schulen, die Unentgeltlichkeit ärztlicher Hilfeleistungen, den Schutz der Arbeiterklasse (Einführung des 8-Stunden-Tages) und das Verbot der Kinderarbeit. Das theorielastige Erfurter Programm wurde rasch auch innerhalb der SPD kritisiert. Georg von Volmar, der Vorsitzende der bayerischen Sozialdemokraten, plädierte für einen Übergang von der Theorie zur Praxis und eine organische Entwicklung vom Alten zum Neuen. Auch Bernstein selbst distanzierte sich bereits fünf Jahre später von seinem Entwurf, zunächst durch Artikel in der „Neuen Zeit“ („Die Voraussetzungen des Sozialismus und die Aufgaben der Sozialdemokratie“), dann durch eine Unterstützung einer kritischen Resolution 1903 auf dem Parteitag in Dresden zu einer Resolution. Die Unterzeichner („Revisionisten“) forderten, den Begriff der Revolution zu überdenken, da sie nicht planbar sei und man zudem 1848 schlechte Erfahrungen mit ihr gemacht hatte. Auch die Katastrophentheorie, nach der die kapitalistische Ökonomie zum Untergang veruteilt sei, zweifelten sie an. Bernstein selbst verwies auf die historische Funktion des Wahlrechts und seine Bedeutung für die Durchsetzung sozialistischer Ziele; er plädierte für eine intensivere Arbeit vor Ort in den Kommunen. Die Resolution wurde mit großer Mehrheit abgelehnt, die Modernisierung der SPD scheiterte. Ein weiterer grundsätzlicher Streitpunkt war der Massenstreik. Ein Teil der Sozialdemokraten wollte die Eroberung parlamentarischer Machpositionen, die durch das Dreiklassen-Wahlrecht verhindert wurde, mit dem Mittel eines Generalstreiks erreichen. Während das Projekt auf dem Parteitag in Jena 1905 begeistert angenommen wurde, erhoben die Gewerkschaften, auf deren Unterstützung die Partei stark angewiesen war, Einspruch gegen die politische Instrumentalisierung ihres Kampfmittels. Daraufhin wurde die Idee fallengelassen, nur wenige führende Sozialdemokraten wie Bernstein und Rosa Luxemburg, aber auch der designierte Nachfolger August Bebels, der Mannheimer Ludwig Frank („Wahlrechtsreform oder Massenstreik“) hielten an dem Vorhaben fest. Der Wiederaufstieg demokratischen Denkens in Deutschland führte zu einem Zusammenschluß vieler Kleinparteien zur Deutschen Fortschrittspartei, die regional Bündnisse mit der SPD einging. Gleichzeitig gewann die SPD selbst immer breitere Zustimmung: 1890 erhielt sie 19,7\% der Stimmen (1,5 Mill. Wähler), 1912 waren es bereits 35\% (4,3 Mill.) oder 110 Reichstagsmandate; außerdem hatte sie 1 Million Mitglieder. Der Erfolg der SPD war auch eine eigene Nationalbewegung, d.h. eine Organisation der Bevölkerung als Nation zur Durchsetzung im eigenen Land. Lassalle hatte 1863 aus nationaldemokratischer Perspektive einen „Volksstaat“ angestrebt, sich aber gleichzeitig vom wilhelminischen Nationalismus – der ihn und seine Mitstreiter als „vaterlandslose Gesellen“ schmähte – abgegrenzt: Die Sozialdemokratie verstand sich als andere, aber nicht weniger partiotische Nation. Parallel dazu verlief die internationale Entwicklung. An der Zweiten Internationalen Arbeiterkonferenz 1889 in Paris nahmen Bebel, Liebknecht und der französische Sozialist Jean Jaurès teil. Ab 1907 war auch das Wettrüsten ein Thema der internationalen Arbeiterbewegung. Im katholisch geprägten Köln gab es eine späte sozialdemokratische Bewegung, die 1892 mit der Gründung der Rheinischen Zeitung begann. Um 1900 nahm die Zahl der SPD-Mitglieder langsam zu, 1906 organisierte man den Protest gegen das Dreiklassen-Wahlrecht und 1908 bereits öffentliche Demonstrationen. 1912 schließlich gelang es in Zusammenarbeit mit der liberalen Fortschrittspartei, das Reichstagsmandat für Adolf Hofrichter (SPD) zu erobern. Es entstand – nicht nur in Köln – eine eigene sozialdemokratische Kultur aus Partei, Gewerkschaften, der Konsum-Genossenschaft, Gesangs- und Turnvereinen und der Volksbühne („Von der Wiege bis zur Bahre“). Der gemeinsame Aufstieg stellt das „goldene“ Kapitel der sozialdemokratischen Geschichte dar. Alle Konflikte wurden intern ausgetragen und führten nicht zur Spaltung der Arbeiterbewegung. Die Arbeiter standen mit ihrer Aufbruchsstimmung nicht allein: Auch der deutsche Katholizismus wandte sich der sozialen Frage zu, es entstand ab 1865 eine zunächst bürgerliche Frauenbewegung, um 1900 auch eine Jugendbwegung, Wirtschaftsverbände und Sportvereine verschiedener Couleur wurden gegründet, und die europäischen Nationalstaaten griffen im Kolonialismus über Europa hinaus. \section{Deutsche Demokratie und sozialistische Revolution (1915–1920)} Seit dem Revisionismusstreit gab es innerhalb der SPD – trotz der Geschlossenheit nach außen – zwei unterschiedliche Zielvorstellungen: Die eine spekulierte auf den Zusammenbruch des kapitalistischen Systems und beinhaltete die revolutionäre Umwälzung der gesellschaftlichen Verhältnisse hin zum Sozialismus, die andere bestand in der sozialen Demokratisierung Deutschlands (z.B. durch die Reform des Wahlrechts). Gegen Ende des Ersten Weltkriegs war die SPD deshalb zwar in der Position, ihre Ziele verwirklichen zu können, es fehlte ihr aber an einer gemeinsamen Linie. Am Vormittag des 9. November 1918 besuchte eine Deputation der SPD-Mehrheitsfraktion im Reichstag den Reichskanzler Prinz Max von Baden und forderte von ihm die Regierungsvollmacht für die SPD. Der Kanzler gab nach und erteilte dem Sozialdemokraten Friedrich Ebert den Auftrag zur Regierungsbildung. Nachmittags kam es zu einer gewaltigen Demonstration von Arbeitern vor dem Reichstag, die in begeisterten Applaus ausbrachen, als Philipp Scheidemann von einem Fenster des Gebäudes aus die freie deutsche Republik verkündete. Scheidemann forderte die Demonstranten auf, sich ruhig zu verhalten und den Gegnern der Demokratie keinen Vorwand zum Eingreifen zu geben. Parallel zu dieser Machtübernahme durch die Mehrheits-SPD hatte Karl Liebknecht von der sozialistischen USPD von einem Balkon des Hohenzollern-Stadtschlosses die sozialistische Räterepublik verkündet. Während die Mehrheits-SPD sofort für ein paritätisches Kabinett der beiden Arbeiterparteien aussprach, zögerte die USPD. Während ihr Parteivorstand beriet, forderte Karl Liebknecht unumwunden alle Legislative und alle richterliche Gewalt für die Arbeiter- und Soldatenräte. Obwohl Liebknecht ein hohes Ansehen besaß, stimmte man ihm nicht sofort zu: Die Politiker fürchteten eine Konterrevolution angesichts dieses klaren Bekenntisses zum Bolschewismus. So war die SPD auf dem Gipfel ihrer Macht gespalten; sie hatte die politische Initiative gewonnen, dabei aber ihre Einigkeit verloren. Wie war es dazu gekommen? Im August 1914 hatte die SPD-Reichstagsfraktion gemeinsam mit den anderen Parteien für die Bewilligung von Kriegskrediten gestimmt, obwohl sie noch Wochen vorher Proteste gegen den Krieg organisiert hatte. Dieser scheinbare Widerspruch beruhte auf dem Unterschied zwischen internationalistischer Theorie und patriotischer Praxis. Ihr Fraktionssprecher Hase betonte, die Sozialdemokraten seien gegen den Krieg, ließen ihr Vaterland in der Not aber nicht im Stich. Auch SPD-Anhänger zogen deshalb – wenn auch weniger kriegsbegeistert als die bürgerlichen Schichten – als Kriegsfreiwillige ins Feld. Da sowohl Funktionäre als auch Wähler aus den unteren Schichten der Bevölkerung kamen und damit zu den einfachen Soldaten zählten, wurde die Partei durch den Krieg regelrecht ausgeblutet. In einigen Regionen brach die Parteiorganisation völlig zusammen, der Kölner Verband schrumpfte von 9000 Mitgliedern 1913 auf 2000 Mitglieder 1917). Zu dieser existentiellen Gefährdung kam eine Spaltung der Arbeiterbewegung. Das gemeinsame politische Programm, das schon die gegensätzlichen theoretischen Positionen berücksichtigen mußte, wurde nun durch die Umsetzung des „sozialdemokratischen Patriotismus“ zusätzlich strapaziert. Es ging um die Frage, ob die Fraktion aus Staatsräson die Reichsregierung in allen kriegswichtigen Fragen unterstützen müsse, oder ob sie auch hier politische Opposition leisten sollte. Ab 1915 eskalierte der Streit. Liebknecht und andere waren für eine konsequente Opposition angesichts der annktionistischen Tendenzen unter den bürgerlichen Parteien (z.B. in Belgien); Bernstein, Kautsky und Hase verfaßten eine entsprechende Denkschrift mit dem Titel „Das Gebot der Stunde“. Durch immer neue Kriegskredite wurde diese Position innerhalb der SPD gestärkt, bis im Winter 1915/6 eine Minderheit der Abgeordneten ihre Zustimmung zu weiteren Krediten verweigerte. Die Mehrheit reagierte im März 1916 mit dem Ausschluß der Abweichler aus der Fraktion, die im April 1917 in Gotha die Unabhängige SPD (USPD) gründeten. Nach der verlustreichen Schlacht von Verdun und dem Hungerwinter 1916/7 hatten die Streiks gegen den Krieg zugenommen, das Volk forderte nicht mehr den Sieg, sondern Frieden, Freiheit und Brot. Die Massenproteste, die ihren Ausgang mit einem Streik der Straßenbahnschaffnerinnen in Köln nahmen, fanden ihren Hphepunkt in den Munitionsarbeiterstreiks im Januar 1918. Außerdem konstituierte sich seit Ende 1917 Sowjetrußland, was auch auf die deutsche Arbeiterbewegung psychologische Auswirkung hatte, die von Lenin propagandistisch verstärkt wurden. Ende 1918 stand trotzdem eine Mehrheit der Bevölkerung hinter der Mehrheits-SPD, die den Ausbau der Demokratie vorantrieb. Mit ihren bürgerlichen Partnern vom linken Zentrum (Matthias Erzberger), von der Fortschrittspartei und sogar einem Teil der Nationalliberalen (Gustav Stresemann) setzten sie eine Wahlrechtsreform durch, die Umwandlung des Haushaltsausschusses in einen Hauptausschuß und die Einsetzung eines Verfassungsausschusses. Im Frühjahr 1917 verabschiedete eine interfraktionelle Initiative sogar eine Friedensresolution. Der militärische Zusammenbruch erfolgte im Juli 1918 nach einer letzten Offensive an der Westfront. Nun konnte die SPD ihre Bedingungen für eine Mitwirkung an den Waffenstillstandsverhandlungen formulieren, da die Alliierten nicht jede deutsche Regierung als Verhandlungspartner akzeptieren wollten. Schon vor dem 9. November wurden die Sozialdemokraten mit den Staatsekretären Scheidemann und Bauer an der Reichsregierung beteiligt. Die Jahre 1915 bis 1922 waren auch die Epoche der höchsten Politisierung der Arbeiterschaft. Deren Interesse für politische Fragen hatte sich vor dem Hintergrund des Aufstiegs und der Etablierung der SPD und ihrer Spaltung im Ersten Weltkrieg. Während das Erfurter Programm sowohl einen revolutionär-marxistischen als auch einen demokratisch-pragmatischen Teil enthielt, war revolutionäre Bestrebungen bis zum Beginn des Weltkriegs in den Hintergrund getreten. Nun brachte die Durchsetzung des Leninismus in Rußland den unbewältigten Marxismus wieder auf die Tagesordnung; sogar Bernstein, einer der führenden Revisionisten, trat der marxistischen USPD bei. Gleichzeitig mündete aber auch der von den bürgerlichen Schichten übernommene sozialdemokratische Patriotismus der Arbeiter in einen Kriegsnationalismus, dem im übrigen alle Schichten in Deutschland, auch Hochschulprofessoren und Geistliche, anhingen. Unter dem neuen Stichwort der „Volksgemeinschaft“ wurde ein innenpolitischer Burgfrieden verkündet, den Kaiser Wilhelm II. mit dem Ausspruch unterstrich, er kenne keine Parteien mehr, sondern nur noch Deutsche. Tatsächlich wurden die Sozialdemokraten in dem Maße, wie sie den Krieg unterstützten, auch politisch akzeptiert. Erst in der zweiten Hälfte des Krieges wurde die Lage der SPD schwieriger, da die ausgegrenzten Kritiker sich lautstark zu Wort meldeten. Am rechten politischen Rand formierte sich ein organisierter Nationalismus, der unter dem Namen Vaterlandspartei den bis dahin ideologiefreien Begriff „Vaterland“ mißbrauchte. Ohne auf das Modell der Oktoberrevolution von 1917 als politische Alternative einzugehen, übernahm die SPD in der Innen- und Außenpolitik die Initiative und setzte eine grundlegende demokratische Strukturreform durch. So konnte sie am 23. September nach dem militärischen Zusammenbruch im August selbstbewußt die Bedingungen für ihre Kooperation mit der Reichsregierung formulieren. Sie forderte ein Bekenntnis zur Friedenserklärung und den Beitritt zum Völkerbund, eine völlige Klärung der belgischen Frage und die Wiederherstellung von Serbien und Montenegro, Autonomie für das Elsaß, ein allgemeines, freies und gleiches Wahlrecht für Männer und Frauen, eine Ausschaltung der undemokratischen nebenregierungen von Kaiser und Militär, die vollständige Souveränität des Parlaments und die Durchsetzung der Bürgerrechte. Der relativ liberale Reichskanzler Prinz Max von Baden akzeptierte. Der Reichstag trat allerdings erst am 22. Oktober wieder zusammen. Friedrich Ebert erklärte in dieser Sitzung den Eintritt der SPD in die Reichsregierung und rechtfertigte ihn mit der Not des Vaterlandes, die Sozialdemokratie habe mit diesem Schritt nicht preisgegeben und stehe weiterhin zu ihren Idealen. Am 28. Oktober 1918 wurde eine neue monarchistische Verfassung verabschiedet, gleichzeitig kam in Berlin die 3. Wilson-Note zum Kaiserproblem an. Für die SPD-Führung überraschend, kam es zu einer Volksbewegung gegen die Verfassung, die von Matrosen in Wilhelmshaven und Kiel ausging. In Bayern wurde der Aufstand organisiert von Kurt Eisner, einem Einzelgänger innerhalb der SPD. Am 6. November fand eine Protestkundgebung von Matrosen auf der Münchner Theresienwiese statt, eine Resolution für den Weltfrieden wurde verabschiedet und ein Rat der Arbeiter und Soldaten konstituierte sich im Maximilianaeum mit dem Anspruch, den Bruderkrieg der Sozialisten in Bayern zu beenden. Einen Tag später rief Eisner den Freistaat Bayern aus, der Deutschland für den Völkerbund rüsten sollte. Ludwig III. verließ am selben Tag München und verzichtete auf seinen Thron. Am 9. November folgte Berlin dem Münchner Beispiel: Ebert wurde Reichskanzler, rechnete aber noch mit einer parlamentarischen Monarchie, Scheidemann rief die Republik aus, Liebknecht die sozialistische Räterepublik. Der am 10. November zusammengetretene Rat der Volksbeauftragten richtete am 12. November einen Aufruf an das deutsche Volk, den Sozialismus zu verwirklichen und die Spaltung der SPD zu überwinden. Eine vereinigte Bewegung von Mehrheits-SPD und USPD stellte diesen revolutionären Schub sicher. Von den Fürsten kam keinerlei Widerstand, sie verließen das Land. Ende 1918 wurden auf der Nationalen Konferenz der Arbeiter- und Soldatenräte sozialistische Reformen beschlossen, aber schon im Januar 1919 kam es durch die Gründung der KPD zu politischen Wirren und Straßenkämpfen. Die beunruhigte Mehrheits-SPD setzte Freikorps aus ehemaligen Frontsoldaten ein. Der zuständige Minister Noske war mit der Kontrolle dieser Verbände, die bald wahllos Parlamentarier und Genossen ermordeten, völlig überfordert. Am 19. Januar 1919 wurde dennoch die Republik bestätigt: Bei der Wahl zur Nationalversammlung erhielt die SPD 38\%, die USPD 7,5\%, die DDP 18,5\% und das Zentrum 20\% der Stimmen. Die demokratischen Parteien hatten damit eine Zweidrittelmehrheit. Wegen der Unruhen in Berlin wich die Nationalversammlung nach Weimar aus, wo sie Friedrich Ebert zum Reichspräsidenten wählte und eine SPD-Regierung unter Philipp Scheidemann bildete. Im Juni hielt die SPD ebenfalls in Weimar einen Parteitag ab, auf dem Eduard Bernstein seine Genossen aufforderte, die Mitschuld der deutschen Regierung am Ausbruch des Weltkrieges einzugestehen. Er appellierte an sie, ihren Patriotismus nicht mißzuverstehen und die Fehler der Reichsregierung im August 1914 nicht mitzutragen: „Macht Euch frei von den Ehrbegriffen der Bourgeoisie!“ Gegen diese Initiative gab es starken Widerstand von allen Seiten, allein der Delegierte Gustav Hoch plädierte für Bernsteins Auffassung, andere diffamierten seinen „Wahrheitsfimmel“. Den Versailler Vertrag wollte deshalb auch die Regierung unter Scheidemann nicht unterschreiben, sie trat geschlossen zurück. Das nachfolgende Kabinett mußte diese Aufgabe übernehmen. Im Herbst 1919 kam es zu einer „Welle von rechts“, unterstützt vom Feldmarschall Hindenburg, der vor dem Reichstagsausschuß die „Dolchstoßlegende“ entwickelte, nach der das deutsche Heer im Feld unbesiegt von deutschen Politikern zur Niederlage gezwungen worden sei. Mitte März 1920 kam es zum Kapp-Putsch unter Führung der Generäle Kapp und Lüttwitz, die mit Freikorps nach Berlin marschierten. Die Reichswehr verweigerte die Gefolgschaft („Reichswehr schießt nicht auf Reichswehr“) und die Regierung mußte nach Süddeutschland fliehen. Die Gewerkschaften unter der Führung von Karl Legien retteten die Republik, indem sie einen lückenlosen Generalstreik organisierten. Die Bedingungen für den Abbruch des Streiks waren die Rückkehr der Regierung und der Rücktritt Noskes als Kriegsminister. Das Kriegsministerium kam in bürgerliche Hände. In Köln war die Stimme der Sozialdemokratie ab 1915 mit der Rheinischen Zeitung neu erwacht, obwohl das Blatt sich zu Kriegsbeginn ebenfalls begeistert gegeben hatte. Ihre Forderung nach mehr Gerechtigkeit in der Verteilung der Kriegslasten führte zur Einrichtung einer kriegswirtschaftlichen Abteilung unter Konrad Adenauer. Mit Unterstützung des Journalisten Wilhelm Sollmann errichtete Adenauer eine Art „Kommunalsozialismus“. Sollmann sorgte auch für eine friedliche Durchsetzung der Revolution in Köln. Als am 7. November 1918 die ersten Matrosen aus Kiel am Kölner Hauptbahnhof ankamen und die Kölner Garnison eine MG-Kompanie an den Bahnhof beorderte, beruhigte er die Gemüter und erreichte auf einer friedlichen Kundgebung am nächsten Tag die Einsetzung eines Arbeiter- und Soldatenrates. Sogar der Feldmarschall Hindenburg lud den Kölner Journalisten ein und empfahl danach die Einrichtung von Räten nach Kölner Muster. Die größten Versammlungen in Köln waren eine vorweggenommene Demokratiefeier im Gürzenich am 23. Oktober 1918 und eine Demonstration gegen den Kapp-Putsch am 15. März 1920. \section[Die staatstragende Partei (1921–1944)]{Die staatstragende Partei in der Auseinandersetzung mit der totalen Opposition von links und rechts (1921–1944)} \subsection{Kampf um die Republik} Obwohl die Sozialdemokratie in der Weimarer Republik für den Erhalt der Demokratie stand und der erfolgreiche Generalstreik gegen den Kapp-Putsch im März 1920 die Zustimmung in der Bevölkerung zur Republik gezeigt hatte, verlor die SPD bei den Reichstagswahlen im Juni 1920. Im Vergleich zur Wahl der Nationalversammlung 1919 verlor sie 16 Prozentpunkte und erreichte nur 22\%, die USPD konnte dagegen ihr Ergebnis von 7\% auf 18\% steigern, die erstmals angetretene KPD erhielt 2\%. Die liberale DDP (Deutsche Demokratische Patei) sackte von 18\% auf 8\% ab, das Zentrum verlor durch die Abspaltung der Bayerischen Volkspartei 6 Prozenpunkte und erreichte 14\%. Bei den rechten Parteien steigerten sich Stresemanns DVP (Deutsche Volkspartei) von 4\% auf 14\%, die DNP (Deutsche Nationalpartei) von 5\% auf 15\%. Insgesamt wurden die Ränder des Parteienspektrums gestärkt. Die SPD gab ihre Führungsrolle an das koalitionsfähigere Zentrum ab, das von nun an die Regierung bildete. In der Oppositionsrolle (bis 1928) verfolgten die Sozialdemokraten einen Kurs der Tolerierung aus Gründen der Staatsräson (z.B. bei der Ruhrbesetzung 1923). 1924 erreichte die Partei bei den Reichstagswahlen mit 26\% wieder ein deutlich besseres Ergebnis. Der Grund für den Anstieg war die Änderung der Sozialstruktur von Mitgliedern und Wählern: Als staatstragende Kraft wurde die SPD auch für Bürgerliche, d.h. Angestellte und Beamte wählbar. Ausdruck dieser Veränderung war auch das auf dem Parteitag in Görlitz 1921 verabschiedete neue demokratisch-republikanische Parteiprogramm (federführend war Eduard Bernstein). Dagegen orientierte sich die abgespaltene USPD schon 1920 auf ihrem Parteitag in Halle nach links. Lenin forderte als Bedingung für einen Beitritt zur kommunistischen Internationale eine Unterordnung unter die russische KP und die Anerkennung der Diktatur des Proletariats. Nur wenige Stimmen sprachen sich für eine Bindung an die internationale Sozialdemokratie aus, die Mehrheit der Delegierten beschloß einen Beitritt zur KPD. Die Rückkehr einiger USPDler zur SPD wirkte sich auf das in Heidelberg 1925 verabschiedete Parteiprogramm aus: Die marxistischen Elemente wurden gestärkt. Die Selbstauflösung der USPD stärkte aber vor allem die KPD bei den Reichstagswahlen: 1924 konnten sie sich auf 12,5\% steigern (1928: 10\%, 1932: 17\%). Eine weitere linke Gruppierung war Leonard Nelson – Sozialistischer Jugendbund, der 1926 aus der Bewegung der Sozialdemokratie ausgeschlossen wurde und sich in Internationaler Sozialistischer Kampfbund (ISK) umbenannte. \subsection{Unter Hindenburg} Seit 1925 kam es wieder zu einem starken Druck der politisch Extremen und zu einer Militarisierung des politischen Lebens. Im politisch-geistigen Gesamtklima stand eine Kritik am „umständlichen“ Parlamentarismus im Vordergrund, die eine Radikalisierung und den Wunsch nach einem starken Führer förderte. Dies kam bei der Reichspräsidentenwahl 1925 zum Ausdruck. Der Kandidat des „Reichsblocks“, der 78-jährige ehemalige Feldmarschall Hindenburg, siegte im zweiten Wahlgang mit 14 Mill. Stimmen gegen den Kandidaten des „Volksblocks“ Wilhelm Marx (13,7 Mill.). Allerdings siegte Hindenburg nur, weil die Bayerische Volkspartei gegen den Willen des Zentrums seine Wahl empfahl und weil die KPD ihren Kandidaten Ernst Thälmann nicht zurückzog, der 2 Mill. Stimmen auf sich vereinigte. Der demokratiekritische und antisozialistische neue Reichspräsident und die ihn stützenden Parteien bemühten sich, die Stellung des Reichspräsidenten gegenüber dem Parlament zu stärken und die Möglichkeiten der Weimarer Verfassung in ihrem Sinne auszunutzen. Zur weitverbreiteten Demokratiemüdigkeit gab es bis Ende der 20er Jahre auch eine Gegenströmung, die die SPD 1928 in einer Koalition mit dem Zentrum, der DVP, der DDP und der bayerischen Volkspartei wieder in die Regierungsverantwortung brachte. Im gleichen Jahr wandte sich die Industrie gegen die Schlichtung von Tarifstreitigkeiten durch staatliche Institutionen und sperrte während des Ruhreisenstreits ihre Arbeiter im Ruhrgebiet aus. Dieser Konflikt führte im März 1930 zur Demission der Regierung, da die SPD die Regierungspolitik nicht mehr mittragen wollte. Später wurde den Sozialdemokraten der Vorwurf gemacht, sie hätten das für sie günstige Wahlergebnis nicht wirklich genutzt. In der Folge kam es zur Ausweitung der Präsidialherrschaft Hindenburgs unter Mitwirkung des Reichskanzlers Heinrich Brüning (Zentrum): Das neue Kabinett brachte im Juli 1930 ein Sozialgesetz ins Parlament ein, das abgelehnt wurde. Daraufhin erließ der Reichspräsident eine entsprechende Notverordnung, die ebenfalls abgelehnt wurde. Nach der Verfassung war damit die Ablehnung des Gesetzes endgültig, Hindenburg löste stattdessen den Reichstag auf und erließ das Gesetz erneut als Notverordnung. Auch hier zog sich die SPD zurück und reagierte auf den Verfassungsbruch nicht – wie von einigen gefordert – mit einem Massenstreik. Bei der folgenden Reichstagswahl im September konnte sich die rechtsextreme NSDAP (Nationalsozialistische Deutsche Arbeiterpartei) von 2,6\% (1928) auf 18\% steigern, allerdings hielten auch die demokratischen Parteien ihre Stimmenanteile. Die SPD konzentrierte sich nach dieser Wahl noch stärker auf die Tolerierung der Regierungspolitik, sie stimmte einem Mißtrauensantrag gegen den Reichskanzler Brüning nicht zu und enthielt sich bei Abstimmungen über Notverordnungen des Reichspräsidenten. Die Motive waren neben der Angst vor einer Ausweitung der Krise durch verfassungsfeindliche Parteien wie die NSDAP und der Gefahr der Radikalisierung durch Widerstand vor allem die Koalition von SPD und Zentrum in Preußen seit 1919: Die Sozialdemokraten wollten nicht auf Reichsebene gegen ihre Koalitionspartei agieren, und Preußen machte immerhin zwei Drittel des Reichsgebietes aus. Wegen der Zurückhaltung der wichtigsten Oppositionspartei nahm die Bedeutung des Reichstages in den Jahren 1930 bis 1932 auch rapide ab, 1932 wurden nur noch 13 Sitzungen abgehalten (1930: 90). Noch immer scheute die SPD vor einer Mobilisierung der Massen zurück. Bei der Wahl zum Reichspräsidenten 1932 trat gegen den amtierenden Hindenburg Adolf Hitler von der NSDAP an. Die SPD verzichtete auf einen eigenen Kandidaten und unterstützte Hindenburg schon im ersten Wahlgang. Im zweiten Wahlgang setzte dieser sich dann mit 53\% gegen Hitler (37\%) durch. Am 20. Juli 1932 rief der neue Reichskanzler Franz von Papen die preußischen Minister Braun und Severing zu sich und teilte ihnen ihre Basetzung mit. Preußen unterstellte er sich selbst, die preußische Polizei der Recishwehr. Der Anlaß für diesen Staatsstreich war der Wahlsieg der NSDAP bei der Preußenwahl im April 1932 und die Weigerung der Regierung Braun/Severing, zurückzutreten. Während die abgesetzten Minister an der Möglichkeit eines Massenprotests zweifelten sprachen sich Julias Leber, Carlo Mierendorf, Theordor Haubach und Kurt Schumacher für einen aktiven Kampf gegen rechts aus. \subsection{Nach dem 30. Januar 1933} Nachdem die SPD 1928 frühzeitig aus der Regierung ausgetreten war, den Verfassungsbruch 1930 hingenommen hatte, keinen Kandidaten zur Reichstagswahl aufgestellt hatte und keine Mobilisierung gegen den „Preußenschlag“ 1932 versucht hatte, war die Weimarer Republik Ende Januar 1933 am Ende. Nach der Ernennung Adolf Hitlers zum Reichskanzler durch Hindenburg am 30. Januar begann schon im Februar der Terror der Nationalsozialisten. Kätze Schlächter (geb. 1910), eine junge Arbeiterin aus Köln, die seit 1925 in der SPD engagiert war, beschreibt in ihren Erinnerungen die Aktionen gegen Demokraten. Die Rheinische Zeitung, wo sie als Sekretärin arbeitete, wurde am 9. März verboten, SA und SS konfiszierten sämtliches Eigentum der Redaktion, verhfatete und mißhandelte den Chefredakteur Wilhelm Sollmann und andere Redakteure. Schlächter selbst wurde von ihrem Vermieter zum Umzug gedrängt und traf sich mit Gesinnungsgenossen heimlich bei eine Schuster am Griechenmarkt. Die Atmosphäre war aufgeladen, der „deutsche Gruß“ bei Prozessionen von SA und SS war Pflicht. Trotz des systematischen Terrors erreichte die SPD bei den letzten „freien“ Reichstagswahlen am 5. März noch 18,2\%, die KPD 12,3\% und das Zentrum 11\%. Bei der Abstimmung über das Ermächtigungsgesetz kurz darauf lagen allerdings 26 von 110 sozialdemokratischen Abgeordneten mit schweren Verletzungen im Krankenhaus, sämtliche kommunistischen Abgeordneten waren im Gefängnis oder ebenfalls verletzt. Ein Antrag der SPD-Fraktion auf Freilassung der inhaftierten Kollegen wurde von der Parlamentsmehrheit abgelehnt. Vor der namentlichen Abstimmung hielt der Fraktionsvorsitzende Otto Wels eine Rede: „Freiheit und Leben kann man uns nehmen, die Ehre nicht“. Er schlug den Regierungsparteien NSDAP und DNVP vor, mit ihrer parlamentarischen Mehrheit von zusammen 51\% doch verfassungsgemäß zu regieren und appellierte an das Rechtsbewußtsein des Volkes, bekannte sich zum Rechtsstaat, zur Menschlichkeit und zur Freiheit. Hitler antwortete höhnisch und arrogant im Bewußtsein seiner Macht. Während der folgenden namentlichen Abstimmung standen SA-Männer hinter den Abgeordneten, trotzdem stimmten alle SPD-Vertreter mit nein, die übrigen Parteien stimmten zu. Am 1. Mai feierten nationalsozialistische Organisationen gemeinsam mit den Gewerkschaften den Tag der Arbeit, am nächsten Tag wurden die Gewerkschaftshäuser von der SA gestürmt. Viele Gewerkschafts- und SPD-Funktionäre flohen ins (noch nicht zum Reich gehörende) Saarland, darunter der SPD-Vorstand mit Otto Wels und Erich Ollenhauer. Mit dieser Begründung wurde die SPD am 22. Juni 1933 verboten. Innerhalb der Partei gab es eine lebhafte Diskussion um die Alternativen Widerstand oder Emigration. Mit der Illegalität wurde auch die Stärke der SPD, ihre gute Organisation, zerschlagen, eine sozialdemokratische Lebenskultur wurde unmöglich und die Emigration einiger Funktionsträger führte zum Kinflikt mit den Zurückbleibenden. Die Mehrheit der Mitglieder wählte die Strategie des „Überwinterns“, einige verleugneten aber auch irhe Zugehörigkeit oder wanderten zu anderen Parteien ab. Bei den letzten geheimen Wahlen der frühen Zeit des Regimes im April 1933 und 1935 (Betriebsratswahlen u.ä.) ergab sich ein negatives Bild für die NSDAP, die Ergebnisse durften nicht veröffentlicht werden. Allerdings hätte 1938 nach Meinung von Historikern auch eine freie Volkswahl eine große Mehrheit für Hitler ergeben. Widerstand wurde zunehmend schwierig, viele Verhaftungen schürten ein Klima der Angst. Der Exil-Vostand versuchte, die politische Arbeit durch Vertrauensleute an den Grenzen des Reichs fortzusetzen, allerdings war es schwierig, unverdächtige und gleichzeitig uninformierte Adressaten zu finden. Der offene Widerstand durch den Putschversuch am 20. Juli 1944 scheiterte. 1934 wich der Vorstand von Saarbrücken nach Prag aus und veröffentlichte das Prager Manifest, später ging man nach Paris und London. Dort wurden die Sozialdemokraten als „feindliche Ausländer“ teilweise interniert, erhielten aber auch Unterstützung durch die Fabian-Society und andere. Gute Verbindungen bestanden nach Schweden (wo sich Brandt, Wehner und Kreisky aufhielten) und in die USA. \section{Der Wiederbeginn in Köln (1945–1948)} Seit dem 6. März war das linksrheinische Köln in US-amerikanischer Hand, ab Anfang April auch die rechte Seite des Rheins. Die überlebenden Sozialdemokraten waren auf sich selbst gestellt, da die Strukturen auf Reichsebene während des Dritten Reiches völlig zerstört worden waren. Allein Werner Hansen war aus London schon vor der Ankunft der US-Armee in Köln eingeschleust worden. Die Stadt lag in Trümmern, der Militärkommandeur suchte deutsche Verbindungsleute eher bei den kirchlichen Stellen und politische Arbeit war untersagt. Man konzentrierte sich also zunächst auf praktische Aktivitäten wie die Versorgung, den Aufbau, Verhinderung von Plünderungen, die Verteilung von Wohnraum und den Umgang mit den Nazis. Antifaschistische Bürgerausschüsse wurden von Sozialdemokraten und Kommunisten initiiert. Dann begann die gewerkschaftliche Neuorganisation unter Hansen und Hans Böckler mit der Gründung von Betriebsräten. Eine linke und christliche Einheitsgwerkschaft wurde allerdings von den (seit Juni 1945) britischen Besatzern verhindert (erst 1950 wurde der DGB als Dachverband der Gewerkschaften gegründet). In der amerikanisch berufenen Stadtverwaltung unter dem Überbürgermeister Konrad Adenauer gab es keine Sozialdemokraten. Eine Kommission mit Werner Hansen, Viktor Agartz und Lies Hoffmann entwarf ein Programm, das eine übernationale staatliche Organisation forderte und marxistisch orientiert war. Als neues Parteiprogramm konnte sich der Entwurf nicht durchsetzen, Kurt Schumacher entschied, der Aufbau einer Parteiorganisation habe Vorrang. In Köln kümmerte sich Robert Görlinger um diese Aufgabe. In den westlichen Zonen waren in den ersten Monaten keine politischen Parteien erlaubt, im September 1945 wurde aber einem Antrag der SPD auf Legalisierung stattgegeben. Auch die bürgerliche Seite konstituierte sich rasch: Im November 1945 wurde in Bad Godesberg unter Führung des Berliners Andreas Ermes die CDU gegründet. Kurt Schumacher hielt am 11. November eine programmatische Rede in der Aula der Kölner Uni, ab März 1946 erschienen mit der Rheinischen Zeitung und der (kommunistischen) Volksstimme auch die ersten Zeitungen wieder. Am 20. Juni 1946 wurde ein Parteitag für den Bezirk Köln auf einem Rheindampfer abgehalten, auf dem die junge Generation noch fehlte. Aber bald setzte ein Zustrom aus den Mittelschichten ein, so daß die SPD in Köln Ende 1946 5500 Mitglieder zählte. Eine Restiution der sozialdemokratischen Kulturvereine scheiterte allerdings, aus der SPD wurde eine politische Aktionspartei. Zwar war die Partei wegen ihrer Aufbauarbeit sehr auf sich bezogen, aber Robert Görlinger prangerte unmittelbar nach seiner Rückkehr aus dem KZ die Benachteiligung der SPD auf kommunaler Ebene an. Seit dem Mai 1946 traten die Sozialdemokraten verstärkt mit Versammlungen in den einzelnen Stadtteilen hervor. Mit der KPD trat auch ihr alter Konkurrent wieder in Erscheinung. Sie konnte bei ihrer Reorganisation auf die Unterstützung durch das Berliner Komittee Freies Deutschland bauen und war in Ortsausschüssen stark vertreten. Die rheinischen Kommunisten betrachteten die Fusion von KPD und SPD in der SBZ im Frühjahr 1947 als Vorbild. Mit Reden von Pieck und Grotewohl im Rheinland warben sie um Unterstützung für diese Idee. Die SPD verhielt sich ablehnend, war aber gleichzeitig unsicher über das Stimmenpotential der KPD. Auch ihr neuer Gegner auf der Rechten, die CDU, irritierte die Sozialdemokraten: Konrad Adenauer, der in der Weimarer Republik mit der SPD zusammengearbeitet hatte, gab sich nun konservativ und antisozialistisch, das neugegründete Zentrum war zwar linker, aber auch erheblich schwächer als die Christdemokraten. Im März 1946 errang die CDU bei einer Volksabstimmung in Nordrhein-Westfalen über das künftige Schulsystem einen Erfolg über die Sozialdemokraren. Diese waren für eine Beibehaltung der im Dritten Reich eingeführten Einheitsvolksschule, während die CDU für konfessionelle Schulen plädierte und sich durchsetzte. Dieser Schock wurde durch den Ausgang der Kommunalwahlen am 13. Oktober 1946 verstärkt. Die CDU erhielt 53\% der Stimmen, die SPD nur 34\% und die KPD 9\%. Das Wahlergebnis wurde durch das damals geltende (britische) Mehrheitswahlrecht noch zugunsten des Wahlsiegers verschoben. Bei der Landtagswahl im April 1947 fielen die Sozialdemokraten weiter ab (30\%), während sich die KPD auf 17,5\% steigern konnte; Sieger blieb die CDU mit 46\%. Erst die Kommunalwahlen im Oktober 1948 brachten eine Veränderung zugunsten der SPD: mit 38\% schob sie sich an die CDU heran (42\%). Allerdings fehlte ihr weiterhin das Stimmenpotential der KPD (11\%). Erst nach dem KPD-Verbot 1956 war sie auf linker Seite konkurrenzlos und konnte z.B. in Köln mit dem Kandidaten Theo Burauen (46\%) einen klaren Sieg über die CDU (42\%) erringen. \section{Im Ost-West-Konflikt (1945–1949)} \subsection{Verfassung und Parteiverfassung} Nach dem Sieg der Alliierten über die deutsche Wehrmacht stellte sich für die überlebenden Sozialdemokraten die Frage nach der Art des Neubeginns: Sollte sich die SPD wieder- oder neubegründen? Hans Vogel verschickte schon am 16. März 1945 einen entsprechenden Brief an die Mitglieder des Exilvorstands. Die meisten lehnten eine Kontinuität ab, weil sie ihre eigene Legitimität bezweifelten und das Ende der Weimarer Republik als Symbol für ein Versagen der SPD betrachteten. Viele hofften auf eine „andere“ sozialistische Partei, als Vorbild galt ihnen die erfolgreiche Neugründung des bürgerlichen Lagers, die CDU. Deshalb wurde 1945 die faktische Kontinuität der SPD im Exil nicht zur Geltung gebracht. Stattdessen waren die antifaschistischen Ortsausschüsse in allen Besatzungszonen das wichtigste Betätigungsfeld für alte Sozialdemokraten. Das Denken ging in Richtung einer sozialistischen Einheitspartei. Nach dem 8. Mai 1945, als die Alliierten die politische Souveränität übernommen und das Ende des Deutschen Reiches als Staat besiegelt hatten, gab es grundsätzlich drei Zentren der Sozialdemokratie: den immer noch bestehenden Exilvorstand, der sich in London abwartend verhielt, das Büro Kurt Schumachers in Hannover und den Berliner Zentralausschuß mit Otto Grotewohl an der Spitze, dem schon im Juni 1945 die Wiederbegründung der SPD erlaubt wurde (die Sowjets förderten, im Gegensatz zu den Westmächten, die Gründung von Parteien). Die Folge war eine uneinheitliche Artikulation der SPD. Neben den Diskussionen um die Identität der Sozialdemokratie gab es auch die Bereitschaft zur Überwindung des alten SPD-KPD-Konflikts; die KPD selbst knüpfte an die Volksfront-Politik der 30er Jahre an und stellte die kommunistische Ideologie zurück. Als Ziel galt zunächst nicht die Vereinigung beider Parteien, sondern gemeinsame Wahlsiege. Nachdem die Kommunisten allerdings in den ersten Wahlen im sowjetisch besetzten Teil Europas erfolglos geblieben waren, steuerte Moskau um und forcierte vor allem in Deutschland eine Vereinigung von SPD und KPD. Ab dem September 1945 gab es Zusammenkünfte der Kommunisten mit dem sozialdemokratischen Zentralausschuß. Ein Treffen Grotewohls mit Schumacher im Februar 1946 blieb allerdings erfolglos, da die SPD in der SBZ immer mehr unter dem offenen Druck der sowjetischen Militäradministration stand und Schumacher sich vom sowjetischen Weg abgrenzte. Die Gründung der Sozialistischen Einheitspartei Deutschlands (SED) durch die Parteivorsitzenden Pieck (KPD) und Grotewohl (SPD) nahm die politische Spaltung Deutschlands schließlich vorweg, obwohl CDU und FDP noch gesamtdeutsche Parteien waren. Im Westen scheiterte das Projekt einer sozialistischen Einheitspartei, die SPD wurde die Konkurrenz durch die KPD erst in den 50er Jahren los. Dagegen setzte sich (anders als von den Briten gewünscht) eine Einheitsgewerkschaft durch, in der es eine starke Konkurrenz zwischen kommunistischen und sozialdemokratischen Funktionären gab. Schumachers innerparteiliches Konzept sah vor, die Spaltung der Arbeiterbewegung ohne eine Fusion (wie im Osten) zu überwinden und eine neue linke politische Plattform zu bilden. Schon im Mai 1945 bemühte er sich um eine prowestliche Position. Zwar definierte er Gesellschaften nach wie vor über Klassengegensätze, gleichzeitig sah er aber in der Nivellierung der Besitzverhältnisse durch das nationalsozialistische Regime und den Krieg ganz undogmatisch eine politische Chance: Die neue Klasse der Deposivierten und Verarmten stellte ein gewaltiges Wählerreservoir für die neue SPD als „große Partei aller Schaffenden“ dar. Man präsentierte das Programm eines demokratischen Sozialismus, der zwar auch national gestimmt war, sich aber scharf von jedem Nationalismus abgrenzte. Schumacher mahnte (wie auch Adenauer) die Suche nach einem europäischen Weg Deutschlands an. Die Öffnung der Partei für die Mittelschichten war demnach eine bewußte Formation als Sammelpartei. Obwohl die SPD unter Schumacher auch schon vor Godesberg keine dogmatische Positionsfestlegung betrieb und dadurch für die Klientel der früheren linksdemokratischen bürgerlichen Parteien wählbar wurde, verkörperte sie als einzige politische Gruppierung die Tradition der ersten deutschen Republik. Daraus leitete sie einen gewissen demokratischen Alleinvertretungsanspruch und ein starkes Selbstvertrauen ab. Gleichzeitig befand sie sich in mehreren Frontstellungen: am linken Rand zur KPD (und Stalins UDSSR), nach rechts zu den Besitzenden und ihren Parteien (CDU/CSU) und zusätzlich in existentiellen Fragen zu den Besatzungsmächten. Am 22. März 1933 hatte sich der SPD-Fraktionsvorsitzende im Reichstag, Otto Wels, vor der Abstimmung über das Ermächtigungsgesetz zur Weimarer Reichsverfassung bekannt und damit das demokratisch-republikanische Görlitzer Parteiprogramm von 1921 bekräftigt. Allerdings hatte das Rückströmen von USPD-Mitgliedern auf dem Heidelberger Parteitag 1925 eine Rückwendung zum Marxismus gebracht, an den das Prager Manifest des Exilvorstands 1934 anknüpfte. Auch das Manifest Carolo Mierendorfs vom Pfingstmontag 1943 rief zu einer sozialistischen Aktion gegen das Hitler-Regime durch christliche, sozialistische, kommunistische und liberale Kräfte auf und bezeichnete das arbeitende Volk als Grundelement der sozialistischen Ordnung. Nach 1945 wurde in Köln ein Programmentwurf erarbeitet („Unser Ziel heißt Revolution, nicht Restauration“), der die Idee einer sozialen Demokratie nach innen und einer europäischen Föderation nach außen vertrat. Bei den von den Alliierten in den Frankfurter Beschlüssen geforderten Beratungen über das Grundgesetz eines demokratischen und föderalen Weststaates aus den drei westlichen Besatzungszonen, der späteren Bundesrepublik Deutschland, beteiligte sich die Sozialdemokratie aktiv. Carlo Schmid (SPD) übernahm den Vorsitz des Hauptausschusses im Parlamentarischen Rat. Der Rat griff nicht, was naheliegend gewesen wäre, auf die Weimarer Verfassung zurück, stattdessen wurde ein vollständig neues „Grundgesetz“ formuliert. Trotz ihrer Mitarbeit am Aufbau eines neuen demokratischen Staatswesens betonte die SPD ausdrücklich den provisorischen Charakter des Grundgesetzes. Entsprechend wenig engagiert zeigte sie sich bei der Festlegung ihrer Ziele im Gesestzestext: Im fertigen Entwurf fehlten Garantien für soziale Grundrechte wie Arbeit und Wohnung. Von der SPD initiiert wurde dagegen die starke Position des Bundeskanzlers (man erwartete einen Wahlsieg bei den ersten Bundestagswahlen). Kurt Schumacher, der während der Beratungen wegen Krankheit gefehlt hatte, formulierte nachträglich sechs Bedingungen für die Zustimmung der SPD zum Grundgesetz, darunter die Betonung der Einheit trotz des föderalen Prinzips und die Prävalenz der Bundesregierung in der Finanzpolitik, und setzte diese Grundsätze auch gegenüber den Alliierten durch. \subsection{Die ersten Nachkriegswahlen} Der Aufbau der Partei war im Mai 1946 so gut wie abgeschlossen, gegen Ende des Jahres wurde der Stand von 1932 noch weit übertroffen (711.400 Mitglieder) und in den von den Alliierten eingesetzten kommunalen und zonalen Allparteienregierungen war die SPD überall präsent. Deshalb ging die SPD den ersten freien Wahlen zuversichtlich entgegen und wurde durch mehrere Niederlagen hart getroffen. Bei den Kommunal- und Kreistagswahlen im Herbst 1946 siegte die CDU/CSU teilweise mit großen Abstand (die einzige Ausnahme war West-Berlin): \begin{tabular}{l | c | c | c | c} & \multicolumn{2}{c}{Kommunalwahlen} & \multicolumn{2}{c}{Kreistagswahlen} \\ \hline & SPD & CDU & SPD & CDU \\ \hline britische Zone & 24\% & 28\% & 35\% & 46\% \\ US-Zone & 17\% & 35\% & 27\% & 62\% \\ französische Zone & 12\% & 46\% & 24\% & 61\% \\ West-Berlin & 48\% & 22\% & & \\ \end{tabular} Die Bevölkerung hatte das eindeutige Signal gegeben, daß der propagierte Alleinvertretungsanspruch ungerechtfertigt war. Der große Anspruch eines kraftvollen Neuanfangs entsprach nicht der Realität, viele Sozialdemokraten reagierten mit Resignation, einige – wie Schumacher – mit einem trotzigen „Jetzt erst recht!“. Der Versuch einer stärkeren Akzentuierung der sozialistischen Position führte zu einer strikt oppositionellen Hatung der SPD, in Abgrenzung von ihrer Tolerierungspolitik in Weimar. Eine Entschließung des SPD-Vorstands in Köln im September 1946, einen Monat nach den katastrophalen Wahlen, trug den Titel „Umkehr oder Untergang“. Das deutsche Volk wurde aufgerufen, sich für einen sozialistischen und demokratischen Neuaufbau und gegen einen weiteren kapitalistischen Irrweg zu entscheiden. \subsection{Die wirtschaftspolitische Position der SPD} Charakteristisch für die marxistischen Elemente auch des Nachkriegsprogramms war der angenommene Zusammenhang von politischer und wirtschaftlicher Macht. Nur durch die Umstrukturierung der Wirtschaft zu einer sozialistischen Planwirtschaft glaubte man einen neuen Faschismus verhindern zu können. Viktor Agartz, der auf dem ersten Parteitag 1946 die wirtschaftspolitische Führung übernahm, plädierte für die Enteignung bestimmter Industrien (aber nicht für ihre Verstaatlichung im Interesse einer Partei, wie vom Leninismus gefordert) und einen starken Staat als lenkende Institution. Gegen diese anfangs vorherrschende Meinung setzten sich gegen Ende der 40er Jahre die freiheitlichen Sozialisten durch, die Sozialismus nicht mit Sozialisierung gleichsetzten, aber noch mehr auf eine staatliche Lenkung vertrauten. Andererseits sahen sie auch die Notwendigkeit des Wettbewerbs und legten den Schwerpunkt auf genossenschaftliche Produktions- und Besitzformen. Auf dem zweiten Parteitag 1948 verdrängte der freiheitliche Rudolf Zorn Agartz von der wirtschaftspolitischen Wortführerschaft. Nach 1945 hofften viele europäische Völker auf den Sozialismus, auch in der deutschen CDU gab es einen sozialistischen Flügel. Noch 1945/6 erschien deshalb der Sozialismus auch in Westeuropa als Alternative zum kapitalistischen System. Erst der durch den staatlichen Dirigismus verursachte Hungerwinter 1946/7 brachte die Wende, hinzu kam der immer stärkere Wunsch nach Abgrenzung von der kommunistischen UDSSR und den Staaten des entstehenden Ostblocks. Besonders in der 1947 gegründeten Bizone setzten die gegenüber der britischen Labour-Regierung dominanten USA ihre wirtschaftspolitischen Vorstellungen durch, obwohl das Zentralamt für Wirtschaft der Bizone (das später in einen Wirtschaftsrat mit gewählten Direktoren umgewandelt wurde) zu Beginn unter der Leitung von Viktor Agartz stand. Auch viele Landesregierungen wurden noch von großen Koalitionen gebildet, in denen sozialdemokratische Wirtschaftspolitiker ihren Einfluß geltend machen konnten. Allerdings wurden Schumachers Hoffnungen auf eine Unterstützung der deutschen Sozialdemokraten durch Labour enttäuscht, der rechte Flügel der CDU und die unternehmerfreundliche FDP setzten sich durch. Die seit dem Februar 1947 tagende SPD-Kommission für Sozialisierung (Eisen, Chemie, Stahl, Kohle und Bankensektor) konnten ihre Vorschläge nicht als politische Direktive durchbringen, auch ein neuer Anlauf Konrad Deists 1953 scheiterte. Damit war das Ende der Sozialisierungsinitiativen gekommen. Einige parlamentarische Vorstöße in diese Richtung waren jeweils am Veto der Alliierten gescheitert. Auf die Konfrontation mit dem bürgerlichen Lager und den Verlust des Wirtschaftsamtes im Juni 1947 reagierte Schumacher mit einem politischen Amoklauf und der Ablehnung sämtlicher Ämter. Zu dieser Zeit entstand auch der politische Gegensatz von SPD und CDU, zumal der linke Flügel der Christdemokraten von Adenauer geschickt entmachtet wurde. Schumacher setzte auf eine Profilierung in der Opposition, wodurch der Weg frei wurde für die wirtschaftspolitischen Thesen von Ludwig Erhard. Im Parlamentarischen Rat verzichtete die SPD – wie bereits erwähnt – sogar auf wirtschaftspolitische Akzente, da sie das Grundgesetz nur als Provisorium betrachtete und noch immer mit einem Sieg bei den Bundestagswahlen rechnete. In den ersten Jahren der Bundesrepublik gab es zwei grundsätzliche und gegensätzliche wirtschaftspolitische Entscheidungen: dem Mitbestimmungsrecht der Arbeitnehmer in den Betrieben der Montanunion (1951) stand das unternehmerfreundliche Betriebsverfassungsgesetz (1952) gegenüber. Damit war die Sozialdemokratie in den Gründungsjahren einer neuen politischen Kultur mit ihrem wichtigsten Programmpunkt, der Sozialisierung, gründlich gescheitert. Mit ihrer Abgrenzung vom Staatskommunismus einerseits und dem Monopolkapitalismus amerikanischer Prägung andererseits hatte die SPD eine eigenständige Position in Europa und verfolgte dementsprechend auch einen dritten, europäischen Weg zwischen UDSSR und USA. Diese Linie wollte Schumacher vor allem durch die Einbindung der deutschen Sozialdemokraten in die Sozialistische Internationale unterstreichen, die ihm 1947 in Antwerpen gelang. 1951 konnte er als Gastgeber den Kongreß der Internationale in Frankfurt am Main eröffnen. \subsection{Die politische Entwicklung seit 1948} Mit der Gründung der britisch-amerikanischen Bizone im Januar 1947, dem Anlaufen des Marshallplans im Sommer 1947 und der letzten Außenministerkonferenz der vier Siegermächte Ende 1947 war die Gefahr einer dauerhaften deutschen Teilung immer deutlicher geworden. Die Londoner Konferenzen der Westmächte endeten mit dem Beschluß einer Währunsgreform in den Westzonen, worauf die UDSSR mit der Blockade Berlins reagierte. Daraufhin beschlossen die Westalliierten in den Frankfurter Dokumenten im Juni/Juli 1948 die Gründung eines gemeinsamen Weststaates. Die politische Entwicklung lief demnach gegen die Idee einer Wiedervereinigung, die auch Kurt Schumacher energisch vertrat. Allerdings glaubte auch er an die „Magnettheorie“, nach der ein wirtschaftlich und militärisch starker Westen den Osten vom demokratischen Weg überzeugen könne. Deshalb gab es in der SPD auch keine grundsätzliche Opposition gegen den Weststaat, wenn auch die Bundesrepublik regelmäßig als Provisorium bezeichnet wurde. Auch in den Begriffen schlug sich diese Haltung nieder: Nicht eine Nationalversammlung tagte, sondern ein Parlamentarischer Rat, keine Verfassung wurde beschlossen, sondern ein Grundgesetz, die SPD residierte nicht in einer Zentrale, sondern in Baracken in Bonn. Erst zum Schluß der Verhandlungen machte Schumacher seinen Einfluß geltend, um bestimmte Inhalte im Grundgesetz zu verankern. Bei der folgenden ersten Bundestagswahl siegte die CDU/CSU knapp mit 31,0\% vor der SPD mit 29,2\%. Für die siegessicheren Sozialdemokraten war dieses Ergebnis trotz der ernüchternden vorangehenden Wahlen ein erneuter Schock. Während sie politisch gelähmt waren, handelte Adenauer: Er setzte Theodor Heuss (FDP) als Bundespräsidenten durch, erreichte die Entscheidung für Bonn als Bundeshauptstadt und bildete eine bürgerliche Regierungskoalition mit sich selbst als Kanzler. Im Namen der hilflosen SPD hielt Schumacher dem Kanzler nach dessen Regierungserklärung vor, die Bundesrepublik drohe ein autoritärer Besitzverteidigungsstaat zu werden. Ebenso wie Fritz Erler wollte er mit der Sozialdemokratie gegen den Strom schwimmen und nicht – wie in Weimar – sich in nutzloser Toleranz üben. \section[Opposition (1949–1966)]{Opposition und Alternativen zur Politik Adenauers (1949–1966)} Die politischen Initiativen Adenauers lagen eindeutig im Bereich der Außenpolitik. Unmittelbar nach seinem Amtsantritt schloß er im Alleingang das umstrittene Petersberger Abkommen mit den Hohen Kommissaren der Alliierten, mit dem die Bundesrepublik eine Reihe von „Vorleistungen“ erbrachte. Die Strategie des Bundeskanzlers beruhte auf Vorleistungen, die dem neuen Staat das Wohlwollen seiner Nachbarn (und der Alliierten) sichern und so mit der Zeit zur Souveränität führen sollten. Wegen dieser als Preisgabe deutscher Interessen empfundenen Politik, aber auch wegen seiner eigenmächtigen Aktionen an Parlament und Kabinett vorbei wurde Adenauer auch von Parteifreunden kritisiert. Kurt Schumacher nannte den Kanzler in einer hitzigen Debatte sogar einen „Bundeskanzler der Alliierten“. Der SPD-Vorsitzende beharrte auf der Gleichberechtigung der Bundesrepublik in allen Verhandlungen und lehnte deshalb mehrere von Adenauer betriebene Projekte ab (1950 die Aufnahme der BRD in den Europarat, 1951 die Montanunion und den Schuman-Plan). Nach Ausbruch des Koreokrieges bot Adenauer den Westmächten im August 1950 die deutsche Wiederbewaffnung gegen die „kommunistische Bedrohung“ an, ohne sein eigenes Kabinett zu konsultieren. Währenddessen kämpfte Schumacher noch für die Wiedervereinigung, 1952 verlangte er eine offizielle Reaktion auf die Stalin-Noten, in denen der sowjetische Diktator ein vereinigtes, neutrales Deutschland anbot. Adenauer ignorierte diese Noten, da er um sein Ziel einer westlich integrierten Bundesrepublik fürchtete. Die Bundestagswahl 1953 bestätigte Adenauers Linie: Die CDU/CSU konnte sich auf 45\% steigern, während die SPD bei 29\% verharrte. Sowohl das politische als auch das ökonomische Klima im beginnenden Wirtschaftswunder waren gegen die SPD. Auch die Verunsicherung wegen der raschen Aufgabe des Saarlands durch Adenauer (die durch eine Volksabstimmung verhindert wurde) konnte der Sozialdemokratie nur auf kommunaler Ebene nutzen (in Köln stellte sie ab 1956 mit Theo Burauen den Oberbürgermeister). Die Bundesmacht von Adenauer war dagegen nicht zu erschüttern, 1957 gelang ihm mit 50,2\% die absolute Mehrheit, die SPD stiegerte sich lediglich auf 32\%, obwohl ihr Konkurrent, die KPD, mittlerweile verboten worden war. Angesichts ihrer pralamentarischen Machtlosigkeit versuchte die SPD sich in außerparlamentarischer Arbeit und mit Themen, die Adenauer vernachlässigte. Im Januar 1955 versammelten sich führende Sozialdemokraten in der Frankfurter Paulskirche und gaben ein „Deutsches Manifest“ gegen die militärische Blockbildung und für neue Verhandlungen über Deutschland heraus. Angesichts der nach dem Tod Stalins gewandelten Stimmung in der Fürhung der UDSSR und dem Staatsvertrag mit Österreich schien diese Initiative erfolgversprechend. Auch die Genfer Konferenz der Alliierten schürte die Hoffnung auf einer Wiedervereinigung. Tatsächlich war die Blockbildung 1955 nach dem Beitritt der BRD zur NATO und der DDR zum Warschauer Pakt bereits abgeschlossen, kurz darauf begann auch der Aufbau der Bundeswehr mit Zustimmung der SPD. Die aggressiv vorgetragene Forderung des Verteidigungsministers Franz-Josef Strauß (CSU), die neue deutsche Armee auch mit Nuklearwaffen auszustatten, sorgte allerdings für starken Widerstand. 18 berühmte Atomphysiker sprachen sich in der „Göttinger Erklärung“ gegen eine atomare Bewaffnung aus, die außerparlamentarische Kampagne „Kampf dem Atomtod“ fand großen Anklang. Die SPD-regierten Länder und Kommunen initiierten sogar eine Volksbefragung zum Thema, die Adenauer durch das Bundesverfassungsgericht unterbinden ließ. Aber auch die populäre Anti-Atom-Kampagne konnte die politischen Mehrheiten nicht verändern. Schließlich verabschiedete die Sozialdemokratie 1959 in Bad Godesberg ein neues Parteiprogramm, das die Nachkriegsentwicklung zusammenfaßte und sich endgültig vom Marxismus lossagte. Das mit 13 Druckseiten sehr knappe Werk enthielt einen geradezu lyrischen Vorspann, in dem der „Widerspruch unserer Zeit“ zwischen dem „Chaos der Selbstvernichtung“ und der „Hoffnung auf eine bessere Zeit“ beschrieben wurde. Eine neue und bessere Ordnung sollte durch den demokratischen Sozialismus ermöglicht werden. Das Programm grenzte sich ab vom früheren Dogmatismus und berief sich auf die christliche Ethik, die klassische Philosophie und den Humanismus; der Marxismus blieb unerwähnt. Trotz dieser Akzentuierung war Godesberg, wie gesagt, das Resümee einer Entwicklung, das Bekenntnis zur Demokratie und die Öffnung für alle Wählerschichten hatte sich bereits in den Jahren zuvor durchgesetzt. Auch die Schwellenängste zwischen der SPD und den Kirchen waren abgebaut worden. Wirklich neu waren nur das Bekenntnis zur Landesverteidigung (neben der Forderung nach Abrüstung und der Bildung einer internationalen Rechtsmacht) und die Zustimmung zur sozialen Marktwirtschaft. Godesberg zeitigte rasch Ergebnisse im politischen Verhalten der SPD: 1959 war das letzte Jahr der „Deutschlandpläne“ (die allerdings zeitgleich auch von der FDP und dem amerikanischen Außenminister entwickelt wurden). Herbert Wehner übernahm die Führung in der SPD-Bundestagsfraktion und brachte sie als „Zuchtmeister“ auf Adenauers Kurs der Westintegration. \section{Regierungspartei der Bundesrepublik (1966–1982)} Neben der Arbeit Wehners hatte auch der Politikwechsel in den USA 1959 nach die Wahl John F. Kennedys zum Präsidenten Auswirkungen auf die politische Situation der Sozialdemokraten. Die SPD nominierte mit Willy Brandt, dem erfolgreichen Bürgermeister von West-Berlin, erstmals einen Kanzlerkandidaten, der wie Kennedy in Amerika symbolhaft für die Verjüngung der Politik stehen sollte. Brandt, erreichte in der Bundestagswahl 1961 einen beachtlichen Zuwachs, dem 1966 ein verhältnismäßig kleiner Stimmengewinn folgte. Die Erfahrung, nicht völlig hilflos gegenüber der CDU-Vormachtstellung zu sein („Genosse Trend“), beflügelte die SPD und machte sie empfänglich für Wehners Werben um eine große Koalition. Der in Godesberg besiegelte Umschwung der SPD und die Anerkennung der Grundtatsachen bundesdeutscher Politik nach Adenauer erleichterte Wehners Arbeit. Auch die grundlegende Reform der Parteiorganisation 1958 (leitende Funktionäre wurden nicht mehr von der Partei besoldet, sondern finanzierten sich über Mandate) unterstützte die „Parlamentarisierung“ der Partei, d.h. ihre Orientierung an der Mitarbeit in parlamentarischen Gremien und letztlich Regierungen. Allerdings gab es trotz der straffen Führung durch den nach seinen Moskauer Erfahrungen völlig unideologischen Strategen noch starke Widerstände gegen ein Bündnis mit den als „Klassengegnern“ betrachteten bürgerlichen Christdemokraten. Der Weg zu einer großen Koalition führte über Geheimgespräche, die bereits seit 1962 unter der Führung Wehners und des Unionspolitikers Paul Lücke stattfanden. Die Spiegel-Affäre war ausschlaggebend für das Ende der Regierung Adenauer, kurz nach dem Rücktritt von Franz Josef Strauß (CSU) als Verteidigungsminister mußte auch Konrad Adenauer seinen Posten 1963 auf Druck seiner eigenen Partei aufgeben. Kanzler und Parteivorsitzender wurde der populäre Ludwig Erhard, dessen Kanzlerschaft Adenauer bis zuletzt zu verhindern versucht hatte. Erhard errang bei der Bundestagswahl 1965 erneut eine bürgerliche Mehrheit, zeigte sich aber während der leichten Konjunkturkrise 1966 überfordert und wurde von der eigenen Partei fallengelassen. Als Signal für die lange geplante große Koalition hatte sich im Sommer 1966 in Nordrhein-Westfalen eine sozialliberale Koalition unter Heinz Kühnen (SPD) gebildet. Nun folgte die Regierungsbeteiligung auf Bundesebene: In einer großen Koalition unter dem Bundeskanzler Kurt Georg Kiesinger (CDU) stellte die SPD den Außenminister und Vizekanzler Willy Brandt, den Wirtschaftsminister Karl Schiller und den Justizminister Gustav Heinemann. Der Eintritt in diese Regierung war vor allem unter jüngeren Sozialdemokraten, die die politische Programmatik über die „Fleischtöpfe der Macht“ stellten, sehr umstritten. Allerdings gelang es den sozialdemokratischen Ministern wie erhofft, in ihren Ressorts grundlegende Änderungen einzuleiten. Brandt leitete als Außenminister die spätere erfolgreiche neue Ostpolitik ein und wandte sich vorsichtig von der Hallstein-Doktrin ab. Bis zu diesem Zeitpunkt hatte die Bundesrepublik konsequent die diplomatischen Beziehungen zu jedem Land abgebrochen, das Beziehungen zur DDR aufnahm. Der Volkswirtschaftler Schiller arbeitete dank seines selbstdarstellerischen Talents sehr öffentlichkeitswirksam: Er prägte den Begriff der „konzertierten Aktion“ aller Tarifparteien und formulierte ein Haushaltsstabilitätsgesetz, das jede Regierung zu einem ausgeglichenen Haushalt verpflichtete. Heinemann setzte als Justizminister grundlegende Reformen in der Rechtsprechung und im Strafvollzug durch. Erstaunlich gut war auch das Zusammenspiel der Fraktionsvorsitzenden Helmut Schmidt (SPD) und Rainer Barzel (CDU), sowie des Wirtschaftsministers mit dem Finanzminister Srauß, der seine Rückkehr ins Kabinett durchgesetzt hatte. Die Regierung Kiesinger hatte sich zwei große Projekte vorgenommen, von denen nur das erste gelang. Die Verabschiedung von Notstandsgesetzen 1968, die bestimmte Grundrechte einschränkten und im Verteidigungsfall gelten sollten, führte zu einer breiten Widerstandsbewegung in der Bevölkerung (APO), obwohl sie unter Heinemanns Einfluß relativ liberal ausfielen. Die Wahlrechtsreform konnte nicht mehr in Angriff genommen werden, da die Bundestagswahl 1969 auch das Ende der großen Koalition bedeutete. Im April 1969 war Gustav Heinemann als Kandidat der SPD im dritten Wahlgang mit den Stimmen der FDP zum Bundespräsidenten gewählt worden, was er mit den Worten „Das war ein Stück Machtwechsel“ kommentierte. Im folgenden Bundestagswahlkampf errang Willy Brandt als Kandidat die Sympathien der Mittelschicht und vor allem der Intelligenz. Die Sozialdemokratische Wählerinitiative unter Führung des Schrifstellers Günter Grass bestand aus wenigen (parteilosen) Mitgliedern, hatte aber eine enorme Außenwirkung. Erstmals bekannten sich Wähler offen zu einer Partei und vor allem zur Person von Willy Brandt. Das Ergebnis der Wahl (SPD 42,7\%, CDU/CSU 46,1\%) war für die Sozialdemokraten erfreulich, aber nicht triumphal. Sensationell war dagegen der gemeinsame Auftritt von Brandt und Walter Scheel, dem Vorsitzenden der FDP, die am Wahlabend die Bildung einer sozialliberalen Koalition verkündeten. Dieser Überraschungscoup gegen den eigentlichen Wahlsieger, der allein fast gleichauf mit der Koalition lag, war äußerst mutig und riskant. Die Union hielt diesen Machtwechsel für illegitim und erkannte ihre Oppositionsrolle lange nicht an. Im Zentrum der neuen Regierungspolitik unter Bundeskanzler Brandt standen die Außen- und die Deutschlandpolitik. Kurz nach der Wahl kam es zu einer ersten Begegnung Brandts mit dem Ministerpräsidenten der DDR, Willy Stoph, in Erfurt und später zu einem Gegenbesuch Stophs in Kassel. Die Gespräche zeigten, daß die politischen Vorstellungen zu verschieden für einen Konsens waren. Eine große Leistung Brandts lag darin, dieses Problem zu erkennen und zu umgehen: Über einen Nichtsangriffspakt mit Moskau, die Anerkennung der Oder-Neiße-Grenze in Polen und einen Grenzvertrag mit der Tschechoslowakei bereitete er den Weg für eine Berlin-Konferenz der vier Aliierten. Deren Berlin-Abkommen 1971 enthielt auch den Auftrag an die deutschen Regierungen, einen Verkehrsvertrag auszuhandeln, der westdeutschen Bürgern den Zugang nach Berlin garantieren sollte. Dieser Grundlagenvertrag wurden 1972 geschlossen und 1973 vom Bundestag ratifiziert. Für seine Ostpolitik hatte Brandt im November 1971 den Friedensnobelpreis erhalten. Das Komitee honorierte damit die Verdienste des Bundeskanzlers um den Weltfrieden. Trotz dieser internationalen Unterstützung war der Grundlagenvertrag mit Ost-Berlin im Bundestag umstritten, die sozialliberale Regierungsmehrheit bröckelte, so daß die CDU-Opposition im April ihre Chance für ein konstruktives Mißtrauensvotum gekommen sah. Die Wahl Rainer Barzels zum neuen Kanzler scheiterte trotz einer rechnerischen Mehrheit aus ungeklärten Gründen, einen Tag später scheiterte die Regierung Brandt ebenfalls mit ihrem Haushaltsentwurf. Man einigte sich auf vorgezogene Neuwahlen im November 1972, die einen sensationellen Sieg der SPD brachten. Mit 45,8\% der Stimmen ließ sie die CDU/CSU (44,9\%) hinter sich und stellte mit Annemarie Renger erstmals die Bundestagspräsidentin. Nach diesem Erfolg fielen die Sozialdemokraten und Kanzler Brandt in eine merkwürdige Inaktivität, deren Gründe in einer Mischung aus persönlichen Problemen und Illoyalitäten lagen. Der Fraktionsvorsitzende Wehner äußerte sich ausgerechnet in Moskau abfällig über den Kanzler („Der Herr badet gerne lau.“), der Wirtschafts- und Finanzminister Schiller war bereits im Juli 1972 überraschend zurückgetreten. Zu diesen inneren Problemen kam im Herbst 1973 die weltweite Ölkrise. Als die Regierung bereits wieder Tritt gefaßt hatte, brachte die Kandidatur Scheels, der eine wichtige Stütze der Koalition bildete, für das Amt des Bundespräsidenten und die Enttarnung des DDR-Spions Günther Guillaume im Kanzleramt Brandt schließlich zu Fall. Ihm wurde später der Vorwurf gemacht, die Chancen des Wahlsiegs nicht genutzt und zu wenig Führungsstärke gezeigt zu haben. Gerade in diesen Punkten unterschied sich sein Nachfolger Helmut Schmidt vom Volkstribunen Brandt. Der Volkswirtschaftler und frühere Innensenator von Hamburg meisterte die politischen Herausforderungen seiner Amtszeit mit Zähigkeit und Durchsetzungskraft, entfernte sich dabei aber zunehmend von seiner Partei. Neben dem Terrorismus im „Deutschen Herbst“ 1977 war das vor allem die Weltwirtschaft nach der Ölkrise. Schmidt profilierte sich als Weltökonom und initiierte die Gipfeltreffen der mächtigsten Industriestaaten (G7). Auf europäischer Ebene setzte er 1979 die Direktwahl des europäischen Parlaments durch, das bis heute hauptsächlich durch seine fehlenden Kompetenzen auffällt. Außenpolitisch läutete er eine neue konfrontative Phase im Ost-West-Konflikt ein, als er auf eine russische Raketenentwicklung mit der Stationierung amerikanischer Pershing II-Raketen reagierte. Die sich gegen diese Beschlüsse formierende Friedensbewegung erhielt breiten Zulauf und zeigte, daß Schmidt die Stimmung falsch eingeschätzt hatte. Noch stärker vernachlässigte er die Meinungsbildung in der eigenen Partei. Auch der loyale Parteivorsitzende Brandt konnte schmerzhafte Niederlagen Schmidts auf Parteitagen nicht verhindern. Zum erzwungenen Rücktritt Schmidts führte allerdings die Entfremdung vom Koalitionspartner FDP, der einem Mißtrauensvotum der CDU 1982 zum Erfolg und Helmut Kohl zur Kanzlerschaft verhalf. Seit Ende der 50er Jahre bis zum Ende der 70er hatte sich die SPD in einem kontinuierlichen Aufwind befunden. Ab 1969 traten jährlich bis zu 100.000 Bürger in die Partei ein, 1976 hatte sich über eine Million Mitglieder. In der Folge waren bereits 1973 zwei Drittel der Mitglieder erst seit 1965 in der Partei aktiv. Die neue Struktur war durch drei Veränderungen gekennzeichnet: \begin{itemize} \item Statt der Arbeiter waren nun die neuen Mittelschichten (Angestellte) in der Mehrheit (34\% in der SPD gegenüber 23\% in der Gesamtbevölkerung \item Akademiker strömten überproportional zu den Sozialdemokraten (15\% in der SPD gegenüber 8\% in der Gesamtbevölkerung) \item Verjüngung: 1977 waren 30\% der Sozialdemokraten jünger als 34 und 41\% jünger als 44 Jahre. \item Auch die Abschaffung der Hauskassierer, die bisher den personalen Bezug sichergestellt hatten, änderte das Verhältnis der Partei zu ihren Mitgliedern. \end{itemize} Das Ende dieser Hochzeit der Sozialdemokratie in der Bundesrepublik ist zweifach zu datieren. Der Abstieg begann bereits Mitte der 70er Jahre, als die SPD in mehreren Landtagswahlen und in den Bundestagswahlen 1976 trotz einer stabilen Regierung Schmidt sehr schlecht abschnitt. Der Trend arbeitete nun gegen sie, die Union bekam dagegen erneut Zulauf vor allem von jungen Leuten. Die Kandidatur Franz Josef Strauß’ bei den nächsten Wahlen 1980 war bezeichnend, verhinderte allerdings auch den Sieg der Christdemokraten. Der CSU-Vorsitzende war auch einigen Konservativen zu rechts, vor allem aber bewirkte sein Auftritt noch einmal eine Stärkung und Sammlung der linken Kräfte. 1982 schließlich kam es zur berühmten „Wende“, als der CDU-Vorsitzende Helmut Kohl durch ein konstruktives Mißtrauensvotum mit den Stimmen der FDP zum Kanzler gewählt wurde. Das folgende christlich-liberale Kabinett folgte, was zehn Jahre zuvor noch undenkbar gewesen wäre, außenpolitisch weiterhin die Linien der Brandt’schen Ostpolitik. Auf diesem Feld hatten sich sozialdemokratische Vorstellungen durchgesetzt. Bundeskanzler Schmidt fehlte nicht nur die eindeutige Unterstützung seiner Partei, er war auch am Auftauchen neuer politischer Strömungen, die der SPD Wählerpotential entzogen, gescheitert. Die Grünen formierten sich Anfang der 80er Jahre aus Protest gegen die einseitig unternehmerfreundliche und unökologische Wirtschaftspolitik der Regierung und gegen Schmidts Nachrüstungspolitik im Ost-West-Konflikt. Vor allem der relativ glücklose Umgang mit den Jugendorganisationen hatte der SPD diese politische Niederlage beschert. Nachdem die SPD-nahen Studentenoragnisationen sich als zu radikal erwiesen hatten, konzentrierte man sich auf die Jungsozialisten (Jusos). Aber auch hier stieß die Politik der Führungsspitze auf Widerstand: auf einem Bundeskongreß der Jusos wurde der Vertreter des Vorstandes, Hans-Jürgen Wischnewski, ausgepfiffen und die Brandt-Regierung scharf kritisiert: Sie sei zu bürgerlich und vernachlässige den Klassenkampf. Die Delegierten forderten ein imperatives Mandat, d.h. die Bindung der Abgeordneten an einen konkreten Wählerauftrag und eine Doppelstrategie von parlamentarischer und außerparlamentarischer Arbeit. Auch in der Ostpolitik drängten sie auf weitergehende Entspannung, veranstalteten mehrere Treffen mit Vertretern der FDJ und nahmen an den Weltjugendfestspielen des Ostblocks teil. Die Form der politischen Auseinandersetzung änderte sich und nahm die Gestalt eines „Klassenkampfes“ zwischen den Generationen an. Von dieser scharfen Frontstellung von alten und jungen Sozialdemokraten profitierten die Grünen in ihren Anfangsjahren als linksalternative Partei. \section{„Sozialdemokratismus“ in Deutschland und Europa} Schon 1947 hatte die SPD auf ihrem Parteitag in Nürnberg mehrere Richtlinien für den Aufbau der deutschen Republik formuliert. Sie forderte, die Möglichkeit einer Zugehörigkeit Deutschlands zu einem europäischen Staatenbund und die Übertragung von Hoheitsrechten an internationale Organisationen in der Verfassung zu verankern. Weiterhin wurden Stabilität (mit dem Grundsatz des konstruktiven Mißtrauensvotums) und die finanzielle Eigenständigkeit der Länder betont. Krieg dürfe kein Mittel der Politik sein, sondern sollte in der Verfassung geächtet werden. Auf der Grundlage dieser Vorgaben entwickelte sich auch bei den Sozialdemokraten ein spezifisch westdeutsches nationales Sondergefühl, das Kurt Schumacher besonders verkörperte. Trotz seines nationalen Vorbehaltes, der die Hoffnung auf Wiedervereinigung nie aufgab, glaubte er an die „Magnetwirkung“ einer starken westdeutschen Wirtschaft, die den Osten vom demokratischen Weg überzeugen sollte. Nach Schumachers Tod lag die deutschlandpolitische Initiative vor allem bei der SED, während die westdeutsche Regierung unter Adenauer mit der Hallstein-Doktrin mauerte. Die neue Ostpolitik Brandts und seines Beraters Egon Bahr war vor allem durch die Einsicht geprägt, daß die Nachkriegswelt nur durch Kooperation zu gestalten sei. Nach dem Vorbild Kennedys und Chruschtschows, die zwei Wochen lang im amerikanischen Camp David diskutiert hatten, setzten die SPD-Politiker seit 1962 auf „Wandel durch Annäherung“. Ein 1966 begonnener Briefwechsel von SPD und SED, der zum Austausch von Rednern führen sollte, scheiterte zwar am KPD-Verbot in der Bundesrepublik (den kommunistischen Rednern drohte Gefängnis), verdeutlichte aber das gewandelte Klima. Vom Osten kamen weiterhin vernünftig klingende Vorschläge, aber erst der Kanzler Brandt konnte angemessen darauf reagieren und sich offiziell mit dem Ministerpräsidenten der DDR, Willy Stoph, treffen. Nach diesem Befreiungsschlag 1970 folgte eine längere politische Flaute, die zum Umweg über eine alliierte Berlin-Konferenz und schließlich 1972 zum Grundlagenvertrag mit der DDR führte. Nach dem Zusammenbruch des Ostblocks 1989/90 wurde der Sozialdemokratie oft vorgeworfen, durch ihre Annäherung und Anerkennung das Siechtum eines an sich todgeweihten Systems unnötig verlängert zu haben. Schon die Ausbürgerung von Wolf Biermann 1976 und der folgende Protest der kommunistischen Intelligenz in der DDR habe das Ende des ostdeutschen Staates besiegelt. Andererseits war der staatliche Durchbruch auch der Beginn einer zaghaften Annäherung auf privater Ebene. Obwohl Kanzler Schmidt sich erst 1981 zu einem Besuch in der DDR durchringen konnte, besuchten Westdeutsche in den 70er Jahren zunehmend die DDR und knüpften Kontakte. Nachdem der staatliche Dialog durch die Wende noch stärker eingeschränkt war, verlegten die Gesprächspartner beider Seiten die Kommunikation 1984 auf die Parteiebene. Innerhalb der SPD gab es weniger Vorbehalte als in der offiziellen Politik, so daß die Konzepte einer Sicherheitspartnerschaft in Mitteleuropa und einer „Kultur des Streites“ über die gegensätzlichen Standpunkte entwickelt werden konnten. Parallel dazu setzten sich im Osten wie im Westen dem Ende der sozialdemokratischen Regierung die Grundlinien der Entspanungspolitik durch. Auch der Ostblock betrachtete den Westen nicht mehr pauschal als „Klassenfeind“, sondern erkannte ihn als Gesprächspartner an. Die Zuwendung der kommunistischen Parteien Osteuropas zur Sozialdemokratie wird als „Sozialdemokratismus“ bezeichnet. Schon 1985 lud der neue Generalsekretär des Zentralkomitees der KPDSU, Michail Gorbatschow, Willy Brandt zu einem Gespräch nach Moskau und zeigte sich lernbereit. Er hoffte auf die Unterstützung der westeuropäischen Sozialdemokratie beim Weg aus der ideologischen Sackgasse des Ostblocks. Das langfristige Konzept eines Nebeneinanders der Systeme, die nur noch argumentative Konflikte austrügen, wurde durch den Zusammenbruch des Kommunismus allerdings obsolet. Die Wirkungen der Sozialdemokratie für das politische System in Deutschland sind vielfältig. 1918 stand die SPD für die Republikanisierung und die Verwirklichung einer sozialen Demokratie, von Anfang an trat sie auch für die politische Gleichberechtigung der Frauen ein. Außerdem kann sie auf eine antifaschistische und internationalistische Tradition zurückblicken, die ihr letztlich Mitte der 60er Jahre zur Regierungsbeteiligung verhalf. Gegenüber den totalitären Herausforderungen dieses Jahrhunderts blieb die SPD allerdings die Partei einer demokratischen Minderheit, weder unter Hitler noch unter Stalin konnte sie eine Mehrheit der Bevölkerung hinter sich bringen. Die Wandlungen in ihrer Mitgliederstruktur während der Weimarer Republik, aber vor allem seit den 60er Jahren haben die älteste deutsche Partei fundamental verändert und sie von einer Klientel- zu einer Volkspartei gemacht. Trotzdem sieht der Soziologe Ralf Dahrendorf das „Ende des sozialdemokratischen Zeitalters“ (Aufsatztitel) gekommen: Die wichtigsten Ziele der Sozialdemokratie seien erreicht, die heutigen Sozialdemokraten hätten andere Aufgaben als den Kampf gegen Unterdrückung und Ausbeutung. Das Geheimnis des SPD-Erfolgs, ihre schlagkräftige Organisation, scheint an Glanz verloren zu haben, wie alle anderen Parteien leidet die „alte Tante“ am Desinteresse der Bürger. Obwohl Politik heute in Deutschland untrennbar mit Parteien verknüpft ist, stellt sich die Frage nach der Zukunft von parteilich organisierter Politik im nächsten Jahrhundert. \section{Einzelne Sozialdemokraten} \begin{description} \item[Bernstein, Eduard (1850–1932)] war der Sohn eines jüdischen Eisenbahners. Er absolvierte eine Bankkauflehre und trat 1872 in die SPD ein. Nach einer aktiven Teilnahme am Vereinigungsparteitag in Gotha mußte er für längere Zeit ins Exil gehen. Von der Schweiz und von England aus publizierte er gemeinsam mit Karl Kautsky und stand in engem Kontakt mit Friedrich Engels und den englischen Sozialisten (Fabian-Society). Ihre unideologische Sichtweise prägte ihn stark. Zurück in Deutschland, eroberte er ein Reichstagsmandat, das er mit kurzen Unterbrechungen bis 1928 behielt. Kurz nach Kriegsausbruch formulierte er 1915 eine Denkschrift gegen den Kriegsnationalismus und trat aus Protest gegen die kriegsbejahende Haltung der Mehrheits-SPD der USPD (bis 1920) bei. \item[Brandt, Willy (1913–1990)] war der Sohn einer alleinstehenden Verkäuferin aus dem sozialdemokratischen Milieu. Er wurde als Herbert Frahm von seiner Mutter und seinem Großvater, einem LKW-Fahrer und Sozialdemokraten, erzogen und wuchs in einer sozialdemokratischen Jugenkultur auf. Als begabter Schüler erhielt er ein Stipendium für ein bürgerliches Gymnasium in seiner Heimatstadt. Gegen Ende der Weimarer Republik schloß er sich einer linkssozialistischen Splitterpartei an, war 1933 kurz im Widerstand und floh dann nach Dänemakr, wo er der Exilorganisation seiner Partei angehörte. 1937 kämpfte er im spanischen Bürgerkrieg, 1938 wurde er vom dem Deutschen Reich ausgebürgert und nahm die norwegische Staatsbürgerschaft an. Seine Verhaftung durch die Wehrmacht überstand er unter einem Decknamen unbeschadet. In Stockholm organisierte er die „kleine“ Internationale mit, nach 1945 arbeitete er als norwegischer Korrespondent in Berlin. Schließlich entschied er sich für die Politik und wurde von Ernst Reuter, dem SPD-Bürgermeister von Westberlin gefördert. 1957 wurde er selbst Berliner Bürgermeister und erlangte während der Berlinkrise 1958 weltweite Aufmerksamkeit. 1960 machte ihn seine Partei zum Kanzlerkandidaten, 1966 wurde er in der großen Koalition Außenminister, 1969 schließlich Kanzler einer sozialliberalen Regierung. Von 1964 bis 1987 war er Parteivorsitzender, nach dem Ende seiner Regierungszeit übernahm er auch eine führende Rolle in der sozialistischen Internationalen, deren Vorsitzender er 1976 wurde. Er arbeitete an der Überwindung des Faschismus in Spanien und Portugal mit, ließ sich ins Europäische Parlament wählen und wurde 1990 Alterspräsident des Bundestages. 1991 brachte er den Antrag für die Bundeshauptstadt Berlin ein. \item[Ebert, Friedrich (1871–1925)] wurde in Heidelberg als siebtes Kind eines Schneiders geboren. Er absolvierte eine Sattlerlehre, scheiterte als selbständiger Sattler und eröffnete eine Gastwirtschaft in Bremen. Dort entdekcte er sein publizistisches Talent und wurde Redakteur einer SPD-Parteizeitung. Seit 1900 war er besoldeter Arbeitersekretär, später auch Mitglied der Bremer Bürgerschaft. Durch sein Oragnisationstalent empfahl er sich der Parteiführung und wurde 1905 zum Sekretär des Parteivorstands in Berlin berufen. Der Mitgliederzuwachs der SPD in den folgenden Jahren war auch seiner erfolreichen Parteiarbeit zu verdanken. Ab 1912 war er Mitglied des Reichstages und rückte 1913 nach August Bebels in den Parteivorstand auf. Während des Krieges suchte er als einer der führenden Sozialdemokraten nach einer Friedenslösung und organisierte den Munitionsarbeiterstreik im Januar 1918. Am 9. November 1918 erhielt er den Auftrag zur Regierungsbildung, den einen Tag später an den „Rat der Volksbeauftragten“ übergab. Ebert forderte die Einsetzung einer Nationalversammlung, weil der die Räterepublik für unrealistisch hielt, und setzte sich durch. Die Nationalversammlung in Weimar wählte ihn am 11. Februar 1919 zum Reichspräsidenten und damit zum Nachfolger des Kaiser Wilhelm II. Die rechte Presse attackierte den Sattlergesellen im höchsten Staatsamt massiv (Dolchstoßlegende) und erreichte 1924 eine Verurteilung Eberts wegen seiner Beteiligung am Streik von 1918. Angesichts dieser Anwürfe resignierte Ebert und starb im Februar 1925 an einer zu spät erkannten Blinddarmentzündung. Er wurde in Heidelberg beerdigt. Aus seiner Ehe mit der Arbeiterin Luise Rump stammten fünf Kinder. Zwei der Söhne starben im Ersten Weltkrieg, die beiden anderen wurden ebenfalls Politiker: Der eine nach 1945 Oberbürgermeister von Ost-Berlin, der andere Landtagsabgeordneter in Stuttgart. \item[Görlinger, Robert (1888–1954)] stammte aus einer Arbeiterfamilie im Saarland. Ab 1905 hatte er verschiedene Jobs in Köln, wurde Metallarbeiter und trat 1909 in die SPD ein, parallel zu seinem Austritt aus der katholischen Kirche. Im Krieg wurde er mehrfach verwundet, während seiner Zeit im Lazarett in München bemühte er sich in der Universitätsbibliothek um Fortbildung. In Berlin war er Mitglied des Arbeiter- und Soldatenrates bis er nach Köln zurückkehrte, wo man ihn 1919 in den Stadtrat wählte. 1925 übernahm er den SPD-Fraktionsvorsitz, 1929 war er erfolgloser Gegenkandidat von Konrad Adenauer für das Amt des Oberbürgermeisters. Seit 1923 organisierte er auf kommunaler Ebene die Arbeiterwohlfahrt und ließ sich in das Kuratorium der Universität wählen, ohne selbst über höhere Schulbildung zu verfügen. 1933 emigrierte er nach Frankreich, wurde 1939 vom Deutschen Reich ausgebürgert, nach Kriegsbeginn in Frankreich interniert. Dort fiel er der Wehrmacht in die Hände, wurde verurteilt und später in das KZ Sachsenhausen deportiert. Nach dem Krieg übernahm er wieder den Fraktionsvorsitz im Kölner Rat, später auch Mandate im Landtag und Bundestag. Am 15. November 1948 wurde er in einem Losverfahren (im Rat herrschte Stimmengleichheit) zum ersten SPD-Bürgermeister in Köln. Besonders kulturpolitisch war er interessiert: Er initiierte die photokina und holte den Nachlaß des Photographen August Sander nach Köln. \item[Gohlke, Marie (1879–1956)] und Elisabeth (1888–1930) aus Landsberg an der Warthe wuchsen als Töchter eines armen Handwerkers auf. Marie erarbeitete sich das Geld für eine Lehre als Schneiderin und Weißnäherin und heiratete früh (als Marie Juchatz hatte sie zwei Kinder). Ihre Schwester Elisabeth hatte aus der Ehe mit Herrn Röhl ein Kind. Die ältere Schwester las im Elternhaus regelmäßig aus der SPD-Zeitung Volksstimme vor, 1906 zog sie mit ihrer Schwester und den drei Kindern nach Berlin, wo sie sich bei der SPD zur Mitarbeit meldeten. 1908 sprang Marie für eine erkrankte Rednerin ein und bwährte sich auf mehreren Redetourneen. 1912 war sie mit ihrer Agitationsrede „Die Teuerung, der Krieg und die Frauen“ in Köln, 1913 übernahm sie dort das Amt der 1. Sekretärin für Frauenarbeit. Während des Krieges war sie die einzige Sozialdemokratin im bürgerlichen Dachverband der Frauenvereine Deutschlands. 1917 übernahm sie das Frauensekretariat im SPD-Bundesvorstand, 1919 erhielt sie einen Sitz in der Nationalversammlung und hielt dort als erste Frau eine Rede. Ende 1919 war sie Mitgründerin der SPD-nahen Arbeiterwohlfahrt. Später emigrierte sie in die USA, wo sie die Unterstützung der deutschen Arbeiterschaft organisierte. 1949 kehrte sie zurück, 1955 erschienen ihre Memoiren kurz vor ihrem Tod in Deutschland. Ihre Schwester Elisabeth wurde ebenfalls in die Nationalversammlung gewählt, später saß sie im Kölner Stadtrat, im Kölner Bezirksvorstand und im Preußischen Landtag. Sie heiratete in zweiter Ehe den SPD-Funktionär Kirschmann und arbeitete bei der Rheinischen Zeitung. Sie starb bereits 1930. \item[Heinemann, Gustav (1899–?)] war eine der schillerndsten Persönlichkeiten in der SPD. Sein Vater hatte sich aus eher bescheidenen Verhältnissen zum Arbeitsdirektor der Kruppwerke hochgearbeitet. Heinemann wuchs deshalb in der großbürgerlichen Gesellschaft Essens auf. 1917 meldete er sich, mit gerade 18 Jahren, als Kriegsfreiwilliger, nach dem Krieg studierte er Jura in Marburg und München. Dort engagierte er sich in einer Studentengruppe der DDP und war aktiv im Kampf gegen den Kapp-Putsch. Ab 1925 folgte eine rasante Industriekarriere bei den Rheinischen Stahlwerken. Durch seine Frau Hilda, eine Theologin, fand Heinemann Kontakt zur Evangelischen Kirche und engagierte sich auch während des Dritten Reiches als Protestant. Außerdem lehrte von 1933 bis 1939 als Professor Wirtschaftsrecht an der Kölner Universität. 1945 war er Mitbegründer der CDU in Essen, er wurde zum ersten Oberbürgermeister von Essen gewählt, unterzeichnete die „Stuttgarter Schulderklärung“ der deutschen Protestanten, war Mitglied im Rat der evangelischen Kirche und 1948 Präses. 1949 initiierte er die evangelischen Kirchentage und wurde Innenminister im ersten Kabinett Adenauer, bis er aus Protest gegen die Wiederbewaffnung zurücktrat. Seine neue Partei, die Gesamtdeutsche Volkspartei (GVP), scheiterte an der neuen Fünfprozenthürde bei Bundestagswahlen. 1957 trat er mit einigen politischen Freunden in die SPD ein, erhielt ein Bundestagsmandat und wurde in den Parteivorstand gewählt. 1966 übernahm er das Justizministerium in der großen Koalition und setzte grundlegende Justizreformen durch. 1969 wählte ihn die Bundesversammlung zum Bundespräsidenten. Als Bundespräsident schärfte Heinemann vor allem das Geschichtsbewußtsein der Deutschen, indem er z.B. auch auf den kommunistischen Widerstand gegen Hitler hinwies und der Revolution von 1848 gedachte. Außenpolitische Zeichen setzte er durch ausgedehnte Reisetätigkeit in die Nachbarländer Deutschlands. Mit seiner Frau hatte er drei Töchter und einen Sohn. \item[Mierendorf, Carlo (1898–1943)] wuchs in Darmstadt in einem großbürgerlichen Elternhaus auf, besuchte das Gymnasium und gab als literarisch Interessierter eine Zeitschrift heraus. 1916 wurde er als Kriegsfreiwilliger verwundet und erhielt das Eiserne Kreuz. Nach dem Krieg studierte er Volkswirtschaft und Philosophie, 1920 trat er in die SPD ein und wurde Herausgeber des Hessischen Volksfreundes. Seit 1930 gehörte er als Reichstagsmitglied den sogenannten „kämpferischen Sozialdemokraten“ an. Im Juni 1933 verschleppten ihn die Nationalsozialisten in ein KZ, aus dem er 1938 entlassen wurde. Er war aktiv im Kreisauer Kreis mit Gördeler und richtete im Juni 1943 einen Aufruf an das deutsche Volk zur sozialistischen Aktion. Kurz darauf wurde er bei einem Bombenagriff auf Leipzig getötet. Als Bürgersohn und Dichter stellte er einen neuen, nicht mehr an die Arbeiterherkunft gebundenen Typus des Sozialdemokraten dar. \item[Schumacher, Kurt (1895–1952)] wurde in Kulm (Westpreußen) geboren. Seine Heimatstadt war von Polen, Juden und Deutschen bewohnt. Er besuchte in Lübeck das Gymnasium, meldete sich 1914 als Kriegsfreiwilliger und wurde schwer verwundet (Verlust des rechten Armes). Sein Studium in Münster beendete er als Doktor der politischen Wissenschaften. In seiner Dissertation zum Thema „Kampf um den Staatsgedanken in der deutschen Sozialdemokratie“ zog er von Lassalle ausgehend eine argumentative Linie über das Verhältnis von SPD und Staat. Seit 1918 war Schumacher SPD-Mitglied. Er begann seine politische Karriere als Redakteur der Schwäbischen Tagwacht, rückte 1924 in den württembergischen Landtag ein, organisierte das demokratische Reichsbanner Schwarz-Rot-Gold und erhielt 1930 ein Reichstagsmandat. Sein rhetorischer Kampf gegen den NS-Propagandisten Joseph Goebbels brachte ihn schon 1933 ins KZ Dachau. Nach seiner Entlassung 1943 wurde er 1944 erneut verhaftet, erlebte das Kriegsende aber in Freiheit in Hannover. Noch im Mai wurde er aktiv für die neue Sozialdemokratie. Vom 4. bis 6. Oktober 1945 organisierte er eine „Reichskonferenz“ in Hannover-Wennigsen mit Otto Grotewohl. Das Ergebnis brachte eine Abgrenzung von westlichen und östlichen Sozialdemokraten, so daß Schumacher und der Berliner Zentralausschuß den Zonengrenzen entsprechend parallel arbeiteten. Der Londoner Exilvorstand integrierte sich rasch in das Schumachers Hannoveraner Büro, Schumacher wurde zunächst zum Sprecher der westzonalen SPD und im Mai 1946 einstimmig zum ersten (Nachkriegs-) Vorsitzenden der SPD gewählt (zum Vergleich: Konrad Adenauer agierte mehrere Jahre nur als einer von mehreren CDU-Landesfürsten). Zwischen März 1948 und April 1949 mußte er sich wegen einer Erkrankung aus der aktiven Politik zurückziehen; in dieser Zeit wurde ihm das linke Bein amputiert. Noch im Frühjahr 1949 stieg er aber in die Debatten um das Grundgesetz ein und formulierte das Veto der SPD gegen mehrere Artikel der Vorlage. Als Kandidat für das Amt des Bundespräsidenten verlor er 1949 gegen den FDP-Politiker Theodor Heuss, 1950 wurde er erneut einstimmig zum Vorsitzenden der SPD gewählt. Sein plötzlicher Tod am 20. August 1952 führte zu der größten politischen Demonstration der 50er Jahre, fast 100.000 Menschen säumten die Straßen, als sein Leichnam nach Hannover überführt wurde. Ein englischer Journalist charakterisierte Schumacher als Sinnbild der deutschen Tragödie im 20. Jahrhundert. Im ersten Weltkrieg schwer verwundet und von den Nationalsozialisten im Konzentrationslager mißhandelt, konnte er dennoch kraftvoll und packend für eine bessere Welt sprechen. Die Menschen, die ihm das Geleit gaben, spürten, daß mit ihm einer der wenigen Aufrechten gestorben war. \item[Wehner, Herbert (1906–1990)] wurde in Dresden als Sohn eines sozialdemokratischen Schuhmachers geboren. Er erhielt eine Begabtenförderung, erlebte die Spaltung der Arbeiterbewegung nach dem Weltkrieg und schloß sich der Sozialistischen Arbeiterjugend an. Nach dem Einmarsch der Reichswehr in Sachsen wegen der dort regierenden SPD-KPD-Regierung trat Wehner in die KPD ein und erhielt 1930 ein Mandat im sächsischen Landtag. 1931 wurde er als Assistent des Vorsitzenden Ernst Thälmann nach Berlin berufen und bereitete dort den Widerstand gegen Hitler vor. Seit 1934 steckbrieflich gesucht, floh er 1935 ins Ausland. Über mehrere Stationen gelangte er nach Moskau, wo er die stalinistischen Säuberungen unter deutschen und sowjetischen Kommunisten überlebte und sich 1941 aus der dortigen Atmosphäre von Verrat und Bedrohung nach Schweden rettete. Dort verhafetete ihn die schwedische Polizei als illegalen Einwanderer. In der Haft kehrte er sich vom Kommunismus ab und reiste 1946 nach Hamburg. Von dort aus bewarb er sich im Büro Schumacher als Mitarbeiter. Seit 1949 Bundestagsabgeordneter (und in der Partei verantwortlich für die Deutschlandpläne), wurde er 1952 in den SPD-Vorstand gewählt. Seit 1958 konnte er als stellvertretender Vorsitzender seine politische Linie durchsetzen. Er akzeptierte die deutsche Teilung als Realität und legte mit der politischen Wahrnehmung der DDR den Grundstein für die spätere Ostpolitik Willy Brandts. Von 1965 bis 1983 war Wehner Fraktionsvorsitzender, trotz seiner häufigen Zwischenrufe und seines eher mittelmäßigen Redetalents galt er als großer Parlamentarier. Seine Person demonstrierte den Weg zurück von der KPD zur Sozialdemokratie, obwohl ihn die bürgerlichen Parteien wegen seiner kommunistischen Vergangenheit oft hart angriffen. \end{description} \section{Literatur} \begin{itemize} \item Miller, Susanne/Potthoff, Heinrich, Kleine: Geschichte der SPD. Darstellung und Dokumentation 1848–1983. 5. Auflage 1983 \item Dowe, Dieter (Hg.): Programmatische Dokumente der deutschen Sozialdemokratie. 3. Auflage 1990 \item Meyer, Thomas u.a. (Hg.): Geschichte der deutschen Arbeiterbewegung. Darstellung – Chronologie – Dokumentation. Lern- und Arbeitsbuch. 3 Bde. Bonn 1984. (Schriftenreihe der Bundeszentale für politische Bildung) \item Lösche, Peter/Walter, Franz: Die SPD: Klassenpartei – Volkspartei – Quotenpartei. 1992 \item Brandt, Willy: Erinnerungen. Ullstein TB 1997 \item Brunn, Gerhard (Hg.): Sozialdemokratie in Köln. Ein Beitrag zur Stadt- und Parteiengeschichte. 1986 \end{itemize} \end{document}

https://dlmf.nist.gov/7.17.E6.tex

nist.gov

CC-MAIN-2018-13

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-13/segments/1521257645362.1/warc/CC-MAIN-20180317214032-20180317234032-00293.warc.gz

\[v=\ln\left(\ln\left(1/x\right)\right)-2+\ln\pi.\]

http://mirror.math.ku.edu/tex-archive/graphics/pgf/contrib/circuitikz/pgfcirccurrent.sty

ku.edu

CC-MAIN-2014-41

text/x-tex

crawl-data/CC-MAIN-2014-41/segments/1410657135777.13/warc/CC-MAIN-20140914011215-00267-ip-10-234-18-248.ec2.internal.warc.gz

% Copyright 2007-2009 by Massimo Redaelli % % This file may be distributed and/or modified % % 1. under the LaTeX Project Public License and/or % 2. under the GNU Public License. % % See the file doc/LICENSE for more details. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Current handling %% Options \ctikzset{i^>/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = forward, \circuitikzbasekey/bipole/current/x position = after, \circuitikzbasekey/bipole/current/y position = above } } \ctikzset{i_>/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = forward, \circuitikzbasekey/bipole/current/x position = after, \circuitikzbasekey/bipole/current/y position = below } } \ctikzset{i>^/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = forward, \circuitikzbasekey/bipole/current/x position = before, \circuitikzbasekey/bipole/current/y position = above } } \ctikzset{i>_/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = forward, \circuitikzbasekey/bipole/current/x position = before, \circuitikzbasekey/bipole/current/y position = below } } \ctikzset{i^</.style = { i = #1, \circuitikzbasekey/bipole/current/direction = backward, \circuitikzbasekey/bipole/current/x position = after, \circuitikzbasekey/bipole/current/y position = above } } \ctikzset{i_</.style = { i = #1, \circuitikzbasekey/bipole/current/direction = backward, \circuitikzbasekey/bipole/current/x position = after, \circuitikzbasekey/bipole/current/y position = below } } \ctikzset{i<^/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = backward, \circuitikzbasekey/bipole/current/x position = before, \circuitikzbasekey/bipole/current/y position = above } } \ctikzset{i<_/.style = { i = #1, \circuitikzbasekey/bipole/current/direction = backward, \circuitikzbasekey/bipole/current/x position = before, \circuitikzbasekey/bipole/current/y position = below } } \ctikzset{i/.code = { % \ifpgf@circuit@bipole@iscurrent % \pgfkeys{\circuitikzbasekey/bipole/current/position=above} % \else % \pgfkeys{\circuitikzbasekey/bipole/current/position=below} % \fi \pgfkeys{\circuitikzbasekey/bipole/current/direction = forward, \circuitikzbasekey/bipole/current/x position = after, \circuitikzbasekey/bipole/current/y position = above } \pgfkeys{/tikz/circuitikz/bipole/current/label/name=#1} \ctikzsetvalof{bipole/current/label/unit}{} \ifpgf@circ@siunitx \pgf@circ@handleSI{#1} \ifpgf@circ@siunitx@res \edef\pgf@temp{\pgf@circ@handleSI@val} \pgfkeyslet{/tikz/circuitikz/bipole/current/label/name}{\pgf@temp} \edef\pgf@temp{\pgf@circ@handleSI@unit} \pgfkeyslet{/tikz/circuitikz/bipole/current/label/unit}{\pgf@temp} \else \fi \else \fi } } \ctikzset{i</.style = { i = #1, \circuitikzbasekey/bipole/current/direction = backward } } \ctikzset{i_/.style = { i = #1, \circuitikzbasekey/bipole/current/y position = below } } \ctikzset{i>/.style = {i = #1, \circuitikzbasekey/bipole/current/direction = forward } } \ctikzset{i^/.style = { i= #1, \circuitikzbasekey/bipole/current/y position = above } } \def\pgf@circ@drawnormalcurrent{ \ifpgf@circuit@bipole@current@before \ifpgf@circuit@bipole@current@backward { (\ctikzvalof{bipole/name}.left) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\tikztostart) } \else { (\tikztostart) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\ctikzvalof{bipole/name}.left) } \fi \else \ifpgf@circuit@bipole@current@backward { (\tikztotarget) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\ctikzvalof{bipole/name}.right) } \else { (\ctikzvalof{bipole/name}.right) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\tikztotarget) } \fi \fi } %% Output routine %% #1 - node name \def\pgf@circ@drawcurrent{ \pgfextra{ \edef\pgf@circ@ffffff{\pgf@circ@direction} \def\pgfcircmathresult{\expandafter\pgf@circ@stripdecimals\pgf@circ@ffffff\pgf@nil} \ifnum\pgfcircmathresult >4 \ifnum\pgfcircmathresult <86 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{north west} \else \def\pgf@circ@dir{south east} \fi \fi\fi \ifnum\pgfcircmathresult >85 \ifnum\pgfcircmathresult <95 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{west} \else \def\pgf@circ@dir{east} \fi \fi\fi \ifnum\pgfcircmathresult >94 \ifnum\pgfcircmathresult <176 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{south west}\else \def\pgf@circ@dir{north east} \fi \fi\fi \ifnum\pgfcircmathresult >175 \ifnum\pgfcircmathresult <185 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{south}\else\def\pgf@circ@dir{north} \fi \fi\fi \ifnum\pgfcircmathresult >184 \ifnum\pgfcircmathresult <256 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{south east}\else\def\pgf@circ@dir{north west} \fi \fi\fi \ifnum\pgfcircmathresult >265 \ifnum\pgfcircmathresult <275 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{east}\else \def\pgf@circ@dir{west} \fi \fi\fi \ifnum\pgfcircmathresult >284 \ifnum\pgfcircmathresult <356 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{north east}\else\def\pgf@circ@dir{south west} \fi \fi\fi \ifnum\pgfcircmathresult <5 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{north}\else\def\pgf@circ@dir{south} \fi \fi \ifnum\pgfcircmathresult >355 \ifpgf@circuit@bipole@current@below \def\pgf@circ@dir{north}\else\def\pgf@circ@dir{south} \fi \fi \ifpgf@circuit@bipole@current@below \def\pgf@circ@bipole@current@label@where{-90} \else \def\pgf@circ@bipole@current@label@where{+90} \fi } \pgfextra{ \def\pgf@temp{short} \edef\pgf@circ@temp{\ctikzvalof{bipole/kind}} } \ifx\pgf@circ@temp\pgf@temp % caso di corrente (centrata) su un corto \ifpgf@circuit@bipole@current@backward { (\tikztotarget) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\tikztostart) } \else { (\tikztostart) -- node [currarrow, pos=\ctikzvalof{current/distance}, sloped, allow upside down] (Iarrow) {} (\tikztotarget) } \fi \else % altri bipoli - e quindi tra nodo e target \ifpgf@circuit@bipole@iscurrent \ifpgf@circuit@europeancurrent \pgf@circ@drawnormalcurrent \else \fi \else \pgf@circ@drawnormalcurrent \fi \fi \ifpgf@circuit@bipole@iscurrent node [anchor=\pgf@circ@dir] at (\ctikzvalof{bipole/name}.\pgf@circ@bipole@current@label@where) { \pgf@circ@finallabel{current/} } \else (Iarrow.\pgf@circ@bipole@current@label@where) node [anchor=\pgf@circ@dir] { \pgf@circ@finallabel{current/} } \fi } \endinput

https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_en/33-03-15.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103984681.57/warc/CC-MAIN-20220702040603-20220702070603-00182.warc.gz

%% %% A DANTE-Edition example %% %% Example 33-03-15 on page 691. %% %% Copyright (C) 2011 Herbert Voss %% %% It may be distributed and/or modified under the conditions %% of the LaTeX Project Public License, either version 1.3 %% of this license or (at your option) any later version. %% %% See http://www.latex-project.org/lppl.txt for details. %% %% %% ==== % Show page(s) 1 %% \documentclass[]{article} \pagestyle{empty} \setlength\textwidth{375.57637pt} \setlength\parindent{0pt} \usepackage{pst-optic,graphicx} \begin{document} \resizebox{\linewidth}{!}{\begin{pspicture}(-8,-3.5)(7,5) \rput(0,0){% \lens[lensWidth=1,lensGlass=true,lensHeight=6,focus=4,drawing=false,AB=2.5]} { \psset{linewidth=0.5pt,linestyle=dashed,arrowsize=5pt,arrows=|<->|} \psline(-8,0)(4,0)\pcline(-7.75,-3)(0,-3)\lput*{:U}{2f} \pcline(0,-3)(4,-3)\lput*{:U}{f}\pcline(7,0)(7,4)\lput*{:U}{f} \pcline(4,5)(5,5)\lput*{:U}{s}\pcline(5.25,2.3)(5.25,2.8)\lput*{:U}{s} } \uput[90](0,3){\Large L}\uput[45](-7.7,3){\Large B}\uput[45](-7.7,-2){\Large E} \uput[270](3,-0.5){\Large D}\uput[-45](4,0){\Large A=F}\uput[270](3,2){\Large S} \uput[90](4,4){\Large Sp}\uput[90](3.5,3.25){\Large B'} \uput[0](6.3,2.25){\Large B''}\uput[-90](6,1.1){\Large M} \psarc[linewidth=0.5pt](-7.75,2.5){0.5}{-90}{0}\qdisk(-7.55,2.3){1pt} \rput{210}(F'){\mirrorTwo} { \psset{fillstyle=solid,fillcolor=lightgray} \rput{210}(4,2.5){\psframe(-1,0)(1,0.2)} \psframe(-8,-3)(-7.75,3)\psframe(3,4)(3.8,4.2)\psframe(4.2,4)(5,4.2) }{\psset{linewidth=1pt,linecolor=red,arrows=->,arrowsize=5pt} \arrowLine[linecolor=blue,arrowOffset=-0.2](F')(4,2.5){2} \arrowLine[linecolor=blue,arrowOffset=-0.2](4,2.3)(6,2.3){1}\qdisk(6,2.3){2pt} \psline[linestyle=dashed,arrows=-](F')(5.1,4) \psline[linestyle=dashed,arrows=-](5,2.8)(6,2.8) \arrowLine(4,4)(F'){3}\arrowLine[linecolor=blue,arrowOffset=-0.2](I)(F'){2} \arrowLine(F')(I){2}\arrowLine[linecolor=blue,arrowOffset=-0.3](-7.75,2.5)(I){3} \arrowLine(I)(-7.75,2.5){3}} \psframe(5.5,1.1)(6.5,3.5)\multido{\r=1.3+0.2}{12}{\psline(6.1,\r)(6.5,\r)} \end{pspicture}} \end{document}

https://www.zentralblatt-math.org/matheduc/en/?id=24107&type=tex

zentralblatt-math.org

CC-MAIN-2019-47

text/plain

application/x-tex

crawl-data/CC-MAIN-2019-47/segments/1573496670558.91/warc/CC-MAIN-20191120111249-20191120135249-00041.warc.gz

\input zb-basic \input zb-matheduc \iteman{ZMATH 2011d.00701} \itemau{Milovanovi\'c, Marina; Taka\v{c}i, {\Dj}ur{\dj}ica; Milaji\'c, Aleksandar} \itemti{Multimedia approach in teaching mathematics - example of lesson about the definite integral application for determining an area.} \itemso{Int. J. Math. Educ. Sci. Technol. 42, No. 2, 175-187 (2011).} \itemab Summary: This article presents the importance of using multimedia in the math classes by an example of multimedia lesson about definite integral and the results of the research carried out among the students of the first years of faculty, divided into two groups of 25. One group had the traditional lecture about the definite integral, while the other one had the multimedia method. The main information source in multimedia lectures was the software created in Macromedia Flash, with definitions, theorems, examples, tasks as well as in traditional lectures but with emphasized visualization possibilities, animations, illustrations, etc. Both groups were tested after the lectures. Students from the multimedia group showed better theoretical, practical and visual knowledge. Besides that, survey carried out at the end of this research clearly showed that students from multimedia group were highly interested in this way of learning. \itemrv{~} \itemcc{I55 R25 C75} \itemut{integral calculus; visualization; computer software; technology integration; multimedia learning; multimedia lessons; definite integral; area; tertiary education; empirical investigations} \itemli{doi:10.1080/0020739X.2010.519800} \end

http://refbase.cvc.uab.es/search.php?sqlQuery=SELECT%20author%2C%20title%2C%20type%2C%20year%2C%20publication%2C%20abbrev_journal%2C%20volume%2C%20issue%2C%20pages%2C%20keywords%2C%20abstract%2C%20thesis%2C%20editor%2C%20publisher%2C%20place%2C%20abbrev_series_title%2C%20series_title%2C%20series_editor%2C%20series_volume%2C%20series_issue%2C%20edition%2C%20language%2C%20author_count%2C%20online_publication%2C%20online_citation%2C%20doi%2C%20serial%20FROM%20refs%20WHERE%20serial%20%3D%202775%20ORDER%20BY%20year%20DESC%2C%20first_author%2C%20author_count%2C%20author%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=15&rowOffset=&wrapResults=1&citeOrder=year&citeStyle=Chicago&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

uab.es

CC-MAIN-2022-49

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2022-49/segments/1669446711394.73/warc/CC-MAIN-20221209080025-20221209110025-00574.warc.gz

%&LaTeX \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \section*{2017} Debora Gil, Sergio Vera, Agnes Borras, Albert Andaluz, \& Miguel Angel Gonzalez Ballester. (2017).<a target={\textquoteright}_blank{\textquoteright} href={\textquoteright}/files/GVB2016.pdf{\textquoteright}> "Anatomical Medial Surfaces with Efficient Resolution of Branches Singularities "</a> . \textit{Medical Image Analysis}, \textit{35}, 390--402. \end{document}

http://mirrors.concertpass.com/tex-archive/macros/latex/doc/clsguide.tex

concertpass.com

CC-MAIN-2016-40

application/x-tex

crawl-data/CC-MAIN-2016-40/segments/1474738662430.97/warc/CC-MAIN-20160924173742-00048-ip-10-143-35-109.ec2.internal.warc.gz

% \iffalse meta-comment % % Copyright 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 % The LaTeX3 Project and any individual authors listed elsewhere % in this file. % % This file is part of the LaTeX base system. % ------------------------------------------- % % It may be distributed and/or modified under the % conditions of the LaTeX Project Public License, either version 1.3c % of this license or (at your option) any later version. % The latest version of this license is in % http://www.latex-project.org/lppl.txt % and version 1.3c or later is part of all distributions of LaTeX % version 2005/12/01 or later. % % This file has the LPPL maintenance status "maintained". % % The list of all files belonging to the LaTeX base distribution is % given in the file `manifest.txt'. See also `legal.txt' for additional % information. % % The list of derived (unpacked) files belonging to the distribution % and covered by LPPL is defined by the unpacking scripts (with % extension .ins) which are part of the distribution. % % \fi % Filename: clsguide.tex \NeedsTeXFormat{LaTeX2e}[1995/12/01] \documentclass{ltxguide}[1995/11/28] \title{\LaTeXe~for class and package writers} \author{Copyright \copyright~1995--2006 The \LaTeX3 Project\\ All rights reserved} \date{15 February 2006} \begin{document} \maketitle \tableofcontents \section{Introduction} This document is an introduction to writing classes and packages for \LaTeX{}, with special attention given to upgrading existing \LaTeX~2.09 packages to \LaTeXe{}. The latter subject is also covered in an article by Johannes Braams published in TUGboat~15.3. \subsection{Writing classes and packages for \LaTeXe} \LaTeX{} is a document preparation system that enables the document writer to concentrate on the contents of their text, without bothering too much about the formatting of it. For example, chapters are indicated by |\chapter{<title>}| rather than by selecting 18pt bold. The file that contains the information about how to turn logical structure (like `|\chapter|') into formatting (like `18pt bold ragged right') is a \emph{document class}. In addition, some features (such as colour or included graphics) are independent of the document class and these are contained in \emph{packages}. One of the largest differences between \LaTeX~2.09 and \LaTeXe{} is in the commands used to write packages and classes. In \LaTeX~2.09, there was very little support for writing |.sty| files, and so writers had to resort to using low-level commands. \LaTeXe{} provides high-level commands for structuring packages. It is also much easier to build classes and packages on top of each other, for example writing a local technical report class |cetechr| (for the Chemical Engineering department) based on |article|. \subsection{Overview} This document contains an overview of how to write classes and packages for \LaTeX{}. It does \emph{not} introduce all of the commands necessary to write packages: these can be found in either \emph{\LaTeXbook} or \emph{\LaTeXcomp}. But it does describe the new commands for structuring classes and packages. \begin{description} \item[Section~\ref{Sec:general}] contains some general advice about writing classes and packages. It describes the difference between classes and packages, the command naming conventions, the use of |doc| and |docstrip|, how \TeX's primitive file and box commands interact with \LaTeX{}. It also contains some hints about general \LaTeX{} style. \item[Section~\ref{Sec:structure}] describes the structure of classes and packages. This includes building classes and packages on top of other classes and packages, declaring options and declaring commands. It also contains example classes. \item[Section~\ref{Sec:commands}] lists the new class and package commands. \item[Section~\ref{Sec:upgrade}] gives detailed advice on how to upgrade existing \LaTeX~2.09 classes and packages to \LaTeXe{}. \end{description} \subsection{Further information} For a general introduction to \LaTeX{}, including the new features of \LaTeXe{}, you should read \emph{\LaTeXbook} by Leslie Lamport~\cite{A-W:LLa94}. A more detailed description of the new features of \LaTeX, including an overview of more than 200 packages and nearly 1000 ready to run examples, is to be found in \emph{\LaTeXcomp second edition} by Frank Mittelbach and Michel Goossens~\cite{A-W:MG2004}. The \LaTeX{} system is based on \TeX{}, which is described in \emph{The \TeX book} by Donald E.~Knuth~\cite{A-W:DEK91}. There are a number of documentation files which accompany every copy of \LaTeX{}. A copy of \emph{\LaTeX{} News} will come out with each six-monthly release of \LaTeX{}, and is found in the files |ltnews*.tex|. The author's guide \emph{\usrguide} describes the new \LaTeX{} document features; it is in |usrguide.tex|. The guide \emph{\fntguide} describes the \LaTeX{} font selection scheme for class- and package-writers; it is in |fntguide.tex|. Configuring \LaTeX{} is covered by the guide \emph{\cfgguide} in \texttt{cfgguide.tex} whilst the philosophy behind our policy on modifying \LaTeX{} is described in \emph{\modguide} in \texttt{modguide.tex}. The documented source code (from the files used to produce the kernel format via |latex.ltx|) is now available as \emph{The \LaTeXe\ Sources}. This very large document also includes an index of \LaTeX{} commands. It can be typeset from the \LaTeX{} file |source2e.tex| in the |base| directory, using the source files and the class file |ltxdoc.cls| from this directory. For more information about \TeX{} and \LaTeX{}, please contact your local \TeX{} Users Group, or the international \TeX{} Users Group. Addresses and other details can be found at: \begin{quote}\small\label{addrs} \texttt{http://www.tug.org/lugs.html} \end{quote} \subsection{Policy on standard classes} Many of the problem reports we receive concerning the standard classes are not concerned with bugs but are suggesting, more or less politely, that the design decisions embodied in them are `not optimal' and asking us to modify them. There are several reasons why we should not make such changes to these files. \begin{itemize} \item However misguided, the current behaviour is clearly what was intended when these classes were designed. \item It is not good practice to change such aspects of `standard classes' because many people will be relying on them. \end{itemize} We have therefore decided not to even consider making such modifications, nor to spend time justifying that decision. This does not mean that we do not agree that there are many deficiencies in the design of these classes, but we have many tasks with higher priority than continually explaining why the standard classes for \LaTeX{} cannot be changed. We would, of course, welcome the production of better classes, or of packages that can be used to enhance these classes. So your first thought when you consider such a deficiency will, we hope, be ``what can I do to improve this?'' Similar considerations apply to those parts of the kernel that are implementing design decisions, many of which should be left to the class file but are not in the current system. We realise that in such cases it is much more difficult for you to rectify the problem yourself but it is also the case that making such changes in the kernel would probably be a major project for us; therefore such enhancements will have to wait for \LaTeX3. \section{Writing classes and packages} \label{Sec:writing} This section covers some general points concerned with writing \LaTeX{} classes and packages. \subsection{Old versions} If you are upgrading an existing \LaTeX~2.09 style file then we recommend freezing the 2.09 version and no longer maintaining it. Experience with the various dialects of \LaTeX{} which existed in the early 1990's suggests that maintaining packages for different versions of \LaTeX{} is almost impossible. It will, of course, be necessary for some organisations to maintain both versions in parallel for some time but this is not essential for those packages and classes supported by individuals: they should support only the new standard \LaTeXe{}, not obsolete versions of \LaTeX{}. \subsection{Using `docstrip' and `doc'} If you are going to write a large class or package for \LaTeX{} then you should consider using the |doc| software which comes with \LaTeX{}. \LaTeX{} classes and packages written using this can be processed in two ways: they can be run through \LaTeX{}, to produce documentation; and they can be processed with |docstrip|, to produce the |.cls| or |.sty| file. The |doc| software can automatically generate indexes of definitions, indexes of command use, and change-log lists. It is very useful for maintaining and documenting large \TeX{} sources. The documented sources of the \LaTeX{} kernel itself, and of the standard classes, etc, are |doc| documents; they are in the |.dtx| files in the distribution. You can, in fact, typeset the source code of the kernel as one long document, complete with index, by running \LaTeX{} on |source2e.tex|. Typesetting these documents uses the class file |ltxdoc.cls|. For more information on |doc| and |docstrip|, consult the files |docstrip.dtx|, |doc.dtx|, and \emph{\LaTeXcomp}. For examples of its use, look at the |.dtx| files. \subsection{Is it a class or a package?} \label{Sec:classorpkg} The first thing to do when you want to put some new \LaTeX{} commands in a file is to decide whether it should be a \emph{document class} or a \emph{package}. The rule of thumb is: \begin{quote} If the commands could be used with any document class, then make them a package; and if not, then make them a class. \end{quote} There are two major types of class: those like |article|, |report| or |letter|, which are free-standing; and those which are extensions or variations of other classes---for example, the |proc| document class, which is built on the |article| document class. Thus, a company might have a local |ownlet| class for printing letters with their own headed note-paper. Such a class would build on top of the existing |letter| class but it cannot be used with any other document class, so we have |ownlet.cls| rather than |ownlet.sty|. The |graphics| package, in contrast, provides commands for including images into a \LaTeX{} document. Since these commands can be used with any document class, we have |graphics.sty| rather than |graphics.cls|. \subsection{Command names} \LaTeX{} has three types of command. There are the author commands, such as |\section|, |\emph| and |\times|: most of these have short names, all in lower case. There are also the class and package writer commands: most of these have long mixed-case names such as the following. \begin{verbatim} \InputIfFileExists \RequirePackage \PassOptionsToClass \end{verbatim} Finally, there are the internal commands used in the \LaTeX{} implementation, such as |\@tempcnta|, |\@ifnextchar| and |\@eha|: most of these commands contain |@| in their name, which means they cannot be used in documents, only in class and package files. Unfortunately, for historical reasons the distinction between these commands is often blurred. For example, |\hbox| is an internal command which should only be used in the \LaTeX{} kernel, whereas |\m@ne| is the constant $-1$ and could have been |\MinusOne|. However, this rule of thumb is still useful: if a command has |@| in its name then it is not part of the supported \LaTeX{} language---and its behaviour may change in future releases! If a command is mixed-case, or is described in \emph{\LaTeXbook}, then you can rely on future releases of \LaTeXe{} supporting the command. \subsection{Box commands and colour} \label{Sec:colour} Even if you do not intend to use colour in your own documents, by taking note of the points in this section you can ensure that your class or package is compatible with the |color| package. This may benefit people using your class or package who have access to colour printers. The simplest way to ensure `colour safety' is to always use \LaTeX{} box commands rather than \TeX{} primitives, that is use |\sbox| rather than |\setbox|, |\mbox| rather than |\hbox| and |\parbox| or the |minipage| environment rather than |\vbox|. The \LaTeX{} box commands have new options which mean that they are now as powerful as the \TeX{} primitives. As an example of what can go wrong, consider that in |{\ttfamily <text>}| the font is restored just \emph{before} the |}|, whereas in the similar looking construction |{\color{green} <text>}| the colour is restored just \emph{after} the final |}|. Normally this distinction does not matter at all; but consider a primitive \TeX{} box assignment such as: \begin{verbatim} \setbox0=\hbox{\color{green} <text>} \end{verbatim} Now the colour-restore occurs after the |}| and so is \emph{not} stored in the box. Exactly what bad effects this can have depends on how colour is implemented: it can range from getting the wrong colours in the rest of the document, to causing errors in the dvi-driver used to print the document. Also of interest is the command |\normalcolor|. This is normally just |\relax| (i.e., does nothing) but you can use it rather like |\normalfont| to set regions of the page such as captions or section headings to the `main document colour'. \subsection{Defining text and math characters} \label{Sec:chars} Because \LaTeXe{} supports different encodings, definitions of commands for producing symbols, accents, composite glyphs, etc.\ must be defined using the commands provided for this purpose and described in \emph{\fntguide}. This part of the system is still under development so such tasks should be undertaken with great caution. Also, |\DeclareRobustCommand| should be used for encoding-independent commands of this type. Note that it is no longer possible to refer to the math font set-up outside math mode: for example, neither |\textfont 1| nor |\scriptfont 2| are guaranteed to be defined in other modes. \subsection{General style} \label{Sec:general} The new system provides many commands designed to help you produce well-structured class and package files that are both robust and portable. This section outlines some ways to make intelligent use of these. \subsubsection{Loading other files} \label{Sec:loading} \NEWdescription{1995/12/01} \LaTeX{} provides these commands: \begin{verbatim} \LoadClass \LoadClassWithOptions \RequirePackage \RequirePackageWithOptions \end{verbatim} for using classes or packages inside other classes or packages. We recommend strongly that you use them, rather than the primitive |\input| command, for a number of reasons. Files loaded with |\input <filename>| will not be listed in the |\listfiles| list. If a package is always loaded with |\RequirePackage...| or |\usepackage| then, even if its loading is requested several times, it will be loaded only once. By contrast, if it is loaded with |\input| then it can be loaded more than once; such an extra loading may waste time and memory and it may produce strange results. If a package provides option-processing then, again, strange results are possible if the package is |\input| rather than loaded by means of |\usepackage| or |\RequirePackage...|. If the package |foo.sty| loads the package |baz.sty| by use of |\input baz.sty| then the user will get a warning: \begin{verbatim} LaTeX Warning: You have requested package `foo', but the package provides `baz'. \end{verbatim} Thus, for several reasons, using |\input| to load packages is not a good idea. Unfortunately, if you are upgrading the file |myclass.sty| to a class file then you have to make sure that any old files which contain |\input myclass.sty| still work. This was also true for the standard classes (|article|, |book| and |report|), since a lot of existing \LaTeX~2.09 document styles contain |\input article.sty|. The approach which we use to solve this is to provide minimal files |article.sty|, |book.sty| and |report.sty|, which simply load the appropriate class files. For example, |article.sty| contains just the following lines: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \@obsoletefile{article.cls}{article.sty} \LoadClass{article} \end{verbatim} You may wish to do the same or, if you think that it is safe to do so, you may decide to just remove |myclass.sty|. \subsubsection{Make it robust} We consider it good practice, when writing packages and classes, to use \LaTeX{} commands as much as possible. Thus, instead of using |\def...| we recommend using one of |\newcommand|, |\renewcommand| or |\providecommand|; |\CheckCommand| is also useful. Doing this makes it less likely that you will inadvertently redefine a command, giving unexpected results. When you define an environment, use |\newenvironment| or |\renewenvironment| instead |\def\foo{...}| and |\def\endfoo{...}|. If you need to set or change the value of a \m{dimen} or \m{skip} register, use |\setlength|. To manipulate boxes, use \LaTeX{} commands such as |\sbox|, |\mbox| and |\parbox| rather than |\setbox|, |\hbox| and |\vbox|. Use |\PackageError|, |\PackageWarning| or |\PackageInfo| (or the equivalent class commands) rather than |\@latexerr|, |\@warning| or |\wlog|. It is still possible to declare options by defining |\ds@<option>| and calling |\@options|; but we recommend the |\DeclareOption| and |\ProcessOptions| commands instead. These are more powerful and use less memory. So rather than using: \begin{verbatim} \def\ds@draft{\overfullrule 5pt} \@options \end{verbatim} you should use: \begin{verbatim} \DeclareOption{draft}{\setlength{\overfullrule}{5pt}} \ProcessOptions\relax \end{verbatim} The advantage of this kind of practice is that your code is more readable and, more important, that it is less likely to break when used with future versions of \LaTeX{}. \subsubsection{Make it portable} It is also sensible to make your files are as portable as possible. To ensure this; they should contain only visible 7-bit text; and the filenames should contain at most eight characters (plus the three letter extension). Also, of course, it \textbf{must not} have the same name as a file in the standard \LaTeX{} distribution, however similar its contents may be to one of these files. It is also useful if local classes or packages have a common prefix, for example the University of Nowhere classes might begin with |unw|. This helps to avoid every University having its own thesis class, all called |thesis.cls|. If you rely on some features of the \LaTeX{} kernel, or on a package, please specify the release-date you need. For example, the package error commands were introduced in the June 1994 release so, if you use them then you should put: \begin{verbatim} \NeedsTeXFormat{LaTeX2e}[1994/06/01] \end{verbatim} \subsubsection{Useful hooks} Some packages and document styles had to redefine the command |\document| or |\enddocument| to achieve their goal. This is no longer necessary. You can now use the `hooks' |\AtBeginDocument| and |\AtEndDocument| (see Section~\ref{Sec:delays}). Again, using these hooks makes it less likely that your code breaks with future versions of \LaTeX{}. It also makes it more likely that your package can work together with someone else's. \NEWdescription{1996/12/01} However, note that code in the |\AtBeginDocument| hook is part of the preamble. Thus there are restrictions on what can be put there; in particular, no typesetting can be done. \section{The structure of a class or package} \label{Sec:structure} \LaTeXe{} classes and packages have more structure than \LaTeX~2.09 style files did. The outline of a class or package file is: \begin{description} \item[Identification] The file says that it is a \LaTeXe{} package or class, and gives a short description of itself. \item[Preliminary declarations] Here the file declares some commands and can also load other files. Usually these commands will be just those needed for the code used in the declared options. \item[Options] The file declares and processes its options. \item[More declarations] This is where the file does most of its work: declaring new variables, commands and fonts; and loading other files. \end{description} \subsection{Identification} The first thing a class or package file does is identify itself. Package files do this as follows: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesPackage{<package>}[<date> <other information>] \end{verbatim} For example: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesPackage{latexsym}[1994/06/01 Standard LaTeX package] \end{verbatim} Class files do this as follows: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesClass{<class-name>}[<date> <other information>] \end{verbatim} For example: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesClass{article}[1994/06/01 Standard LaTeX class] \end{verbatim} \NEWdescription{1998/06/19} The \m{date} should be given in the form `\textsc{yyyy/mm/dd}' and must be present if the optional argument is used (this is also true for the |\NeedsTeXFormat| command). Any derivation from this syntax will result in low-level \TeX{} errors---the commands expect a valid syntax to speed up the daily usage of the package or class and make no provision for the case that the developer made a mistake! This date is checked whenever a user specifies a date in their |\documentclass| or |\usepackage| command. For example, if you wrote: \begin{verbatim} \documentclass{article}[1995/12/23] \end{verbatim} then users at a different location would get a warning that their copy of |article| was out of date. The description of a class is displayed when the class is used. The description of a package is put into the log file. These descriptions are also displayed by the |\listfiles| command. The phrase \texttt{Standard LaTeX} \textbf{must not} be used in the identification banner of any file other than those in the standard \LaTeX{} distribution. \subsection{Using classes and packages} The first major difference between \LaTeX~2.09 style files and \LaTeXe{} packages and classes is that \LaTeXe{} supports \emph{modularity}, in the sense of building files from small building-blocks rather than using large single files. A \LaTeX{} package or class can load a package as follows: \begin{verbatim} \RequirePackage[<options>]{<package>}[<date>] \end{verbatim} For example: \begin{verbatim} \RequirePackage{ifthen}[1994/06/01] \end{verbatim} This command has the same syntax as the author command |\usepackage|. It allows packages or classes to use features provided by other packages. For example, by loading the |ifthen| package, a package writer can use the `if\dots then\dots else\dots' commands provided by that package. A \LaTeX{} class can load one other class as follows: \begin{verbatim} \LoadClass[<options>]{<class-name>}[<date>] \end{verbatim} For example: \begin{verbatim} \LoadClass[twocolumn]{article} \end{verbatim} This command has the same syntax as the author command |\documentclass|. It allows classes to be based on the syntax and appearance of another class. For example, by loading the |article| class, a class writer only has to change the bits of |article| they don't like, rather than writing a new class from scratch. \NEWfeature{1995/12/01} The following commands can be used in the common case that you want to simply load a class or package file with exactly those options that are being used by the current class. \begin{verbatim} \LoadClassWithOptions{<class-name>}[<date>] \RequirePackageWithOptions{<package>}[<date>] \end{verbatim} For example: \begin{verbatim} \LoadClassWithOptions{article} \RequirePackageWithOptions{graphics}[1995/12/01] \end{verbatim} \subsection{Declaring options} \NEWdescription{1998/12/01} The other major difference between \LaTeX~2.09 styles and \LaTeXe{} packages and classes is in option handling. Packages and classes can now declare options and these can be specified by authors; for example, the |twocolumn| option is declared by the |article| class. Note that the name of an option should contain only those characters allowed in a `\LaTeX{} name'; in particular it must not contain any control sequences. An option is declared as follows: \begin{verbatim} \DeclareOption{<option>}{<code>} \end{verbatim} For example, the |dvips| option (slightly simplified) to the |graphics| package is implemented as: \begin{verbatim} \DeclareOption{dvips}{\input{dvips.def}} \end{verbatim} This means that when an author writes |\usepackage[dvips]{graphics}|, the file |dvips.def| is loaded. As another example, the |a4paper| option is declared in the |article| class to set the |\paperheight| and |\paperwidth| lengths: \begin{verbatim} \DeclareOption{a4paper}{% \setlength{\paperheight}{297mm}% \setlength{\paperwidth}{210mm}% } \end{verbatim} Sometimes a user will request an option which the class or package has not explicitly declared. By default this will produce a warning (for classes) or error (for packages); this behaviour can be altered as follows: \begin{verbatim} \DeclareOption*{<code>} \end{verbatim} For example, to make the package |fred| produce a warning rather than an error for unknown options, you could specify: \begin{verbatim} \DeclareOption*{% \PackageWarning{fred}{Unknown option `\CurrentOption'}% } \end{verbatim} Then, if an author writes |\usepackage[foo]{fred}|, they will get a warning \texttt{Package fred Warning: Unknown option `foo'.} As another example, the |fontenc| package tries to load a file |<ENC>enc.def| whenever the \m{ENC} option is used. This can be done by writing: \begin{verbatim} \DeclareOption*{% \input{\CurrentOption enc.def}% } \end{verbatim} \NEWdescription{1998/12/01} It is possible to pass options on to another package or class, using the command |\PassOptionsToPackage| or |\PassOptionsToClass| (note that this is a specialised operation that works only for option names). For example, to pass every unknown option on to the |article| class, you can use: \begin{verbatim} \DeclareOption*{% \PassOptionsToClass{\CurrentOption}{article}% } \end{verbatim} If you do this then you should make sure you load the class at some later point, otherwise the options will never be processed! So far, we have explained only how to declare options, not how to execute them. To process the options with which the file was called, you should use: \begin{verbatim} \ProcessOptions\relax \end{verbatim} This executes the \m{code} for each option that was both specified and declared (see Section~\ref{Sec:commands.options} for details of how this is done). For example, if the |jane| package file contains: \begin{verbatim} \DeclareOption{foo}{\typeout{Saw foo.}} \DeclareOption{baz}{\typeout{Saw baz.}} \DeclareOption*{\typeout{What's \CurrentOption?}} \ProcessOptions\relax \end{verbatim} and an author writes |\usepackage[foo,bar]{jane}|, then they will see the messages \texttt{Saw foo.} and \texttt{What's bar?} \subsection{A minimal class file} Most of the work of a class or package is in defining new commands, or changing the appearance of documents. This is done in the body of the package, using commands such as |\newcommand| or |\setlength|. \LaTeXe{} provides several new commands to help class and package writers; these are described in detail in Section~\ref{Sec:commands}. There are four things that every class file \emph{must} contain: these are a definition of |\normalsize|, values for |\textwidth| and |\textheight| and a specification for page-numbering. So a minimal document class file\footnote {This class is now in the standard distribution, as \texttt{minimal.cls}.} looks like this: \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesClass{minimal}[1995/10/30 Standard LaTeX minimal class] \renewcommand{\normalsize}{\fontsize{10pt}{12pt}\selectfont} \setlength{\textwidth}{6.5in} \setlength{\textheight}{8in} \pagenumbering{arabic} % needed even though this class will % not show page numbers \end{verbatim} However, this class file will not support footnotes, marginals, floats, etc., nor will it provide any of the 2-letter font commands such as |\rm|; thus most classes will contain more than this minimum! \subsection{Example: a local letter class} A company may have its own letter class, for setting letters in the company style. This section shows a simple implementation of such a class, although a real class would need more structure. The class begins by announcing itself as |neplet.cls|. \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesClass{neplet}[1995/04/01 NonExistent Press letter class] \end{verbatim} Then this next bit passes any options on to the |letter| class, which is loaded with the |a4paper| option. \begin{verbatim} \DeclareOption*{\PassOptionsToClass{\CurrentOption}{letter}} \ProcessOptions\relax \LoadClass[a4paper]{letter} \end{verbatim} In order to use the company letter head, it redefines the |firstpage| page style: this is the page style that is used on the first page of letters. \begin{verbatim} \renewcommand{\ps@firstpage}{% \renewcommand{\@oddhead}{<letterhead goes here>}% \renewcommand{\@oddfoot}{<letterfoot goes here>}% } \end{verbatim} And that's it! \subsection{Example: a newsletter class} A simple newsletter can be typeset with \LaTeX{}, using a variant of the |article| class. The class begins by announcing itself as |smplnews.cls|. \begin{verbatim} \NeedsTeXFormat{LaTeX2e} \ProvidesClass{smplnews}[1995/04/01 The Simple News newsletter class] \newcommand{\headlinecolor}{\normalcolor} \end{verbatim} It passes most specified options on to the |article| class: apart from the |onecolumn| option, which is switched off, and the |green| option, which sets the headline in green. \begin{verbatim} \DeclareOption{onecolumn}{\OptionNotUsed} \DeclareOption{green}{\renewcommand{\headlinecolor}{\color{green}}} \DeclareOption*{\PassOptionsToClass{\CurrentOption}{article}} \ProcessOptions\relax \end{verbatim} It then loads the class |article| with the option |twocolumn|. \begin{verbatim} \LoadClass[twocolumn]{article} \end{verbatim} Since the newsletter is to be printed in colour, it now loads the |color| package. The class does not specify a device driver option since this should be specified by the user of the |smplnews| class. \begin{verbatim} \RequirePackage{color} \end{verbatim} The class then redefines |\maketitle| to produce the title in 72pt Helvetica bold oblique, in the appropriate colour. \begin{verbatim} \renewcommand{\maketitle}{% \twocolumn[% \fontsize{72}{80}\fontfamily{phv}\fontseries{b}% \fontshape{sl}\selectfont\headlinecolor \@title ]% } \end{verbatim} It redefines |\section| and switches off section numbering. \begin{verbatim} \renewcommand{\section}{% \@startsection {section}{1}{0pt}{-1.5ex plus -1ex minus -.2ex}% {1ex plus .2ex}{\large\sffamily\slshape\headlinecolor}% } \setcounter{secnumdepth}{0} \end{verbatim} It also sets the three essential things. \begin{verbatim} \renewcommand{\normalsize}{\fontsize{9}{10}\selectfont} \setlength{\textwidth}{17.5cm} \setlength{\textheight}{25cm} \end{verbatim} In practice, a class would need more than this: it would provide commands for issue numbers, authors of articles, page styles and so on; but this skeleton gives a start. The |ltnews| class file is not much more complex than this one. \section{Commands for class and package writers} \label{Sec:commands} This section describes briefly each of the new commands for class and package writers. To find out about other aspects of the new system, you should also read \emph{\LaTeXbook}, \emph{\LaTeXcomp} and \emph{\usrguide}. \subsection{Identification} The first group of commands discussed here are those used to identify your class or package file. \begin{decl} |\NeedsTeXFormat| \arg{format-name} \oarg{release-date} \end{decl} This command tells \TeX{} that this file should be processed using a format with name \m{format-name}. You can use the optional argument \m{release-date} to further specify the earliest release date of the format that is needed. When the release date of the format is older than the one specified a warning will be generated. The standard \m{format-name} is \texttt{LaTeX2e}. The date, if present, must be in the form \textsc{yyyy/mm/dd}. Example: \begin{verbatim} \NeedsTeXFormat{LaTeX2e}[1994/06/01] \end{verbatim} \begin{decl} |\ProvidesClass| \arg{class-name} \oarg{release-info} \\ |\ProvidesPackage| \arg{package-name} \oarg{release-info} \end{decl} This declares that the current file contains the definitions for the document class \m{class-name} or package \m{package-name}. The optional \m{release-info}, if used, must contain: \begin{itemize} \item the release date of this version of the file, in the form \textsc{yyyy/mm/dd}; \item optionally followed by a space and a short description, possibly including a version number. \end{itemize} The above syntax must be followed exactly so that this information can be used by |\LoadClass| or |\documentclass| (for classes) or |\RequirePackage| or |\usepackage| (for packages) to test that the release is not too old. The whole of this \m{release-info} information is displayed by |\listfiles| and should therefore not be too long. Example: \begin{verbatim} \ProvidesClass{article}[1994/06/01 v1.0 Standard LaTeX class] \ProvidesPackage{ifthen}[1994/06/01 v1.0 Standard LaTeX package] \end{verbatim} \begin{decl} |\ProvidesFile| \arg{file-name} \oarg{release-info} \end{decl} This is similar to the two previous commands except that here the full filename, including the extension, must be given. It is used for declaring any files other than main class and package files. Example: \begin{verbatim} \ProvidesFile{T1enc.def}[1994/06/01 v1.0 Standard LaTeX file] \end{verbatim} Note that the phrase \texttt{Standard LaTeX} \textbf{must not} be used in the identification banner of any file other than those in the standard \LaTeX{} distribution. \subsection{Loading files} \label{Sec:loadf} \NEWfeature{1995/12/01} This group of commands can be used to create your own document class or package by building on existing classes or packages. \begin{decl} |\RequirePackage| \oarg{options-list} \arg{package-name} \oarg{release-info}\\ |\RequirePackageWithOptions| \arg{package-name} \oarg{release-info} \end{decl} Packages and classes should use these commands to load other packages. The use of |\RequirePackage| is the same as the author command |\usepackage|. Examples: \begin{verbatim} \RequirePackage{ifthen}[1994/06/01] \RequirePackageWithOptions{graphics}[1995/12/01] \end{verbatim} \begin{decl} |\LoadClass| \oarg{options-list} \arg{class-name} \oarg{release-info}\\ |\LoadClassWithOptions| \arg{class-name} \oarg{release-info} \end{decl} \NEWfeature{1995/12/01} These commands are for use \emph{only} in class files, they cannot be used in packages files; they can be used at most once within a class file. The use of|\LoadClass| is the same as the use of |\documentclass| to load a class file. Examples: \begin{verbatim} \LoadClass{article}[1994/06/01] \LoadClassWithOptions{article}[1995/12/01] \end{verbatim} \NEWfeature{1995/12/01} The two |WithOptions| versions simply load the class (or package) file with exactly those options that are being used by the current file (class or package). See below, in \ref{Sec:opmove}, for further discussion of their use. \subsection{Option declaration} \label{Sec:commands.options.dec} \NEWdescription{1998/12/01} The following commands deal with the declaration and handling of options to document classes and packages. Every option name must be a `\LaTeX{} name'. There are some commands designed especially for use within the \m{code} argument of these commands (see below). \begin{decl} |\DeclareOption| \arg{option-name} \arg{code} \end{decl} This makes \m{option-name} a `declared option' of the class or package in which it is put. The \m{code} argument contains the code to be executed if that option is specified for the class or package; it can contain any valid \LaTeXe{} construct. Example: \begin{verbatim} \DeclareOption{twoside}{\@twosidetrue} \end{verbatim} \begin{decl} |\DeclareOption*| \arg{code} \end{decl} This declares the \m{code} to be executed for every option which is specified for, but otherwise not explicitly declared by, the class or package; this code is called the `default option code' and it can contain any valid \LaTeXe{} construct. If a class file contains no |\DeclareOption*| then, by default, all specified but undeclared options for that class will be silently passed to all packages (as will the specified and declared options for that class). If a package file contains no |\DeclareOption*| then, by default, each specified but undeclared option for that package will produce an error. \subsection{Commands within option code} \label{Sec:within.code} These two commands can be used only within the \m{code} argument of either |\DeclareOption| or |\DeclareOption*|. Other commands commonly used within these arguments can be found in the next few subsections. \begin{decl} |\CurrentOption| \end{decl} This expands to the name of the current option. \begin{decl} |\OptionNotUsed| \end{decl} This causes the current option to be added to the list of `unused options'. \NEWfeature{1995/06/01} You can now include hash marks (\texttt{\#}) within these \m{code} arguments without special treatment (formerly, it had been necessary to double them). \subsection{Moving options around} \label{Sec:opmove} These two commands are also very useful within the \m{code} argument of |\DeclareOption| or |\DeclareOption*|: \begin{decl} |\PassOptionsToPackage| \arg{options-list} \arg{package-name}\\ |\PassOptionsToClass| \arg{options-list} \arg{class-name} \end{decl} The command |\PassOptionsToPackage| passes the option names in \m{options-list} to package \m{package-name}. This means that it adds the \m{option-list} to the list of options used by any future |\RequirePackage| or |\usepackage| command for package \m{package-name}. Example: \begin{verbatim} \PassOptionsToPackage{foo,bar}{fred} \RequirePackage[baz]{fred} \end{verbatim} is the same as: \begin{verbatim} \RequirePackage[foo,bar,baz]{fred} \end{verbatim} Similarly, |\PassOptionsToClass| may be used in a class file to pass options to another class to be loaded with |\LoadClass|. \NEWdescription{1995/12/01} The effects and use of these two commands should be contrasted with those of the following two (documented above, in \ref{Sec:loadf}): \begin{verbatim} \LoadClassWithOptions \RequirePackageWithOptions \end{verbatim} The command|\RequirePackageWithOptions| is similar to |\RequirePackage|, but it always loads the required package with exactly the same option list as that being used by the current class or package, rather than with any option explicitly supplied or passed on by |\PassOptionsToPackage|. The main purpose of |\LoadClassWithOptions| is to allow one class to simply build on another, for example: \begin{verbatim} \LoadClassWithOptions{article} \end{verbatim} This should be compared with the slightly different construction \begin{verbatim} \DeclareOption*{\PassOptionsToClass{\CurrentOption}{article}} \ProcessOptions\relax \LoadClass{article} \end{verbatim} As used above, the effects are more or less the same, but the first is a lot less to type; also the |\LoadClassWithOptions| method runs slightly quicker. If, however, the class declares options of its own then the two constructions are different. Compare, for example: \begin{verbatim} \DeclareOption{landscape}{\@landscapetrue} \ProcessOptions\relax \LoadClassWithOptions{article} \end{verbatim} with: \begin{verbatim} \DeclareOption{landscape}{\@landscapetrue} \DeclareOption*{\PassOptionsToClass{\CurrentOption}{article}} \ProcessOptions\relax \LoadClass{article} \end{verbatim} In the first example, the \textsf{article} class will be loaded with option |landscape| precisely when the current class is called with this option. By contrast, in the second example it will never be called with option \texttt{landscape} as in that case \textsf{article} is passed options only by the default option handler, but this handler is not used for |landscape| because that option is explicitly declared. \subsection{Delaying code} \label{Sec:delays} These first two commands are also intended primarily for use within the \m{code} argument of |\DeclareOption| or |\DeclareOption*|. \begin{decl} |\AtEndOfClass| \arg{code}\\ |\AtEndOfPackage| \arg{code} \end{decl} These commands declare \m{code} that is saved away internally and then executed after processing the whole of the current class or package file. Repeated use of these commands is permitted: the code in the arguments is stored (and later executed) in the order of their declarations. \begin{decl} |\AtBeginDocument| \arg{code}\\ |\AtEndDocument| \arg{code} \end{decl} These commands declare \m{code} to be saved internally and executed while \LaTeX{} is executing |\begin{document}| or |\end{document}|. The \m{code} specified in the argument to |\AtBeginDocument| is executed near the end of the |\begin{document}| code, \emph{after} the font selection tables have been set up. It is therefore a useful place to put code which needs to be executed after everything has been prepared for typesetting and when the normal font for the document is the current font. \NEWdescription{1995/12/01} The |\AtBeginDocument| hook should not be used for code that does any typesetting since the typeset result would be unpredictable. The \m{code} specified in the argument to |\AtEndDocument| is executed at the beginning of the |\end{document}| code, \emph{before} the final page is finished and before any leftover floating environments are processed. If some of the \m{code} is to be executed after these two processes, you should include a |\clearpage| at the appropriate point in \m{code}. Repeated use of these commands is permitted: the code in the arguments is stored (and later executed) in the order of their declarations. \begin{decl}[1994/12/01] |\AtBeginDvi| \arg{specials} \end{decl} These commands save in a box register things which are written to the |.dvi| file at the beginning of the `shipout' of the first page of the document. This should not be used for anything that will add any typeset material to the |.dvi| file. Repeated use of this command is permitted. \subsection{Option processing} \label{Sec:commands.options} \begin{decl} |\ProcessOptions| \end{decl} This command executes the \m{code} for each selected option. We shall first describe how |\ProcessOptions| works in a package file, and then how this differs in a class file. To understand in detail what |\ProcessOptions| does in a package file, you have to know the difference between \emph{local} and \emph{global} options. \begin{itemize} \item \textbf{Local options} are those which have been explicitly specified for this particular package in the \m{options} argument of any of these: \begin{quote} |\PassOptionsToPackage{<options>}| \ |\usepackage[<options>]|\\ |\RequirePackage[<options>]| \end{quote} \item \textbf{Global options} are any other options that are specified by the author in the \m{options} argument of |\documentclass[<options>]|. \end{itemize} For example, suppose that a document begins: \begin{verbatim} \documentclass[german,twocolumn]{article} \usepackage{gerhardt} \end{verbatim} whilst package |gerhardt| calls package |fred| with: \begin{verbatim} \PassOptionsToPackage{german,dvips,a4paper}{fred} \RequirePackage[errorshow]{fred} \end{verbatim} then: \begin{itemize} \item |fred|'s local options are |german|, |dvips|, |a4paper| and |errorshow|; \item |fred|'s only global option is |twocolumn|. \end{itemize} When |\ProcessOptions| is called, the following happen. \begin{itemize} \item \emph{First}, for each option so far declared in |fred.sty| by |\DeclareOption|, it looks to see if that option is either a global or a local option for |fred|: if it is then the corresponding code is executed. This is done in the order in which these options were declared in |fred.sty|. \item \emph{Then}, for each remaining \emph{local} option, the command |\ds@<option>| is executed if it has been defined somewhere (other than by a |\DeclareOption|); otherwise, the `default option code' is executed. If no default option code has been declared then an error message is produced. This is done in the order in which these options were specified. \end{itemize} Throughout this process, the system ensures that the code declared for an option is executed at most once. Returning to the example, if |fred.sty| contains: \begin{verbatim} \DeclareOption{dvips}{\typeout{DVIPS}} \DeclareOption{german}{\typeout{GERMAN}} \DeclareOption{french}{\typeout{FRENCH}} \DeclareOption*{\PackageWarning{fred}{Unknown `\CurrentOption'}} \ProcessOptions\relax \end{verbatim} then the result of processing this document will be: \begin{verbatim} DVIPS GERMAN Package fred Warning: Unknown `a4paper'. Package fred Warning: Unknown `errorshow'. \end{verbatim} Note the following: \begin{itemize} \item the code for the |dvips| option is executed before that for the |german| option, because that is the order in which they are declared in |fred.sty|; \item the code for the |german| option is executed only once, when the declared options are being processed; \item the |a4paper| and |errorshow| options produce the warning from the code declared by |\DeclareOption*| (in the order in which they were specified), whilst the |twocolumn| option does not: this is because |twocolumn| is a global option. \end{itemize} In a class file, |\ProcessOptions| works in the same way, except that: \emph{all} options are local; and the default value for |\DeclareOption*| is |\OptionNotUsed| rather than an error. \NEWdescription{1995/12/01} Note that, because |\ProcessOptions| has a |*|-form, it is wise to follow the non-star form with |\relax|, as in the previous examples, since this prevents unnecessary look ahead and possibly misleading error messages being issued. \begin{decl} |\ProcessOptions*| \\ |\@options| \end{decl} This is like |\ProcessOptions| but it executes the options in the order specified in the calling commands, rather than in the order of declaration in the class or package. For a package this means that the global options are processed first. The |\@options| command from \LaTeX~2.09 has been made equivalent to this in order to ease the task of updating old document styles to \LaTeXe{} class files. \begin{decl} |\ExecuteOptions| \arg{options-list} \end{decl} For each option in the \m{options-list}, in order, this command simply executes the command |\ds@<option>| (if this command is not defined, then that option is silently ignored). It can be used to provide a `default option list' just before |\ProcessOptions|. For example, suppose that in a class file you want to set up the default design to be: two-sided printing; 11pt fonts; in two columns. Then it could specify: \begin{verbatim} \ExecuteOptions{11pt,twoside,twocolumn} \end{verbatim} \subsection{Safe file commands} These commands deal with file input; they ensure that the non-existence of a requested file can be handled in a user-friendly way. \begin{decl} |\IfFileExists| \arg{file-name} \arg{true} \arg{false} \end{decl} If the file exists then the code specified in \m{true} is executed. If the file does not exist then the code specified in \m{false} is executed. This command does \emph{not} input the file. \begin{decl} |\InputIfFileExists| \arg{file-name} \arg{true} \arg{false} \end{decl} This inputs the file \m{file-name} if it exists and, immediately before the input, the code specified in \m{true} is executed. If the file does not exist then the code specified in \m{false} is executed. It is implemented using |\IfFileExists|. \subsection{Reporting errors, etc} These commands should be used by third party classes and packages to report errors, or to provide information to authors. \begin{decl} |\ClassError| \arg{class-name} \arg{error-text} \arg{help-text}\\ |\PackageError| \arg{package-name} \arg{error-text} \arg{help-text} \end{decl} These produce an error message. The \m{error-text} is displayed and the |?| error prompt is shown. If the user types |h|, they will be shown the \m{help-text}. Within the \m{error-text} and \m{help-text}: |\protect| can be used to stop a command from expanding; |\MessageBreak| causes a line-break; and |\space| prints a space. Note that the \m{error-text} will have a full stop added to it, so do not put one into the argument. For example: \begin{verbatim} \newcommand{\foo}{FOO} \PackageError{ethel}{% Your hovercraft is full of eels,\MessageBreak and \protect\foo\space is \foo }{% Oh dear! Something's gone wrong.\MessageBreak \space \space Try typing \space <<return>> \space to proceed, ignoring \protect\foo. } \end{verbatim} produces this display: \begin{verbatim} ! Package ethel Error: Your hovercraft is full of eels, (ethel) and \foo is FOO. See the ethel package documentation for explanation. \end{verbatim} If the user types |h|, this will be shown: \begin{verbatim} Oh dear! Something's gone wrong. Try typing <<return>> to proceed, ignoring \foo. \end{verbatim} \begin{decl} |\ClassWarning| \arg{class-name} \arg{warning-text}\\ |\PackageWarning| \arg{package-name} \arg{warning-text}\\ |\ClassWarningNoLine| \arg{class-name} \arg{warning-text}\\ |\PackageWarningNoLine| \arg{package-name} \arg{warning-text}\\ |\ClassInfo| \arg{class-name} \arg{info-text}\\ |\PackageInfo| \arg{package-name} \arg{info-text} \end{decl} The four |Warning| commands are similar to the error commands, except that they produce only a warning on the screen, with no error prompt. The first two, |Warning| versions, also show the line number where the warning occurred, whilst the second two, |WarningNoLine| versions, do not. The two |Info| commands are similar except that they log the information only in the transcript file, including the line number. There are no |NoLine| versions of these two. Within the \m{warning-text} and \m{info-text}: |\protect| can be used to stop a command from expanding; |\MessageBreak| causes a line-break; and |\space| prints a space. Also, these should not end with a full stop as one is automatically added. \subsection{Defining commands} \label{Sec:commands.define} \LaTeXe{} provides some extra methods of (re)defining commands that are intended for use in class and package files. \NEWfeature{1994/12/01} The \texttt{*}-forms of these commands should be used to define commands that are not, in \TeX{} terms, long. This can be useful for error-trapping with commands whose arguments are not intended to contain whole paragraphs of text. \begin{decl} |\DeclareRobustCommand| \arg{cmd} \oarg{num} \oarg{default} \arg{definition}\\ |\DeclareRobustCommand*| \arg{cmd} \oarg{num} \oarg{default} \arg{definition} \end{decl} This command takes the same arguments as |\newcommand| but it declares a robust command, even if some code within the\m{definition} is fragile. You can use this command to define new robust commands, or to redefine existing commands and make them robust. A log is put into the transcript file if a command is redefined. For example, if |\seq| is defined as follows: \begin{verbatim} \DeclareRobustCommand{\seq}[2][n]{% \ifmmode #1_{1}\ldots#1_{#2}% \else \PackageWarning{fred}{You can't use \protect\seq\space in text}% \fi } \end{verbatim} Then the command |\seq| can be used in moving arguments, even though |\ifmmode| cannot, for example: \begin{verbatim} \section{Stuff about sequences $\seq{x}$} \end{verbatim} Note also that there is no need to put a |\relax| before the |\ifmmode| at the beginning of the definition; this is because the protection given by this |\relax| against expansion at the wrong time will be provided internally. \begin{decl} |\CheckCommand| \arg{cmd} \oarg{num} \oarg{default} \arg{definition}\\ |\CheckCommand*| \arg{cmd} \oarg{num} \oarg{default} \arg{definition} \end{decl} This takes the same arguments as |\newcommand| but, rather than define \m{cmd}, it just checks that the current definition of \m{cmd} is exactly as given by \m{definition}. An error is raised if these definitions differ. This command is useful for checking the state of the system before your package starts altering the definitions of commands. It allows you to check, in particular, that no other package has redefined the same command. \subsection{Moving arguments} \NEWdescription{1994/12/01} The setting of protect whilst processing (i.e.~moving) moving arguments has been reimplemented, as has the method of writing information from the |.aux| file to other files such as the |.toc| file. Details can be found in the file |ltdefns.dtx|. We hope that these changes will not affect many packages. \section{Miscellaneous commands, etc} \label{Sec:commands.misc} \subsection{Layout parameters} \begin{decl} |\paperheight|\\ |\paperwidth| \end{decl} These two parameters are usually set by the class to be the size of the paper being used. This should be actual paper size, unlike |\textwidth| and |\textheight| which are the size of the main text body within the margins. \subsection{Case changing} \label{sec:case} \begin{decl} |\MakeUppercase| \arg{text} \\ |\MakeLowercase| \arg{text} \end{decl} \NEWfeature{1995/06/01} \TeX{} provides two primitives |\uppercase| and |\lowercase| for changing the case of text. These are sometimes used in document classes, for example to set information in running heads in all capitals. Unfortunately, these \TeX{} primitives do not change the case of characters accessed by commands like |\ae| or |\aa|. To overcome this problem, \LaTeX{} provides two new commands |\MakeUppercase| and |\MakeLowercase| to do this. For example: \begin{quotation} \begin{tabular}{rl} |\uppercase{aBcD\ae\AA\ss\OE}| & \uppercase{aBcD\ae\AA\ss\OE}\\ |\lowercase{aBcD\ae\AA\ss\OE}| & \lowercase{aBcD\ae\AA\ss\OE}\\ |\MakeUppercase{aBcD\ae\AA\ss\OE}| & \MakeUppercase{aBcD\ae\AA\ss\OE}\\ |\MakeLowercase{aBcD\ae\AA\ss\OE}| & \MakeLowercase{aBcD\ae\AA\ss\OE} \end{tabular} \end{quotation} The commands |\MakeUppercase| and |\MakeLowercase| themselves are robust, but they have moving arguments. The commands use the \TeX{} primitives |\uppercase| and |\lowercase|, and so have a number of unexpected `features'. In particular, they change the case of everything (except characters in the names of control-sequences) in their text argument: this includes mathematics, environment names, and label names. For example: \begin{verbatim} \MakeUppercase{$x+y$ in \ref{foo}} \end{verbatim} produces $X+Y$ and the warning: \begin{verbatim} LaTeX Warning: Reference `FOO' on page ... undefined on ... \end{verbatim} In the long run, we would like to use all-caps fonts rather than any command like |\MakeUppercase| but this is not possible at the moment because such fonts do not exist. \NEWdescription{1995/12/01} In order that upper/lower-casing will work reasonably well, and in order to provide any correct hyphenation, \LaTeXe{} \emph{must} use, throughout a document, the same fixed table for changing case. The table used is designed for the font encoding |T1|; this works well with the standard \TeX{} fonts for all Latin alphabets but will cause problems when using other alphabets. \subsection{The `openany' option in the `book' class} \NEWdescription{1996/06/01} The |openany| option allows chapter and similar openings to occur on left hand pages. Previously this option affected only |\chapter| and |\backmatter|. It now also affects |\part|, |\frontmatter| and |\mainmatter|. \subsection{Better user-defined math display environments} \begin{decl} |\ignorespacesafterend| \end{decl} \NEWfeature{1996/12/01} \NEWdescription{2003/12/01} Suppose that you want to define an environment for displaying text that is numbered as an equation. A straightforward way to do this is as follows: \begin{verbatim} \newenvironment{texteqn} {\begin{equation} \begin{minipage}{0.9\linewidth}} {\end{minipage} \end{equation}} \end{verbatim} However, if you have tried this then you will probably have noticed that it does not work perfectly when used in the middle of a paragraph because an inter-word space appears at the beginning of the first line after the environment. There is now an extra command (with a very long name) available that you can use to avoid this problem; it should be inserted as shown here: \begin{verbatim} \newenvironment{texteqn} {\begin{equation} \begin{minipage}{0.9\linewidth}} {\end{minipage} \end{equation} \ignorespacesafterend} \end{verbatim} This command may also have other uses. \subsection{Normalising spacing} \begin{decl} |\normalsfcodes| \end{decl} \NEWfeature{1997/06/01} This command should be used to restore the normal settings of the parameters that affect spacing between words, sentences, etc. An important use of this feature is to correct a problem, reported by Donald Arseneau, that punctuation in page headers has always (in all known \TeX{} formats) been potentially wrong whenever a page break happens while a local setting of the space codes is in effect. These space codes are changed by, for example, the command \verb|\frenchspacing|) and the \textsf{verbatim} environment. It is normally given the correct definition automatically in |\begin{document}| and so need not be explicitly set; however, if it is explicitly made nonempty in a class file then automatic default setting will be over-ridden. \section{Upgrading \LaTeX~2.09 classes and packages} \label{Sec:upgrade} This section describes the changes you may need to make when you upgrade an existing \LaTeX{} style to a package or class but we shall start in optimistic mode. Many existing style files will run with \LaTeXe{} without any modification to the file itself. When everything is running OK, please put a note in the newly created package or class file to record that it runs with the new standard \LaTeX{}; then distribute it to your users. \subsection{Try it first!} \label{Sec:try-it} The first thing you should do is to test your style in `compatibility mode'. The only change you need to make in order to do this is, possibly, to change the extension of the file to |.cls|: you should make this change only if your file was used as a main document style. Now, without any other modifications, run \LaTeXe{} on a document that uses your file. This assumes that you have a suitable collection of files that tests all the functionality provided by your style file. (If you haven't, now is the time to make one!) You now need to change the test document files so that they are \LaTeXe{} documents: see \emph{\usrguide} for details of how to do this and then try them again. You have now tried the test documents in both \LaTeXe{} native mode and \LaTeX~2.09 compatibility mode. \subsection{Troubleshooting} \label{Sec:trouble} If your file does not work with \LaTeXe{}, there are two likely reasons. \begin{itemize} \item \LaTeX{} now has a robust, well-defined designer's interface for selecting fonts, which is very different from the \LaTeX~2.09 internals. \item Your style file may have used some \LaTeX~2.09 internal commands which have changed, or which have been removed. \end{itemize} When you are debugging your file, you will probably need more information than is normally displayed by \LaTeXe. This is achieved by resetting the counter |errorcontextlines| from its default value of $-1$ to a much higher value, e.g.~999. \subsection{Accommodating compatibility mode} Sometimes an existing collection of \LaTeX~2.09 documents makes it inconvenient or impossible to abandon the old commands entirely. If this is the case, then it is possible to accommodate both conventions by making special provision for documents processed in compatibility mode. \begin{decl} |\if@compatibility| \end{decl} This switch is set when a document begins with |\documentstyle| rather than |\documentclass|. Appropriate code can be supplied for either condition, as follows: \begin{verbatim} \if@compatibility <code emulating LaTeX 2.09 behavior> \else <code suitable for LaTeX2e> \fi \end{verbatim} \subsection{Font commands} Some font and size commands are now defined by the document class rather than by the \LaTeX{} kernel. If you are upgrading a \LaTeX~2.09 document style to a class that does not load one of the standard classes, then you will probably need to add definitions for these commands. \begin{decl} |\rm| |\sf| |\tt| |\bf| |\it| |\sl| |\sc| \end{decl} None of these short-form font selection commands are defined in the \LaTeXe{} kernel. They are defined by all the standard class files. If you want to define them in your class file, there are several reasonable ways to do this. One possible definition is: \begin{verbatim} \newcommand{\rm}{\rmfamily} ... \newcommand{\sc}{\scshape} \end{verbatim} This would make the font commands orthogonal; for example |{\bf\it text}| would produce bold italic, thus: \textbf{\textit{text}}. It will also make them produce an error if used in math mode. Another possible definition is: \begin{verbatim} \DeclareOldFontCommand{\rm}{\rmfamily}{\mathrm} ... \DeclareOldFontCommand{\sc}{\scshape}{\mathsc} \end{verbatim} This will make |\rm| act like |\rmfamily| in text mode (see above) and it will make |\rm| select the |\mathrm| math alphabet in math mode. Thus |${\rm math} = X + 1$| will produce `${\rm math} = X + 1$'. If you do not want font selection to be orthogonal then you can follow the standard classes and define: \begin{verbatim} \DeclareOldFontCommand{\rm}{\normalfont\rmfamily}{\mathrm} ... \DeclareOldFontCommand{\sc}{\normalfont\scshape}{\mathsc} \end{verbatim} This means, for example, that |{\bf\it text}| will produce medium weight (rather than bold) italic, thus: \textit{text}. \begin{decl} |\normalsize| \\ |\@normalsize| \end{decl} The command |\@normalsize| is retained for compatibility with \LaTeX~2.09 packages which may have used its value; but redefining it in a class file will have no effect since it is always reset to have the same meaning as |\normalsize|. This means that classes \emph{must} now redefine |\normalsize| rather than redefining |\@normalsize|; for example (a rather incomplete one): \begin{verbatim} \renewcommand{\normalsize}{\fontsize{10}{12}\selectfont} \end{verbatim} Note that |\normalsize| is defined by the \LaTeX{} kernel to be an error message. \begin{decl} |\tiny| |\footnotesize| |\small| |\large|\\ |\Large| |\LARGE| |\huge| |\Huge| \end{decl} None of these other `standard' size-changing commands are defined in the kernel: each needs to be defined in a class file if you need it. They are all defined by the standard classes. This means you should use |\renewcommand| for |\normalsize| and |\newcommand| for the other size-changing commands. \subsection{Obsolete commands} Some packages will not work with \LaTeXe{}, normally because they relied on an internal \LaTeX{} command which was never supported and has now changed, or been removed. In many cases there will now be a robust, high-level means of achieving what previously required low-level commands. Please consult Section~\ref{Sec:commands} to see if you can now use the \LaTeXe{} class and package writers commands. Also, of course, if your package or class redefined any of the kernel commands (i.e.~those defined in the files |latex.tex|, |slitex.tex|, |lfonts.tex|, |sfonts.tex|) then you will need to check it very carefully against the new kernel in case the implementation has changed or the command no longer exists in the \LaTeX2e{} kernel. Too many of the internal commands of \LaTeX~2.09 have been re-implemented or removed to be able to list them all here. You must check any that you have used or changed. We shall, however, list some of the more important commands which are no longer supported. \begin{decl} |\tenrm| |\elvrm| |\twlrm| \dots\\ |\tenbf| |\elvbf| |\twlbf| \dots\\ |\tensf| |\elvsf| |\twlsf| \dots\\ \qquad$\vdots$ \end{decl} The (approximately) seventy internal commands of this form are no longer defined. If your class or package uses them then \emph{please} replace them with new font commands described in \emph{\fntguide}. For example, the command |\twlsf| should be replaced by: \begin{verbatim} \fontsize{12}{14}\normalfont\sffamily\selectfont \end{verbatim} Another possibility is to use the |rawfonts| package, described in \emph{\usrguide}. Also, remember that many of the fonts preloaded by \LaTeX~2.09 are no longer preloaded. \begin{decl} |\vpt| |\vipt| |\viipt| \dots \end{decl} These were the internal size-selecting commands in \LaTeX~2.09. (They can still be used in \LaTeX~2.09 compatibility mode.) Please use the command |\fontsize| instead: see \emph{\fntguide} for details. For example, |\vpt| should be replaced by: \begin{verbatim} \fontsize{5}{6}\normalfont\selectfont \end{verbatim} \begin{decl} |\prm|, |\pbf|, |\ppounds|, |\pLaTeX| \dots \end{decl} \LaTeX~2.09 used several commands beginning with |\p| in order to provide `protected' commands. For example, |\LaTeX| was defined to be |\protect\pLaTeX|, and |\pLaTeX| was defined to produce the \LaTeX{} logo. This made |\LaTeX| robust, even though |\pLaTeX| was not. These commands have now been reimplemented using |\DeclareRobustCommand| (described in Section~\ref{Sec:commands.define}). If your package redefined one of the |\p|-commands then you must remove the redefinition and use |\DeclareRobustCommand| to redefine the non-|\p| command. \begin{decl} |\footheight|\\ |\@maxsep|\\ |\@dblmaxsep| \end{decl} These parameters are not used by \LaTeXe{} so they have been removed, except in \LaTeX~2.09 compatibility mode. Classes should no longer set them. \begin{thebibliography}{1} \bibitem{A-W:DEK91} Donald~E. Knuth. \newblock {\em The \TeX book}. \newblock Addison-Wesley, Reading, Massachusetts, 1986. \newblock Revised to cover \TeX3, 1991. \bibitem{A-W:LLa94} Leslie Lamport. \newblock {\em {\LaTeX:} A Document Preparation System}. \newblock Addison-Wesley, Reading, Massachusetts, second edition, 1994. \bibitem{A-W:MG2004} Frank Mittelbach and Michel Goossens. \newblock {\em The {\LaTeX} Companion second edition}. \newblock With Johannes Braams, David Carlisle, and Chris Rowley. \newblock Addison-Wesley, Reading, Massachusetts, 2004. \end{thebibliography} \newpage \thispagestyle{empty} \section*{\LaTeXe{} Summary sheet: updating old styles} Section references below are to \emph{\clsguide}. \begin{enumerate} \item Should it become a class or a package? See Section~\ref{Sec:classorpkg} for how to answer this question. \item If it uses another style file, then you will need to obtain an updated version of this other file. Look at Section~\ref{Sec:loading} for information on how to load other class and package files. \item Try it: see Section~\ref{Sec:try-it}. \item It worked? Excellent, but there are probably still some things you should change in order to make your file into a well-structured \LaTeXe{} file that is both robust and portable. So you should now read Section~\ref{Sec:writing}, especially~\ref{Sec:general}. You will also find some useful examples in Section~\ref{Sec:structure}. If your file sets up new fonts, font-changing commands or symbols, you should also read \emph{\fntguide}. \item It did not work? There are three possibilities here: \begin{itemize} \item error messages are produced whilst reading your file; \item error messages are produced whilst processing test documents; \item there are no errors but the output is not as it should be. \end{itemize} Don't forget to check carefully for this last possibility. If you have got to this stage then you will need to read Section~\ref{Sec:upgrade} to find the solutions that will make your file work. \end{enumerate} \end{document}

https://is.jabok.cz/cv/cv?uco=4104;zjazyk=cze;varianta=9;tiskproh=latex_rich

jabok.cz

CC-MAIN-2023-06

application/x-text

application/x-tex

crawl-data/CC-MAIN-2023-06/segments/1674764500671.13/warc/CC-MAIN-20230208024856-20230208054856-00041.warc.gz

\documentclass[12pt,a4paper]{artikel1} \usepackage{fancyheadings} \usepackage{palatino} \usepackage[latin2]{inputenc} \usepackage[T1]{fontenc} \newenvironment{ul}{\begin{itemize}}{\end{itemize}} \newenvironment{ol}{\begin{enumerate}}{\end{enumerate}} \newenvironment{vitae}[2]{\begingroup\cleardoublepage\thispagestyle{plain}\pagestyle{fancy}#1\def\cvname{#2}}% {\newpage\endgroup} \lhead{} \rhead{\cvname} \chead{} \cfoot{} \lfoot{} \rfoot{\thepage} \newcommand\nadpis{\section*} \newcommand\podnadpis{\subsection*} \newcommand\suv[1]{\quotesinglbase #1\textquoteright } \newcommand\duv[1]{\quotedblbase #1\textquotedblright } \parindent 0pt \clubpenalty10000 \widowpenalty 10000 \exhyphenpenalty10000 \begin{document} \begin{vitae}{\czech}{PhDr. Bc. Zuzana Svobodová} \nadpis{Profesní životopis} \vspace{0.8cm} \podnadpis{\textbf{Jméno} } \begin{ul} \item PhDr. Bc. Zuzana Svobodová, Ph.D., roz. Edelmannová (1973) \end{ul} \podnadpis{\textbf{Současná pracoviště} } \begin{ul} \item Jabok -- Vyšší odborná škola sociálně pedagogická a teologická, katedra teologie a filosofie\\ \item Husitská teologická fakulta Univerzity Karlovy, katedra učitelství\\ \item Teologická fakulta Jihočeské univerzity v Č. Budějovicích, katedra pedagogiky\\ \item 3. lékařská fakulta Univerzity Karlovy, Ústav etiky \end{ul} \podnadpis{\textbf{Akademické kvalifikace} } \begin{ul} \item 2004 \quad PhD., státní doktorská zkouška; Katedra občanské nauky a filosofie, Pedagogická fakulta Univerzity Karlovy v Praze, obor filosofie; disertační práce ?Nelhostejnost jako náboženská výchova?; \item 2005 \quad Ph.Dr., rigorózní řízení v oboru výuky všeobecně vzdělávacích předmětů; Pedagogická fakulta Univerzity Karlovy v Praze; \item 2002 \quad Bc., bakalářská zkouška, obor Pastoračně sociální asistent; Teologická fakulta Jihočeské univerzity v Č. Budějovicích; \item 1997 \quad Mgr., státní magisterská zkouška, 3 obory: Husitská teologie; Religionistika, teorie náboženství, filozofie; Psychosociální vědy; Husitská teologická fakulta Univerzity Karlovy v Praze; \item 1996 \quad zkouška z pedagogické způsobilosti (atest pro výuku náboženství a etiky), Husitská teologická fakulta Univerzity Karlovy v Praze; \item 1995 \quad Bc., bakalářská zkouška v oborech religionistika, teorie náboženství, filosofie, teologie, Husitská teologická fakulta Univerzity Karlovy v Praze; \end{ul} \podnadpis{\textbf{Přednášky, semináře, kurzy} } \begin{ul} \item Dějiny filosofického a teologického myšlení \item Filosofie výchovy \item Didaktika náboženské a etické výchovy \item Postmoderní filosofie \item Filosofie náboženské výchovy \item Křesťanské kořeny v evropské kultuře \item Dějiny filosofie \item Dějiny církevního vzdělávání \item Církev a dějiny \item Profesní učitelská etika \item Koncepce a didaktika etické výchovy \item Pedagogové ve starověku \item Člověk a řeč: Od mýtu k chatu \item Společenské determinanty volného času \item Akreditovaný kurz DVPP: ETIKA A ETICKÁ VÝCHOVA PRO VÝUKU NA ZÁKLADNÍ ŠKOLE (7 hodin) \item Akreditovaný kurz DVPP: KŘESŤANSKÉ KOŘENY V EVROPSKÉ KULTUŘE (6 hodin) \item Akreditovaný kurz DVPP: Etická výchova na primárním stupni škol v České republice (on-line kurz) \item Akreditovaný kurz DVPP: Etická výchova na primárním stupni škol v zahraničí (on-line kurz) \item Akreditovaný kurz DVPP: Plánování etické výchovy na základní škole (on-line kurz) \item Akreditovaný kurz DVPP: Etická výchova na sekundárním stupni vzdělávání v zahraničí (on-line kurz) \item Akreditovaný kurz DVPP: Etická výchova na gymnáziu ? současný stav a možnosti v České republice (on-line kurz) \item Akreditovaný kurz DVPP: Plánování etické výchovy na gymnáziu (on-line kurz) \item Akreditovaný kurz DVPP: Etika a etická výchova v zrcadle evropského školství (7 hodin) \item Akreditovaný kurz DVPP: Plánování předmětu etická výchova (7 hodin) \item \end{ul} \podnadpis{\textbf{Oblasti vědecké činnosti} } \begin{ul} \item filosofie výchovy \item teologie výchovy \item dějiny křesťanské kultury a křesťanského vzdělávání \item dějiny etického vzdělávání \item náboženská výchova a vzdělávání \item \end{ul} \podnadpis{\textbf{Dobrovolná činnost} } \begin{ul} \item Česká křesťanská akademie, pedagogická sekce \item členka občanského sdružení CEUPES (CENTRAL EUROPEAN PHILOSOPHY OF EDUCATION SOCIETY) \item Římskokatolická farnost Ořech, Kanonická mise ke katechetické službě -- výuce náboženství \end{ul} \podnadpis{\textbf{Ostatní odborná činnost} } \begin{ul} \item Šéfredaktorka časopisu Theology and Philosophy of Education (https://tape.academy) \item Členka redakční rady v časopisech: Studia Aloisiana (SK), Seminare. Learned Investigations -- journal: Warsaw (PL), Polska Myśl Pedagogiczna / Polish Pedagogical Thought: Krakow, Poland, PL \item Předsedkyně České společnosti pro katolickou teologii \item Předsedkyně Pedagogické sekce České křesťanské akademie \end{ul} \podnadpis{\textbf{Publikace}} \begin{ul} \item SVOBODOVÁ, Zuzana. Theology of Education and Philosophy of Education in Dialogue. \textit{Theology and Philosophy of Education\/}. Praha: Česká křesťanská akademie, Pedagogická sekce, 2022, roč.~1, č.~1, s.~1--2. ISSN~2788--1180. URL \textit{Odkaz na článek v časopisu\/} info \item SVOBODOVÁ, Zuzana. \textit{Svoboda z dialogu: Dílo Radima Palouše v rozhovoru s vybranými filosofy a teology výchovy\/}. Praha: Národohospodářský ústav Josefa Hlávky, 2022. 102 s. ISBN~978--80--88018--48--3. info \item SVOBODOVÁ, Zuzana. Freedom as an Aim of Education. \textit{Theology and Philosophy of Education\/}. Praha: Česká křesťanská akademie, Pedagogická sekce, 2022, roč.~1, č.~2, s.~1--2. ISSN~2788--1180. URL info \item SVOBODOVÁ, Zuzana. Unum ? verum ? bonum v Komenského metafyzických spisech v komparaci s cestou k obrazu Trojice v Augustinově díle De civitate dei a pohybem existence u Jana Patočky. \textit{Studia Aloisiana\/}. Bratislava: Teologická fakulta Trnavské univerzity, 2022, roč.~13, č.~1, s.~23--36. ISSN~1338--0508. info \item SVOBODOVÁ, Zuzana. Otevřená duše a banalita ve výchově. In Anna Hogenová. \textit{Nebezpečí, stáří, dnešek\/}. Praha: Pedagogická fakulta Univerzity Karlovy, 2022. s.~93--101. ISBN~978--80--11--01897--9. URL info \item SVOBODOVÁ, Zuzana. K pramenům naděje navzdory nejistotě. In Pelcová, Naděžda, Květoňová, Lea et al. \textit{Nejistota ve filosofické, speciálněpedagogické a psychologické reflexi. Inkluzivní škola\/}. Praha: Pedagogická fakulta Univerzity Karlovy, 2022. s.~47--54. ISBN~978--80--7603--332--0. doi:10.17613/8tnn--ph97. info \item SVOBODOVÁ, Zuzana a Andrea BLAŠČÍKOVÁ. Patočkov negatívny platonizmus ako príklad inšpirácie k ceste ľudskej zodpovednosti. In Švihura, Lukáš Arthur. \textit{Filozofické cesty z neistoty: Podoby zodpovednosti\/}. Bratislava: Slovenské filozofické združenie pri SAV, 2022. s.~116--125. ISBN~978--80--973092--9--9. info \item SVOBODOVÁ, Zuzana. O cestách z fenoménu ohrožení. In Anna Hogenová. \textit{K fenoménu ohrožení\/}. Praha: Pedagogická fakulta Univerzity Karlovy, 2022. s.~183--189. URL info \item SVOBODOVÁ, Zuzana. Jak se výchova (ne)může podílet na utváření charakteru. In Hábl, Jan. \textit{Morální charakter jako pedagogický problém\/}. Hradec Králové: Univerzita Hradec Králové: GAUDEAMUS, 2022. s.~45--54. ISBN~978--80--7435--853--1. info \item SVOBODOVÁ, Zuzana. The Concepts of God and Truth in Comenius?s Metaphysical Writings. In Hábl, Jan. \textit{The Restoration of Human Affairs: Utopianism or Realism?\/} Eugene, OR: Wipf and Stock Publishers, 2022. s.~150--163. ISBN~978--1--6667--1414--2. info \item SVOBODOVÁ, Zuzana a Andrea BLAŠČÍKOVÁ. \textit{Mezi filosofií a teologií výchovy: Dialog k odkazu Radima Palouše\/}. 1. vyd. Praha: Karolinum, 2021. 132 s. ISBN~978--80--246--4902--3. \textit{přístup ke knize v databázi ProQuest (ebook)\/} URL info \item SVOBODOVÁ, Zuzana. Jak dnes může promlouvat pověst o Faustovi? \textit{Studia Aloisiana\/}. Bratislava: Teologická fakulta Trnavské univerzity, 2021, roč.~12, č.~1, s.~23--39. ISSN~1338--0508. URL info \item SVOBODOVÁ, Zuzana. Through Language to You or DIA--LOGOS to You. In \textit{Relationality in Education of Morality\/}. Berlin, Frankfurt a. M.: Peter Lang GmbH, Internationaler Verlag der Wissenschaften, 2021. s.~35--50. ISBN~978--3--631--85264--4. info \item SVOBODOVÁ, Zuzana. Radost jako fenomén života. In Pelcová, Naděžda, Květoňová, Lea et al. \textit{Emocionalita ve výchově prizmatem filosofické, psychologické a speciálněpedagogické reflexe\/}. Praha: Pedagogická fakulta Univerzity Karlovy, 2021. s.~81--98. ISBN~978--80--7603--242--2. info \item SVOBODOVÁ, Zuzana a Radim PALOUŠ. \textit{Homo educandus (ebook)\/}. 1. vyd. Praha: Karolinum, 2020. ISBN~978--80--246--4572--8. \textit{K dispozici přes databázi EBSCO\/} URL info \item SVOBODOVÁ, Zuzana. Na cestě. In Robert Kuthan, Naděžda Pelcová, Zbyněk Zicha. \textit{Kapitoly z didaktiky filosofie, etiky a společenských věd\/}. Praha: Univerzita Karlova, Pedagogická fakulta, 2018. s.~79--92, 13 s. Studia didactica, 1. ISBN~978--80--7290--983--4. info \item SVOBODOVÁ, Zuzana. Spravedlnost jako řád duše. In \textit{Spravedlnost ve výchově, umění a sportu\/}. Praha: Univerzita Karlova -- Pedagogická fakulta, 2016. s.~99--108, 9 s. ISBN~978--80--7290--877--6. info \item SVOBODOVÁ, Zuzana. O pasivitě člověka ke světu v kontextu nahodilého. \textit{Envigogika: Charles University E--journal for Environmental Education\/}. Praha: Univerzita Karlova v Praze, Centrum pro otázky životního prostředí, 2016, roč.~11, č.~1, s.~1--7. ISSN~1802--3061. URL info \item SVOBODOVÁ, Zuzana. Úkol váhání a rozhodování. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2015, roč.~12, č.~1, 9 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Moc promluvy: O možnosti člověka promluvit, či výzvě člověka k řeči. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2015, roč.~11, 3--4, 7 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. K personální etice. \textit{Envigogika: Charles University E--journal for Environmental Education\/}. Praha: Univerzita Karlova v Praze, Centrum pro otázky životního prostředí, 2015, roč.~10, č.~4, s.~1--8. ISSN~1802--3061. URL info \item SVOBODOVÁ, Zuzana. Nad novými svazky kritické edice díla Jan Amose Komenského. \textit{Studia comeniana et historica : časopis Muzea J.A. Komenského v Uherském Brodě pro komeniologii, historii 16., 17. a 18. století a regionální dějepis moravsko--slovenského pomezí\/}. Uherský Brod: Muzeum J. A. Komenského, 2015, roč.~2014, 91--92, s.~261--265. ISSN~0323--2220. info \item SVOBODOVÁ, Zuzana. Pojetí touhy u Emmanuela Lévinase. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2014, roč.~11, č.~1, 8 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Jiskření výchovy. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2014, roč.~2014, č.~1, s.~157--168. ISSN~1214--8725. info \item SVOBODOVÁ, Zuzana. Paideia as Care of the Soul: The Potentials of Contemporary School. In \textit{Religion long forgotten: The Importance of Religion in Education towards Civil Society\/}. Cracow: Impuls, 2014. s.~191--206. ISBN~978--83--7850--682--9. info \item SVOBODOVÁ, Zuzana. Čas: Lidská otázka po původu a smyslu. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2013, X/2013, č.~1, 25 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Ethics and Ecoethics by Josef Petr Ondok : Between the Sciences, Philosophy, and Theology. \textit{Envigogika: Charles University E--journal for Environmental Education\/}. Praha: Univerzita Karlova v Praze, Centrum pro otázky životního prostředí, 2013, roč.~8, č.~4, s.~nestránkováno, 9 s. ISSN~1802--3061. URL info \item SVOBODOVÁ, Zuzana. Pojem PAIDEIA na cestě od Aischyla k Řehořovi z Nyssy. \textit{Paidagogos ? časopis pro pedagogiku v souvislostech\/}. Paidagogos ? společnost pro filosofii, teorii a praxi výchovy a vzdělávání, o. s., 2013, roč.~2013, č.~2, s.~340--358, 18 s. ISSN~1213--3809. URL info \item SVOBODOVÁ, Zuzana. Z filosofického života Josefa Petra Ondoka. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2013, roč.~10/2013, č.~3, s.~nestránkováno, 13 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Výchova jako projev vztahu k nedisponovatelnému. In \textit{Teologie a sociální práce: Dvacet let dialogu\/}. Praha: Jabok, 2013. s.~97--102, 5 s. ISBN~978--80--904681--1--5. info \item SVOBODOVÁ, Zuzana, Michael MARTINEK, René MILFAIT a Petr JANDEJSEK. \textit{Důstojně a radostně: Příspěvek k lidskoprávnímu, občanskému a etickému vzdělávání\/}. Středokluky: Zdeněk Susa, 2012. ISBN~978--80--86057--75--0. info \item SVOBODOVÁ, Zuzana. Dialog jako dar a úkol člověku. In \textit{Dialog ve výchově, umění a sportu. Filosofická reflexe\/}. 1. vyd. Praha: Univerzita Karlova v Praze, Pedagogická fakulta, 2012. s.~63--66, 5 s. ISBN~978--80--7290--428--0. info \item SVOBODOVÁ, Zuzana. Jan Patočka: Korespondence s komeniology. \textit{Filosofický časopis\/}. Praha: Filosofický ústav AV ČR, 2012, roč.~2012/60, č.~5, s.~796--775, 11 s. ISSN~0015--1831. info \item SVOBODOVÁ, Zuzana. K odrazu české filosofie výchovy ve světě. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2012, IX/2012, 3--4. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. (Ne)mediálnost filosofie. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2012, VIII/2011, 2--3, 12 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Život v obrácení. In N. Pelcová, A. Hogenová. \textit{Česká vzdělanost v Evropě II.\/} Praha: Univerzita Karlova v Praze, Pedagogická fakulta, 2012. s.~172--183. ISBN~978--80--7290--627--7. info \item SVOBODOVÁ, Zuzana. TELOS OUK EN EMOI (Účel nikoli ve mně). In N. Pelcová, A. Hogenová. \textit{Smysl, cíl a účel ve výchově, umění a sportu\/}. 1. vyd. Praha: Univerzita Karlova v Praze, Pedagogická fakulta, 2012. s.~47--55. ISBN~978--80--7290--605--5. info \item PALOUŠ, Radim a Zuzana SVOBODOVÁ. \textit{Homo educandus: Filosofické základy teorie výchovy\/}. Praha: Karolinum, 2011. ISBN~978--80--246--1901--9. info \item SVOBODOVÁ, Zuzana. Jméno jako symbol v židovsko--křesťanské tradici. In \textit{Symbol ve výchově, umění a sportu. Filosofická reflexe\/}. Praha: Univerzita Karlova v Praze -- Pedagogická fakulta, 2011. s.~110--115. ISBN~978--80--7290--428--0. info \item SVOBODOVÁ, Zuzana, Ludmila MUCHOVÁ, Jaroslav KOHOUT a Radim PALOUŠ. \textit{K etické výchově\/}. Praha: Karez, 2011. 100 s. ISBN~978--80--905117--0--5. info \item SVOBODOVÁ, Zuzana. Etická výchova jako cesta z omezené každodennosti. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2011, VIII/201, č.~1, 9 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. \textit{Výuka etiky na školách\/}. Praha: Universum, Česká křesťanská akademie, 2011. 3/2011. ISSN~0862--8238. info \item SVOBODOVÁ, Zuzana. Radim Palouš. In \textit{Česká vzdělanost v Evropě I.\/} Praha: Univerzita Karlova, PedF, 2011. s.~229--231. ISBN~978--80--7290--515--7. info \item SVOBODOVÁ, Zuzana. Čas a výchova: z trvání k času. \textit{Paideia: philosophical e--journal of Charles University\/}. Praha: Univerzita Karlova, 2010, roč.~7/2010, č.~3, 11 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Jolana Poláková: Smysl dialogu: O směřování k plnosti lidské komunikace. \textit{Filosofický časopis [roč. 2 (1954)--40 (1992)]\/}. Praha: Filosofický ústav AV ČR, 2010, roč. 58, č.~1, s.~116--118. ISSN~0015--1831. URL info \item SVOBODOVÁ, Zuzana. Obraz a představa. In \textit{Imaginace ve výchově, umění a sportu (filosofická reflexe)\/}. Praha: Univerzita Karlova v Praze, Pedagogická fakulta, 2010. s.~33--45, 14 s. ISBN~978--80--7290--433--4. info \item SVOBODOVÁ, Zuzana. Prostory pro společné dílo. In \textit{Vědění a participace\/}. 1. vyd. Praha: Karolinum, 2009. ISBN~978--80--7290--387--0. URL info \item SVOBODOVÁ, Zuzana. Charitky a Kúros/Koré ? jeden éthos? In \textit{Éthos ve výchově, umění a sportu\/}. Praha: PedF UK, 2009. ISBN~978--80--7290--387--0. URL info \item SVOBODOVÁ, Zuzana. Život jako liturgie. \textit{Paideia: philosophical e--journal of Charles University\/}. 2009, roč.~6, 3--4, 10 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana a Tomáš SVOBODA. Nové zdůvodnění katechetické odpovědnosti církve. \textit{Teologické texty\/}. Praha, 2008, roč.~2008, č.~4, 16 s. ISSN~0862--6944. URL info \item SVOBODOVÁ, Zuzana. Česká tradice křesťanské víry v Patočkově reflexi. In \textit{Jan Patočka, české dějiny a Evropa.\/} Semily: SOkA Semily pro Pekařovu společnost Českého ráje v Turnově, 2007. ISBN~978--80--86254--16--6. info \item SVOBODOVÁ, Zuzana. \textit{Dary J. Peškové: Rozhovory, které pokračují\/}. 2007. ISBN~978--80--7379--007--3. info \item SVOBODOVÁ, Zuzana. Překonat vlastní rozum: Zapomenout na sebe. In \textit{Emmanuel Lévinas ? filosofie a výchova: Ke stému výročí narození Emmanuela Lévinase\/}. Praha: FHS UK, 2006. ISBN~978--80--239--8833--8. URL info \item SVOBODOVÁ, Zuzana. Pohyb, aneb o ?mimotných? příčinách a o pseudopojmu ?možnost?. In \textit{Pohyb ve výchově, umění a sportu\/}. Praha: PedF UK, 2006. info \item SVOBODOVÁ, Zuzana. \textit{Nelhostejnost: Črty k (ne)náboženské výchově\/}. Praha: Malvern, 2005. 120 s. Lahvice. ISBN~80--86702--07--3. URL info \item SVOBODOVÁ, Zuzana. Umění jako svár pravdy. In \textit{Pragma ve výchově, umění a sportu\/}. Praha: PedF UK, 2005. info \item SVOBODOVÁ, Zuzana. Oheň: Pohyby života II. \textit{Paideia: philosophical e--journal of Charles University\/}. 2005, roč.~2, č.~1. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Vz--duch: Pohyby života III. \textit{Paideia: philosophical e--journal of Charles University\/}. 2005, roč.~2, č.~2. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. ?Živel zemský?: Pohyby života IV. \textit{PAIDEIA: PHILOSOPHICAL E--JOURNAL OF CHARLES UNIVERSITY\/}. Praha: Univerzita Karlova, PedF, 2005, II/2005, č.~3, 10 s. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Kainovo znamení: Nezabiješ. \textit{Teologické texty\/}. 2004, roč.~15, č.~4, s.~141--143. ISSN~0862--6944. URL info \item SVOBODOVÁ, Zuzana. Chairete. \textit{Teologické texty\/}. 2004, roč.~15, č.~3. ISSN~0862--6944. URL info \item SVOBODOVÁ, Zuzana. Kainovo znamení. Rukojmí. Filosofie výchovy. In \textit{Hledání souřadnic společného světa: Filosofie pro každý den\/}. Praha: Eurolex, 2004. URL URL info \item SVOBODOVÁ, Zuzana. \textit{Filosofie výchovy\/}. Praha: Eurolex Bohemia, 2004. ISBN~80--86432--91--2. URL info \item SVOBODOVÁ, Zuzana. Zakrytost a odkrývání: Pohyby života I. \textit{Paideia: philosophical e--journal of Charles University\/}. 2004, roč.~1, č.~1. ISSN~1214--8725. URL info \item SVOBODOVÁ, Zuzana. Odpovědnost k Tváři: Emmanuel Lévinas ? filosofující Žid, židovský filosof. \textit{Informační bulletin., Supplementa\/}. Praha: Ústřední knihovna -- OBIS Pedagogické fakulty Univerzity Karlovy, 1999, č.~10, s.~28--31. info \end{ul} \vspace{0.5cm} 4. 1. 2023 \vspace{0.5cm} \end{vitae} \end{document}

https://www.mathematik.tu-dortmund.de/lsiii/cms/bibtex/863152.tex

tu-dortmund.de

CC-MAIN-2021-21

application/x-tex

application/x-bibtex-text-file

crawl-data/CC-MAIN-2021-21/segments/1620243991288.0/warc/CC-MAIN-20210518160705-20210518190705-00013.warc.gz

@TECHREPORT{KoesterPlatteTurek2005, author = {K\"{o}ster, M. and Platte, F. and Turek, S.}, title = {Speed--up of {FEM} simulation for granular flow via optimised Numerical linear Algebra software}, year = {2005}, institution = {Fakult\"{a}t f\"{u}r Mathematik, TU Dortmund}, note = {Ergebnisberichte des Instituts f\"{u}r Angewandte Mathematik, Nummer 290}, }

https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/04-01-26.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103620968.33/warc/CC-MAIN-20220629024217-20220629054217-00700.warc.gz

%% %% Ein Beispiel der DANTE-Edition %% %% 7. Auflage %% %% Beispiel 04-01-26 auf Seite 57. %% %% Copyright (C) 2016 Herbert Voss %% %% It may be distributed and/or modified under the conditions %% of the LaTeX Project Public License, either version 1.3 %% of this license or (at your option) any later version. %% %% See http://www.latex-project.org/lppl.txt for details. %% %% %% ==== % Show page(s) 1 %% %% \documentclass[]{exaarticle} \pagestyle{empty} \setlength\textwidth{145.16928pt} \setlength\parindent{0pt} %StartShownPreambleCommands \usepackage{pstricks} %StopShownPreambleCommands \begin{document} \begin{pspicture}(2,1) \pspolygon[linearc=2pt,shadow=true, shadowangle=45](0,0)(0,1.1)(0.2,1.1)% (0.2,1.2) (0.8,1.2)(0.8,1.05)(2,1.05)(2,0) \end{pspicture} \end{document}

https://git.bettercrypto.org/ach-master.git/blob_plain/5e72361aed4a99bf859d495facd74b2a77733cdf:/src/applied-crypto-hardening.tex

bettercrypto.org

CC-MAIN-2021-49

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2021-49/segments/1637964362969.51/warc/CC-MAIN-20211204094103-20211204124103-00056.warc.gz

%%% LaTeX Template: Two column article %%% %%% Source: http://www.howtotex.com/ %%% Feel free to distribute this template, but please keep to referal to http://www.howtotex.com/ here. %%% Date: February 2011 %%% Preamble \documentclass[ DIV=calc,% paper=a4,% fontsize=9pt,% %onecolumn]{scrartcl} % KOMA-article class onecolumn]{scrreprt} % KOMA-article class %onecolumn]{report} % KOMA-article class \usepackage{lipsum} % Package to create dummy text \usepackage[english]{babel} % English language/hyphenation \usepackage[protrusion=true,expansion=true]{microtype} % Better typography \usepackage{amsmath,amsfonts,amsthm} % Math packages \usepackage[pdftex]{graphicx} % Enable pdflatex %\usepackage[svgnames]{xcolor} % Enabling colors by their 'svgnames' \usepackage[hang, small,labelfont=bf,up,textfont=it,up]{caption} % Custom captions under/above floats \usepackage{epstopdf} % Converts .eps to .pdf \usepackage{subfig} % Subfigures \usepackage{fix-cm} % Custom fontsizes \usepackage[usenames,dvipsnames]{color} \usepackage{float} \usepackage{subfig} %\usepackage{tikz} \usepackage{acronym} \usepackage{amsthm} \usepackage{fancyvrb} \usepackage{listings} \usepackage{longtable} %% Epigraph patching \usepackage{epigraph} % \epigraphsize{\small}% Default \setlength\epigraphwidth{8cm} \setlength\epigraphrule{0pt} \usepackage{etoolbox} \makeatletter \patchcmd{\epigraph}{\@epitext{#1}}{\itshape\@epitext{#1}}{}{} \makeatother \usepackage{gitinfo} % custom changes: \usepackage[usenames,dvipsnames,svgnames,table]{xcolor} \usepackage{placeins} \usepackage{draftwatermark} % human tables \usepackage{booktabs} \renewcommand{\arraystretch}{1.25} % side box \usepackage{wrapfig} %\usepackage{tcolorbox} \newenvironment{WrapText}[1][r] {\wrapfigure{#1}{0.5\textwidth}\tcolorbox} {\endtcolorbox\endwrapfigure} % Add text symbols \usepackage{pifont} \newcommand{\yes}{\textcolor{green}{\ding{51}}} \newcommand{\no}{\textcolor{red}{\ding{55}}} % Colours \definecolor{green}{RGB}{32,113,10} \definecolor{orange}{RGB}{251,111,16} \definecolor{red}{RGB}{247,56,0} \definecolor{blue}{RGB}{0,28,128} \definecolor{lightgreen}{RGB}{187,218,216} \definecolor{intersectgreen}{RGB}{103,133,155} \definecolor{darkblue}{RGB}{76,87,117} \bibliographystyle{alphalink} \definecolor{Brown}{cmyk}{0,0.81,1,0.60} \definecolor{OliveGreen}{cmyk}{0.64,0,0.95,0.40} \definecolor{CadetBlue}{cmyk}{0.62,0.57,0.23,0} \definecolor{lightlightgray}{gray}{0.9} \usepackage{titlesec} %\allsectionsfont{\color{darkblue}\itshape\underline} %\sectionfont{\color{darkblue}\itshape\selectfont} %\subsectionfont{\color{darkblue}\itshape\selectfont} \renewcommand*\sectfont{\sffamily\color{darkblue}\mdseries} %\renewcommand*\sectfont{\rmfamily\mdseries\itshape} % makes default font sans-serif \renewcommand{\familydefault}{\sfdefault} % make font Open Sans % \usepackage{opensans} \usepackage[defaultsans]{opensans} % changes font encoding to T1 % \usepackage[T1]{fontenc} % \usepackage{textcomp} \lstset{ %language=Bash, % Code langugage basicstyle=\ttfamily, % Code font, Examples: \footnotesize, \ttfamily keywordstyle=\color{OliveGreen}, % Keywords font ('*' = uppercase) commentstyle=\color{gray}, % Comments font %numbers=left, % Line nums position %numberstyle=\tiny, % Line-numbers fonts %stepnumber=1, % Step between two line-numbers %numbersep=5pt, % How far are line-numbers from code backgroundcolor=\color{lightlightgray}, % Choose background color frame=none, % A frame around the code tabsize=2, % Default tab size captionpos=b, % Caption-position = bottom breaklines=true, % Automatic line breaking? breakatwhitespace=false, % Automatic breaks only at whitespace? showspaces=false, % Dont make spaces visible showtabs=false, % Dont make tabls visible columns=fixed, % Column format morekeywords={__global__, __device__}, % } %% \todo{} command. % % Outputs red TODOs in the document. Requires \usepackage{color}. % % Usage: \todo{Document the TODO command.} % % Comment out second line to disable. \newcommand{\todo}[1]{} \renewcommand{\todo}[1]{{\color{Red} TODO: {#1}}} %%% Custom sectioning (sectsty package) \usepackage{sectsty} % Custom sectioning (see below) \allsectionsfont{% % Change font of al section commands %\usefont{OT1}{phv}{b}{n}% % bch-b-n: CharterBT-Bold font \bfseries % should make it Open Sans Bold } \sectionfont{% % Change font of \section command %\usefont{OT1}{phv}{b}{n}% % bch-b-n: CharterBT-Bold font \bfseries } % use more of the page \usepackage{fullpage} %%% Headers and footers \usepackage{fancyhdr} % Needed to define custom headers/footers \pagestyle{fancy} % Enabling the custom headers/footers \usepackage{lastpage} % Header (empty) \lhead{} \chead{} \rhead{} % Footer (you may change this to your own needs) \lfoot{\footnotesize Applied Crypto Hardening \textbullet ~Draft revision\gitVtags: \gitAbbrevHash{} (\gitCommitterIsoDate) \gitCommitterName} \cfoot{} \rfoot{\footnotesize page \thepage\ of \pageref{LastPage}} % "Page 1 of 2" \renewcommand{\headrulewidth}{0.0pt} \renewcommand{\footrulewidth}{0.4pt} %%% Creating an initial of the very first character of the content \usepackage{lettrine} \newcommand{\initial}[1]{% \lettrine[lines=3,lhang=0.3,nindent=0em]{ \color{darkblue} {\textsf{#1}}}{}} %%% Title, author and date metadata \usepackage{titling} % For custom titles \newcommand{\HorRule}{\color{darkblue}% % Creating a horizontal rule \rule{\linewidth}{1pt}% } \pretitle{\vspace{-30pt} \begin{flushleft} \HorRule \fontsize{35}{36} \bfseries \color{darkblue} \selectfont } \title{Applied Crypto Hardening}% \\ \vskip 0.5em \large www.bettercrypto.org} \posttitle{\par\end{flushleft}\vskip 0.5em} \preauthor{\begin{flushleft} \large \lineskip 0.5em \color{intersectgreen}} %\vskip 0.5em \author{Wolfgang Breyha, David Durvaux, Tobias Dussa, L. Aaron Kaplan, Florian Mendel, Christian Mock, Manuel Koschuch, Adi Kriegisch, Ulrich P\"oschl, Ramin Sabet, Berg San, Ralf Schlatterbeck, Thomas Schreck, Aaron Zauner, Pepi Zawodsky} %\institute{ %FH Campus Wien %\and %VRVis %\and %CERT.at %\and %Karlsruhe Institute of Technology %} \setlength{\parindent}{0cm} \postauthor{\footnotesize \color{Black} \vskip 2.5em (University of Vienna, CERT.be, KIT-CERT, CERT.at, IAIK, coretec.at, FH Campus Wien, VRVis, MilCERT Austria, A-Trust, Runtux.com, Friedrich-Alexander University Erlangen-Nuremberg, azet.org, maclemon.at) \par\end{flushleft}\HorRule} \date{\today} %tell TeX where to look for graphics/logos \graphicspath{ {/img/} } % hyperref needs to be the last package you load. \usepackage[pdftex,breaklinks,colorlinks,linkcolor=darkblue,citecolor=blue,urlcolor=blue]{hyperref} %%% Begin document \begin{document} % add logo graphic %\includegraphics[scale=0.5]{img/logo} \maketitle \thispagestyle{fancy} % Enabling the custom headers/footers for the first page % The first character should be within \initial{} %\initial{H}\textbf{ere is some sample text to show the initial in the introductory paragraph of this template article. The color and lineheight of the initial can be modified in the preamble of this document.} \input{neboltai} \input{acknowledgements} \input{abstract} \tableofcontents \chapter{Introduction} \label{chapter:Intro} \input{whoshouldread} \input{related_publications} \input{howtoread} \input{disclaimer} \input{motivation} \input{methods} %% \chapter{Practical recommendations} \label{chapter:PracticalSettings} \input{practical_settings} %% \chapter{Theory} %\epigraph{``Number theorists are like lotus-eaters - having tasted this food they can never give it up.''}{-- Leopold Kronecker} \label{chapter:Theory} \input{theory} \chapter{Appendix} \input{tools} \input{links} \input{suggested_reading} \input{cipher_suite_names} \input{further_research} %\input{reviewers} \input{bib} \end{document}

http://www.ipm.ac.ir/papers/pdf/abs11361.tex

ipm.ac.ir

CC-MAIN-2019-43

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-43/segments/1570986675409.61/warc/CC-MAIN-20191017145741-20191017173241-00208.warc.gz

\documentclass[12pt]{article} \usepackage{amsmath,amssymb,amsfonts} \begin{document} Let $R$ be a finite commutative ring with identity and $Z(R)$ denote the set of all zero-divisors of $R$. Note that $R$ is uniquely expressible as a direct sum of local rings $R_i$ ($1\leq i\leq m$) for some $m\geq 1$. In this paper, we investigate the relationship between the prime factorizations $|Z(R)|={p_1}^{k_1}\cdots {p_n}^{k_n}$ and the summands $R_i$. It is shown that for each $i$, $|Z(R_i)|={p_j}^{t_j}$ for some $1\leq j\leq n$ and $0\leq t_j\leq k_j$. In particular, rings $R$ with $|Z(R)|=p^k$ where $1\leq k\leq 7$, are characterized. Moreover, the structure and classification up to isomorphism of all commutative rings $R$ with $|Z(R)|={p_1}^{k_1}\ldots {p_n}^{k_n}$, where $n\in \Bbb{N}$, $p_i^,s$ are distinct prime numbers, $1\leq k_i\leq 3$ and nonlocal commutative rings $R$ with $|Z(R)|=p^k$ where $ k=4$ or $5$, are determined. \end{document}

https://www.yvesdelhaye.be/IMG/tex/parameterized-plots.tex

yvesdelhaye.be

CC-MAIN-2023-06

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2023-06/segments/1674764501407.6/warc/CC-MAIN-20230209045525-20230209075525-00871.warc.gz

% under Creative Commons attribution license. % A work by Yves Delhaye % Requires GNUPLOT and shell-escape enabled \documentclass{minimal} \usepackage{tikz} %%%< \usepackage{verbatim} \usepackage[active,tightpage]{preview} \setlength\PreviewBorder{0pt}% %%%> \begin{comment} :Title: Parameterized plots As a math teacher, I have to explain how parameters affect the graph of a function. By putting the "tikzpicture" inside a LaTeX macro, it is very easy and fast to create multiple graphs by modifying only the parameters and calling the macro. \end{comment} \usetikzlibrary{arrows,shapes} \usepackage{xifthen} \begin{document} % Macros for cst. They have to be redefined each time. See inside document \newcommand{\cA}{1}% Cste . fct \newcommand{\cB}{0}% Cste + fct \newcommand{\cC}{1}% Cste . var \newcommand{\cD}{0}% Cste + var %LaTeX Macro for drawing fct with pgf/tikz. Define once, use many! \newcommand{\FctAss}{ \begin{tikzpicture}[domain=0:8] \pgfmathparse{0.1+\cA*1.1 +\cB} \pgfmathresult \let\maxY\pgfmathresult% evaluate maxY \pgfmathparse{-0.1-\cA*1.1 +\cB} \pgfmathresult \let\minY\pgfmathresult% evaluate minY \pgfmathparse{\maxY < 1} \pgfmathresult \let\BmaxY\pgfmathresult% What if maxY < 1? Then set Boolean to 1 \ifthenelse{\equal{\BmaxY}{1.0}}{% \pgfmathparse{1.2} \pgfmathresult \let\maxY\pgfmathresult% Correct maxY to have correct graph }{} \pgfmathparse{\minY > 0} \pgfmathresult \let\BminY\pgfmathresult% What if minY > 0? Then set Boolean to 1 \ifthenelse{\equal{\BminY}{1.0}}{% \pgfmathparse{0} \pgfmathresult \let\minY\pgfmathresult% Correct minY to have correct graph }{} % DRAW the graph of the function from here on \draw[very thin,color=gray] (-0.1,\minY) grid (7.9,\maxY);% GRID use minY & maxY \draw[->] (-0.2,0) -- (8.2,0) node[right] {$x$}; \draw[->] (0,\minY) -- (0,\maxY) node[above] {$f(x)$};% y axis use minY & maxY too \draw[smooth,samples=200,color=blue] plot function{(\cA)* (cos((\cC)*x+(\cD))) + \cB} node[right] {$f(x) = \cA{} . cos(\cC{} . x + \cD{}) + \cB{}$}; % units for cartesian reference frame \foreach \x in {0,1} \draw (\x cm,1pt) -- (\x cm,-3pt) node[anchor=north,xshift=-0.15cm] {$\x$}; \foreach \y/\ytext in {1} \draw (1pt,\y cm) -- (-3pt,\y cm) node[anchor=east] {$\ytext$}; \end{tikzpicture} } % END of macro \begin{preview} % And now use it! \FctAss{} % Change the parameters \renewcommand{\cA}{3} \renewcommand{\cB}{0} \renewcommand{\cC}{1} \renewcommand{\cD}{0} % WITHOUT rewriting the code for the picture \FctAss{} % % And do it again \renewcommand{\cA}{1} \renewcommand{\cB}{0} \renewcommand{\cC}{4} \renewcommand{\cD}{0} \FctAss{} % And again \renewcommand{\cA}{1} \renewcommand{\cB}{0.5} \renewcommand{\cC}{1} \renewcommand{\cD}{0} \FctAss{} % And again \renewcommand{\cA}{1} \renewcommand{\cB}{0} \renewcommand{\cC}{1} \renewcommand{\cD}{2} \FctAss{} \end{preview} % UNCOMMENT IF YOU WANT TO SEE MORE % % This is where the test on maxY is useful. % \renewcommand{\cA}{3} % \renewcommand{\cB}{-14} % \renewcommand{\cC}{2} % \renewcommand{\cD}{-2} % % \FctAss{} % % % And here the test on minY is useful. % \renewcommand{\cA}{3} % \renewcommand{\cB}{14} % \renewcommand{\cC}{2} % \renewcommand{\cD}{-2} % % \FctAss{} % \end{document}

https://authorea.com/users/1331/articles/19620/download_latex

authorea.com

CC-MAIN-2021-04

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-04/segments/1610703565541.79/warc/CC-MAIN-20210125092143-20210125122143-00109.warc.gz

\documentclass{article} \usepackage[affil-it]{authblk} \usepackage{graphicx} \usepackage[space]{grffile} \usepackage{latexsym} \usepackage{textcomp} \usepackage{longtable} \usepackage{tabulary} \usepackage{booktabs,array,multirow} \usepackage{amsfonts,amsmath,amssymb} \providecommand\citet{\cite} \providecommand\citep{\cite} \providecommand\citealt{\cite} \usepackage{url} \usepackage{hyperref} \hypersetup{colorlinks=false,pdfborder={0 0 0}} \usepackage{etoolbox} \makeatletter \patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{% \errmessage{\noexpand\@combinedblfloats could not be patched}% }% \makeatother % You can conditionalize code for latexml or normal latex using this. \newif\iflatexml\latexmlfalse \AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \begin{document} \title{Top-quark electroweak couplings at the FCC-ee} \author{{\bf Patrick Janot}\\ {\it CERN, PH Department, Geneva, Switzerland}} \date{\today} \maketitle \section{Introduction} \label{sec:Introduction} The design study of the Future Circular Colliders (FCC) in a 100-km ring in the Geneva area has started at CERN at the beginning of 2014, as an option for post-LHC particle accelerators. The study has an emphasis on proton-proton and electron-positron high-energy frontier machines~\cite{FCCWebSite}. In the current plans, the first step of the FCC physics programme would exploit a high-luminosity ${\rm e^+e^-}$ collider called FCC-ee, with centre-of-mass energies ranging from below the Z pole to the ${\rm t\bar t}$ threshold and beyond. A first look at the physics case of the FCC-ee can be found in Ref.~\cite{Bicer_2014}. In this first look, the focus regarding top-quark physics was on precision measurements of the top-quark mass, width, and Yukawa coupling through a scan of the ${\rm t\bar t}$ production threshold, with $\sqrt{s}$ comprised between~340 and~350\,GeV. The expected precision on the top-quark mass was in turn used, together with the outstanding precisions on the Z peak observables and on the W mass, in a global electroweak fit to set constraints on weakly-coupled new physics up to a scale of 100\,TeV. Although not studied in the first look, measurements of the top-quark electroweak couplings are of interest, as new physics might also show up via significant deviations of these couplings with respect to their standard-model predictions. Theories in which the top quark and the Higgs boson are composite lead to such deviations. The inclusion of a direct measurement of the ttZ coupling in the global electroweak fit is therefore likely to further constrain these theories. It has been claimed that both a centre-of-mass energy well beyond the top-quark pair production threshold and a large longitudinal polarization of the incoming electron and positron beams are crucially needed to independently access the tt$\gamma$ and the ttZ couplings for both chirality states of the top quark. In Ref.~\cite{Baer_2013}, it is shown that the measurements of the total event rate and the forward-backward asymmetry of the top quark, with 500\,${\rm fb}^{-1}$ at $\sqrt{s}=500$\,GeV and with beam polarizations of ${\cal P} = \pm 0.8$, ${\cal P}^\prime = \mp 0.3$, allow for this distinction. The aforementioned claim is revisited in the present study. The sensitivity to the top-quark electroweak couplings is estimated here with an optimal-observable analysis of the lepton angular and energy distributions of over a million events from ${\rm t\bar t}$ production at the FCC-ee, in the $\ell \nu {\rm q \bar q b \bar b}$ final states (with $\ell = {\rm e}$ or $\mu$), without incoming beam polarization and with a centre-of-mass energy not significantly above the ${\rm t\bar t}$ production threshold. Such a sensitivity can be understood from the fact that the top-quark polarization arising from its coupling to the Z is maximally transferred to the final state particles via the weak top-quark decay ${\rm t \to W b}$ with a 100\% branching fraction: the lack of initial polarization is compensated by the presence of substantial final state polarization, and by a larger integrated luminosity. A similar situation was encountered at LEP, where the measurement of the total rate of ${\rm Z} \to \tau^+\tau^-$ events and of the tau polarization was sufficient to determine the tau couplings to the Z, regardless of initial state polarization~\cite{Altarelli:1989hv,Schael_2006}. This letter is organized as follows. First, the reader is briefly reminded of the theoretical framework. Next, the statistical analysis of the optimal observables is described, and realistic estimates for the top-quark electroweak coupling sensitivities are obtained as a function of the centre-of-mass energy at the FCC-ee. Finally, the results are discussed, and prospects for further improvements are given. \section{Theoretical framework} \label{sec:theory} The top-quark couplings to the photon and the Z can be parameterized in several ways. In Ref.~\cite{Baer_2013}, for example, the analysis makes use of the usual form factors denoted $F_1$, $F_2$, defined in the following expression (with $X = \gamma, Z$): \begin{equation} \Gamma_\mu^{ttX} = -ie \left\{ \gamma_\mu \left( F_{1V}^X +\gamma_5 F_{1A}^X \right) + {\sigma_{\mu\nu} \over 2 m_{\rm t}} (p_t + p_{\bar t})^\nu \left( i F_{2V}^X + \gamma_5 F_{2A}^X \right)\right\}, \end{equation} with, in the standard model, vanishing $F_2$s and \begin{eqnarray} F_{1V}^{\gamma} = -{2\over3} \ & , & F_{1V}^Z = {1\over 4\sin\theta_W\cos\theta_W} \left(1-{8\over3}\sin^2\theta_W\right) \ , \\ F_{1A}^{\gamma} = 0 \ & , & F_{1A}^Z = {1 \over 4\sin\theta_W\cos\theta_W} \ . \end{eqnarray} The sensitivities are expressed therein in terms of $\tilde{F}_1$, $\tilde{F}_2$ defined as \begin{equation} \tilde{F}_{1V}^X = -({F}_{1V}^X+{F}_{2V}^X)\ , \ \tilde{F}_{2V}^X = {F}_{2V}^X\ , \ \tilde{F}_{1A}^X = -{F}_{1A}^X\ , \ \tilde{F}_{2A}^X = -i{F}_{2A}^X\ . \end{equation} On the other hand, the optimal-observable statistical analysis presented in the next section, based on Ref.~\cite{Grzadkowski_2000}, uses the following $A,B,C,D$ parameterization (with $v = \gamma, Z$): \begin{equation} \Gamma^\mu_{ttv} = {g\over 2} \left[ \gamma^\mu \left\{ (A_v+\delta A_v) - \gamma_5 (B_v+\delta B_v) \right\} + {(p_t -p_{\bar t})^\mu\over 2 m_{\rm t}} \left( \delta C_v - \delta D_v \gamma_5 \right) \right], \end{equation} which easily relates to the previous parameterization with \begin{eqnarray} A_v+\delta A_v = - 2i\sin\theta_W \left( F_{1V}^X + F_{2V}^X \right) & \ , & B_v+\delta B_v = - 2i\sin\theta_W F_{1A}^X \ , \\ \delta C_v = -2i\sin\theta_W F_{2V}^X & \ , & \delta D_v = -2\sin\theta_W F_{2A}^X \ . \end{eqnarray} The expected sensitivities on the anomalous top-quark couplings can be derived in any of these parameterizations. Although originally derived with that of Ref.~\cite{Grzadkowski_2000}, the final estimates presented in this study, however, use the parameterization of Ref.~\cite{Baer_2013}, for an easy comparison. For the same reason, \cross{although it is not needed,} the same restrictions as in Ref.~\cite{Baer_2013} are applied here: only the six CP conserving form factors are considered (i.e., the two $F_{2A}^X$ are both assumed to vanish), and either the four form factors $F_{1V,A}^X$ are varied simultaneously while the two $F_{2V}^X$ are fixed to their standard model values, or vice-versa. A careful reading of Ref.~\cite{Baer_2013} shows that the form factor $F_{1A}^\gamma$ was also kept to its standard model value, as a non-zero value would lead to gauge-invariance violation. It is straightforward to show that, under these restrictions, the three parameterizations lead to the same sensitivities on $F_i$, $\tilde{F}_i$ and $A,B,C,D$ (with a multiplicative factor $2\sin\theta_W \sim 0.96$ for the latter set). The tree-level angular and energy distributions of the lepton arising from the ${\rm t \bar t}$ semi-leptonic decays are known analytically as a function of the incoming beam polarizations and the centre-of-mass energy~\cite{Grzadkowski_2000}: \begin{equation} {{\rm d}^2\sigma \over {\rm d}x {\rm d}\cos\theta} = {3\pi\beta\alpha^2(s) \over 2s} B_\ell S_\ell(x,\cos\theta), \end{equation} where $\beta$ is the top velocity, $s$ is the centre-of-mass energy squared, $\alpha(s)$ is the QED running coupling constant, and $B_\ell$ is the fraction of ${\rm t\bar t}$ events with at least one top quark decaying to either ${\rm e}\nu_{\rm e}{\rm b}$ or $\mu\nu_\mu{\rm b}$ (about 44\%). As the non-standard form factors $\delta(A,B,C,D)_v \equiv \delta_i$ are supposedly small, only the terms linear in $\delta_i$ are kept: \begin{equation} \label{eq:optimal} S(x,\theta) = S^0(x,\theta) + \sum_{i=1}^8 \delta_i f_i(x,\cos\theta), \end{equation} where $x$ and $\theta$ are the lepton (reduced) energy and polar angle, respectively, and $S^0$ is the standard-model contribution. The eight distributions $f_{A,B,C,D}^{\gamma, Z}(x,\cos\theta) \equiv f_i(x,\cos\theta)$ and the standard-model contribution $S^0(x,\cos\theta)$ are shown for $\ell^-$ in Fig.~\ref{fig:distributions} at $\sqrt{s} = 365$\,GeV, with no incoming beam polarization.\selectlanguage{english} \begin{figure}[h!] \begin{center} \includegraphics[width=1.00\columnwidth]{figures/Fig2/Fig2} \caption{{\label{fig:distributions} The eight $f_i(x,\cos\theta)$ functions and the standard-model contribution $S^0(x,\cos\theta)$ for $\ell^-$ at $\sqrt{s} = 365$\,GeV. Left column, from top to bottom: $f_1 = f_A^\gamma$~; $f_3 = f_B^\gamma$~; $f_5 = f_C^\gamma$~; and $f_7 = f_D^\gamma$. Right column, from top to bottom: $f_2 = f_A^Z$~; $f_4 = f_B^Z$~; $f_6 = f_C^Z$~; $f_8 = f_D^Z$~; and $S^0$. In all these figures, $\theta$ is the lepton polar angle, and $x$ is the reduced lepton energy, defined as $x = {2 E_\ell \over m_t} \sqrt{1-\beta \over 1+ \beta}$, where $\beta$ is the top velocity and $m_t$ is the top mass.% }} \end{center} \end{figure} \section{Optimal-observable statistical analysis} \label{sec:optimal} There are nine different functions entering Eq.~\ref{eq:optimal}, and eight form factors $\delta_i$ to be evaluated from a given sample of ${\rm t \bar t}$ events. In principle, all eight form factors and their uncertainties can therefore be determined simultaneously, under the condition that the nine functions are linearly independent. Experimentalists usually maximize numerically a global likelihood $L$ -- or equivalently, minimize the negative Log-likelihood ($-\log L$) -- with respect to all form factors: \begin{equation} \label{eq:likelihood} L = {\mu^N \over N!}{\rm e}^{-\mu} \times \prod_{k=1}^N p(k), \end{equation} where $N$ is the total number of ${\rm t \bar t}$ events observed in the data sample, $\mu$ is the number of events expected for the integrated luminosity ${\cal L}$ of the data sample ($\mu = \sigma_{\rm tot} \times {\cal L}$), and \begin{equation} p(k) = {1 \over \sigma_{\rm tot} } { {\rm d}^2\sigma \over {\rm d}x {\rm d}\cos\theta }(x_k,\cos\theta_k) {\rm , with \ } \sigma_{\rm tot} = \int { {\rm d}^2\sigma \over {\rm d}x {\rm d}\cos\theta } {\rm d}x {\rm d}\cos\theta . \end{equation} The covariance matrix obtained from the numerical minimization of the negative log-likelihood is then inverted to get the uncertainties on the form factors, $\sigma(\delta_i)$. It can be shown~\cite{Davier_1993} that, in the linear form given in Eq.~\ref{eq:optimal}, this method is statistically optimal for the determination of the $\sigma(\delta_i)$. The functions $f_i(x,\cos\theta)$ are therefore called "optimal observables". It turns out~\cite{Diehl_1994} that the covariance matrix, hence the statistical uncertainties on the form factors, can be obtained analytically in the limit of a large number of events, which is the case considered in this letter. Specifically, if the total event rate is included in the derivation of the likelihood as is the case in Eq.~\ref{eq:likelihood}, the elements of the covariance matrix $V$ are given by (${\rm d}\Omega \equiv {\rm d}x {\rm d}\cos\theta$) \begin{equation} \label{eq:rate} V_{ij} = {\cal L} \int {\rm d}\Omega { f_i \times f_j \over S^0} \ , \end{equation} while if the total event rate is not included in the likelihood, namely by removing the first term of the product in Eq.~\ref{eq:likelihood}, these elements take the form \begin{equation} \label{eq:norate} V_{ij} = {\cal L} \left[ \int {\rm d}\Omega {f_i \times f_j \over S^0} - { \int {\rm d}\Omega f_i \int {\rm d}\Omega f_j \over \int {\rm d}\Omega S_0 } \right], \end{equation} and the uncertainty on the form factor $\delta_i$ is simply \begin{equation} \sigma(\delta_i) = \sqrt{ [ V^{-1} ]_{ii} } \ . \end{equation} This analytical procedure is used in Ref.~\cite{Grzadkowski_2000} to determine the sensitivity to top-quark electroweak couplings in $500\,{\rm fb}^{-1}$ of ${\rm e^+ e^-}$ collisions at $\sqrt{s} = 500$\,GeV, with or without incoming beam polarization. In this article, the authors evaluate the covariance matrix with Eq.~\ref{eq:rate}, but they let the total number of events float by adding a fictitious multiplicative form factor $\delta_0$ in front of $S^0$ in Eq.~\ref{eq:optimal}, hence increase the rank of the covariance matrix from 8 to 9. It was checked that this work-around is numerically equivalent to using Eq.~\ref{eq:norate}, {\it i.e.}, to not use the total event rate in the likelihood. A quick survey of Fig.~\ref{fig:distributions}, however, shows that $f_A^\gamma(x,\cos\theta)$, in the top-left corner, is almost degenerate with the standard model contribution $S^0(x,\cos\theta)$, in the bottom-right corner. Letting the normalization of the standard model contribution float is therefore bound to lead to very large statistical uncertainties on all form factors, as is indeed observed in Ref.~\cite{Grzadkowski_2000}. For this reason, and as is done in Ref.~\cite{Baer_2013}, the present study includes the total event rate in the determination of the uncertainties. As already mentioned, it is possible to determine simultaneously all eight form factors and their uncertainties. In the first configuration of Ref.~\cite{Baer_2013}, however, only the three coefficients $F_{1V}^\gamma$, $F_{1V}^Z$ and $F_{1A}^Z$ are allowed to vary. The other five form factors are fixed to their standard model values. In this simplified situation, Eq.~\ref{eq:optimal} reads \begin{equation} S(x,\theta) = S^0(x,\theta) - 2i\sin\theta_W \delta F_{1V}^\gamma f_A^\gamma - 2i\sin\theta_W \delta F_{1V}^Z f_A^Z + -2i\sin\theta_W \delta F_{1A}^Z f_B^Z \ , \end{equation} which leads to the following $3\times 3$ covariance matrix $V_1 = 4\sin^2\theta_W \times {\cal L} \times X$, with \begin{eqnarray} \label{eq:firstInt} X_{11} = \int {\rm d}\Omega {(f_A^\gamma)^2 \over S^0} \ , \ & {\displaystyle X_{12} = \int {\rm d}\Omega {f_A^\gamma \times f_A^Z \over S^0}} \ , \ & X_{13} = \int {\rm d}\Omega {f_A^\gamma \times f_B^Z \over S^0} \ , \\ & {\displaystyle X_{22} = \int {\rm d}\Omega {(f_A^Z)^2 \over S^0} } \ , \ & X_{23} = \int {\rm d}\Omega {f_A^Z \times f_B^Z \over S^0} \ , \\ & & X_{33} = \int {\rm d}\Omega {(f_B^Z)^2 \over S^0} \ . \end{eqnarray} In the second configuration of Ref.~\cite{Baer_2013}, only the two coefficients $F_{2V}^\gamma$ and $F_{2V}^Z$ are allowed to vary, which leads to the even simpler expression of Eq.~\ref{eq:optimal}: \begin{equation} S(x,\theta) = S^0(x,\theta) - 2i\sin\theta_W \delta F_{2V}^\gamma (f_A^\gamma + f_C^\gamma) - 2i\sin\theta_W \delta F_{2V}^Z (f_A^Z + f_C^Z)\ , \end{equation} and the following $2\times 2$ covariance matrix $V_2 = 4\sin^2\theta_W \times {\cal L} \times Y$, with \begin{eqnarray} Y_{11} = \int {\rm d}\Omega {(f_A^\gamma + f_C^\gamma)^2 \over S^0} \ , \ & {\displaystyle Y_{12} = \int {\rm d}\Omega {(f_A^\gamma + f_C^\gamma) \times (f_A^Z + f_C^Z) \over S^0}} & \ , \\ \label{eq:lastInt} & {\displaystyle Y_{22} = \int {\rm d}\Omega {(f_A^Z + f_C^Z)^2 \over S^0} } & \ . \end{eqnarray} The numerical results are presented in the next section for the case of the FCC-ee. \section{Sensitivity to the top-quark electroweak couplings} \label{sec:sensitivities} The aforementioned covariance matrices assume a perfect event reconstruction, an event selection efficiency of 100\%, a $4\pi$ detector acceptance, and the absence of background processes. While these hypotheses would not be utterly unrealistic at an ${\rm e^+ e^-}$ collider, a more conservative approach is in order to render the present estimates credible and reliable. {\bf Event reconstruction} The only reconstructed quantities used for the determination of the covariance matrices are the lepton direction and the lepton energy (or momentum). Both quantities can be reconstructed with more than adequate precision, as was the case with the detectors built for the LEP collider. The numerical evaluation of the integrals in Eqs.~\ref{eq:firstInt} to~\ref{eq:lastInt} are however performed with 50 bins in $x$ and $\cos\theta$. This procedure corresponds to conservatively assuming a lepton energy resolution of 1\,GeV and a lepton angular resolution of 20\,mrad, figures vastly exceeded by LEP detectors. {\bf Event selection and particle identification} The event selection relies on the presence of an energetic isolated lepton and two energetic b-quark jets in the final state, accompanied by either two light-quark jets or an additional lepton. At $\sqrt{s} = 365$\,GeV, the lepton momentum can take values between 13.5 and 120\,GeV/$c$, a range in which an identification efficiency of 80\% can be conservatively assumed, with a negligible fake rate. Similarly, the b-quark jet energies can take values between 49 and 94\,GeV, for which b-tagging algorithms are very efficient and pure, especially with two b jets in the final state. A very conservative b-tagging efficiency of 60\% is assumed here. To emulate these efficiencies, all terms of Eq.~\ref{eq:optimal}, hence all covariance matrix elements, are multiplied by $0.6 \times 0.8 = 0.48$. {\bf Detector acceptance} The polar-angle coverage of a typical detector at ${\rm e^+ e^-}$ colliders is usually assumed to be from 10 to 170 degrees. To be conservative, the leptons are assumed here to be detected only for $ | \cos\theta |< 0.9$, {\it i.e.}, in a range from 26 to 154 degrees. This effect is emulated by evaluating the integrals of Eqs.~\ref{eq:firstInt} to~\ref{eq:lastInt} between $\cos\theta_{\rm min} = -0.9$ and $\cos\theta_{\rm max} = 0.9$. Given the large value of the minimum lepton energy, the integration bounds over $x$ are left untouched. {\bf Background processes} The major background identified in Ref.~\cite{Amjad_2013} (which Ref.~\cite{Baer_2013} is based upon) is the single-top production in association with a W boson and a b quark, through WW$^\ast$ production, as it leads to the same final state as the top-quark pair production. The corresponding cross section~\cite{Boos_2001} increases fast with the centre-of-mass energy, and critically depends on the incoming beam polarization. At $\sqrt{s} = 500$\,GeV, the single-top production cross section can reach up to 20\% of the top-pair production cross section in the final state with an electron or a positron and in the ${\rm e^-_L e^+_R}$ initial polarization configuration. Yet, this background has not been included in the top-quark electroweak coupling study of Ref.~\cite{Baer_2013}. At $\sqrt{s} = 365$\,GeV and with unpolarized beams, however, the single-top cross section in the same final state amounts to about 0.1\% of the pair production cross section. It was therefore ignored for the first estimate of precisions given below.. {\bf Other experimental uncertainties} A number of other experimental uncertainties are listed in Ref.~\cite{Amjad_2013}, such as those affecting the measurement of the beam polarization (which enters crucially the cross section measurement); the effects of beamstrahlung; or the ambiguous top-quark reconstruction (which enters crucially the forward-backward asymmetry measurement). These uncertainties apply neither to the FCC-ee, where beamstrahlung effects are negligible and no beam polarization needs to be measured, nor to the present study, as the top-quark direction needs not be reconstructed. The experimental uncertainties affecting the lepton energy and angular distributions can be safely neglected, given the conservative assumptions on the resolutions. The total event rate, needed for the present study, requires a precise luminosity determination, a measurement that can be controlled to a fraction of a per mil, hence neglected here. {\bf Theoretical uncertainties} The dominant systematic uncertainty is of theoretical nature. The total event rate indeed requires an accurate prediction of the total cross section for top pair production. The precision of this prediction is inferred to be at the level of a few per mil in Ref.~\cite{Amjad_2013} for $\sqrt{s} = 500$\,GeV. A similar precision can be expected at smaller centre-of-mass energy as long as it is reasonably above the production threshold. {\bf Integrated luminosity profile} The target luminosities at the FCC-ee are displayed in Fig.~\ref{fig:lumi}~\cite{FCCeeWebSite} as a function of the centre-of-mass energy, together with the target luminosities of other ${\rm e^+ e^-}$ colliders under study in the world. At $\sqrt{s} = 350$\, GeV, a luminosity of $7.2 \times 10^{34}\, {\rm cm}^{-2}{\rm s}^{-1}$ is expected to be democratically distributed to four interaction regions, leading to an integrated luminosity of $3.6\, {\rm ab}^{-1}$ over a period of five years. About $1{\rm ab}^{-1}$ ought to be kept for threshold measurements (leading to a statistical precision on the top mass of about 15\,MeV), and the rest can be used to perform measurements above the production threshold.\selectlanguage{english} \begin{figure}[h!] \begin{center} \includegraphics[width=1.00\columnwidth]{figures/Fig3/Fig3} \caption{{\label{fig:lumi} The target luminosities at the FCC-ee, as a function of the centre-of-mass energy: red (baseline beam crossing) and purple (crabbed-waist beam crossing) lines. The plot also indicates the target luminosities of of other ${\rm e^+ e^-}$ colliders under study in the world. Figure taken from the FCC-ee official web site~\protect\cite{FCCeeWebSite}.% }} \end{center} \end{figure} The maximum centre-of-mass energy of the FCC-ee is yet unknown. It was inferred in Ref.~\cite{Bicer_2014} that, if the total RF voltage were increased by a factor 3 with respect to the baseline, a centre-of-mass energy of 500\,GeV could be reached, and an integrated luminosity of $500\, {\rm fb}^{-1}$ could be delivered over a period of three years, as displayed in Fig.~\ref{fig:lumi} with the red dashed line. In the framework of the FCC, however, the interest of such an upgrade could not be demonstrated for the physics of the Higgs boson~\cite{Bicer_2014}. It is interesting to re-evaluate this statement in view of the physics of the top quark. The centre-of-mass energy was therefore varied from 350 to 500\,GeV, and the corresponding integrated luminosity was varied linearly with $\sqrt{s}$ from 2.6 to 0.5\,${\rm ab}^{-1}$. The expected uncertainties on the top electroweak form factors, $\sigma(F_{1V}^\gamma)$, $\sigma(F_{1V}^Z)$, $\sigma(F_{1A}^Z)$, $\sigma(F_{2V}^\gamma)$ and $\sigma(F_{2V}^Z)$, were determined as explained in the previous section, with corrections for the lepton energy and angular resolutions, the event selection efficiency, and the detector acceptance, as described above, for each value of the centre-of-mass energy. The variation of these uncertainties with $\sqrt{s}$ is shown in Fig.~\ref{fig:variation}.\selectlanguage{english} \begin{figure}[h!] \begin{center} \includegraphics[width=1.00\columnwidth]{figures/Fig5/Fig5} \caption{{\label{fig:variation} Variation with the centre-of-mass energy of the statistical uncertainties of the five top-quark electroweak form factors considered in Ref.~\protect\cite{Baer_2013}, at the FCC-ee. Left column, from top to bottom: $F_{1V}^\gamma$, $F_{1V}^Z$, and $F_{1A}^Z$. Right column: $F_{2V}^\gamma$ and $F_{2V}^Z$.% }} \end{center} \end{figure} The first striking observation is that an increase of the centre-of-mass energy far beyond the top-pair production threshold is not particularly relevant to improve the precision on the top-quark electroweak couplings, as already pointed out in Ref.~\cite{Vos_2015}. For four out of five couplings, optimum precision is actually reached for $\sqrt{s} \simeq 365$\,GeV, and for the fifth one the precision is within 50\% of optimum at this energy. The expected precision then degrades by up to a factor four with 500\,${\rm fb}^{-1}$ at $\sqrt{s} = 500$\,GeV. It can also be noted that a very decent precision is alredy reached for $\sqrt{s} = 350$\,GeV. The second observation is that the precision reached for these four couplings is at the level of the per mil, and that the tt$\gamma$ and the ttZ couplings can be determined independently with this precision without the need of initial polarization. It is only for $F_{1A}^Z$ that a moderate increase of the centre-of-mass energy would improve the precision by a factor of two, from 2.2\% at $\sqrt{s} = 365$\,GeV to 1\% at $\sqrt{s} = 440$\,GeV, an energy at which the single-top production would need to be included as a background to the study. There are, however, many other observables to be studied in a ${\rm t\bar t}$ event, beyond the energies and angles of the leptons. It was noticed, for example, that a factor of two improvement could be obtained for $\sigma(F_{1A}^Z)$ at $\sqrt{s} = 365$\,GeV with the energy and angular distributions of the b quarks instead of the leptons. The use of the b jets will be the subject of further studies with more detailed event reconstruction algorithms. \section{Results and discussion} \label{sec:results} {\bf Expected statistical accuracies} A picture is often better than many words. This study is best summarized by Fig.~\ref{fig:baer}, taken from Ref.~\cite{Baer_2013}, and modified by the addition of the FCC-ee projections at $\sqrt{s} = 365$\,GeV. As anticipated, the lack of incoming beam polarization at the FCC-ee is more than compensated by the use of the final state polarization and by a significantly larger integrated luminosity, even with the sole use of the lepton energy and angular distributions, and modest detector performance.\selectlanguage{english} \begin{figure}[h!] \begin{center} \includegraphics[width=1.00\columnwidth]{figures/Fig6/Fig6} \caption{{\label{fig:baer} (Modified from Ref.~\protect\cite{Baer_2013}). Statistical uncertainties on CP-conserving top-quark form factors expected at the ILC (blue) and the LHC (red). The figure was modified to include the projections from the FCC-ee. The results for the LHC assume an integrated luminosity of 300\,${\rm fb}^{-1}$ and a centre-of-mass energy of 14\,TeV. The results for the ILC assume an integrated luminosity of 500\,${\rm fb}^{-1}$ at $\sqrt{s} = 500$\,GeV, and beam polarizations of ${\cal P} = \pm 0.8$, ${\cal P}^\prime = \mp 0.3$. The ILC projections are obtained from the measurements of the total top-quark pair production cross section, together with the top-quark forward-backward asymmetry. The FCC-ee projections are obtained at $\sqrt{s}=365$\,GeV, with unpolarized beams and with an integrated luminosity of 2.4\,${\rm ab}^{-1}$, from the sole lepton angular and energy distributions.% }} \end{center} \end{figure} {\bf Theory uncertainties} As mentioned in the previous section, the dominant systematic error on these numbers is the theoretical uncertainty on the predicted event rate. It is difficult to say today what this uncertainty will be at the time of the FCC-ee startup. To evaluate its effects, the likelihood in Eq.~\ref{eq:likelihood} was enhanced with the corresponding Gaussian nuisance factor, and the form factor uncertainties were determined for any value of the assumed cross-section theoretical error. The result is displayed in Fig.~\ref{fig:crosserr} for a theoretical error between 0.01\% and 100\%. The uncertainties on the first four form factors stay below a few per mil if the total cross section can be predicted with a precision of 2\% or better. The uncertainty on $F_{1A}^Z$ remains essentially unaffected as long as the theoretical precision is below 10\%.\selectlanguage{english} \begin{figure}[h!] \begin{center} \includegraphics[width=1.00\columnwidth]{figures/Fig7/Fig7} \caption{{\label{fig:crosserr} Uncertainty on the form factors at the FCC-ee with 2.4\,${\rm ab}^{-1}$ at $\sqrt{s} = 365$\,GeV, as a function of the relative cross-section theorerical error, varied from 0.01\% to 100\%. Left column, from top to bottom: $F_{1V}^\gamma$, $F_{1V}^Z$, and $F_{1A}^Z$. Right column: $F_{2V}^\gamma$ and $F_{2V}^Z$.% }} \end{center} \end{figure} {\bf Discussion} The above results are obtained under the assumption that the gauge-invariance-violating form factor ($F_{1A}^\gamma$) and the CP-violating form factors ($F_{2A}^{\gamma,Z}$) vanish, to allow for a one-to-one and straightforward comparison with Ref.~\cite{Baer_2013}. From an experimental point-of-view, however, there is no a-priori reason why these form factors could not be extracted from the measurements of the lepton angular and energy distributions. The present study is therefore extended, with $2.4\,{\rm ab}^{-1}$ at $\sqrt{s} = 365$\,GeV, to the following two configurations by relaxing the constraints on $F_{1A}^\gamma$, $F_{2A}^\gamma$ and $F_{2A}^Z$: either the four form factors $F_{1V,A}^X$ are varied simultaneously while the four $F_{2V,A}^X$ are fixed to their standard model values, or vice-versa. In the first configuration, it turns out that relaxing the constraint on $F^\gamma_{1A}$ does not sizeably change the precision on the other three $F^X_{1V,A}$ form factors, as shown in Table~\ref{tab:f1}. A per-cent accuracy is also obtained on $F^\gamma_{1A}$.\selectlanguage{english} \begin{table}[htbp] \begin{center} \caption{{\label{tab:f1} Precision on the four $F_{1V,A}^X$ expected with $2.4\,{\rm ab}^{-1}$ at $\sqrt{s} = 365$\,GeV at the FCC-ee, if $F_{1A}^\gamma$ is fixed to its standard model value (first row) or if this constraint is relaxed (second raw). The precisions expected with $500\,{\rm fb}^{-1}$ at $\sqrt{s} = 500$\,GeV are indicated in the third row.}} \begin{tabular}{|l|l|l|l|l|} \hline Precision on & $F_{1V}^\gamma$ & $F_{1V}^Z$ & $F_{1A}^\gamma$ & $F_{1A}^Z$ \\ \hline\hline Only three $F_{1V,A}^X$ & $1.2\, 10^{-3}$ & $2.9\, 10^{-3}$ & $0.0\, 10^{-2}$ & $2.2\, 10^{-2}$ \\ \hline All four $F_{1V,A}^X$ & $1.2\, 10^{-3}$ & $3.0\, 10^{-3}$ & $1.3\, 10^{-2}$ & $2.4\, 10^{-2}$ \\ \hline $\sqrt{s} = 500$\,GeV & $5.5\, 10^{-3}$ & $1.5\, 10^{-2}$ & $1.0\, 10^{-2}$ & $2.2\, 10^{-2}$ \\ \hline \end{tabular} \end{center} \end{table} The situation with the $F_{2V,A}^X$ form factors in the second configuration is even clearer. Indeed, the distributions related to $F_{2A}^\gamma$ and $F_{2A}^Z$ form factors are CP odd, while those related to $F_{2V}^\gamma$ and $F_{2V}^Z$ are CP even. With vanishing correlation coefficients, the two pairs of form factors can therefore be determined independently from each other. The precisions on $F_{2V}^\gamma$ and $F_{2V}^Z$, expected with $2.4\,{\rm fb}^{-1}$ at $\sqrt{s} = 365$\,GeV at the FCC-ee, are thus unchanged with respect to Fig.~\ref{fig:baer} when the constraint on $F_{2A}^\gamma$ and $F_{2A}^Z$ is relaxed, and amount to $8.1\, 10^{-4}$ and $2.3\, 10^{-3}$ respectively. With $500\,{\rm fb}^{-1}$ at $\sqrt{s} = 500$\,GeV, the precisions would be $2.5\, 10^{-3}$ and $8.3\, 10^{-3}$ respectively, as also shown in Fig.~\ref{fig:variation}. The accuracy of the CP-violating form factors with the sole lepton angle and energy distributions is moderately constraining ($1.4\, 10^{-1}$ on $F_{2A}^\gamma$ and $8.2\, 10^{-1}$ on $F_{2A}^Z$) because of the important correlation between the two distributions $f_D^\gamma$ and $f_D^Z$, well visible in Fig.~\ref{fig:distributions}. A relevant precision of $1.7\, 10^{-2}$, however, is reached on the linear combination $F_{2A}^\gamma + 0.17 \times F_{2A}^Z$ with $2.4\,{\rm ab}^{-1}$ at $\sqrt{s} = 365$\,GeV, reduced to $0.9\, 10^{-2}$ with $500\,{\rm fb}^{-1}$ at $\sqrt{s} = 500$\,GeV. A reduction of the correlation between these two form factors requires the analysis of additional observables, beyond the scope of the present study. Similarly, when all eight parameters are considered simultaneously, the lepton angle and energy distributions are no longer sufficient to avoid large correlations between form factors. The same observation was made in Refs.~\cite{Baer_2013} and~\cite{Amjad_2013} with the four observables chosen for the analysis at 500\,GeV and with incoming beam polarizations. A generator-level exercise with more observables in the fully leptonic final state has been recently attempted in Ref.~\cite{ledib_2015}, released after the present study. In this exercise, an optimal-observable analysis of the matrix element squared is carried out with thirteen different observables (the top quark direction, the $\ell^+$ and $\ell^-$ angles and energies, the ${\rm b}$ and ${\rm \bar b}$ angles and energies, and the invariant masses of the top quarks and W bosons), with unambiguous identification and reconstruction under the assumption of a perfect detector. With these additional variables, the few degeneracies between form factors are indeed removed, but the conclusion is identical to that of this paper: the incoming beam polarizations are not essential in the process. A similar analysis could be undertaken for semi-leptonic final states at $\sqrt{s} = 365$\,GeV, in order to determine all eight form factors simultaneously with the ultimate accuracy, but the assumption of a perfect detector cannot be expected to give fully reliable results when the jets and the missing energy from the top decays are to be included, as acknowledged in Ref.~\cite{ledib_2015}. Such an analysis will be carried out when a complete simulation and reconstruction in a realistic detector becomes available for the FCC-ee study. \section{Summary and outlook} In this paper, it has been shown that the measurements of the angular and energy distributions in semi-leptonic ${\rm t\bar t}$ events (${\rm e^+e^- \to t \bar t} \to \ell \nu {\rm q \bar q b \bar b}$) at future ${\rm e^+e^-}$ colliders have a strong potential for a precise determination of the top-quark electroweak couplings. It has been demonstrated, even with the sole use of these two distributions and modest detector performance, that the lack of incoming beam polarization at the FCC-ee is compensated by the polarization of the final state top quarks, and by a significantly larger integrated luminosity. Although these projections were obtained with somewhat conservative hypotheses on the detector performance, it will also be important to reproduce the results with a full simulation in a Monte Carlo study, as to further investigate that the detector requirements are indeed quite modest. While the inferred precisions are already competitive with other projects on the market, such a Monte Carlo study will also allow a reliable reconstruction of all observables in the event, beyond the lepton energies and directions, and is expected to bring sizeable improvements, especially on the few remaining correlations between form factors. The present study is only a first look at this topic for the FCC-ee. It enhances the fantastic potential of a 100-km circular ${\rm e^+e^-}$ collider already envisioned in Ref.~\cite{Bicer_2014} with the full profiling of the top quark from a precise measurement of its electroweak couplings. In view of these new estimates, it becomes of particular interest to check their added value to the sensitivity to new physics, especially when combined with the unequalled precision of the measurements of the Z, the W, and the Higgs boson properties, as well as of the top-quark mass, at the FCC-ee. \section*{Acknowledgments} I would like to give credit where credit is due: this work would not have been undertaken without the scientific vision of Alain Blondel, and his firm belief that the final state polarization would suffice to disentangle the tt$\gamma$ and ttZ couplings. A great deal of inspiration also came from the passionate debates about the merits of the FCC with my former thesis advisor and scientific mentor, Fran{\c c}ois Le Diberder, and my former lab director, Fran{\c c}ois Richard. I am grateful to both. I would like to sincerely thank Zenro Hioki for digging out his code written 15 years ago, running it for me, and allowing me, with his patient explanations, to understand why my uncertainties were so much smaller than those obtained in Ref.~\cite{Grzadkowski_2000}. Finally, I am indebted to Patrizia Azzi, Alain Blondel, Christophe Grojean, and Roberto Tenchini, for their careful reading of the manuscript and for the wisdom of their comments and suggestions. \selectlanguage{english} \FloatBarrier \bibliographystyle{plain} \bibliography{bibliography/converted_to_latex.bib% } \end{document}

https://www.zentralblatt-math.org/matheduc/en/?id=169109&type=tex

zentralblatt-math.org

CC-MAIN-2019-43

text/plain

application/x-tex

crawl-data/CC-MAIN-2019-43/segments/1570986696339.42/warc/CC-MAIN-20191019141654-20191019165154-00495.warc.gz

\input zb-basic \input zb-matheduc \iteman{ZMATH 1996c.00445} \itemau{Finselbach, Michael; Kaeberich, Guenther; Rockstroh, Lothar; Steigerwald, Friedhelm} \itemti{Schools and electronic networks. (Schulen im elektronischen Netz.)} \itemso{Comput. Unterr. 5, No. 20, 19-24 (1995).} \itemab Im Rahmen eines Projektes wird die Problematik des Aufbaus und Betriebs eines Informationssystems fuer Schueler beschrieben. Auf die verwendete Software, die inhaltlichen Schwerpunkte der Datenbank und die Einstellung der Betreiber zum neuen Medium wird eingegangen. \itemrv{~} \itemab The problems of establishing and operating an information system for pupils are described in the framework of a project. The software used, the database contents, and the pupils' attitude towards new media are gone into. \itemrv{~} \itemcc{R50} \itemut{} \itemli{} \end

http://www.aips.nrao.edu/TEXT/PUBL/LET95B.TEX

nrao.edu

CC-MAIN-2022-33

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-33/segments/1659882570868.47/warc/CC-MAIN-20220808152744-20220808182744-00444.warc.gz

%----------------------------------------------------------------------- %; Copyright (C) 1995 %; Associated Universities, Inc. Washington DC, USA. %; %; This program is free software; you can redistribute it and/or %; modify it under the terms of the GNU General Public License as %; published by the Free Software Foundation; either version 2 of %; the License, or (at your option) any later version. %; %; This program is distributed in the hope that it will be useful, %; but WITHOUT ANY WARRANTY; without even the implied warranty of %; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the %; GNU General Public License for more details. %; %; You should have received a copy of the GNU General Public %; License along with this program; if not, write to the Free %; Software Foundation, Inc., 675 Massachusetts Ave, Cambridge, %; MA 02139, USA. %; %; Correspondence concerning AIPS should be addressed as follows: %; Internet email: aipsmail@nrao.edu. %; Postal address: AIPS Project Office %; National Radio Astronomy Observatory %; 520 Edgemont Road %; Charlottesville, VA 22903-2475 USA %----------------------------------------------------------------------- %Body of \AIPS\ Letter for 15 July 1995 \documentstyle [twoside]{article} \newcommand{\AMark}{AIPSMark$^{(93)}$} \newcommand{\AMarks}{AIPSMarks$^{(93)}$} \newcommand{\LMark}{AIPSLoopMark$^{(93)}$} \newcommand{\LMarks}{AIPSLoopMarks$^{(93)}$} \newcommand{\AM}{A_m^{(93)}} \newcommand{\ALM}{AL_m^{(93)}} \newcommand{\AIPRELEASE}{July 15, 1995} \newcommand{\AIPVOLUME}{Volume XV} \newcommand{\AIPNUMBER}{Number 2} \newcommand{\RELEASENAME}{{\tt 15JUL95}} \newcommand{\OLDNAME}{{\tt 15JAN95}} %macros and title page format for the \AIPS\ letter. \input LET94.MAC \input psfig \newcommand{\MYSpace}{-11pt} \normalstyle \section{The Good News $\ldots$} The \RELEASENAME\ release of Classic \AIPS\ is now available. It may be obtained via {\it anonymous} ftp or by contacting Ernie Allen at any of the addresses given in the masthead. As of this writing, 119 copies of the \OLDNAME\ release have been given out electronically (7 tar.Z, 22 tar.gz, and 24 binary over 7 operating systems) or on magnetic tape (39 8mm, 24 4mm, 3 QIC, 1 3.5-inch floppies and {\it no} 9-track). 80 of the 119 were of the full binary release. Outside of NRAO, the 80 sites receiving {\tt 15JAN95} indicated their plans to run \AIPS\ on 147 SUN OS 4, 198 SUN Solaris, 18 IBM AIX, 36 HP-UX, 41 DEC Alpha, 17 SGI Irix, 14 PC Linux and 1 Convex computers. A total of 472! The \RELEASENAME\ release is the first release under a new system designed to protect NRAO's intellectual property rights, while making \AIPS\ more readily available to both the astronomy and non-astronomy communities. All files are now copyrighted by Associated Universities, Inc., NRAO's parent corporation, but are made freely available under the GNU General Public License \hbox{(GPL)}. This means that User Agreements are no longer required, that you may obtain copies via anonymous ftp without contacting Ernie Allen, and that you may redistribute (and/or modify) the software, under certain restrictions, if you so choose. You may {\it not} sell this software; it remains free to everyone. Details on this new way to get \AIPS\ and the text of the GNU GPL appear later in this \Aipsletter. This release contains the new task {\tt IMAGR}, intended to replace all previous imaging and Cleaning tasks (\eg\ {\tt MX}, {\tt HORUS}, {\tt UVMAP}, and \hbox{{\tt WFCLN}}). It offers all capabilities of these tasks, with some corrections, plus a wide range of new data weighting, TV interaction, and wide-field and wide-bandwidth correction options. The iterative self-cal and imaging task {\tt SCMAP} now offers many of the same imaging and interactive options. The \Cookbook\ chapters on imaging and deconvolution were combined into one chapter describing {\tt IMAGR} and the VLBI data reduction chapter was completely revised. It will need to be revised further, however, to describe numerous improvements and additions to the arsenal of VLBI calibration tasks, some of which appear in the current release. {\large \bf We expect to be able to offer a position in the Classic \AIPS\ Group, to be based in Charlottesville, in the near future. If you are interested, please contact us at the addresses given above.} \section{$\ldots$ and the Bad} On May 1, Phil Diamond was promoted to Deputy Assistant Director of the Socorro Array Operations Center with responsibilities for computing and array operations. While this may be good news for Phil, it is not for the \AIPS\ group. We are now reduced to two general-purpose programmers, but see above. \vfill\eject While we are reduced in manpower, the official expectations on the longevity of the Classic \AIPS\ project have been substantially increased. Phil's promotion came because Tim Cornwell was named Assistant Director for the \AIPTOO\ project. Tim is reorganizing that project and has stated that he expects it will not replace Classic \AIPS\ for about five years, \ie\ the year 2000. (Classic \AIPS\ was first ``frozen'' by management in April 1991, but freon seems to be in short supply these days.) The use of Sun OS 4.1.{\it x} is being phased out at the NRAO in favor of the Solaris operating system, currently at Solaris 2.4 (also called SunOS 5.4). This means that the \RELEASENAME\ version will be the last to be tested extensively under the old Sun Berkeley-based operating system. We will keep one or more computers on the old system as long as we can and we do not anticipate major problems anytime soon, but it is inevitable that the quality of our support for the old OS will diminish with time. \section{\Cookbook\ Update Continues} The \AIPS\ \Cookbook\ was last updated for the {\tt 15OCT90} release. Because a lot has changed in \AIPS\ since then, we have decided to modernize the \Cookbook. We are doing this one chapter at a time and are making each chapter available via the World-Wide Web as soon as it is ready. For details of the Web, see the publications article in this \Aipsletter. The chapters changed so far are \vspace{-8pt} \begin{itemize} \item\ 1 --- {\it Introduction} --- Added new sections giving a project summary and a diagram of the structure of \hbox{\AIPS}. \item\ 2 --- {\it Starting Up \AIPS} --- Changed to describe workstation use, \AIPS\ in networked environments, and managing the TV server \hbox{{\tt XAS}}. \item\ 3 --- {\it Basic \AIPS\ Utilities} --- Updated information about history files and disk allocation, added {\tt ABOUT} and {\tt APROPOS} to the help section, moved and updated tape mounting, and added a discussion on external disk files (Fits, text, $\ldots$). \item\ 4 --- {\it Calibrating Interferometer Data} --- With much help from Rick Perley and Alan Bridle, rearranged and corrected everything, adding a substantial discussion of when and how to edit and bringing the description of {\tt TVFLG} up to date including a picture. \item\ 5 --- {\it Making Images from Interferometer Data} --- Rewrote old chapters 5 and 6 to describe the new {\tt IMAGR} task rather than several old imaging tasks, to modernize the self-calibration description, and to replace the discussion of {\tt IBLED} with one describing the current program. \item\ 6 --- {\it Displaying Your Data} --- Rewrote old chapters 7 and 8 to make a coherent, current, and complete description of printing, plotting, TV, and graphical data displays. \item\ 8 --- {\it Spectral-Line Software} --- Rewrote old chapter 10, replacing old outline format with a more coherent (and wordy) description of line analysis, emphasizing continuum subtraction and other more modern imaging techniques. \item\ 9 --- {\it Reducing VLBI Data in \AIPS} --- Rewrote the old chapter to describe the nearly completely new software now available for the \hbox{VLBA}. This chapter will remain under active development for some time. \item\ 13 --- {\it Current \AIPS\ Software} --- Replaced old lists with new ones produced for the {\tt ABOUT} verb. Now current to the \RELEASENAME version. \item\ A --- {\it Summary of \AIPS\ Continuum UV-data Calibration} --- Inserted a new appendix giving an updated version of Glen Langston's outline of continuum calibration. \item\ B --- {\it A Step-by-Step Guide to Spectral-Line Data Analysis in \AIPS} --- Inserted a new appendix by Andrea Cox and Daniel Puche giving {\it their} outline view of spectral-line data reduction in \hbox{\AIPS}. \item\ Z --- {\it System-Dependent \AIPS\ Tips} --- Replaced with whole new discussions including color printers, screen copying, film recorders, workstation environments. A method for people to have NRAO make slides for them is described. \end{itemize} \vfill \eject \section{Improvements for Users in 15JUL95} \subsection{Imaging} \subsubsection{IMAGR} The new task {\tt IMAGR} is intended to become the primary image making task in \AIPS, replacing {\tt UVMAP}, {\tt HORUS}, {\tt MX}, and \hbox{{\tt WFCLN}}. It offers all of the capabilities of these tasks, including applying calibration to data from multi-source \uv\ files. It does the Schwab-Cotton \uv-plane subtraction form of the Clark Clean, in up to 16 fields, and can apply a variety of wide-field and wide-bandwidth corrections. The really new parts of the program lie in its ability to make 8192x8192 images, to sort the data (if needed), to use the TV display interactively, and to weight the data flexibly. Previous imaging tasks required the user to pre-sort the data, to accept poor forms of uniform weighting, and/or to put up with very inefficient multiple passes through the input data; {\tt IMAGR} sorts the data if needed to avoid these things. The older tasks offered, at most, a TV display of one of the residual images and the option to terminate the Clean at the end of the current major cycle. {\tt IMAGR} does its display before each major cycle, allowing you to interact with the dirty images or the current residual images. You may zoom and enhance the display and select both circular and rectangular Clean windows for each of the fields. The choice of field to display and window is made from a menu displayed on the \hbox{TV}. The menu offers numerous familiar functions including {\tt CURVALUE}, {\tt TVZOOM}, {\tt TVPSEUDO}, {\tt TVBOX}, and window setting as well. {\tt IMAGR} offers a large number of ``knobs,'' in the form of adverbs, with which you may adjust the data weighting. To be honest, we must admit that we do not know what the optimum setting of the knobs might be, but we do know that they can make a significant difference in the signal-to-noise on images, can alter the synthesized beam width and sidelobe pattern, and can produce bad striping in the data when mildly wrong samples get substantially large weights. {\tt IMAGR} allows the user to control the size of the ``cells'' in the \uv\ plane used for counting samples in uniform weighting. It offers both circular and rectangular functions to control how a sample is counted as a function of distance from its location in the \uv\ plane. It allows modification of the input data weights by various exponents for counting and/or weighting and performs the usual tapering. Finally, it offers a variation of Dan Briggs' ``robust weighting'' scheme to temper the wide divergence of weighting factors attempting to make the weights ``uniform.'' The effect of this ``{\tt ROBUST}ness'' parameter on synthesized beam patterns is illustrated in the accompanying Figure taken from the \AIPS\ \Cookbook. {\tt IMAGR} computes the effect of all of this weighting on the expected noise (compared to that expected from ``natural'' weighting) in the image and reports it in the image headers as parameter \hbox{{\tt WTNOISE}}. The values of this parameter found for the beams in the Figure are shown in the accompanying tables. \vfill \centerline{\psfig{figure=FIG/ROBVLA.PLT,height=2.95in}\hss \psfig{figure=FIG/ROBVLB.PLT,height=2.95in}} {\small \noindent Slices taken through the centers of synthesized beams for various values of the {\tt ROBUST} parameter. Plot at left for a VLA A- and B-array data set, while the plot at right is for a VLBA data set. Do not assume that these plots apply to your data sets, however. Tables give noise increase over natural weighting ($\equiv$ large {\tt ROBUST}).} \eject To assist in the use of this new task, a new verb {\tt FILEBOX} was written, {\tt TVBOX} was revised to set circular as well as rectangular boxes, and the \Cookbook\ chapters on imaging and deconvolution were rewritten. {\tt FILEBOX} assists the user to prepare a text file containing up to 500 (!!) rectangular and circular Clean boxes for each of up to 16 fields which can be fed to {\tt IMAGR} as the initial selection of source-searching areas. It allows you to build up the list gradually, interacting with the TV display to prepare the list for the visible portion of the displayed field. All Clean box setting with the TV (verbs {\tt TVBOX}, {\tt REBOX}, {\tt FILEBOX} and tasks {\tt IMAGR}, {\tt SCMAP}, {\tt PLAYR}) uses the same subroutine which sets either kind of area and lets you modify existing Clean boxes and add new ones. Thus, {\tt NBOXES} is now an {\it output} adverb from {\tt TVBOX} and both an inputs and output adverb to \hbox{{\tt REBOX}}. The new \Cookbook\ chapter combines old chapters 5 and 6 to describe {\tt IMAGR}, {\tt SCMAP}, and numerous other changes to imaging since the 1990 edition. \subsubsection{SCMAP} {\tt SCMAP} is an OOP-based task intended to do imaging and Cleaning iterated with self-calibration. For this release, it has been improved by the addition of all of the new data-weighting and imaging options of \hbox{{\tt IMAGR}}. {\tt SCMAP} offers {\tt IMAGR}'s interactive TV options during Clean plus a similar interactive TV display before each self-calibration cycle. The latter will, some day, have an interactive data editing capability and a variety of other options to adjust the self-calibrations. At the moment, it is mostly just another way to adjust the Clean boxes. {\tt SCMAP} has the ability to determine the basic {\tt SOLINT} from the times found in the data set, but is currently restricted to a single {\tt SOLINT} for all iterations. \subsubsection{Bugs and other worries} When doing Clark Cleans, programs have to make the decision about when to do another major cycle. Previously, all \AIPS\ tasks chose not to start another major cycle when they were within 10\%\ of the iteration limit. That is often a sensible choice, but is very wrong when the number of iterations in each major cycle previously has been very much less than 10\%\ of the iteration limit. All tasks have been changed to extend a major cycle by no more than half of the previous major cycle. Several bugs in the Clean component subtraction were corrected during the development of \hbox{{\tt IMAGR}}. Subroutine {\tt ALGSUB} did not compute the number of rows needed for bandwidth synthesis correctly and could, as a consequence, have failed to subtract the model from some channels of some \uv-data samples. Subroutine {\tt ALGSTB}, used for rotated or unsorted data sets, computed the maximum baseline wrongly and, as a consequence, put very large and erroneous fluxes in the residual data file. The gridded component subtraction routine replaced the correct (and simple) cell coordinate correction with an elaborate erroneous and non-linear correction. In some cases, \ie\ large fields near the North Pole, this caused error messages to appear and, more importantly, could cause the gridding of the components to be done erroneously. These bugs affected {\tt MX}, {\tt UVSUB}, {\tt WFCLN}, {\tt CALIB}, {\it et al.}~and were capable of producing either subtle ripples in the Clean or completely erroneous (and hence obvious) outputs. Because these bugs had to be found by programmers in new tasks, it is believed that they did not affect very many people in a significant way. {\tt WFCLN} had bugs which caused a scaling error when imaging with {\tt BIF} $\ne 1$ and which could have caused addressing exceptions in bandwidth synthesis imaging. \subsection{Image analysis and display} \subsubsection{Plot labeling} The task {\tt LWPLA} has been using incorrect sizes for characters to try to correct for poor placement of the character strings by the plot tasks. These incorrect sizes led to misplacement of the strings in other ways. The solution was to go through all plot tasks and adopt a better and more standard way to place the labeling around the main plot areas. While doing so, we also added the adverb {\tt LTYPE} to all plotting tasks which did not already have it and added new values for additional control over the labeling of plots. The verb {\tt EXTLIST} was brought up to date for most, if not all, tasks. \vfill\eject \subsubsection{KNTR, PCNTR} The task {\tt KNTR} was changed to plot grey-scale images as well as contours. Either of the two input images can be used as the contour image and/or the grey-scale image. If one of the two images is a cube, multiple panels can be displayed. The other image can then be either a cube or a plane. The Clean beam may be plotted in a separate frame or in any of the four corners with various degrees of cross hatching. This makes {\tt CNTR} and {\tt GREYS} obsolete. {\tt KNTR} can plot the edges between blanked and good pixels or leave them invisible under control of the new adverb \hbox{{\tt DOBLANK}}. {\tt PCNTR} was improved to convert Stokes I, Q, and U on the fly rather than require the input of total polarization and angle images found by \hbox{{\tt COMB}}. The latter are still accepted of course. The input images can now be polarization cubes or three separate images. The Clean beam may be plotted with various degrees of cross hatching in any of the four corners. \subsubsection{Displaying \uv\ data} The display of \uv\ data received some minor improvements and bug fixes for this release. {\tt UVHGM} was brought into the modern world by teaching it to read compressed data, to do some Stokes conversion, and to plot more than one Stokes, channel, or IF on each plot. The meaning of the plot scaling adverbs was changed in {\tt UVPLT} to give more freedom with partially self-scaled plots. The data binning mode in {\tt UVPLT} was given the choice of weighted or unweighted averaging. {\tt VPLOT} acquired greater flexibility in the selection of antennas and baselines to be plotted and became more understanding about strange values of the averaging interval. The averaging of frequency channels was corrected in {\tt CLPLT}, the task which plots closure phases. The task {\tt POSSM} got a fair amount of attention. Various barriers to plotting single-dish ``\uv'' data were removed. The scaling of multiple-frame plots was improved. It now appends to the output text file rather than replacing it, and will write multiple spectra to the file when the averaging interval {\tt SOLINT} is set greater than zero. Spectrum reversals are now corrected in writing out the file. Labeling of reversed axes in channels was corrected, as was the computation of velocity labels. {\tt LISTR} got a new option. With {\tt OPTYPE = 'GAIN'}, setting {\tt STOKES = 'POLD'} will get a display of the right versus left polarization gain ratio or their phase difference depending on the setting of \hbox{{\tt DPARM(1)}}. Other minor bugs in the gain listings were corrected, as were bugs in handling the list of antennas and baselines in the matrix mode. \subsubsection{TV improvements} The \AIPS\ TV was changed in useful ways for the \RELEASENAME\ release. Four more graphics overlay channels were added. These four are treated in a new way. The first four graphics channels actually require 15 colors so that places where they overlap will show in different colors. If we were to do that with four more planes, then all 256 levels would be used up and we could not display the images. Therefore, the second four graphics planes appear only if no lower-numbered plane is turned on at the pixel. Channel 8 is used for the black background surrounding lettering now, so there are four usable graphics channels with full coloring and three additional ones with partial capabilities. Users may need to change their {\tt .Xdefaults} file; see {\tt HELP XAS} for details. The image catalog files now need four more records for the new graphics planes, which will normally require them to be replaced. The way in which {\tt XAS} allocates its colors was also changed. If it cannot get enough colors in the system's default color table, then {\tt XAS} allocates its own color table. When the cursor moves into the {\tt XAS} window, this non-default table applies and the colors of the other windows on the workstation screen may change. In the new release, {\tt XAS} takes its colors beginning at the top of the table. Then, if {\tt XAS} does not use all 256 colors, the entries at the bottom levels of the table are not touched. This trick means that the first windows created as you log in --- your basic {\tt xterm}s usually --- will keep their colors when the cursor moves into the {\tt XAS} window. In this way, you may actually get to see the instructions for using the TV while you are using the \hbox{TV}! \vfill\eject The way in which {\tt AIPS} and tasks handle errors while talking to the TV was corrected. Previously, the close-down sequences could cause {\tt AIPS} or the task to abort when trying to issue commands to a dead display. The \AIPS\ startup procedures were modified to check for the environment variable {\tt \$AIPS\_TV\_BUFFERED} and to set the TV to a buffered mode if it has the value \hbox{{\tt YES}}. This mode of talking to the TV is faster since it leaves out some of the error testing and other handshaking. The loss in reliability is probably insignificant, especially over slow network connections where any help with the speed is desirable. \subsection{VLBI data processing} \subsubsection{Two-bit VLBA sampler corrections: ACCOR} The voltage thresholds of the two-bit VLBA samplers, which define the four states measured in this digitization scheme, may deviate slightly across the network and may also differ from the optimal theoretical values. The effect of errors in these level settings is to introduce amplitude scaling errors in the two-bit data, most generally showing up as an amplitude offset between the RR and LL cross-power data. These scaling errors can reach 10--20 percent in some cases. This effect can be removed by using the mean level of the autocorrelation data to determine the sampler scaling error (L. Kogan, VLBA Scientific Memo 9). The new task {\tt ACCOR} in \AIPS\ implements this method. {\tt ACCOR} produces a solution ({\tt SN}) table containing the amplitude scaling factors which can be applied using {\tt CLCAL} in the standard manner. The sampler scaling errors for one-bit VLBA data are generally negligible. For further information contact L. Kogan ({\tt lkogan@nrao.edu}). \subsubsection{Amplitude calibration with ANTAB and APCAL} Two new tasks have been introduced to improve amplitude calibration of VLBI data, replacing and expanding the functionality presently offered by \hbox{{\tt ANCAL}}. The first task, {\tt ANTAB}, reads a priori calibration text files containing system and/or antenna temperature data and gain curve information and updates the information in the system temperature ({\tt TY}) and gain curve ({\tt GC}) tables accordingly. Greater flexibility is offered in reading the calibration files, including improved handling of VLA calibration data, more flexible assignment of tabulated data to individual IF and polarization pairs, and an allowance for tabulated and IF dependent gains. The second task, {\tt APCAL}, uses the system temperature and gain curve information to generate a solution ({\tt SN}) table containing amplitude calibration information. {\tt APCAL} allows a simultaneous solution for atmospheric opacity and the corresponding adjustment of the amplitude gains, a consideration which may be important for observations at 22 GHz and 43 GHz. The use of {\tt ANTAB} and {\tt APCAL} allows greater selection and control of primary amplitude calibrators. These tasks are the presently recommended route for a priori amplitude calibration of VLBI data. For further information contact Athol Kemball, {\tt akemball@nrao.edu}. \subsubsection{VLBA delay decorrelation corrections} Further to the notice in the last \Aipsletter, development has continued regarding the correction of VLBA delay decorrelation losses within \hbox{AIPS}. The two major effects are spectral averaging decorrelation, which is caused by spectral pre-averaging in the correlator in the presence of unknown residual delays, and alignment or segmentation losses caused by the misalignment of FFT segments due to residual delay errors. The {\tt 15JAN95} release of \AIPS\ allowed corrections for the more significant effect of spectral averaging decorrelation (typically a few percent). This release adds the smaller correction for FFT alignment losses (usually a few tenths of a percent). To incorporate these corrections fully, we have added a new {\tt CQ} table containing VLBA correlation parameters for each \AIPS\ \hbox{IF}. The correction is now activated if the {\tt AN} table array name keyword identifies the data as originating from the VLBA correlator and the {\tt CQ} table is present. This more comprehensive solution supersedes the previous use of the {\tt SPEC\_AVG} keyword in the {\tt AN} table as described in the last \Aipsletter. The {\tt CQ} table is created by {\tt FITLD} via adverb {\tt DELCORR}. Task {\tt FXVLB} will build a missing {\tt CQ} table but must be used before any averaging or selection in frequency. The corrections are thereafter automatically made whenever delay corrections are applied. If the correction is not activated, a warning is given. A full description of these corrections can be found in a forthcoming \AIPS\ Memo (No.~90) by A. Kemball. For further information contact him at {\tt akemball@nrao.edu}. \vfill\eject \subsubsection{VLBA correlator digital corrections in FITLD} The \AIPS\ data filling task {\tt FITLD} has been upgraded to make digital corrections for data processed by the VLBA correlator. These include constant amplitude scaling corrections (b-factor) for cross-power data and full digitization corrections for autocorrelation data. Cross-power digitization corrections are performed in the frequency domain while autocorrelation data, which have higher correlation coefficients, are transformed to the lag domain before digitization corrections are applied. The autocorrelation digitization correction is only exact if zero-padding is used in the correlator due to the lag domain response of an FX correlator. Without zero-padding this correction becomes more exact as the autocorrelation data approach flat, continuum spectra. The autocorrelation correction is recommended even if zero-padding was not used as the digitization correction will generally exceed any errors due to incorrect zero-padding. The digital corrections are controlled using adverb {\tt DIGICOR} in \hbox{{\tt FITLD}}. Further details regarding digitization corrections can be found in VLBA Scientific Memo 6 by L. Kogan. For general information regarding {\tt FITLD}, contact P. Diamond ({\tt pdiamond@nrao.edu}). \subsubsection{Pulse calibration of VLBA data} VLBA pulse-calibration information can be loaded into the new \AIPS\ pulse-calibration ({\tt PC}) table using task \hbox{{\tt PCLOD}}. This task, which will be used temporarily until this information is passed directly through {\tt FITLD}, reads an external text file containing the VLBA pulse-cal data. Users are directed to their technical contact person for information on how to obtain the {\tt PCLOD} text file for their experiment. The task {\tt PCCOR} uses the pulse-cal data in the {\tt PC} table to generate a solution ({\tt SN}) table which corrects the instrumental delay and phase offsets between individual baseband converters. This can be applied prior to fringe fitting using {\tt CLCAL} in the standard manner. This is the first release of {\tt PCCOR} and further development is expected. General information regarding VLBA pulse-calibration corrections can be found in VLBA Scientific Memo~8 by C. Walker. For further information contact L. Kogan ({\tt lkogan@nrao.edu}) or A. Kemball ({\tt akemball@nrao.edu}). \subsubsection{Polarization calibration tasks contributed} Two new polarization calibration tasks have been implemented in this \AIPS\ release. These tasks were developed by Kari Leppanen as part of his thesis work and offer an alternative method of solving for instrumental feed polarization when the polarization calibrator is spatially resolved. As such, these methods are useful in processing polarization data taken at high frequencies. Further details of the algorithms can be found in Leppanen, Zensus and Diamond (Ap.J., in press). The tasks are {\tt BLAVG}, which allows a more robust estimation of differential polarization delay offsets and {\tt LPCAL}, a feed polarization calibration task which allows for spatial structure in the polarization calibrator. The use of these tasks and their interaction with other tasks in \AIPS\ will be included in a forthcoming update to the VLB chapter of the \Cookbook. For further information contact A. Kemball ({\tt akemball@nrao.edu}). \subsubsection{Other VLB-related changes} A variety of other changes and improvements were made in VLBI-related software. A bug in {\tt FRING} affecting data sets for which the first IF was not at zero frequency was corrected, as was a bug in the handling of memory which led to failure messages mentioning \hbox{{\tt SOLINT}}. {\tt FRING} now also re-references the multi-band delays when appropriate. {\tt MK3IN} was changed to allow up to 66 baselines and to accommodate data sets with a large amount of frequency switching. The handling of the reference date was corrected to prevent errors when the antenna tables were written to tape out of time order. {\tt UVGLU} was given the smarts to glue together data sets that do not match exactly, but which are in time order. {\tt FITLD} had a number of minor corrections made to stem the proliferation of {\tt FQ} numbers and to deal with unusual sequencing of data sets. {\tt SNSMO} had a number of changes including correcting for $2\pi$ ambiguities before direct smoothing of phases, fixing the sign of the phase in {\tt VLMB}-type smoothing, and re-enabling clipping of fringe rates. Ed Fomalont was also busy for this release. He added time range and IF selection to {\tt MBDLY} and improved its testing for bad fringe fits. He corrected the geometric calculations in {\tt CL2HF} for converting to Haystack-style delays and rates, changed some of the adverbs, and dropped observations below 0.5 degree elevation. He also made lots of changes to {\tt HF2SV} including adding the {\tt OUTFILE} adverb. These two tasks convert \AIPS-style {\tt CL} tables into files that can be read by the Goddard {\tt calc} and {\tt solve} programs. Ed also created a new task called {\tt HFPRT} to print the contents of the {\tt HF} extension file. \subsection{$UV$ data calibration and manipulation} This area of the code received a fair amount of attention for this release, but mostly in the form of small bug fixes to be mentioned in the miscellaneous section below. A number of bugs in {\tt SPLIT} were corrected. The header frequency was calculated erroneously when the first IF was not at the initial reference frequency and also when some, but not all, channels were averaged. {\tt BIF} $> 1$ was ignored for all but the first source written. The routine used to average spectral channels was replaced with a more reliable one, already used in other tasks. This better routine was also put into \hbox{{\tt AVSPC}}. {\tt UVCOP} was given a new option to delete data with weights below a user-specified threshold. This will be especially useful as a method for deleting bad data from VLBA data sets. The saga of corrections to {\tt UVCOP} to account for data selection in the output tables continued for this release with corrections made to the handling of {\tt CL} and {\tt IM} tables. \subsection{Single-dish data in \AIPS} A potentially serious bug was found in {\tt SDGRD}, the task used to convert single-dish ``\uv'' data into images. One non-existent sample from each buffer was gridded on each call to the gridding routine. If that portion of the memory was not suitably zero, then a square box the size of the convolving function support and of significant strength could appear at some location in the images of some, usually not all, spectral channels. The problem got worse if multiple passes through the data were required to image all spectral channels. Observers using the 12-meter on-the-fly imaging mode with {\tt SDGRD} should consider remaking their images with the corrected task. Note that this bug affected only some of the images computed by \hbox{{\tt SDGRD}}. A number of lesser bugs mostly having to do with allocation of memory were also corrected. See the article on patches for additional details. {\tt SDGRD} was also improved. The default weighting was changed to natural since uniform makes less sense in the single-dish case. An option to compute and put out an image of the expected noise (actually of $1/\sigma^2$) was added. This image may be used with the new task {\tt WTSUM} to do weighted sums of images. This should allow single-dish users to image portions of their data, combining the output images, rather than having to image all of the data at one time (in very large files). Time smoothing was added to {\tt OTFUV}, the task that converts 12m OTF data to \AIPS, in another attempt to reduce the size of OTF data files. \subsection{Miscellaneous changes of interest to users} %\vspace{-10pt} \begin{description} \myitem{FITTP} A bug caused {\tt FITTP} to write an extra header-like record in place of table data when the table file was empty. The bug was fixed and the \AIPS\ FITS readers changed to ignore this error. The readers were ignoring all following tables instead of the error previously. \myitem{SAD} The source rejection logic was changed to reject some rather than all components in a multi-component island when some of them fail to meet the inclusion criteria. \mylitem{GET4NAME} New verbs to get and clear the fourth set of image name parameters were added. \myitem{PLAYR} New task to enhance TV displays, blink two images, and the like chosen from a menu. It is a demonstration task for the \AIPS\ OOP TV class, but may be useful for preparing color tables or looking at your images. \myitem{VTESS} All of the {\tt *TESS} tasks, especially {\tt UTESS} and {\tt VTESS}, had their use of buffers corrected and/or changed to employ appropriately larger sizes. \myitem{CONVL} Messages about the convolving beam size and about any failures in its deconvolution were added. \myitem{calibration} Calibrator source lists must be ignored when using {\tt SN} tables generated on single-source data sets; a table parameter to describe the origin of the {\tt SN} table was implemented. \myitem{flag tables} Copied flag tables also can have entries incompatible with the current data set. Bugs, producing unpredictable flagging and other effects, were exterminated. \myitem{CVEL} A bug causing data to be flagged excessively was found; see the patches report for details. Another (unpatched) addressing bug caused the time and antenna number to be passed into the shifting routines as though they were data. This produced subtle differences in the output spectra. \myitem{UVFLG} A {\tt DTIMRANGE} option was added for text-file input to control the amount by which the stated times are expanded before being written into the flag table. \myitem{FILLM} The wrong reference channel was put in the header for bandwidth codes 8 and 9. It was set to the end rather than the center. {\tt FILLM} also overstated the number of samples deleted for shadowing by doing that test before any other tests for data eligibility. \myitem{CLCOR} A common error in correcting antenna positions ({\tt OPCODE 'ANTP'}) was to fail to set {\tt CLCORPRM(7)} to indicate the phase convention (VLA versus \hbox{VLB}). The task was changed to check the antennas file for this information. \myitem{UVFIT} Array sizes were increased to allow the program to work with the number of parameters it now attempts to fit. \myitem{KEYIN} Modes in which the input text lines are echoed were enabled to assist in debugging large {\tt KEYIN}-style input files used in {\tt ANCAL}, {\tt ANTAB}, {\tt APCAL}, {\tt BLING}, {\tt FETCH}, {\tt MK3IN}, {\tt PCLOD}, {\tt SETAN}, {\tt UVFLG}, and {\tt VLBIN} (at least). \end{description} \section{Improvements Primarily for Programmers in 15JUL95} The area of OOP code and the TV display received a fair amount of attention for the \RELEASENAME\ release. A new AP class was created, primarily so that each ``AP'' application subroutine could claim the pseudo-AP memory for itself without fearing that other subroutines would also expect free access to that memory. Since it is all one big {\tt COMMON} these days, some ``device'' allocation scheme seemed like a good idea. To reserve the pseudo-AP memory, call {\tt APOBJ} with an {\tt OPEN} operation code and the current subroutine name. Be sure to close it as soon as your subroutine no longer depends on the contents of the AP memory. The big change in this area was the creation of a TV device class and a TV utility library to make its use straightforward. At present, these are documented only in the {\tt \$APLOOP} files {\tt TVDEVICE.FOR} and {\tt TVUTIL.FOR}, but they will appear in the general OOP documentation in due course. This class provides access to virtually all TV functions including the display of, and interaction with, TV menus. To implement this class, a number of {\tt AIPS} verb subroutines were restructured to make the TV functions appear in separate {\tt \$YSUB} subroutines. These subroutines were also generalized to handle more labeling options, line directions, and so forth. Although you may use these directly in \AIPS\ programs, new tasks should consider using the OOP package with one or more instantiations of the TV class. Other matters of interest to programmers in \RELEASENAME\ include \vspace{-10pt} \begin{description} \myitem{POPS} A bug in the processing of the {\tt VERB} and {\tt PSEUDOVB} pseudo-verbs used in the {\tt NEWPARMS} run file caused verb-like symbols to be re-compiled incorrectly and often caused more curious effects as well. \myitem{TKDEV} The assignment of graphics device numbers was changed from the arbitrary 241--255 and the handling of the device assignment for ``remote'' graphics devices (namely the user's own terminal) was corrected. \myitem{GNU} The GNU short copyleft statement was placed in all files in \hbox{\AIPS}. It must be retained in every file and placed in, for example, the PostScript output files from \TeX\ and {\tt dvips}. \myitem{Perl} To improve the speed of \AIPS\ start-up scripts, versions of some of them have been written in Perl. They will be used if Perl is available on your system and can make quite a difference in the time it takes to get started. \end{description} \vfill\eject \centerline{\psfig{figure=FIG/U95SHIP.PS,height=2.5in}\hss \psfig{figure=FIG/U95RATE.PS,height=2.5in}} {\small \begin{center} \begin{tabular}{rrrrrrrr} release& tape& ftp& vms& unix& expfit& binary& total \\ \hline ALL1980& 8& 0& 8& 0& 0& 0& 8 \\ ALL1981& 13& 0& 13& 0& 0& 0& 13 \\ ALL1982& 15& 0& 13& 2& 0& 0& 15 \\ 15JUL83& 2& 0& 2& 0& 0& 0& 2 \\ 15SEP83& 3& 0& 3& 0& 0& 0& 3 \\ 15NOV83& 6& 0& 6& 0& 0& 0& 6 \\ 15JAN84& 9& 0& 9& 0& 0& 0& 9 \\ 15MAR84& 14& 0& 14& 0& 0& 0& 14 \\ 15MAY84& 13& 0& 13& 0& 0& 0& 13 \\ 15JUL84& 26& 0& 14& 12& 0& 0& 26 \\ 15OCT84& 8& 0& 8& 0& 0& 0& 8 \\ 15JAN85& 1& 0& 1& 0& 0& 0& 1 \\ 15APR85& 36& 0& 35& 1& 0& 0& 36 \\ 15JUL85& 40& 0& 17& 23& 0& 0& 40 \\ 15OCT85& 36& 0& 36& 0& 0& 0& 36 \\ 15APR86& 34& 0& 32& 0& 2& 0& 34 \\ 15JUL86& 26& 0& 25& 1& 0& 0& 26 \\ 15OCT86& 34& 0& 20& 14& 0& 0& 34 \\ 15JAN87& 41& 0& 29& 11& 1& 0& 41 \\ 15APR87& 58& 0& 43& 13& 2& 0& 58 \\ 15JUL87& 52& 0& 26& 26& 0& 0& 52 \\ 15OCT87& 68& 0& 45& 23& 0& 0& 68 \\ 15APR88& 30& 0& 10& 19& 1& 0& 30 \\ 15JUL88& 40& 0& 20& 20& 0& 0& 40 \\ 15OCT88& 39& 0& 17& 22& 0& 0& 39 \\ 15JAN89& 29& 0& 11& 18& 0& 0& 29 \\ 15APR89& 29& 0& 17& 12& 0& 0& 29 \\ 15OCT89& 68& 0& 23& 45& 0& 0& 68 \\ 15JAN90& 9& 0& 1& 7& 1& 0& 9 \\ 15APR90& 87& 0& 35& 52& 0& 0& 87 \\ 15JUL90& 39& 0& 12& 27& 0& 0& 39 \\ 15OCT90& 39& 0& 13& 26& 0& 0& 39 \\ 15JAN91& 56& 0& 16& 40& 0& 0& 56 \\ 15APR91& 115& 18& 19& 114& 0& 0& 133 \\ 15APR92& 37& 41& 0& 78& 0& 0& 78 \\ 15OCT92& 24& 58& 0& 82& 0& 0& 82 \\ 15JUL93& 33& 62& 0& 95& 0& 0& 95 \\ 15JAN94& 16& 56& 0& 72& 0& 0& 72 \\ 15JUL94& 48& 42& 0& 90& 0& 37& 90 \\ 15JAN95& 66& 53& 0& 119& 0& 80& 119 \\ \hline total & 1347& 330& 606& 1064& 7& 117& 1677 \end{tabular} \end{center} } \vfill\eject \section{AIPS Distribution History} At a time when we are changing the method of distributing \AIPS, it is good to look back and see the history of \AIPS' distribution. Ernie Allen has prepared a list of the number of copies of \AIPS\ given away by release. This list, which appears on the previous page, may be plotted as \AIPS\ shipped for each release or as \AIPS\ shipped per month. These plots also appear on the previous page and suggest that the demand for \AIPS\ has been approximately constant in copies per month. Note the rapid acceptance of ftp and binary forms of release and the gradual overtaking of VMS by Unix. We have not shipped a VMS system in rather a long time and shipped only a few in the last release in which VMS was fully supported. That same release was popular for Unix, mostly because it was around for a long time. More copies of \OLDNAME\ \AIPS\ were shipped than has been usual for a 6-month release, perhaps because some sites took copies for more than one operating system. \section{AIPS Publications and the World-Wide Web} The {\it World-Wide Web\/} (WWW) is a method for sending and receiving hypertext over the Internet network and has been made easy to use by clients such as {\it NCSA Mosaic, Netscape, Arena,\/} and {\it Lynx\/}. NRAO is among the many institutions which now offer informative Web pages and networks of additional information. The NRAO ``home'' page is at the Universal Resource Locator (URL) address \begin{center} \vskip -10pt {\tt http://www.nrao.edu/} \vskip -10pt \end{center} The \AIPS\ group home page may be found from the NRAO home page or addressed directly at URL \begin{center} \vskip -10pt {\tt http://www.cv.nrao.edu/aips/} \vskip -10pt \end{center} This page points at basic information, news items about \AIPS, the PostScript text of recent \AIPSLETTER s, patch information for all releases after {\tt 15JAN91}, the latest \AIPS\ benchmark data from various computer systems, copies of {\tt CHANGE.DOC} for every release since {\tt 15JAN90},{\it all} relevant \AIPS\ Memos, {\it every} chapter of the \Cookbook, and all recent quarterly reports to the \hbox{NSF}. There is even a tool to let you brouse the {\tt 15JAN96} versions of all help/explain files. We recommend that you check this URL occasionally since it changes when new software patches, revised \Cookbook\ chapters, and new \AIPS\ Memos are released. Since there were no new \AIPS\ Memos in the last six months (Number 90 is nearly ready), we will not repeat the usual information about the Memo series here. Since some Memos are not available electronically and others do not yet have computer readable figures, you may wish to write for a paper copy of these. To do so, use an \AIPS\ order form or e-mail your request to {\tt aipsmail@nrao.edu}. If you cannot use the Web, you can still use \ftp\ to retrieve the Memos, \Cookbook\ chapters, etc.: \begin{description} \vspace{-10pt} \item{ 1.} {\tt ftp aips.nrao.edu} (currently on {\tt 192.33.115.103}) \item{ 2.} Login under user name anonymous and use your e-mail address as a password ({\it yourname}{\tt @} will do; ftp will fill in the machine you are using). \item{ 3.} {\tt cd pub/aips/TEXT/PUBL} \item{ 4.} {\tt get AAAREADME} and read it for lots more information. \item{ 5.} {\tt get AIPSMEMO.LIST} for a full list of \AIPS\ Memos. \end{description} \section{Patch Distribution} Since \AIPS\ is now released only semi-annually, we make selected, important bug fixes and improvements available via {\it anonymous} \ftp\ on the NRAO cpu {\tt aips.nrao.edu} (now located on {\tt baboon} which is {\tt 192.33.115.103}). Documentation about patches to a release is placed in the anonymous-ftp area {\tt pub/aips/}{\it release-name} and the code is placed in suitable subdirectories below this. (The patches and their documentation are also available on-line via the World-Wide Web.) Reports of significant bugs in {\tt 15JAN95} \AIPS\ were not numerous, so some of the patches were actually for new or improved code rather than bug fixes. The documentation file {\tt pub/aips/15JAN95/README.15JAN95} mentions the following items: \begin{description} \vspace{-8pt} \myitem{UVINIT} The low-level basic routine {\tt UVINIT} had an error allowing it to wrongly conclude that it could do fast \hbox{I/O}. It then set its safety margin to 0, checked the buffer size, changed the I/O method, and left the safety margin {\it wrongly} at 0. This was triggered by a combination of circumstances starting with {\tt NVIS} equal to an integer multiple of 256. \myitem{CVEL} An error in the use of the same array in two parts of the task caused {\tt CVEL} to flag more and more channels as it ran through the data. This would only occur for data from the VLBA correlator when bandpass calibration was requested. \myitem{SWPOL} The {\tt GEODLY} array in {\tt SWPCAL} is not dimensioned to cope with the 6-term polynomials used for VLBA data. {\tt SWPOL} is therefore likely to crash when working with VLBA polarization data. \myitem{AIPS} {\tt PSEUDO} made errors when handling the pseudoverbs {\tt VERB} and {\tt PSEUDOVB} for previously defined symbols. The errors would cause the procedure containing the pseudoverb to be declared a verb or pseudoverb with some verb number such as 4 (an {\tt =} or) the one trying to be declared. \myitem{SETPAR} messed up the setting of assigned users. The {\tt SP} file only supports 15 disks for this and applies to disk 1 now. Changed it to limit the disk numbers to 1 through {\tt MIN (NVOL, 15)}. \myitem{SYSETUP} did not handle the symbolic linking of the gripes ({\tt GR}) and password ({\tt PW}) files due to a couple of missing quote marks. \myitem{patching} The file {\tt \$SYSLOCAL/USESHARED} was inadvertently included in the binary distribution for SunOS and Solaris systems. This causes the {\tt COMLNK}s to fail when any patch or rebuilding is attempted as {\tt LINK} attempts to use shared libraries which are not included in the distribution. \myllitem{AIPS REMOTE} The functionality of being able to display graphics on one's Tektronix or compatible terminal was broken. In previous releases since {\tt 15APR92}, devices 241-255 were reserved for possible ``{\tt REMOTE}'' tek devices for {\tt AIPS} numbers 1 through 15. Now, it is assumed that the first 35 devices {\it beyond} the last configured TV device (as set in the {\tt SP} file via {\tt SETPAR} or {\tt SETSP}) are reserved for these devices. \myitem{SDGRD} failed to place the {\tt STOKES} adverb into the {\tt COMMON} used by the data reading routines. Therefore, it always did Stokes \hbox{{\tt 'I'}}. \myitem{SDGRD} had three addressing bugs in the in-core gridding. One could have caused data to overwrite the gridding function in the ``AP'' memory. This should have produced obvious problems. Perhaps various round-downs kept the gridding routine from actually doing this. The second left very little room in the ``AP'' for data and could have hit limits where it tried to do many channels and then said there was no room for the data. The third was the most serious: an extra ``data sample'' was gridded for each channel in the group using whatever was in the AP in that range of addresses. In the case in which this was found, values of 2, 4, 6, and 8 were gridded in some of the channels and appeared as 5x5 blocks of cells. The AP memory being used was probably correctly used in doing uniform weighting, so these values are likely to be counts of samples. Thus other integer-like values can occur. The weight image showed very large values at the affected pixels since the gridding routine was called numerous times (every 63 samples in my case). A minor change was made in the test to decide whether to do a weight map ($> 2$ was changed to $\ge 2$ in the code and inputs to match the help). \myitem{SDGRD} Improved the task to offer the option of computing an image of $1/\sigma^2$ where $\sigma$ is the correctly computed expected rms in the gridded image (given that the data weights are all the same constant divided ny $rms^2$ where $rms$ is the data sample's expected rms). \myitem{WTSUM} New task of interest to single-dish users (and perhaps others) particularly in conjunction with the {\tt SDGRD} change above. It does a weighted sum of two images using two images of weights or of rms's. \myitem{OTFUV} Added the capability to specify an averaging interval and an output interval. The main benefit is a reduction in disk needs. \end{description} \vspace{-8pt} Note that we do not revise the original release tapes or \tar\ files for patches. No matter when you received your {\tt 15JAN95} ``tape,'' you must fetch and install these patches if you require them. Information on patches and how to fetch and apply them is also available through the World-Wide Web pages for \hbox{\AIPS}. As bugs in \RELEASENAME\ are found, the patches will be placed in the {\tt ftp}/Web area for \hbox{{\RELEASENAME}}. No matter when you receive your \RELEASENAME\ ``tape,'' you must fetch and install these patches if you require them. \vfill\eject \section{Obtaining \AIPS\ and the GNU General Public License} We have decided to make \AIPS\ available via anonymous ftp under the GNU General Public License, the meaning of which will be spelled out later in this section. The installation of \AIPS\ will now proceed something like the following example: We assume that you have created an account for \AIPS\ with a root directory called \hbox{{\tt /AIPS}}. Then do \vskip -10pt \begin{verbatim} home_prompt<601> cd /AIPS home_prompt<602> ftp aips.nrao.edu Connected to baboon.cv.nrao.edu. 220 baboon FTP server (Version wu-2.4(1) Fri Apr 15 12:08:14 EDT 1994) ready. Name (aips.nrao.cv:egreisen): ftp 331 Guest login ok, send your complete e-mail address as password. Password: egreisen@ 230- This is the National Radio Astronomy Observatory ftp server for the 230- AIPS, AIPS++, and FIRST projects. Your access from primate.cv.nrao.edu 230- has been logged, and all file transfers will be recorded. If you do not 230- like this, type "quit" now. Counting you there are 1 (max 20) ftp users. 230- 230- Current time in Charlottesville, Virginia is Mon Jul 17 10:18:46 1995. 230- 230- 230-Please read the file README 230- it was last modified on Wed Mar 8 14:01:24 1995 - 131 days ago 230 Guest login ok, access restrictions apply. ftp> cd aips/15JUL95 250 CWD command successful. ftp> get README 200 PORT command successful. 150 Opening ASCII mode data connection for README (nnnn bytes). 226 Transfer complete. local: README remote: README nnnn bytes received in T seconds (5 Kbytes/s) ftp> get INSTALL.PS 200 PORT command successful. 150 Opening ASCII mode data connection for INSTALL.PS (mmmmm bytes). 226 Transfer complete. local: INSTALL.PS remote: INSTALL.PS mmmmm bytes received in TT seconds (5 Kbytes/s) ftp> binary 200 Type set to I. ftp> hash Hash mark printing on (8192 bytes/hash mark). ftp> get 15JUL95.tar.gz 200 PORT command successful. 150 Opening ASCII mode data connection for 15JUL95.tar.gz ( bytes). 226 Transfer complete. local: 15JUL95.tar.gz remote: 15JUL95.tar.gz mmmmm bytes received in TTTTT seconds (5 Kbytes/s) ftp> quit 221 Goodbye. \end{verbatim} \vskip -10pt You should type in your name (not {\tt egreisen}) followed by an {\tt @} sign at the password prompt. The {\tt hash} command is optional and may be inappropriate in some versions of ftp; it does give a useful indication of progress in the long {\tt get} in most versions. If you do not have the GNU file compression code ({\tt gzip}), you should {\tt get 15JUL95.tar.Z} instead of the {\tt gz} file. \vfill\eject At this point you should read the {\tt README} file to review the latest changes, if any, affecting your installation of \hbox{\AIPS}. You should print out the {\tt INSTALL.PS} PostScript document and read, at least, its overview section. To create the rest of the {\tt /AIPS} directory tree, and fill it with the \AIPS\ source code \vskip -10pt \begin{center} \begin{tabular}{l} {\tt cd /AIPS} \\ {\tt zcat 15JUL95.tar.gz | tar xvf -} \\ \multicolumn{1}{c}{or} \\ {\tt uncompress 15JUL95.tar.Z} \\ {\tt tar xvf 15JUL95.tar} \end{tabular} \end{center} \vskip -10pt depending on which of the compressed source code files you fetched. If you want to get the binary version(s) of \AIPS, you should read the {\tt README} file for further directions. They will tell you a procedure to run which will run a second ftp session to fetch the appropriate contents from the {\tt \$LOAD}, {\tt \$LIBR}, {\tt MEMORY}, {\tt BIN}, and {\tt DA00} areas. You may run this procedure more than once if you need to fetch binaries for more than one architecture. You may also have to run portions of this procedure ``by hand'' if you encounter reliability problems with the network. You will then have to run the {\tt INSTEP1} procedure, as usual, to tell your \AIPS\ about your computer environment. A new part of {\tt INSTEP1} is its offer to assist you in ``registering'' your copy of \hbox{\AIPS}. It will help you complete a registration form and will even e-mail it to us if you want. When we get a registration request, we will enter your information in our user data base and reply with instructions and registration numeric ``keys'' which you may use to complete the registration process (using {\tt SETPAR} and \hbox{{\tt SETSP}}). This may seem cumbersome and onerous, but we have two reasons for doing this. The first reason is to provide us with information about the use of \hbox{\AIPS}. This information is useful to us to justify, to management and funding agencies, our existence and our need for more employees or computers or disk or whatever. The second reason is a concern about excessive demands on our employees' limited time to provide assistance to sites in installing and running the software. If an excessive demand should arise, information from the registration process will allow us to set priorities among the different sites. This registration is entirely optional. We will use transaction logging in ftp and, hence, know which sites have fetched the code. We will assume that sites which do not register are not ``serious'' in their use of \AIPS\ and we will be unable to provide any assistance to unregistered sites (except, of course, to help them register). As of the \RELEASENAME\ release, \AIPS\ is available under the GNU General Public License. The short statement of this license is in every \AIPS\ file, is available on-line via {\tt HELP GNU}, and is given (once) in the \Aipsletter\ as follows. \vskip -10pt \begin{verbatim} Copyright (C) 1995 Associated Universities, Inc. Washington DC, USA. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA. Correspondence concerning AIPS should be addressed as follows: Internet email: aipsmail@nrao.edu Postal address: AIPS Project Office National Radio Astronomy Observatory 520 Edgemont Road Charlottesville, VA 22903-2475 USA \end{verbatim} \vskip -10pt You should have received the GNU General Public License from several sources, most notably GNU themselves with their {\tt emacs}, {\tt gcc}, and numerous other software products. Since \AIPS\ now applies that license to itself --- and intends to import and use other GNU-licensed routines --- we also include the full license text on-line via {\tt EXPLAIN GNU} and, once, in the \Aipsletter: {\small \begin{center} GNU GENERAL PUBLIC LICENSE \\ Version 2, June 1991 \\ \begin{tabular}{ll} Copyright (C) 1989, 1991 & Free Software Foundation, Inc.\\ & 675 Mass Ave, Cambridge, MA 02139, USA \end{tabular} \end{center} Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. \begin{center} Preamble \end{center} The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. \begin{center} GNU GENERAL PUBLIC LICENSE \\ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION \\ \end{center} \begin{description} \item[0.\hphantom{XX}] This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. \item[1.\hphantom{XX}] You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. \item[2.\hphantom{XX}] You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: \begin{description} \item[a)\ ] You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. \item[b)\ ] You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. \item[c)\ ] If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) \end{description} These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. \item[3.\hphantom{XX}] You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: \begin{description} \item[a)\ ] Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, \item[b)\ ] Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, \item[c)\ ] Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for non-commercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) \end{description} The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. \item[4.\hphantom{XX}] You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. \item[5.\hphantom{XX}] You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. \item[6.\hphantom{XX}] Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. \item[7.\hphantom{XX}] If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. \item[8.\hphantom{XX}] If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. \item[9.\hphantom{XX}] The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. \item[10.\hphantom{X}] If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. \begin{center} NO WARRANTY \end{center} \item[11.\hphantom{X}] BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE \hbox{LAW}. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR \hbox{PURPOSE}. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH \hbox{YOU}. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR \hbox{CORRECTION}. \item[12.\hphantom{X}] IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH \hbox{DAMAGES}. \end{description} \begin{center} END OF TERMS AND CONDITIONS \\ {\ } \\ How to Apply These Terms to Your New Programs \\ \end{center} If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. \begin{verbatim} <one line to give the program's name and a brief idea of what it does.> Copyright (C) 19yy <name of author> This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. \end{verbatim} Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: \begin{verbatim} Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. \end{verbatim} The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items --- whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: \begin{verbatim} Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. <signature of Ty Coon>, 1 April 1989 Ty Coon, President of Vice \end{verbatim} This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. } \end{document}

https://mirror.las.iastate.edu/tex-archive/graphics/pstricks/contrib/pst-uml/diagCase.tex

iastate.edu

CC-MAIN-2021-49

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2021-49/segments/1637964358443.87/warc/CC-MAIN-20211128013650-20211128043650-00313.warc.gz

% \documentclass[11pt,a4paper,twoside]{article} % \usepackage[T1]{fontenc} % \usepackage[applemac]{inputenc} % % \usepackage[latin1]{inputenc} % \usepackage{pst-uml} % \begin{document} \begin{center} % \scalebox{0.5}{%} Fonctionne egalement \resizebox{0.9\linewidth}{!}{% \begin{pspicture}(0,0.5)(15,13.5)%\psgrid \psset{framesep=0} % \psframe[linewidth=0.5pt, linestyle=dashed](3,14)(12,0.5) \rput(7.5,1){\Large Système à développer} % \rput(1,12){\rnode{acCL}{\umlActor{Client}}} \rput(1,6){\rnode{acSC}{\umlActor{Service\\Clientèle}}} \rput(14,4){\rnode{acST}{\umlActor{Service\\Technique}}} \rput(14,11.5){\rnode{acSU}{\umlActor{Superviseur}}} % % % \umlPutCase{5,13}{VISU}{\\[0mm]Visualiser\\[0mm]} \umlPutCase{5,13}{VISU}{Visualiser} \umlPutCase{5,5}{SR}{Saisir\\Risques} \umlPutCase{5,3}{SD}{Saisir\\Demandes} \umlPutCase{5,8}{RD}{Routage\\demandes} \umlPutCase{10,10}{ICB}{% Identifier\\ contraintes\\ bloquantes} \umlPutCase{10,3}{MR}{Modifie\\ Réseau } \umlPutCase{5,11}{VAD}{Vérifier\\ acceptation\\demande } \umlPutCase{10,5}{IR}{Indiquer\\risques } \umlPutCase{10,13}{PM}{Préparer\\modif .} % \ncline{acCL}{VAD} \ncline{acCL}{VISU} \ncline{acSC}{SR} \ncline{acSC}{SD} \ncline{acSC}{RD} \ncline{acSU}{ICB} \ncline{acSU}{PM} \ncline{acST}{IR} \ncline{acST}{MR} % \ncline{RD}{ICB}\naput[nrot=:U]{\umlStereoType{uses}} \ncputicon{umlHerit} \ncline{IR}{SR}\nbput[nrot=:D,npos=0.65]{\umlStereoType{uses}} \ncputicon{umlHerit} \end{pspicture} }%end resizeORscalebox \end{center} % \end{document}

http://ndes07.is.tokushima-u.ac.jp/docs/sample.tex

tokushima-u.ac.jp

CC-MAIN-2019-13

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-13/segments/1552912202589.68/warc/CC-MAIN-20190322014319-20190322040319-00373.warc.gz

\documentclass[a4paper,conference]{IEEEtran} % I use dvipdfm driver... please replace it to your driver. \usepackage[dvipdfm]{graphicx} \usepackage[dvipdfm]{color} \usepackage[colorlinks=true,dvipdfm]{hyperref} \begin{document} \title{Paper submission guidelines for the NDES2007 Workshop} \author{\authorblockN{Yoshifumi Nishio} \authorblockA{ Dept. Electrical and Electronic Eng., \\ Tokushima University \\ Email: \href{mailto:nishio@ee.tokushima-u.ac.jp} {nishio@ee.tokushima-u.ac.jp} } \and \authorblockN{Tetsushi Ueta} \authorblockA{ Center for Adv. Info. Tech. \\ Tokushima University \\ \href{mailto:tetsushi@is.tokushima-u.ac.jp} {tetsushi@is.tokushima-u.ac.jp} }} \maketitle %---------------------------- Abstract ------------------------------- \begin{abstract} This document defines the style guidelines and submission process for papers to be presented at the ``15th International Workshop on Nonlinear Dynamics of Electronic Systems 2007'' (NDES2007) held in Tokushima, Japan, July 23--26, 2007. It is written in the described style and may be considered as a reference. \end{abstract} \IEEEpeerreviewmaketitle \section{Manuscript Submission} \label{sec1} Authors are kindly invited to submit a manuscript of the (draft) paper before {\bf{April 15, 2007}}. The maximum paper length is {\bf{4 pages for both a regular oral and a poster presentation}}. Papers can only be submitted via the NDES2007 website. Please use {\bf{PDF}} files. More information about how to submit a manuscript can be found at the workshop website: \htmladdnormallink{http://ndes07.is.tokushima-u.ac.jp}% {http://ndes07.is.tokushima-u.ac.jp}. After review by an international committee of reviewers, authors of accepted papers are requested to prepare a camera-ready manuscript for the NDES proceedings. The review committee can request (slight) changes of, or additions to the manuscript. All {\bf{final camera-ready papers}} must be submitted via the website to the conference organization {\bf{not later than June 15, 2007}}. Papers will only appear in the proceedings, if at least one of the authors has pre-registered for the workshop before the early-registration deadline. The date of deadline is announced soon. Please do not send papers by e-mail or regular mail! Submissions not corresponding to the above formats will not be accepted. %----------------------- Document Structure -------------------------- \section{Content Requirements} \subsection{Abstract} The paper should start with an abstract giving a short overview on the discussed matter and the presented results. With respect to the layout the abstract is written in italic, 11pt, and it is not considered as a separate section. \subsection{References} Please list and number all references in the order of appearance at the end of your document. Use square brackets for the reference list and the citations. Please treat the references as a separate section, do not number and use 10pt for the reference entries (for an example see the references section of this document). \section{PDF} \begin{enumerate} \item Please embed all fonts in your PDF as possible as you can. \item Do not exceed 3 MByte. \item Do not make any protection for your PDF. All manuscripts are subject to be manipulated (to put page numbers, logo, etc.) \item Even this style file produces letter size DVI file by default, please convert it into A4 PDF format. Do not use US letter format since the proceedings will be printed in A4 size. By using this IEEE class file, a wide bottom margin may be left, but this is regulated by the IEEE publication policy. \item Embedding a \href{http://risa.is.tokushima-u.ac.jp/~tetsushi/abroad/kumi.avi} {multimedia content} as an external link is okay. Please make sure its existence and contents. \end{enumerate} \begin{figure}[htb] \begin{center} % % this statement is specialized for dvipdfm(x). % \includegraphics[scale=0.25]{bologna.jpg} % \end{center} \caption{an irrelevant snap shot.} \end{figure} \section{about Tokushima Univ.} The University of Tokushima was founded in 1949 as one of Japan's national universities. It consists of approximately 7800 students and 2600 staff members. For more than half a century, the university has grown and changed to meet the needs of our academic community, the professional community and the community at large. Through integration and reform, the University of Tokushima is now composed of the five faculties and schools. That is, Faculty of Integrated Arts and Science, Faculty of Engineering, and Faculty of Pharmaceutical Science, School of Medicine and School of Dentistry. Our university has six graduate schools of Human and Natural Environment Sciences, Engineering, Medical Sciences, Nutrition and Biosciences, Oral Sciences, and Pharmaceutical Sciences. The University of Tokushima also has the University Hospitals of Medicine and Dentistry and a library on each campus in Josanjima and Kuramoto. Our cooperative research centers and institutes include the Center for University Extension, Center for Advanced Information Technology, International Student Center, Institute for Enzyme Research, Institute for Genome Research, and Radioisotope Research Center. In Josanjima campus, we are making every effort to provide our students with opportunities to cultivate research and to acquire professional knowledge and skills in Faculty of Integrated Arts and Sciences, and Faculty of Engineering. In Kuramoto campus, we are also striving to foster highly educated professionals and researchers in the field of Medicine, Dentistry and Pharmaceutical Science. Our medical institutes are performing state-of-the-art medical treatment and research is being conducted which is opening doors to new frontiers. The University of Tokushima has a philosophy based on the following principles: \begin{itemize} \item Encouraging enterprising talent of the students by respecting their individuality, through provision of an education that develops humanity as well as provides outstanding professional knowledge and skills in their fields. \item Contributing to the construction of a rich and sound future society through the inheritance of knowledge and the creation of new forms of knowledge. \item Playing an active role in building a peaceful and cultured society as a center of an intellectual network connecting the local community with the world \end{itemize} %============================ References ============================== \section{Conclusions} Skipping ``Conclusions'' or ``Concluding remarks'' is not a bad idea if you have many contents for the text body. \begin{thebibliography}{1} \bibitem{x} Y. Nishio, \emph{I wanna be a dolphin,} 3rd ed. Addison-Wesley, England, 2007. \bibitem{y} T. Ueta and his friends, ``Is SoftBank a soft bank ?'' IEIEx Trans. Mobile and Surcharge. Vol. 2, No. 3, pp. 23--34, 2006. \end{thebibliography} \end{document}

https://www.zentralblatt-math.org/matheduc/en/?id=90&type=tex

zentralblatt-math.org

CC-MAIN-2019-43

text/plain

application/x-tex

crawl-data/CC-MAIN-2019-43/segments/1570986692126.27/warc/CC-MAIN-20191019063516-20191019091016-00286.warc.gz

\input zb-basic \input zb-matheduc \iteman{ZMATH 06675845} \itemau{Hannah, John} \itemti{Why does linear algebra have to be so abstract?} \itemso{Stewart, Sepideh (ed.), And the rest is just algebra. Cham: Springer (ISBN 978-3-319-45052-0/hbk; 978-3-319-45053-7/ebook). 205-217 (2017).} \itemab Summary: Research has shown that students struggle with the abstraction of linear algebra and many remedies have been tried. Here I offer another idea to add to your arsenal. Instead of presenting linear algebra as a stand-alone subject, deduced logically from a founding set of axioms, maybe we could present it as a subject that evolves naturally from students' experiences, either from prior contact with vectors in a physics course, or else from discussions and experiments designed to provoke a need to abstract, to generalize, to define and to prove. \itemrv{~} \itemcc{H60} \itemut{vector; linear independence; computer-based experiments; concreteness; generalizability; necessity; need for proof} \itemli{doi:10.1007/978-3-319-45053-7\_11} \end

http://www.hpc.is.uec.ac.jp/cgi-bin/hpcwiki/wiki.cgi?action=ATTACH&page=%C0%AE%B2%CC%CA%AA&file=20121225-matsumoto-goudou.tex

uec.ac.jp

CC-MAIN-2020-05

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2020-05/segments/1579250609478.50/warc/CC-MAIN-20200123071220-20200123100220-00425.warc.gz

\documentstyle[comment,graphicx,subfigure]{fsresume} \rinkou \date{2012年 12月 25日} % 西暦表記 \title{CAPRI: Prediction of Compaction-Adequacy \\ for Handling Control-Divergence in GPGPU Architectures} \author{Minsoo Rhu, Mattan Erez} % 紹介する論文の著者 \origin{{\it Proceedings of the 39th International Symposium on Computer Architecture (ISCA '12) pp.61-71,2012.}} % 紹介する論文の出典 \mydata{本多・近藤研究室 1253016 松本 洋平} \begin{document} \maketitle %\small %-----------以降，本文を記入----------- \vspace{10mm} \section{研究背景} \vspace*{-0.2cm} GPUは大量のSIMD型演算器を搭載する。SIMD型演算器は1命令で複数のデータに対して並列演算ができるため、 高い演算能力を持つのに加え制御回路を小さくできる利点がある。 しかし、制御系の命令を効率良く実行できないという問題がある。 従来の制御命令の実行効率を改善する方法は性能低下を起こす可能性があった。 本論文では、それを解決する手法を提案する。 \vspace*{-0.3cm} \section{GPUのスレッド実行とその問題点} \vspace*{-0.3cm} \subsection{warp実行} \vspace*{-0.3cm} GPUではwarp単位 でメモリアクセスと演算が実行される。 warpは単一命令で同じ処理を実行する32スレッドの集合である。warpを実行する時は8個または16個の演算器をグループにして演算をする。例えば16個の演算器が搭載されているGPUでwarpを実行する場合は、 1warpを2回に分けて演算を実行する (図1)。 なお、GPU上で96スレッドが生成された場合は 32スレッドごとに3つのwarpに分割される (図2以降では紙面の都合上 1warpを4スレッドで記載する)。 \begin{figure}[here] \centering \vspace*{-0.3cm} \includegraphics[width=80mm]{1.eps} \vspace*{-0.5cm} \caption{GPUでのwarp実行} \label{fig6} \end{figure} \vspace*{-0.6cm} \subsection{分岐実行における問題点} \vspace*{-0.3cm} CPUにおいて分岐命令を実行するとき、各スレッドは IF文のTHEN節とELSE節の片方のみを選択して実行する。 一方で、GPUでは 分岐命令の実行時にwarp中の各スレッドはTHEN節とELSE節の双方にそれぞれ分岐してしまう場合があるがwarp単位で同じ命令を実行するためその場合は双方のパスを実行する必要がある。その時、THENを実行したスレッドはELSE節では休んでいることになる(図2)。 これは非効率でありSIMD型アーキテクチャの構造上の欠点とされている。 \begin{figure}[here] \centering\vspace*{-0.3cm} \includegraphics[width=82mm]{2.eps} \vspace*{-0.3cm} \caption{GPUでの分岐命令実行順序} \label{fig6}\vspace*{-0.3cm} \end{figure} \newpage \section{既存手法} \vspace*{-0.2cm} 提案手法のベースとなる2つの分岐実行の効率化手法について以下に述べる。 \vspace*{-0.2cm} \subsection{Warp-wide PDOM (WPDOM) [1]} \vspace*{-0.2cm} 分岐によってはwarp中の全スレッドが THEN節とELSE節の 片方のパスのみで実行されることがある。 この場合は事前に片方のパスだけが実行されることがわかれば もう片方のパスの命令実行を回避することができる。WPDOMは warpごとにスタックを用意して分岐実行を管理する。 このスタックでは分岐の際にそれぞれのパスで実行すべきwarp中の スレッドの番号を保持している。図3の例では THEN節である命令Bで全てのスレッド`0123'が実行される。その後 ELSE節である命令Cの各スレッドを実行する順番になるが実行するスレッドがないのでスタックは`xxxx'となっている。この`xxxx'の場合は命令を発行しなければ無駄な演算の実行を回避できる。 \begin{figure}[here] \centering\vspace*{-0.4cm} \includegraphics[width=80mm]{3.eps} \vspace*{-0.5cm} \caption{WPDOMの実行例} \label{fig6}\vspace*{-0.7cm} \end{figure} \subsection{Thread Block Compaction (TBC) [2]} \vspace*{-0.2cm} TBCは同じパスを実行する別々のwarp内のスレッド同士をまとめて実行 (コンパクション)する手法である。図4の命令Bでは`0xxx'と`xx67'の2つのwarpがある。 これらをまとめて`0x67'の1つのwarpにコンパクションして実行すれば 無駄な演算が削減される。なお、TBCではコンパクションを行うために、複数ワープの実行管理を図4のCooperating Thread Array (CTA) という1つのスタックで管理する。このため、複数ワープの命令実行の進行が同期化されてしまい命令実行の並列性が失われて性能低下の原因となる場合がある。 \begin{figure}[here] \centering\vspace*{-0.3cm} \includegraphics[width=70mm]{4.eps} \vspace*{-0.4cm} \caption{TBCの実行例} \label{fig6}\vspace*{-0.4cm} \end{figure} \section{提案手法：CAPRI} TBCは実行する全てのwarpに対してスレッドコンパクションを行う。 この際、個々のスレッドに空きがなくコンパクションしてもwarp数が減らないあるいは や分岐の片方のパスだけが実行される命令間など、 スレッドコンパクションの効果がないwarp間でコンパクションを実行してしまうと メモリアクセスの不連続性や命令実行の進行が同期されwarp間の並列性が 活用できずに性能低下を引き起こす可能性がある。 例えば図5(b)の例ではTBCは使用しているCTAにより複数命令間の実行を同期化 してしまっている。これにより命令A中のあるwarpで起きたキャッシュミスが後続の 命令Bの実行を遅らせている。 上記のようなコンパクションは同じようなパターンで繰り返されることがしばしばある。 そこでCAPRIではスレッドコンパクションの効果がない分岐命令を記録することで 次回以降でその分岐命令を実行する際にその部分でのコンパクションをしないようにする。 具体的にはコンパクション前の命令中のwarp数とコンパクション後のwarp数を比較して 数が一致してしまう場合、すなわちコンパクションの効果がない場合は 次回以降のコンパクションを実行しないようテーブルに登録する。このようにすることで 例えば図5(c)のようにコンパクションの効果が得られない命令Aと命令Bのコンパクションを キャンセルすることでキャッシュミスのレイテンシを隠蔽することも可能になる。 \begin{figure}[here] \centering\vspace*{-0.3cm} \includegraphics[width=84mm]{6.eps} \caption{CAPRIの実行例} \label{fig6}\vspace*{-0.3cm} \end{figure} \section{実験手法 : GPGPU-sim[3]} GPGPU-simはTor Aamodtらによって開発されたGPUアーキテクチャを 研究するためのツールである。 本実験ではNVIDIA's Quadro FX5800をモデル化したものにWPDOM, TBC, TCB+, CAPRI(1bS), CAPRI (1bL)を 実装して各種法を評価した。 なお、TBC+は片方のパスだけ実行されるヒントをコンパイル時に挿入する手法、CAPRI(1bS)は一度コンパクションが不要と判断されるとそれ以降のコンパクションをしない手法、CAPRI (1bL)は2bitカウンターを使用してコンパクション実行の可否を決定する手法である。 また、実行するベンチーマークはParboil, Rodinia, CUDA SDK, GPGPU-simに付随のベンチマークの 中から性能検証の精度が高いものを選択する。 \section{実験結果} \subsection{IPC} 分岐のあるベンチマークではCAPRI(1bL)はWPDOMより12.6\%の性能向上、TCB+より7.2\%の性能向上が見られた。 また、CAPRI(1bS)はCAPRI(1bL)ほどの性能向上は見られなかったがWPDOM、TCB+よりも高い性能が見られた。 分岐のないベンチマークのではTBCはWPDOMに対して平均で10.1\%、TBC+ は平均で8.9\%の性能低下が見られた。一方、CAPRIはWPDOMに対して±1\%の性能が変化した。 \begin{figure}[here] \centering\vspace*{-0.3cm} \includegraphics[width=88mm]{10.eps} \caption{各手法のIPC比較結果} \label{fig6}\vspace*{-0.3cm} \end{figure} \subsection{実装オーバーヘッド} プロセッサ設計では性能と消費電力と回路面積の3つはトレードオフの関係にあり、 性能向上は達成したがその分だけ消費電力と回路面積が増えるということが多くある。 CAPRIの場合は最大で10.8\%の性能向上を達成した。また、消費電力は演算実行数が減るため削減される。 一方で8160bitのレジスタ量だけ回路面積増加 (1$mm^2$ 程度)してしまうが、これはチップ全体の1/300程度 である。よって、ほんの僅かな回路面積のオーバーヘッドで性能向上と消費電力の削減を達成した。 \section{結論} 本論文ではGPU上で分岐命令を 効率良く実行する提案した。 分岐命令がある場合は,平均で7.6\% 性能向上が見られた。 分岐命令がない場合は,±1\% 性能が変化した。また、ほんの僅かな回路面積で 提案手法が実装できることを示した。 \begin{thebibliography}{99} \bibitem{Okumura3} W.W. Fung et al. Warp Formation and Scheduling for Efficient GPU Control Flow. MICRO-40 pp.407-420 , 2007. \bibitem{Okumura3} W. W. Fung and T. M. Aamodt. Thread Block Compaction for Efficient SIMT Control Flow. HPCA-17 pp25-36 , 2011. \bibitem{Okumura3} Ali Bakhoda et al. Analyzing CUDA workloads using a detailed GPU simulator. ISPASS 2009 pp163-174 , 2009 \end{thebibliography} \end{document} \samepage

https://www.authorea.com/users/319978/articles/449629/download_latex

authorea.com

CC-MAIN-2021-39

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-39/segments/1631780057417.92/warc/CC-MAIN-20210923074537-20210923104537-00559.warc.gz

\documentclass[10pt]{article} \usepackage{fullpage} \usepackage{setspace} \usepackage{parskip} \usepackage{titlesec} \usepackage[section]{placeins} \usepackage{xcolor} \usepackage{breakcites} \usepackage{lineno} \usepackage{hyphenat} \PassOptionsToPackage{hyphens}{url} \usepackage[colorlinks = true, linkcolor = blue, urlcolor = blue, citecolor = blue, anchorcolor = blue]{hyperref} \usepackage{etoolbox} \makeatletter \patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{% \errmessage{\noexpand\@combinedblfloats could not be patched}% }% \makeatother \usepackage{natbib} \renewenvironment{abstract} {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize} {\bigskip} \titlespacing{\section}{0pt}{*3}{*1} \titlespacing{\subsection}{0pt}{*2}{*0.5} \titlespacing{\subsubsection}{0pt}{*1.5}{0pt} \usepackage{authblk} \usepackage{graphicx} \usepackage[space]{grffile} \usepackage{latexsym} \usepackage{textcomp} \usepackage{longtable} \usepackage{tabulary} \usepackage{booktabs,array,multirow} \usepackage{amsfonts,amsmath,amssymb} \providecommand\citet{\cite} \providecommand\citep{\cite} \providecommand\citealt{\cite} % You can conditionalize code for latexml or normal latex using this. \newif\iflatexml\latexmlfalse \providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}% \AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}} \usepackage[utf8]{inputenc} \usepackage[ngerman,greek,english]{babel} \usepackage{float} \begin{document} \title{Diagnosis of isolated congenital anosmia using simultaneous functional magnetic resonance imaging and olfactory event-related potentials: Our experience in six patients} \author[1]{Haemin Noh}% \author[1]{BoYoon Choi}% \author[1]{Hamin Jeong}% \author[1]{Won-Jin Moon}% \author[1]{Jin Kook Kim}% \affil[1]{Konkuk University Medical Center, Konkuk University School of Medicine}% \vspace{-1em} \date{\today} \begingroup \let\center\flushleft \let\endcenter\endflushleft \maketitle \endgroup \sloppy \textbf{Key Points} - Congenital anosmia is usually associated with Kallmann syndrome, which is characterized by hormonal abnormalities such as hypogonadotropic hypogonadism. - On very rare occasions, an isolated congenital anosmia presents as olfactory bulb agenesis without this associated syndrome. - In previous studies of such cases, diagnosis is usually based on the absence of an olfactory bulb on structural MRI, rather than on objective functional measures. - Simultaneous functional MRI and olfactory event-related potential recordings can provide highly objective evidence of olfactory function. - We examined both structural and functional MRI and olfactory event-related potential data to diagnose isolated congenital olfactory bulb agenesis, gaining objective evidence of olfactory function. \textbf{Keywords} Anosmia, Congenital, Functional magnetic resonance imaging, Olfactometry, Olfactory event-related potential \textbf{Main text} \textbf{Materials and Methods} Ethical considerations The study was approved by the ethics committee of {[}removed for blind peer review{]}, and written informed consent was obtained from patients. Patients and Endoscopic exam 6 patients who had exhibited anosmia since early childhood were included in this study (5 males, 1 females; age range 15-55 years). Patients had no history of sinusitis or chronic congestion and no other complaints, and demonstrated normal psychomotor development and appropriate Tanner classification for their age. They also had no family history of anosmia or delayed puberty. Endoscopic examination revealed no mucoid discharge or polyps, and both olfactory clefts were patent. Olfactory function test, and chemical and electro-gustatory test An olfactory function test (the Korean version of Sniffin's Stick Test, KVSS II, Burghart, Germany) was performed on all patients. A chemical and electro-gustatory test was also performed using an electro-gustometer (Gustometer; Rion, Tokyo, Japan). MRI scans MRI scans were performed in 5 patients using a 3T scanner (Signa HDxT; GE Healthcare, Milwaukee, Wisconsin) to exclude anatomical causes of olfactory loss in 5 patients. To check the olfactory bulb, T2-weighted 3D images in the coronal plane were obtained using a spin-echo sequence (field of view 150 \selectlanguage{ngerman}× 150 mm2; section thickness 0.8 mm). Simultaneous functional MRI and olfactory event-related potential (OERP) Simultaneous functional MRI and OERPs were performed in 5 patients. Simultaneous functional MRI and OERP recording can achieve high spatial and temporal resolution. Patients wore a specialized 32-channel electroencephalogram monitoring device (Professional Braincap; Easycap, Herrsching, Germany) compatible with the MRI environment. MRI was performed using the same 3T scanner as for the structural scan, using an 8-channel head coil (Figure 1). First, T1-weighted 3D images in the axial plane were obtained using a fast-spoiled gradient-recalled sequence (field of view 240 × 240 mm2; section thickness 1.3 mm). The functional imaging sequence used was gradient recalled echo-planar imaging (field of view 240 × 240 mm2; section thickness 3.5 mm). Functional MRI and OERP data were obtained during a five-minute timespan consisting of five odor exposure periods and five normal breathing periods. Odorants were presented to patients through a custom-built olfactometer with continuous air flow (4 L/min). In the exposure period, we presented odors to patients for 10 seconds followed by 20 seconds of odorless air. The periods of odor presentation were marked on the electroencephalograms. In the normal breathing periods, patients continuously received odorless air. We used two odorants: CIT (0.2 mL of 10 mmol/L citral) as a pleasant odor, and BME (0.2 mL of 1 mmol/L \selectlanguage{greek}β-\selectlanguage{english}mercaptoethanol) as an unpleasant odor. In the first five-minute session, CIT was presented via the olfactometer and the patient breathed regularly without sniffing. In the second session, BME was presented with the same protocol.\textsuperscript{1} To minimize noise, the lights were dimmed, and there was no other stimulation except the odorants. Endocrinological study An endocrinological study was performed to detect hypogonadotropic hypogonadism in 6 patients. Follicle-stimulating hormone, luteinizing hormone, and testosterone levels were checked. \textbf{Results} All patients were classified as anosmic on the olfactory function test (Figure 2). Chemical and electro-gustatory test results indicated normogeusia. MRI revealed no gross abnormalities in the brain parenchyma and a normal appearance of the pituitary gland, but the olfactory bulb could not be visualized bilaterally in 5 patients. Shallow olfactory sulci were observed in 4 patients and this suggested congenital agenesis of the olfactory bulb (Figure 3A). Relatively deep olfactory sulci were observed in 1 patient and it suggested early traumatic olfactory disorder (Figure 3B). On functional MRI, 5 male patients showed no significant activation in primary olfactory cortex in both CIT and BME session. And no OERPs were recorded during their exam (Figure 4A). The one female patient showed mild activation in CIT session, but OERPs were not recorded (Figure 4B). Follicle-stimulating hormone levels were within normal limits in 6 patients, as were luteinizing hormone levels, and testosterone levels. We therefore concluded that the patients' anosmia was not associated with other structural and hormonal abnormalities such as Kallmann syndrome. Four patients were confirmed as isolated congenital anosmia. And the olfactory sulci were relatively deep in MRI scan, so one male patient could not absolutely rule out early traumatic anosmia. One female patient seemed to be acquired anosmia. \textbf{Discussion} Olfactory disorders can be classified as conductive, sensorineural, or due to an impairment in the olfactory central nervous system. The vast majority of olfactory dysfunction occurs as a result of upper respiratory tract infection (18--45\%), sinonasal disease (7--56\%), or head trauma (8--20\%), whereas the prevalence of congenital anosmia is low (0.4\%).\textsuperscript{2} Synopsis of key findings Clinical investigation of olfactory disorders involves examination for chronic nasal obstruction, with or without associated infection, as well as the performance of olfactory functional tests. In the cases presented here, nasal endoscopic examination was unremarkable, but olfactory functional tests revealed anosmia. Chemical and electro-gustatory test results indicated normogeusia. Imaging is not routinely performed for olfactory dysfunction, as findings are negative in most cases. Imaging may be beneficial in certain inflammatory, structural, neurodegenerative, traumatic, and neoplastic conditions. MRI scans can confirm congenital agenesis of olfactory bulbs in cases such as those with Kallmann syndrome.\textsuperscript{3,4} We performed MRI scans for these 6 patients because detailed histories and physical examinations were negative. MRI results were suggestive of congenital agenesis of the olfactory bulb. Agenesis of the olfactory bulb does not necessarily mean olfactory dysfunction. A recent study revealed that human olfactory function can be normal without an olfactory bulb apparent on structural MRI.\textsuperscript{5} Therefore, objective tests for olfaction are needed. We recorded OERPs alongside the functional MRI scan to provide a highly objective assessment of olfactory function. Functional MRI can identify areas in the brain activated in response to olfactory stimulation, and OERPs can indicate residual olfactory function.\textsuperscript{6} In our study, 5 patients exhibited no activation in response to olfactory stimulation across the whole brain when family-wise error was corrected for (P = 0.05). No OERPs were observed in response to olfactory stimulation. These functional MRI findings and OERP results provide objective evidence for anosmia in these patients. Our study has clinical significance as objective olfactory tests such as these have not previously been described in patients with congenital anosmia. Agenesis of the olfactory bulb is conventionally associated with Kallmann syndrome. However, Powell recently reported that congenital anosmia is more frequently an isolated diagnosis.\textsuperscript{7} We therefore assessed the baseline levels of follicle-stimulating hormone, luteinizing hormone, and testosterone to eliminate the possibility of Kallmann syndrome, although signs of puberty were not delayed or absent in these patients. Endocrinological results were within normal limits. Clinical applicability of the study In the absence of other structural and hormonal abnormalities, patients with congenital anomalies of the olfactory bulb can be diagnosed with isolated congenital anosmia. Patients with congenital anosmia should be carefully investigated to exclude more serious conditions such as Kallmann syndrome before making this diagnosis. However, agenesis of the olfactory bulb identified on structural MRI does not necessarily mean olfactory dysfunction. Therefore, to further evaluate congenital anosmic patients, simultaneous functional MRI and OERP recording can detect activated areas in the brain and help to provide high objective evidence for the diagnosis of anosmia. \textbf{References} 1. Moon WJ, Park M, Hwang M, and Kim JK. Functional MRI as an Objective Measure of Olfaction Deficit in Patients with Traumatic Anosmia. American Journal of Neuroradiology 2018;39(12):2030-25. 2. Steven N, Annika B. Complaints of olfactory disorders: epidemiology, assessment and clinical implications. Curr Opin Allergy Clin Immunol. 2008;8(1):10-15. 3. Carswell AJ, Whinney D, Hollings N, Flanagan Philip. Isolated olfactorynerve agenesis. Br J Hosp Med. 2008;69(8):474. 4. Abolmaali ND, Hietschold V, Vogl TJ, H\selectlanguage{ngerman}üttenbrink K, Hummel T. MR evaluation in patients with isolated anosmia since birth or early childhood. AJNR. 2002;23(1):157-64. 5 Weiss T, Soroka T, Sobel N, Human Olfaction without Apparent Olfactory Bulbs., Neuron, 2020;105(1):35-45. 6. Richard L. Olfactory dysfunction and its measurement in the clinic. World J Otorhinolaryngol Head Neck Surg. 2015;1(1):28-33. 7. Powell J, Zammit-Maempel I, Carrie S. Congenital anosmia: our experience of eleven patients with aplasia or hypoplasia of the olfactory tract. Clin Otolaryngol. 2017;42(5):1038-1040. \textbf{Figure legends} Figure 1: Patients wore a specialized 32-channel electroencephalogram monitoring device compatible with the MRI environment. MRI scans were performed with a 3T scanner using an 8-channel head coil. Odorants and odorless air were presented to patients via a nasal canula. Figure 2: In all panels: control mean in blue, patients in another color and all error bars are SD. Scores at olfactory threshold(T), discrimination(D), and identification(I) using the sniffin sticks test. All patients were classified as anosmic on the olfactory function test. (Patient A: threshold 1, discrimination 6, identification 4, total 11; Patient B: threshold 1, discrimination 3, identification 4, total 8; Patient C: threshold 1, discrimination 5, identification 4, total 10; Patient D: threshold 1, discrimination 2, identification 3, total 6; Patient E: threshold 1, discrimination 4, identification 3, total 8; Patient F: threshold 1, discrimination 7, identification 4, total 12) Figure 3: T2-weighted pre-contrast coronal section MRI scans. In normal patients, an olfactory bulb (yellow arrow) and sulci (yellow arrowhead) can be found. However, in patients A and B, the olfactory bulb (red arrow, orange arrow) and olfactory sulci (red arrowhead, orange arrowhead) could not be visualized bilaterally. Figure 4: Olfactory functional MRI of a normal patient revealed bilateral activation in the orbitofrontal cortex, right uncus, and left primary olfactory cortex in the CIT (citral) session, and mild activation in the gyrus recti in the BME (\selectlanguage{greek}β-\selectlanguage{english}mercaptoethanol) session. OERPs were recorded in both session as seening that the P2 waves were visible. (A) In the first patient, no activation was observed in the primary olfactory cortex in the CIT session, but activation was seen in the left basal frontal lobe (orbitofrontal cortex), bilateral insula, left inferior frontal operculum, and the right inferior parietal lobule (uncorrected comparison, P \textless{} 0.01). In the BME session, diffuse activation was seen, possibly due to noise (uncorrected comparison, P \textless{} 0.01). No OERP was recorded. (B) In the second patient, activation was observed in the primary olfactory cortex and orbitofrontal cortex in the CIT session. In the BME session, no activation was seen. OERP was recorded in CIT session.\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Figure1/Figure1} \end{center} \end{figure}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Figure2/Figure2} \end{center} \end{figure}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Figure3/Figure3} \end{center} \end{figure}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Figure4/Figure4} \end{center} \end{figure} \selectlanguage{english} \FloatBarrier \end{document}

http://lme4.r-forge.r-project.org/lMMwR/lMMwR.tex

r-project.org

CC-MAIN-2017-47

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2017-47/segments/1510934806353.62/warc/CC-MAIN-20171121113222-20171121133222-00494.warc.gz

\documentclass[graybox,envcountchap,footinfo,natbib]{svmono} \usepackage{mathptmx,helvet,courier} \usepackage{type1cm} \usepackage{makeidx} % allows index generation \usepackage{graphicx} % standard LaTeX graphics tool % when including figure files \usepackage{multicol} % used for the two-column index \usepackage[bottom]{footmisc}% places footnotes at page bottom % see the list of further useful packages % in the Reference Guide \usepackage{amsmath,amsfonts,bm,url,Sweave,paralist} % For hyperlinks in PDF [but *not* for final / Springer]: \usepackage{hyper-lMMwR} % use "ugly boxes" around hyperlinks -- these do *NOT* print, nor show in lrgprt.pdf !! \hypersetup{colorlinks={false}} \bibliographystyle{plainnat} \input{DMBmacros} \makeindex % used for the subject index % please use the style svind.ist with % your makeindex program %% Do comment in and out different parts only here (not below): %% {keeps *.aux files, TOC, etc in a more consistent state} \includeonly{ dedication% %,foreword ,preface% %,acknow, ,acronym% ,ChIntro% ,ChMultiple% ,ChLongitudinal% ,ChCovariates% ,ChTheory% ,ChGLMMBinomial% } \DeclareMathOperator{\logit}{logit} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} \author{Douglas M. Bates} \title{lme4: Mixed-effects modeling with R} %\subtitle{-- Monograph --} \maketitle \frontmatter%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \include{dedication} %\include{foreword} \include{preface} %\include{acknow} \tableofcontents \listoffigures{} %\listoftables{} \include{acronym} \mainmatter%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \include{ChIntro} \include{ChMultiple} \include{ChLongitudinal} \include{ChCovariates} \include{ChTheory} \include{ChGLMMBinomial} \backmatter%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \bibliography{lMMwR} %\include{glossary} %\include{solutions} \printindex %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \end{document}

http://sprott.physics.wisc.edu/chaos../elhadj/About%20the%20boundness%20of%203D%20continuous%20time%20quadratic%20systems.tex

wisc.edu

CC-MAIN-2018-47

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-47/segments/1542039741569.29/warc/CC-MAIN-20181114000002-20181114022002-00421.warc.gz

\documentclass[12pt]{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{amsfonts} \usepackage{amsmath} \setcounter{MaxMatrixCols}{10} %TCIDATA{OutputFilter=LATEX.DLL} %TCIDATA{Version=4.00.0.2312} %TCIDATA{Created=Tuesday, March 17, 2009 06:32:38} %TCIDATA{LastRevised=Sunday, March 22, 2009 16:21:01} %TCIDATA{<META NAME="GraphicsSave" CONTENT="32">} %TCIDATA{<META NAME="DocumentShell" CONTENT="Standard LaTeX\Standard LaTeX Article">} %TCIDATA{CSTFile=40 LaTeX article.cst} \newtheorem{theorem}{Theorem} \newtheorem{acknowledgement}[theorem]{Acknowledgement} \newtheorem{algorithm}[theorem]{Algorithm} \newtheorem{axiom}[theorem]{Axiom} \newtheorem{case}[theorem]{Case} \newtheorem{claim}[theorem]{Claim} \newtheorem{conclusion}[theorem]{Conclusion} \newtheorem{condition}[theorem]{Condition} \newtheorem{conjecture}[theorem]{Conjecture} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{criterion}[theorem]{Criterion} \newtheorem{definition}[theorem]{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{exercise}[theorem]{Exercise} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{notation}[theorem]{Notation} \newtheorem{problem}[theorem]{Problem} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{remark}[theorem]{Remark} \newtheorem{solution}[theorem]{Solution} \newtheorem{summary}[theorem]{Summary} \newenvironment{proof}[1][Proof]{\noindent\textbf{#1.} }{\ \rule{0.5em}{0.5em}} \input{tcilatex} \begin{document} \title{About the boundedness of 3D continuous-time quadratic systems} \author{Zeraoulia Elhadj$^{1}$, J. C. Sprott$^{2}$ \\ %EndName $^{1}$Department of Mathematics, University of T\'{e}bessa, (12002), Algeria\\ E-mail: zeraoulia@mail.univ-tebessa.dz and zelhadj12@yahoo.fr\\ $^{2}$ Department of Physics, University of Wisconsin, Madison, WI 53706, USA\\ E-mail: sprott@physics.wisc.edu} \maketitle \begin{abstract} In this paper, we generalize all the existing results in the current literature for the upper bound of a general 3-D quadratic continuous-time system. In particular, we find large regions in the bifurcation parameters space of this system where it is bounded. \end{abstract} \textit{Keywords:} 3-D quadratic continuous-time system, upper bounds PACS numbers: 11.10.St, 05.45.-a, 05.45.Gg \\ Chaos in 3-D quadratic continuous-time autonomous systems was discovered in 1963 by E. Lorenz [1]. The boundedness of this system was the subject of many works. Bounded chaotic systems and the estimate of their bounds is important in chaos control, chaos synchronization, and their applications. The estimation of the upper bound of a chaotic system is quite difficult to achieve technically. In this work, we generalize all the relevant results of the literature and describe some of these bounds using multivariable function analysis. \section{Introduction} The most general 3-D quadratic continuous-time autonomous system is given by \begin{equation} \left\{ \begin{array}{c} x^{\prime }=a_{0}+a_{1}x+a_{2}y+a_{3}z+a_{4}x^{2}+a_{5}y^{2}+a_{6}z^{2}+a_{7}xy+a_{8}xz+a_{9}yz \\ y^{\prime }=b_{0}+b_{1}x+b_{2}y+b_{3}z+b_{4}x^{2}+b_{5}y^{2}+b_{6}z^{2}+b_{7}xy+b_{8}xz+b_{9}yz \\ z^{\prime }=c_{0}+c_{1}x+c_{2}y+c_{3}z+c_{4}x^{2}+c_{5}y^{2}+c_{6}z^{2}+c_{7}xy+c_{8}xz+c_{9}yz% \end{array}% \right. \end{equation}% where $\left( a_{i},b_{i},c_{i}\right) _{0\leq i\leq 9}\in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{30}$ are the bifurcation parameters. Several researchers have defined and studied quadratic 3-D chaotic systems as described in the references. The generalized Lorenz-like canonical form introduced in [6-11] gives a unique and unified classification for a large class of 3-D quadratic chaotic systems. This system contains all the well known quadratic systems given in [1-3-4-5-6]. In chaos control, chaos synchronization, and their applications, the estimation of an upper bound of the system under consideration is an important task. For example, in [23] the boundedness of the Lorenz system [1] was investigated and in [8] the boundedness of the Chen system [3] was investigated. Recently, a better upper bound for the Lorenz system for all positive values of its parameters was derived in [25], and it is the best result in the current literature because the estimation overcomes some problems related to the existence of singularities arising in the value of the upper bound given in [23]. In this paper, we generalize all these results concerning an upper bound for the general 3-D quadratic continuous-time autonomous system. In particular, we find large regions in the bifurcation parameter space of this system where it is bounded. The method is based on multivariable function analysis. \section{Estimate of the bound for the general system} To estimate the bound for the general system (1), we consider the function $V\left( x,y,z\right) $ defined by% \begin{equation} V\left( x,y,z\right) =\frac{\left( x-\alpha \right) ^{2}+\left( y-\beta \right) ^{2}+\left( z-\gamma \right) ^{2}}{2} \end{equation}% where $\left( \alpha ,\beta ,\gamma \right) \in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{3}$ is any set of real constants for which the derivative of (2) along the solutions of (1) is given by% \begin{equation} \frac{dV}{dt}=-\omega \left( x-\alpha _{1}\right) ^{2}-\varphi \left( y-\beta _{1}\right) ^{2}-\phi \left( z-\gamma _{1}\right) ^{2}+d \end{equation}% where \begin{equation} \left\{ \begin{array}{c} d=\allowbreak \omega \alpha _{1}^{2}+\varphi \beta _{1}^{2}+\phi \gamma _{1}^{2}-\beta b_{0}-\gamma c_{0}-\alpha a_{0} \\ \omega =\allowbreak \alpha a_{4}-a_{1}+\beta b_{4}+\gamma c_{4} \\ \varphi =\allowbreak \alpha a_{5}-b_{2}+\beta b_{5}+\gamma c_{5} \\ \phi =\allowbreak \alpha a_{6}-c_{3}+\beta b_{6}+\gamma c_{6} \\ \alpha _{1}=\frac{a_{0}-\alpha a_{1}-\beta b_{1}-\gamma c_{1}}{2\omega },% \text{ if }\omega \neq 0 \\ \beta _{1}=\frac{b_{0}-\alpha a_{2}-\beta b_{2}-\gamma c_{2}}{2\varphi },% \text{ if }\varphi \neq 0 \\ \gamma _{1}=\frac{c_{0}-\alpha a_{3}-\beta b_{3}-\gamma c_{3}}{2\phi },\text{ if }\phi \neq 0.% \end{array}% \right. \end{equation}% Note that if $\omega =0$ or $\varphi =0$ or $\phi =0$, then there is no need to calculate $\alpha _{1},\beta _{1}$ and $\gamma _{1}$, respectively, and a condition relating $\left( a_{i},b_{i},c_{i}\right) _{0\leq i\leq 9}\in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{30}$ to $\left( \alpha ,\beta ,\gamma \right) \in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{3}$ is obtained. If not, we have the formulas given by the last three equalities of (4). The form of the function $\frac{dV}{dt}$ in (3) is possible if the following conditions on the coefficients $\left( a_{i},b_{i},c_{i}\right) _{0\leq i\leq 9}\in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{30}$ hold:% \begin{equation} \left\{ \begin{array}{c} a_{4}=0,b_{4}=-a_{7},b_{5}=0,b_{7}=-a_{5},c_{4}=-a_{8},c_{5}=-b_{9} \\ c_{6}=0,c_{7}=-a_{9}-b_{8},c_{8}=-a_{6},c_{9}=-b_{6} \\ b_{1}=\alpha a_{7}-\beta a_{5}-a_{2}+\gamma c_{7} \\ c_{1}=-a_{3}-\gamma a_{6}+\alpha a_{8}+\beta b_{8} \\ c_{2}=\alpha a_{9}-b_{3}-\gamma b_{6}+\beta b_{9},% \end{array}% \right. \end{equation}% i.e., the system (1) becomes% \begin{equation} \left\{ \begin{array}{c} x^{\prime }=a_{0}+a_{1}x+a_{2}y+a_{3}z+a_{5}y^{2}+a_{6}z^{2}+a_{7}xy+a_{8}xz+a_{9}yz \\ y^{\prime }=b_{0}+b_{1}x+b_{2}y+b_{3}z-a_{7}x^{2}+b_{6}z^{2}-a_{5}xy+b_{8}xz+b_{9}yz \\ z^{\prime }=c_{0}+c_{1}x+c_{2}y+c_{3}z-a_{8}x^{2}-b_{9}y^{2}-\left( a_{9}+b_{8}\right) xy-a_{6}xz-b_{6}yz% \end{array}% \right. \end{equation}% with the formulas for $b_{1},c_{1}$, and $c_{2}$ given by the last three equations of (5). To prove the boundedness of system (6), we assume that it is bounded and then we find its bound, i.e., assume that $\omega, \varphi ,\phi$, and $d$ are strictly positive, i.e., \begin{equation} \left\{ \begin{array}{c} \omega \alpha _{1}^{2}+\varphi \beta _{1}^{2}+\phi \gamma _{1}^{2}-\beta b_{0}-\gamma c_{0}-\alpha a_{0}>0 \\ a_{1}<\allowbreak \alpha a_{4}+\beta b_{4}+\gamma c_{4} \\ b_{2}<\allowbreak \alpha a_{5}+\beta b_{5}+\gamma c_{5} \\ c_{3}<\allowbreak \alpha a_{6}+\beta b_{6}+\gamma c_{6}.% \end{array}% \right. \end{equation}% Then if system (6) is bounded, the function (3) has a maximum value, and the maximum point $\left( x_{0},y_{0},z_{0}\right) $ satisfies% \begin{equation} \frac{\left( x_{0}-\alpha _{1}\right) ^{2}}{\frac{d}{\omega }}+\frac{\left( y_{0}-\beta _{1}\right) ^{2}}{\frac{d}{\varphi }}+\frac{\left( z_{0}-\gamma _{1}\right) ^{2}}{\frac{d}{\phi }}=1. \end{equation}% Now consider the ellipsoid% \begin{equation} \Gamma =\left\{ \left( x,y,z\right) \in \mathbb{R}^{3}:\frac{\left( x-\alpha _{1}\right) ^{2}}{\frac{d}{\omega }}+\frac{\left( y-\beta _{1}\right) ^{2}}{% \frac{d}{\varphi }}+\frac{\left( z-\gamma _{1}\right) ^{2}}{\frac{d}{\phi }}% =1,\omega ,\varphi ,\phi ,d>0\right\}, \end{equation}% and define the function% \begin{equation} \left\{ \begin{array}{c} F\left( x,y,z\right) =G\left( x,y,z\right) +\lambda H\left( x,y,z\right) \\ G\left( x,y,z\right) =x^{2}+y^{2}+z^{2} \\ H\left( x,y,z\right) =\frac{\left( x-\alpha _{1}\right) ^{2}}{\frac{d}{% \omega }}+\frac{\left( y-\beta _{1}\right) ^{2}}{\frac{d}{\varphi }}+\frac{% \left( z-\gamma _{1}\right) ^{2}}{\frac{d}{\phi }}-1% \end{array}% \right. \end{equation}% where $\lambda \in \mathbb{R}$ is a finite parameter. Then we have $% \max_{\left( x,y,z\right) \in \Gamma }G=\max_{\left( x,y,z\right) \in \Gamma }F$ and% \begin{equation} \left\{ \begin{array}{c} \frac{\partial F\left( x,y,z\right) }{\partial x}=-2d^{-1}\left( \omega \lambda \alpha _{1}-\left( \omega \lambda +d\right) x\right) \\ \frac{\partial F\left( x,y,z\right) }{\partial y}=-2d^{-1}\left( \varphi \lambda \beta _{1}-\left( \varphi \lambda +d\right) y\right) \\ \frac{\partial F\left( x,y,z\right) }{\partial z}=-2d^{-1}\left( \phi \lambda \gamma _{1}-\left( \phi \lambda +d\right) z\right) \end{array}% \right. \end{equation}% and the following cases according to the value of the parameter $\lambda $ with respect to the values $-\frac{d}{\omega},-\frac{d}{\varphi},$ and $\lambda \neq -\frac{d}{\phi}$ if $\omega ,\varphi,\phi >0.$ Otherwise, a similar study can be done. (i) If $\lambda \neq -\frac{d}{\omega },\lambda \neq -\frac{d}{\varphi },$ and $\lambda \neq -\frac{d}{\phi },$ then \begin{equation} \left( x_{0},y_{0},z_{0}\right) =\left( \frac{\omega \lambda \alpha _{1}}{% d+\omega \lambda },\frac{\varphi \lambda \beta _{1}}{d+\varphi \lambda },% \frac{\phi \lambda \gamma _{1}}{d+\phi \lambda }\right) \end{equation}% and \begin{equation} \max_{\left( x,y,z\right) \in \Gamma }G=\xi _{1} \end{equation}% where% \begin{equation} \xi _{1}=\frac{\omega ^{2}\lambda ^{2}\alpha _{1}^{2}}{\left( d+\omega \lambda \right) ^{2}}+\frac{\varphi ^{2}\lambda ^{2}\beta _{1}^{2}}{\left( d+\varphi \lambda \right) ^{2}}+\frac{\phi ^{2}\lambda ^{2}\gamma _{1}^{2}}{% \left( d+\phi \lambda \right) ^{2}}. \end{equation}% In this case, there exists a parameterized family (in $\lambda $) of bounds given by (14) of system (6). (ii) If $\lambda =-\frac{d}{\omega },\left( \omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \varphi ,\omega \neq \phi \right), \lambda \neq -% \frac{d}{\varphi },\lambda \neq -\frac{d}{\phi },$ then \begin{equation} \left( x_{0},y_{0},z_{0}\right) =\left( \pm \sqrt{\frac{d}{\omega }\left( 1-% \frac{\xi _{2}}{\xi _{3}}\right) }+\alpha _{1},\frac{\allowbreak -\beta _{1}\varphi }{\omega -\varphi },\allowbreak \frac{-\gamma _{1}\phi }{\omega -\phi }\right) \end{equation}% where \begin{equation} \left\{ \begin{array}{c} \xi _{2}=\frac{\left( \varphi \beta _{1}^{2}+\phi \gamma _{1}^{2}\right) \left( \omega -\phi \right) ^{2}d^{3}}{\allowbreak \omega ^{2}} \\ \xi _{3}=\allowbreak \allowbreak \frac{\left( \phi -\omega \right) ^{2}\left( \omega -\varphi \right) ^{2}d^{4}}{\omega ^{4}}% \end{array}% \right. \end{equation}% with the condition \begin{equation} \xi _{3}\geq \xi _{2}. \end{equation}% This confirms that the value $x_{0}$ in (15) is well defined and the conditions $\omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \varphi$, and $\omega \neq \phi $ are formulated as follows: \begin{equation} \left\{ \begin{array}{c} a_{1}\neq \allowbreak \alpha a_{4}+\beta b_{4}+\gamma c_{4} \\ b_{2}\neq \beta b_{5}+\gamma c_{5}\allowbreak +\alpha a_{5} \\ c_{3}\neq \beta b_{6}+\gamma c_{6}\allowbreak +\alpha a_{6} \\ b_{2}-a_{1}\neq \allowbreak \left( \allowbreak a_{5}-a_{4}\right) \alpha +\left( b_{5}-b_{4}\right) \beta +\left( c_{5}-c_{4}\right) \gamma \\ c_{3}-a_{1}\neq \left( \allowbreak a_{6}-a_{4}\right) \alpha +\left( b_{6}-b_{4}\right) \beta +\left( c_{6}-c_{4}\right) \gamma.% \end{array}% \right. \end{equation}% In this case, we have \begin{equation} \max_{\left( x,y,z\right) \in \Gamma }G=\left( \sqrt{\frac{d}{\omega }\left( 1-\frac{\xi _{2}}{\xi _{3}}\right) }+\alpha _{1}\right) ^{2}+\frac{\beta _{1}^{2}\varphi ^{2}}{\allowbreak \left( \omega -\varphi \right) ^{2}}% +\allowbreak \frac{\gamma _{1}^{2}\phi ^{2}}{\allowbreak \left( \omega -\phi \right) ^{2}}. \end{equation} (iii) If $\lambda \neq -\frac{d}{\omega },\lambda =-\frac{d}{\varphi }\left( \omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \varphi ,\varphi \neq \phi \right) ,\lambda \neq -\frac{d}{\phi },$ then \begin{equation} \left( x_{0},y_{0},z_{0}\right) =\left( -\frac{\alpha _{1}\omega }{\varphi -\omega },\pm \sqrt{\frac{d}{\varphi }\left( \allowbreak \allowbreak 1-\frac{% \xi _{4}}{\allowbreak \xi _{5}}\right) }+\beta _{1},\frac{\gamma _{1}\phi }{% \allowbreak \phi -\varphi }\right) \end{equation}% where% \begin{equation} \left\{ \begin{array}{c} \xi _{4}=\left( 2\omega \varphi \phi \alpha _{1}^{2}-2\omega \varphi \phi \gamma _{1}^{2}-\omega \varphi ^{2}\alpha _{1}^{2}-\omega \phi ^{2}\alpha _{1}^{2}+\omega ^{2}\phi \gamma _{1}^{2}+\varphi ^{2}\phi \gamma _{1}^{2}\right) \allowbreak \varphi ^{2} \\ \xi _{5}=\left( \phi -\varphi \right) ^{2}\left( \varphi -\omega \right) ^{2}d\allowbreak \end{array}% \right. \end{equation}% with the condition% \begin{equation} \allowbreak \xi _{5}\geq \xi _{4}. \end{equation}% This confirms that the value $y_{0}$ in (20) is well defined and the conditions $\omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \varphi$, and $\varphi \neq \phi$ are formulated by the first four equations of (18) and \begin{equation} c_{3}-b_{2}\neq \allowbreak \left( a_{6}-a_{5}\right) \alpha +\left( b_{6}-b_{5}\right) \beta +\left( c_{6}-c_{5}\right) \gamma. \end{equation}% In this case, we \allowbreak have \begin{equation} \max_{\left( x,y,z\right) \in \Gamma }G=\left( \sqrt{\frac{d}{\varphi }% \left( \allowbreak \allowbreak 1-\frac{\xi _{4}}{\allowbreak \xi _{5}}% \right) }+\beta _{1}\right) ^{2}+\frac{\alpha _{1}^{2}\omega ^{2}}{% \allowbreak \left( \varphi -\omega \right) ^{2}}+\allowbreak \frac{\gamma _{1}^{2}\phi ^{2}}{\left( \varphi -\phi \right) ^{2}}. \end{equation} (iv) If $\lambda \neq -\frac{d}{\omega },\lambda \neq -\frac{d}{\varphi }% ,\lambda =-\frac{d}{\phi }\left( \omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \phi ,\phi \neq \varphi \right) ,$ then \begin{equation} \left( x_{0},y_{0},z_{0}\right) =\left( \frac{-\alpha _{1}\omega }{\phi -\omega },\allowbreak \frac{-\beta _{1}\varphi }{\phi -\varphi },\pm \sqrt{% \frac{d}{\phi }\left( 1-\frac{\xi _{6}}{\allowbreak \xi _{7}}\right) }% +\gamma _{1}\right) \end{equation}% where \begin{equation} \left\{ \begin{array}{c} \xi _{6}=\left( \omega \varphi ^{2}\alpha _{1}^{2}-2\omega \varphi \phi \beta _{1}^{2}-2\omega \varphi \phi \alpha _{1}^{2}+\omega \phi ^{2}\alpha _{1}^{2}+\omega ^{2}\varphi \beta _{1}^{2}+\varphi \phi ^{2}\beta _{1}^{2}\right) \allowbreak \phi ^{2} \\ \xi _{7}=\left( \phi -\varphi \right) ^{2}\left( \phi -\omega \right) ^{2}d% \end{array}% \right. \end{equation}% with the condition% \begin{equation} \allowbreak \xi _{7}\geq \xi _{6}. \end{equation}% This confirms that the value $z_{0}$ in (25) is well defined and the conditions $\omega \neq 0,\varphi \neq 0,\phi \neq 0,\omega \neq \phi$, and $\phi \neq \varphi$ are formulated by the first four equations of (18) and (23), respectively. The other possible cases are treated using the same logic. \begin{theorem} Assume that conditions (4), (5), and (7) hold. Then the general 3-D quadratic continuous-time system (1) is bounded, i.e., it is contained in the ellipsoid (9). \end{theorem} Similar results can be found using the cases discussed above. \section{Example} Consider the Lorenz system given by% \begin{equation} \left\{ \begin{array}{c} \dot{x}=a\left( y-x\right) \\ \dot{y}=cx-y-xz \\ \dot{z}=xy-bz,% \end{array}% \right. \end{equation}% i.e., $% a_{i}=0,i=0,3,4,5,6,7,8,9,a_{1}=-a,a_{2}=a,b_{i}=0,i=0,3,4,5,6,7,9,b_{1}=c,b_{2}=-1,b_{8}=-1, $ $c_{i}=0,i=0,1,2,4,5,6,8,9,c_{3}=-b,$ and $c_{7}=1.$ We choose $\alpha =\beta =0$ and $\gamma =a+c$ as in [25]. Thus $V\left( x,y,z\right) =\frac{% x^{2}+y^{2}+\left( z-\left( a+c\right) \right) ^{2}}{2}$ and $d=b\left( \frac{a+c}{2}\right) ^{2},\omega =\allowbreak a,\varphi =1,\phi =\allowbreak b,\alpha _{1}=0,\beta _{1}=0,$ and $\gamma _{1}=\frac{a+c}{2}$. Then we have $\frac{dV}{dt}=-ax^{2}-y^{2}-b\left( z-\frac{a+c}{2}\right) ^{2}+b\left( \frac{a+c}{2}\right) ^{2}$, which is the same as in [25]. Also, it is easy to verify that conditions (5) and (7) hold for this case. The ellipsoid $\Gamma $ is given by $\Gamma =\left\{ \left( x,y,z\right) \in \mathbb{R}^{3}:\frac{x^{2}}{\frac{b}{a}\left( \frac{a+c}{2}\right) ^{2}}+% \frac{y^{2}}{b\left( \frac{a+c}{2}\right) ^{2}}+\frac{\left( z-\frac{a+c}{2}% \right) ^{2}}{\left( \frac{a+c}{2}\right) ^{2}}=1,a,b,c>0\right\}$, which is also the same as in [25]. Finally, we have the result shown in [25] that confirms that if $a>0$, $b>0$, and $c>0$, then the Lorenz system [1] is contained in the sphere $\Omega =\left\{ \left( x,y,z\right) \in %TCIMACRO{\U{211d} }% %BeginExpansion \mathbb{R} %EndExpansion ^{3}\text{ / }x^{2}+y^{2}+\left( z-a-c\right) ^{2}=R^{2}\right\} ,$ where \begin{equation} R^{2}=\left\{ \begin{array}{c} \frac{\left( a+c\right) ^{2}b^{2}}{4\left( b-1\right) },\text{ if }a\geq 1,b\geq 2 \\ \left( a+c\right) ^{2},\text{ if }a>\frac{b}{2},b<2 \\ \frac{\left( a+c\right) ^{2}b^{2}}{4a\left( b-a\right) },\text{ if }% a<1,b\geq 2a.% \end{array}% \right. \end{equation} \section{Conclusion} Using multivariable function analysis, we generalize all the results about finding an upper bound for the general 3-D quadratic continuous-time autonomous system. In particular, we find large regions in the bifurcation parameters space of this system where it is bounded. \begin{thebibliography}{99} \bibitem{} E. N. Lorenz, Deterministic nonperiodic flow, J. Atoms. Sci. 20 (1963) 130--141. \bibitem{} O. E. R\"{o}ssler, An equation for continuous chaos, Phys. Lett. A 57 (1976) 397--398. \bibitem{} G. Chen, T. Ueta, Yet another chaotic attractor, Int. J. Bifur. Chaos 9 (1999) 1465--1466. \bibitem{} J. H. Lu, G. Chen, A new chaotic attractor coined, Int. J. Bifur. Chaos 12 (2002) 659--661. \bibitem{} J. H. Lu, G. Chen, D. Cheng, S. Celikovsky, Bridge the gap between the Lorenz system and the Chen system, Int. J. Bifur. Chaos 12 (2002) 2917--2926. \bibitem{} Q. Yang, G. Chen, T. Zhou, A unified Lorenz-type system and its canonical form, Int. J. Bifur. Chaos 16 (2006) 2855--2871. \bibitem{} G. Qi, G. Chen, S. Du, Analysis of a new chaotic system, Physica A 352 (2005) 295--308. \bibitem{} T. Zhou, Y. Tang, G. Chen, Complex dynamical behaviors of the chaotic Chen's system, Int. J. Bifur. Chaos 9 (2003) 2561--2574. \bibitem{} T. Zhou, G. Chen, Q. Yang, Constructing a new chaotic system based on the Sh'ilnikov criterion, Chaos, Solitons and Fractals 19 (2004) 985--993. \bibitem{} T. Zhou, G. Chen, Classification of chaos in 3-D autonomous quadratic systems-I. Basic framework and methods, Int. J. Bifur. Chaos 16 (2006) 2459--2479. \bibitem{} S. Celikovsky, G. Chen, On a generalized Lorenz canonical form of chaotic systems, Int. J. Bifur. Chaos 12 (2002), 1789--1812. \bibitem{} G. Chen, Controlling Chaos and Bifurcations in Engineering Systems, CRC Press, Boca Raton, FL (1999). \bibitem{} J. C. Sprott, Some simple chaotic flows, Phys. Rev. E 50 (1994) 647--650. \bibitem{} J. C. Sprott, Automatic generation of strange attractors, Comput. \& Graphics 17 (1993) 325--332. \bibitem{} J. C. Sprott, S. J. Linz, Algebraically simple chaotic flows, J. Chaos Theory App. 5 (2000) 3--22. \bibitem{} W. G. Hoover, Remark on Some simple chaotic flows, Phys. Rev. E 51 (1995) 759--760. \bibitem{} H. A. Posch, W. G. Hoover, F. J. Vesely, Canonical dynamics of the Nos\'{e} oscillator: Stability, order, and chaos, Phys. Rev. A 33 (6) (1986) 4253--4265. \bibitem{} J. C. Sprott, Simplest dissipative chaotic flow. Phys. Lett. A 228 (1997) 271--274. \bibitem{} S. J. Linz, J. C. Sprott, Elementary chaotic flow. Phys. Lett. A 259 (1999) 240--245. \bibitem{} Z. Elhadj, Analysis of a new chaotic system with three quadratic nonlinearities, Dynamics of Continuous, Discrete, and Impulsive Systems B 14 (2007) 603--613. \bibitem{} Z. Elhadj, Dynamical analysis of a 3-D chaotic system with only two quadratic nonlinearities, J. Systems Science and Complexity 21 (2008) 67--75. \bibitem{} W. B. Liu, G. Chen, A new chaotic system and its generation, Int. J. Bifur. Chaos 13 (2003) 261--267. \bibitem{} G. Leonov, A. Bunin, N. Koksch, Attractor localization of the Lorenz system, Zeitschrift fur Angewandte Mathematik und Mechanik 67 (1987) 649--656. \bibitem{} A. Y. Pogromsky, G. Santoboni, H. Nijmeijer, An ultimate bound on the trajectories of the Lorenz systems and its applications, Nonlinearity 16 (2003) 1597--1605. \bibitem{} D. Li, J. A. Lu, X. Wu, G. Chen, Estimating the bounds for the Lorenz family of chaotic systems, Chaos, Solitons and Fractals 23 (2005) 529--534. \end{thebibliography} \end{document}

https://dlmf.nist.gov/31.10.E23b.tex

nist.gov

CC-MAIN-2021-39

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-39/segments/1631780058415.93/warc/CC-MAIN-20210927090448-20210927120448-00618.warc.gz

$p^{2}+(\alpha+\beta-\gamma-\tfrac{1}{2})p-\tfrac{1}{4}\sigma_{2}=0,$

https://mirror.las.iastate.edu/tex-archive/macros/jptex/generic/uptex-base/samples/simple-u-utf8.tex

iastate.edu

CC-MAIN-2023-14

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2023-14/segments/1679296945289.9/warc/CC-MAIN-20230324211121-20230325001121-00088.warc.gz

\documentclass{ujarticle} \topmargin 0mm \textheight 230mm \begin{document} \section{エンコーディングのテスト} このファイルはUTF8でエンコードされています。 内部コードは \ifnum\jis"2121="3000 UTF32改(uptex)% \else ????% \fi のようです。 \typeout{このファイルはUTF-8でエンコードされています。} \section{漢数字} \kansuji 1234567890 \quad\quad 一二三四五六七八九〇 \char\kuten"104C\char\kuten"2653\char\kuten"1B10\char\kuten"1B2D\char\kuten"183E \char\kuten"2F1B\char\kuten"1C17\char\kuten"280C\char\kuten"1645\char\kuten"011B \quad\quad \char\jis"306C\char\jis"4673\char\jis"3B30\char\jis"3B4D\char\jis"385E \char\jis"4F3B\char\jis"3C37\char\jis"482C\char\jis"3665\char\jis"213B \char\euc"B0EC\char\euc"C6F3\char\euc"BBB0\char\euc"BBCD\char\euc"B8DE \char\euc"CFBB\char\euc"BCB7\char\euc"C8AC\char\euc"B6E5\char\euc"A1BB \quad\quad \char\sjis"88EA\char\sjis"93F1\char\sjis"8E4F\char\sjis"8E6C\char\sjis"8CDC \char\sjis"985A\char\sjis"8EB5\char\sjis"94AA\char\sjis"8BE3\char\sjis"815A \char\ucs"4E00\char\ucs"4E8C\char\ucs"4E09\char\ucs"56DB\char\ucs"4E94 \char\ucs"516D\char\ucs"4E03\char\ucs"516B\char\ucs"4E5D\char\ucs"3007 \kansujichar1=`壹 \kansujichar2=`弐 \kansujichar3=`參 \kansujichar4=`肆 \kansujichar5=`伍 \kansuji 12345 \section{uppercase, lowercase} abc, ABC, $E=mc^2$; 012. あいう、一二三。 \uppercase{abc, ABC, $E=mc^2$; 012. あいう、一二三。} \lowercase{abc, ABC, $E=mc^2$; 012. あいう、一二三。} \section{dvi2ttyの改行} \parindent 0mm 123456789012345678901234567890123456789012345678901234567890\\ a123456789012345678901234567890123456789012345678901234567890\\ ab123456789012345678901234567890123456789012345678901234567890\\ abc123456789012345678901234567890123456789012345678901234567890\\ αβγδεζηθικαβγδεζηθικαβγδεζηθικ\\ aαβγδεζηθικαβγδεζηθικαβγδεζηθικ\\ abαβγδεζηθικαβγδεζηθικαβγδεζηθικ\\ abcαβγδεζηθικαβγδεζηθικαβγδεζηθικ\\ 一二三四五六七八九〇一二三四五六七八九〇一二三四五六七八九〇\\ a一二三四五六七八九〇一二三四五六七八九〇一二三四五六七八九〇\\ ab一二三四五六七八九〇一二三四五六七八九〇一二三四五六七八九〇\\ abc一二三四五六七八九〇一二三四五六七八九〇一二三四五六七八九〇\\ 𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹\\ a𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹\\ ab𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹\\ abc𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹𠂉𠀋𠂢𠂤𠆢𠈓𠌫𠎁𠍱𠏹\\ \begin{flushleft} left left\\ 左左左 \end{flushleft} \begin{center} center center\\ 中中中 \end{center} \begin{flushright} right right\\ 右右右 \end{flushright} \end{document}

https://j3-fortran.org/doc/year/02/02-292.tex

j3-fortran.org

CC-MAIN-2018-26

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-26/segments/1529267859904.56/warc/CC-MAIN-20180617232711-20180618012555-00004.warc.gz

\documentclass[11pt,nocolor,memo]{j3} \renewcommand{\hdate}{11 October 2002} \renewcommand{\vers}{J3/02-292} \usepackage{lineno} \usepackage{longtable} \usepackage{xr} \externaldocument{007} \begin{document} \vspace{-10pt} \begin{tabbing} Subject: \hspace*{0.25in}\=One of the macros in {\tt j3.cls} doesn't match its description in 02-002\\ From: \>Van Snyder\\ \end{tabbing} \pagewiselinenumbers \leftlinenumbers \linenumbers* \section{The bnfx and bnfz macros} The {\tt\bs bnfx} macro is described in 02-007 to have three arguments -- The rule number (without the R), the left-hand side, and the right-namd side. Its implementation in {\tt j3.cls} only provides for the last two arguments. The {\tt bnfz} macro depends on the current behavior of {\tt bnfx}, so they both need to be repaired. Editor: Replace line 988 with {\tt\begin{verbatim} \newcommand\bnfx[3]{\@bnfindxfalse\bnf{\xsn[#1]{#2}}{is}{#3}} \end{verbatim}} Replace line 991 with {\tt\begin{verbatim} \newcommand\bnfz[2]{\@bnfindxfalse\bnfx{\hspace*{\Br}\st{#1}}{#2}} \end{verbatim}} These changes cause {\tt bnfx} to have the same behavior as specified in 02-002, and do not change the behavior of {\tt bnfz}. \label{lastpage} \end{document}

http://kleine.mat.uniroma3.it/e/98-608.tex.mpmix

uniroma3.it

CC-MAIN-2018-30

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-30/segments/1531676589557.39/warc/CC-MAIN-20180717031623-20180717051623-00277.warc.gz

Mod. Phys. Lett. B 12, 507 (1998) For more information, please send me an e-mail. e-mail adrress : yjkim@fen.bilkent.edu.tr web page : http://www.bilkent.edu.tr/~yjkim BODY \documentstyle[aps,preprint,prb]{revtex} \begin{document} \def\vk{\vec k} \def\br{{\bf r}} \title{\bf P-wave Pairing and Colossal Magnetoresistance \\ in Manganese Oxides} \author{Yong-Jihn Kim$^{\dagger}$} \address{Department of Physics, Korea Advanced Institute of Science and Technology,\\ Taejon 305-701, Korea} \maketitle \begin{abstract} We point out that the existing experimental data of most manganese oxides show the {\sl frustrated} p-wave superconducting condensation in the ferromagnetic phase in the sense that the superconducting coherence is not long enough to cover the whole system. The superconducting state is similar to the $A_{1}$ state in superfluid He-3. The sharp drop of resistivity, the steep jump of specific heat, and the gap opening in tunneling are well understood in terms of the p-wave pairing. In addition, colossal magnetoresistance (CMR) is naturally explained by the superconducting fluctuations with increasing magnetic fields. The finite resistivity may be due to some magnetic inhomogeneities. This study leads to the possibility of room temperature superconductivity. \end{abstract} \vskip 4pc \noindent PACS numbers: 74.10.+v, 74.20.-z, 75.50.Cc, 75.70.pa \vskip 2pc $^{\dagger}$ Present address : Department of Physics, Bilkent University\\ Bilkent 06533, Ankara, Turkey \vfill\eject \section*{\bf 1. Introduction} Recently, much attention has been paid to the manganese oxides since the observation of colossal magnetoresistance (CMR).$^{1-4}$ The nearly half-metallic nature of ferromagnetic phase was also reported.$^{5-8}$ In addition, the layered manganite was found.$^{9}$ These systems are strongly correlated and show antiferromagnetic-ferromagnetic transition and metal-insulator transition simultaneously. These phenomena were explained by the double exchange mechanism.$^{10-12}$ However, there is still no consensus as to the theoretical understanding because of the strong interaction between spin, charge, and lattice degrees of freedom.$^{13,14}$ In this letter, we propose a {\sl frustrated} p-wave superconducting state for the ferromagnetic phase of manganese oxides. In fact, the existing experimental data seem to manifest the p-wave superconducting condensation. In this scenario, colossal magnetoresistance (CMR) is naturally explained by the superconducting fluctuations with increasing magnetic fields. The superconducting state is similar to the well-known $A_{1}$ state which is realized in the superfluid He-3.$^{15}$ Only majority spin up electrons are paired. Because of a strong Hund coupling between the $e_{g}$ conduction electrons and $S=3/2$ core spins formed by the $t_{2g}$ electrons, the ferromagnetism appears and the conduction electrons are highly spin-polarized in the ground state. If the majority spin up electrons are paired by the currently unknown mechanism, the energy of the ground state will be even lower. Presumably, both the electron-phonon interaction and the magnetic interaction contribute significantly. The gap parameter is very anisotropic and has point nodes at the points of intersection of the Fermi surface with the spontaneous anisotropy axis. Whereas the minority spin electrons may be localized.$^{5,12}$ But depending on the doping level, there are some minority spin electrons in the extended $t_{2g}\downarrow$ band. Hence they are also paired. The resulting p-wave superconducting state will be similar to the ABM state.$^{16}$ The apparent finite resistivity may be caused by the {\sl frustrated} p-wave pairing condensation, since the domain wall structures of the ferromagnetic phase and the existence of the localized minority spin electrons limit the superconducting coherence seriously. The possible existence of the canted phase$^{12}$ and the electronic phase separation$^{17}$ will also give rise to the finite resistivity. A similar finite resistivity was found in very narrow superconducting metal wires where the superconducting condensation is also frustrated.$^{18}$ In Section 2 we critically reinvestigate the existing experimental data of resistivity, specific heat, and tunneling. Other data will be considered elsewhere. Because the superconducting behaviors are mostly screened to some extent, we need to analyze the existing data with caution. The possible p-wave superconducting states are described in Section 3. In Section 4 we discuss how to make good room temperature superconductors for practical applications. \section* {\bf 2. Reinvestigation of Experimental Data} It is amazing that the p-wave superconducting condensation in manganese oxides was unnoticed until now even though there are so many experimental manifestations of the existence of the p-wave pairing.$^{1-4,6,7,9,19-24}$ It is crucial to notice that the apparent finite resistivity is caused by some extrinsic reasons not by the intrinsic reasons. The possible causes of the nonzero resistivity are the following: \noindent (1). If the ferromagnetic phase forms the domain wall structures, the p-wave superconducting phase coherence is established in each domain and the anisotropic superconducting domains are coupled by the Josephson coupling. Then, this leads to the strong cancellation of the supercurrents as well as the finite resistivity. \noindent (2). The minority spin electrons coming from the both Mn 3d and O 2p orbitals may hinder the supercurrents and give rise to the finite resistivity. \noindent (3). The homogeneous canted phase developed by de Gennes$^{12}$ or the coexistence of ferromagnetic (FM) and antiferromagnetic (AF) microdomains$^{17}$ will certainly give rise to the finite resistivity. \noindent (4). Finally, since supercurrents in $A_{1}$-like state are very anisotropic, they may not be easily observable as in the case of the A phase of superfluid He-3.$^{15}$ \noindent More conclusive proof of the p-wave pairing in manganese oxides is the steep jump of the specific heat and the gap opening in tunneling.$^{6, 21-24}$ \subsection* {\bf 2.1 Resistivity and CMR} In this Section we consider the resistivity data.$^{19,20}$ Almost all data show the abrupt decrease of the resistivity by several orders when the temperature is decreasing from the transition temperature $T_{c}$. But it appears that the $T=0$ resistivity does not vanish and is $\sim 10 \mu\Omega cm$ for good samples. The main obstacle to the realization of the superconductivity in manganese oxides is the apparent finite resistivity. Considering the possibility of {\sl frustrated} p-wave pairing, the crucial point is not the finite value of the resistivity but the abrupt drop of the resistivity as a function of the temperature. Notice the similarity between the finite resistivity of very narrow superconducting metal wires and that of manganese oxides.$^{18}$ People think that if superconducting and normal electrons are coexisting, the resistivity will be zero because of the short-circuiting behavior of the superconducting electrons. However, in this case the superconducting coherence may be seriously limited by the domain wall structures, the effect of the minority spin electrons, and some magnetic inhomogeneities. Figures 1 (a) and (b) show the temperature dependence of the magnetization and the resistivity of a single crystal of $\rm{La_{0.65}(PbCa)_{0.35}MnO_{3}}$ (LCPMO), respectively.$^{19}$ Data are due to Liu et al..$^{19}$ The transition temperature $T_{c}$ is $300 K$. It is obvious that the ferromagnetic-to-paramagnetic transition and the metal-insulator transition occur simultaneously. The long tail of the resistivity seems to be due to the disorder caused by the co-doping of Pb and Ca. The maximum CMR was observed exactly at $T_{c}$, which indicates the close relation between superconductivity and CMR. In this type of p-wave superconducting state, $T_{c}$ is increasing for strong magnetic fields because the ferromagnetic domain size is increasing by the alignment of the $S=3/2$ core spins. Accordingly, the concomitant superconducting fluctuations lead to enhanced conductivity and CMR. Figure 1 (c) also shows the temperature dependence of the resistivity of $\rm{La_{0.72}Ca_{0.25}MnO_{z}}$ (LCMO) measured by Chahara et al..$^{20}$ It appears that these data also indicate the p-wave superconducting condensation. \subsection* {2.2 Specific Heat} The second evidence for the p-wave pairing in manganese oxides is found in the electronic specific heat measurements.$^{21,22}$ The observed steep jump of the electronic specific heat means the second order phase transition of the electronic state. But the $T^{3}$ law near $T=0$ was not confirmed clearly. The reason is certainly related with the apparent finite resistivity. It appears that the {\sl frustrated} p-wave superconducting electrons and normal electrons are coexisting. Note that the minority spin electrons and holes caused by divalent ion doping also contribute to the specific heat near $T=0$. Figure 2 (a) shows the specific heat data of $\rm{La_{0.8}Ca_{0.2}MnO_{3}}$. Data are due to Tanaka and Mitsuhashi.$^{21}$ The broken line denotes a lattice heat capacity. It is clear that the electronic transition is of second order as noted by the authors, which is consistent with ferromagnetic-metal-to-p-wave superconductor transition. Figure 2 (b) shows the electronic specific heat divided by temperature, $C/T$, for $x=0.33$ $\rm{La_{1-x}Ca_{x}MnO_{3}}$ sample.$^{22}$ Data are from Ramirez et al..$^{22}$ Again we find a steep jump of the specific heat. Since both the electronic and magnetic transitions occur at the same time, the specific heat change also includes the magnetic contribution. Note that the shape of the specific heat change should be symmetric with respect to $T_{c}$ if only the magnetic transition had occurred. \subsection* {\bf 2.3 Tunneling} The final evidence for the p-wave pairing superconducting state is provided by the tunneling data.$^{6,23,24}$ The quasiparticle density of states (DOS) for the ABM or $A_{1}$ state is parabolic at low energies. It also shows divergences as the energy is approached to the maximum gap energy $\Delta_{o}$ both from below or above. The theoretical DOS will be shown in Fig. 5 (b). Figure 3 (a) shows the normalized conductance versus the sample bias voltage for $\rm{La_{0.7}Ca_{0.3}MnO_{3}}$ (LCMO). Data are from Wei, Yeh and Vasquez.$^{23}$ They observed the density of states of an epitaxial film sample of ferromagnetic LCMO by scanning tunneling spectroscopy. It is noteworthy that this figure is very similar to the DOS of the ABM and the $A_{1}$ states. The two peaks at $\sim \pm 0.4 V$ imply that the maximum Cooper pair binding energy equals to $\sim 0.4 eV$. The energy is huge enough to give rise to the p-wave superconducting state with $T_{c}=260 K$. The pronounced peaks at $\sim \pm 1.75 V$ may be related with the exchange-split, spin-polarized peaks in the density of states calculated by Pickett and Singh.$^{5}$ In other words, these are half-metallic peaks. Figure 3 (b) shows the dynamic conductance $dI/dV$ vs bias $V$ at $T=4.2 K$ of magnetic tunnel junctions of $\rm{La_{0.67}Sr_{0.33}MnO_{3}}$. Data are due to Lu et al..$^{6}$ Notice the depletion of the DOS at the zero bias. If we disregard some background contribution, this curve seems to show the zero DOS at the Fermi level, which agrees with the DOS of the p-wave pairing state. In fact, Hudspeth et al.$^{24}$ clearly observed the depletion in the conductance of LCMO films at the Fermi level with decreasing temperature. The parabolic shape of the conductance curve is also consistent with the DOS of the ABM and the $A_{1}$ states. Since the transition temperature $T_{c}$ is $347 K$, the peaks may appear at $\sim \pm 0.53 V$ in view of Fig. 3 (a). \section* {\bf 3. Frustrated P-wave Superconducting State} Now we discuss the theoretical model for the p-wave superconducting state which may be realized in manganese oxides. Since the double exchange model and the related strong interaction between spin, charge, and lattice degrees of freedom are not solvable yet, our discussion is rather qualitative. We don't discuss the mechanism of the p-wave pairing either. Presumably, the strong electron-phonon interaction and the ferromagnetic interaction lead to the p-wave superconducting condensation in manganese oxides. Nevertheless we can explain the experimental data of the specific heat and the quasiparticle density of states (DOS) in terms of the $A_{1}$ state or the ABM state, because they are determined entirely by the topology of the zero gap. In this case even the crystal structure does not play an important role. On the other hand, if the mobile minority spin electrons exist for some doping concentrations,$^{5,7}$ the ABM state may be more appropriate. \subsection*{\bf 3.1 Frustration} The frustration may be caused by the domain wall structures of the ferromagnetic phase and the coexisting minority spin electrons. Figure 4 (a) shows the domain wall separating domains. The spins of the superconducting electrons in the left domain are pointing upward, whereas those of the electrons in the right domain are pointing downward. In the transition region, the conduction electrons may become normal because the spin directions of the core $t_{2g}$ electrons are strongly varying. The two superconducting domains are coupled by the Josephson-like coupling. Then, the supercurrents decay after passing the transition region and consequently the finite resistivity is obtained. Figure 4 (b) shows the effect of the minority spin electrons localized randomly. The spins of the Cooper pair electrons are canted by the spins of the minority electrons.$^{25}$ Then the quasiparticles near the nodes will be excited and lead to the finite resistivity. On the other hand, superconductivity is also possible in the canted phase.$^{25}$ However, the condensation energy will be much smaller than that of the ferromagnetic case and the quasiparticles are easily excited by any perturbation. Recently, Allodi et al.$^{17}$ reported the possibility of intrinsic phase separation of the holes into FM microdomains. This may also lead to the frustrations and the finite resistivity. \subsection*{\bf 3.2 $A_{1}$ State and ABM State} In the ferromagnetic phase the majority spin electrons are free to move, whereas minority spin electrons may be localized. Therefore, only majority (up) spin electrons are paired since the pairing interaction for the localized electrons will be exponentially small.$^{26,27}$ The resulting p-wave superconducting wavefunction is given, \begin{equation} {\tilde \phi}_{P} = {\prod'}_{\vec k}(u_{\vec k} + v_{\vec k} a^{\dagger}_{{\vec k}\uparrow} a^{\dagger}_{{-\vec k}\uparrow})|0>, \end{equation} where the product over $\vec k$ is restricted to a half-space and $a^{\dagger}_{{\vec k}\uparrow}$ creates a majority spin electron at the $e_{g}$ conduction band. Because of the Fermi statistics, we have \begin{equation} u_{-\vec k}=u_{\vec k}, \quad \quad v_{-\vec k}=-v_{\vec k}. \end{equation} The gap parameter for the $A_{1}$ state is given by \begin{equation} \Delta_{\vec k}^{\uparrow\uparrow} = \Delta_{o}sin\theta_{\vec k} e^{i\phi_{\vec k}}, \end{equation} where $\theta_{\vec k}$ and $\phi_{\vec k}$ are the polar and azimuthal angles of $\vec k$. Notice that the gap vanishes at two points along ${\hat k_{z}}={\hat {\bf l}}$ with ${\bf l}$ denoting the angular momentum. In the presence of the mobile minority spin electrons, the gap parameter of the ABM state is given by \begin{equation} \Delta_{\vec k}^{\uparrow\uparrow} = \Delta_{o}sin\theta_{\vec k} e^{i\phi_{\vec k}},\quad \Delta_{\vec k}^{\downarrow\downarrow} = \Delta_{o}'sin\theta_{\vec k} e^{i\phi_{\vec k}}, \end{equation} where $\Delta_{o}'$ is not always the same as $\Delta_{o}$. Since the specific heat and the density of states for the $A_{1}$ state and the ABM state show the qualitatively same behaviors, we consider those of the ABM state with $\Delta_{o}'=\Delta_{o}$. The single-particle excitation energy is given by \begin{equation} E_{\vec k}=\sqrt{\epsilon_{\vec k}^{2} + \Delta_{o}^{2}sin^{2} \theta_{\vec k}}. \end{equation} Accordingly, the specific heat is found to be \begin{eqnarray} C_{V} &\equiv& T{dS\over dT} \nonumber\\ &=& {1\over 2T^{2}}\sum_{\vec k}[E^{2}_{\vec k} - {T\over 2} {d \Delta_{\vec k}^{2} \over dT}]sech^{2}{E_{\vec k}\over 2T}, \end{eqnarray} where S denotes the entropy. In the low temperature limit, one finds \begin{equation} C_{V} = 3.5(\gamma T_{c})({T\over T_{c}})^{3}, \end{equation} where $\gamma = C_{n}/T$. $C_{n}$ is the normal specific heat. The specific heat jump for the ABM state is given by \begin{equation} {\Delta C_{V}\over C_{n}} \cong 1.19. \end{equation} (For the $A_{1}$ state the jump is 0.74.$^{15}$) The normalized single-particle density of states (DOS), $N(E)/N_{o}$, was found to be$^{16}$ \begin{equation} {N(E)\over N_{o}} = {|E|\over 2\Delta_{o}} ln\left|{E+\Delta_{o}\over E-\Delta_{o}}\right|, \end{equation} where $N_{o}$ is the normal DOS. The $N(E)$ is parabolic, that is, $N_{o}(E/\Delta_{o})^{2}$, near the Fermi energy and becomes infinite at $E=\Delta_{o}$. Figures 5 (a) and (b) show the specific heat and the normalized density of states, $N(E)/N_{o}$, for the ABM state with the transition temperature $T_{c}=100K$. Comparing with Figs. (2) and (3), the agreements between our theoretical curves and experimental data are excellent. It is reasonable to conclude that the p-wave pairing superconducting condensation is realized in manganese oxides. However, the superconducting behaviors are almost screened by domain wall structures, the existence of the localized minority spin electrons, the canted phase, and the coexistence of the FM and AF microdomains. \subsection* {\bf 3.3 $A_{1}$-like State in cubic crystalline symmetry} In manganese oxides, the Mn ions form a cubic lattice. The group theoretical classification of p-wave pairing superconducting states under cubic symmetry has been already done.$^{28-32}$ The superconducting classes with ferromagnetic properties are obtained from three dimensional representations of the cubic group. They are $D_{3}(E) $ and $D_{4}(E)$ classes from three-dimensional representations $F_{1}$ and $F_{2}$.$^{29}$ The phases $D_{3}(E)$ have zeros at the points of intersection of the Fermi surface with a three-fold axis, whereas the phases $D_{4}(E)$ have zeros at the points of intersection of the Fermi surface with a four-fold axis. $D_{3}(E)$ and $D_{4}(E)$ phases are eight-fold and six-fold degenerate, respectively. These superconducting states resemble the A phase of He-3. On the other hand, manganese oxides seems to be coverted to a rhombohedral structure with the Jahn-Teller effect.$^{33}$ The corresponding p-wave superconducting classes have also been investigated.$^{34}$ >From these states we may obtain proper $A_{1}$-like and ABM-like p-wave pairing superconducting states which may be realized in manganese oxides. More details will be reported elsewhere. \section* {\bf 4. Discussion} More studies are required to check whether the {\sl frustrated} p-wave pairing superconducting condensation is really realized in manganese oxides. When analyzing the experimental data, it is important to take into account the screening effect caused by domain wall structures, minority spin electrons, and other magnetic inhomogeneities. The magnetic properties of manganese oxides need to be reinvestigated. In particular, NMR experiments probing the spin dynamics may provide the specific information on the structure of the p-wave superconducting state. The collective modes such as sound modes and spin-wave modes may also give a clue to the existence of the p-wave pairing. The effects of magnetic fields are particularly interesting, since they give rise to CMR and metal-insulator transition in some samples.$^{35}$ The spin-polarized tunneling experiment$^{6}$ should be done up to higher bias voltages to find the gap opening. Let us discuss how we can make good room temperature superconductors. It depends on how we eliminate the frustrations and make a good single crystal with one single magnetic domain and 100 \% spin polarization near the Fermi level. It is also desirable for the minority spin electrons to have a large insulating gap which results in the complete disappearance of the minority spin DOS near the Fermi surface. In other words, we need a perfect half-metallic ferromagnet. The local spin distortions caused by any possible bound or self-trapped states of the carriers should be eliminated since they give rise to the canting of the Cooper pair spins and limit the superconducting coherence seriously. If we overcome the above problems, it is highly likely that we can make almost room temperature superconducting manganese oxides which have the zero temperature resistivity smaller than that of the good Cu samples by a factor of more than a thousand. \section* {5. Conclusion} We have proposed the {\sl frustrated} p-wave pairing superconducting state to explain CMR, the sharp drop of resistivity, the steep jump of specific heat, and the gap opening in tunneling of manganese oxides. The p-wave pairing state is similar to the $A_{1}$ state in superfluid He-3. The apparent finite resistivity may be caused by the domain wall structures of the ferromagnetic phase, the coexisting minority spin electrons, the canted phase, and the possible existence of the FM and AF microdomains. If we eliminate the above problems, the resistivity of manganese oxides will be smaller than that of good Cu samples by a factor of more than a thousand. This study opens up the possibility of room temperature superconductivity. \vspace{2pc} \centerline{\bf Acknowledgments} This work has been supported by the Brainpool project of KOSEF and the MOST. I am grateful to Dr. H. T. Kim and Profs. Jong-Jean Kim, D. Youm, K. J. Chang, B. I. Min, and K. T. Park for discussions. \begin{references} \bibitem{1} S. Jin, et al., Science {\bf 264}, 413 (1994) and references therein. \bibitem{2} Y. Tokura et al., J. Phys. Soc. Jpn {\bf 63}, 3931 (1994). \bibitem{3} H. Y. Hwang et al., Phys. Rev. Lett. {\bf 75}, 914 (1995). \bibitem{4} P. E. Schiffer et al., Phys. Rev. Lett. {\bf 75}, 336 (1995). \bibitem{5} W. E. Pickett and D. J. Singh, Phys. Rev. B {\bf 53}, 1146 (1996). \bibitem{6} Y. Lu et al., Phys. Rev. B {\bf 54}, R8357 (1996). \bibitem{7} J. Z. Sun et al., Appl. Phys. Lett. {\bf 70}, 1769 (1996). \bibitem{8} J.-H. Park et al., to appear in Nature. \bibitem{9} T. Kimura et al., Science, {\bf 274}, 1698 (1996). \bibitem{10} C. Zener, Phys. Rev. {\bf 82}, 403 (1951). \bibitem{11} P. W. Anderson and H. Hasegawa, Phys. Rev. {\bf 100}, 675 (1955). \bibitem{12} P. G. de Gennes, Phys. Rev. {\bf 100}, 564 (1955). \bibitem{13} A. J. Millis, P. B. Littlewood, and B. I. Shraiman, Phys. Rev. Lett. {\bf 74}, 5144 (1995). \bibitem{14} A. R. Bishop and H. R\"oder, preprint, cond-mat/9703148. \bibitem{15} See, for example, D. Vollhardt and P. W\"ofle, {\sl The Superfluid Phases of Helium 3} (Taylor and Francis, London, 1990). \bibitem{16} P. W. Anderson and P. Morel, Phys. Rev. {\bf 123}, 1911 (1961); P. W. Anderson and W. F. Brinkman, Phys. Rev. Lett. {\bf 30}, 1108 (1973). \bibitem{17} G. Allodi et al, Phys. Rev. B {\bf 56}, 6036 (1997). \bibitem{18} N. Giordano, Physica B {\bf 203}, 460 (1994). \bibitem{19} J. Z. Liu et al., Appl. Phys. Lett. {\bf 66}, 3218 (1995). \bibitem{20} K.-I. Chahara et al., Appl. Phys. Lett. {\bf 63}, 1990 (1993). \bibitem{21} J. Tanaka and T. Mitsuhasi, J. Phys. Soc. Jpn, {\bf 53}, 24 (1984). \bibitem{22} A. P. Ramirez et al., Phys. Rev. Lett. {\bf 76}, 3188 (1996). \bibitem{23} J. Y. T. Wei, N.-C. Yeh, and R. P. Vasquez, Phys. Rev. Lett. {\bf 79}, 5150 (1997). \bibitem{24} H. D. Hudspeth et al., Bull. Am. Phys. Soc. {\bf 43}, 31 (1998). \bibitem{25} Yong-Jihn Kim and A. W. Overhauser, Phys. Rev. B {\bf 49}, 15799 (1994). \bibitem{26} Yong-Jihn Kim and A. W. Overhauser, Phys. Rev. B {\bf 47}, 8025 (1994). \bibitem{27} Yong-Jihn Kim, Mod. Phys. Lett. B {\bf 10}, 555 (1996). \bibitem{28} P. W. Anderson, Phys. Rev. B {\bf 30}, 4000 (1984). \bibitem{29} G. E. Volovik and L. P. Gor'kov, Sov. Phys. JETP {\bf 61}, 843 (1985). \bibitem{30} K. Ueda and T. M. Rice, Phys. Rev. B {\bf 31}, 7114 (1985). \bibitem{31} E. I. Blount, Phys. Rev. B {\bf 32}, 2985 (1985). \bibitem{32} M. Ozaki, K. Machida, and T. Ohmi, Prog. Theo. Phys. {\bf 74}, 221 (1985). \bibitem{33} A. Asamitsu et al., Phys. Rev. B {\bf 54}, 1716 (1996). \bibitem{34} M. Sigrist, R. Joynt, and T. M. Rice, Phys. Rev. B {\bf 36}, 5186 (1987). \bibitem{35} Y. Tomioka et al., Physica B {\bf 237-238}, 6 (1997). \end{references} \begin{figure} \caption{(a) The temperature dependence of the magnetization of a single crystal of LPCMO, taken from Liu et al. (Ref. 19). The Curie temperature $T_{c}$ is $300 K$. (b) The resistivity vs temperature in zero field and in a 5.5-T field, taken from Liu et al. (Ref. 19). (c) The temperature dependence of the resistivity at zero field, taken from Chahara et al. (Ref. 20).} \end{figure} \begin{figure} \caption{ (a) The temperature dependence of specific heat of monoclinic $\rm{La_{0.8}Ca_{0.2}MnO_{3}}$. (After Tanaka and Mitsuhasi Ref. 21.) The broken line denotes a lattice specific heat calculated by a Debye model. (b) specific heat divided by temperature, C/T for $x=0.33$ $\rm{La_{1-x} Ca_{x}MnO_{3}}$ with lattice contribution subtracted. (After Ramirez et al. Ref. 22.)} \end{figure} \begin{figure} \caption{ (a) STM spectroscopy data at 77K, plotted as the normalized conductance $(dI/dV)/(\overline{I/V})$ vs the bias voltage V, taken from Wei et al. (Ref. 23). (b) dynamic conductance $dI/dV$ vs bias V at $T=4.2 K$ of a magnetic tunnel junction, taken from Lu et al. (Ref. 6).} \end{figure} \begin{figure} \caption{ (a) The triplet Cooper-pairs in the domain wall structures of the ferromagnetic phase. (b) a Cooper pair in the presence of the minority spin electrons localized randomly.} \end{figure} \begin{figure} \caption{ (a) Specific heat vs temperature for the ABM state. The transition temperature $T_{c}$ is 100K. (b) the density of states vs energy divided by the maximum gap parameter, $E/\Delta_{o}$, for the ABM state.} \end{figure} \end{document} ENDBODY

http://voodoo-circle.sourceforge.net/doc_for_developers/latex/c__micro__symbol__variable__mapping_8cpp_source.tex

sourceforge.net

CC-MAIN-2018-05

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-05/segments/1516084892059.90/warc/CC-MAIN-20180123171440-20180123191440-00128.warc.gz

\hypertarget{c__micro__symbol__variable__mapping_8cpp}{ \section{c\_\-micro\_\-symbol\_\-variable\_\-mapping.cpp} \label{c__micro__symbol__variable__mapping_8cpp}\index{c\_\-micro\_\-symbol\_\-variable\_\-mapping.cpp@{c\_\-micro\_\-symbol\_\-variable\_\-mapping.cpp}} } \begin{DoxyCode} 00001 \textcolor{comment}{/***************************************************************************} 00002 \textcolor{comment}{ c\_micro\_symbol\_variable\_mapping.cpp - description} 00003 \textcolor{comment}{ -------------------} 00004 \textcolor{comment}{ begin : Thu May 10 2007} 00005 \textcolor{comment}{ copyright : (C) 2004-2010 Marian VooDooMan Meravy} 00006 \textcolor{comment}{ email : ghostvoodooman -a.T= users (dot) sourceforge.net} 00007 \textcolor{comment}{ ***************************************************************************/} 00008 00009 \textcolor{comment}{/***************************************************************************} 00010 \textcolor{comment}{} 00011 \textcolor{comment}{VooDoo cIRCle - an IRC (ro)bot} 00012 \textcolor{comment}{Copyright (C) 2004-2010 Marian VooDooMan Meravy} 00013 \textcolor{comment}{ (ghostvoodooman -a.T= users (dot) sourceforge.net)} 00014 \textcolor{comment}{} 00015 \textcolor{comment}{This program is free software; you can redistribute it and/or} 00016 \textcolor{comment}{modify it under the terms of the GNU General Public License} 00017 \textcolor{comment}{as published by the Free Software Foundation; either version 2} 00018 \textcolor{comment}{of the License, or (at your option) any later version.} 00019 \textcolor{comment}{} 00020 \textcolor{comment}{This program is distributed in the hope that it will be useful,} 00021 \textcolor{comment}{but WITHOUT ANY WARRANTY; without even the implied warranty of} 00022 \textcolor{comment}{MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the} 00023 \textcolor{comment}{GNU General Public License for more details.} 00024 \textcolor{comment}{} 00025 \textcolor{comment}{You should have received a copy of the GNU General Public License} 00026 \textcolor{comment}{along with this program; if not, write to the Free Software} 00027 \textcolor{comment}{Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.} 00028 \textcolor{comment}{} 00029 \textcolor{comment}{****************************************************************************/} 00030 \textcolor{comment}{} 00031 \textcolor{comment}{/*!} 00032 \textcolor{comment}{ \(\backslash\)file} 00033 \textcolor{comment}{ \(\backslash\)brief Class 'c\_micro\_symbol\_variable\_mapping'} 00034 \textcolor{comment}{*/} 00035 00036 \textcolor{preprocessor}{#if defined(HAVE\_CONFIG\_H)} 00037 \textcolor{preprocessor}{}\textcolor{preprocessor}{# include <config.h>} 00038 \textcolor{preprocessor}{#endif} 00039 \textcolor{preprocessor}{} 00040 \textcolor{preprocessor}{#include "../params.h"} 00041 \textcolor{preprocessor}{#include "../utils/memleak.h"} 00042 \textcolor{preprocessor}{#include "../utils/my\_assert.h"} 00043 \textcolor{preprocessor}{#include "../compat.h"} 00044 00045 \textcolor{preprocessor}{#include "\hyperlink{c__micro_8h}{c_micro.h}"} 00046 \textcolor{preprocessor}{#include "\hyperlink{c__micro__symbol__variable__mapping_8h}{c_micro_symbol_variable_mapping.h}"} 00047 \textcolor{preprocessor}{#include "../func/c\_expression.h"} 00048 \textcolor{preprocessor}{#include "\hyperlink{c__micro__str__eval_8h}{c_micro_str_eval.h}"} 00049 \textcolor{preprocessor}{#include "\hyperlink{c__micro__commit__vars_8h}{c_micro_commit_vars.h}"} 00050 \textcolor{preprocessor}{#include "../script\_consts/script\_consts.h"} 00051 00052 \textcolor{preprocessor}{#include "../utils/precomp.h"} 00053 00054 \textcolor{preprocessor}{#if defined(\_MSC\_VER) || defined(\_\_BORLANDC\_\_)} 00055 \textcolor{preprocessor}{}\textcolor{preprocessor}{# pragma hdrstop} 00056 \textcolor{preprocessor}{}\textcolor{preprocessor}{#endif} 00057 \textcolor{preprocessor}{} \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00058}{}\hyperlink{classc__micro__symbol__variable__mapping_abab15e63b5284af5bb0ece9fea7350bd_abab15e63b5284af5bb0ece9fea7350bd}{00058} \textcolor{keywordtype}{void} \hyperlink{classc__micro__symbol__variable__mapping_abab15e63b5284af5bb0ece9fea7350bd_abab15e63b5284af5bb0ece9fea7350bd}{c_micro_symbol_variable_mapping::reset}() 00059 \{ 00060 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.clear(); 00061 \hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.clear(); 00062 \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}=1; 00063 \} 00064 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00065}{}\hyperlink{classc__micro__symbol__variable__mapping_a4ca61cb00c9ca59d663918386ddcc465_a4ca61cb00c9ca59d663918386ddcc465}{00065} \textcolor{keywordtype}{string} \hyperlink{classc__micro__symbol__variable__mapping_a4ca61cb00c9ca59d663918386ddcc465_a4ca61cb00c9ca59d663918386ddcc465}{c_micro_symbol_variable_mapping::get_var_name}(\hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{match_8cpp_a2a64c7542c5c324fd09cd3f89497d0d9_a2a64c7542c5c324fd09cd3f89497d0d9}{index}) 00066 \{ 00067 \textcolor{keywordflow}{if}(index<=0 || index>=\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}) 00068 \textcolor{keywordflow}{return} (\textcolor{keywordtype}{string})\textcolor{stringliteral}{"<index\_out\_of\_range>"}; 00069 map<var\_sym\_index\_t, string>::iterator i1=\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.find(index); 00070 \textcolor{keywordflow}{if}(\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.end()==i1) 00071 \textcolor{keywordflow}{return} (\textcolor{keywordtype}{string})\textcolor{stringliteral}{"<non-existing\_index>"}; 00072 \textcolor{keywordflow}{if}((*i1).second.empty()) 00073 \textcolor{keywordflow}{return} (\textcolor{keywordtype}{string})\textcolor{stringliteral}{"<temporary\_variable>"}; 00074 \textcolor{keywordflow}{return} (*i1).second; 00075 \} 00076 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00077}{}\hyperlink{classc__micro__symbol__variable__mapping_a4d57a72ed23138a823eb725150368332_a4d57a72ed23138a823eb725150368332}{00077} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__symbol__variable__mapping_a4d57a72ed23138a823eb725150368332_a4d57a72ed23138a823eb725150368332}{c_micro_symbol_variable_mapping::get_var_index}(\textcolor{keyword}{const} \textcolor{keywordtype}{string}& var\_ name) 00078 \{ 00079 \textcolor{keywordflow}{if}(var\_name.empty() || \textcolor{charliteral}{'$'}!=var\_name[0]) 00080 \textcolor{keywordflow}{return} \hyperlink{microcode__shared_8h_ae502510fc6bfe8b50c7bab346618b63c_ae502510fc6bfe8b50c7bab346618b63c}{VAR_SYM_INDEX_INVALID}; 00081 map<var\_sym\_index\_t, string>::iterator i1; 00082 \textcolor{keywordflow}{for}(i1=\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.begin(); i1!=\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.end(); ++i1) 00083 \textcolor{keywordflow}{if}(!(*i1).second.compare(var\_name)) 00084 \textcolor{keywordflow}{return} (*i1).first; 00085 \textcolor{keywordflow}{return} \hyperlink{microcode__shared_8h_ae502510fc6bfe8b50c7bab346618b63c_ae502510fc6bfe8b50c7bab346618b63c}{VAR_SYM_INDEX_INVALID}; 00086 \} 00087 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00088}{}\hyperlink{classc__micro__symbol__variable__mapping_a75ca95a4a9b2ea196c484498f86a5d84_a75ca95a4a9b2ea196c484498f86a5d84}{00088} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__symbol__variable__mapping_a75ca95a4a9b2ea196c484498f86a5d84_a75ca95a4a9b2ea196c484498f86a5d84}{c_micro_symbol_variable_mapping::get_capacity}() 00089 \{ 00090 \textcolor{keywordflow}{return} \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}-1+1; 00091 \} 00092 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00093}{}\hyperlink{classc__micro__symbol__variable__mapping_a4d02f8fc244315554c07796bd0f91cc2_a4d02f8fc244315554c07796bd0f91cc2}{00093} \textcolor{keyword}{const} map<var\_sym\_index\_t, string>& \hyperlink{classc__micro__symbol__variable__mapping_a4d02f8fc244315554c07796bd0f91cc2_a4d02f8fc244315554c07796bd0f91cc2}{c_micro_symbol_variable_mapping::get_var_mapping}() 00094 \{ 00095 \textcolor{keywordflow}{return} \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}; 00096 \} 00097 \textcolor{comment}{} 00098 \textcolor{comment}{/*!} 00099 \textcolor{comment}{ \(\backslash\)brief Adds new mapping (if it does not exist yet)} 00100 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00101 \textcolor{comment}{ \(\backslash\)version 4} 00102 \textcolor{comment}{ \(\backslash\)date 2006-03-16, 2006-04-28, 2007-09-11, 2007-09-29} 00103 \textcolor{comment}{ \(\backslash\)param var\_name Variable name} 00104 \textcolor{comment}{ \(\backslash\)param exp Expression used for 'add\_micro()' method if there is evaluation ne eded} 00105 \textcolor{comment}{ \(\backslash\)return Returns new index; or existing one, if it already exists} 00106 \textcolor{comment}{ \(\backslash\)warning If an error occurs it will call argumet "exp"'s 'clear\_microcode()', 'clear\_compile\_stack()' and 'clean\_up()' methods, and throw an exception} 00107 \textcolor{comment}{ \(\backslash\)warning If string evaluation needs to be evaluated first (e.g. $foo="abc $ba r def") it will add microcode class 'c\_micro\_str\_eval' for evaluation of this kin d of string into 'exp' argument} 00108 \textcolor{comment}{ \(\backslash\)warning Argument 'var\_name' must not be declared as 'const string&' but just 'string' because we do clean up before potential exception is thrown} 00109 \textcolor{comment}{*/} \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00110}{}\hyperlink{classc__micro__symbol__variable__mapping_a1cc86b608c1babf7d63eb21c510921a7_a1cc86b608c1babf7d63eb21c510921a7}{00110} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{c_micro_symbol_variable_mapping::add}(\textcolor{keywordtype}{string} var\_name, \hyperlink{classc__expression}{c_expression}* exp) 00111 \{ 00112 \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{match_8cpp_a2a64c7542c5c324fd09cd3f89497d0d9_a2a64c7542c5c324fd09cd3f89497d0d9}{index}=VAR\_SYM\_INDEX\_INVALID; 00113 00114 \textcolor{keywordflow}{if}(var\_name.empty()) \{ 00115 \hyperlink{my__assert_8h_abfb8681a66d7e4c5be15138f162a21b8_abfb8681a66d7e4c5be15138f162a21b8}{MY_ASSERT_NOTREACH}(); 00116 \textcolor{keywordflow}{return} \hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{add}(); 00117 \} 00118 00119 \textcolor{keyword}{static} \textcolor{keyword}{const} \textcolor{keywordtype}{string} d=\textcolor{stringliteral}{"Invalid string passed to compiler of microcode"}; 00120 00121 \textcolor{keywordflow}{if}(var\_name.length()==1) \{ 00122 \textcolor{keywordflow}{if}(\textcolor{charliteral}{'$'}==var\_name[0] || \textcolor{charliteral}{'"'}==var\_name[1]) 00123 \textcolor{keywordflow}{throw} \hyperlink{classc__var__exception}{c_var_exception}(NULL,\hyperlink{compat_8h_a2f6bd616afd004b1ce994c2ba2ac9937_a2f6bd616afd004b1ce994c2ba2ac9937}{__FILE__},\hyperlink{compat_8h_a2441fbd90efb68432ab5d56b9b67aad0_a2441fbd90efb68432ab5d56b9b67aad0}{__my_func__}, \hyperlink{classc__var__exception_abe66889c3c2341b03e1b0b76facfba62_abe66889c3c2341b03e1b0b76facfba62a205ec75a6130bd9cfdcd735501b18b9e}{c_var_exception::E_USER_ERROR},d,\hyperlink{variable_8h_aa0960745aadfe71ce6c329f40b2ecb9c_aa0960745aadfe71ce6c329f40b2ecb9caba8af325bb265c92cbafa3464bf99f90}{VARTYPE_STRING}); 00124 \} 00125 00126 \textcolor{keywordtype}{bool} built\_in\_const=\hyperlink{script__consts_8cpp_a1927fc3041a42339155bf97d8eb5be69_a1927fc3041a42339155bf97d8eb5be69}{script_function_translate_constant}(var\_name); 00127 00128 \textcolor{keywordflow}{if}((var\_name[0]>=\textcolor{charliteral}{'0'} && var\_name[0]<=\textcolor{charliteral}{'9'})) 00129 built\_in\_const=\textcolor{keyword}{true}; 00130 \textcolor{keywordflow}{if}(var\_name.length()>1 && (\textcolor{charliteral}{'-'}==var\_name[0] || \textcolor{charliteral}{'+'}==var\_name[0])) \{ 00131 \textcolor{keywordflow}{if}(var\_name[1]>=\textcolor{charliteral}{'0'} && var\_name[1]<=\textcolor{charliteral}{'9'}) 00132 built\_in\_const=\textcolor{keyword}{true}; 00133 \} 00134 00135 \textcolor{keywordtype}{bool} simple=\textcolor{keyword}{true}; 00136 00137 \textcolor{keywordflow}{if}(!built\_in\_const) \{ 00138 \textcolor{keywordflow}{if}(\textcolor{charliteral}{'\(\backslash\)''}!=var\_name[0] && var\_name[var\_name.length()-1]!=\textcolor{charliteral}{'\(\backslash\)''}) \{ 00139 \textcolor{keywordflow}{if}(var\_name.length()<2 00140 || (var\_name[0]!=\textcolor{charliteral}{'$'} && var\_name[0]!=\textcolor{charliteral}{'"'}) 00141 || (\textcolor{charliteral}{'"'}==var\_name[0] && var\_name[var\_name.length()-1]!=\textcolor{charliteral}{'"'})) \{ 00142 exp->\hyperlink{classc__expression_aec3dc08d9ae1c2f728d2866a358d4c5c_aec3dc08d9ae1c2f728d2866a358d4c5c}{clear_microcode}(); 00143 \textcolor{comment}{//exp->clear\_compile\_stack(st);} 00144 exp->\hyperlink{classc__expression_a1a081ad2052ac9f049e8a70076f38a52_a1a081ad2052ac9f049e8a70076f38a52}{clean_up}(); 00145 00146 \textcolor{keywordflow}{throw} \hyperlink{classc__var__exception}{c_var_exception}(NULL,\hyperlink{compat_8h_a2f6bd616afd004b1ce994c2ba2ac9937_a2f6bd616afd004b1ce994c2ba2ac9937}{__FILE__},\hyperlink{compat_8h_a2441fbd90efb68432ab5d56b9b67aad0_a2441fbd90efb68432ab5d56b9b67aad0}{__my_func__}, \hyperlink{classc__var__exception_abe66889c3c2341b03e1b0b76facfba62_abe66889c3c2341b03e1b0b76facfba62a205ec75a6130bd9cfdcd735501b18b9e}{c_var_exception::E_USER_ERROR},d,\hyperlink{variable_8h_aa0960745aadfe71ce6c329f40b2ecb9c_aa0960745aadfe71ce6c329f40b2ecb9caba8af325bb265c92cbafa3464bf99f90}{VARTYPE_STRING}); 00147 \} 00148 \} 00149 \} 00150 \textcolor{keywordflow}{for}(\textcolor{keywordtype}{size\_t} i1=0; i1<var\_name.length(); ++i1) \{ 00151 \textcolor{keywordflow}{if}(\textcolor{charliteral}{'\(\backslash\)\(\backslash\)'}==var\_name[i1]) \{ 00152 \textcolor{comment}{// skip next char} 00153 i1++; 00154 \textcolor{keywordflow}{continue}; 00155 \} 00156 \textcolor{keywordflow}{if}(\textcolor{charliteral}{'$'}==var\_name[i1]) \{ 00157 simple=\textcolor{keyword}{false}; 00158 \textcolor{keywordflow}{break}; 00159 \} 00160 \} 00161 \textcolor{keywordflow}{if}(simple) \{ 00162 index=\hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{add}(var\_name); 00163 \textcolor{keywordflow}{return} index; 00164 \} 00165 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.insert(make\_pair(\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index},var\_name)); 00166 00167 \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} out=\hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{add}(); 00168 00169 \hyperlink{classc__micro__commit__vars}{c_micro_commit_vars}* m1=\hyperlink{memory_2memleak_8h_a41d2a3408e06a84336c0bb118f4286de_a41d2a3408e06a84336c0bb118f4286de}{MY_NEW} \hyperlink{classc__micro__commit__vars}{c_micro_commit_vars}(); \textcolor{comment}{// TODO: optimize} 00170 exp->\hyperlink{classc__expression_abd822179e792fd91a9638b91411b5c89_abd822179e792fd91a9638b91411b5c89}{add_micro}(m1); 00171 00172 \hyperlink{classc__micro__str__eval}{c_micro_str_eval}* m2=\hyperlink{memory_2memleak_8h_a41d2a3408e06a84336c0bb118f4286de_a41d2a3408e06a84336c0bb118f4286de}{MY_NEW} \hyperlink{classc__micro__str__eval}{c_micro_str_eval}(var\_name,out); 00173 exp->\hyperlink{classc__expression_abd822179e792fd91a9638b91411b5c89_abd822179e792fd91a9638b91411b5c89}{add_micro}(m2); 00174 00175 \textcolor{keywordflow}{return} out; 00176 \} 00177 \textcolor{comment}{} 00178 \textcolor{comment}{/*!} 00179 \textcolor{comment}{ \(\backslash\)brief Adds new mapping (new temporary symbol)} 00180 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00181 \textcolor{comment}{ \(\backslash\)version 3} 00182 \textcolor{comment}{ \(\backslash\)date 2006-03-31, 2006-04-28, 2007-09-11} 00183 \textcolor{comment}{ \(\backslash\)return Returns new index} 00184 \textcolor{comment}{*/} \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00185}{}\hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{00185} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{c_micro_symbol_variable_mapping::add}() 00186 \{ 00187 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.insert(make\_pair(\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index},(\textcolor{keywordtype}{string})\textcolor{stringliteral}{""})); 00188 \textcolor{keywordflow}{return} \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}++; 00189 \} 00190 \textcolor{comment}{} 00191 \textcolor{comment}{/*!} 00192 \textcolor{comment}{ \(\backslash\)brief Adds new mapping (if it does not exist yet)} 00193 \textcolor{comment}{ \(\backslash\)author VooDooMan} 00194 \textcolor{comment}{ \(\backslash\)version 3} 00195 \textcolor{comment}{ \(\backslash\)date 2006-03-16, 2006-04-28, 2008-02-26} 00196 \textcolor{comment}{ \(\backslash\)param var\_name Variable name} 00197 \textcolor{comment}{ \(\backslash\)return Returns new index; or existing one, if it already exists} 00198 \textcolor{comment}{ \(\backslash\)warning Use this \_only\_ for variables ('var\_name' argument) that begins with '$', in other case use other overload of this method} 00199 \textcolor{comment}{*/} \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00200}{}\hyperlink{classc__micro__symbol__variable__mapping_abd309c2a009785c87d87639380a79af6_abd309c2a009785c87d87639380a79af6}{00200} \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{classc__micro__symbol__variable__mapping_a6208212a95e668e0dbf852435f8372ba_a6208212a95e668e0dbf852435f8372ba}{c_micro_symbol_variable_mapping::add}(\textcolor{keyword}{const} \textcolor{keywordtype}{string}& var\_name) 00201 \{ 00202 \hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} \hyperlink{match_8cpp_a2a64c7542c5c324fd09cd3f89497d0d9_a2a64c7542c5c324fd09cd3f89497d0d9}{index}=VAR\_SYM\_INDEX\_INVALID; 00203 index=\hyperlink{classc__micro__symbol__variable__mapping_a4d57a72ed23138a823eb725150368332_a4d57a72ed23138a823eb725150368332}{get_var_index}(var\_name); 00204 \textcolor{keywordflow}{if}(\hyperlink{microcode__shared_8h_ae502510fc6bfe8b50c7bab346618b63c_ae502510fc6bfe8b50c7bab346618b63c}{VAR_SYM_INDEX_INVALID}!=index) 00205 \textcolor{keywordflow}{return} index; 00206 \textcolor{keywordflow}{if}(var\_name.length() && var\_name[0]!=\textcolor{charliteral}{'$'}) \{ 00207 auto\_ptr<c\_var\_array> tmp\_vars(\hyperlink{memory_2memleak_8h_a41d2a3408e06a84336c0bb118f4286de_a41d2a3408e06a84336c0bb118f4286de}{MY_NEW} \hyperlink{classc__var__array}{c_var_array}); 00208 \textcolor{keywordtype}{bool} ref=\textcolor{keyword}{true}; 00209 \hyperlink{classc__var__base}{c_var_base}* data=\hyperlink{variable_8cpp_a086457332f9f4b62ab68f2d21d4ac0aa_a086457332f9f4b62ab68f2d21d4ac0aa}{var_eval_obj}(NULL,var\_name,tmp\_vars.get(),var\_name,ref); 00210 data->\hyperlink{classc__var__base_acca32cb3d26557ec9f44f82d82396d31_acca32cb3d26557ec9f44f82d82396d31}{set_persistent}(); 00211 data->\hyperlink{classc__var__base_ab47ebc88c0c3aca08d9c647da23000c5_ab47ebc88c0c3aca08d9c647da23000c5}{set_read_only}(); 00212 \hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.insert(make\_pair(\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index},data)); 00213 \} 00214 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}.insert(make\_pair(\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}++,var\_name)); 00215 \textcolor{keywordflow}{return} \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}-1; 00216 \} 00217 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00218}{}\hyperlink{classc__micro__symbol__variable__mapping_a6e32f6a9f6040344d3cf0f08707510a6_a6e32f6a9f6040344d3cf0f08707510a6}{00218} \hyperlink{classc__micro__symbol__variable__mapping_acc8b4e39344f02f1c6e79be3d4505450_acc8b4e39344f02f1c6e79be3d4505450}{c_micro_symbol_variable_mapping::c_micro_symbol_variable_mapping}(\textcolor{keyword}{const} \hyperlink{classc__micro__symbol__variable__mapping}{c_micro_symbol_variable_mapping}& orig) 00219 \{ 00220 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}=orig.\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}; 00221 \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}=orig.\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}; 00222 map<var\_sym\_index\_t, c\_var\_base*>::const\_iterator i1; 00223 \textcolor{keywordflow}{for}(i1=orig.\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.begin(); i1!=orig.\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end(); ++i1) \{ 00224 \hyperlink{classc__var__base}{c_var_base}* var=(*i1).second->copy(); 00225 \hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.insert(make\_pair(var->\hyperlink{classc__var__base_a50253caa3213d7562b43675550f7b45e_a50253caa3213d7562b43675550f7b45e}{get_id}(),var)); 00226 \} 00227 \} 00228 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00229}{}\hyperlink{classc__micro__symbol__variable__mapping_a4569f4215ce8b27fcc04549793e8a49b_a4569f4215ce8b27fcc04549793e8a49b}{00229} \hyperlink{classc__micro__symbol__variable__mapping_acc8b4e39344f02f1c6e79be3d4505450_acc8b4e39344f02f1c6e79be3d4505450}{c_micro_symbol_variable_mapping::c_micro_symbol_variable_mapping}(\textcolor{keyword}{const} \hyperlink{classc__micro__symbol__variable__mapping}{c_micro_symbol_variable_mapping}& orig, \hyperlink{classc__micro__symbol__variable__table}{c_micro_symbol_variable_table}* t) 00230 \{ 00231 \hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}=orig.\hyperlink{classc__micro__symbol__variable__mapping_a0b680446cb1814e10a7977b9e5a36592_a0b680446cb1814e10a7977b9e5a36592}{mapping}; 00232 \hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}=orig.\hyperlink{classc__micro__symbol__variable__mapping_aad3437b23cb6e53fc0251a23d36170da_aad3437b23cb6e53fc0251a23d36170da}{next_index}; 00233 00234 map<var\_sym\_index\_t, c\_var\_base*>::const\_iterator i1; 00235 \textcolor{keywordflow}{for}(i1=orig.\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.begin(); i1!=orig.\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end(); ++i1) \{ 00236 \hyperlink{classc__var__base}{c_var_base}* var=(*i1).second->copy(); 00237 var->\hyperlink{classc__var__base_acca32cb3d26557ec9f44f82d82396d31_acca32cb3d26557ec9f44f82d82396d31}{set_persistent}(); 00238 var->\hyperlink{classc__var__base_ab47ebc88c0c3aca08d9c647da23000c5_ab47ebc88c0c3aca08d9c647da23000c5}{set_read_only}(); 00239 \hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.insert(make\_pair((*i1).first,var)); 00240 \} 00241 00242 map<var\_sym\_index\_t, c\_var\_base*>::iterator i4=\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.begin(); 00243 \textcolor{keywordflow}{for}(\hyperlink{microcode__shared_8h_af764caa15fb6e7995386a6b04795416f_af764caa15fb6e7995386a6b04795416f}{var_sym_index_t} i2=0; i2<t->\hyperlink{classc__micro__symbol__variable__table_aef30f6f48c1b4e1b80e5d7fdea470e80_aef30f6f48c1b4e1b80e5d7fdea470e80}{real_space}; ++i2) \{ 00244 \textcolor{keywordflow}{if}(!t->\hyperlink{classc__micro__symbol__variable__table_ae007fb5cf083739a441876b18f8ddd5d_ae007fb5cf083739a441876b18f8ddd5d}{table}[i2].value) 00245 \textcolor{keywordflow}{continue}; 00246 \textcolor{keywordflow}{if}(\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end()!=i4) \{ 00247 t->\hyperlink{classc__micro__symbol__variable__table_ae007fb5cf083739a441876b18f8ddd5d_ae007fb5cf083739a441876b18f8ddd5d}{table}[i2].value=(*i4).second->get\_id(); 00248 i4++; 00249 \} \textcolor{keywordflow}{else} \{ 00250 \textcolor{comment}{// DEBUG: set breakpoint here!} 00251 \textcolor{keywordtype}{int} dummy=0; 00252 dummy++; 00253 \} 00254 \} 00255 \textcolor{keywordflow}{if}(\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end()!=i4) \{ 00256 \textcolor{comment}{// DEBUG: set breakpoint here!} 00257 \textcolor{keywordtype}{int} dummy=0; 00258 dummy++; 00259 \} 00260 \} 00261 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00262}{}\hyperlink{classc__micro__symbol__variable__mapping_a6d3d44f6bbead78d1dc18c741f5213e5_a6d3d44f6bbead78d1dc18c741f5213e5}{00262} \textcolor{keywordtype}{void} \hyperlink{classc__micro__symbol__variable__mapping_a6d3d44f6bbead78d1dc18c741f5213e5_a6d3d44f6bbead78d1dc18c741f5213e5}{c_micro_symbol_variable_mapping::instantiate_consts}( \hyperlink{classc__micro__symbol__variable__table}{c_micro_symbol_variable_table}* t) 00263 \{ 00264 map<var\_sym\_index\_t, c\_var\_base*>::iterator i4; 00265 \textcolor{keywordflow}{for}(i4=\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.begin(); i4!=\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end(); ++i4) \{ 00266 \textcolor{keywordflow}{if}(!t->\hyperlink{classc__micro__symbol__variable__table_a1a680d1c57d3c5473b935c00aacfbf18_a1a680d1c57d3c5473b935c00aacfbf18}{sanitize_index}((*i4).first)) \{ 00267 \textcolor{comment}{// out of memory, we can ignere it, later on execution it will fail} 00268 \textcolor{comment}{// with index-out-of-bounds error in logs} 00269 \textcolor{keywordflow}{return}; 00270 \} 00271 \textcolor{keywordflow}{if}(t->\hyperlink{classc__micro__symbol__variable__table_ae007fb5cf083739a441876b18f8ddd5d_ae007fb5cf083739a441876b18f8ddd5d}{table}[(*i4).first].value) \textcolor{comment}{// we should not overwrite it} 00272 \textcolor{keywordflow}{continue}; 00273 t->\hyperlink{classc__micro__symbol__variable__table_ae007fb5cf083739a441876b18f8ddd5d_ae007fb5cf083739a441876b18f8ddd5d}{table}[(*i4).first].value=(*i4).second->get\_id(); 00274 \} 00275 \} 00276 \hypertarget{c__micro__symbol__variable__mapping_8cpp_source_l00277}{}\hyperlink{classc__micro__symbol__variable__mapping_a50ae88fd08e88fc848e1e3d3805229f7_a50ae88fd08e88fc848e1e3d3805229f7}{00277} \hyperlink{classc__micro__symbol__variable__mapping_a50ae88fd08e88fc848e1e3d3805229f7_a50ae88fd08e88fc848e1e3d3805229f7}{c_micro_symbol_variable_mapping::~c_micro_symbol_variable_mapping}() 00278 \{ 00279 map<var\_sym\_index\_t, c\_var\_base*>::const\_iterator i1; 00280 \textcolor{keywordflow}{for}(i1=\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.begin(); i1!=\hyperlink{classc__micro__symbol__variable__mapping_a873d0cb64a987b523d0d61f95c142f8a_a873d0cb64a987b523d0d61f95c142f8a}{consts}.end(); ++i1) \{ 00281 \textcolor{comment}{//MY\_DELETE((*i1).second);} 00282 (*i1).second->set\_read\_only(\textcolor{keyword}{false}); 00283 (*i1).second->set\_persistent(\textcolor{keyword}{false}); 00284 \} 00285 \} 00286 \end{DoxyCode}

http://parabix.costar.sfu.ca/export/1328/docs/HPCA2012/latex/eso-pic.sty

sfu.ca

CC-MAIN-2019-43

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2019-43/segments/1570986660231.30/warc/CC-MAIN-20191015182235-20191015205735-00518.warc.gz

%% %% This is file `eso-pic.sty', %% generated with the docstrip utility. %% %% The original source files were: %% %% eso-pic.dtx (with options: `package') %% %% This is a generated file. %% %% Copyright (C) 1998-2002 by Rolf Niepraschk <niepraschk@ptb.de> %% %% This file may be distributed and/or modified under the conditions of %% the LaTeX Project Public License, either version 1.2 of this license %% or (at your option) any later version. The latest version of this %% license is in: %% %% http://www.latex-project.org/lppl.txt %% %% and version 1.2 or later is part of all distributions of LaTeX version %% 1999/12/01 or later. %% \NeedsTeXFormat{LaTeX2e}[1999/12/01] \ProvidesPackage{eso-pic} [2002/11/16 v1.1b eso-pic (RN)] \input{iccv_eso.sty} \newcommand\LenToUnit[1]{#1\@gobble} \newcommand\AtPageUpperLeft[1]{% \begingroup \@tempdima=0pt\relax\@tempdimb=\ESO@yoffsetI\relax \put(\LenToUnit{\@tempdima},\LenToUnit{\@tempdimb}){#1}% \endgroup } \newcommand\AtPageLowerLeft[1]{\AtPageUpperLeft{% \put(0,\LenToUnit{-\paperheight}){#1}}} \newcommand\AtPageCenter[1]{\AtPageUpperLeft{% \put(\LenToUnit{.5\paperwidth},\LenToUnit{-.5\paperheight}){#1}}% } \newcommand\AtTextUpperLeft[1]{% \begingroup \setlength\@tempdima{1in}% \ifodd\c@page% \advance\@tempdima\oddsidemargin% \else% \advance\@tempdima\evensidemargin% \fi% \@tempdimb=\ESO@yoffsetI\relax\advance\@tempdimb-1in\relax% \advance\@tempdimb-\topmargin% \advance\@tempdimb-\headheight\advance\@tempdimb-\headsep% \put(\LenToUnit{\@tempdima},\LenToUnit{\@tempdimb}){#1}% \endgroup } \newcommand\AtTextLowerLeft[1]{\AtTextUpperLeft{% \put(0,\LenToUnit{-\textheight}){#1}}} \newcommand\AtTextCenter[1]{\AtTextUpperLeft{% \put(\LenToUnit{.5\textwidth},\LenToUnit{-.5\textheight}){#1}}} \newcommand{\ESO@HookI}{} \newcommand{\ESO@HookII}{} \newcommand{\ESO@HookIII}{} \newcommand{\AddToShipoutPicture}{% \@ifstar{\g@addto@macro\ESO@HookII}{\g@addto@macro\ESO@HookI}} \newcommand{\ClearShipoutPicture}{\global\let\ESO@HookI\@empty} \newcommand\ESO@isMEMOIR[1]{} \@ifclassloaded{memoir}{\renewcommand\ESO@isMEMOIR[1]{#1}}{} \newcommand{\@ShipoutPicture}{% \bgroup \@tempswafalse% \ifx\ESO@HookI\@empty\else\@tempswatrue\fi% \ifx\ESO@HookII\@empty\else\@tempswatrue\fi% \ifx\ESO@HookIII\@empty\else\@tempswatrue\fi% \if@tempswa% \@tempdima=1in\@tempdimb=-\@tempdima% \advance\@tempdimb\ESO@yoffsetI% \ESO@isMEMOIR{% \advance\@tempdima\trimedge% \advance\@tempdima\paperwidth% \advance\@tempdima-\stockwidth% \if@twoside\ifodd\c@page\else% \advance\@tempdima-2\trimedge% \advance\@tempdima-\paperwidth% \advance\@tempdima\stockwidth% \fi\fi% \advance\@tempdimb\trimtop}% \unitlength=1pt% \global\setbox\@cclv\vbox{% \vbox{\let\protect\relax \pictur@(0,0)(\strip@pt\@tempdima,\strip@pt\@tempdimb)% \ESO@HookIII\ESO@HookI\ESO@HookII% \global\let\ESO@HookII\@empty% \endpicture}% \nointerlineskip% \box\@cclv}% \fi \egroup } \EveryShipout{\@ShipoutPicture} \RequirePackage{keyval} \newif\ifESO@dvips\ESO@dvipsfalse \newif\ifESO@grid\ESO@gridfalse \newif\ifESO@texcoord\ESO@texcoordfalse \newcommand*\ESO@gridunitname{} \newcommand*\ESO@gridunit{} \newcommand*\ESO@labelfactor{} \newcommand*\ESO@griddelta{}\newcommand*\ESO@griddeltaY{} \newcommand*\ESO@gridDelta{}\newcommand*\ESO@gridDeltaY{} \newcommand*\ESO@gridcolor{} \newcommand*\ESO@subgridcolor{} \newcommand*\ESO@subgridstyle{dotted}% ??? \newcommand*\ESO@gap{} \newcommand*\ESO@yoffsetI{}\newcommand*\ESO@yoffsetII{} \newcommand*\ESO@gridlines{\thinlines} \newcommand*\ESO@subgridlines{\thinlines} \newcommand*\ESO@hline[1]{\ESO@subgridlines\line(1,0){#1}} \newcommand*\ESO@vline[1]{\ESO@subgridlines\line(0,1){#1}} \newcommand*\ESO@Hline[1]{\ESO@gridlines\line(1,0){#1}} \newcommand*\ESO@Vline[1]{\ESO@gridlines\line(0,1){#1}} \newcommand\ESO@fcolorbox[4][]{\fbox{#4}} \newcommand\ESO@color[1]{} \newcommand\ESO@colorbox[3][]{% \begingroup \fboxrule=0pt\fbox{#3}% \endgroup } \newcommand\gridSetup[6][]{% \edef\ESO@gridunitname{#1}\edef\ESO@gridunit{#2} \edef\ESO@labelfactor{#3}\edef\ESO@griddelta{#4} \edef\ESO@gridDelta{#5}\edef\ESO@gap{#6}} \define@key{ESO}{texcoord}[true]{\csname ESO@texcoord#1\endcsname} \define@key{ESO}{pscoord}[true]{\csname @tempswa#1\endcsname \if@tempswa\ESO@texcoordfalse\else\ESO@texcoordtrue\fi} \define@key{ESO}{dvips}[true]{\csname ESO@dvips#1\endcsname} \define@key{ESO}{grid}[true]{\csname ESO@grid#1\endcsname \setkeys{ESO}{gridcolor=black,subgridcolor=black}} \define@key{ESO}{colorgrid}[true]{\csname ESO@grid#1\endcsname \setkeys{ESO}{gridcolor=red,subgridcolor=green}} \define@key{ESO}{gridcolor}{\def\ESO@gridcolor{#1}} \define@key{ESO}{subgridcolor}{\def\ESO@subgridcolor{#1}} \define@key{ESO}{subgridstyle}{\def\ESO@subgridstyle{#1}}% \define@key{ESO}{gridunit}{% \def\@tempa{#1} \def\@tempb{bp} \ifx\@tempa\@tempb \gridSetup[\@tempa]{1bp}{1}{10}{50}{2} \else \def\@tempb{pt} \ifx\@tempa\@tempb \gridSetup[\@tempa]{1pt}{1}{10}{50}{2} \else \def\@tempb{in} \ifx\@tempa\@tempb \gridSetup[\@tempa]{.1in}{.1}{2}{10}{.5} \else \gridSetup[mm]{1mm}{1}{5}{20}{1} \fi \fi \fi } \setkeys{ESO}{subgridstyle=solid,pscoord=true,gridunit=mm} \def\ProcessOptionsWithKV#1{% \let\@tempc\@empty \@for\CurrentOption:=\@classoptionslist\do{% \@ifundefined{KV@#1@\CurrentOption}% {}{\edef\@tempc{\@tempc,\CurrentOption,}}}% \edef\@tempc{% \noexpand\setkeys{#1}{\@tempc\@ptionlist{\@currname.\@currext}}}% \@tempc \AtEndOfPackage{\let\@unprocessedoptions\relax}}% \ProcessOptionsWithKV{ESO}% \newcommand\ESO@div[2]{% \@tempdima=#1\relax\@tempdimb=\ESO@gridunit\relax \@tempdimb=#2\@tempdimb\divide\@tempdima by \@tempdimb% \@tempcnta\@tempdima\advance\@tempcnta\@ne} \AtBeginDocument{% \IfFileExists{color.sty} {% \RequirePackage{color} \let\ESO@color=\color\let\ESO@colorbox=\colorbox \let\ESO@fcolorbox=\fcolorbox }{} \@ifundefined{Gin@driver}{}% {% \ifx\Gin@driver\@empty\else% \filename@parse{\Gin@driver}\def\reserved@a{dvips}% \ifx\filename@base\reserved@a\ESO@dvipstrue\fi% \fi }% \ifx\pdfoutput\undefined\else \ifx\pdfoutput\relax\else \ifcase\pdfoutput\else \ESO@dvipsfalse% \fi \fi \fi \ifESO@dvips\def\@tempb{eepic}\else\def\@tempb{epic}\fi \def\@tempa{dotted}%\def\ESO@gap{\LenToUnit{6\@wholewidth}}% \ifx\@tempa\ESO@subgridstyle \IfFileExists{\@tempb.sty}% {% \RequirePackage{\@tempb} \renewcommand*\ESO@hline[1]{\ESO@subgridlines\dottedline{\ESO@gap}% (0,0)(##1,0)} \renewcommand*\ESO@vline[1]{\ESO@subgridlines\dottedline{\ESO@gap}% (0,0)(0,##1)} }{} \else \ifx\ESO@gridcolor\ESO@subgridcolor% \renewcommand*\ESO@gridlines{\thicklines} \fi \fi } \ifESO@texcoord \def\ESO@yoffsetI{0pt}\def\ESO@yoffsetII{-\paperheight} \edef\ESO@griddeltaY{-\ESO@griddelta}\edef\ESO@gridDeltaY{-\ESO@gridDelta} \else \def\ESO@yoffsetI{\paperheight}\def\ESO@yoffsetII{0pt} \edef\ESO@griddeltaY{\ESO@griddelta}\edef\ESO@gridDeltaY{\ESO@gridDelta} \fi \newcommand\ESO@gridpicture{% \begingroup \setlength\unitlength{\ESO@gridunit}% \ESO@color{\ESO@subgridcolor}% \ESO@div{\paperheight}{\ESO@griddelta}% \multiput(0,0)(0,\ESO@griddeltaY){\@tempcnta}% {\ESO@hline{\LenToUnit{\paperwidth}}}% \ESO@div{\paperwidth}{\ESO@griddelta}% \multiput(0,\LenToUnit{\ESO@yoffsetII})(\ESO@griddelta,0){\@tempcnta}% {\ESO@vline{\LenToUnit{\paperheight}}}% \ESO@color{\ESO@gridcolor}% \ESO@div{\paperheight}{\ESO@gridDelta}% \multiput(0,0)(0,\ESO@gridDeltaY){\@tempcnta}% {\ESO@Hline{\LenToUnit{\paperwidth}}}% \ESO@div{\paperwidth}{\ESO@gridDelta}% \multiput(0,\LenToUnit{\ESO@yoffsetII})(\ESO@gridDelta,0){\@tempcnta}% {\ESO@Vline{\LenToUnit{\paperheight}}}% \fontsize{10}{12}\normalfont% \ESO@div{\paperwidth}{\ESO@gridDelta}% \multiput(0,\ESO@gridDeltaY)(\ESO@gridDelta,0){\@tempcnta}{% \@tempcntb=\@tempcnta\advance\@tempcntb-\@multicnt% \ifnum\@tempcntb>1\relax \multiply\@tempcntb by \ESO@gridDelta\relax% \@tempdima=\@tempcntb sp\@tempdima=\ESO@labelfactor\@tempdima% \@tempcntb=\@tempdima% \makebox(0,0)[c]{\ESO@colorbox{white}{\the\@tempcntb}}% \fi}% \ifx\ESO@gridunitname\@empty\def\@tempa{0}\else\def\@tempa{1}\fi% \ESO@div{\paperheight}{\ESO@gridDelta}% \multiput(\ESO@gridDelta,0)(0,\ESO@gridDeltaY){\@tempcnta}{% \@tempcntb=\@tempcnta\advance\@tempcntb-\@multicnt% \ifnum\@tempcntb>\@tempa\relax \multiply\@tempcntb by \ESO@gridDelta\relax% \@tempdima=\@tempcntb sp\@tempdima=\ESO@labelfactor\@tempdima% \@tempcntb=\@tempdima% \makebox(0,0)[c]{\ESO@colorbox{white}{\the\@tempcntb}}% \fi }% \ifx\ESO@gridunitname\@empty\else% \thicklines\fboxrule=\@wholewidth% \put(\ESO@gridDelta,\ESO@gridDeltaY){\makebox(0,0)[c]{% \ESO@fcolorbox{\ESO@gridcolor}{white}{% \textbf{\ESO@gridunitname}}}}% \fi \normalcolor% \endgroup } \ifESO@grid\g@addto@macro\ESO@HookIII{\ESO@gridpicture}\fi \endinput %% %% End of file `eso-pic.sty'.

https://ftp.mi.fu-berlin.de/pub/usr/kracht/JLaC/abb2e.sty

fu-berlin.de

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103334753.21/warc/CC-MAIN-20220627134424-20220627164424-00598.warc.gz

%% %% Abkuerzungsfile Datum 23. Maerz 1993 %% %% Abkuerzungen fuer die Tafellettern %% \newcommand{\BA}{\mathbb{A}} \newcommand{\BB}{\mathbb{B}} \newcommand{\BC}{\mathbb{C}} \newcommand{\BD}{\mathbb{D}} \newcommand{\BE}{\mathbb{E}} \newcommand{\BF}{\mathbb{F}} \newcommand{\BG}{\mathbb{G}} \newcommand{\BH}{\mathbb{H}} \newcommand{\BI}{\mathbb{I}} \newcommand{\BJ}{\mathbb{J}} \newcommand{\BK}{\mathbb{K}} \newcommand{\BL}{\mathbb{L}} \newcommand{\BM}{\mathbb{M}} \newcommand{\BN}{\mathbb{N}} \newcommand{\BO}{\mathbb{O}} \newcommand{\BP}{\mathbb{P}} \newcommand{\BQ}{\mathbb{Q}} \newcommand{\BR}{\mathbb{R}} \newcommand{\BS}{\mathbb{S}} \newcommand{\BT}{\mathbb{T}} \newcommand{\BU}{\mathbb{U}} \newcommand{\BV}{\mathbb{V}} \newcommand{\BW}{\mathbb{W}} \newcommand{\BX}{\mathbb{X}} \newcommand{\BY}{\mathbb{Y}} \newcommand{\BZ}{\mathbb{Z}} %% %% Grosse Gothische Buchstaben %% \newcommand{\GA}{\mathfrak{A}} \newcommand{\GB}{\mathfrak{B}} \newcommand{\GC}{\mathfrak{C}} \newcommand{\GD}{\mathfrak{D}} \newcommand{\GE}{\mathfrak{E}} \newcommand{\GF}{\mathfrak{F}} \newcommand{\GG}{\mathfrak{G}} \newcommand{\GH}{\mathfrak{H}} \newcommand{\GI}{\mathfrak{I}} \newcommand{\GJ}{\mathfrak{J}} \newcommand{\GK}{\mathfrak{K}} \newcommand{\GL}{\mathfrak{L}} \newcommand{\GM}{\mathfrak{M}} \newcommand{\GN}{\mathfrak{N}} \newcommand{\GO}{\mathfrak{O}} \newcommand{\GP}{\mathfrak{P}} \newcommand{\GQ}{\mathfrak{Q}} \newcommand{\GR}{\mathfrak{R}} \newcommand{\GS}{\mathfrak{S}} \newcommand{\GT}{\mathfrak{T}} \newcommand{\GU}{\mathfrak{U}} \newcommand{\GV}{\mathfrak{V}} \newcommand{\GW}{\mathfrak{W}} \newcommand{\GX}{\mathfrak{X}} \newcommand{\GY}{\mathfrak{Y}} \newcommand{\GZ}{\mathfrak{Z}} %% %% Kleine Gothische Buchstaben %% \newcommand{\Ga}{\mathfrak{a}} \newcommand{\Gb}{\mathfrak{b}} \newcommand{\Gc}{\mathfrak{c}} \newcommand{\Gd}{\mathfrak{d}} \newcommand{\Ge}{\mathfrak{e}} \newcommand{\Gf}{\mathfrak{f}} \newcommand{\Gg}{\mathfrak{g}} \newcommand{\Gh}{\mathfrak{h}} \newcommand{\Gi}{\mathfrak{i}} \newcommand{\Gj}{\mathfrak{j}} \newcommand{\Gk}{\mathfrak{k}} \newcommand{\Gl}{\mathfrak{l}} \newcommand{\Gm}{\mathfrak{m}} \newcommand{\Gn}{\mathfrak{n}} \newcommand{\Go}{\mathfrak{o}} \newcommand{\Gp}{\mathfrak{p}} \newcommand{\Gq}{\mathfrak{q}} \newcommand{\Gr}{\mathfrak{r}} \newcommand{\Gs}{\mathfrak{s}} \newcommand{\Gt}{\mathfrak{t}} \newcommand{\Gu}{\mathfrak{u}} \newcommand{\Gv}{\mathfrak{v}} \newcommand{\Gw}{\mathfrak{w}} \newcommand{\Gx}{\mathfrak{x}} \newcommand{\Gy}{\mathfrak{y}} \newcommand{\Gz}{\mathfrak{z}} %% %% Grosse Sanserif Buchstaben %% \newcommand{\SA}{\mbox{\sf A}} \newcommand{\SB}{\mbox{\sf B}} \newcommand{\SC}{\mbox{\sf C}} \newcommand{\SD}{\mbox{\sf D}} \newcommand{\SE}{\mbox{\sf E}} \newcommand{\SF}{\mbox{\sf F}} \newcommand{\SG}{\mbox{\sf G}} \newcommand{\SH}{\mbox{\sf H}} \newcommand{\SI}{\mbox{\sf I}} \newcommand{\SJ}{\mbox{\sf J}} \newcommand{\SK}{\mbox{\sf K}} \newcommand{\SL}{\mbox{\sf L}} \newcommand{\SM}{\mbox{\sf M}} \newcommand{\SN}{\mbox{\sf N}} \newcommand{\SO}{\mbox{\sf O}} \newcommand{\SP}{\mbox{\sf P}} \newcommand{\SQ}{\mbox{\sf Q}} \newcommand{\SR}{\mbox{\sf R}} % \newcommand{\SS}{\mbox{\sf S}} \newcommand{\ST}{\mbox{\sf T}} \newcommand{\SU}{\mbox{\sf U}} \newcommand{\SV}{\mbox{\sf V}} \newcommand{\SW}{\mbox{\sf W}} \newcommand{\SX}{\mbox{\sf X}} \newcommand{\SY}{\mbox{\sf Y}} \newcommand{\SZ}{\mbox{\sf Z}} %% %% Kleine Sanserif Buchstaben %% \newcommand{\Sa}{\mbox{\sf a}} % \newcommand{\Sb}{\mbox{\sf b}} \newcommand{\Sc}{\mbox{\sf c}} \newcommand{\Sd}{\mbox{\sf d}} \newcommand{\Se}{\mbox{\sf e}} \newcommand{\Sf}{\mbox{\sf f}} \newcommand{\Sg}{\mbox{\sf g}} \newcommand{\Sh}{\mbox{\sf h}} \newcommand{\Si}{\mbox{\sf i}} \newcommand{\Sj}{\mbox{\sf j}} \newcommand{\Sk}{\mbox{\sf k}} \newcommand{\Sl}{\mbox{\sf l}} \newcommand{\Sm}{\mbox{\sf m}} \newcommand{\Sn}{\mbox{\sf n}} \newcommand{\So}{\mbox{\sf o}} % \newcommand{\Sp}{\mbox{\sf p}} \newcommand{\Sq}{\mbox{\sf q}} \newcommand{\Sr}{\mbox{\sf r}} \newcommand{\Ss}{\mbox{\sf s}} \newcommand{\St}{\mbox{\sf t}} \newcommand{\Su}{\mbox{\sf u}} \newcommand{\Sv}{\mbox{\sf v}} \newcommand{\Sw}{\mbox{\sf w}} \newcommand{\Sx}{\mbox{\sf x}} \newcommand{\Sy}{\mbox{\sf y}} \newcommand{\Sz}{\mbox{\sf z}} %% %% Grosse Euler Fonts %% \newcommand{\EA}{\eul{A}} \newcommand{\EB}{\eul{B}} \newcommand{\EC}{\eul{C}} \newcommand{\ED}{\eul{D}} \newcommand{\EE}{\eul{E}} \newcommand{\EF}{\eul{F}} \newcommand{\EG}{\eul{G}} \newcommand{\EH}{\eul{H}} \newcommand{\EI}{\eul{I}} \newcommand{\EJ}{\eul{J}} \newcommand{\EK}{\eul{K}} \newcommand{\EL}{\eul{L}} \newcommand{\EM}{\eul{M}} \newcommand{\EN}{\eul{N}} \newcommand{\EO}{\eul{O}} \newcommand{\EP}{\eul{P}} \newcommand{\EQ}{\eul{Q}} \newcommand{\ER}{\eul{R}} \newcommand{\ES}{\eul{S}} \newcommand{\ET}{\eul{T}} \newcommand{\EU}{\eul{U}} \newcommand{\EV}{\eul{V}} \newcommand{\EW}{\eul{W}} \newcommand{\EX}{\eul{X}} \newcommand{\EY}{\eul{Y}} \newcommand{\EZ}{\eul{Z}} % % Abkuerzungen fuer die kalligraphischen Lettern % \newcommand{\CA}{\mathcal{A}} \newcommand{\CB}{\mathcal{B}} \newcommand{\CC}{\mathcal{C}} \newcommand{\CD}{\mathcal{D}} \newcommand{\CE}{\mathcal{E}} \newcommand{\CF}{\mathcal{F}} \newcommand{\CG}{\mathcal{G}} \newcommand{\CH}{\mathcal{H}} \newcommand{\CI}{\mathcal{I}} \newcommand{\CJ}{\mathcal{J}} \newcommand{\CK}{\mathcal{K}} \newcommand{\CL}{\mathcal{L}} \newcommand{\CM}{\mathcal{M}} \newcommand{\CN}{\mathcal{N}} \newcommand{\CO}{\mathcal{O}} \newcommand{\CP}{\mathcal{P}} \newcommand{\CQ}{\mathcal{Q}} \newcommand{\CR}{\mathcal{R}} \newcommand{\CS}{\mathcal{S}} \newcommand{\CT}{\mathcal{T}} \newcommand{\CU}{\mathcal{U}} \newcommand{\CV}{\mathcal{V}} \newcommand{\CW}{\mathcal{W}} \newcommand{\CX}{\mathcal{X}} \newcommand{\CY}{\mathcal{Y}} \newcommand{\CZ}{\mathcal{Z}}

http://vincematsko.com/Fall2016/MAT195/D07Homework.tex

vincematsko.com

CC-MAIN-2017-30

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2017-30/segments/1500549424287.86/warc/CC-MAIN-20170723062646-20170723082646-00650.warc.gz

\documentclass[12pt]{article} \usepackage{pstricks} \usepackage{amsmath,amsfonts,tikz} % Put these before fancyhdr lest the headers and footers be the wrong length. \textwidth = 6.5in % 1in margins all around. \hoffset = 0in % These keep left margins at 1in. \oddsidemargin = 0in % So that there is one-half inch at top and bottom. % See Math Into LaTeX, p. 260. \topmargin = 0pt \voffset = -0.5in \textheight = 8.85in \usepackage{fancyhdr} \pagestyle{fancy} \lhead{Mathematics and Digital Art} \chead{} \rhead{Due: 12 September 2016} \lfoot{Matsko} \cfoot{} \rfoot{9 September 2016} \renewcommand{\headrulewidth}{0pt} \def\dint{\displaystyle\int} \parskip=\bigskipamount \parindent=0pt \def\banner#1{\hrule\begin{center}{\sc #1}\end{center}\bigskip\hrule} \def\reals{{\mathbb R}} \def\nat{{\mathbb N}} \def\pvec#1#2{\left(\begin{matrix}#1\cr#2\end{matrix}\right)} \def\pvectd#1#2#3{\left(\begin{matrix}#1\cr#2\cr#3\end{matrix}\right)} \def\bmatrix#1#2#3#4{ \left[\begin{matrix}#1&#2\cr #3&#4\end{matrix}\right] } \def\bmatrixtd#1#2#3#4#5#6#7#8#9{ \left[\begin{matrix}#1&#2&#3\cr #4&#5&#6\cr#7&#8&#9\end{matrix}\right] } \begin{document} For problems \#1 and \#2, write the transformation which takes the unit square (blue) to the transformed square (red). Use the form $$T\pvec xy=\bmatrix abcd\pvec xy+\pvec ef.$$ Check your work online! For \#3 and \#4, sketch a diagram of the unit square (blue) and the parallelogram it transforms into (red, possibly shaded if there is a flip). Also, check your work algebraically (using matrix multiplication) like we did in class today. Finally, check online using the Sage worksheet. \begin{enumerate} \item \begin{tikzpicture}[scale=0.7] \draw[gray] (-6,-4) grid (2,2); \draw[<->,dashed] (-6.5,0) -- (2.5,0); \draw[<->,dashed] (0,2.5) -- (0,-4.5); \draw[very thick,blue] (0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle; \draw[very thick,red] (-5,-3) -- (-1,-3) -- (-1,-1) -- (-5,-1) -- cycle; \filldraw (0,0) circle (0.1cm); \draw (1,0) circle (0.1cm); \filldraw (-5,-3) circle (0.1cm); \draw (-1,-3) circle (0.1cm); \end{tikzpicture} \item \begin{tikzpicture}[scale=0.7] \draw[gray] (-1,-5) grid (5,2); \draw[<->,dashed] (-1.5,0) -- (5.5,0); \draw[<->,dashed] (0,2.5) -- (0,-5.5); \draw[very thick,blue] (0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle; \filldraw[very thick,red,fill=red!30!white] (1,-2) -- (4,-2) -- (4,-4) -- (1,-4) -- cycle; \filldraw (0,0) circle (0.1cm); \draw (1,0) circle (0.1cm); \filldraw (1,-2) circle (0.1cm); \draw (4,-2) circle (0.1cm); \end{tikzpicture} \item $$T\pvec xy=\bmatrix 2{-1}03\pvec xy+\pvec 2{-1}.$$ \item $$T\pvec xy=\bmatrix 311{-2}\pvec xy+\pvec {-3}{-2}.$$ \end{enumerate} \end{document}

https://www.ohio.edu/cas/sites/ohio.edu.cas/files/sites/cas/math/files/matlab_int_rs.tex

ohio.edu

CC-MAIN-2021-25

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2021-25/segments/1623487611089.19/warc/CC-MAIN-20210613222907-20210614012907-00245.warc.gz

%Numerical Integration %If you modify this file, please indicate here and in the footnote %Math263B \documentclass[12pt]{article} \usepackage{times} \pagestyle{empty} \topmargin -.1in \headheight 0in \addtolength{\textwidth}{1.2in} \addtolength{\textheight}{1.2in} \addtolength{\oddsidemargin}{-.6in} \addtolength{\evensidemargin}{-.6in} \renewcommand{\baselinestretch}{1.0} \parindent = 0cm \parskip = .1cm \begin{document} \begin{center} \Large Riemann Sums I \footnote{Copyright \copyright 2005 Todd Young. All rights reserved. Please address comments to young@math.ohiou.edu.} %modified by ~~~~} \end{center} \begin{enumerate} \item In the command window type:\\ \verb& dx = .1&\\ \verb& x = 0:dx:2&\\ \verb& y = 3*x.^2&\\ Describe \verb&dx&, \verb&x& and \verb&y&. \item Next type:\\ \verb& format long&\\ \verb& yl = y(1:20)&\\ \verb& L = dx*sum(yl)&\\ \verb& yr = y(2:21)&\\ \verb& R = dx*sum(yr)&\\ What are \verb&yl& and \verb&yr&? What are \verb&L& and \verb&R&? How do they compare with the true value of the integral (what is the percentage errors)? \item Repeat the above commands, but begin with:\\ \verb& dx = .001&\\ You will need to adjust the index numbers in the commands for \verb&yl& and \verb&yr&. What are the percentage errors of these approximations. \item To obtain a midpoint Riemann sum type:\\ \verb& dx = .1&\\ \verb& x = dx/2:dx:2-dx/2&\\ \verb& y = 3*x.^2&\\ \verb& M = dx*sum(y)&\\ Explain why this is a midpoint sum. For $dx=.1$ and $dx =.001$ compute the percentage errors. Make a table of percentage errors in all the above calculations. \item Repeat all the above commands for the function $f(x) = \sqrt{1 + .5\sin^2{x}}$\\ (input as \verb& y = sqrt(1 + .5*sin(x).^2))& and record the answers. The value of this integral correct to 15 significant digits is: 2.27220510258726. Make a table of percentage errors as above. \item Using complete sentences and standard mathematical notation, prepare a brief (\verb$< $1 page) written report answering all the questions. Do {\bf not} get a printout. \end{enumerate} \vfill \noindent \textsf{The user compares different Riemann sums and considers their accuracy.} \end{document}

http://dlmf.nist.gov/11.9.E2.tex

nist.gov

CC-MAIN-2017-17

application/x-tex

crawl-data/CC-MAIN-2017-17/segments/1492917123102.83/warc/CC-MAIN-20170423031203-00142-ip-10-145-167-34.ec2.internal.warc.gz

\[w=\mathop{s_{{\mu},{\nu}}\/}\nolimits\!\left(z\right)+A\mathop{J_{\nu}\/}% \nolimits\!\left(z\right)+B\mathop{Y_{\nu}\/}\nolimits\!\left(z\right),\]

http://www.pa.op.dlr.de/~PatrickJoeckel/pdflatex/example.tex

dlr.de

CC-MAIN-2019-09

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2019-09/segments/1550247499009.48/warc/CC-MAIN-20190221031117-20190221053117-00106.warc.gz

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % common HEADER for LaTeX and pdfLaTeX %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentclass[12pt,twoside,a4paper]{article} \usepackage{ifthen} %%% package for conditionals in TeX \usepackage{fancyhdr} %%% for more fancy page headers \usepackage{longtable} %%% for tables longer than one page \usepackage{afterpage} %%% figures not before first reference \usepackage[normal,footnotesize,bf]{caption2} %%% more fancy captions for % figure- and table-captions \usepackage[square]{natbib} %%% natbib-style for bibliography \usepackage[nottoc]{tocnatbibind} %%% make entry of LoF, LoT, and Ref in ToC % but still use natbib-style \settocbibname{References} %%% Title of bibliography % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % SWITCH FOR PDFLATEX or LATEX %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%% \ifx\pdfoutput\undefined %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% LATEX %%% %%% \usepackage[dvips]{graphicx} %%% graphics for dvips \DeclareGraphicsExtensions{.eps} %%% standard extension for included graphics \usepackage[ps2pdf]{thumbpdf} %%% thumbnails for ps2pdf \usepackage[ps2pdf, %%% hyper-references for ps2pdf bookmarks=true,% %%% generate bookmarks ... bookmarksnumbered=true,% %%% ... with numbers hypertexnames=false,% %%% needed for correct links to figures !!! breaklinks=true,% %%% breaks lines, but links are very small linkbordercolor={0 0 1},% %%% blue frames around links pdfborder={0 0 112.0}]{hyperref}% %%% border-width of frames % will be multiplied with 0.009 by ps2pdf % \hypersetup{ pdfauthor = {Patrick J\"{o}ckel <joeckel@mpch-mainz.mpg.de>}, pdftitle = {Cosmogenic 14CO as tracer for atmospheric chemistry and transport}, pdfsubject = {Dissertation}, pdfkeywords = {radiocarbon, 14CO, cosmogenic source, atmospheric tracer, 3-dimensional atmospheric transport and chemistry model, hydroxyl radical, OH, advection, cross tropopause transport, stratosphere-troposphere exchange, response time, solar cycle, solar activity, solar proton events}, pdfcreator = {LaTeX with hyperref package}, pdfproducer = {dvips + ps2pdf} } %%% \else %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PDFLATEX %%% %%% \usepackage[pdftex]{graphicx} %%% graphics for pdfLaTeX \DeclareGraphicsExtensions{.pdf} %%% standard extension for included graphics \usepackage[pdftex]{thumbpdf} %%% thumbnails for pdflatex \usepackage[pdftex, %%% hyper-references for pdflatex bookmarks=true,% %%% generate bookmarks ... bookmarksnumbered=true,% %%% ... with numbers hypertexnames=false,% %%% needed for correct links to figures !!! breaklinks=true,% %%% break links if exceeding a single line linkbordercolor={0 0 1}]{hyperref} %%% blue frames around links % %%% pdfborder={0 0 1} is the default \hypersetup{ pdfauthor = {Patrick J\"{o}ckel <joeckel@mpch-mainz.mpg.de>}, pdftitle = {Cosmogenic 14CO as tracer for atmospheric chemistry and transport}, pdfsubject = {Dissertation}, pdfkeywords = {radiocarbon, 14CO, cosmogenic source, atmospheric tracer, 3-dimensional atmospheric transport and chemistry model, hydroxyl radical, OH, advection, cross tropopause transport, stratosphere-troposphere exchange, response time, solar cycle, solar activity, solar proton events}, } % %%% pdfcreator, pdfproducer, % and CreatioDate are automatically set % by pdflatex !!! \pdfadjustspacing=1 %%% force LaTeX-like character spacing % \fi %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% END OF CONDITION %%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%% Some settings for the page-Layout (not neccessarily needed !!!) \addtolength{\oddsidemargin}{+6mm} %%% increase left margin on odd sides ... \addtolength{\evensidemargin}{-20mm} %%% ... decreaase on even sides for ... % %%% ... later binding the document \addtolength{\topmargin}{-3mm} %%% reduce top margin \setlength{\textheight}{22.2cm} %%% set height and ... \setlength{\textwidth}{15cm} %%% ... width for text \setlength{\captionmargin}{5mm} %%% additional margins for captions % \renewcommand{\textfraction}{0} %%% for these magic numbers ... \renewcommand{\topfraction}{1} %%% ... \renewcommand{\bottomfraction}{1} %%% ... have a look into your ... \renewcommand{\floatpagefraction}{0} %%% ... LaTeX-Book % \renewcommand{\baselinestretch}{1.10} %%% increase line spacing % \raggedbottom %%% do NOT increase spaces between % paragraphs in order to fill always % the whole page % \renewcommand{\arraystretch}{1.15} %%% space for text-arrays \parindent0mm \parskip1ex plus0.3ex minus0.25ex % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % enumeration of figures, tables and equations % like 3.5 for 5th figure/equation/table in section 3 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \makeatletter \@addtoreset{equation}{section} \@addtoreset{figure}{section} \@addtoreset{table}{section} \def\thefigure{\thesection.\@arabic\c@figure} \def\thetable{\thesection.\@arabic\c@table} \def\theequation{\thesection.\@arabic\c@equation} \makeatother % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % space between text and page-numbers in List of Figures, Tables %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \makeatletter \renewcommand*\l@figure{\@dottedtocline{1}{1em}{3em}} \renewcommand*\l@table{\@dottedtocline{1}{1em}{3em}} \makeatother % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % set parameters for Table of Contents % here (article-style): % entries for section(1), subsection(2), subsubsection(3), % DOWNTO paragraph(4) into Table of Contents and Bookmarks, % similar for enumeration %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \setcounter{secnumdepth}{4} \setcounter{tocdepth}{4} % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % define and set flag for including color/grey-level figures %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newboolean{color} \setboolean{color}{true} %%% use color figures %\setboolean{color}{false} %%% use gray-level figures % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % set pagestyle of fancy-header %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \pagestyle{fancy} \fancyhf{} \fancyhead[EL,OR]{\bfseries\thepage} \fancyhead[LO]{\bfseries\rightmark} \fancyhead[RE]{\bfseries\leftmark} % \fancypagestyle{plain}{ \fancyhead{} \fancyhead[EL,OR]{\bfseries\thepage} \renewcommand{\headrulewidth}{0pt} } % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % BEGIN DOCUMENT %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} % %Set an additional Bookmark to the first Page \pdfbookmark[1]{Preamble}{prea} Include your title-page here. \cleardoublepage %%% start again on odd page % % Table of Contents: \pagenumbering{roman} %%% Roman page numbers for ToC \pdfbookmark[1]{Contents}{toc} %%% additional bookmark for ToC \thispagestyle{plain} %%% uses the above defined fancy page-header \tableofcontents \markboth{Table of Contents}{Table of Contents} %%% for the page header \cleardoublepage %%% start again on odd page \pagenumbering{arabic} %%% from now on Arabic page numbers %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Put your document text here ! Include graphics with %% \begin{figure} %% \ifthenelse{\boolean{color}} %% {\centerline{\includegraphics[width=14cm]{img01/img}}} %% {\centerline{\includegraphics[width=14cm]{img01g/img}}} %% \caption[Short caption for List of Figures] %% {Long caption for text} %% \label{img01} %% \end{figure} % Running LaTeX: % If color=true (see above) this will include the file img.eps from % the subdirectory img01, if color=false from the subdirectory img01g. % Running pdfLaTeX: % If color=true (see above) this will include the file img.pdf from % the subdirectory img01, if color=false from the subdirectory img01g. % An in-text link to this figure can be created by ... see Figure~\ref{img01}. The same works with equations and tables. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % List of Figures: \thispagestyle{plain} %%% uses the above defined fancy page-header \listoffigures \clearpage % % List of Tables: \thispagestyle{plain} %%% uses the above defined fancy page-header \listoftables \cleardoublepage % % Bibliography: \thispagestyle{plain} %%% uses the above defined fancy page-header \bibliographystyle{jgr} %%% uses jgr.sty for in-text citations \bibliography{my_references} %%% uses my_references.bib for bibliography \cleardoublepage %%%%%%%%%%%%%%%%%%%% \end{document} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

https://fr.pastebin.ca/raw/737931

pastebin.ca

CC-MAIN-2018-05

text/plain

application/x-tex

crawl-data/CC-MAIN-2018-05/segments/1516084887065.16/warc/CC-MAIN-20180118032119-20180118052119-00620.warc.gz

\documentclass[a4paper,oneside, 11pt]{article} \usepackage[francais]{babel} \usepackage[latin1]{inputenc} % les accents dans le fichier.tex \usepackage{vmargin} %left, top, right, bottom \setmarginsrb{2cm}{1.2cm}{2cm}{1.2cm}{0cm}{0cm}{0cm}{0cm} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Définition de quelques macros % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % ligne horizontale sur toute la page. Usage : \ligne{Largeur} \newcommand{\ligne}[1]{\rule[0.5ex]{\textwidth}{#1}\\} \newcommand{\interRubrique}{\vskip 1.5cm} %\newcommand{\interRubrique}{\bigskip} \newcommand{\styleRub}[1]{\noindent\textbf{\large #1}\par} \newcommand{\indentStd}{\noindent\hspace{\lenA}} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % L'environnement "rubrique" % % Usage : \begin{rubrique}[Indentation]{Titre} [...] \end{rubrique} % Ensuite, la première colonne contient par exemple les dates, la seconde % le descriptif. % Par exemple : % % \begin{rubrique}{3.5cm}{pipotage} % 1999--2000 & ligne 1\\ % & ligne 2\\ % 1998--1999 & ligne 1\\ % [etc...] % \end{rubrique} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newenvironment{rubrique}[2][\linewidth] { \styleRub{#2} \setlength{\lenB}{#1} \setlength{\lenC}{\linewidth} \addtolength{\lenC}{-\lenA} \addtolength{\lenC}{-\lenB} \addtolength{\lenC}{-\parindent} \addtolength{\lenC}{-9pt} \indentStd\begin{tabular}[t]{p{\lenB}p{\lenC}} } {\end{tabular}} \newenvironment{header}[2][\linewidth] { \styleRub{#2} \setlength{\lenB}{#1} \setlength{\lenC}{\linewidth} \addtolength{\lenC}{-\lenA} \addtolength{\lenC}{-\lenB} \addtolength{\lenC}{-\parindent} \addtolength{\lenC}{-9pt} \indentStd\begin{tabular}[t]{p{\lenB}ll} } {\end{tabular}} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Commandes utilisables dans le descriptif % % % Modifiables à loisir... %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newcommand{\lieu}[1]{\small{\textsl{#1}\ }} \newcommand{\activite}[1]{\textbf{#1}\ } \newcommand{\comment}[1]{\textsl{#1}\ } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Début du CV proprement dit (ouf ! :) ) % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \pagestyle{empty} % pour ne pas indiquer de numéro de page... \begin{document} \newlength{\lenA} % indentation au début d'une ligne \setlength{\lenA}{0.cm} \newlength{\lenB} % Taille champ dates \newlength{\lenC} % Taille champ description %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % en-tête % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{header}[14cm]{} \textbf{\large{Nom prénom}} \\ & \footnotesize {\large{XX ans, célibataire}} \\ \footnotesize{\large{XX, rue Saint Machin}} & \footnotesize {\large{Permis B, véhicule}} \\ \footnotesize{\large{XXXXX La Belle Ville}} \\ \footnotesize{\large{Tél : XX.XX.XX.XX.XX}} \\ \footnotesize{\large{E-mail : \texttt{bidule@truc}}} \\ \end{header} \interRubrique \bigskip \begin{center} \huge{\textsl{TITRE}} \end{center} \bigskip %%%%%%%%%%%%%%%%%% % Bloc rubriques % %%%%%%%%%%%%%%%%%% \interRubrique \begin{rubrique}[2.8cm]{Connaissances techniques} \ligne{0.1mm} Langages & C, Python, Bash, \LaTeX, Java. \\ Systèmes & GNU Linux (Debian...), BSD (OpenBSD...), Cisco IOS, Windows. \\ \end{rubrique} \interRubrique \begin{rubrique}[2.8cm]{Formations} \ligne{0.1mm} & \activite{Baccalauréat} \comment{(Mention machin)} \\ & \lieu{Lycée Truc - Ville.} \\ \end{rubrique} \interRubrique \begin{rubrique}[2.8cm]{Langues} \ligne{0.1mm} Anglais & Lu, écrit et parlé.\\ Allemand & Courant.\\ \end{rubrique} \interRubrique \begin{rubrique}[2.8cm]{Loisirs} \ligne{0.1mm} Logiciel libre & Blabla \\ \end{rubrique} \end{document}

https://es.theanarchistlibrary.org/library/saul-newman-anarquismo-y-politica-resentimiento.tex

theanarchistlibrary.org

CC-MAIN-2019-43

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-43/segments/1570986653247.25/warc/CC-MAIN-20191014124230-20191014151730-00457.warc.gz

\documentclass[DIV=15,% BCOR=0mm,% headinclude=false,% footinclude=false,open=any,% fontsize=11pt,% twoside,% paper=a5]% {scrbook} \usepackage{fontspec} \setmainfont[Script=Latin]{Linux Libertine O} \setsansfont[Script=Latin,Scale=MatchLowercase]{CMU Sans Serif} \setmonofont[Script=Latin,Scale=MatchLowercase]{CMU Typewriter Text} % global style \pagestyle{plain} \usepackage{microtype} % you need an *updated* texlive 2012, but harmless \usepackage{graphicx} \usepackage{alltt} \usepackage{verbatim} % http://tex.stackexchange.com/questions/3033/forcing-linebreaks-in-url \PassOptionsToPackage{hyphens}{url}\usepackage[hyperfootnotes=false,hidelinks,breaklinks=true]{hyperref} \usepackage{bookmark} \usepackage[shortlabels]{enumitem} \usepackage{tabularx} \usepackage[normalem]{ulem} \def\hsout{\bgroup \ULdepth=-.55ex \ULset} % https://tex.stackexchange.com/questions/22410/strikethrough-in-section-title % Unclear if \protect \hsout is needed. Doesn't looks so \DeclareRobustCommand{\sout}[1]{\texorpdfstring{\hsout{#1}}{#1}} \usepackage{wrapfig} \usepackage{indentfirst} % remove the numbering \setcounter{secnumdepth}{-2} % remove labels from the captions \renewcommand*{\captionformat}{} \renewcommand*{\figureformat}{} \renewcommand*{\tableformat}{} \KOMAoption{captions}{belowfigure,nooneline} \addtokomafont{caption}{\centering} \usepackage{polyglossia} \setmainlanguage{spanish} % footnote handling \usepackage[fragile]{bigfoot} \usepackage{perpage} \DeclareNewFootnote{default} \DeclareNewFootnote{B} \MakeSorted{footnoteB} \renewcommand*\thefootnoteB{(\arabic{footnoteB})} \deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~} % avoid breakage on multiple <br><br> and avoid the next [] to be eaten \newcommand*{\forcelinebreak}{\strut\\*{}} \newcommand*{\hairline}{% \bigskip% \noindent \hrulefill% \bigskip% } % reverse indentation for biblio and play \newenvironment*{amusebiblio}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newenvironment*{amuseplay}{ \leftskip=\parindent \parindent=-\parindent \smallskip \indent }{\smallskip} \newcommand*{\Slash}{\slash\hspace{0pt}} \addtokomafont{disposition}{\rmfamily} \addtokomafont{descriptionlabel}{\rmfamily} % forbid widows/orphans \frenchspacing \sloppy \clubpenalty=10000 \widowpenalty=10000 % http://tex.stackexchange.com/questions/304802/how-not-to-hyphenate-the-last-word-of-a-paragraph \finalhyphendemerits=10000 % given that we said footinclude=false, this should be safe \setlength{\footskip}{2\baselineskip} \title{El anarquismo y la política del resentimiento} \date{2000} \author{Saul Newman} \subtitle{} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={El anarquismo y la política del resentimiento},% pdfauthor={Saul Newman},% pdfsubject={},% pdfkeywords={Postestructuralismo; Postanarquismo; Filosofía; Anarquismo}% } \begin{document} \begin{titlepage} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge El anarquismo y la política del resentimiento\par}}% \vskip 1em \vskip 2em {\usekomafont{author}{Saul Newman\par}}% \vskip 1.5em \vfill {\usekomafont{date}{2000\par}}% \end{center} \end{titlepage} \cleardoublepage \tableofcontents % start a new right-handed page \cleardoublepage \section{Resumen} Este ensayo expone una crítica al anarquismo clásico, utilizando el concepto nietzscheano de “resentimiento” y las ideas de Michel Foucault sobre el poder. Aunque las críticas de Newman al anarquismo clásico, en su intención de definir su concepto de “post-anarquismo”, tienden a favorecer la identidad individual sobre la acción revolucionaria colectiva, tiene entre sus aspectos más importantes, la necesidad de establecer que el anarquismo es más que una simple reacción contra el Estado, y el hecho de que “nacemos en un mundo diseñado por el poder, no en un mundo ‘natural’ escindido del poder”. \begin{quote} “\emph{La palabra resentimiento puesta en el oído de los sicólogos, suponiendo por una vez que estén inclinados a estudiar seriamente el resentimiento: no se desarrolla tan bien como puesta en el oído de los anarquistas\dots{}}”\footnote{Friedrich Nietzsche, \emph{On the Genealogy of Morality}, ed. Keith Ansell-Pearson, Cambridge University Press: Cambridge, 1994, p. 52.} \end{quote} \section{Introducción} De todos los movimientos políticos del siglo XIX que denuncia Nietzsche —desde el socialismo al liberalismo— se reserva sus palabras más duras para los anarquistas. Él los llama “perros anarquistas” que deambulan por las calles de la culta Europa, son parte de lo que él califica como “manada de animales morales” que caracteriza a la política democrática moderna.\footnote{Ibid., p. 161.} Nietzsche ve al anarquismo como un veneno, y su raíz es la mala hierba del resentimiento, la política rencorosa de los débiles y miserables, la moral del esclavo. ¿Nietzsche simplemente está aquí descargando toda su ira conservadora contra los políticos anarquistas, o es el diagnóstico real de una enfermedad que ha infectado a nuestro imaginario político radical? A pesar de los prejuicios obvios de Nietzsche hacia la política libertaria, en este trabajo se tomarán en serio sus críticas hacia el anarquismo. Se estudiará la astucia de esta lógica del resentimiento en relación con la política radical, sobre todo con el anarquismo. Se tratará de desenmascarar las tensiones ocultas del resentimiento en el pensamiento político maniqueo de los anarquistas clásicos como Bakunin, Kropotkin, y Proudhon. No es mi intención subestimar al anarquismo como teoría política. Por el contrario yo sostengo que el anarquismo podría ser más relevante para las luchas políticas contemporáneas, si se hiciese consciente de la lógica de resentimiento de su propio discurso, sobre todo en las identidades esencialistas y las estructuras que lo habitan. \section{La moral del esclavo y el resentimiento} El resentimiento fue diagnosticado por Nietzsche como una característica de nuestra modernidad. Pero para poder comprender el origen del resentimiento es necesario comprender la relación entre la moral del amo y la moral del esclavo en la que se genera el resentimiento. Nietzsche en su obra “La genealogía de la moral” analiza los orígenes de la moralidad. Según Nietzsche, la manera de interpretar e imponer los valores en el mundo tiene una historia, su origen es en muchas ocasiones brutal y muy diferente de los valores que producen. El concepto de “bueno”, por ejemplo, fue creado por los nobles y la alta sociedad para ser aplicado a ellos mismos, diferente a lo común, de la clase baja y plebeya.\footnote{Ibid., p. 12.} Este fue el valor del amo —“bueno”— y opuestamente nació el valor del esclavo —“malo”—. Por lo tanto, de acuerdo con Nietzsche, esto originó un pathos de la diferencia, entre aquellos nacidos en la alta sociedad y los de origen humilde, es en medio de este paradigma de la superioridad absoluta, que los valores fueron creados.\footnote{Ibid.} Sin embargo, esta ecuación de bueno y aristocrático comenzó a ser socavada por una revuelta en la moral esclava, este cambio en la moral esclava, según Nietzsche, fue generado por los judíos quienes provocaron una verdadera reevaluación valórica. \begin{quote} «\emph{Fueron los judíos quienes, rechazando el paradigma de valores aristocráticos (bueno = noble = poderoso = bello = feliz = bendito) emprendieron con asombrosa persistencia, la lucha por un cambio radical, masticando insondablemente todo su odio (el odio a los poderosos), diciendo: “Solo los que sufren son buenos, solo los pobres, los desposeídos, los marginados son buenos, los que sufren, los necesitados, los enfermos, los feos, son los únicos piadosos, los únicos, la salvación es solo para ellos, mientras que los ricos, los nobles, los poderosos, serán eternamente malvados, crueles, codiciosos, insaciables, sin Dios, por eso serán eternamente desgraciados, maldecidos y condenados}”»\dots{}\footnote{Ibid., p. 19.} \end{quote} De esta manera, la rebelión moral de los esclavos cambio el sistema de valores impuesto por la nobleza y comenzó a equiparar la bondad con la humanidad, la debilidad y la esclavitud. Este cambio introdujo el espíritu pernicioso de la venganza y el odio en la moral. Por lo tanto, la moral, tal como la entendemos, tiene sus raíces en este espíritu de venganza de los débiles hacia el poder y los poderosos, la rebelión de los esclavos contra los amos. Fue a partir de este odio imperceptible, subterráneo, que fueron creciendo estos nuevos valores asociados con el bien, la compasión, el altruismo, la humanidad, etc. La moral política también fue contaminada por esta raíz venenosa. Para Nietzsche, los conceptos valorativos de igualdad y democracia, que son la piedra angular de la teoría revolucionaria, surgieron de la revuelta de los esclavos. Son generados por el mismo espíritu de venganza y odio hacia los poderosos. Nietzsche condena, por lo tanto, las teorías políticas como la democracia liberal, el socialismo y el anarquismo. Ve toda expresión democrática e igualitaria, como una expresión de la moral de rebaño, derivada de la inversión de los valores provocados por la cultura judeo-cristiana.\footnote{Ibid., p. 161.} El anarquismo es, para Nietzsche, producto de las costumbres democráticas más extremas. La expresión más feroz del instinto de rebaño. Su finalidad es nivelar las diferencias entre los individuos y abolir las diferencias de clase, para desterrar las jerarquías de este mundo y para igualar a los poderosos con los débiles, al rico con el pobre, al amo con el esclavo. Según Nietzsche la intención es rebajar el nivel de todos hasta un mínimo común denominador, y borrar el pathos por la distancia entre el amo y el esclavo, el sentido de la diferencia y la superioridad a través de los cuales son creados los grandes valores. Nietzsche considera que este es el peor de los excesos del nihilismo europeo, la muerte de los valores y la creatividad. La moral de los esclavos se caracteriza por una actitud de resentimiento, el resentimiento y el odio generado por la impotencia ante los poderosos. El autor de La Genealogía de la Moral, veía al resentimiento como un sentimiento completamente negativo, una actitud para negar lo que la vida afirma, diciendo “no” a lo diferente, lo que esta “fuera” o lo que es “otro”. El resentimiento se caracteriza por estar orientado hacia el exterior, en lugar del enfoque de la moral noble, que se justifica sobre sí misma.\footnote{Ibid., p. 21.} Mientras que el amo dice: “yo soy bueno”, y añade en último término, “por lo tanto x es malo”; el esclavo dice lo contrario: “Él (el amo) es malo, por lo tanto, yo soy bueno”. Así, la creación valorativa surge de la comparación o la oposición dialéctica con lo que esta fuera, los otros, los diferentes. Nietzsche dice: “\emph{\dots{}para ir determinando su moral, el esclavo primero necesita un mundo opuesto, externo, necesita, psicológicamente hablando, estímulos externos para poder constituirse a sí mismo y actuar, su acción es básicamente una reacción}”.\footnote{Ibid., pp. 21-22.} Esta postura reactiva, esta incapacidad para definir nada, excepto en oposición a otra cosa, es la actitud de resentimiento. Es la postura reactiva de los débiles que se definen por oposición a los fuertes. Los débiles necesitan de la existencia de ese enemigo externo para identificarse ellos mismos como “buenos”. Así, el esclavo toma una “venganza imaginaria” sobre el amo, ya que él no puede actuar sin la existencia de un amo al cual oponerse. El hombre resentido odia a los nobles con un intenso rencor, con un odio desbordante y celos profundamente arraigados. Este es el resentimiento, de acuerdo con Nietzsche, que ha envenenado la conciencia moderna, y encuentra su mayor expresión en las ideas de igualdad y democracia, y en las filosofías políticas revolucionarias que las promueven, como el anarquismo. ¿El anarquismo es una expresión política del resentimiento? ¿Está contaminado por un profundo odio hacia todo lo relativo al poder? Mientras que el ataque de Nietzsche hacia el anarquismo es injustificado en muchos aspectos, malicioso en exceso, y muestra además poca comprensión sobre las complejidades de la teoría anarquista, sin embargo, diría que Nietzche pudo desocultar una cierta lógica del resentimiento en el anarquismo, especialmente el pensamiento de oposición, binario, maniqueo y reduccionista. Es necesario explorar la lógica que habita en el anarquismo, para ver dónde nos lleva y en qué medida impone límites conceptuales a la política revolucionaria, y a sí mismo. \section{Anarquismo} El anarquismo es una filosofía política revolucionaria que posee una pluralidad de voces, orígenes e interpretaciones diferentes. Desde el anarquismo individualista de Stirner, al colectivismo y el anarquismo comunista de Bakunin y Kropotkin, el anarquismo es una serie de diversas filosofías y estrategias políticas. Sin embargo, todos comparten el rechazo y la critica visceral hacia la autoridad política en todas sus formas. La crítica hacia la autoridad política, la convicción de que el poder es opresor, explotador y deshumanizador, puede decirse que es el punto de vista ético-político crucial del anarquismo. Para los anarquistas clásicos, el Estado es la encarnación de todas las formas de opresión, la explotación, la esclavitud y la degradación humanas. En palabras de Bakunin, “\emph{el Estado es como un gran matadero y un enorme cementerio, donde a la sombra, y bajo el pretexto de esta abstracción (el bien común) las mejores aspiraciones y todas las fuerzas vivas de un país, son inmoladas y enterradas religiosamente}”.\footnote{Ibid., p. 207.} El Estado es el principal objetivo de la crítica libertaria hacia la autoridad. Es para ellos la mayor opresión que padece toda sociedad, y su abolición inmediata debe ser el primer acto revolucionario. Este último aspecto llevó al anarquismo del siglo XIX hacia un agudo conflicto con el marxismo. Marx creía que, si bien el Estado era en realidad un instrumento de opresión y explotación, este era un reflejo de la explotación económica y un instrumento de poder de clase. Por lo tanto el poder político se subordina al poder económico. Para Marx, no es el Estado, sino que es el poder económico el principal instrumento de opresión. El Estado rara vez tenía una existencia independiente de los intereses económicos y de clase, Debido a ello, el Estado podía ser utilizado como una herramienta de la revolución, si estaba en manos de la clase apropiada, el proletariado.\footnote{Karl Marx, ‘\emph{Critique of the Gotha Program}’, en \emph{The Marx-Engels Reader} 2nd. Ed., ed., Robert C. Tucker, W.W Norton \& Co: New York, 1978, p. 538.} El Estado solo es opresor, mutatis mutandis, porque actualmente está en manos de la burguesía. Una vez que las diferencias de clase hayan desaparecido, el Estado perderá su carácter político y opresor.\footnote{Karl Marx, ‘\emph{After the Revolution: Marx debates Bakunin}’, en \emph{The Marx-Engels Reader}, op. cit. p. 545.} Precisamente en este punto, pensadores anarquistas como Bakunin y Kropotkin no estaban de acuerdo con Marx. Para los anarquistas, el Estado es mucho más que una expresión de clase y poder económico. Más bien, el Estado tiene su propia lógica de dominación y auto perpetuación, y es autónomo de los intereses de clases. En lugar de analizar desde la sociedad hacia el Estado, como lo hizo Marx, y de ver al Estado como una consecuencia de las relaciones económicas del capitalismo y el ascenso de la burguesía, los anarquistas, en su análisis, parten desde el Estado hacia la sociedad. El Estado constituye el principio generador de la opresión social, y la explotación económica se deriva de la opresión política. En otras palabras, es la opresión política la que hace que la opresión económica sea posible.\footnote{Mikhail Bakunin, \emph{Marxism, Freedom and the State}, trans., K.J Kenafick, Freedom Press: London, 1950, p. 49.} Por otra parte, para los anarquistas, el poder de la burguesía es una consecuencia del Estado, en lugar de ser el Estado una consecuencia del poder económico de la burguesía. La clase dominante, sostiene Bakunin, es el representante y la materialización del Estado. Detrás de todas las clases dominantes de cada época se perfila el Estado. Debido a que el Estado tiene su lógica propia y autónoma nunca podrá ser utilizado como instrumento para una revolución. Esto sería desconocer su lógica de dominación. Si el Estado no se destruye de inmediato, si se utiliza como una herramienta revolucionaria como los marxistas sugieren, entonces su poder se perpetúa de una manera infinitamente más tiránica, que debería funcionar, según sostiene Bakunin, a través de una nueva clase dominante. Una clase burocrática que oprime y explota a los trabajadores de la misma manera que la clase burguesa los oprimía y explotaba a ellos.\footnote{Mikhail Bakunin, \emph{Political Philosophy: scientific anarchism}, ed., G.P Maximoff, Free Press of Glencoe, London, 1984, p. 228.} Para todo libertario, el Estado es una opresión a priori, no importa la forma que adopte. De hecho Bakunin afirma que el marxismo presta demasiada atención a las formas del poder del Estado sin tomar en cuenta suficientemente la forma en que opera el poder del Estado: “\emph{Ellos (los marxistas) no saben que el despotismo no reside tanto en la forma del Estado, sino en el principio mismo del poder estatal y político}”.\footnote{Ibid., p. 221.} La opresión y el despotismo existen en la estructura y el simbolismo del Estado, no es más que una consecuencia del poder de clase. El Estado tiene su propia lógica impersonal, su propia dinámica, sus propias prioridades: estas están, a menudo, fuera del control de la clase dominante y no reflejan necesariamente las relaciones económicas en su totalidad. De este modo, el anarquismo descubre al poder y la opresión de toda sociedad en el funcionamiento y en la estructura misma del Estado. Como una máquina de dominación abstracta, el Estado emerge en cada alteración en el poder de clases distintas, no solo en el poder de la burguesía, aparece también en el poder del proletariado. Debido a su reduccionismo economicista, el marxismo ha olvidado la autonomía y la preeminencia del Estado, un error que se demostraría empíricamente en el caso de una revolución socialista. Por lo tanto, la crítica anarquista ha desenmascarado las formas ocultas de dominación asociadas con el poder político, y expone la insuficiencia teórica del marxismo para hacer frente a este problema. Esta concepción del Estado, irónicamente, nos acerca familiarmente a Nietzsche. Al igual que los anarquistas, él ve al hombre moderno como “domesticado”, encadenado y vuelto impotente por el Estado.\footnote{Nietzsche, \emph{On the Genealogy of Morality}, op. cit., p. 61.} También, coincidiendo con los pensadores libertarios, Nietzsche ve al Estado como una máquina abstracta de dominación, que precede al capitalismo y trasciende las diferencias económicas y de clase. El Estado es un modo de dominación que impone una regulación sobre la población, internalizándose en su psiquis. Según Nietzsche, el Estado emergió como una “\emph{tiranía terrible, como una maquinaria represiva y cruel}” que subyugó, generó consenso social al mismo tiempo que sumisión a un orden y educó a la población en la obediencia al Estado.\footnote{Ibid., pp. 62-63.} Por otra parte los orígenes de este Estado son violentos. Se impone por la fuerza desde el exterior y no tiene nada que ver con los “contratos”.\footnote{Ibid., p. 63.} Nietzsche destruye la “fantasía” del contrato social. La teoría de que el Estado se formó mediante la renuncia voluntaria de los hombres a ejercer su poder a cambio de seguridad, y esta seguridad seria la función principal del Estado. Esta idea del contrato social ha sido fundamental para la teoría política liberal y conservadora, de Hobbes a Locke. Los anarquistas también rechazan esta teoría del contrato social. Ellos, como Nietzsche, sostienen que los orígenes del Estado son violentos y que es absurdo argumentar que las personas renunciaron voluntariamente a ejercer su poder. Se trata de un peligroso mito que legitima y perpetúa la dominación del Estado. \section{El contrato social} El anarquismo se basa en una concepción esencialmente optimista de la naturaleza humana: si las personas tienen una tendencia natural a llevarse bien juntas, entonces no existe la necesidad de un Estado para arbitrar entre ellas. Por el contrario, el Estado produce un efecto realmente pernicioso en las relaciones sociales que se dan naturalmente. Por lo tanto, los anarquistas rechazan las teorías políticas basadas en la idea del contrato social. La teoría del contrato social se basa en una imagen singularmente negativa de la naturaleza humana. Según Hobbes las personas son egoístas por naturaleza, agresivamente competitivas y egoístas, viviendo en un estado natural, salvaje, siempre estaban en una situación de guerra de “todos contra todos” al cual su individualismo los impulsaba, necesariamente, y a generar conflictos entre sí.\footnote{Thomas Hobbes, \emph{Leviathan}, Basil Blackwell, Oxford, 1947, p. 83.} De acuerdo con esta teoría, entonces, la sociedad en un estado de naturaleza salvaje se caracteriza por una dislocación radical: no hay ningún lazo común entre los individuos, de hecho hay un constante estado de guerra entre ellos, una constante lucha por los recursos.\footnote{Ibid., p. 82.} Con la intención de poner fin a este estado de guerra permanente, las personas se unen para formar un nuevo contrato social en el que puede haber algún tipo de autoridad establecida. Están de acuerdo en sacrificar parte de su libertad a cambio de algún tipo de orden, para que puedan perseguir sus propios fines individuales con más tranquilidad y rentabilidad. Están de acuerdo en la creación de un Estado con un mandato sobre la sociedad, que arbitrará entre voluntades en conflicto y hará cumplir la ley y el orden. La extensión de la autoridad del Estado puede variar, desde un Estado liberal, cuyo poder es supuestamente moderado por el imperio de la ley, al poder absoluto del Estado (El Leviatán) ideado por Hobbes. Mientras que los modelos pueden variar, sin embargo, los anarquistas argumentan que el resultado de esta teoría del contrato social es el mismo: una justificación para la opresión del Estado, ya sea a través del imperio de la ley o por la imposición arbitraria de la fuerza. Para los anarquistas cualquier forma de poder del Estado es una imposición de la fuerza. La teoría del contrato social es un engaño que legitima la dominación política, Bakunin la llama un “engaño indigno”.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 165.} Él expone la paradoja central de la teoría del contrato social: si, en un estado natural, las personas subsisten en un estado de salvajismo primitivo, entonces ¿Cómo pueden, repentinamente, tener la visión de unirse y crear un nuevo contrato social?\footnote{Ibid.} Si no hay un lazo común en la sociedad, no hay sociedad, no hay una esencia en los seres humanos que tienda a unirlos ¿Sobre qué base pudo formarse el contrato social? Al igual que Nietzche, los anarquistas argumentan que no existe tal acuerdo, de tal forma que el Estado se impone desde arriba, no desde abajo. El contrato social trata de desmitificar los orígenes brutales del Estado: la guerra, la conquista y la esclavitud voluntaria, en lugar de un acuerdo racional. Para Kropotkin el Estado es una interrupción violenta de, y una imposición sobre, un funcionamiento armonioso de la sociedad orgánica.\footnote{Peter Kropotkin, \emph{The State: Its Historic Role}, Freedom Press: London, 1946, p. 37.} La sociedad no tiene necesidad de un “contrato social”. Tiene su propio contrato con la naturaleza, gobernada por leyes naturales.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 166.} El anarquismo puede ser entendido como una lucha entre la autoridad natural y la autoridad artificial. Los anarquistas no rechazan toda forma de autoridad, como reza el viejo cliché que muchos repiten. Por el contrario, declaran su absoluta obediencia a la autoridad encarnada en lo que Bakunin llama “leyes naturales”\dots{} Las leyes naturales son esenciales para la existencia del hombre, de acuerdo con Bakunin, que nos recortan en la realidad, nos dan forma y determinan el mundo físico en el que vivimos.\footnote{Ibid., p. 239.} Sin embargo, esta no es una forma de esclavitud porque estas leyes no son externas al hombre: “\emph{Las leyes (naturales) no son extrínsecas en relación a nosotros, son inherentes a nosotros, constituyen nuestra naturaleza, todo nuestro ser físico, intelectual y moral}”.\footnote{Ibid.} Son, por el contrario, lo que constituye al hombre, son su esencia. El hombre es indisolublemente parte de una sociedad natural, orgánica, según Kropotkin.\footnote{Kropotkin, \emph{The State: Its Historic Role}, op. cit. p. 12.} El anarquismo, entonces, se basa en una noción específica de la esencia humana. La moral tiene su fundamento en la naturaleza humana, no en una fuente externa: “\emph{La idea de la justicia y el bien, como todo lo humano, debe tener su raíz en la animalidad misma del hombre}”.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 121.} La autoridad natural se opone implacablemente a la “autoridad artificial”. Para Bakunin la autoridad artificial significa el poder: el poder político consagrado en instituciones como el Estado, y en leyes del hombre.\footnote{Ibid., p. 212.} Este poder es externo a la naturaleza humana y se impone sobre ella. Embrutece el desarrollo de las características morales innatas de la humanidad y la capacidad intelectual. Los anarquistas argumentan que son estas capacidades las que liberan al hombre de la esclavitud y la ignorancia. Para Bakunin, entonces, las instituciones políticas son “\emph{hostiles y fatales para la libertad de las masas, porque les impone un sistema de leyes externas, y por lo tanto, despóticas}”.\footnote{Ibid., p. 240.} En esta critica de la autoridad política, el poder (autoridad artificial) es externo al sujeto humano. El sujeto humano es oprimido por este poder, pero se mantiene incontaminado, porque la subjetividad humana es una creación de un entorno natural, no es la creación de un sistema político. Así, el anarquismo se basa en una clara división maniquea, entre autoridad material y artificial, entre el poder y la subjetividad, entre el Estado y la sociedad. Además la autoridad política es fundamentalmente represiva y destructiva de la potencialidad humana. La sociedad humana, sostienen los anarquistas, no se puede desarrollar hasta que las instituciones y las leyes que lo mantienen en la ignorancia y la servidumbre, hasta que las cadenas que lo atan sean desechadas. Por lo tanto el anarquismo debe tener un lugar de resistencia: un lugar moral y racional, un lugar no contaminado por el poder que lo oprime, desde este lugar metafórico surgirá una rebelión contra el poder. Este lugar está en la esencia de la subjetividad humana. La esencia humana, con sus características morales y racionales, es una plenitud ausente que siempre está en el hombre en estado de latencia, y solo se realiza cuando, enfrentado al poder político, este es derrocado. Es desde este lugar de plenitud ausente donde surgirá la revolución contra el poder. La moralidad innata y la racionalidad del hombre van a contrarrestar al poder político, que es visto como inherentemente irracional e inmoral. De acuerdo con la teoría anarquista, la ley natural sustituirá a la autoridad política, el hombre y la sociedad sustituirán al Estado. Para Kropotkin el anarquismo puede pensar más allá del concepto de Estado, más allá del concepto de poder político absoluto, ya que tiene un lugar, un terreno en el que hacerlo. El poder político tiene una exterioridad que puede ser criticada y una alternativa con la que puede ser remplazado. Kropotkin es así capaz de imaginar una sociedad en la que el Estado ya no existe o no es necesario; una sociedad no regulada por el poder político y la autoridad, sino por los acuerdos mutuos y la cooperación.\footnote{Ibid., p. 157.} Según los anarquistas, este tipo de sociedad es posible, debido a la naturaleza esencialmente cooperativa del hombre.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 156.} A diferencia del enfoque darwinista que consiste en postular una competitividad innata en los animales, la “supervivencia del más apto”. Kropotkin encuentra una cooperación instintiva y una sociabilidad en los animales, sobre todo en los seres humanos. Este instinto fue llamado por Kropotkin “ayuda mutua”, y dice: “\emph{La ayuda mutua es el hecho predominante en la naturaleza}”.\footnote{Peter Kropotkin, \emph{Ethics: Origin \& Development}, trans., L. S Friedland, Tudor: New York, 1947, p. 14.} Kropotkin aplica estos resultados a la sociedad humana. Sostiene que el principio natural y esencial de la naturaleza humana es la ayuda mutua, y que el hombre es naturalmente cooperativo, sociable y altruista, en vez de competitivo y egoísta. Este es el principio orgánico que rige toda sociedad y es independiente de las nociones de moralidad, justicia y ética que se desarrollan después. La moral, sostiene Kropotkin, se desarrolla a partir de la necesidad instintiva a unirse en grupos, en tribus. Y una tendencia instintiva hacia la cooperación y la asistencia mutua.\footnote{Ibid., p. 45.} Esta sociabilidad natural y la capacidad de ayuda mutua son el principio que mantiene a la sociedad unida, proporcionando una base común sobre la cual puede desarrollarse la vida diaria. Por lo tanto la sociedad no tiene necesidad del Estado: que tiene sus propios mecanismos de regulación, sus propias leyes naturales. El Estado solo es dominación, envenena la sociedad y destruye sus mecanismos naturales. Es este principio de ayuda mutua que, naturalmente, sustituirá al principio de autoridad política, un estado de “anarquía” es el que existe ahora (anarquía en un sentido negativo): el poder político no impide los trastornos sociales, por el contrario, los fomenta. Lo que el Estado obstaculiza es el funcionamiento natural y armónico de la sociedad. Para Hobbes, el Estado soberano es un mal necesario. No existe una intención de hacer del Estado un fetiche: esta soberanía no desciende del cielo, no es una creación de Dios. Se trata de una soberanía pura, puro poder, y se construye debido a un vacío producido en la sociedad, para prevenir la guerra que se encuentra siempre latente en el estado natural del hombre. El contenido político del Estado no es importante, mientras funcione para sofocar disturbios en la sociedad. Si existe una democracia, o una asamblea soberana, o una monarquía, no importa. “\emph{El poder en todas sus formas, si es lo suficientemente adecuado para proteger a la sociedad, es el mismo}”.\footnote{Hobbes, \emph{Leviathan}, op. cit. p. 120.} Al igual que los anarquistas, Hobbes cree que el disfraz adoptado por el poder es irrelevante. Detrás de cada máscara existe un poder absoluto y único. El pensamiento político de Hobbes es dirigido hacia un deseo de orden, simplemente como un antídoto contra el desorden, y la forma en que los individuos sufren bajo este mismo orden es comparable con el sufrimiento causado por la guerra.\footnote{Ibid., p. 120.} Por otro lado, para los anarquistas, la sociedad se regula de acuerdo con leyes naturales, y porque hay una ética natural de la cooperación en el hombre, el Estado es un mal innecesario. En lugar de prevenir la guerra perpetua entre los hombres, el Estado la engendra: el Estado se basa en la guerra y en la conquista como modo de afirmar su existencia. El anarquismo puede mirar más allá del Estado, ya que argumenta desde una perspectiva esencial, (la sociabilidad del ser humano). Puede, por lo tanto, concebir una alternativa al Estado. Hobbes, por otro lado, no tiene ese punto de partida. No existe, según él, ninguna construcción que pueda actuar como una alternativa al Estado. La sociedad, como hemos visto en Hobbes, se caracteriza por la ruptura y el antagonismo. De hecho, no existe una sociedad en esencia, como para poder referirse a ella, es un lugar vacío. Por lo tanto, la sociedad debe ser construida artificialmente en la forma del Estado absoluto. Mientras que el anarquismo puede confiar en una ley natural, Hobbes solo puede basarse en la legislación del Estado. En el corazón del paradigma anarquista está la esencia plena de la sociedad, mientras que en el centro del paradigma hobbesiano no hay más que vacío y dislocación. \section{Maniqueísmo} Sin embargo puede argumentarse que el anarquismo es una imagen especular del hobbesianismo en el sentido de que ambos postulan una comunidad que se deriva de su deuda con la Ilustración. Ambos enfatizan la necesidad de encontrar algo que legitime a la colectividad, un punto legítimo en torno al cual la sociedad puede ser organizada. Los anarquistas ven a este punto de partida, en la ley natural que informa a la sociedad y la subjetividad humana, y que se ve impedida por el Estado. Hobbes, por otro lado, considera a este punto de partida como una ausencia, un lugar vacío que debe ser llenado por el Estado, el pensamiento de Hobbes está atrapado dentro del paradigma del Estado. El Estado es su límite conceptual, fuera de estos límites están los riesgos del estado natural. El anarquismo, porque proviene de una concepción radicalmente diferente de la sociedad y la naturaleza humana, afirma ser capaz de superar este dilema. Pero. ¿Puede? El anarquismo opera dentro de una lógica política maniquea: crea una oposición fundamental, moral, entre la sociedad y el Estado, entre la humanidad y el poder. La ley natural es un diagrama opuesto al poder artificial, la moralidad y la racionalidad inmanente a la subjetividad humana entra en conflicto con la irracionalidad y la inmoralidad del Estado. Hay una antítesis esencial entre el anarquismo que establece un punto de partida construido por una esencia y una subjetividad humana incontaminada, y el poder del Estado. Esta lógica, que establece una oposición absoluta entre dos términos, el bien y el mal, blanco y negro, la humanidad y el Estado, es una característica central del pensamiento maniqueo. Jacques Donzelot sostiene que esta lógica de la oposición absoluta es endémica en la teoría política radical. La cultura política es, entre otras cosas, la búsqueda sistemática de un antagonismo entre dos esencias, el trazado de una línea de demarcación entre los dos principios, dos niveles de realidad que se colocan fácilmente en la oposición. No existe una cultura política que no sea maniquea.\footnote{Jacques Donzelot, ‘\emph{The Poverty of Political Culture}’, \emph{Ideology \& Consciousness}, 5, 1979, 73-86, p. 74.} Por otra parte, el anarquismo, al suscribirse a esta lógica y poner al Estado en el foco de su análisis, en lugar de la economía, como hizo el marxismo, tal vez haya caído en la misma trampa reduccionista del marxismo. ¿No se ha limitado a sustituir la economía con el Estado como el mal esencial de la sociedad, del cual se derivan otros males? Como sostiene Donzelot: “\emph{cuando se asume que el capitalismo no es la fuente principal ni la única de mal sobre la tierra se apresuran a sustituir a la oposición entre el capital y el trabajo por la oposición entre el Estado y la sociedad civil. Se abandona al Capital, en su papel de chivo expiatorio y se lo sustituye por el Estado, ese monstruo frío que con su crecimiento ilimitado termina pauperizando la vida social, y el proletariado, como tal, deja su lugar a la sociedad civil, es decir, a lo que es capaz de resistir a la racionalidad ciega del Estado, a todo lo que se opone al Estado en el plano de las costumbres, en busca de otra forma de convivencia social. Buscándolos en los márgenes residuales de la sociedad y elevándolos a la condición de motor de la historia}”.\footnote{Ibid.} Oponiendo la sociedad al Estado, de la misma manera que el marxismo opuso el proletariado a la burguesía, nos sugiere que el anarquismo era incapaz de trascender las categorías políticas tradicionales que limitan al marxismo. Como Donzelot sostiene, el maniqueísmo es la lógica de las oposiciones que abarca todas las teorías: es la corriente que las atraviesa y las circunscribe. No importa si el enemigo es el Estado, o el capital, o cualquier otra cosa, siempre y cuando haya un enemigo a destruir, y un sujeto que es agredido, mientras exista la promesa de una batalla y una victoria final. La lógica maniquea, por lo tanto, es la lógica del lugar: debe haber un lugar esencial del poder y un lugar esencial de la rebelión. Esta es una lógica binaria, dialéctica que prevalece en el anarquismo: el lugar del poder —el Estado— debe ser derrocado por el sujeto humano esencial, el sujeto puro de la resistencia. El anarquismo “esencializa” el mismo poder al cual se opone. La lógica maniquea implica una operación de reflejo inverso: el lugar de la resistencia es un reflejo, a la inversa, del lugar del poder. En el caso del anarquismo, la subjetividad humana es esencialmente moral y racional, mientras que el Estado es esencialmente inmoral e irracional.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 224.} El Estado es esencial para la existencia del sujeto revolucionario, así como el sujeto revolucionario es esencial para la existencia del Estado. Uno se define en oposición al otro. La pureza de la identidad revolucionaria solo se define en contraste con la impureza del poder político. La rebelión contra el Estado siempre es impulsada por el Estado. Como Bakunin afirma: “\emph{hay algo en la naturaleza del Estado que provoca la rebelión}”.\footnote{Ibid., p. 145.} Si bien la relación entre el Estado y el sujeto revolucionario es una relación de oposición claramente definida, los dos antagonistas no podrían existir fuera de esta relación. No podrían, en otras palabras, existir el uno sin el otro. ¿Puede verse esta relación paradójica de la reflexión y la oposición como una forma de resentimiento en el sentido nietzscheano? Me atrevo a afirmar aquí que, aunque hay diferencias, la relación de la oposición maniquea entre el sujeto humano y el poder político que se encuentra en el anarquismo en general obedece a la lógica del resentimiento se ha descrito anteriormente. Esto es por dos razones. En primer lugar, como hemos visto, el resentimiento se basa en el daño moral de los débiles provocado por los poderosos — la revuelta de los ‘esclavos’ contra el ‘amo’. Podemos ver esta oposición moral al poder con claridad en el discurso anarquista, que enfrenta a la esencia “moral” y “racional” sujeto humano en contra de la cualidad esencialmente “inmoral” e “irracional” del poder político. Es evidente que la oposición del recurso retórico naturalista, opuesto a la autoridad artificial, es fundamental para el anarquismo. En segundo lugar, el resentimiento se caracteriza por la necesidad fundamental de identificarse mirando hacia fuera y en oposición a un enemigo externo. Aquí, sin embargo, la comparación con la teoría libertaria no es tan clara. Por ejemplo, alguien tal vez podría argumentar que la subjetividad y la ética anarquista —la noción de ayuda y asistencia mutua— es algo que se desarrolla de forma independiente del poder político, y que por lo tanto no necesita una relación de oposición con el Estado para definirse a sí misma. Sin embargo, me permito sugerir que, a pesar de que la subjetividad anarquista se desarrolla en un lugar “natural” del sistema que es radicalmente exterior al lugar “artificial” del sistema de poder político, es precisamente a través de esta afirmación de la exterioridad radical que surge el resentimiento. El anarquismo se suscribe a una lógica dialéctica, según la cual la especie humana surge de un estado “semi-salvaje”, y comienza a desarrollar facultades innatas morales y racionales en un sistema natural.\footnote{Ibid., p. 172.} La realización del sujeto es siempre inutilizada, diferida, postergada por el Estado. Esta dialéctica del hombre y el Estado sugiere que la identidad del sujeto se caracteriza por ser esencialmente “racional” y “moral” solo en la medida en que el desarrollo de estas cualidades y facultades innatas no sean impedidas por el Estado. Paradójicamente el Estado, que es visto por los anarquistas como un obstáculo para la plena identidad del hombre, es, al mismo tiempo, esencial para la formación de esta identidad incompleta. Sin esta opresión sofocante, el sujeto anarquista sería incapaz de verse a sí mismo como “moral” y “racional”. Su identidad es, pues, completada en ese estado de incompletud. La existencia del poder político es, por lo tanto, un medio de construcción de esta plenitud ausente. Yo diría, entonces, que el anarquismo solo puede plantear la subjetividad como “moral” y “racional” en oposición a la “inmoralidad” y la “irracionalidad” del poder político. De la misma manera la identidad del ‘esclavo’ se consolida como “bueno” oponiéndose a la identidad del “amo” que es “malo”. Nietzsche ve en esta actitud un excelente ejemplo de resentimiento. Por lo tanto el maniqueísmo que habita el discurso anarquista es producto de una lógica del resentimiento que para Nietzsche es una visión claramente insalubre, que emana de una posición de debilidad y enfermedad. La identidad revolucionaria en la filosofía anarquista se constituye a través de su oposición esencial al poder. Al igual que el hombre reactivo de Nietzsche, la identidad revolucionaria pretende ser impoluta e incorruptible frente al poder: la esencia humana es vista como moral, donde el poder es inmoral, natural, donde el poder es artificial, pura, donde el poder es impuro. Debido a que esta subjetividad se constituye en un sistema de ley natural —a diferencia de la ley artificial— es significativo que, al mismo tiempo que oprimida por el poder, sigue siendo ajena al poder y no contaminada por él. ¿Pero esto es así? Bakunin arroja algunas dudas sobre esto cuando habla del principio del poder. La ambición de poder es un elemento natural que Bakunin lo considera como innato en cada individuo: “\emph{Todo hombre lleva dentro de sí el germen de la ambición de poder, y el germen de todos, como se sabe, debido a una ley básica de la vida, necesariamente debe desarrollarse y crecer}”.\footnote{Ibid., p. 248.} El principio del poder significa que el hombre no puede confiarse del poder, que siempre va a existir este deseo de poder en el corazón de la subjetividad humana. Mientras que Bakunin tiene la intención de advertir a otros del peligro inherente a la corrupción del poder, tal vez inconscientemente ha expuesto la contradicción oculta que se encuentra en el corazón del discurso anarquista: a saber, que, mientras que en las bases del anarquismo la noción de una subjetividad humana esencial, no contaminada por el poder, es en última instancia, imposible. La identidad revolucionaria pura es desgarrada, subvertida por un “\emph{natural}” deseo de poder, la falta está en el corazón de cada individuo. Bakunin sugiere que este deseo de poder es una parte esencial de la subjetividad humana. Tal vez la implicación del principio del poder de Bakunin es que el sujeto siempre tendrá un deseo de poder, y que ese sujeto siempre será incompleto hasta que se aferra el poder. Kropotkin, también, habla sobre el deseo de poder y autoridad. Sostiene que el surgimiento del Estado moderno se puede atribuir en parte al hecho de que “\emph{los hombres se enamoraron de la autoridad}”.\footnote{Kropotkin, \emph{The State: Its Historic Role}, op. cit. p. 28.} Se supone, entonces, que el poder del Estado no es del todo una imposición desde arriba. Él habla de la auto-esclavitud a la ley y la autoridad: “\emph{El hombre se dejó esclavizar mucho más por su deseo de ‘castigar conforme a la ley’ que mediante la conquista militar directa}”\footnote{Ibid., p. 17.} ¿El deseo de “castigar conforme a la ley” brota directamente del sentido natural de la humanidad y de una moralidad social? ¿Si este es el caso, puede verse todavía una esencia humana no contaminada por el poder? Mientras que aun el anarquismo es una noción de subjetividad no totalmente socavada por esta contradicción, sin embargo es desestabilizado por ella: es ambigua e incompleta. Nos obliga a formularnos la pregunta sobre la idea del anarquismo de una revolución contra el poder de la humanidad: si los seres humanos tienen un deseo fundamental y natural hacia el poder, entonces ¿Cómo puede uno estar seguro de que una revolución destinada a destruir el poder no se convertirá en una revolución destinada a tomar el poder? \section{Voluntad de poder} ¿El anarquismo, como una teoría política y social de la revolución, ha sido invalidado debido a las contradicciones en su concepción de la subjetividad humana? No lo creo. Por otra parte, se me ha puesto de manifiesto claramente una tensión oculta de resentimiento en las categorías esencialistas, y las estructuras de oposición que habitan en el discurso anarquista — en las nociones de una sociedad armoniosa gobernada por la ley natural y la esencia comunalista del hombre, y su oposición a la ley artificial del Estado. Sin embargo yo diría que el anarquismo, si es que puede liberarse de estas categorías esencialistas y maniqueas, puede superar el resentimiento que lo envenena y lo limita. El anarquismo clásico desarrolla una política de resentimiento, ya que trata de superar al poder. Ve al poder como algo malo y destructivo, que embrutece la plena realización del individuo. La esencia humana es un punto de partida no contaminado por el poder, a partir de esta esencialidad el poder es resistido. No es, como he argumentado, una separación maniquea estricta esta oposición entre el sujeto y el poder. Sin embargo, yo pienso que esta separación entre el individuo y el poder es en sí misma inestable y está constantemente amenazada por un “natural” deseo de poder — el principio del poder. Nietzsche diría que este deseo de poder —la voluntad de poder— es de hecho “natural”, y es la supresión de este deseo que ha tenido un efecto debilitador sobre el hombre, volviéndosele en contra de sí mismo y produciendo una actitud de resentimiento. Sin embargo, tal vez se podría argumentar que este deseo de poder en el hombre se produce precisamente a través de los intentos de negar o extinguir las relaciones de poder en el “orden natural”. Tal vez el poder puede ser visto en términos de lo Real Lacaniano — como la falta incontenible que no puede ser simbolizada, y que siempre vuelve a rondar el orden simbólico, que imposibilitó cualquier intento por parte del sujeto para formar una identidad completa. Para Jacques Lacan: “\emph{\dots{} lo real es lo que siempre vuelve al mismo lugar — al lugar donde el sujeto en tanto ser pensante, en tanto res cogitans, no se encuentra a sí mismo}”.\footnote{Ibid., p. 49.} El anarquismo intenta completar la identidad del sujeto mediante la separación del poder, en un sentido absolutamente maniqueo, frente al mundo del poder. El sujeto anarquista, como hemos visto, es constituido en un sistema “natural” que es dialécticamente opuesto al mundo artificial del poder. Por otra parte, porque el sujeto se constituye en un sistema “natural” regido por leyes éticas de la cooperación mutua, los anarquistas son capaces de plantear una sociedad libre de relaciones de poder, que sustituirá al Estado una vez que sea derrocado. Sin embargo, como hemos visto, este mundo libre del poder se ve amenazado por el deseo de poder latente en cada individuo. Cuanto más el anarquismo trata de establecer una sociedad libre de relaciones de poder, más aun sigue siendo, paradójicamente, atrapado en el poder. Aquí el poder ha regresado como lo real que obsesiona a todos los intentos para liberar al mundo del poder. Cuanto más se intenta reprimir el poder, él más obstinadamente levanta su cabeza. Esto se debe a los intentos de negar el poder, a través de concepciones esencialistas de lo “natural” de las leyes y la moral “natural”, constituyen en sí mismas el poder, o al menos están condicionadas por las relaciones de poder. Estas identidades esencialistas y las categorías no pueden ser impuestas sin la exclusión radical de otras identidades. Esta exclusión es un acto de poder. Si se intenta excluir radicalmente el poder, como hicieron los anarquistas, el poder “retornará”, precisamente, en el interior de las mismas estructuras de exclusión de sí mismo. Nietzsche cree que este intento de excluir y negar al poder es una forma de resentimiento. Entonces, ¿cómo puede el anarquismo superar este resentimiento que ha demostrado ser tan autodestructivo y negador de la vida? Positivamente en la afirmación del poder, en lugar de negarlo — “decir sí” al poder, como Nietzsche lo diría. Es solo mediante la afirmación del poder, mediante el reconocimiento de que nacemos en el mundo del poder, somos poder, no nacemos en un mundo «natural» alejado del poder, y nunca podemos estar completamente libres de estas relaciones de poder, que uno puede participar en política — usando las estrategias pertinentes de la resistencia contra el poder. Esto no significa, por supuesto, que el anarquismo debe deponer las armas y aceptar el Estado y la autoridad política. Por el contrario, el anarquismo puede ser más eficaz contra la dominación política mediante la participación en diversas estrategias de poder, en lugar de negarlo literalmente. Quizás resulta adecuado distinguir entre las relaciones de poder y las relaciones de dominación. Para usar la definición de Michel Foucault, el poder es un “\emph{modo de acción sobre la acción de otros}”.\footnote{Michel Foucault, ‘\emph{The Subject and Power}’, en Hubert L. Dreyfus y Paul Rabinow, Harvester Press: Brighton, \emph{Michel Foucault: Beyond Structuralism and Hermeneutics}, 1982, p. 221.} El poder es solo el efecto de una determinada acción sobre la acción de otro. Nietzsche también ve el poder en términos de un efecto sin sujeto: “\emph{\dots{} no hay ningún ser detrás del acto, su efecto y lo que se genera luego ese efecto, ‘el hacedor’ es inventado posteriormente}”.\footnote{Nietzsche, \emph{On the Genealogy of Morality}, op. cit. p. 28.} El poder no es una mercancía que puede ser poseída, y no puede estar cosificado en la institución o el sujeto. Se trata simplemente de una relación de fuerzas, las fuerzas que fluyen entre los diferentes actores y en nuestras acciones diarias. Según Foucault, el poder está en todas partes.\footnote{Michel Foucault, \emph{The History of Sexuality VI: Introduction}, trans., R. Hunter, Vintage Books: New York, 1978, p. 93.} El poder no emana de las instituciones como el Estado, sino que es inmanente a lo largo de toda la red social, a través de diferentes discursos y saberes. Por ejemplo, los discursos racionales y morales, que los anarquistas creían inocentes y alejados del poder, y como armas en la lucha contra el poder, están constituidos por relaciones de poder y están involucrados en prácticas de poder: “\emph{El poder y el conocimiento se implican directamente entre sí}”.\footnote{Michel Foucault, \emph{Discipline and Punish: the Birth of the Prison}, trans., Alan Sheridan, Penguin Books: London, 1991, p. 27.} El poder en este sentido es productivo más que represivo. Por tanto, es absurdo e imposible tratar de construir, como pensaban los anarquistas clásicos, un mundo fuera del poder. Nunca estaremos del todo libres de las relaciones de poder. Estoy de acuerdo entonces, con Foucault, cuando decía: “\emph{A mí me parece que\dots{} uno nunca está fuera (del poder), que no hay margen para aquellos que apuestan a romper con el sistema de poder}”.\footnote{Michel Foucault, ‘\emph{Power and Strategies}’, en \emph{Power\Slash{}Knowledge: selected interviews and other writings} 1972-77, ed., Colin Gordon, Harvester Press: New York, 1980, p. 141.} Sin embargo, solo porque uno nunca pueda estar libre del poder, no significa que uno nunca pueda estar libre de la dominación. La dominación debe distinguirse del poder en el siguiente sentido. Para Foucault, las relaciones de poder se convierten en relaciones de dominación, cuando el flujo libre e inestable de las relaciones de poder se bloquea y terminan cristalizándose — cuando forman desigualdad y jerarquías, y ya no permiten que las relaciones se den en un plano de reciprocidad.\footnote{Michel Foucault, ‘\emph{The Ethic of Care for the Self as a Practice of Freedom}’, \emph{The Final Foucault}, ed., J. Bernauer and D. Rasmussen, MIT Press: Cambridge, Mass, 1988, p. 3.} Estas relaciones de dominación forman la base de instituciones tales como el Estado. El Estado, según Foucault, no es más que un conjunto de relaciones de poder diferentes que se han cristalizado de esta manera. Esta es una manera radicalmente diferente de ver las instituciones como el Estado. Mientras que los anarquistas ven el poder como de origen estatal, Foucault ve el Estado como emanación del poder. El Estado, en otras palabras, no es más que un efecto de relaciones de poder que se han cristalizado en las relaciones de dominación. ¿Cuál es el propósito de esta distinción entre el poder y la dominación? ¿No nos traen de vuelta a la posición anarquista original de que la sociedad y nuestras acciones cotidianas, a pesar de estar oprimidas por el poder, son ontológicamente separadas de él? En otras palabras, ¿por qué no se limita a llamarle “poder” a la dominación, de nuevo, y volver a la distinción original, maniquea, entre la vida social y el poder? Sin embargo, el objetivo de esta distinción es para demostrar que esta separación esencial es ahora imposible. La dominación —las instituciones políticas opresivas como el Estado— ahora provienen del mismo mundo del poder. En otras palabras, se interrumpe la estricta separación maniquea de la sociedad y el poder. La política radical y de hecho el anarquismo en general, no puede permanecer en esta cómoda ilusión de que nosotros, como sujetos políticos, no somos de alguna manera cómplices de este régimen que nos oprime. De acuerdo con la definición foucaultiana de poder que he empleado, todos somos potencialmente cómplices, a través de nuestras acciones diarias, en las relaciones de dominación. Nuestras acciones diarias, las que inevitablemente implican poder, son inestables y pueden integrar y generar las relaciones que nos dominan. Nuestra subjetividad política, nunca puede relajarse y ocultarse detrás de las identidades esencialistas y las estructuras maniqueas — detrás de una estricta separación del mundo del poder. Más bien debemos estar constantemente en guardia contra la posibilidad de dominación. Foucault dice: “\emph{Mi punto de vista no es que todo es malo, sino que todo es peligroso\dots{} Si todo es peligroso, siempre tendremos algo que hacer para que nuestra posición no conduzca a la apatía, sino a un hiper —y pesimista— activismo}”.\footnote{Michel Foucault, ‘\emph{On the Genealogy of Ethics}’, \emph{The Foucault Reader}, ed., Paul Rabinow, Pantheon Books: New York, 1984, p. 343.} Con el fin de resistir a la dominación, debemos ser conscientes de sus riesgos — de la posibilidad de que nuestras propias acciones, incluso las acciones políticas ostensibles contra la dominación, pueden dar lugar a una nueva dominación. Siempre existe la posibilidad, entonces, de impugnar la dominación, y de reducir al mínimo sus posibilidades y sus efectos. Según Foucault, la dominación es inestable y puede dejar lugar para encontrar resquicios y generar una resistencia efectiva. Instituciones como el Estado se fundamentan en unas relaciones de poder inestables que pueden fácilmente volverse en contra de las bases que sustentan a esta institución. Así que siempre existe la posibilidad de resistencia contra la dominación. Sin embargo esta resistencia no puede terminar en una especie de revolución — una gran superación dialéctica del poder, como los anarquistas defendían. La abolición de las instituciones centrales como el Estado, de un solo golpe, sería descuidar las relaciones multiformes y difusas del poder que se basan en la dominación, permitiendo así que se regeneren nuevas instituciones y relaciones de dominación. Sería caer en la misma trampa reduccionista del marxismo, y en el terreno de la dominación. Por el contrario, la resistencia debe tomar la forma de lo que Foucault llama \emph{agonismo} —una dialéctica permanente y estratégica con el poder— sobre la base de la incitación y la provocación mutua — sin ninguna esperanza final de que podamos liberarnos totalmente de él.\footnote{Foucault, \emph{History of Sexuality}, op. cit. p. 96.} No se puede, como ya he dicho, tener la esperanza de vencer el poder completamente — porque cada superación es, en sí, la imposición de otro régimen de poder. Lo mejor que puede esperarse es una reorganización de las relaciones de poder —a través de la lucha y la resistencia— de manera que sean menos opresivas y dominantes. La dominación, por lo tanto, puede ser minimizada mediante el reconocimiento de nuestra inevitable implicación con el poder, no por tratar de ponernos fuera del mundo del poder. La idea clásica de la revolución como un proceso dialéctico para derrocar el poder —la imagen que ha perseguido el imaginario político radical— se debe abandonar. Debemos reconocer el hecho de que el poder nunca puede ser superado por completo, y debemos afirmar esto trabajando dentro de este mundo, procurando una readecuación de nuestra posición para mejorar nuestras posibilidades de libertad. Esta definición de poder que hemos construido —como una relación inestable, fluida y dispersa en la red social— puede ser vista como una noción de no-resentimiento hacia el poder. Socava la política de oposición, maniquea, del resentimiento porque el poder no puede ser externalizado en forma de Estado o de una institución política. No puede haber un enemigo externo para que nos defina por oposición y descargar toda nuestra ira en su contra. Porque rompe con la distinción de Apolo entre el sujeto y el poder central en el anarquismo clásico y en la maniquea filosofía política radical. El hombre apolíneo, el sujeto humano fundamental, está siempre obsesionado por el poder dionisíaco. Apolo no solo es el dios de la luz, sino también es el dios de la ilusión: que “\emph{concede descanso a los seres individuales\dots{} por trazar las fronteras que rodean y limitan al ser humano}” Dionisio, por otro lado es la fuerza que a veces destruye estos “pequeños círculos”, interrumpiendo la tendencia apolínea a “\emph{congelar la forma egipcia de la rigidez y la frialdad}”.\footnote{Friedrich Nietzsche, \emph{Birth of Tragedy, in Basic Writings}, trans., Walter Kaufmann, Modern Library: New York, 1968, p. 72.} Detrás de la ilusión apolínea de la vida en el mundo sin poder, está lo dionisiaco, la “realidad” del poder que arranca el “velo de maya”.\footnote{Véase Allan Megill, \emph{Prophets of Extremity: Nietzsche, Heidegger, Foucault, Derrida}, University of California Press: Berkeley, 1985, p. 39.} En lugar de tener un enemigo externo —como el Estado— en oposición al cual se forma la identidad política, tenemos que trabajar en nosotros mismos. Como sujetos políticos tenemos que superar el resentimiento por la transformación de nuestra relación con el poder. Uno solo puede hacer esto, según lo manifestaba Nietzsche, a través de eterno retorno. Para afirmar el eterno retorno es necesario reconocer y afirmar de manera positiva el hecho continuo del “retorno” de la vida misma, con su dura realidad. Debido a que esta es una voluntad activa de nihilismo, es al mismo tiempo una trascendencia del nihilismo. Tal vez de la misma manera, el eterno retorno se refiere al poder. Debemos reconocer y expresar el “retorno” del poder, el hecho de que siempre estará con nosotros. Para superar el resentimiento, debemos, en otras palabras, procurar el poder. Debemos afirmar una voluntad de poder — “\emph{\dots{} Según Nietzsche: en la forma de creación, de afirmación de los valores de la vida.\footnote{Nietzsche, \emph{On the Genealogy of Morality}, op. cit. pp. 55-56.} Esto es aceptar la idea de la auto-superación”\footnote{Véase Friedrich Nietzsche, \emph{Thus Spoke Zarathustra}, trans., R.J Hollingdale, Penguin: London, 1969, pp. 28-29.} de superarse “a sí mismo}”, en este sentido, significaría la superación de las identidades esencialistas y las categorías que nos limitan. Como Foucault ha demostrado, que se construyen como sujetos políticos esenciales de manera que nos dominan—. Esto es lo que él llama subjetivación.\footnote{Foucault, ‘\emph{The Subject and Power}’, op. cit. p. 212.} Nos escondemos detrás de identidades esencialistas que niegan el poder, y producimos a través de esta negación, una política maniquea de la oposición absoluta que solo se refleja y reafirma en la dominación que dice combatir. Esto lo hemos visto, por ejemplo, en el anarquismo. Con el fin de evitar esta lógica maniquea, el anarquismo ya no debe depender de identidades y conceptos esencialistas, y en su lugar debe afirmar positivamente el eterno retorno del poder. Esta no es una consecuencia lamentable, sino más bien un “positivismo feliz”. Se caracteriza por estrategias políticas destinadas a minimizar las posibilidades de dominación, y en el aumento de las posibilidades de la libertad. Si se rechazan estas identidades esencialistas, ¿qué es lo que nos queda? ¿Se puede tener una idea de la política radical y la resistencia sin un fundamento esencial? Uno podría, sin embargo, formular la pregunta opuesta: ¿cómo una política radical puede continuar sin ‘superar’ las identidades esencialistas, sin que, en términos de Nietzsche, el hombre pueda “superar” al hombre? Nietzsche dice: “\emph{Las personas más cautelosas preguntan hoy: «¿Cómo el hombre puede ser preservado?» Zaratustra, sin embargo, es el primero en proclamar y preguntar: «¿Cómo el hombre puede ser superado?»}”.\footnote{Nietzsche, \emph{Thus Spoke Zarathustra}, op. cit. p. 297.} Yo diría que el anarquismo se incrementará notablemente como una filosofía política y ética si logra evitar categorías esenciales, dejándose a sí mismo abierto a las diferentes identidades y contingencias — un post-anarquismo. Para afirmar la diferencia y la contingencia sería conveniente convertirse en una filosofía de los fuertes, en lugar de filosofía de los débiles. Nietzsche nos exhorta a “vivir peligrosamente”, para acabar con certezas, a romper con esencias y estructuras, y abrazar la incertidumbre. “\emph{¡Construye tu ciudad en las faldas del Vesubio! ¡Envía tus barcos a los mares inexplorados!}”.\footnote{Friedrich Nietzsche, \emph{The Gay Science}, trans., Walter Kaufmann, Vintage: New York, p. 228.} La política de la resistencia contra la dominación debe tener lugar en un mundo sin garantías. Permanecer abierta a la diferencia y a la contingencia, para afirmar el eterno retorno del poder, sería convertirse en lo que Nietzsche llama el Superhombre. El Superhombre es el hombre que se supera a sí mismo la superación del hombre: “\emph{Dios ha muerto: ahora queremos que el Superhombre viva}”.\footnote{Nietzsche, \emph{Thus Spoke Zarathustra}, op. cit. p. 297.} Para Nietzsche el Superhombre sustituye a Dios y al hombre — él viene a redimir a una humanidad paralizada por el nihilismo, afirma con alegría el poder y el eterno retorno. Sin embargo, me gustaría proponer algo un poco más modesto, la versión más irónica del Superhombre de la política radical. Ernesto Laclau habla de “\emph{un héroe de un nuevo tipo que aún no ha sido creado por nuestra cultura, pero cuya creación es absolutamente necesaria si va a vivir en un tiempo emocionante, de acuerdo a sus posibilidades más radicales}”.\footnote{Ernesto Laclau, ‘\emph{Community and Its Paradoxes: Richard Rorty’s “Liberal Utopia”}’ en \emph{Emancipations}, ed., Ernesto Laclau, Verso: London, 1996, 105-123, p. 123.} Quizás el anarquismo podría convertirse en una nueva filosofía de la heroicidad, que ya no es reactiva, sino más bien, creadora de valores. Por ejemplo, la ética del cuidado mutuo y la asistencia propuesta por Kropotkin, tal vez podría ser utilizada en la construcción de nuevas formas de acción colectiva y de identidad. Kropotkin propiciaba el desarrollo de grupos colectivos basados en la cooperación — sindicatos, asociaciones de todo tipo, sociedades de socorros mutuos, clubes, etc.\footnote{Peter Kroptokin, \emph{Mutual Aid: A Factor of Evolution}, Penguin Books Ltd.: London, 1939, p. 210.} Como hemos visto, creía que este sería el desarrollo de un principio natural esencial. Sin embargo, quizás se podría desarrollar este impulso colectivista, sin circunscribirlo en ideas esencialistas sobre la naturaleza humana. No es necesario postular un principio de la esencia humana que justifique la acción colectiva. Más bien es la contingencia de la identidad —su apertura a la diferencia, a la singularidad, la individualidad y la colectividad— que es en sí misma ética. Por lo tanto la ética anarquista de la ayuda mutua se puede tomar de sus fundamentos esencialistas y aplicarla a una ética no esencialista, una idea constitutivamente abierta de una identidad política colectiva. Una concepción alternativa de la acción colectiva puede, por ejemplo, desarrollarse a partir de una rearticulación de la relación entre igualdad y libertad. Es un gran crédito para el anarquismo su rechazo a la convicción liberal de que la igualdad y la libertad de actuar se limitan entre sí y son conceptos irreconciliables. Para los anarquistas, la igualdad y la libertad están íntimamente relacionadas con los impulsos, y no se puede concebir la igualdad sin la libertad. Para Bakunin: “\emph{Yo soy libre solo cuando todos los seres humanos que me rodean —hombres y mujeres— son igualmente libres. La libertad de los demás, lejos de limitar o negar mi libertad, es, por el contrario, su condición necesaria y su confirmación. Yo soy libre en el verdadero sentido solo en virtud de la libertad de los otros, tanto es así que cuanto mayor sea el número de personas libres que me rodean, más profunda, mayor y más amplia su libertad, más profunda y más grande se vuelve mi libertad}”.\footnote{Bakunin, \emph{Political Philosophy}, op. cit. p. 267.} La interrelación de la igualdad y la libertad puede ser la base de un nuevo ethos colectivo, que se niega a ver la libertad individual y la igualdad de colectivos como los límites a los demás — que se niega a sacrificar la diferencia en el nombre de la universalidad y la universalidad en nombre de la diferencia. La ética anti-estratégica de Foucault puede ser vista como un ejemplo de esta idea. En su defensa de los movimientos colectivos, como la revolución iraní, Foucault dice que la ética anti-estratégica que adopta es “\emph{ser respetuosos cuando surge algo singular, ser intransigentes cuando el poder atenta contra lo universal}”.\footnote{Michel Foucault, \emph{Is It Useless To Revolt?}, \emph{Philosophy and Social Criticism 8}[1] (1981), pp. 1-9, p. 9.} Este enfoque anti-estratégico condena al universalismo cuando se torna desdeñoso de lo particular, y condena el particularismo cuando se impone a costa de lo universal. Del mismo modo, una nueva ética de la acción colectiva sería condenar a la colectividad cuando se manifiesta a expensas de la diferencia y la singularidad, y condenar a la diferencia cuando esta se da a costa de la colectividad. Es un método que permite combinar las diferencias individuales y la igualdad colectiva de una manera que no es dialéctica, pero que conserva un cierto antagonismo positivo y vital entre ellos. Esto implicaría una noción de respeto a la diferencia, sin menoscabo de la libertad de los demás a ser diferentes — la igualdad de la libertad de la diferencia. La acción colectiva del post-anarquista, en otras palabras, se basa en el compromiso de respetar y reconocer la autonomía, la diferencia y la transparencia en la colectividad. Por otra parte, tal vez uno podría considerar una forma de comunidad política o identidad colectiva que no restrinja la diferencia. La preocupación por la comunidad es fundamental para la política radical, incluyendo el anarquismo. No se puede hablar de una acción colectiva sin por lo menos plantear la problemática de la comunidad. Para Nietzsche, las aspiraciones modernas más radicales hacia la comunidad son una manifestación de la mentalidad de ‘manada’. Sin embargo, se podría construir un concepto de una comunidad libre de resentimiento, desde el concepto de poder de Nietzsche. Para Nietzsche, la potencia activa es la descarga instintiva del individuo de sus fuerzas y capacidades que le producen una sensación de superación personal desde su propia capacidad, mientras que la potencia reactiva, como hemos visto, necesita de un objeto externo para actuar y definirse a sí misma en oposición a él.\footnote{Véase Paul Patton ‘\emph{Power in Hobbes and Nietzsche}’, \emph{Nietzsche, Feminism \& Political Theory}, ed., Paul Patton, Allen \& Unwin: Australia, 1993, p. 152.} Tal vez se podría imaginar una forma de comunidad basada en la potencia activa. Para Nietzsche la mayor sensación de poder puede ser derivada de la asistencia y la benevolencia hacia los demás, a partir de la mejora de la sensación de poder de los demás.\footnote{Ibid., p. 156.} Al igual que la ética de ayuda mutua, una comunidad basada en la voluntad de poder puede estar compuesta por una serie de relaciones intersubjetivas que incentivan a ayudar y cuidar a las personas sin dominarlas y negar la diferencia. Esta apertura a la diferencia y la auto-transformación, y la ética del cuidado, pueden ser las características definitorias de la comunidad del post-anarquismo democrático. Esta sería una comunidad de la potencia activa. Una comunidad de “maestros”, en vez de “esclavos”.\footnote{Ibid., p. 154.} Sería una comunidad que busca superarse a sí misma — continuamente transformándose y deleitándose con el conocimiento de su poder para hacerlo. El post-anarquismo puede ser visto, entonces, como una serie de estrategias político-éticas contra la dominación, sin garantías esencialistas y las estructuras maniqueas que condicionan y restringen al anarquismo clásico. Se podría afirmar la contingencia de los valores e identidades, incluidas las propias, y afirmar, en lugar de negar, la voluntad de poder. Sería, en otras palabras, un anarquismo sin resentimiento. % begin final page \clearpage % if we are on an odd page, add another one, otherwise when imposing % the page would be odd on an even one. \ifthispageodd{\strut\thispagestyle{empty}\clearpage}{} % new page for the colophon \thispagestyle{empty} \begin{center} Biblioteca anarquista \smallskip Anti-Copyright \bigskip \includegraphics[width=0.25\textwidth]{logo-en} \bigskip \end{center} \strut \vfill \begin{center} Saul Newman El anarquismo y la política del resentimiento 2000 \bigskip Recuperado el 13 de septiembre de 2016 desde \href{https://elnoografo.wordpress.com/2012/12/12/saul-newman-el-anarquismo-y-la-politica-del-resentimiento}{https:\Slash{}\Slash{}elnoografo.wordpress.com} Título original: \emph{Anarchism and the Politics of Ressentiment}. Traducido por Sergio Puértolas para PARRHESIA. \bigskip \textbf{es.theanarchistlibrary.org} \end{center} % end final page with colophon \end{document}

https://authorea.com/users/374308/articles/491873/download_latex

authorea.com

CC-MAIN-2021-31

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-31/segments/1627046151760.94/warc/CC-MAIN-20210725174608-20210725204608-00392.warc.gz

\documentclass[10pt]{article} \usepackage{fullpage} \usepackage{setspace} \usepackage{parskip} \usepackage{titlesec} \usepackage[section]{placeins} \usepackage{xcolor} \usepackage{breakcites} \usepackage{lineno} \usepackage{hyphenat} \PassOptionsToPackage{hyphens}{url} \usepackage[colorlinks = true, linkcolor = blue, urlcolor = blue, citecolor = blue, anchorcolor = blue]{hyperref} \usepackage{etoolbox} \makeatletter \patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{% \errmessage{\noexpand\@combinedblfloats could not be patched}% }% \makeatother \usepackage{natbib} \renewenvironment{abstract} {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize} {\bigskip} \titlespacing{\section}{0pt}{*3}{*1} \titlespacing{\subsection}{0pt}{*2}{*0.5} \titlespacing{\subsubsection}{0pt}{*1.5}{0pt} \usepackage{authblk} \usepackage{graphicx} \usepackage[space]{grffile} \usepackage{latexsym} \usepackage{textcomp} \usepackage{longtable} \usepackage{tabulary} \usepackage{booktabs,array,multirow} \usepackage{amsfonts,amsmath,amssymb} \providecommand\citet{\cite} \providecommand\citep{\cite} \providecommand\citealt{\cite} % You can conditionalize code for latexml or normal latex using this. \newif\iflatexml\latexmlfalse \providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}% \AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{float} \begin{document} \title{High-throughput CRISPR-mediated 3D enrichment platform for functional interrogation of chemotherapeutic resistance} \author[1]{Taraka Sai Pavan Grandhi}% \author[2]{Jeremy To}% \author[2]{Angelica Mendiola}% \author[2]{Fabio Luna}% \author[2]{Whitney Barnes}% \author[2]{John Walker}% \author[2]{Rita Moran}% \author[2]{Robbin Newlin}% \author[2]{Loren Miraglia}% \author[2]{Anthony Orth}% \author[2]{Shane Horman}% \affil[1]{Arizona State University}% \affil[2]{Genomics Institute of the Novartis Research Foundation}% \vspace{-1em} \date{\today} \begingroup \let\center\flushleft \let\endcenter\endflushleft \maketitle \endgroup \selectlanguage{english} \begin{abstract} Cancer is a disease of somatic mutations. These cellular mutations compete to dominate their microenvironment and dictate the disease outcome. While a therapeutic approach to target specific driver mutations helps to manage the disease, subsequent molecular evolution of tumor cells threatens to overtake therapeutic progress. There is need for rapid, high-throughput, unbiased in-vitro discovery screening platforms that capture the native complexities of the tumor and rapidly identifiy mutations that confer chemotherapeutic drug resistance.Taking the example of CDK4/6 inhibitor (CDK4/6i) class of drugs, we show that the pooled in-vitro CRISPR screening platform enables rapid discovery of drug resistance mutations in a 3D setting. Gene edited cancer cell clones assembled into an organotypic multicellular tumor spheroid (MCTS), exposed to CDK4/6i caused selection and enrichment of the most drug resistant phenotype in a 3D setting, detectable by next gen sequencing after a span of 28 days. The platform was sufficiently sensitive to enrich for even a single drug resistant cell within a large, 2500-cell, drug-responsive complex 3D tumor spheroid. The genome-wide 3D CRISPR-mediated knockout screen (\textgreater{}18,000 genes) identified several genes whose disruptions conferred resistance to CDK4/6i. Further, multiple novel candidate genes were identified as top hits only in the microphysiological 3D enrichment assay platform and not the conventional 2D assays. Taken together, these findings suggest that including phenotypic 3D resistance profiling in decision trees could improve discovery and reconfirmation of drug resistance mechanisms and afford a platform for exploring non-cell autonomous interactions, selection pressures, and clonal competition.% \end{abstract}% \sloppy \textbf{Hosted file} \verb`SH_High throughput CRISPR mediated 3D enrichment platform for anti-cancer drug resistance discovery.pdf` available at \url{https://authorea.com/users/374308/articles/491873-high-throughput-crispr-mediated-3d-enrichment-platform-for-functional-interrogation-of-chemotherapeutic-resistance}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Fig1/Fig1} \end{center} \end{figure}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Fig2/Fig2} \end{center} \end{figure} \textbf{Hosted file} \verb`Fig3.pdf` available at \url{https://authorea.com/users/374308/articles/491873-high-throughput-crispr-mediated-3d-enrichment-platform-for-functional-interrogation-of-chemotherapeutic-resistance} \textbf{Hosted file} \verb`Fig4.pdf` available at \url{https://authorea.com/users/374308/articles/491873-high-throughput-crispr-mediated-3d-enrichment-platform-for-functional-interrogation-of-chemotherapeutic-resistance}\selectlanguage{english} \begin{figure}[H] \begin{center} \includegraphics[width=0.70\columnwidth]{figures/Fig5/Fig5} \end{center} \end{figure} \selectlanguage{english} \FloatBarrier \end{document}

https://people.maths.bris.ac.uk/~matyd/GroupNames/1/S3_char.tex

bris.ac.uk

CC-MAIN-2021-49

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-49/segments/1637964363420.81/warc/CC-MAIN-20211207232140-20211208022140-00637.warc.gz

\documentclass[11pt]{amsart} \begin{document} \begin{table} $$ \begin{array}{c|rrr} \rm class&\rm1&\rm2&\rm3\cr \rm size&1&3&2\cr \hline \rho_{1}&1&1&1\cr \rho_{2}&1&-1&1\cr \rho_{3}&2&0&-1\cr \end{array} $$ \caption{Character table of $S_3$} \end{table} \end{document}

https://melusine.eu.org/syracuse/B/BaseCollege/Quatrieme/equa/resol/exo20.tex?enregistrement=ok

eu.org

CC-MAIN-2020-29

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2020-29/segments/1593657155816.86/warc/CC-MAIN-20200715035109-20200715065109-00199.warc.gz

%@Dif:3 Résous les équations suivantes : \[ 3x+5=6x-3\kern2cm-4x+5=2x-7\kern2cm2(x-5)=3x+6 \]

http://www.emis.de/journals/JIS/VOL17/Prodinger2/prod31.tex

emis.de

CC-MAIN-2018-26

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-26/segments/1529267867579.80/warc/CC-MAIN-20180625072642-20180625092642-00313.warc.gz

\documentclass[12pt,reqno]{article} \usepackage[usenames]{color} \usepackage{amssymb} \usepackage{graphicx} \usepackage{amscd} \usepackage[colorlinks=true, linkcolor=webgreen, filecolor=webbrown, citecolor=webgreen]{hyperref} \definecolor{webgreen}{rgb}{0,.5,0} \definecolor{webbrown}{rgb}{.6,0,0} \usepackage{color} \usepackage{fullpage} \usepackage{float} \usepackage{psfig} \usepackage{graphics,amsmath,amssymb} \usepackage{amsthm} \usepackage{amsfonts} \usepackage{latexsym} \usepackage{epsf} \setlength{\textwidth}{6.5in} \setlength{\oddsidemargin}{.1in} \setlength{\evensidemargin}{.1in} \setlength{\topmargin}{-.1in} \setlength{\textheight}{8.4in} \newcommand{\seqnum}[1]{\href{http://oeis.org/#1}{\underline{#1}}} \begin{document} \begin{center} \epsfxsize=4in \leavevmode\epsffile{logo129.eps} \end{center} \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{conjecture}[theorem]{Conjecture} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \begin{center} \vskip 1cm{\LARGE\bf Counting Palindromes According to $r$-Runs of Ones Using Generating Functions\\ } \vskip 1cm \large Helmut Prodinger\\ Department of Mathematics\\ Stellenbosch University\\ 7602 Stellenbosch\\ South Africa\\ \href{mailto:hproding@sun.ac.za}{\tt hproding@sun.ac.za} \\ \end{center} \vskip .2 in \begin{abstract} We derive generating functions for the enumeration of all palindromic binary strings of length $n$ having only runs of $1$'s of length $\le r$. We provide asymptotic expressions for fixed $r$ and $n\to\infty$. Eventually, $r$ is treated as a random variable and an asymptotic equivalent for the largest run of $1$'s in binary palindromes is derived. \end{abstract} \section{Enumeration} In the recent paper~\cite{Nyblom13} the interest was in words over the alphabet $\{0,1\}$ which are \emph{palindromes} and have runs of $1$'s of bounded length. We firmly believe that \emph{generating functions} are the most appropriate tool here, and since they were not used in ~\cite{Nyblom13}, we present this natural approach and show as well how one can deal with the case that the maximal 1-run length is treated as a \emph{random variable}. It is worthwhile to note that all our methods can be found in \cite{FlSe09}. Let us start with palindromes of \emph{even length}; they are given as $ww^R$, with a reversed copy of $w$ attached to $w$. In unrestricted words, the following factorization is appropriate: \begin{equation*} (\bold0+\bold1)^*=(\bold1^*\bold0)^*\bold1^*. \end{equation*} Here, we used the $*$-operation, common in the study of formal languages, so $L^*$ denotes all words that can be formed from concatenating words taken from $L$ in all possible ways. In \cite{FlSe09}, the notation $\textsc{Seq}(L)$ is mostly used, describing all \textsc{Seq}uences (aka words), formed from $L$. Now, the mentioned factorization is a very common one for binary words. Each word is (uniquely) decomposed according to each appearence of the letter $0$; between them, there are runs (possibly empty) of the letter $1$. If a word has $s$ letters $0$, then there are $s+1$ such runs of $1$'s. In terms of generating functions, since the transition $A\to A^*$ means $f\to \frac1{1-f}$, the factorization reads as \begin{equation*} \frac1{1-2z}=\frac1{1-\dfrac{z}{1-z}}\frac1{1-z}. \end{equation*} This factorization can immediately be generalized to the instance when the 1-runs should not exceed the parameter $r$. Then we first consider the set of restricted runs \begin{equation*} \bold1^{\le r}=\{\varepsilon,1,11,\dots,1^r\}, \end{equation*} which translates into \begin{equation*} 1+z+\cdots+z^r=\frac{1-z^{r+1}}{1-z}. \end{equation*} Then we get the formal expression \begin{equation*} (\bold1^{\le r}\bold0)^*\bold1^{\le r}, \end{equation*} which translates into \begin{equation*} \frac1{1-\dfrac{z(1-z^{r+1})}{1-z}}\frac{1-z^{r+1}}{1-z}=\frac{1-z^{r+1}}{1-2z+z^{r+2}}. \end{equation*} Now, going to palindromes of even length, the last group of ones must be bounded by $\lfloor \frac r2\rfloor$. So a syntactic description of palindromes of even length with bounded 1-runs is \begin{equation*} (\bold1^{\le r}\bold0)^*\bold1^{\le \lfloor \frac r2\rfloor}; \end{equation*} this describes the first half of the word only. From this we go immediately to generating functions, by replacing both letters by a variable $z$. In this way, we count half of the length of the palindromes of even length. If one wants the full length, one must replace $z$ by $z^2$. So we get \begin{equation}\label{eve} \frac{1}{1-z\dfrac{1-z^{r+1}}{1-z}}\dfrac{1-z^{ \lfloor \frac r2\rfloor+1}}{1-z} =\frac{1-z^{ \lfloor \frac r2\rfloor+1}}{1-2z+z^{r+2}}. \end{equation} One can read off the coefficient of $z^n$ in the power series expansion of this expression, which leads to a clumsy expression: Set \begin{equation*} a_{n,r}=[z^n]\frac{1}{1-2z+z^{r}}, \end{equation*} then \begin{equation*} a_{n,r}-2a_{n-1,r}+a_{n-r,r}=0, \end{equation*} and initial conditions $a_{n,r}=2^n$ for $n<r$. Then the number of palindromes of even length $2n$ with all 1-runs $\le r$ is given by \begin{equation*} [z^n]\frac{1-z^{ \lfloor \frac r2\rfloor+1}}{1-2z+z^{r+2}}= a_{n,r+2}-a_{n-\lfloor \tfrac r2\rfloor-1,r+2}. \end{equation*} We can alternatively express the coefficients in (\ref{eve}) using the \emph{higher order Fibonacci numbers}, as it was done in \cite{Nyblom13}: Consider $U_{n,r}=U_{n-1,r}+\cdots+U_{n-r,r}$ for $n\ge r$, with initial values $U_{0,r}=\dots=U_{r-2,r}=0$, $U_{r-1,r}=1$. Then \begin{equation*} \sum_{n\ge0}U_{n,r}z^n=\frac{z^{r-1}}{1-(z^r+\cdots+ z)}=\frac{z^{r-1}}{1-z\frac{1-z^r}{1-z}}= \frac{z^{r-1}(1-z)}{1-2z+z^{r+1}}. \end{equation*} Further, \begin{equation*} \sum_{n\ge0}(U_{0,r}+\cdots+U_{n,r})z^n= \frac{z^{r-1}}{1-2z+z^{r+1}}, \end{equation*} or \begin{equation*} \sum_{k=0}^{n+r}U_{k,r+1}=[z^n]\frac{1}{1-2z+z^{r+2}}. \end{equation*} Consequently \begin{align*} [z^n]\frac{1-z^{ \lfloor \frac r2\rfloor+1}}{1-2z+z^{r+2}}&= [z^n]\frac{1}{1-2z+z^{r+2}}-[z^{n-\lfloor \frac r2\rfloor-1}]\frac{1}{1-2z+z^{r+2}}\\ &=\sum_{k=0}^{n+r}U_{k,r+1}-\sum_{k=0}^{n-\lfloor \frac r2\rfloor-1+r}U_{k,r+1}\\ &=\sum_{k=n-\lfloor \frac r2\rfloor+r}^{n+r}U_{k,r+1}. \end{align*} This is the expression given in \cite{Nyblom13} once one changes the index of summation. Note that $r-\lfloor\frac{r}{2}\rfloor=\lceil\frac r2\rceil$. Now we move to palindromes of odd length with middle letter 1: $w1w^R$. Then $w$ is described by \begin{equation*} (\bold1^{\le r}\bold0)^*\bold1^{\le \lfloor \frac {r-1}2\rfloor}. \end{equation*} In this way, the last group of ones plus the middle 1 plus the first group of ones of the reversed word is still $\le r$ as it should. The corresponding generating function is \begin{equation*} \frac{1-z^{ \lfloor \frac {r-1}2\rfloor+1}}{1-2z+z^{r+2}} \end{equation*} and the coefficient of $z^n$ (counting palindromes of odd length $2n+1$ with middle letter 1) is \begin{equation*} a_{n,r+2}-a_{n-\lfloor \tfrac {r-1}2\rfloor-1,r+2}. \end{equation*} Again, we can alternatively express the corresponding number by higher order Fibonacci numbers: \begin{align*} [z^n]\frac{1-z^{ \lfloor \frac {r-1}2\rfloor+1}}{1-2z+z^{r+2}}&= [z^n]\frac{1}{1-2z+z^{r+2}}-[z^{n-\lfloor \frac {r-1}2\rfloor-1}]\frac{1}{1-2z+z^{r+2}}\\ &=\sum_{k=0}^{n+r}U_{k,r+1}-\sum_{k=0}^{n-\lfloor \frac {r-1}2\rfloor-1+r}U_{k,r+1}\\ &=\sum_{k=n-\lfloor \frac {r-1}2\rfloor+r}^{n+r}U_{k,r+1}. \end{align*} Note that $r-\lfloor\frac{r-1}{2}\rfloor=\lfloor\frac{r}{2}\rfloor+1$. Finally we move to palindromes of odd length with middle letter 0: $w0w^R$. Then we have \begin{equation*} (\bold1^{\le r}\bold0)^*\bold1^{\le r}, \end{equation*} since the middle 0 interrupts the last run of ones of the first group. The corresponding generating function is \begin{equation*} \frac{1-z^{ r+1}}{1-2z+z^{r+2}}, \end{equation*} where again the coefficient of $z^n$ refers to a palindrome of length $2n+1$ with middle 0. Explicitly we get \begin{equation*} [z^n]\frac{1-z^{ r+1}}{1-2z+z^{r+2}}=a_{n,r+2}-a_{n-r-1,r+2}. \end{equation*} In terms of higher order Fibonacci numbers, this reads \begin{align*} [z^n]\frac{1-z^{r+1}}{1-2z+z^{r+2}}&= [z^n]\frac{1}{1-2z+z^{r+2}}-[z^{n-r-1}]\frac{1}{1-2z+z^{r+2}}\\ &=\sum_{k=0}^{n+r}U_{k,r+1}-\sum_{k=0}^{n-1}U_{k,r+1}\\ &=\sum_{k=n}^{n+r}U_{k,r+1}. \end{align*} \section{Asymptotics} We refer to the paper~\cite{Knuth78} which might be the first to consider asymptotics for words of restricted runs. The recent paper~\cite{PrWa12} has many examples of this type. Here, we only consider the key steps and refer for error bounds to the cited literature. One has to study the \emph{dominant} zero of the denominator, denoted by $\rho$, which is close to $\frac12$ when $r$ gets large (no restriction). From \begin{equation*} 1-2\rho+\rho^{r+2}=0 \end{equation*} we infer \begin{equation*} \rho=\frac12+\frac12\rho^{r+2}\approx \frac12+\frac1{2^{r+3}}. \end{equation*} This procedure is called \emph{bootstrapping}. We also need the constant $A$ in \begin{equation*} \frac1{1-2z+z^{r+2}}\sim \frac{A}{1-z/\rho}\qquad\text{as $z\to\rho$}, \end{equation*} which we get by L'Hopital's rule as \begin{equation*} A=\frac{-1/\rho}{-2+(r+2)z^{r+1}}\bigg|_{z=\rho}= \frac{-1/\rho}{-2+(r+2)\rho^{r+1}}= \frac{1}{2\rho-(r+2)(2\rho-1)}. \end{equation*} So we get the following asymptotic formul\ae, valid for $n\to\infty$ and fixed $r$: \begin{align*} [z^n]\frac{1-z^{ \lfloor \frac r2\rfloor+1}}{1-2z+z^{r+2}}&\sim (1-\rho^{ \lfloor \frac r2\rfloor+1})A\rho^{-n},\\ [z^n]\frac{1-z^{ \lfloor \frac {r-1}2\rfloor+1}}{1-2z+z^{r+2}} &\sim (1-\rho^{ \lfloor \frac {r-1}2\rfloor+1})A\rho^{-n},\\ [z^n]\frac{1-z^{ r+1}}{1-2z+z^{r+2}} &\sim (1-\rho^{r+1})A\rho^{-n}. \end{align*} And now we turn to the instance where $r$ is a random variable $X$, and compute, as a showcase, the expected value, so we answer the question about the average value of the longest 1-run in palindromes, in the 3 respective models. As mentioned, this was basically done already by Knuth. When $r$ gets large, the constant $A$ may be replaced by 1, terms of the form $\rho^r$ may be dropped, and in $\rho^{-n}$, it is enough to use the approximation \begin{equation*} \rho^{-n}\sim 2^n{(1-2^{-r-2})}^n\sim 2^n\exp(-n/2^{r+2}). \end{equation*} Furthermore, to get a probability distribution, we have to divide by $2^n$, which is the number of binary words of length $n$. So the probability that the parameter $X$ is $\le r$ is in all 3 instances approximated by \begin{equation*} \exp(-n/2^{r+2}). \end{equation*} For an expected value, one has to compute \begin{equation*} \sum_{r\ge0}\big[1-\exp(-n/2^{r+2})\big]. \end{equation*} This evaluation can be found in many texts \cite{Knuth78, FlSe09, PrWa12}; it is done with the \emph{Mellin transform}, and the result is \begin{equation*} \log_2n+\frac\gamma{\log2}-\frac32-\frac1{\log2}\sum_{k\neq0}\Gamma\Big( \frac{2k\pi i}{\log2}\Big)e^{-2k\pi i\cdot\log_2n}. \end{equation*} Observe that the series in this expression represents a periodic function with small amplitude. Asymptotically, thus, palindromes with middle letter 0 resp.\ 1 resp.\ no middle letter all lead to the same result. \bibliographystyle{plain} \begin{thebibliography}{1} \bibitem{FlSe09} P.~Flajolet and R.~Sedgewick. \newblock {\em Analytic Combinatorics}. \newblock Cambridge University Press, Cambridge, 2009. \bibitem{Knuth78} D.~E. Knuth. \newblock The average time for carry propagation. \newblock {\em Indag. Math.} {\bf 40} (1978), 238--242. \bibitem{Nyblom13} M.~A. Nyblom. \newblock Counting palindromic binary strings without $r$-runs of ones. \newblock {\em J. Integer Sequences} {\bf 16} (2013), \href{https://cs.uwaterloo.ca/journals/JIS/VOL16/Nyblom/nyblom13.html}{Article 13.8.7}. \bibitem{PrWa12} H.~Prodinger and S.~Wagner. \newblock Bootstrapping and double-exponential limit laws. \newblock Submitted. \end{thebibliography} \bigskip \hrule \bigskip \noindent 2010 {\it Mathematics Subject Classification}: Primary 11B39; Secondary 05A15. \noindent \emph{Keywords: } binary string, generating function, $r$-run of ones, asymptotics. \bigskip \hrule \bigskip \vspace*{+.1in} \noindent Received October 29 2013; revised version received April 6 2014; April 15 2014. Published in {\it Journal of Integer Sequences}, April 15 2014. \bigskip \hrule \bigskip \noindent Return to \htmladdnormallink{Journal of Integer Sequences home page}{http://www.cs.uwaterloo.ca/journals/JIS/}. \vskip .1in \end{document}

https://www.physi.uni-heidelberg.de/Forschung/kp/ceres/authors.tex

uni-heidelberg.de

CC-MAIN-2023-14

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2023-14/segments/1679296949598.87/warc/CC-MAIN-20230331082653-20230331112653-00232.warc.gz

\documentclass[espcrc1]{article} \setlength{\parindent}{0pt} \begin{document} \def\rez{$^{\rm a}$} \def\gsi{$^{\rm b}$} \def\fra{$^{\rm c}$} \def\dub{$^{\rm d}$} \def\mpi{$^{\rm e}$} \def\hei{$^{\rm f}$} \def\wei{$^{\rm g}$} \def\sun{$^{\rm h}$} \def\bnl{$^{\rm i}$} \def\cer{$^{\rm j}$} \def\mue{$^{\rm k}$} CERES collaboration by February 21, 2006 \vspace{1cm} D.~Adamov\'{a}\rez, G.~Agakichiev\gsi, A.~Andronic\gsi, D.~Anto\'{n}czyk\gsi, H.~Appelsh\"{a}user\fra, V.~Belaga\dub, J.~Biel\v{c}\'{i}kov\'{a}\mpi$^,$\hei, P.~Braun-Munzinger\gsi, O.~Busch\gsi, A.~Cherlin\wei, S.~Damjanovi\'{c}\hei, T.~Dietel\hei, L.~Dietrich\hei, A.~Drees\sun, S.\thinspace I.~Esumi\hei, K.~Filimonov\hei, K.~Fomenko\dub, Z.~Fraenkel\wei, C.~Garabatos\gsi, P.~Gl\"{a}ssel\hei, G.~Hering\gsi, J.~Holeczek\gsi, M.~Kalisky\gsi, S.~Kniege\fra, V.~Kushpil\rez, W.~Ludolphs\hei, A.~Maas\gsi, A.~Mar\'{\i}n\gsi, J.~Milo\v{s}evi\'{c}\hei, D.~Mi\'{s}kowiec\gsi, R.~Ortega\hei, Y.~Panebrattsev\dub , O.~Petchenova\dub, V.~Petr\'{a}\v{c}ek\hei, M.~P\l{}osko\'{n}\fra, S.~Radomski\gsi, J.~Rak\gsi, I.~Ravinovich\wei , P.~Rehak\bnl, H.~Sako\gsi, W.~Schmitz\hei, J.~Schukraft\cer, S.~Sedykh\gsi, S.~Shimansky\dub, R.~Soualah\hei, J.~Stachel\hei, M.~\v{S}umbera\rez , H.~Tilsner\hei, I.~Tserruya\wei, G.~Tsiledakis\gsi, J.\thinspace P.~Wessels\mue , T.~Wienold\hei, J.\thinspace P.~Wurm\mpi, S.~Yurevich\hei, V.~Yurevich\dub\\ \rez NPI ASCR, \v{R}e\v{z}, Czech Republic\\ \gsi GSI Darmstadt, Germany\\ \fra Frankfurt University, Germany\\ \dub JINR Dubna, Russia\\ \mpi MPI, Heidelberg, Germany\\ \hei Heidelberg University, Germany\\ \wei Weizmann Institute, Rehovot, Israel\\ \sun SUNY Stony Brook, U.S.A.\\ \bnl BNL, Upton, U.S.A.\\ \cer CERN, Geneva, Switzerland\\ \mue M\"{u}nster University, Germany\\ \end{document}

https://supernova.lbl.gov/collab/proposals/wiyn396.tex

lbl.gov

CC-MAIN-2022-21

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-21/segments/1652662601401.72/warc/CC-MAIN-20220526035036-20220526065036-00226.warc.gz

% WIYN_QFORM.TEX -- Form for WIYN queue observing programs. % % Version 2.0: 14 Aug 95 (drs) % % This form is designed to be printed LANDSCAPE. % (previewing example: "xdvi -paper usr wiyn_qform.dvi") % (printing example: "dvips -t landscape wiyn_qform.dvi") % % Your completed form should be submitted electronically to % ``kpnoprop-submit@noao.edu'' following the instructions you receive % after you submit the regular kitt peak observing request form. % % Don't remove the following comments; they identify the form. % % Kitt Peak National Observatory WIYN Queue Observing Program % Spring 1996, WIYN Queue Observing Form % \documentstyle[wiynq20]{article} \nofiles \begin{document} %\received{DATE} % OFFICE USE ONLY %\proposalid{IDENT} % OFFICE USE ONLY \title{ Multi-band Photometry of $\sim$10 Type Ia Supernovae at $ z =0.4$--0.75: A Measurement of $q_0$} % REQUIRED % Principal investigator. \begin{princinv} % DO NOT REMOVE \name{Saul Perlmutter} % REQUIRED \affil{Lawrence Berkeley National Laboratory} % REQUIRED \phone{510-486-5203} % REQUIRED \email{saul@lbl.gov} % REQUIRED \fax{} % REQUIRED \end{princinv} % DO NOT REMOVE % Co-investigators. Remove the "%" from the coinv block lines, % including the \begin and \end lines. You should repeat \name, % \affil, \phone, email, and \fax entries as needed within the % single coinv block. \begin{coinv} % OPTIONAL \name{Susana Deustua} \affil{Case Western Reserve University} \phone{(216) 368-0310} \email{sed@huascaran.astr.cwru.edu} \fax{(216) 368-5406} \name{Alex Kim} \affil{Lawrence Berkeley National Laboratory} \phone{(510) 486-4697} \email{akim@ux5.lbl.gov} \fax{(510) 486-6250} \name{David Branch} \affil{Univ. of Oklahoma} \phone{(405) 325-3961} \email{branch@phyast.nhn.uoknor.edu} \fax{(405) 325-7557} \name{Gerson Goldhaber} \affil{Lawrence Berkeley National Laboratory} \phone{(510) 486-6210} \email{gerson@lbl.gov} \fax{(510) 486-6250} \name{Matthew Kim} % OPTIONAL \affil{Lawrence Berkeley National Laboratory} % OPTIONAL \phone{(510) 486-4697} % OPTIONAL \email{matthew@panisse.lbl.gov} % OPTIONAL \fax{(510) 486-6250} % OPTIONAL \name{Isobel Hook} % OPTIONAL \affil{Lawrence Berkeley National Laboratory} % OPTIONAL \phone{(510) 486-5878} % OPTIONAL \email{imh@bigz.berkeley.edu} % OPTIONAL \fax{(510) 486-6250} \end{coinv} % Provide technical information about the observing program after % the \program command. BE AS SPECIFIC AS POSSIBLE. % Note that this command has no arguments. % This section should include such information as limitations on % seeing, signal-to-noise ratio per pixel for spectroscopic % observations, timing constraints for variable sources, etc. % Write as much as you want. % % In particular: % % (1) Specific as precisely as possible the PER EXPOSURE % figure-of-merit, i.e. a quantitative measure of whether % an individual exposure has met your technical goal. % % (2) Request and specify any calibration procedures that % deviate from the default Hydra calibration procedure. % If you would like to specify specific standard stars, % please list them as one of your targets below and % cross-reference them to the target field they are % calibrating using the \xref field. % \program $B, R$ and $I$ band photometry of supernova candidates with magnitudes ranging from 22 - 24 mags with signal-to-noise ratio of at least 10 are needed for our program. The observation list will be constructed in the week before our scheduled observations as supernova candidates are discovered in the ``search'' phase of our program. Most of our fields will be distributed in the region {\bf $2^h 00^m +0^{\circ} 00'$} (J2000) to {\bf $12^h 00^m+0^{\circ} 00'$} (J2000), avoiding the galactic plane. These coordinates can be used as place holders in the observation queue. Our observation list will look like the dummy list given below. Exposure times for fainter candidates are given for photometric conditions under good seeing, but the observations can be taken in any sky conditions and with any seeing $\le 1.9$" (with a concomitant increase in exposure time). Observations will be made during a range of lunar phases; each supernova will be observed every 4 days during dark time, and every 7 days during bright time. % Provide the following information for each observation requested. % Each instrument has a different set of parameters that must be % specified; the corresponding full set is given in separate % observation environments below; please use the correct one. % % The \obscomment command is REQUIRED for each observation, and must be % the last item; this command forces the observation information to be % printed. If no comment is needed, use \null as the argument for the % \obscomment command. % % The \objid command is REQUIRED for each observation, i.e. for every % \obscomment command, there should be a \objid command which precedes it. % % Please supply good coordinates with the \ra and \dec commands - we will be % trying to observe your field using these values. % % Note that for iterative observations, only the parameters that need % to be changed have to be specified. Once a parameter is specified in % an observation environment, it is retained until explicitly changed. % Please delete the observation blocks for the instruments that are % not applicable in this proposal file. % You may delete the trailing LaTeX comments if you wish. % Observations for the WIYN CCD Imager \begin{observation}{imager} %DELETE THIS BLOCK (through the first %"\end{observation}" IF YOU ARE PROPOSING % ONLY FOR MOS %\objid{Object ID} % Specify a UNIQUE 3-digit ID number %\object{Object name} % 20 characters maximum %\ra{Right ascension} %\dec{Declination} %\epoch{Coordinate epoch} %\filter{Filter} %\exptime{Exposure time} % in seconds PER EXPOSURE %\nexposures{Number of exposures} % default is 1 %\lunarphase{Lunar phase} % max allowable fractional lunar phase %\skycond{Sky condition} % "spec" or "phot" %\diq{Delivered Image Quality} % max allowable PSF FWHM (arcsecs) %\xref{Cross-reference Obj IDs} % list object IDs of related objects %\obscomment{Comment} % 20 characters maximum \objid{001} \object{SN 1} \ra{12:40:12.8} \dec{00:0:40.3} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{002} \object{SN 2} \ra{11:40:34.5} \dec{-01:0:27.5} \epoch{J2000} \filter{R} \exptime{800} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1600} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{800} \diq{1.9} \xref{} \obscomment{same candidate} \objid{003} \object{SN 3} \ra{10:41:02.3} \dec{00:30:42.7} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{004} \object{SN 4} \ra{09:41:27.3} \dec{00:0:53.1} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{005} \object{SN 5} \ra{05:12:27.3} \dec{02:15:53.1} \epoch{J2000} \filter{R} \exptime{500} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1000} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{500} \diq{1.9} \xref{} \obscomment{same candidate} \objid{006} \object{SN 6} \ra{04:12:47.9} \dec{00:16:25.1} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{007} \object{SN 7} \ra{03:23:02.1} \dec{00:15:28.6} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{008} \object{SN 8} \ra{03:11:13.4} \dec{00:16:19.4} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \objid{009} \object{SN 9} \ra{02:59:20.9} \dec{00:15:43.7} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \objid{010} \object{SN 10} \ra{02:23:33.3} \dec{00:16:48.7} \epoch{J2000} \filter{R} \exptime{600} \nexposures{1} \lunarphase{0.0} \skycond{phot} \diq{1.9} \xref{} \obscomment{supernova candidate} \filter{I} \exptime{1200} \diq{1.9} \xref{} \obscomment{same candidate} \filter{B} \exptime{600} \diq{1.9} \xref{} \obscomment{same candidate} \end{observation} \end{document}

https://uubu.fr/tex/incrontab.tex

uubu.fr

CC-MAIN-2021-21

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2021-21/segments/1620243989814.35/warc/CC-MAIN-20210513142421-20210513172421-00027.warc.gz

\documentclass{report} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \usepackage{geometry} \geometry{top=15mm, bottom=15mm, left=1cm, right=1cm} \usepackage[french]{babel} \usepackage{pslatex} \usepackage[colorlinks=true,urlcolor=black]{hyperref} \usepackage{graphicx} \usepackage{fancyhdr} \pagestyle{fancy} \renewcommand{\footrulewidth}{0.4pt} \fancyfoot[L]{Uubu.fr} \fancyfoot[R]{jeu. mars 31 13:15:17 CEST 2016} \lfoot{\Large \textit{Uubu.fr}} \hypersetup{pdfinfo={ Title={incrontab}, Author={Sylvain Girod}, Creator={Bash script from uubu.fr's format version 1}, Producer={Bash script and PDFLaTeX}, Subject={Manipulateur de table pour incrond}, CreationDate={D:20160331131517}, ModDate={D:20160331131517}, Keywords={inotify} }} \begin{document} \begin{center} {\Huge incrontab } \end{center} \vspace{1cm} \begin{flushleft} {\large Manipulateur de table pour incrond} \vspace{10mm} \hspace{1mm} incrontab est un manipulateur de table pour incron. Il créé, supprime, modifie et liste les tables utilisateurs. Chaque utilisateur, incluant les utilisateurs systèmes ont une table incron qui ne peut pas être manipulée directement. Seul root peut le faire, mais ce n'est pas recommandé. Tous les messages d'information de ce programme sont affichés sur l'erreur standard \vspace{5mm} \\ \vspace{1cm}{\huge OPTIONS } \ \begin{description} \normalsize \item[\hspace{1mm} -u, --user]{Remplace l'utilisateur courant (réel) avec celui donné.} \item[\hspace{1mm} -l, --list]{Affiche la table courante sur la sortie standard} \item[\hspace{1mm} -r, --remove]{Supprime la table courante sans confirmation} \item[\hspace{1mm} -e, --edit]{Exécute un éditeur pour éditer la table courante} \item[\hspace{1mm} -t, --types]{Affiche la liste de types d'événements supportés sur la sortie standard} \item[\hspace{1mm} -d, --reload]{Recharge la table courante dans incrond} \item[\hspace{1mm} -f, --config=]{Emplacement du fichier de configuration. Défaut: /etc/incron.conf} \end{description} \end{flushleft} \end{document}

https://dlmf.nist.gov/7.17.E2.tex

nist.gov

CC-MAIN-2018-13

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-13/segments/1521257648003.58/warc/CC-MAIN-20180322205902-20180322225902-00609.warc.gz

\[\operatorname{inverf}x=t+\tfrac{1}{3}t^{3}+\tfrac{7}{30}t^{5}+\tfrac{127}{630}% t^{7}+\cdots,\]

http://ctan.dcc.uchile.cl/fonts/libertine/latex/libertineMono.sty

uchile.cl

CC-MAIN-2019-30

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-30/segments/1563195524972.66/warc/CC-MAIN-20190716221441-20190717003118-00073.warc.gz

\ProvidesPackage{libertineMono}[% 2013/07/19 (Bob Tennent) Supports Libertine Mono fonts for all LaTeX engines.] \RequirePackage{ifxetex,ifluatex,xkeyval,textcomp} \newif\iflibertine@otf \ifxetex \libertine@otftrue \else\ifluatex \libertine@otftrue \else % [pdf]LaTeX \libertine@otffalse \fi\fi \DeclareOptionX{type1}[true]{% \@nameuse{if#1}\libertine@otffalse\fi } \DeclareOptionX{nofontspec}[true]{% \@nameuse{if#1}\libertine@otffalse\fi } \newcommand*{\LinuxLibertineMonoT@scale}{1} \DeclareOptionX{ttscaled}{\renewcommand*{\LinuxLibertineMonoT@scale}{#1}} \DeclareOptionX{ttscale}{\renewcommand*{\LinuxLibertineMonoT@scale}{#1}} \DeclareOptionX{scale}{\renewcommand*{\LinuxLibertineMonoT@scale}{#1}} \DeclareOptionX{scaled}{\renewcommand*{\LinuxLibertineMonoT@scale}{#1}} \ProcessOptionsX\relax \iflibertine@otf \RequirePackage{fontspec} \else \RequirePackage{mweights} \RequirePackage{fontenc,fontaxes} \fi % Set mono fonts: \iflibertine@otf \def\libertine@base{LinLibertine} \defaultfontfeatures{ Extension = .otf , HyphenChar=None} % Don't want ligatures or hyphenation for mono \setmonofont [ Scale = \LinuxLibertineMonoT@scale, UprightFont = *_M, ItalicFont = *_MO, % oblique to fake italic BoldFont = *_MB, % fontforge BoldItalicFont = *_MBO, % fontforge ] {\libertine@base} \newfontfamily\libmono [ Scale = \LinuxLibertineMonoT@scale, UprightFont = *_M, ItalicFont = *_MO, % oblique to fake italic BoldFont = *_MB, % fontforge BoldItalicFont = *_MBO, % fontforge ] {\libertine@base} \else % type1 \def\ttdefault{LinuxLibertineMonoT-TLF} \providecommand*\libmono{\fontfamily{LinuxLibertineMonoT-TLF}\selectfont} \fi \iflibertine@otf % turn off defaults in case other fonts are selected: \defaultfontfeatures{} \fi \endinput

http://ofap.ulstu.ru/resources/1397/three_certificate.tex?association=resources&parent_scaffold=fremantle%2Fguest%2Fresource_types&resource_type_id=26

ulstu.ru

CC-MAIN-2022-05

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-05/segments/1642320304309.59/warc/CC-MAIN-20220123202547-20220123232547-00402.warc.gz

%% LaTeX2e-файл %% Создано движком Фримантл (https://gitlab.com/korobkov/fremantle) %% в 2022-01-24T01:33:52+04:00 %% Фримантл — Свободный движок репозитория электронных ресурсов %% Copyright © 2009—2018 Лаборатория «Автоматизированные системы» scb-as@ulstu.ru, УлГТУ %% %% Фримантл is free software: you can redistribute it and/or modify %% it under the terms of the GNU Affero General Public License as published by %% the Free Software Foundation, either version 3 of the License, or %% (at your option) any later version. %% %% Фримантл is distributed in the hope that it will be useful, %% but WITHOUT ANY WARRANTY; without even the implied warranty of %% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the %% GNU Affero General Public License for more details. %% %% You should have received a copy of the GNU Affero General Public License %% along with Фримантл. If not, see <https://www.gnu.org/licenses/>. \documentclass[a4paper,fontsize=18pt]{scrartcl} \usepackage[landscape,left=2cm,right=2cm,top=1cm,bottom=1.5cm,bindingoffset=0cm]{geometry} \usepackage{graphicx, polyglossia, pst-barcode, tabu, wallpaper} \setmainfont{Liberation Serif} \setmonofont{Liberation Mono} \setsansfont{Liberation Sans} \defaultfontfeatures{Scale=MatchLowercase, Mapping=tex-text} \setdefaultlanguage[spelling=modern]{russian} \setotherlanguage{english} \graphicspath{{/srv/http/ofap/releases/20180921145927/app/assets/images/fremantle/three_certificate/}} \CenterWallPaper{1.00}{border.png} \begin{document} \begin{hyphenrules}{nohyphenation} \begin{center} \thispagestyle{empty} {\Large ОФАП УОЦ НИТ} \bigskip\bigskip \begin{tabu}{ b{5cm} >{\centering}b{19cm} } \includegraphics [height=4.5cm]{logo.png} & Ульяновский государственный технический университет Ульяновский областной центр новых информационных технологий Областной фонд алгоритмов и программ \bigskip {\Huge \textit{Свидетельство №\,1397}} \bigskip о регистрации программно-информационного продукта \end{tabu} \bigskip \begin{tabu}{ b{5cm} >{\raggedright \itshape}p{19cm} }\hline \\ Наименование: & \textbf{Учебная практика} \\ Тип: & Методические указания \\ URI: & \textbf{http://ofap.ulstu.ru/1397} \\ Авторы: & Докторова Елена Анатольевна -- Кафедра «Измерительно-вычислительные комплексы» (УлГТУ/ФИСТ) \\ Дата регистрации: & 29 мая 2013 г. \\ \end{tabu} \vfill \begin{tabu} to 24cm { b{2cm} l X >{\itshape}l } & Проректор по научной работе УлГТУ & & \textit{Н.Г.\,Ярушкина} \\ & Директор Ульяновского областного центра НИТ & & \textit{К.В.\,Святов} \\ \psbarcode{2013-05-29 http://ofap.ulstu.ru/1397}{format=compact layers=4}{azteccode} \rowfont{\small} & Администратор базы данных ОФАП & & \textit{Ю.А.\,Лапшов} \\ \end{tabu} \end{center} \end{hyphenrules} \clearpage \end{document}

http://tiennotblog.fr/logiciels/cvlatex/exemple.tex

tiennotblog.fr

CC-MAIN-2018-43

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-43/segments/1539583519859.77/warc/CC-MAIN-20181024042701-20181024064201-00318.warc.gz

\documentclass[a4paper,10pt,color=blue,nophoto]{cvlatex} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[frenchb]{babel} \usepackage{lmodern} \nom{Jean Dupont} \profession{Développeur} \begin{document} \begin{coordonnees} \adresse{123 rue bidon\\75~000 Paris} \telephone{Tél.~: 01 23 45 67 89} \portable{Portable~: 06 23 45 67 89} \fax{Fax~: 01 23 45 67 89} \email{jean.dupont@fai.fr} \end{coordonnees} \begin{categorie}{Formation} \competence{1995}{Université technique}{Paris} {Formation aux technologies Web.} \competence{1993-1995}{Lycée Edouar Bossedur}{Tours} {Classes préparatoires aux grandes écoles.} \competence{1993}{Lycée Saint Jean}{Orléans} {Obtention du baccalauréats, avec mention.} \end{categorie} \begin{categorie}{Compétences} \competence{}{Langages web}{}{HTML, PHP, CSS, javascript.} \competence{}{Programmation orientée objet}{} {C++, Java, Objective-C.} \end{categorie} \end{document}

https://courses.engr.illinois.edu/cs473/fa2016/Homework/hw9.tex

illinois.edu

CC-MAIN-2017-34

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2017-34/segments/1502886106996.2/warc/CC-MAIN-20170820223702-20170821003702-00526.warc.gz

\documentclass[11pt]{article} %\usepackage{pstricks,pst-node} \usepackage{alltt,fullpage,graphics,color,epsfig,amsmath, amssymb} \usepackage{hyperref} \usepackage{boxedminipage} %\newcommand{\edgee}[1]{\begin{math}\stackrel{#1}{\longrightarrow}\end{math}} \newcommand{\floor}[1]{\lfloor #1 \rfloor} \newcommand{\ceil}[1]{\lceil #1 \rceil} \DeclareMathOperator*{\E}{\mathbb{E}} \newcommand{\eps}{\epsilon} \begin{document} \setlength{\parskip}{.1 in} \begin{center} \LARGE \textbf{CS 473: Algorithms, Fall 2016} \\[0.5ex] \textbf{HW 9 (due Tuesday, November 15 at 8pm)} \end{center} \noindent This homework contains three problems. {\bf Read the instructions for submitting homework on the course webpage}. \noindent {\bf Collaboration Policy:} For this home work, each student can work in a group with up to three members. Only one solution for each group needs to be submitted. Follow the submission instructions carefully. \bigskip \hrule \medskip For problems that ask for a linear-programming formulation of some problem, a full credit solution requires the following components: \begin{itemize}\itemsep0pt \item A list of variables, along with a brief English description of each variable. (Omitting these English descriptions is a Deadly Sin.) \item A linear objective function (expressed either as minimization or maximization, whichever is more convenient), along with a brief English description of its meaning. \item A sequence of linear inequalities (expressed using $\le$, $=$, or $\ge$, whichever is more appropriate or convenient), along with a brief English description of each constraint. \item A proof that your linear programming formulation is correct, meaning that the optimal solution to the original problem can always be obtained from the optimal solution to the linear program. This may be very short. \end{itemize} It is \textbf{\textit{not}} necessary to express the linear program in canonical form, or even in matrix form. Clarity is much more important than formality. \medskip \hrule \bigskip \hrule \medskip\noindent For problems that ask to prove that a given problem $X$ is NP-hard, a full-credit solution requires the following components: \begin{itemize}\itemsep0pt \item Specify a known {NP}-hard problem $Y$, taken from the problems listed in the notes. \item Describe a polynomial-time algorithm for $Y$, using a black-box polynomial-time algorithm for $X$ as a subroutine. Most {NP}-hardness reductions have the following form: Given an arbitrary instance of $Y$, describe how to transform it into an instance of $X$, pass this instance to a black-box algorithm for $X$, and finally, describe how to transform the output of the black-box subroutine to the final output. A cartoon with boxes may be helpful. \item Prove that your reduction is correct. As usual, correctness proofs for {NP}-hardness reductions usually have two components (“one for each f”). \end{itemize} \hrule \bigskip \newpage \begin{enumerate} %---------------------------------------------------------------------- \item Given points $(x_1,y_1), (x_2,y_2),\ldots, (x_n,y_n)$ in the plane the {\em linear regression problem} asks for real numbers $a$ and $b$ such that the line $y = ax + b$ fits the points as closely as possible according to some criterion. The most common fit criterion is minimizing the $L_2$ error, defined as follows: $$\eps_2(a,b) = \sum_{i=1}^n (y_i - ax_i - b_i)^2.$$ But there are several other fit criteria, some of which can be optimized by linear programming. \begin{itemize} \item The $L_1$ error of the line $y = ax + b$ is defined as follows $$\eps_1(a,b) = \sum_{i=1}^n |y_i - ax_i - b|.$$ Describe a linear program whose solution $(a,b)$ describes the line with the minimum $L_1$ error. \item The $L_{\infty}$ error of the line $y = ax + b$ is defined as follows. $$\eps_{\infty}(a,b) = \max_{i=1}^n |y_i - ax_i - b|.$$ Describe a linear program whose solution $(a,b)$ describes the line with the minimum $L_{\infty}$ error. \end{itemize} {\bf Comment:} In general the points can be in $\mathbb{R}^d$ for some $d$ and in that case one fits a hyperplane. We are here considering the simple case of $d=2$. \item The facility location problem is the following. There is a set of $n$ facilities $F$ and $m$ clients $C$. The cost of openining a facility $i$ is $f_i$. There is a cost $c(i,j)$ to connect client $j$ to facility $i$. The goal is to open a susbet of the facilities and connect each client to an open facility. The objective function is to minimize the sum of the facility opening costs and the connection costs. Write an integer linear programming formulation for this problem using two sets of decision variables, one set for opening facilities, and one set for assigning clients to open facilities. Prove that it is sufficient to constrain only the facility opening variables to be integer valued. Such a problem is called a mixed-integer programming problem. \item A directed graph $G=(V,E)$ is {\em strongly connected} if for all $u,v \in V$ there is a path in $G$ from $u$ to $v$ and from $v$ to $u$. The {\sc Strongly-Connected Spanning Subgraph} problem is the following: given a directed graph $G=(V,E)$ and an integer $k$ is there a spanning subgraph $H$ of $G$ with at most $k$ edges such that $H$ is strongly connected? A subgraph is spanning if it contains all the vertices of the original graph. Describe a reduction to show that {\sc Strongly-Connected Spanning Subgraph} is NP-Complete. \end{enumerate} \newpage {\bf The remaining problems are for self study. Do \emph{NOT} submit for grading.} \begin{itemize} \item Suppose we have a linear program $\max c x, A_1x \le b_1, A_2x=b_2, A_3x \ge b_3, x\ge 0$. What is its dual? \item See Problem 3 in HW 8 from Jeff's home work last spring. \url{https://courses.engr.illinois.edu/cs473/sp2016/hw/hw8.pdf} \item See HW 5 from Chandra's graduate algorithms course in Fall 2011. \url{https://courses.engr.illinois.edu/cs573/fa2011/Homework/hw5.pdf} \item See HW 8 from Sariel's course in Fall 2015. \url{https://courses.engr.illinois.edu/cs473/fa2015/w/hw/hw_08.pdf}. \end{itemize} \end{document}

https://indico.in2p3.fr/event/420/contributions/29805/attachments/23929/29325/proceedings.tex

in2p3.fr

CC-MAIN-2021-39

application/x-tex

text/x-matlab

crawl-data/CC-MAIN-2021-39/segments/1631780057036.89/warc/CC-MAIN-20210920101029-20210920131029-00117.warc.gz

%====================================================================% % MORIOND.TEX 2-Feb-1995 % % This latex file rewritten from various sources for use in the % % preparation of the standard proceedings Volume, latest version % % for the Neutrino'96 Helsinki conference proceedings % % by Susan Hezlet with acknowledgments to Lukas Nellen. % % Some changes are due to David Cassel. % % % % Updated to LaTeX2e and adapted to Moriond 2001 conditions % % by F.Montanet 24/04/2001 % %====================================================================% \documentclass[11pt]{article} \usepackage{moriond,epsfig} \usepackage{verbatim} %\documentstyle[11pt,moriond,epsfig]{article} \bibliographystyle{unsrt} % for BibTeX - sorted numerical labels by order of % first citation. % A useful Journal macro \def\Journal#1#2#3#4{{#1} {\bf #2}, #3 (#4)} % Some useful journal names \def\NCA{\em Nuovo Cimento} \def\NIM{\em Nucl. Instrum. Methods} \def\NIMA{{\em Nucl. Instrum. Methods} A} \def\NPB{{\em Nucl. Phys.} B} \def\PLB{{\em Phys. Lett.} B} \def\PRL{\em Phys. Rev. Lett.} \def\PRD{{\em Phys. Rev.} D} \def\ZPC{{\em Z. Phys.} C} %%%{ my defs \newcommand{\A}{{\cal A}} \newcommand{\h}{{\cal H}} \newcommand{\s}{{\cal S}} \newcommand{\W}{{\cal W}} \newcommand{\BH}{\mathbf B(\cal H)} \newcommand{\KH}{\cal K(\cal H)} \newcommand{\Real}{\mathbb R} \newcommand{\Complex}{\mathbb C} \newcommand{\Field}{\mathbb F} \newcommand{\RPlus}{[0,\infty)} % \newcommand{\norm}[1]{\left\Vert#1\right\Vert} \newcommand{\essnorm}[1]{\norm{#1}_{\text{\rm\normalshape ess}}} \newcommand{\abs}[1]{\left\vert#1\right\vert} \newcommand{\set}[1]{\left\{#1\right\}} \newcommand{\seq}[1]{\left<#1\right>} \newcommand{\eps}{\varepsilon} \newcommand{\To}{\longrightarrow} \newcommand{\RE}{\operatorname{Re}} \newcommand{\IM}{\operatorname{Im}} \newcommand{\Poly}{{\cal{P}}(E)} \newcommand{\EssD}{{\cal{D}}} % \newcommand{\be}{\begin{equation}} \newcommand{\ee}{\end{equation}} \newcommand{\bea}{\begin{eqnarray}} \newcommand{\eea}{\end{eqnarray}} \newcommand{\ben}{\begin{enumerate}} \newcommand{\een}{\end{enumerate}} \newcommand{\nn}{\nonumber} \newcommand{\crn}{\nonumber \\} \newcommand{\non}{\nonumber} \newcommand{\noi}{\noindent} \newcommand{\al}{\alpha} \newcommand{\la}{\lambda} \newcommand{\bet}{\beta} \newcommand{\ga}{\gamma} \newcommand{\va}{\varphi} \newcommand{\om}{\omega} \newcommand{\pa}{\partial} \newcommand{\fr}{\frac} \newcommand{\bc}{\begin{center}} \newcommand{\ec}{\end{center}} \newcommand{\Ga}{\Gamma} \newcommand{\de}{\delta} \newcommand{\De}{\Delta} \newcommand{\ep}{\epsilon} \newcommand{\varep}{\varepsilon} \newcommand{\ka}{\kappa} \newcommand{\La}{\Lambda} \newcommand{\si}{\sigma} \newcommand{\Si}{\Sigma} \newcommand{\ta}{\tau} \newcommand{\up}{\upsilon} \newcommand{\Up}{\Upsilon} \newcommand{\ze}{\zeta} \newcommand{\ps}{\psi} \newcommand{\Ps}{\Psi} \newcommand{\ph}{\phi} \newcommand{\vph}{\varphi} \newcommand{\Ph}{\Phi} \newcommand{\Om}{\Omega} % \newcommand{\vv}{\textbf{v}} \newcommand{\pp}{\textbf{p}} \newcommand{\Lar}{\mathcal{L}} \newcommand{\ppbbH}{pp\to b\bar{b}H} \newcommand{\ggbbH}{gg\to b\bar{b}H} \newcommand{\qqbbH}{qq\to b\bar{b}H} \newcommand{\qqZHbbH}{q\bar{q}\to Z^*H\to b\bar{b}H} %%%} my def %temp replacement due to no font %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % BEGINNING OF TEXT % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} %%\vspace*{0.1cm}\rightline{LAPTH-Conf-1248/08} \vspace*{4cm} \title{Yukawa corrections to Higgs production associated with two bottom quarks at the LHC} \author{ Le Duc Ninh } \address{LAPTH, Universit\'e de Savoie, CNRS; BP 110, F-74941 Annecy-le-Vieux Cedex, France} % \maketitle\abstracts{ We investigate the leading one-loop Yukawa corrections to the process $pp\rightarrow b\bar{b}H$ in the Standard Model. We find that the next-to-leading order correction to the cross section is small about $-4\%$ if the Higgs mass is $120$GeV. However, the appearance of leading Landau singularity when $M_H\ge 2M_W$ can lead to a large correction at the next-to-next-to-leading order level for a Higgs mass around $160$GeV. } \section{Introduction} The cross section for $b\bar{b}H$ production at the LHC is very small compared to the gluon fusion channel. However, it is important to study that because of the following reasons: \begin{itemize} \item It can provide a direct measurement of the bottom-Higgs Yukawa coupling ($\la_{bbH}$) which can be strongly enhanced in the MSSM. \item We can identify the final state in experiment by tagging b-jets with high $p_T$. This reduces greatly the QCD background. \item Theoretically, it is a $2\to 3$ process at the LHC which is a good example of one-loop multi-leg calculations. Moreover, the process $\ggbbH$ is, to the best of our knowledge, the most beautiful example where the leading Landau singularity (LLS) occurs in an electroweak box Feynman diagram. Considering that one rarely encounters such a singularity, studying its effect is very important. \end{itemize} The next-to-leading order (NLO) QCD correction to the exclusive process $pp\to b\bar{b}H$ with high $p_T$ bottom quarks has been calculated by two groups \cite{dittmaier_bbH}. The QCD correction is about $-22\%$ for $M_H=120$GeV and $\mu=M_Z$ (renormalisation/factorisation scale). No leading Landau singularity occurs in any QCD one-loop diagrams. The aim of our work is to calculate the Yukawa corrections, which are the leading electroweak corrections in this case, to the exclusive $bbH$ final state with high $p_T$ bottom quarks at the LHC \cite{fawzi_bbH}. These corrections are triggered by top-charged Goldstone loops whereby, in effect, an external $b$ quark turns into a top quark. Such type of transitions can even trigger $g g \to b \bar b H$ even with vanishing $\lambda_{bbH}$, in which case the process is generated solely at one-loop level. \section{Calculation and results} At the LHC, the entirely dominant contribution comes from the sub-process $g g\to b \bar b H$. The contribution from the light quarks in the initial state is therefore neglected in our calculation. Typical Feynman diagrams at the tree and one-loop levels are shown in Fig. \ref{diagrams}. \begin{figure}[h] \begin{center} \includegraphics[width=12cm]{ggbbH_tree_loop.eps} \caption{\label{diagrams}{\em Typical Feynman diagrams for the process $gg\to b\bar{b}H$ at tree [class (a)] and one-loop [classes (b) and (c)] levels. Loop particles are the charged Goldstone bosons ($\chi_W$) and the top quark. In the class (c): the box diagram has a LLS, the pentagon diagram has the sub-leading Landau singularity which is the same as the LLS of the box diagram. The LLS occurs when $M_H\ge 2M_W$ and $\sqrt{s}\ge 2m_t$, {\it i.e.} all the four particles in the loop can be simultaneously on-shell.}} \end{center} \end{figure} All the relevant couplings are: \bea \la_{bbH}&=&-\fr{m_b}{\upsilon},\hspace*{3mm} \la_{ttH}=-\fr{m_t}{\upsilon},\crn \la_{tb\chi}&=&-i\sqrt{2}\la_{ttH}(P_L-\fr{m_b}{m_t}P_R),\hspace*{3mm} \la_{\chi^+\chi^-H}=\fr{M_H^2}{\upsilon},\nn \eea where $\upsilon$ is the vacuum expectation value and $P_{L,R}=(1\mp\gamma_5)/2$. The cross section as a function of $\la_{bbH}$ can be written in the form \bea \sigma(\la_{bbH})&=&\sigma(\la_{bbH}=0)+\la_{bbH}^2\sigma^\prime(\la_{bbH}=0)+\cdots,\crn \la_{bbH}^2\sigma^\prime(\la_{bbH}=0)&\approx&\sigma_{NLO}=\sigma_{LO}[1+\delta_{NLO}(m_t,M_H)],\nn \eea where $\sigma(\la_{bbH}=0)$ is shown in Fig. \ref{sigma_mH} (right), $\sigma_{LO}$ and $\sigma_{NLO}$ are shown in the same figure on the left. $\sigma(\la_{bbH}=0)$ is generated solely at one-loop level and gets large when $M_H$ is close to $2M_W$. This is due to the leading Landau singularity related to the scalar loop integral associated to the box diagram in the class (c) of Fig. \ref{diagrams}. This divergence, which occurs when $M_H\ge 2M_W$, is not integrable at the level of loop amplitude squared and must be regulated by introducing a width for the unstable particles in the loops. Mathematically, the width effect is to move the LLS into the complex plane so that they do not occur in the physical region. The solution is shown in Fig. \ref{landau_sing}. The important point here is that the LLS, even after being regulated, can lead to a large correction to the cross section, up to $49\%$ for $M_H=163$GeV, $\Gamma_W=2.1$GeV and $\Gamma_t=1.5$GeV. %%% \begin{figure}[t] \begin{center} \begin{minipage}[c]{6.5cm} \includegraphics[width=6.5cm,height=4.5cm]{p_TL_mH_final_detail.eps} \end{minipage} \begin{minipage}[c]{6.5cm} \includegraphics[width=6.5cm,height=4.5cm]{p_LL_mH_h2_detail.eps} \end{minipage} \caption{\label{sigma_mH}{\em Left: the leading order (LO) and NLO cross sections as functions of $M_H$. Right: the cross section in the limit of vanishing $\la_{bbH}$.}} \end{center} \end{figure} % \begin{figure}[h] \begin{center} \begin{minipage}[c]{6.5cm} \includegraphics[width=6.5cm]{gbbH_real_width_2D.eps} \end{minipage} \hspace*{0.1cm} \begin{minipage}[c]{6.5cm} \includegraphics[width=6.5cm]{gbbH_img_width_2D.eps} \end{minipage} \caption{\label{landau_sing}{\em The real and imaginary parts of the scalar box integral associated with the LLS diagram in the class (c) of Fig. \ref{diagrams}.}} \end{center} \end{figure} % \section*{Acknowledgments} The author would like to acknowledge the financial support from EU Marie Curie Programme. This work has been done in collaboration with Fawzi Boudjema. % \section*{References} \begin{thebibliography}{99} \bibitem{dittmaier_bbH} S. Dittmaier, M. Kr{\"a}mer and M. Spira, Phys. Rev. D70, 074010 (2004); S. Dawson, C. B. Jackson, L. Reina and D. Wackeroth, Phys. Rev. D69, 074027 (2004). \bibitem{fawzi_bbH} F. Boudjema and Le Duc Ninh, Phys. Rev. D77, 033003 (2008). \end{thebibliography} \end{document} %%%%%%%%%%%%%%%%%%%%%% % End of moriond.tex % %%%%%%%%%%%%%%%%%%%%%%

http://dlmf.nist.gov/1.4.E22.tex

nist.gov

CC-MAIN-2016-50

application/x-tex

crawl-data/CC-MAIN-2016-50/segments/1480698541896.91/warc/CC-MAIN-20161202170901-00016-ip-10-31-129-80.ec2.internal.warc.gz

\[\int^{\infty}_{a}f(x)dx=\lim_{b\to\infty}\int^{b}_{a}f(x)dx.\]

https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/22-06-32.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103619185.32/warc/CC-MAIN-20220628233925-20220629023925-00110.warc.gz

%% %% Ein Beispiel der DANTE-Edition %% %% 7. Auflage %% %% Beispiel 22-06-32 auf Seite 425. %% %% Copyright (C) 2016 Herbert Voss %% %% It may be distributed and/or modified under the conditions %% of the LaTeX Project Public License, either version 1.3 %% of this license or (at your option) any later version. %% %% See http://www.latex-project.org/lppl.txt for details. %% %% %% ==== % Show page(s) 1 %% %% \documentclass[]{exaarticle} \pagestyle{empty} \setlength\textwidth{97.16928pt} \setlength\parindent{0pt} \usepackage{pst-solides3d} \psset{lightsrc=10 5 20,viewpoint=50 20 30 rtp2xyz,Decran=20} %StartShownPreambleCommands %StopShownPreambleCommands \begin{document} \begin{pspicture}(-2,-2)(2,2) \psSolid[object=face,base=-3 -1 0 3 3 -1] \axesIIID[showOrigin=false](4,4,2) \end{pspicture} \end{document}

http://max-klinger.org/latex/docs/Funktionalanalysis2/5.Week.tex

max-klinger.org

CC-MAIN-2018-17

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2018-17/segments/1524125945317.36/warc/CC-MAIN-20180421184116-20180421204116-00572.warc.gz

\begin{cor}[Spektralsatz für beschränkte, selbstadjungierte Operatoren] Es existiert genau eine Bijektion zwischen der Menge er selbstadjungierten Operatoren in $\BL(\HH)$ und der Menge der Spektralmaße auf $\RR$ mit kompaktem Träger so dass \begin{equation*} A= \int_{\spec(A)} dP(\lambda) \lambda \text{ und } P(B) = \chi_B(A) \; \forall B \in \mathcal{B} \end{equation*} gilt(insbesondere ist $\supp(A) = \spec(A)$). Die Abbildung \begin{equation*} \mathcal{B}(\spec(A))\rightarrow \BL(\HH), f\mapsto \int_{\spec(A)} dP(\lambda) f(\lambda) \end{equation*} realisiert den messbaren Funktionalkalkül $\hat(\phi)$ aus Satz 1.9 \end{cor} \begin{proof} % Bild Blasen Noch zu zeigen: $\Psi\circ \alpha=\id$\\ Wähle $A=A^* \in \BL(\HH)$ und sie $P:= \chi_\cdot (A)$ das zugehörige Spektralmaß. $S:= \int_\RR dP(\lambda)d\lambda$ Zeige nun A=S. Sei $f\in \{Borel Funktionen\}$ eine Stufenfunktion mit der Eigenschaften $\norm{f-\id}\leq \epsilon$ $$\norm{A-S}\leq \underbrace{\norm{A-f(A)}}_{\leq \norm{\id-f}_\infty \leq \epsilon} + \underbrace{\norm{f(A) -\Psi(f)}}_{(*)} + \underbrace{\norm{\Psi - S}}_{\leq \epsilon\text{ wegen }\norm{\int dP(\lambda)f(\lambda)}\leq \norm{f}_{\infty}(Cor 1.25}$$ (*) verschwindet klarerweise. $f(A) = \sum \alpha_j \chi_{B_j} = \int dP (\lambda)f(\lambda) = \Psi(f). $ \end{proof} \begin{exm} \begin{enumerate} \item $\HH = \CC^n$ $A=A^*$ ist eine $n\times n$ Matrix ($\rightarrow$ Kapitel 1.1) \item $A=A^*$ \underline{kompakter Operator} ($K\in \BL(\HH)$ ist \underline{Kompakt} $\Leftrightarrow$ K schwach konvergente Folgen in $\norm{\cdot}$-konvergente Folgen abbildet.), dann gilt nach \underline{Satz von Hilbert-Schmidt}(I.5.39) $\exists \{\lambda_n\}_n \subset \RR,\; \exists \{\phi_n\}$ ONB \\$\displaystyle A= \sum_n \lambda_n \phi_n\otimes\phi_n,$ wobei $\displaystyle \phi\otimes\phi : \HH \rightarrow \HH, \psi\mapsto \scal {\phi}{\psi} \phi$ $\forall B \in \BB (\CC)$\\ $\displaystyle P(B) = \sum_{n, \lambda_n \in B} \phi_n\otimes\phi_n$ (konvergiert i.d.R. nur in der starken Topologie nicht in Norm). \item \underline{Multiplikationsoperatoren} auf $L^2 ([0,1])$ $\psi\mapsto A\psi,\; (A\psi)(x) := x\psi(x) \; \forall x \in [0,1].$ A erfüllt $A= A^*, \norm{A}=1$. \end{enumerate} \end{exm} \begin{cor} Seien $A,S \in \BL(\HH)$, $A=A^*$, dann: $[A,S]=0 \Leftrightarrow$\\ $\Leftrightarrow [\chi_B(A),S] = 0$ $\forall B \in \BB(\RR)$ \end{cor} \begin{proof} \begin{align*} [A,S]=0 &\Leftrightarrow [A^n,S] = 0 \; \forall n \\ &\Leftrightarrow \scal{\psi}{SA^n\phi}=\scal{\psi}{A^nS\phi} \\ &\Leftrightarrow \int_{\spec(A)} d\mu_{\psi,S\phi}(\lambda)\lambda^n= \int_{\spec(A)} d\mu_{S^*\psi,\phi}(\lambda)\lambda^n \\ &\Leftrightarrow \mu_{\psi,S\phi}(B) = \mu_{S^*\psi,\phi}(B) \; \forall B\text{ Borell }\\ &S\chi_B(A) = \chi_B(A) S \; \forall B \text{ Borell} \end{align*} \end{proof} \section{Entwicklung des Spektrums} Zuerst eine alternative Beschreibung des Spektrums \thm{ Sei $A=A^*\in \BL(\HH)$ und $P:= \chi_\cdot(A)$. Dann: \begin{enumerate}[a)] \item $\lambda\in \rho(A) \Leftrightarrow \exists$ offene Umgebung. $U \ni \lambda in \RR$ so dass $P(U) = 0$ \item $\lambda$ ist ein Eigenwert von A $\Leftrightarrow P(\{\lambda\})\neq 0$ (In diesem Fall, ist $P(\{\lambda\})$ die Projektion auf den zugehörigen Eigenraum. \item Isolierte Punkte (d.h. $\lambda \in \spec(A)$ und $\exists$ offene Umgebung U von $\lambda$ in $\RR$ mit $U\setminus \{\lambda\}$ [$\Leftrightarrow U\cap \spec(A) = \{\lambda\}])$ in $\spec(A)$ sind Eigenwerte \end{enumerate} } \begin{proof} \begin{enumerate}[a)] \item \begin{itemize} \item[$``\Rightarrow``$] Da $P(\rho(A)) = 0$ (Satz 1.26) \item[$``\Leftarrow``$] Sei U Umgebung von $\lambda$ mit $\prob(U)=0$ (wir wollen zeigen, dass $(A-\lambda)$ invertierbar ist). Seien $$f: t\mapsto \case{\frac{1}{t-\lambda}}{t\in\spec(A) \cap U^c}{0}{sonst} \; g: t\mapsto t-\lambda, t \in \spec(A)$$ f,g sind beschränkte Funktionen. Denn nach dem Funktionalkalkül gilt: $f(A)(A-\lambda) = (fg)(A) = \chi_{U^c}(A) = P(U^c) = \1$, weil $P(U) = 0$ \end{itemize} \item folgt aus $\ran P(\{\lambda\})= \ker(A-\lambda)$ (*) \begin{itemize} \item[$``\subset``$] Sei $\psi \in \ran P(\{\lambda\})\Rightarrow P(\{\lambda\})\psi=\psi \; \Rightarrow \forall \phi \in \HH: $ \\$\scal{\phi}{(A-\lambda)\psi}= \scal{\phi}{(A-\lambda)P(\{\lambda\})\psi}=\int d\mu_{\phi,\psi}(\eta (\eta-\lambda) \chi_{\{\lambda\}}(\eta) = 0 $\\ $\Rightarrow (A-\lambda) \psi =0 \Rightarrow \psi \in \ker(A)-\lambda$ \item [$``\supset``$] Sei $\psi \in \ker(A-\lambda)\Rightarrow f(A)\psi=f(\lambda)\psi$ für alle Borelfunktionen f nach Satz 1.8. Insbesondere wähle $f= \chi_{\{\lambda\}}$ dann hat (**) die Form $P(\{\lambda\})=\underbrace{\chi_(\{\lambda\})}_1\psi \Rightarrow \psi \in \ran(P(\{\lambda\}))$ \end{itemize} \item Sei U offene Umgebung von $\lambda$ so, dass \underline{$U\cap\spec(A)=\{\lambda\}$} $\stackrel{a)}{\Rightarrow} P(U\setminus\{\lambda\}) = 0$. Angenommen, dass $P(\{\lambda\})=0$ dann $P(U)=0$ Wiederspruch da $U\nsubseteq \rho(A)$, so $P(\{\lambda\})\neq 0$ \end{enumerate} \end{proof} \begin{proof}[Beweis von (*)] \begin{itemize} \item [''$\subseteq$'']: Sei $\psi \in \ran\prob{\{\lambda\}} \Rightarrow \prob{\{\lambda\}} \psi = \psi$ $\Rightarrow \forall \psi \in \HH : \scal{\psi}{(A-\lambda)\psi} = \scal{\psi}{(A-\lambda) \prod{\{\lambda}\} \psi}$ = $\int_{\spec(A)} d\mu_{\phi,\psi}(\eta) \underbrace{(\eta-\lambda)\chi_{\{\lambda\}} (\eta)}_{=0 \; \forall \eta \in \RR} = 0$ $\Rightarrow \psi \in \ker(A-\lambda)$ \item[''$\supseteq$''] Sei $\psi \in \ker(A-\lambda) \Rightarrow f(A) \psi = f(\lambda) \psi \; \forall f \in C(\spec(A))$ nach Satz 1.8 c)\\ Korollar 1.25 + Approximations \end{itemize} \end{proof}

http://mathcomm.org/wp-content/uploads/Writeup-1016.tex

mathcomm.org

CC-MAIN-2019-22

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-22/segments/1558232258147.95/warc/CC-MAIN-20190525164959-20190525190959-00371.warc.gz

\documentclass{article} \usepackage{amssymb, amsmath, amsthm} % Macros for theorems (using amsthm) \newtheorem{dfn}{Definition}[section] \newtheorem{thm}[dfn]{Theorem} \newtheorem{rmk}{Remark} % Some other useful symbols \newcommand{\N}{\mathbb{N}} \newcommand{\R}{\mathbb{R}} \newcommand{\eps}{\varepsilon} % Making the title \author{C. Desjardins and J. Lewis} \title{Cauchy Sequences and Convergence} \date{October 19, 2009} \begin{document} \maketitle \section{Introduction and definitions} In this paper, we present the proof of a theorem relating convergent sequences to Cauchy sequences. This theorem helps motivate the idea of a complete metric space and of the notion of topological completion. We begin by presenting the definitions we need to state the theorem. \begin{dfn} A sequence $(s_n)_{n \in \N}$ in a metric space $(X, d)$ is said to be a \emph{Cauchy sequence} if for all $\eps > 0$ there exists $N \in \N$ such that for all $m, n > N$ we have $d(s_n, s_m) < \eps$. \end{dfn} \begin{dfn} A sequence $(s_n)_{n \in \N}$ in a metric space $(X, d)$ is said to \emph{converge to} $L \in X$ if for all $\eps > 0$ there exists $N \in \N$ such that for all $n > N$ we have $d(s_n, L) < \eps$. If there exists $L \in X$ such that $(s_n)_{n \in \N}$ converges to $L$ then we say that $(s_n)_{n \in \N}$ \emph{converges} or \emph{is convergent}. \end{dfn} With these definitions in hand, we proceed to our main result. \section{Main Theorem} \begin{thm} Every convergent sequence $(s_n)_{n \in \N}$ in the metric space $(X, d)$ is a Cauchy sequence. \end{thm} \begin{proof} Suppose that $(s_n)_{n \in \N}$ is a convergent sequence. Then it has a limit $L$. By choosing a small $\eps$, we have by the definition of convergence that eventually all terms of $(s_n)_{n \in \N}$ will be arbitrarily to $L$. Then choosing any two of these terms, say $s_n$ and $s_m$, and applying the triangle inequality, we have that \[ d(s_m, s_n) \leq d(s_m, L) + d(L, s_n) \] is also arbitrarily small. Then we have that $(s_n)_{n \in \N}$ is a Cauchy sequence, as desired. \end{proof} The key idea behind this proof is that the definitions of Cauchy sequence and convergent sequence differ primarily in that the latter explicitly references a limit while the former does not. In other words, we may think of a convergent sequence as one which ``gets close to something'' while a Cauchy sequence is one which ``gets close together.'' Our intuition, formalized by the triangle inequality, shows that ``getting close to something'' necessarily means ``getting close together,'' and this is our result. Note that the converse of this statement is \emph{not} true. In fact, motivated by this theorem, we define a special class of metric spaces (the topologically complete spaces) as those in which the converse does hold. Certain large, important classes of metric spaces are complete (see e.g. \cite{rudin} Theorem 3.11). \begin{thebibliography}{99} \bibitem[R]{rudin} W. Rudin, \textit{Principles of Mathematical Analysis}, 3rd edition. McGraw-Hill, 1976. \end{thebibliography} \end{document}

http://dlmf.nist.gov/9.10.E22.tex

nist.gov

CC-MAIN-2014-10

application/x-tex

crawl-data/CC-MAIN-2014-10/segments/1393999679512/warc/CC-MAIN-20140305060759-00063-ip-10-183-142-35.ec2.internal.warc.gz

\[\int_{0}^{{\infty}}\!\!\int_{t}^{{\infty}}\!\!\!\!\cdots\int_{t}^{{\infty}}% \mathop{\mathrm{Ai}\/}\nolimits\!\left({-}t\right)(dt)^{n}=\frac{2\mathop{\cos% \/}\nolimits\!\left(\tfrac{1}{3}(n-1)\pi\right)}{3^{{(n+2)/3}}\mathop{\Gamma\/% }\nolimits\!\left(\tfrac{1}{3}n+\tfrac{2}{3}\right)},\]

http://mathematic.fr/IMG/tex/statistiques-2.tex

mathematic.fr

CC-MAIN-2019-18

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-18/segments/1555578531984.10/warc/CC-MAIN-20190421140100-20190421162100-00522.warc.gz

\documentclass{article} \usepackage{styles} \usepackage{arrows} \pagestyle{fancy} \lhead{\textit{Statistiques}}\lfoot{\textit{BTS}} \begin{document} \begin{center}{\huge{Statistiques}}\end{center} \vspace{3cm} \section{Statistiques ˆ une variable} \subsection{Un exemple} \begin{center} \begin{tabular}{cccccc} \hline Salaire mensuel net (en euros) & 1000 & 1200 & 1500 & 2500 & 3000\\ Nombre de personnes & 5 & 8 & 24 & 13 & 2\\ \hline \end{tabular} \end{center} \subsection{Moyenne et Žcart type} \begin{defi} La \textbf{moyenne} d'une sŽrie statistique dont les valeurs du caractre sont $x_1, x_2, .... x_k$ et les effectifs correspondants: $n_1, n_2,....n_k$ est notŽe $\overline{x}$ et vaut: $$\overline{x}=\dfrac{n_1x_1+...+n_kx_k}{n_1+...+n_k}$$ L'\textbf{Žcart-type} d'une sŽrie statistique mesure l'Žcart des valeurs par rapport ˆ cette moyenne. \end{defi} \ex La moyenne des salaires de l'entreprise est: ...................................................... En pratique, on dŽtermine la moyenne et l'Žcart type ˆ l'aide de la calculatrice (menu statistiques). \subsection{MŽdianes et quartiles} \begin{defi} La \textbf{mŽdiane} $m$ est une valeur du caractre ŽtudiŽ telle que la moitiŽ de l'effectif ait des valeurs infŽrieures ˆ $m$ et l'autre moitiŽ des valeurs supŽrieures ˆ $m$. \end{defi} Pour dŽterminer la mŽdiane de $N$ valeurs, on range ces valeurs par ordre croissant. \begin{itemize} \item si $N$ est impair, la mŽdiane $m$ est la valeur du caractre numŽrotŽ $\dfrac{N+1}{2}$ \item si $N$ est pair, la mŽdiane $m$ est le milieu entre les valeurs numŽrotŽes $\dfrac{N}{2}$ et $\dfrac{N}{2}+1$ \end{itemize} \begin{defi} \begin{itemize} \item Le \textbf{premier quartile} est le plus petit ŽlŽment $Q_1$ des valeurs des termes de la sŽrie, tel qu'au moins 25\% des donnŽes sont infŽrieures ou Žgales ˆ $Q_1$. \item Le \textbf{troisime quartile} est le plus petit ŽlŽment $Q_3$ des valeurs des termes de la sŽrie, tel qu'au moins 75\% des donnŽes sont infŽrieures ou Žgales ˆ $Q_3$. \end{itemize} \end{defi} \ex Pour l'entreprise, la mŽdiane est Žgale ˆ: ......................................................\\ Le premier quartile vaut: ......................................................\\ Le deuxime quartile vaut: ...................................................... \section{Statistiques ˆ deux variables} \subsection{Un exemple} Le mur d'une habitation est constituŽ par une paroi en bŽton et une couche de polystyrne d'Žpaisseur variable $x$ (en cm). On a mesurŽ, pour une mme Žpaisseur de bŽton, la rŽsistance thermique $y$ (en m$^2/$watt) de ce mur pour diffŽrentes valeurs de $x$. On a obtenu les rŽsultats suivants~: \begin{center} \includegraphics[scale=0.5]{images/tableau.png} \end{center} Au vu de ce nuage de points, on peut penser que, en premire approximation, il est possible de tracer une droite $D$ au voisinage de ces 9~points. On dit alors que l'on a un {\sl ajustement affine}. \subsection{Point moyen} \begin{defi} On appelle point moyen d'un nuage de $n$ points $M(x_i,y_i)$ le point $G$ de coordonnŽes $$x_G=\bar x=\frac{1}{n}(x_1+x_2+...+x_n)\qquad et\qquad y_G=\bar y=\frac{1}{n}(y_1+y_2+...+y_n)$$ \end{defi} \subsection{Ajustement affine} \begin{enumerate} \item Droite de Mayer: on partage le nuage de points en deux parties et on relie les deux points moyens correspondant ˆ chaque partie. \item Droites de rŽgression: Le calcul s'effectue ˆ la calculatrice \end{enumerate} \end{document}

https://ctan.math.washington.edu/tex-archive/info/examples/Tabellen2/02-05-7.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656104655865.86/warc/CC-MAIN-20220705235755-20220706025755-00157.warc.gz

%% %% A DANTE-Edition example %% %% Beispiel 02-05-7 auf Seite 46. %% %% Copyright (C) 2010 H. Voss %% %% It may be distributed and/or modified under the conditions %% of the LaTeX Project Public License, either version 1.3 %% of this license or (at your option) any later version. %% %% See http://www.latex-project.org/lppl.txt for details. %% %%Run also: >> << % Show page(s) 1 \documentclass[]{article} \pagestyle{empty} \setlength\textwidth{146.59192pt} \setlength\parindent{0pt} \usepackage{booktabs} \begin{document} \begin{tabular}{@{}cccc@{}} Eins&Zwei&Drei&Vier\\\cmidrule{1-2}\cmidrule{3-4} Eins&Zwei&Drei&Vier\\\cmidrule{1-1}\cmidrule{2-2} \cmidrule{3-3}\cmidrule{4-4} Eins&Zwei&Drei&Vier\\\cmidrule(lr){1-2}\cmidrule(lr){3-4} Eins&Zwei&Drei&Vier\\\cmidrule(lr){1-1}\cmidrule(lr){2-2} \cmidrule(lr){3-3}\cmidrule(lr){4-4} Eins&Zwei&Drei&Vier\\\cmidrule(r){1-2}\cmidrule(l){3-4} Eins&Zwei&Drei&Vier\\\cmidrule(r){1-1}\cmidrule(lr){2-2} \cmidrule(lr){3-3}\cmidrule(l){4-4} \end{tabular} \end{document}

https://www.authorea.com/users/237910/articles/309033/download_latex

authorea.com

CC-MAIN-2022-33

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-33/segments/1659882572174.8/warc/CC-MAIN-20220815115129-20220815145129-00636.warc.gz

\documentclass[10pt]{article} \usepackage{fullpage} \usepackage{setspace} \usepackage{parskip} \usepackage{titlesec} \usepackage[section]{placeins} \usepackage{xcolor} \usepackage{breakcites} \usepackage{lineno} \usepackage{hyphenat} \PassOptionsToPackage{hyphens}{url} \usepackage[colorlinks = true, linkcolor = blue, urlcolor = blue, citecolor = blue, anchorcolor = blue]{hyperref} \usepackage{etoolbox} \makeatletter \patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{% \errmessage{\noexpand\@combinedblfloats could not be patched}% }% \makeatother \usepackage[round]{natbib} \let\cite\citep \renewenvironment{abstract} {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize} {\bigskip} \titlespacing{\section}{0pt}{*3}{*1} \titlespacing{\subsection}{0pt}{*2}{*0.5} \titlespacing{\subsubsection}{0pt}{*1.5}{0pt} \usepackage{authblk} \usepackage{graphicx} \usepackage[space]{grffile} \usepackage{latexsym} \usepackage{textcomp} \usepackage{longtable} \usepackage{tabulary} \usepackage{booktabs,array,multirow} \usepackage{amsfonts,amsmath,amssymb} \providecommand\citet{\cite} \providecommand\citep{\cite} \providecommand\citealt{\cite} % You can conditionalize code for latexml or normal latex using this. \newif\iflatexml\latexmlfalse \providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}% \AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \begin{document} \title{~~~ Never give up: Just redefine the dream~~~~} \author[1]{Shambhu Yadav}% \affil[1]{PREreview}% \vspace{-1em} \date{\today} \begingroup \let\center\flushleft \let\endcenter\endflushleft \maketitle \endgroup \sloppy hi \selectlanguage{english} \FloatBarrier \end{document}

http://ofap.ulstu.ru/resources/65/bibentry.tex?subdivision_id=23&association=resources&parent_scaffold=fremantle%2Fguest%2Fsubdivisions&subdivision_id=23

ulstu.ru

CC-MAIN-2021-49

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2021-49/segments/1637964358591.95/warc/CC-MAIN-20211128194436-20211128224436-00464.warc.gz

%% Запись библиографической базы данных BibLaTeX %% Создано движком Фримантл (https://gitlab.com/korobkov/fremantle) %% в 2021-11-29T00:22:31+04:00 %% Фримантл — Свободный движок репозитория электронных ресурсов %% Copyright © 2009—2018 Лаборатория «Автоматизированные системы» scb-as@ulstu.ru, УлГТУ %% %% Фримантл is free software: you can redistribute it and/or modify %% it under the terms of the GNU Affero General Public License as published by %% the Free Software Foundation, either version 3 of the License, or %% (at your option) any later version. %% %% Фримантл is distributed in the hope that it will be useful, %% but WITHOUT ANY WARRANTY; without even the implied warranty of %% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the %% GNU Affero General Public License for more details. %% %% You should have received a copy of the GNU Affero General Public License %% along with Фримантл. If not, see <https://www.gnu.org/licenses/>. \documentclass[a4paper,fontsize=12pt]{scrartcl} \usepackage[portrait,left=1.5cm,right=1.5cm,top=1cm,bottom=1.25cm,bindingoffset=0cm]{geometry} \usepackage{csquotes, filecontents, hyperref, polyglossia, pst-barcode} \usepackage[backend=biber,style=gost-authoryear]{biblatex} \setmainfont{Liberation Serif} \setsansfont{Liberation Sans} \setmonofont{Liberation Mono} \defaultfontfeatures{Scale=MatchLowercase, Mapping=tex-text} \setdefaultlanguage[spelling=modern]{russian} \setotherlanguage{english} \addbibresource{document.bib} \begin{filecontents}{document.bib} @online{65, author = {Негода, Дмитрий Викторович}, date = {1999-11-17}, keywords = {книжный магазин;интернет-магазин}, title = {Книжный интернет-магазин издательства &#39;Венец&#39;}, url = {http://ofap.ulstu.ru/65}, urldate = {2021-11-29} } } \end{filecontents} \begin{document} \nocite{65} \printbibliography \end{document}

http://www.umr-marbec.fr/r3fbas3/search.php?sqlQuery=SELECT%20author%2C%20title%2C%20type%2C%20year%2C%20publication%2C%20abbrev_journal%2C%20volume%2C%20issue%2C%20pages%2C%20keywords%2C%20abstract%2C%20thesis%2C%20editor%2C%20publisher%2C%20place%2C%20abbrev_series_title%2C%20series_title%2C%20series_editor%2C%20series_volume%2C%20series_issue%2C%20edition%2C%20language%2C%20author_count%2C%20online_publication%2C%20online_citation%2C%20doi%2C%20serial%2C%20area%20FROM%20refs%20WHERE%20serial%20%3D%202784%20ORDER%20BY%20created_date%20DESC%2C%20created_time%20DESC%2C%20modified_date%20DESC%2C%20modified_time%20DESC%2C%20serial%20DESC&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=5&rowOffset=&wrapResults=1&citeOrder=creation-date&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

umr-marbec.fr

CC-MAIN-2020-29

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2020-29/segments/1593655886178.40/warc/CC-MAIN-20200704135515-20200704165515-00538.warc.gz

%&LaTeX \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{Rey_etal2020} Rey, C., Darnaude, A., Ferraton, F., Guinand, B., Bonhomme, F., Bierne, N., et al. (2020). Within-Generation Polygenic Selection Shapes Fitness-Related Traits across Environments in Juvenile Sea Bream. \textit{Genes}, \textit{11}(4), 398. \end{thebibliography} \end{document}

http://w3.atomki.hu/p2/authorso/ltxauth/aut20026.tex

atomki.hu

CC-MAIN-2019-39

text/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-39/segments/1568514573465.18/warc/CC-MAIN-20190919081032-20190919103032-00501.warc.gz

\hsize 16. cm \raggedbottom\documentstyle[12pt]{article} \renewcommand\baselinestretch{1.0} % double space \setlength{\textwidth}{6.0in} \setlength{\textheight}{9.0in} \setlength{\oddsidemargin}{0.25in} \setlength{\evensidemargin}{0.25in} \setlength{\topmargin}{0.0in} \setlength{\parindent}{0.3in} \newcommand{\keywords}[1]{{\rm E} {\fbox{\parbox{13.0cm}{\protect\small{#1}}}}} \begin{document} \newcounter{publ} \newcounter{hiv} \begin{center} {Fekete Z. publik\'aci\'oi: \footnote[0]{Ez a lista a NWKUTLST v4.59 (\' \i rta: Zolnai L\'aszl\'o) \'es a \LaTeX\ alkalmaz\'as\'aval k\'esz\"ult.\\Kelt: 2018/10/19\\Jelmagyar\'azat:\\$^{1}$Jelenleg az ATOMKI kutat\'oja,\\$^{2}$Jelenleg nem az ATOMKI kutat\'oja, de az volt,\\$^{3}$Magyar, de nem ATOMKI-s szerz\H o,\\$^{4}$K\"ulf\"oldi szerz\H o,\\$^{+}$A szerz\H o felt\"untette az ATOMKI-t a cikk fejzet\'eben.} } \end{center} \setcounter{publ} { 0} \begin{list}% {\arabic{publ}.}{\usecounter{publ}\setlength{\rightmargin}{\leftmargin}} \begin{center} {Konf. abstract, poszter, el\H oad\'as} \end{center} \item Rajta I.$^{1}$$^{+}$, Szilasi S. Z.$^{1}$$^{+}$, Fenemore R. E. F.$^{4}$, Fekete Z.$^{2}$$^{+}$, D\"ucs\H o Cs.$^{3}$: {\it Si micro-turbine by proton beam writing and porous silicon micromachining.} 11th International Conference on Nuclear Microprobe Technology and Applications. 3rd International Workshop on Proton Beam Writing. Debrecen, Hungary, 20-25 July, 2008{ \bf 0} (2008)0-X./ 0.000$^{ 0}$;N \item Rajta I.$^{1}$$^{+}$, Szab\'o A. T. T.$^{1}$$^{+}$, Nagy G. U. L.$^{1}$$^{+}$, Husz\'ank R.$^{1}$$^{+}$, Barad\'acs E.$^{2}$$^{+}$, F\"urjes P.$^{4}$, Fekete Z.$^{2}$$^{+}$, J\'arv\'as G.$^{3}$, Szigeti M.$^{3}$, Hajba L.$^{4}$, Bodn\'ar J.$^{4}$, Szilasi S. Z.$^{1}$$^{+}$, Guttman A.$^{3}$: {\it Creation of double tilted pillar structures for microfluidic applications.} 14th International Conference on Nuclear Microprobe Technology and Applications. Padova, Italy, 6-11 July, 2014{ \bf 0} (2014)0-X./ 0.000$^{ 0}$;N \item Rajta I.$^{1}$$^{+}$, Nagy G. U. L.$^{1}$$^{+}$, Husz\'ank R.$^{1}$$^{+}$, Szab\'o A.$^{1}$$^{+}$, F\"urjes P.$^{4}$, Fekete Z.$^{2}$$^{+}$, J\'arv\'as G.$^{3}$, Szigeti M.$^{3}$, Guttman A.$^{3}$: {\it Proton beam micromachining, microfluidical applications (Abstr.: p. 191).} 15th Joint Vacuum Conference. JVC 15. Vienna, 15-20 June, 2014{ \bf 0} (2014)0(1)/ 0.000$^{ 0}$;N \item J\'arv\'as G.$^{3}$, Rajta I.$^{1}$$^{+}$, Husz\'ank R.$^{1}$$^{+}$, Szab\'o A. T. T.$^{1}$$^{+}$, Nagy G. U. L.$^{1}$$^{+}$, Szilasi S. Z.$^{1}$$^{+}$, F\"urjes P.$^{4}$, Holczer E.$^{4}$, Fekete Z.$^{2}$$^{+}$, Szigeti M.$^{3}$, Hajba L.$^{4}$, Bodn\'ar J.$^{4}$, Guttman A.$^{3}$: {\it Tilted micropillars: A new alternative to increase microfluidic cell capture efficiency.} 12th International Interdisciplinary Meeting on Bioanalysis. CECE 2015. Brno, Chech Republic, 21-23 Sept., 2015{ \bf 0} (2015)0-X./ 0.000$^{ 0}$;N \begin{center} {\'Evk\"onyv } \end{center} \item Rajta I.$^{1}$$^{+}$, Szilasi S. Z.$^{1}$$^{+}$, F\"urjes P.$^{4}$, Fekete Z.$^{2}$$^{+}$, D\"ucs\H o Cs.$^{3}$: {\it Si Micro-turbine by Proton Beam Writing and Porous Silicon Micromachining.} Atomki Annual Report 2008{ \bf 0} (2009)69-X./ 0.000$^{ 0}$;N \end{list} \end{document}

https://git.lysator.liu.se/ceder/ceder-1616-generations-topgit/-/raw/cd1a12091dd4be521055477d62e7ced91139d019/doc/Protocol-A.texi?inline=false

liu.se

CC-MAIN-2021-10

text/plain

application/x-tex

crawl-data/CC-MAIN-2021-10/segments/1614178361808.18/warc/CC-MAIN-20210228235852-20210301025852-00007.warc.gz

\input texinfo @c -*-texinfo-*- @c $Id: Protocol-A.texi,v 1.37 1998/10/11 15:21:32 jsk Exp $ @c %**start of header @setfilename protocol-a.info @settitle LysKOM Protocol A @setchapternewpage odd @c %**end of header @iftex @parindent 0pt @font@tensltt=cmsltt10 @begin tex \global\def\rett#1{{\let\t\sltt\tt #1}} \global\def\sltt#1{{\fam\ttfam\tensltt\let\t\rett #1}} \global\let\t\sltt @end tex @end iftex @ifinfo This is the specification of LysKOM Protocol A v. 9.0 Copyright @copyright{} 1995, 1996 Lysator ACS. Permission is granted to make and distribute verbatim copies of this specification provided the copyright notice and this permission notice are preserved on all copies. @end ifinfo @dircategory LysKOM @direntry * Protocol A: (protocol-a). The LysKOM Protocol A specification. @end direntry @titlepage @sp 10 @title{LysKOM Protocol A} @sp 2 @subtitle{Protocol version 10.0} @sp 2 @author by the LysKOM Developers @page @vskip 0pt plus 1filll Copyright @copyright{} 1995 Lysator ACS Permission is granted to make and distribute verbatim copies of this document provided the copyright notice and this permission notice are preserved on all copies. Modified versions of this document may be redistributed with the added condition that all modifications not cleared with the LysKOM development group are clearly marked and that the entire modified work be redistributed under the same conditions as the original. Permission is granted to copy and distribute translations of this manual into another language under the same conditions as for modified versions. @end titlepage @ifinfo @node Top, Overview, (dir), (dir) @comment node-name, next, previous, up This document specifies LysKOM Protocol A, version 9.0. FIXME: This document is not yet published. The document you are looking at has the version numbers all wrong. This will be fixed before publication. @menu * Overview:: * Introduction:: * Data Types:: * Protocol Requests:: * Asynchronous Messages:: * Error Codes:: * LysKOM Content Types:: * The User Area:: * Writing Clients:: * Type Index:: * Request Index:: @end menu @end ifinfo @node Overview, Document Revision History, Top, Top @chapter Overview LysKOM is a conferencing system@footnote{Or in modern terms, enabling technology for Computer-Supported Cooperative Work (CSCW).}. Similar systems were QZ-KOM and PortaCOM@footnote{Also known as ``PottaKOM'' and ``BortaKOM.''}. The LysKOM system is copyrighted by Lysator Academic Computing Society and distributed under conditions of the GNU Public License. LysKOM and its documentation is provided ``as is'' without warranty of any kind. This document specifies version 10.0 of protocol A used between a LysKOM client and a LysKOM server. Anything described here as ``unspecified'' is liable to change in future protocol versions. This specification is the work of several people. The main contributors have been Per Cederqvist @code{<ceder@@lysator.liu.se>}, David Byers @code{<byers@@lysator.liu.se>}, @ifinfo Pär @end ifinfo @iftex P@"ar @end iftex Emanuelsson @code{<pell@@lysator.liu.se>}, Thomas Bellman @code{<bellman@@lysator.liu.se>}, Lars Aronsson @code{<aronsson@@lysator.liu.se>}, Linus Tolke @code{<linus@@lysator.liu.se>} and @ifinfo Kent Engström @end ifinfo @iftex Kent Eng@-str@"om@penalty-10000 @end iftex @code{<kent@@lysator.liu.se>}. The LysKOM developers can be reached by email to @code{lyskom@@lysator.liu.se}. @menu * Document Revision History:: * Protocol Revision History:: * Protocol Design Principles:: * Notation:: @end menu @node Document Revision History, Protocol Revision History, Overview, Overview @section Document Revision History @table @asis @item 9.0: @i{In progress} Protocol version 9 is begin developed and this document needs to be updated. @item 8.0: 1995-11-10 Protocol version 8 is being documented. This specification was translated to English and converted to Texinfo by David Byers. @item 7.1: 1995-01-08. Protocol and document revision history were added by Per Cederqvist. Outline mode was used to make the document more manageable. This version was distributed with lyskomd 1.7.1. @item 7.0: 1994-12-31. The first specification with a version number. All calls that had been added since 1991-06-25 were documented. Pell and Per Cederqvist did the deed. This version was distributed with lyskomd 1.7.0. @item 1993-05-19. Linus Tolke wrote comments for some calls that were without comments. @item 1992-07-06. Linus Tolke converted the document to ISO 8859-1. @item 1991-08-12. Per Cederqvist started using version control for documentation. @item 1991-06-25. Lars Aronsson documented the protocol that was in use at the time. @end table @node Protocol Revision History, Protocol Design Principles, Document Revision History, Overview @section Protocol Revision History @subsection Protocol version 10.0 @table @asis @item New Server Calls @itemize @bullet @item 85=get-collate-table @item 86=create-text @item 87=create-anonymous-text @item 88=create-conf @item 89=create-person @item 90=get-text-stat @item 91=get-conf-stat @item 92=modify-text-info @item 93=modify-conf-info @item 94=get-info @item 95=modify-system-info @item 96=query-predefined-aux-items @item 97=set-expire @item 98=query-read-texts @item 99=get-membership @item 100=add-member @item 101=get-members @end itemize @item Removed Server Calls @itemize @bullet @item 5=create-person @item 9=query-read-texts @item 10=create-conf @item 14=add-member @item 26=get-text-stat @item 28=create-text @item 36=get-info-old @item 46=get-membership-old @item 48=get-members-old @item 50=get-conf-stat @item 59=create-anonymous-text @end itemize @item New and New Modified Structures @itemize @bullet @item Aux-Item @item Aux-Item-Input @item Conference @item Info @item Member @item Membership @item Membership-Type @item Misc-Info @item Text-Stat @end itemize @item New Asynchronous Messages @itemize @bullet @item async-deleted-text message @item New async-new-text message @end itemize @end table @subsection Protocol version 9.0 @table @asis @item Added Commands @itemize @bullet @item 79=set-info: Can change server information. @item 80=accept-async: Can select asynchronous messages to receive. @item 81=query-async: Can query which messages are being send. @item 82=user-active @item 83=who-is-on-dynamic @item 84=get-static-session-info @end itemize @end table @subsection Protocol version 8.0 @table @asis @item Added Functionality @itemize @bullet @item 30=add-recipient: Can change recpt to cc_recpt and vice versa. @item 21=set-conf-type: Accepts Conf-Type and Extended-Conf-Type. @item 10=create-conf: Accepts Conf-Type and Extended-Conf-Type. @end itemize @item New Commands @itemize @bullet @item 77=set-last-read @item 78=get-uconf-stat @end itemize @end table @subsection Protocol version 7 (first implemented in lyskomd 1.7.0) @table @asis @item Added Functionality @itemize @bullet @item 53=send-message: Recipient can be a conference or a person. @end itemize @item New Commands @itemize @bullet @item 74=re-z-lookup @item 75=get_version_info @item 76=lookup_z_name @end itemize @item Other @itemize @bullet @item The asynchronous message 1=i-am-off has been removed @end itemize @end table @subsection Protocol Version 6 (first implemented in lyskomd 1.4.0) @table @asis @item New Calls @itemize @bullet @item 67=lookup_person @item 68=lookup_conf @item 69=set_client_version @item 70=get_client_name @item 71=get_client_version @item 72=mark_text @item 73=unmark_text @end itemize @end table @subsection Protocol Version 5 (first implemented in lyskomd 1.3.0) @table @asis @item New Calls @itemize @bullet @item 65=re_lookup_person @item 66=re_lookup_conf @end itemize @end table @subsection Protocol Version 4 (first implemented in lyskomd 1.1.1) @table @asis @item New Calls @itemize @bullet @item 62=login @item 63=who_is_on_ident @item 64=get_session_info_ident @end itemize @end table @subsection Protocol Version 3 (first implemented in lyskomd 1.1.0) @table @asis @item New Calls @itemize @bullet @item 61=find_previous_text_no @item 60=find_next_text_no @item 59=create_anonymous_text @item 58=get_last_text @end itemize @end table @subsection Protocol Version 2 (first implemented in lyskomd 0.30.0) @table @asis @item New Calls @itemize @bullet @item 57=set_user_area @end itemize @end table @subsection Protocol Version 1 (first implemented in lyskomd 0.29.2) @table @asis @item New Calls All calls from 0--56. @end table @node Protocol Design Principles, Notation, Protocol Revision History, Overview @section Transport Protocol Requirements LysKOM protocol A can be run on top of any reliable, bidirectional, 8-bit data stream. All current implementations use TCP/IP. At Lysator port 4894 is used on the host @code{kom.lysator.liu.se}. Data in protocol A is ASCII clear text except within Hollerith strings, where arbitrary eight-bit characters are allowed. Data arguments are separated by whitespace. The reason for this unorthodox design is that the protocol should be usable from a text-only terminal, something that is very useful during server and early client development. @node Notation, , Protocol Design Principles, Overview @section Notation This specification uses a BNF-like grammar to describe the protocol and its data elements. It does not use ASN.1 because we don't know ASN.1 and probably wouldn't like it very much even if we did. Data fields have been given names that start with a lower-case letter. Fundamental data types have names in all-caps (such as @code{INT32} and @code{ARRAY}). Derived data types have names that start with an upper-case letter. (If the type contains more than one word, all words start with an upper-case letter, like this: @code{Text-Stat}.) The operator @code{::=} defines the name to its left. Comments start with @code{!} (exclamation mark) and alternatives are separated by a @code{|} (vertical bar.) A @code{;} (semicolon) terminates statements in the grammar. In some specifications there are literal strings. There is to be no whitespace before or after literal strings unless there is whitespace in the literal itself. @node Introduction, , , Top @chapter Introduction This chapter introduces the concepts used in LysKOM, such as articles, conferences and sessions. @menu * Articles :: * Conferences :: * Persons and Sessions :: * The Misc-Info List :: * The Aux-Item List :: * Security :: * Membership and Reading:: * Client-Server Dialog :: @end menu @node Articles, Conferences, , Introduction @section Articles An article is represented as a value of the type @code{Text-Stat} and a string containing the article contents. An article will usually have one or more recipients and may be a comment or footnote to other articles. Each article is kept in the database until it is older than the @code{nice} value of each of its recipients and it is not marked by any user. Currently there is a structure called a @code{Misc-Info-List} associated with the @code{Text-Stat}. This list contains information about recipients, senders, comments and footnotes. In the future the information contained in the @code{Misc-Info-List} will be integrated into the @code{Text-Stat}. Every article has at least one number, the global article number. Global numbers are assigned in ascending order to new articles, and are never reused. If an article has recipients it will also have a local number for each recipient. Local numbers are used in some data structures to provide more compact storage and to provide an ordering of articles for a particular recipient. Local numbers are assigned in ascending order and are never reused for a particular recipient, though different recipients will have articles with the same local numbers. Occasionally it is necessary to map between local and global numbers. The server call @code{local-to-global} does this. @node Conferences, Persons and Sessions, Articles, Introduction @section Conferences Conferences hold articles. They are represented in the protocol as a data type called @code{Conference}. Each conference has a @emph{creator}, the person who created the conference, and a @emph{supervisor}, a conference whose members can modify the conference. If the supervisor is a person, the members of that person's letterbox are supervisors, which in most cases is only that person. We have also introduced a type called @code{UConference} (pronounced micro-conf-stat) which holds a subset of the information contained in the full @code{Conference} type. Use the @code{UConference} type whenever possible since it places a much smaller load on the LysKOM server. Each conference has a type, which is essentially a collection of boolean flags. Currently the flags @code{rd-prot}, @code{letterbox}, @code{secret}, @code{original} and @code{allow-anonymous} are defined. @table @code @item rd-prot The conference is protected from reading by non-members. Persons become members by having one of the existing members or supervisors add him or her to the conference. This restriction is enforced by the server. @item original Conferences of this type are intended for original articles only. Comments are to be redirected to the super-conference instead. This restriction is currently not enforced by the server; clients must implement this functionality. @item letterbox Conferences of this type are connected to persons. Letters to a person are sent to the letterbox and the name of the letterbox is synchronized with the person name. It is currently not possible to explicitly set or clear this flag on a conference. @item secret Conferences of this type are secret. The server will not divulge any information of the existence of the conference to persons who are not members or supervisors of the conference. If a letterbox is made secret, that person cannot log in using the person name, but must specify a person number instead. @item allow-anonymous Conferences of this type accept anonymous articles. Other conferences will reject anonymous articles. @end table @node Persons and Sessions, The Misc-Info List, Conferences, Introduction @subsection Persons and Sessions Persons are represented in the protocol by values of the type @code{Person}. Associated with persons are statistics, a set of personal flags and a set of privileges (@pxref{Security}.) Persons are also associated with a conference that has the same number as the person and the @code{letterbox} bit set. Connections to the server are represented as values of the type @code{Static-Session-Info}, @code{Session-Info-Ident} or @code{Session-Info}. Sessions have session number that are unique for each session in the lifetime of the server execution. A single user can have several sessions running at once. The session is not released until the network connection is closed; a user can log in and out repeatedly in a single session. @node The Misc-Info List, The Aux-Item List, Persons and Sessions, Introduction @section The Misc-Info List The @code{Misc-Info} list contains tagged data. The fields are sent in groups pertaining to a particular type of information: information about recipient; carbon copy recipient; blank carbon copy recipient; comment to; footnote to; comment in and footnote in. The information groups may be sent in any order and there may be any number of groups. Within each group the elements are always sent in the order listed below. @subsection Recipient @table @code @item recpt Starts a recipient group. It contains the conference number of a recipient of the article. @item loc-no Always present within a recipient group. It contains the local text number of the article in the conference specified by the preceding @code{recpt} field. @item rec-time If the recipient is a person, this element is added by the server when the recipient marks the article as read. It contains the time when the text was read. @item sent-by Present when the recipient was added by a person other than the author (after the article was created.) It contains the person number of the person who added the recipient. @item sent-at Present when the recipient was added after the article was created. It contains the time when the recipient was added. @end table @subsection Carbon Copy (CC) Recipient The carbon-copy recipient group is identical to the recipient group above. The difference is how new comments to an article with a recipient or carbon-copy recipient are treated. A comment to an article is sent to all recipients, but not to carbon-copy recipients of the original article. This difference is enforced by the clients. @table @code @item cc-recpt Starts a carbon-copy recipient group. It contains the conference number of a carbon-copy recipient of the article. @item loc-no Always present in a CC recipient group. It contains the local text number of the article in the conference specified by the most recent @code{cc-recpt} field. @item rec-time Present after the CC recipient has read the article. It contains the time when the article was read. Since only persons can read articles this will only be seen if the CC recipient is a person. @item sent-by Present when a CC recipient was added by a person other than the author after the article had been created. It contains the person number of the person who added the CC recipient. @item sent-at Present when a CC recipient was added after the article had been created. It is the time when the CC recipient was added. @end table @subsection Blank Carbon Copy (BCC) Recipient The blank carbon-copy recipient group is identical to the carbon-copy recipient group above. The difference is the visibility of the information. A carbon-copy recipient group is visible to anyone that is allowed to fetch both the text status of the involed text and the conference status of the involved conference. (That is, as long as the conference isn't secret everybody is allowed to se the carbon-copy recipient group.) A BCC recipient group is only visible to members and supervisors of the recipient. This is enforced by the server. This type of group was introduced in protocol version 10. When old-style calls such as @code{@xref{get-text-stat-old}} are used this will be converted to a CC recipient group by the server for the benefit of clients that don't understand this group. @table @code @item bcc-recpt Starts a blank carbon-copy recipient group. It contains the conference number of a blank carbon-copy recipient of the article. @item loc-no Always present in a BCC recipient group. It contains the local text number of the article in the conference specified by the most recent @code{bcc-recpt} field. @item rec-time Present after the BCC recipient has read the article. It contains the time when the article was read. Since only persons can read articles this will only be seen if the BCC recipient is a person. @item sent-by Present when a BCC recipient was added by a person other than the author after the article had been created. It contains the person number of the person who added the BCC recipient. @item sent-at Present when a BCC recipient was added after the article had been created. It is the time when the BCC recipient was added. @end table @subsection Comment To @table @code @item comm-to Always present when the article is a comment to another article. @item sent-by Present when the article was added as a comment by a person other than the author, after the article had been created. It contains the person number of the person who added the article as a comment. @item sent-at Present when the article was added as a comment after the article had been created. It contains the time when is was added as a comment. @end table @subsection Footnote To @table @code @item footn-to Always present when the article is a footnote to another article. @item sent-at Present when the article was added as a footnote after the article had been created. It contains the time when is was added as a footnote. @end table @subsection Comment in @table @code @item comm-in Present when there are comments to this article. It contains the article number which is a comment to this article. @end table @subsection Footnote in @table @code @item footn-in Present when there are footnotes to this article. It contains the article number which is a footnote to this article. @end table @node The Aux-Item List, Security, The Misc-Info List, Introduction @subsection The Aux-Item List The aux-item list is used as a generic extension mechanism in the LysKOM server and in protocol A. @menu * About Aux-Items :: * Predefined Aux-Item Types :: * Client-Specific Aux-Item Types :: * Experimental Aux-Item Types :: * Defining New Aux-Item Types :: @end menu @node About Aux-Items, Predefined Aux-Item Types, , The Aux-Item List @subsubsection About Aux-Items Aux-items were introduced in protocol version 10 as a mechanism for extending the conference, text and server information structures without changing the protocol. Persons were excluded since nobody could figure out a case where setting an aux-item on the letterbox wasn't as good as setting it on the person (another reason was that I was fed up writing aux-item code by the time they were working on texts and conferences.) The exact structure of an aux item is specified elsewhere (@pxref{LysKOM Data Types}). The important fields here are the aux-no, tag and data fields. The aux-no field is used to identify an item. The aux-no together with a text or conference number uniquely identifies a particular aux item. Items are numbered from one and up within each item list. Once assigned, the aux-no for an item is never changed. New items are guaranteed to be assigned numbers that have never been used before within a particular list. The tag field identifies the type of aux item. It is used by the server and by clients to figure out how to interpret the data field, and by the server to decide if the item needs special treatment. The data field is a simple string. The meaning of the string is determined by the tag field, but since it is a string, clients that have no understanding of the contents can successfully parse the item anyway (in contrast to items in the misc-info list.) @node Predefined Aux-Item Types, Client-Specific Aux-Item Types, About Aux-Items, The Aux-Item List @subsubsection Predefined Aux-Item Types Predefined Aux-Item types are part of Protocol A, and clients are encouraged to support all of them. As with other parts of the protocol, changes to these item types will probably always be backwards-compatible. Predefined types can case serious magic to be invoked in the server. There is no limit to the strangeness that may be associated with this type of item. The server may also place limits on who may create predefined items, might verify the data field, and can force any field in the item to a specific value, no matter what the client specified. All items with tags in the range 1-9999 and 30000 and up are considered predefined. If a client attempts to create an item with a tag in this range, but the server has no idea what that tag means, the server will return an error (KOM_ILL_AUX.) @table @samp @item content-type [1] (text) Specifies the content type of a text. Data is a valid MIME type of one of the special LysKOM types (@pxref{LysKOM Content Types}.) This item may only be set by the author of a text. The inherit, secret and hide-owner bits are cleared. Only one content-type item can be created per creator. @item fast-reply [2] (text) Data is a string that constitutes a brief comment to the text. This comment should be displayed immediately after the text body. The inherit bit is automatically cleared. @item cross-reference [3] (text, conference) Data is a cross-reference to something else. The contents must match "\(T\|C\|P\)\([0-9]+\) \(.*\)", where \1 specifies if the cross reference leads to a text, conference or person, \2 specified the number of the target (text-no, conf-no or pers-no) and \3 is simply descriptive text. The inherit bit is automatically cleared. @item no-comments [4] (text) When this item is set, the author requests that nobody comments the text. This is advisory only; it is still possible to write comments, but clients should advise the user that this is contrary to the author's wishes. Data should be empty. This item may only be set by the author. The secret, hide-creator and inherit bits are automatically cleared. @item personal-comment [5] (text) When this item is set, the author requests only personal comments. This is advisory only; it is still possible to create regular comments, but clients should advise the user that the author prefers a personal comment. Data should be empty. This item may only be set by the author. The secret, hide-creator and inherit bits are automatically cleared. @item request-confirmation [6] (text) The author requests that everyone who reads the text confirms having done so by creating read-confirmation items on the text. Clients should ask users if they wish to confirm having read the text when it is displayed. Data should be empty. The hide-creator, secret and inherit bits are automatically cleared. @item read-confirm [7] (text) This item can be taken as confirmation that the item creator has read the text to which the item is attached. Clients should never ever create this item without an explicit confirmation from the user that the text has indeed been read. The hide-creator, secret and inherit bits are automatically cleared. @item redirect [8] (conference) When set, messages sent directly to the conference should really be sent elsewhere. Data is PROTOCOL:ADDRESS where PROTOCOL is either "E-mail" or "LysKOM", and ADDRESS is either an e-mail address or a LysKOM conference. Hopefully we'll be able to replace this with a forwarding mechanism later. This item can only be set by the conference supervisor or in the case of a letterbox, the person attached to the letterbox. The hide-creator and secret bits are cleared automatically. Only one redirect can be specified. @c FIXME: who is responsible for the redirect? The client? The server? @c A magic redirecting client? @item x-face [9] (conference) Data is the face of the person in compface format. Cool, innit? This item can only be set by the conference supervisor or in the case of a letterbox, the person attached to the letterbox. The hide-creator and secret bits are cleared automatically. @item alternate-name [10] (text, conference) Data is a string that the client may use as an alternate to the name of a conference or the subject of a text. The inherit flag is automatically cleared. @item pgp-signature [11] (text) Data is a PGP signature of the text. The signature should be the equivalent of what "pgp -sba" generates. The secret, hide-creator and inherit bits are automatically cleared. Signatures cannot be deleted once they have been created. @item pgp-public-key [12] (letterbox) Data is the public key of the person. It is desirable that the public key contains a userid of the format "LysKOM <p\([0-9]\)@@\(.*\)>+", where \1 is the number of the person in the LysKOM server specified in \2. This item can only be set by the person himself. The hide-creator, secret and inherit bits are automatically cleared. @item e-mail-address [13] (conference, letterbox, server) Data is an RFC 822-style email address. When set on a letterbox, it should be the email address of the person. If the person has multiple email addresses he may set serveral e-mail-address aux-items. The meaning of this aux-item when set on a conference that isn't a letterbox is... vague. For a conference that is used as to import a mailing list this should be the email address of the list (or the subscription address? FIXME.). When this aux-item is set on the server it shold contain the email address of the administrator (or administrators). This aux-item can only be set by the administrator. The creator cannot be hidden. @item faq-text [14] (conference, server) Data is a decimal text number, which is a FAQ for the conference (or server). This aux-item can only be set by the administrator. @item creating-software [15] (text) Data is the name and version number of the client that created the text. This aux-item can only be set by the author of the text. Once set, it cannot be removed or changed. A typical value would be @samp{elisp-client 0.47.3}. Setting the creating-software aux-item is optional. The data should be the client name, a space, and the client version used in the @code{set-client-version} call. The server may enforce this restriction. @item x-author [15] (text) For imported texts using email gateway. Data is a string with the (readable) name of the author. Kom clients should show this field instead of the id of the importing kom-id. @item x-from [16] (text) Data is a plain email addres, the From: field from an imported email. Used by the kom client to construct an email reply to an imported text. @item x-reply-to [17] (text) Data is a plain email addres, comes from the Reply-To: field @item x-to [18] (text) Data is one email address can be in variable format. Multiple text-items can be present. The format is the same as is allowed in To: fields in emails. If the text is imported these are the other receivers as seen in the email. If the text originates from a kom-person (and thus not an importer) this field is used in constructing an email, if an exporter is present. @item x-cc [19] (text) Data in the same format as for "x-to". Usage the same but will be a carbon copy instead. @item x-date [20] (text) Data is the send-date of a imported email. Can be in free format, even if a readable format, such as "YYYY-MM-DD hh:mm:ss", is preferred. Kom client should display this date as originating date, date of the imported text entity in kom may be different (and can be shown as received). In case of the text being exported from kom, this date is set by the exporter. @item x-msgid [21] (text) Data is a string which is the message id from the imported email. Preferably the importer should only add receivers when importing the same email more times with the same msg-id. When a text is exported, the x-msgid is constructed as an email address which contains the kom text number and server in an unique way. @item x-inreplyto [22] (text) Data is a string which stores the message id of texts commented. For each such text a kom (comment) link should be creaeted by the importer if these referenced emails previously has been imported. @item x-misc [23] (text) Data is a string with the rest of the fields from an imported email. Is set by the importer. The fields are concatenated with "\n". @item x-allow-filter [24] (conf) Data is a regexp string which allows a sender (a field in the email-header) to import the message. Several can exist, it is enough if one matches (OR) and none dissallows (AND). Can be set by an organizer of the conference. The regexp allows ^[]?* as constructs. The importer is required to check these when adding recipient of an imported text and comply. Example of usage: "From:*.liu.se*", "From:*jsk*". Tests are not made on the text-body. However, if the string starts with a "!" the email will be rejected if the rest matches, even if one of the filter allowed it. Example: "!From:*aol*", "!Subject:*money*". @item x-reject-forward [25] (conf) Data is a string with either an email name on the format "E:email@foo.bar" or a kom-conference "C:num" number. The mail is forwarded if it was rejected by "x-import-filter" to this address. @end table @node Client-Specific Aux-Item Types, Experimental Aux-Item Types, Predefined Aux-Item Types, The Aux-Item List @subsubsection Client-Specific Aux-Item Types Client-specific items do not cause the server to perform any magic. All the flags (except the delete flag) are left untouched, the data is not validated in any way, and anyone can create any item. If you need more server support than this, your item should be on the predefined list. All tags in the range 10000-19999 are reserved for clients. Blocks of 100 numbers at a time can be assigned to specific clients. A client should never create items with tags in a range assigned to another client or in an unassigned range. Assigned ranges will never change. Currently, the following ranges are assigned to clients: @itemize @bullet @item 10000-10099: The Elisp Client @end itemize If you want a range of numbers, send e-mail to the LysKOM development group. @node Experimental Aux-Item Types, Defining New Aux-Item Types, Client-Specific Aux-Item Types, The Aux-Item List @subsubsection Experimental Aux-Item Types Experimental numbers are free for all. Use 'em any way you want. All numbers in the range 20000-29999 are for experimental use. @node Defining New Aux-Item Types, , Experimental Aux-Item Types, The Aux-Item List @subsubsection Defining New Aux-Item Types If you want a new predefined item type, just document what it does, what the data format looks like and what the server is to do with the item and send this to the LysKOM development group. We'll assign a number to your item and put the documentation in this document. If you're not sure what you want the data to look like yet, make a note in your documentation that the data format might change. Once you have a data format you're happy with, update the documentation so others may use your item. If you need serious magic in the server (more than can be specified with the lyskomd configuration file), you'll probably have to write the code yourself, or hope that the development group thinks your idea is so cool we do the job for you. The idea is not to reject any type of item, unless there's already an item type that does the job just as well. Adding item types should be a much less painful process than adding new calls. @node Security, Membership and Reading, The Aux-Item List, Introduction @subsection Security Security in LysKOM is based on two components. Each person has a set of privileges and each session has a security level. Rights in the system require both the sufficient privileges and a sufficient security level. The privileges currently available are wheel, admin, statistic, create-conf, create-pers and change-name. Security levels range from 0 to 255. @table @code @item wheel @emph{Normally not assigned} @table @asis @item Level 0 Person may always log in, even when LysKOM is crowded. @item Level 6 Person may set Priv-Bits for all persons. @item Level 7 Person may set password for all persons. @item Level 8 Person acts as supervisor for everything. @item Level 10 Person can read all articles. @end table @item admin @emph{Normally not assigned} @table @asis @item Level 1 Shut down the server@* Set motd_of_kom@* Read last_login @item Level 2 Read status of secret conferences and persons@* Read the protected parts of person and conference statuses@* Read the entire text status, even when there are secret recipients @item Level 3 Change everybody's names @item Level 4 Add/remove members@* Add/remove recipients to articles @item Level 5 Set super-conference@* Remove articles @item Level 6 Set administrator @end table @item statistic @emph{Normally not assigned} @table @asis @item Level 2 Read the statistics portions of persons, even if protected @end table @item create_conf @emph{Normally assigned} @table @asis @item Level 0 Create conferences @end table @item create_pers @emph{Normally assigned} @table @asis @item Level 0 Create persons @end table @end table @node Membership and Reading, Client-Server Dialog, Security, Introduction @section Membership and Reading Persons' memberships in conferences are represented in the protocol as arrays of @code{Membership}-typed values. This structure contains a record of what the person has read in that conference. The first part of the record is the @code{last-text-read} field. It contains the highest local text number such that the person has read every text with an equal or lower local number. The second part of the record is the @code{read-texts} array, which contains the local text numbers higher than @code{last-text-read} that are also read. Finding out which articles a person has read in a particular conference requires a few calls. Normally, a client will retrieve a batch of perhaps 50 articles at a time. The outline of the process is as follows: @enumerate @item Fetch the membership to get the @code{last-text-read} @item Translate 50 local numbers starting as @code{last-text-read} to global numbers. @item Remove the local numbers that are in @code{read-texts} from the result @item Get and translate more texts as needed. @end enumerate The process is complicated because of the translation between local and global text numbers. In the future there will hopefully be a single call that does this work in the server. @node Client-Server Dialog, ,Membership and Reading , Introduction @section Client-Server Dialog The client-server dialog consists of two phases, establishing the connection and the LysKOM session itself. @subsection Connecting to the Server A connection to the server is initiated by connecting to the appropriate network port@footnote{The default port for a LysKOM server is 4894} and sending a single letter which is used to select a protocol version followed by connection information required by that protocol. In protocol A the connection information is a Hollerith string saying who the user connecting is followed by a newline character. When the server has accepted the connection its reply is protocol-dependent. Protocol A servers will reply with the string @code{LysKOM} on a single line. @example % telnet kom.lysator.liu.se Trying 130.236.254.151 ... Connected to varg.lysator.liu.se. Escape character is '^]'. A5Hbyers LysKOM @end example After connecting, calls to the server can be made. Most calls require the user to log in, but some calls can be made without a log-in. Calls to the server are made by sending a reference number followed by the call as specified. @example server-call ::= ( ref-no : INT32; request : Protocol-Request; ) @end example At some future point the server will reply with the result of the request or an error code preceded by an indicator and the reference number. @example server-reply ::= ok-reply | error-reply; ok-reply ::= ( "=" ref-no : INT32; reply-data; ) error-reply ::= ( "%" ref-no : INT32; error-no : Error-No; error-status : INT32; ) error-no ::= INT32; @end example Our notation is not flexible enough to specify the two-way nature of the communication. @code{ref-no} in the reply is always the same as @code{ref-no} in the corresponding request. @code{reply-data} depends on which request was made and is specified together with each request. Please note that there is no whitespace after the initial indicator in the reply. Error reporting is covered in more detail in chapter @ref{Error Codes}. @node Data Types, , , Top @chapter Data Types The data types in protocol A come in two flavors. The first (vanilla) are the simple data types from which the LysKOM (chocolate) data types are built. Simple data types include things like integers and strings while complex data types include things such as conferences and people. @menu * Simple Data Types:: * LysKOM Data Types:: * Name Expansion:: @end menu @node Simple Data Types, LysKOM Data Types, Data Types, Data Types @section Simple Data Types Data elements are sent from client to server separated by one or more ASCII spaces (0x20), tab characters (0x09), line feeds (0x0A) or carriage returns (0x0D.) In messages from server to client the data elements are separated by exactly one space character and the entire message terminated with a line feed. @subsection Integers @tindex INT32 @tindex INT16 @tindex INT8 @tindex BOOL @dfn{INT32}, @dfn{INT16}, @dfn{INT8} and @dfn{BOOL} are non-negative integers which must fit in 32, 16, 8 and 1 bits, respectively. They are transmitted to the server in ASCII-encoded decimal notation. @subsection Strings @tindex HOLLERITH @dfn{HOLLERITH} denotes character strings of arbitrary length. They are transmitted as @code{<n>H<text>} where @code{<text>} is the string and @code{<n>} is the number of characters in @code{<text>} in decimal notation. All byte values are allowed in the string itself, including nulls. Long live FORTRAN! @subsection Bit Strings @tindex BITSTRING @dfn{BITSTRING} is a string of bits, commonly used for a set of boolean-valued flags. Bit strings are denoted as @example BITSTRING ( name-1; name-2; name-3; ... ) @end example in this specification. They are transmitted as a sequence of ASCII ones and zeroes in the order the fields are listed. For instance, given the specification @example shape-of-world : BITSTRING ( is-flat; is-round; is-2d; is-3d; ) @end example most peoples idea of @code{shape-of-world} would be sent as @code{0101} (round and three-dimensional.) @subsection Arrays @tindex ARRAY @dfn{ARRAY} is a list of a fixed number of elements of a single type. The specification for an array is @code{ARRAY <type>} where @code{<type>} is the type of the array elements. Arrays are transmitted as an @code{<n> @{ <element> <element> ... @}} where @code{<n>} is the number of elements and each @code{<element>} is an element of the array. A special case is when the array is empty, in which case the server transmits it as @code{0 *}. Note that the client must always transmit empty arrays as @code{0 @{ @}}. In some calls the client can ask the server not to send the array contents, only its length. In these cases the array is transmitted as @code{<n> *} where @code{<n>} is the number of elements in the array. @subsection Selection @tindex SELECTION @dfn{SELECTION} is tagged data. It consists of an INT32 selector followed by a tail of an arbitrary type and is specified as @example SELECTION ( <n>=<name> <tail> : <type>; <n>=<name> <tail> : <type>; ... ) @end example where each @code{<n>} is the selector value, @code{<name>} the selector name and @code{<tail>} the name of the selector tail and @code{<type>} its type. When transmitted, the selector is transmitted as an INT32 followed by the tail belonging to that selector. For instance, given the specification @example phrase : SELECTION ( 1=hello name : HOLLERITH; 2=howdy ; ) @end example two legal messages of the type @code{phrase} are @samp{1 4HJohn} and @samp{2}. @subsection RPC @tindex RPC @dfn{RPC} is a notation used to specify calls to the server. An RPC specification has the following form: @example RPC ( <call> <<n>> ( <request> ) -> ( <reply> ) ; <call> <<n>> ( <request> ) -> ( <reply> ) ; ) @end example where each @code{<call>} is the name of a call, @code{<n>} is the call number, @code{<request>} is a single data element sent as a request and @code{<reply>} is a single data element sent in reply from the server. RPC calls are transmitted as @code{<n> <request>} where @code{<n>} and @code{<request>} have the same meaning as above. Note that in the client-server dialog a reference number must also be supplied with each request. This reference number is not part of the RPC itself, but is required for communications @xref{Client-Server Dialog}. @subsection Structure Structures are collections of several data items. In the specification they are written as @example ( <name> : <type> ; <name> : <type> ; ... ) @end example where each @code{<name>} is the name of a data field and the corresponding @code{<type>} is its type. Structures are transmitted as a sequence of their fields. @node LysKOM Data Types, Name Expansion, Simple Data Types, Data Types @section LysKOM Data Types In this section the data types specific to LysKOM are defined. Most of these will probably make very little sense until you know what calls there are. This section does not include the server calls or asynchronous messages, even though these are also data types. Since the types defined here are all based on the simple types, the definitions are more concise in this section. @subsection Common Types The types defined in this section are fairly simple and used in many of the more complex data types. @subsubsection Time @tindex Time @example Time ::= ( seconds : INT32; minutes : INT32; hours : INT32; day : INT32; month : INT32; year : INT32; day-of-week : INT32; day-of-year : INT32; is-dst : BOOL; ) @end example @code{Time} is used to specify times in several data structures. The fields @code{seconds}, @code{minutes} and @code{hours} give wall clock time. @code{day} is the day of month and @code{month} is the current month, starting with zero for January. @code{year} is the number of years since 1900. @code{day-of-week} is the current weekday, with zero used for Sunday. @code{day-of-year} is how many days of the year have passed starting with zero and @code{is-dst} is true when the time indicated is daylight savings time. When the server receives a @code{Time} structure from a client it ignores the @code{day-of-week} and @code{day-of-year} fields. All times are expressed in the time zone of the server. @subsubsection Conference Numbers @tindex Conf-No @example Conf-No ::= INT16; @end example This type denotes a conference number. @subsubsection Text Numbers @tindex Text-No @tindex Local-Text-No @tindex Text-List @example Text-No ::= INT32; Local-Text-No ::= INT32; Text-List ::= ( first-local-no : Local-Text-No; texts : ARRAY Text-No; ) @end example These three types are used to indicate articles in the LysKOM database. @code{Text-No} is a global text number and @code{Local-Text-No} a local text number. @code{Text-List} is used when a mapping from local to global numbers are required. @subsubsection Person and Session Numbers @tindex Pers-No @tindex Session-No @example Pers-No ::= Conf-No; Session-No ::= INT32; @end example @code{Pers-No} is used to indicate a person. @code{Session-No} is used in a few data structures relating to information about active LysKOM sessions. @subsection Auxiliary Information @tindex Aux-No @tindex Aux-Item @tindex Aux-Item-Input @tindex Aux-Item-Flags @example Aux-No ::= INT32; Aux-Item ::= ( aux-no : Aux-No; tag : INT32; creator : Pers-No; created-at : Time; flags : Aux-Item-Flags; inherit-limit : INT32; data : HOLLERITH; ) Aux-Item-Input ::= ( tag : INT32; flags : Aux-Item-Flags; inherit-limit : INT32; data : HOLLERITH; ) Aux-Item-Flags ::= BITSTRING ( deleted; inherit; secret; hide-creator; dont-garb; reserved2; reserved3; reserved4; ) @end example Aux-Item-Input contains a subset of the fields of an Aux-Item. It is used when the client wants to send an Aux-Item to the server, and it only contains the elements that the client can affect. The fields in Aux-Item and Aux-Item-Input have the following meaning: @table @code @item aux-no The number of the item within the list where it is found. This number together with a conference or text number uniquely identifies a particular aux-item. (There is also a global list of Aux-Items for the server. That list is manipulated via the @xref{modify-system-info} request, and when using that request the aux-no is enough to uniquely identify the aux-item.) This field is not present in @code{Aux-Item-Input}. It is assigned by the server. @item tag The item tag. The tag determines what the data means. @item creator The person who created the item, or zero if the item was created anonymously or if the owner is being withheld. This field is not present in @code{Aux-Item-Input}. It is assigned by the server. @item created-at The time when the item was created. This field is not present in @code{Aux-Item-Input}. It is assigned by the server. @item flags The item flags (see below). @item inherit-limit Determines how many times (how deep) an item may be inherited. If zero, the item is inherited an unlimited number of times. If nonzero it is @b{one more} than the number of additional times the item may be inherited. Thus, 1 means that inheritance will be blocked and 2 means that the item will be inherited only to the next level. @item data The item data. @end table The flags that can be set on an aux-item have the following meaning: @table @code @item deleted The item has been deleted, and should not be used for anything. @item inherit The item will be inherited (if the inherit-limit field allows it.) @item secret The item will not be revealed to anyone but the item's creator and supervisors of the creator. @item hide-creator The item creator will be withheld from everyone but the item's creator and supervisors of the creator. @item dont-garb The object the item is set on will not be garbage-collected. @end table @subsection Conference Types @tindex Conf-Type @tindex Extended-Conf-Type @tindex Any-Conf-Type @example Conf-Type ::= BITSTRING ( rd_prot; original; secret; letterbox; ) Extended-Conf-Type ::= BITSTRING ( rd_prot; original; secret; letterbox; allow-anonymous; reserved1; reserved2; reserved3; ) Any-Conf-Type ::= Conf-Type | Extended-Conf-Type; @end example These types are used to specify the type of a conference. @code{Conf-Type} is used in data types and calls that were created before version 8.0 of the protocol and has been augmented in @code{Extended-Conf-Type}. The type @code{Any-Conf-Type} is used when either is admissible. The bits have the following meaning (@pxref{Conferences}, for more info.) @table @code @item rd_prot If unset anyone can add themselves as members to the conference. @item original If set, comments are not allowed in the conference. @item secret If set the conference is secret. It's existence will only be revealed to members and supervisors. @item letterbox Set if the conference is a person's mailbox. @item allow-anonymous Set if anonymous articles are allowed in the conference. @item reserved1 @itemx reserved2 @itemx reserved3 Reserved for future use. The values of these bits should be never be modified or used by clients who do not know their meaning. When a new conference is created these should always be set to zero. @end table @subsection Conference Search Results @tindex Conf-Z-Info @example Conf-Z-Info ::= ( name : HOLLERITH; type : Conf-Type; conf_no : Conf_no; ) @end example These types are used for the result of some calls that search for conferences based on their names. @subsection Conference Status Types @tindex Garb-Nice @tindex Conference-Old @tindex Conference @tindex UConference @example Garb-Nice ::= INT32; Conference-Old ::= ( name : HOLLERITH; type : Conf-Type; creation-time : Time; last-written : Time; creator : Pers-No; presentation : Text-No; supervisor : Conf-No; permitted-submitters : Conf-No; super-conf : Conf-No; msg-of-day : Text-No; nice : Garb-Nice; no-of-members : INT16; first-local-no : Local-Text-No; no-of-texts : INTEGER; ) Conference ::= ( name : HOLLERITH; type : Extended-Conf-Type; creation-time : Time; last-written : Time; creator : Pers-No; presentation : Text-No; supervisor : Conf-No; permitted-submitters : Conf-No; super-conf : Conf-No; msg-of-day : Text-No; nice : Garb-Nice; no-of-members : INT16; first-local-no : Local-Text-No; no-of-texts : INTEGER; expire : Garb-Nice; aux-items : ARRAY Aux-Item; ) UConference ::= ( name : HOLLERITH; type : Extended-Conf-Type; highest-local-no : Local-Text-No; nice : Garb-Nice; ) @end example These three types are used to specify information about a conference. @code{Garb-Nice} is a quantity used to specify how long articled are kept in a conference before being removed. @code{Conference} is the full information about a conference and @code{UConference} is brief information about a conference. The fields of @code{Conference} are @table @code @item name The name of this conference. @item type The type of the conference. @item creation-time The date and time when the conference was created. @item last-written The date when something was last written in the conference. @item creator The person who created the conference. @item presentation The article containing the conference presentation or zero if the conference has no presentation. @item supervisor The conference@footnote{The @code{supervisor} may be a person, in which case the members of that person's letterbox become supervisors.} who supervises this conference. @item permitted-submitters The conference whose members@footnote{@code{permitted-submitters} can be a person, in which case all persons who are members of the associated letterbox are allowed to submit articles to the conference.} may submit articles to the conference, or zero if anyone may do so. @item super-conf The conference that receives comments if this conference does not accept them. Zero means the author of the comment in question. @item msg-of-day The conference notice, if any. @item nice The number of days an article should be kept before being removed from the conference. @item no-of-members The number of members of this conference. @item first-local-no The local number of the oldest existing article in the conference. @item no-of-texts The number of articles in the conference. @item expire This field will be used to control when a conference expires. It is not used at the moment, and should be set to zero for future compatibility. @item aux-items The conference's aux item list. @end table The fields of @code{UConference} are @table @code @item name The name of this conference. @item type The conference type. Note that this is an extended conference type, unlike the type field of @code{Conference}. @item highest-local-no The local number of the newest article in the conference. @item nice The number of days an article should be kept before being removed from the conference. @end table @subsection Archaic way to list conferences The result of request number 12, lookup-name, cannot be expressed in the grammar used in this document. This is as close as it gets: @tindex Conf-List-Archaic @example Conf-List-Archaic ::= ( conf-nos : ARRAY Conf-No; conf-types : ARRAY Conf-Type; ! Sans <n>; see below ) @end example The two arrays @code{conf-nos} and @code{conf-types} are always the same size. For some obscure reason the size of the second array is not actually transmitted. See also the example in @ref{lookup-name}. @subsection Mapping Local to Global Text Numbers @tindex Text-Mapping @tindex Local-To-Global-Block @tindex Text-Number-Pair @example Text-Mapping ::= ( later-texts-exists : BOOL; block : Local-To-Global-Block; ) Local-To-Global-Block ::= SELECTION ( 0=sparse sparse-block : ARRAY Text-Number-Pair; 1=dense dense-block : Text-List; ) Text-Number-Pair ::= ( local-number : Local-Text-No; global-number : Text-No; ) @end example FIXME: more text here. @subsection Server Information @tindex Info @tindex Info-Old @tindex Version-Info @example Info ::= ( version : INT32; conf-pres-conf : Conf-No; pers-pres-conf : Conf-No; motd-conf : Conf-No; kom-news-conf : Conf-No; motd-of-lyskom : Text-No; aux-item-list : ARRAY Aux-Item; ) Info-Old ::= ( version : INT32; conf-pres-conf : Conf-No; pers-pres-conf : Conf-No; motd-conf : Conf-No; kom-news-conf : Conf-No; motd-of-lyskom : Text-No; ) Version-Info ::= ( protocol-version : INT32; server-software : HOLLERITH software-version : HOLLERITH ) @end example These data types contain information about the LysKOM server. The fields of @code{Info} and @code{Info-Old} are @table @code @item version The server version encoded as a number @code{aabbcc} where @code{aa} is the major version number, @code{bb} the minor number and @code{cc} the secondary minor version. For instance, @code{10607} is version 1.6.7 of the server. If greater than 10699 the @code{get-version-info} should be used instead. @item conf-pres-conf The conference that contains conference presentations. @item pers-pres-conf The conference that contains person presentations. @item motd-conf The conference that contains conference and person notices. @item kom-news-conf The conference that contains news about LysKOM. @item motd-of-lyskom The number of an article to display when LysKOM is entered or zero if there is none. @item aux-item-list (Not present in @code{Info-Old}.) A list of aux-items that belong to the server. @end table The fields of @code{Version-Info} are: @table @code @item protocol-version The version of protocol A the server is using. This may be used to ascertain which calls are available. @item server-software Human-readable name of the server software. @item software-version Human-readable name of the server software version. @end table @subsection Person Status Types @tindex Person @tindex Personal-Flags @tindex Priv-Bits @example Person ::= ( username : HOLLERITH; privileges : Priv-Bits; flags : Personal-Flags; last-login : Time; user-area : Text-No; total-time-present : INT32; sessions : INT32; created-lines : INT32; created-bytes : INT32; read-texts : INT32; no-of-text-fetches : INT32; created-persons : INT16; created-confs : INT16; first-created-local-no : INT32; no-of-created-texts : INT32; no-of-marks : INT16; no-of-confs : INT16; ) Personal-Flags ::= BITSTRING ( unread-is-secret; flg2; flg3; flg4; flg5; flg6; flg7; flg8; ) Priv-Bits ::= BITSTRING ( wheel; admin; statistic; create_pers; create_conf; change_name; flg7; flg8; flg9; flg10; flg11; flg12; flg13; flg14; flg15; flg16; ) @end example These types are used to specify information about persons. @code{Person} contains the information about a person, @code{Personal-Flags} contains flags set by the user and @code{Priv-Bits} contains the person's privileges. The fields of @code{Person} are @table @code @item username The name of the user. FIXME: this is wrong/needs explanation/should be renamed. @item privileges The privileges of the person. @item flags Flags set by the user. @item last-login The time when the person last logged on. @item user-area The text number of the person's user area or zero if the person has no user area. @item total-time-present The number of seconds the person has been using LysKOM. @item sessions The number of sessions the person has initiated. @item created-lines The number of lines of articles the person has written. @item created-bytes The number of characters the person has written. @item read-texts The number of articles the person has read. @item no-of-text-fetches The number of texts the person has retrieved from the server. @item created-persons The number of other persons this person has created. @item created-confs This holds the number of conferences created by the person. @item first-created-local-no The local number of the earliest existing article written by the person. The local number applies to a local-to-global mapping containing all articles written by the person. @item no-of-created-texts This holds the number of articles written by the person. @item no-of-marks The number of marked texts this person has. @item no-of-confs The number of conferences the person is a member of. @end table @subsection Membership Information @tindex Membership-Type @example Membership-Type ::= BITSTRING ( invitation; passive; secret; reserved1; reserved2; reserved3; reserved4; reserved5; ) @end example The @code{Membership-Type} type contains flags that modify a membership. It is passed as part of both @code{Member} and @code{Membership}. The flags are: @table @code @item invitation The member has been invited, but has not yet accepted membership. Clients should set this flag when adding other users as members. The server may force this flag to be set when adding another person as a member of a conference. @item passive The member is not actively participating in the conference. Passive members do not receive group messages and should not be displayed as active members by clients. @item secret The member does not wish to disclose the membership. Secret memberships and members are cleared before being returned to a person who is not a supervisor of the member or has sufficient privileges enabled. @end table The remaining flags in the @code{Membership-Type} structure are reserved and should be set to false on all new memberships and retained on all existing memberships. @tindex Member @example Member ::= ( member : Pers-No; added-by : Pers-No; added-at : Time; type : Membership-Type; ) @end example The @code{Member} structure encodes information about a member in a conference. It is returned by the @ref{get-members} call. The fields of a @code{Member} structure are @table @code @item member The person who is a member of the conference. @item added-by The person who created the membership. This field is zero only if the membership was created before protocol version 10 was introduced. @item added-at The time when the membership was created. This field is meaningless if added-by is zero. @item type Flags modifying the membership. @end table The contents of a @code{Member} structure can be cleared (all fields set to zero) if the person requesting the record has insufficient privileges to see the contents of the structure. @tindex Membership-Old @tindex Membership @example Membership-Old ::= ( last-time-read : Time; conference : Conf-No; priority : INT8; last-text-read : Local-Text-No; read-texts : ARRAY Local-Text-No; ) Membership ::= ( last-time-read : Time; conference : Conf-No; priority : INT8; last-text-read : Local-Text-No; read-texts : ARRAY Local-Text-No; added-by : Pers-No; added-at : Time; type : Membership-Type; ) @end example The @code{Membership} structure encodes information about a person's membership in a conference. It is returned by the @ref{query-read-texts} and @ref{get-membership} calls. @table @code @item last-time-read The time when the person last read anything from the conference. @item conference The conference this membership data pertains to. @item priority The priority the person has assigned to the conference. The higher the number, the higher the priority. In the future, priority zero will be used to indicate a passive membership. @item last-text-read The local number of last text read in the conference. @item read-texts Additional texts beyond @code{last-text-read} that have also been read. @item added-by The person who created the membership. This field is zero if the membership was created before protocol version 10 was introduced. @item added-at The time when the membership was created. This field is meaningless if added-by is zero. @item type Flags modifying the membership. @end table A membership record may be cleared by the server (all fields set to zero) if the person requesting the membership has insufficient privileges to see the contents membership, but has sufficient privileges to know about the person. @subsection Article Marks @tindex Mark @example Mark ::= ( text-no : Text-No; type : INT8 ) @end example This data type hold information about a person's marks on articles. The fields of @code{Mark} are @table @code @item text-no The text number marked. @item type The mark value. @end table Before version eight of protocol A, the meaning of the mark value was unspecified. Work is underway to specify the meaning of certain mark values. @subsection Article Information @tindex Misc-Info @tindex Text-Stat-Old @tindex Text-Stat @example Misc-Info ::= SELECTION ( 0=recpt recipient : Conf-No; 1=cc-recpt cc-recipient : Conf-No; 2=comm-to comment-to : Text-No; 3=comm-in commented-in : Text-No; 4=footn-to footnote-to : Text-No; 5=footn-in footnoted-in : Text-No; 6=loc-no local-no : Local-Text-No 7=rec-time received-at : Time; 8=sent-by sender : Pers-No; 9=sent-at sent-at : Time; 15=bcc-recpt bcc-recipient : Text-No; ) Text-Stat-Old ::= ( creation-time : Time; author : Pers-No; no-of-lines : INTEGER; no-of-chars : String-Size; no-of-marks : INT16; misc-info : ARRAY Misc-Info; ) Text-Stat ::= ( creation-time : Time; author : Pers-No; no-of-lines : INTEGER; no-of-chars : String-Size; no-of-marks : INT16; misc-info : ARRAY Misc-Info; aux-items : ARRAY Aux-Item; ) @end example These two structures contain information about a single article. @code{Text-Stat} contains core information about the article and @code{Misc-Info} contains miscellaneous information related to the article. In the future, @code{Misc-Info} will become obsolete and @code{Text-Stat} will be extended with more information. A @code{Text-Stat} consists of the following: @table @code @item creation-time The time when the article was created. @item author The author of the article. @item no-of-lines The number of lines in the article. @item no-of-chars The number of characters in the article. @item no-of-marks The number of marks added to this article by persons. @item misc-info The @code{Misc-Info} list for this article. @item aux-items The list of aux items for this article. @end table @code{Misc-Info}, when sent to the client, is sent in a particular order (@pxref{The Misc-Info List}. The variants @code{Misc-Info} are (briefly): @table @code @item recpt Used to specify recipients of the article. @item cc-recpt Specifies recipients who have received a copy of the article but who will not receive comments. @item comm-to Specifies an article this article is a comment to. @item comm-in Specifies an article in which there are comments to this article. @item footn-to Specifies an article this article is a footnote to. @item footn-in Specifies an article to which this article is a footnote. @item loc-no Specifies the local text number of this article in the conference specified by @code{recpt} or @code{cc-recpt}. @item rec-time Specifies the time when this article was received by the conference specified by @code{recpt} or @code{cc-recpt}. @item sent-by Specifies who sent this article to the conference specified by @code{recpt} or @code{cc-recpt}. @item sent-at Specifies when the article was sent to the conference specified by @code{recpt} or @code{cc-recpt}. @item bcc-recpt Specifies a blind carbon copy recipient. This item is only accepted by protocol version 10 servers and is only sent in responses and messages introduced in protocol version 10 or later. @end table @subsection Who Information @tindex Who-Info-Old @tindex Who-Info @tindex Who-Info-Ident @example Who-Info-Old ::= ( person : Pers-No; working-conference : Conf-No; what-am-i-doing : HOLLERITH; ) Who-Info ::= ( person : Pers-No; working-conference : Conf-No; session : Session-No; what-am-i-doing : HOLLERITH; username : HOLLERITH; ) Who-Info-Ident ::= ( person : Pers-No; working-conference : Conf-No; session : Session-No; what-am-i-doing : HOLLERITH; username : HOLLERITH; hostname : HOLLERITH; ident-user : HOLLERITH; ) @end example These structures are used to retrieve and set information on who is currently using LysKOM. The types marked as ``old'' are obsolete but are included for completeness. @code{Who-Info-Old} identifies a user who is currently using LysKOM. @code{Who-Info} is used to set information about a session and is returned by one obsolete call. @code{Who-Info-Ident} is the preferred data type to use. The fields of @code{Who-Info-Old} are @table @code @item person The person the information is about. @item working-conference The conference the person is currently in. @item what-am-i-doing A client-supplied string saying what the person is doing. @end table The fields of @code{Who-Info} are @table @code @item person The person the information is about. @item working-conference The conference the person is currently in. @item session The person's session number. @item what-am-i-doing A client-supplied string saying what the person is doing. @item username The name of the ``real'' user constructed from @code{hostname} and @code{ident-user} (see below) and information from the client. FIXME: define the format @end table The fields of @code{Who-Info-Ident} are @table @code @item person The person the information is about. @item working-conference The conference the person is currently in. @item session The person's session number. @item what-am-i-doing A client-supplied string saying what the person is doing. @item username The name of the ``real'' user constructed from @code{hostname} and @code{ident-user}. FIXME: define the format @item hostname The host the connection originated at. @item ident-user The user name according to the Ident @ifinfo daemon @end ifinfo @iftex d@ae{}mon @end iftex at the user's machine or ``unknown'' if Ident was not used. @end table @subsection Session Information @tindex Session-Info @tindex Session-Info-Ident @tindex Static-Session-Info @tindex Session-Flags @tindex Dynamic-Session-Info @example Session-Info ::= ( person : Pers-No; working-conference : Conf-No; session : Session-No; what-am-i-doing : HOLLERITH; username : HOLLERITH; idle-time : INTEGER; connection-time : Time; ) Session-Info-Ident ::= ( person : Pers-No; working-conference : Conf-No; session : Session-No; what-am-i-doing : HOLLERITH; username : HOLLERITH; hostname : HOLLERITH; ident-user : HOLLERITH; idle-time : INTEGER; connection-time : Time; ) Session-No ::= INTEGER; Static-Session-Info ::= ( username : HOLLERITH; hostname : HOLLERITH; ident-user : HOLLERITH; connection-time : Time; ) Session-Flags ::= BITSTRING ( invisible; user_active_used; user_absent; reserved3; reserved4; reserved5; reserved6; reserved7; ) Dynamic-Session-Info ::= ( session : Session-No; person : Pers-No; working-conference : Conf-No; idle-time : INTEGER; flags : Session-Flags; what-am-i-doing : HOLLERITH; ) @end example These data types give information about a particular LysKOM session. The types @code{Session-Info} and @code{Session-Info-Ident} have been superseded by @code{Static-Session-Info} and @code{Dynamic-Session-Info}. The static session info represents information about a session that does not change during the lifetime of the session. Therefore static session infos can be aggressively cached by the client. The fields of @code{Session-Info} are @table @code @item person The person using this session. @item working-conference The conference the session is currently in. @item session The number of this session. @item what-am-i-doing A client-supplied string saying what the person is currently doing. @item username The name of the ``real'' user (see @code{Who-Info} above.) @item idle-time The number of seconds since the last server call. @item connection-time The time when the connection was initiated. This is not the same as the amount of time the person has been on. @end table The fields of @code{Session-Info-Ident} are @table @code @item person The person using this session. @item working-conference The conference the session is currently in. @item session The number of this session. @item what-am-i-doing A client-supplied string saying what the person is currently doing. @item username The name of the ``real'' user (see @code{Who-Info-Ident} above.) @item hostname The host the connection originated at. @item ident-user The user name according to the Ident @ifinfo daemon @end ifinfo @iftex d@ae{}mon @end iftex at the user's machine or ``unknown'' if Ident was not used. @item idle-time The number of seconds since the last server call. @item connection-time The time when the connection was initiated. This is not the same as the amount of time the person has been on. @end table The fields of @code{Static-Session-Info} are @table @code @item username The name of the ``real'' user (see @code{Who-Info-Ident} above.) @item hostname The host the connection originated at. @item ident-user The user name according to the Ident @ifinfo daemon @end ifinfo @iftex d@ae{}mon @end iftex at the user's machine or ``unknown'' if Ident was not used. @item connection-time The time when the connection was initiated. This is not the same as the amount of time the person has been on. @end table The bits in @code{Session-Flags} are: @table @code @item invisible When true, the user requested an invisible session (@pxref{login}). Sessions where no-one is logged in also have the @code{invisible} flag set. @item user_active_used When true, the user-active (@pxref{user-active}) call has been issued by the session, which in turn means that @code{idle-time} field in the @code{Dynamic-Session-Info} is valid. @item user_absent This flag is currently not used. @end table The fields of a @code{Dynamic-Session-Info} are @table @code @item session The session number of the session. @item person The person currently logged on, or zero if the session has not yet logged on. @item working-conference The conference the session is currently in. @item idle-time The number of seconds that have passed since the last time user-active (@pxref{user-active}) was called in the session. @item flags The dynamic session flags (see above.) @item what-am-i-doing What the client is doing. This string is set by the client. @end table @node Name Expansion, , LysKOM Data Types, Data Types @section Name Expansion Names in LysKOM can be expanded according to two rules, regexp matching or KOM conventions. @subsection Regexp Matching This type of expansion, used by the @pxref{re-z-lookup} call and its predecessors simply matches @code{ed(1)} style regular expressions to names in the database to find the list of matching names. The matching is done without regard for character case. @subsection KOM Conventions This type of matching is a little more complicated. Patterns consist of words and parenthesized expressions, and contain implicit wildcards. The @code{lyskomd} program implements an approximation of theses conventions. Since @code{lyskomd} is the trendsetter, these semantics are good enough. The rules are simple. Any parenthesized expressions are removed from the pattern and the names being checked for matches. Then the words of the pattern are examined from beginning to end, and if every pattern word matches the prefix of the corresponding word in the name, the name matches the pattern. For example ``L D'' matches ``LysKOM (client, server and protocol) Discussion (and) Ideas'', but not ``LysKOM Protocol Discussion''. @subsection Case Conversion Character case is converted according to a collate table in the server. The collate table is not really a protocol issue, and in a future protocol version there will be a call to retrieve the collate table from the server. The current collate table simply maps ISO 8859-1 uppercase and lowercase letters to equivalents, and also considered braces and suchlike equivalent according to swascii rules. @node Protocol Requests, , , Top @chapter Protocol Requests This chapter documents all calls that can be made to the server. All calls are annotated with the protocol version in which they appeared and their current status, which is one of @table @samp @item Experimental The call is experimental. No client should rely on the existence of this call. Experimental calls that are useful will usually become recommended in future versions. @item Recommended The call is a standard call. Clients are recommended to use these calls rather than experimental or obsolete ones. Servers are required to implement all recommended calls. @item Obsolete The call should no longer be used by clients. Servers should implement these, or they will be incompatible with old client versions. @end table @iftex @i{A note about the examples:} The examples consist of a number of calls and replies. Calls are set in a normal typewriter font. Replies are set in a slanted typewriter font. Upright text in a reply signifies data elements that will change or have changed as the result of another call in the example. @end iftex @menu Call Name Status Description Number ------------------------------------------------------------------------------- * login-old:: O Log in to LysKOM. Call 62 is preferred (0) * logout:: Log out. Call 62 to log in again (1) * change-conference:: Change current conference (2) * change-name:: Change name of a conference or person (3) * change-what-i-am-doing:: Change what-am-i-doing in who information (4) * create-person-old:: O Create a person (5) * get-person-stat-old:: O Get person information. Use call 49 (6) * set-priv-bits:: Set privileges of a person (7) * set-passwd:: Set password of a person (8) * query-read-texts-old:: O Get info on what is read (9) * create-conf-old:: O Create a conference (10) * delete-conf:: Delete a conference (11) * lookup-name:: O Look up a name. Replaced by call 76 (12) * get-conf-stat-older:: O Get conference information. Use call 50 (13) * add-member-old:: O Add a member to a conference (14) * sub-member:: Remove a member from a conference (15) * set-presentation:: Set the presentation of a conference (16) * set-etc-motd:: Set conference notice (17) * set-supervisor:: Set supervisor of a conference (18) * set-permitted-submitters:: Set permitted submitters of a conference (19) * set-super-conf:: Set super-conference of a conference (20) * set-conf-type:: Set the type of a conference (21) * set-garb-nice:: Set garb-nice of a conference (22) * get-marks:: Get marks for a person (23) * mark-text-old:: O Mark a text. Replaced by calls 72 and 73 (24) * get-text:: Get an article or part of an article (25) * get-text-stat-old:: O Get text status information (26) * mark-as-read:: Mark an article as read in a conference (27) * create-text-old:: O Create an article (28) * delete-text:: Delete an article (29) * add-recipient:: Add a recipient to an article (30) * sub-recipient:: Remove a recipient from an article (31) * add-comment:: Add a comment to an article (32) * sub-comment:: Remove a comment from an article (33) * get-map:: O Map local text numbers to global. Use 103 (34) * get-time:: Get the current time (35) * get-info-old:: O Get server information (36) * add-footnote:: Add an article as a footnote to another (37) * sub-footnote:: Remove a footnote from an article (38) * who-is-on-old:: O Get active sessions. Replaced by call 63 (39) * set-unread:: Set number of unread in a conference (40) * set-motd-of-lyskom:: Set LysKOM message of the day (41) * enable:: Set security level (42) * sync-kom:: Save the database (43) * shutdown-kom:: Shut LysKOM down (44) * broadcast:: O Broadcast a message. Replaced by call 53 (45) * get-membership-old:: O Get membership for a person (46) * get-created-texts:: O Get texts created by a user. Use call 104 (47) * get-members-old:: O Get members of a conference (48) * get-person-stat:: Get status information for a person (49) * get-conf-stat-old:: O Get status information for a conference (50) * who-is-on:: O Get current sessions. Replaced by call 63 (51) * get-unread-confs:: Get conferences with unread articles (52) * send-message:: Send a personal message (53) * get-session-info:: O Get session information. Use call 64 (54) * disconnect:: Disconnect a session (55) * who-am-i:: Get current session number (56) * set-user-area:: Set a person's user area (57) * get-last-text:: Get text created before a certain time (58) * create-anonymous-text-old:: O Create an anonymous text (59) * find-next-text-no:: Get next text number (60) * find-previous-text-no:: Get previous text number (61) * login:: Log in to LysKOM (62) * who-is-on-ident:: Get current sessions (63) * get-session-info-ident:: Get session information (64) * re-lookup-person:: O Look up a person based on name (65) * re-lookup-conf:: O Look up a conference based on name (66) * lookup-person:: O Find persons matching abbreviated name (67) * lookup-conf:: Find conference matching abbreviated name (68) * set-client-version:: Set the name and version the client (69) * get-client-name:: Get the name of the client (70) * get-client-version:: Get the version of the client (71) * mark-text:: Mark a text (72) * unmark-text:: Unmark a text (73) * re-z-lookup:: Lookup for conferences and persons (74) * get-version-info:: Get protocol version of server (75) * lookup-z-name:: Look up an abbreviated name (76) * set-last-read:: Set text last read in a conference (77) * get-uconf-stat:: Get abbreviated conference status (78) * set-info:: Get server information (79) * accept-async:: Select asynchronous messages to receive (80) * query-async:: Ask server which async messages are sent (81) * user-active:: Tell the server that the user is active (82) * who-is-on-dynamic:: Get a list of active users (83) * get-static-session-info:: Get static information about a session (84) * get-collate-table:: Get the current collate table (85) * create-text:: Create a text (86) * create-anonymous-text:: Create an anonymous text (87) * create-conf:: Create a conference (88) * create-person:: Create a person (89) * get-text-stat:: Get text status information (90) * get-conf-stat:: Get conference status information (91) * modify-text-info:: Add or delete text aux items (92) * modify-conf-info:: Add or delete conference aux items (93) * get-info:: Get server information (94) * modify-system-info:: Add or delete conference aux items (95) * query-predefined-aux-items:: Get list of aux-items the server knows (96) * set-expire:: Set the expire field of a conference (97) * query-read-texts:: Get info on what is read (98) * get-membership:: Get membership for a person (99) * add-member:: Add a member to a conference (100) * get-members:: Get members of a conference (101) * set-membership-type:: Modify the type of conference (102) * local-to-global:: Map local text numbers to global ones (103) * map-created-texts:: Map texts created by a person to glogal (104) @end menu @iftex @section Available Requests @end iftex @node login-old, logout, , Protocol Requests @subsection login-old (1) Obsolete @findex login-old @example login-old [0] (( person : Pers-No; passwd : HOLLERITH )) -> ( ); @end example Log in as a person. This call has been replaced by call 62, @ref{login}. @unnumberedsubsubsec Error codes @table @code @item undefined-person @code{person} is not an existing person. @item login-disallowed Logins are not allowed and @code{person} does not have the @code{wheel} bit set. @item invalid-password @code{passwd} is not the correct password for @code{person}. The error-status indicates the person number. @end table @node logout, change-conference, login-old, Protocol Requests @subsection logout (1) Recommended @findex logout @example logout [1] ( ) -> ( ); @end example Log out from LysKOM. This call does not disconnect the session; use @ref{disconnect} for that. After issuing a logout call the client can reconnect as the same or a different person using the @ref{login} command. For a client that needs to log in as several different users, issuing multiple logout and login requests during one session is faster and places less load on the server than does creating new sessions. @unnumberedsubsubsec Error codes This call never fails. @node change-conference, change-name, logout, Protocol Requests @subsection change-conference (1) Recommended @findex change-conference @example change-conference [2] ( conference : Conf-No ) -> ( ) ; @end example Change current conference of a session. This call used to be called pepsi (the name was a very obscure and not very funny joke.) @unnumberedsubsubsec Error codes @table @code @item login-first The session is not logged in yet. @item undefined-conference Conference @code{conference} does not exist or is secret. @item zero-conference @code{conference} is zero. @item not-member The user currently logged in is not a member of @code{conference}. @end table @node change-name, change-what-i-am-doing, change-conference, Protocol Requests @subsection change-name (1) Recommended @findex change-name @example change-name [3] (( conference : Conf-No; new-name : HOLLERITH )) -> ( ) ; @end example This call changes the name of a conference or a person. To change the name of a conference the session issuing the call must be logged in as a person who either has special privileges or is the supervisor of the conference. @unnumberedsubsubsec Error codes @table @code @item login-first The session is not logged in yet. @item undefined-conference Conference @code{conference} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Permission denied. The @code{change-name} bit is not set or the user does not have enough access to @code{conference}. @item conference-exists @code{new-name} is already occupied by another conference. @item string-too-long @code{new-name} is too long for a valid conference name. @item bad-name There are invalid characters in @code{new-name}. @end table @node change-what-i-am-doing, create-person-old, change-name, Protocol Requests @subsection change-what-i-am-doing (1) Recommended @findex change-what-i-am-doing @example change-what-i-am-doing [4] ( what-am-i-doing : HOLLERITH ) -> ( ); @end example This call tells the server what the logged-in user is doing. The string is usually displayed when a user requests that a client list who is using LysKOM. Clients are encouraged to use this call creatively. @unnumberedsubsubsec Error codes @table @code @item string-too-long @code{what-i-am-doing} is too long. @end table @node create-person-old, get-person-stat-old, change-what-i-am-doing, Protocol Requests @subsection create-person-old (1) Obsolete (10) @findex create-person-old @example create-person-old [5] (( name : HOLLERITH; passwd : HOLLERITH; )) -> Pers-No; @end example This call requests that the server create a new person with the name and password given as arguments. To create a person the session may have to be logged in as a person with sufficient privileges, if the server is configured that way. If the session was not logged in an automatic visible login to the new person will be performed. The new person will be a member of exactly one conference: the associated mailbox. That membership will have priority 255 and (of course) position 0. All flags of the membership will be 0. @i{Example:} @example 1 5 24HLysKOM Statistics Daemon 6Hsecret @t{=1 6} @end example This example creates a new person named ``LysKOM statistics Daemon'' with the password ``secret.'' The server has returned the person number six for the person. @unnumberedsubsubsec Error codes @table @code @item login-first The session is not logged in and the server does not allow person creation before logging in. @item permission-denied The server does not allow anyone to create person and the person currently logged on does not have the @code{create-pers} bit set. @item conference-exists There is already a conference named @code{name}. @item invalid-password The string @code{passwd} is not a valid password. @end table @node get-person-stat-old, set-priv-bits, create-person-old, Protocol Requests @subsection get-person-stat-old (1) Obsolete @findex get-person-stat-old @example get-person-stat-old [6] (( person : Pers_No; mask : INT32 )) -> Person; @end example This call returns information about a person. If the low bit of @code{mask} is not set, then the name is not returned. This call is obsolete and has been replaced by call 49 @ref{get-person-stat}. @unnumberedsubsubsec Error codes @table @code @item login-first This call can't be executed without logging in first. @item undefined-person Person @code{person} does not exist. @item undefined-conference Conference @code{person} does not exist or is secret. @item zero-conference @code{conference} is zero. @end table @node set-priv-bits, set-passwd, get-person-stat-old, Protocol Requests @subsection set-priv-bits (1) Recommended @findex set-priv-bits @example set-priv-bits [7] (( person : Pers-No; privileges : Priv-Bits; )) -> ( ); @end example This call sets the privileges of a person (see @ref{Security}.) To successfully issue this call the session must be logged in as a person with sufficient privileges. @i{Example:} @example 1 7 6 0010000000000000 @t{=1} @end example This example sets the privileges of person 6 to nothing but @code{statistic}. This particular set of privileges might be useful for a person used by a statistics-collecting @ifinfo daemon. @end ifinfo @iftex d@ae{}mon. @end iftex @unnumberedsubsubsec Error codes @table @code @item login-first This call can't be executed without logging in first. @item undefined-person @code{person} is not a valid person. @item permission-denied The person currently logged in does not have the @code{wheel} bit set and privilege level set to 6 or higher. @end table @node set-passwd, query-read-texts-old, set-priv-bits, Protocol Requests @subsection set-passwd (1) Recommended @findex set-passwd @example set-passwd [8] (( person : Pers-No; old-pwd : HOLLERITH; new-pwd : HOLLERITH; )) -> ( ); @end example This call is used to set the password of a person. Providing @code{old-pwd} matches @code{person}'s old password, that person's password is changed to @code{new-pwd}. Any person may set it's own password. In addition persons with sufficient privileges may ser other persons' passwords. @i{Example:} @example 1 8 5 6Hgazonk 7Ht9go8hw @t{=1} @end example This example sets the password of the LysKOM administrator to ``t9go8hw'' provided that the old password was ``gazonk''. @unnumberedsubsubsec Error codes @table @code @item login-first This call cannot be executed without logging in. @item undefined-person @code{person} is not a valid person. @item permission-denied Attempt to change password of another person without being the supervisor of that person and without the @code{wheel} bit set and privilege level 7 or higher enabled. @item invalid-password @code{old-pwd} is invalid or @code{new-passwd} is invalid as a password. @end table @node query-read-texts-old, create-conf-old, set-passwd, Protocol Requests @subsection query-read-texts-old (1) Obsolete (10) @findex query-read-texts-old @example query-read-texts-old [9] (( person : Pers-No; conference : Conf-No; )) -> ( read-texts : Membership-Old ); @end example This call is used to find the number of unread texts in a conference. The data it returns is actually a membership structure which specifies which texts have been read. It is up to the client to transform the data to a more usable form. @code{person} is the person being queried is to be made and @code{conference} is the conference in question. This call may be issued without logging in. Calling @code{query-read-texts-old} does not require the session to be logged in. @i{Example:} @example 1 9 6 1 @t{=1 32 5 11 12 7 93 1 193 1 1 20 133 3 @{ 135 136 137 @}} @end example This example finds the read texts for user 6 in conference 1. The returned data indicates that the user last read conference 1 (the tenth number) on Monday July 12th, 1993 at 11:05:32 (the first nine numbers), that the person has assigned priority 20 to the conference (the eleventh number) and that all articles up to and including local number 133 plus articles 135, 136 and 137 have been read. @unnumberedsubsubsec Error codes @table @code @item undefined-person @code{person} does not exist, or no access to person. @item undefined-conference Conference @code{conference} does not exist, or is secret. @item zero-conference @code{conference} is zero. @item not-member @code{person} is not a member of @code{conference}. @end table @node create-conf-old, delete-conf, query-read-texts-old, Protocol Requests @subsection create-conf-old (1) Obsolete (10) @findex create-conf-old @example create-conf-old [10] (( name : HOLLERITH; type : Any-Conf-Type; )) -> ( conference : Conf-No ); @end example This call is used to create new conferences. @code{name} is the name of the new conference and @code{type} is its type. If successful, the call returns the conference number of the newly created conference. To use this call the session must have logged in as a user with privileges to create conferences (@pxref{Security}). @i{Example:} @ifinfo @example 1 50 8 @t{%1 9 0} 1 10 13HInlägg @}t mig 00001000 @t{=1 8} 1 50 8 @t{=1 13HInlägg @}t mig 0000 43 9 17 14 5 96 5 165 1 43 9 17 14 5 96 5 165 1 5 0 5 0 5 0 77 0 1 0} @end example @end ifinfo @iftex @example 1 50 8 @t{%1 9 0} 1 13HInl@"a{}gg @aa{}t mig 00001000 @t{=1 7} 1 50 8 @t{=1 13HInl@"a{}gg @aa{}t mig 0000 43 9 17 14 5 96 5 165 1 43 9 17 14 5 96 5 165 1 5 0 5 0 5 0 77 0 1 0} @end example @end iftex This example creates a new conference named @ifinfo ``Inlägg @}t @end ifinfo @iftex ``Inl@"a{}gg @}t @end iftex mig''@footnote{This conference is a standard Lysator conference. It's all Padrone's fault.} which accepts all users as members and accepts anonymous articles. The server returns 7 as the new conference number. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied The server does not allow anyone to create a conference and user does not have the @code{create-conf} bit set. @item conference-exists A conference named @code{name} already exists. @item bad-name @code{name} contains invalid characters. @item string-to-long @code{name} is too long to be used as a conference name. @item secret-public The conference type has the @code{secret} bit set, but the @code{rd-prot} bit is cleared. @end table @node delete-conf, lookup-name, create-conf-old, Protocol Requests @subsection delete-conf (1) Recommended @findex delete-conf @example delete-conf [11] ( conf : Conf-No; ) -> ( ); @end example This call deletes the conference @code{conf} from the LysKOM database. Only privileged users and the supervisors of a conference may delete it. @b{[Is it possible to delete mailboxes?]} @i{Example:} @example 1 50 7 @t{=1 4HTest 1001 16 4 19 10 5 96 1 161 1 16 4 19 10 5 96 1 161 1 7 0 7 0 0 0 77 1 1 0} 1 11 7 @t{=1} 1 50 7 @t{%1 9 0} @end example This example shows the successful deletion of conference number seven. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference @code{conf} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not supervisor of @code{conf} and not enough privileges enabled. @item undefined-person @code{conf} is a letterbox but does not exist as a person (the database is corrupt.) @end table @node lookup-name, get-conf-stat-older, delete-conf, Protocol Requests @subsection lookup-name (1) Obsolete @findex lookup-name @example lookup-name [12] ( name : HOLLERITH ) -> ( Conf-List-Archaic ); @end example This call returns a list of conferences matching the string @code{name}. lookup-name has been superseded by call 76, @ref{lookup-z-name}. @i{Example:} @example 1 12 3Ha d @t{=1 3 @{ 217 674 1582 @} @{ 0000 1001 0000 @}} 2 12 3H::: @t{=2 0 * *} 3 76 3Ha d 1 1 @t{=3 3 @{ 31HAlkohol- (och annan) drogdebatt 0000 217 13HAnna Degerman 1001 674 27HAnarchy discussion (import) 0000 1582 @}} 4 76 3H::: 1 1 @t{=4 0 *} @end example This example shows two attempts to look up a name. The first example looks up @samp{a d} and finds three matches (the middle, number 674, is a person. The second example looks up @samp{:::} which doesn't match any conference (or person). Call number 3 and 4 issues the same lookup using the @ref{lookup-z-name} call. (The return value for call number 3 has been broken into three lines to fit on the page.) @unnumberedsubsubsec Error codes This call always succeeds. @node get-conf-stat-older, add-member-old, lookup-name, Protocol Requests @subsection get-conf-stat-older (1) Obsolete @findex get-conf-stat-older @example get-conf-stat-older [13] (( conf-no : Conf-No; mask : INTEGER )) -> ( Conference-Old ); @end example This call retrieves the information associated with conference @code{conf-no} in the LysKOM server. This call should no longer be used; use call 91, @ref{get-conf-stat} instead. @unnumberedsubsubsec Error codes @table @code @item undefined-conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @end table @node add-member-old, sub-member, get-conf-stat-older, Protocol Requests @subsection add-member-old (1) Obsolete (10) @i{Example:} @findex add-member-old @example add-member-old [14] (( conf-no : Conf-No; pers-no : Pers-No; priority : INT8; where : INT16 )) -> ( ); @end example Make the person @code{pers-no} a member of conference @code{conf-no}. The membership priority is set to @code{priority} and its position in the membership list is set to @code{where}. This call can be used to change the priority and position of a conference in the person's membership list if the person is already a member of the conference. @example 1 46 119 0 10 0 @t{=1 1 @{ 49 14 17 13 8 91 5 255 1 119 255 0 0 * @}} 1 14 1 119 250 0 @t{=1} 1 46 119 0 10 0 @t{=1 2 @{ 52 30 14 11 5 96 2 162 1 1 250 0 0 * 49 14 17 13 8 91 5 255 1 119 255 0 0 * @}} @end example This example makes person 119 (me) a member of conference number 1. The priority is set to 250 and the conference is placed first in the membership list. The first and last calls of the example show the membership list for person 119 before and after the call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item undefined-person Person @code{pers-no} does not exist @item access-denied Not enough permissions or privileges to add members to conference @code{conf-no}. @item permission-denied Person @code{pers-no} is already a member of conference @code{conf-no}, but the person logged on is not a supervisor and does not have enough privileges to change the priorities of person @code{pers-no}. @end table @node sub-member, set-presentation, add-member-old, Protocol Requests @subsection sub-member (1) Recommended @findex sub-member @example sub-member [15] (( conf-no : Conf-No; pers-no : Pers-No; )) -> ( ); @end example Removes the person @code{pers-no} from the membership list of conference @code{conf-no} and remove the conference from the person's list of memberships. @i{Example:} @example 1 46 5 0 100 0 @t{=1 2 @{ 44 14 19 10 5 96 1 161 1 1 0 0 0 * 49 14 17 13 8 91 5 255 1 5 255 0 0 * @}} 1 15 1 5 @t{=1} 1 46 5 0 100 0 @t{=1 1 @{ 49 14 17 13 8 91 5 255 1 5 255 0 0 * @}} @end example This example shows how person 5 is removed from conference one. The calls to get-membership demonstrate the effects on the LysKOM database. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item undefined-person Person @code{pers-no} does not exist. @item not-member Person @code{pers-no} is not a member of conference @code{conf-no}. @item permission-denied Not supervisor of conference @code{conf-no} or not supervisor of person @code{pers-no} and not enough privileges to issue the call anyway. @end table @node set-presentation, set-etc-motd, sub-member, Protocol Requests @subsection set-presentation (1) Recommended @findex set-presentation @example set-presentation [16] (( conf-no : Conf-No; text-no : Text-No; )) -> ( ); @end example This call sets the presentation text of the conference or person @code{conf-no} to the text @code{text-no}. To remove a presentation, use a @code{text-no} of zero. This call protects the new presentation from being deleted automatically and removes such protection from the old presentation. In lyskomd this is implemented by increasing the mark count on presentation texts. @i{Example:} @example 1 50 6 @t{=1 11HDavid Byers 1001 26 15 11 9 5 96 0 160 1 26 15 11 9 5 96 0 160 1 5 0 5 0 5 0 77 1 1 0} 1 16 6 1 @t{=1} 1 50 6 @t{=1 11HDavid Byers 1001 26 15 11 9 5 96 0 160 1 26 15 11 9 5 96 0 160 1 5 1 5 0 5 0 77 1 1 0} @end example This example shows how the presentation of person 6 is being changed. To start with, the person had no presentation, as is shown by the @ref{get-conf-stat-old} call. Later, after the set-presentation has been called, the presentation field has changed. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions to change presentation of conference @code{conf-no}. @item no-such-text Text @code{text-no} does not exist or no read permission. @item too-many-marks Adding a mark to text @code{text-no} would cause it to have too many marks. @end table @node set-etc-motd, set-supervisor, set-presentation, Protocol Requests @subsection set-etc-motd (1) Recommended @findex set-etc-motd @example set-etc-motd [17] (( conf-no : Conf-No; text-no : Text-No; )) -> ( ); @end example This call sets the message of the day on the conference or person @code{conf-no} to the article @code{text-no} and removes the old message. To remove an old message without setting a new one, use a @code{text-no} of zero. This call protects the new message from automatic deletion and removes such protection from the old message just as @ref{set-presentation}. @i{Example:} @example 1 50 6 @t{=1 11HDavid Byers 1001 26 15 11 9 5 96 0 160 1 26 15 11 9 5 96 0 160 1 5 0 5 0 5 0 77 1 1 0} 1 17 6 1 @t{=1} 1 50 6 @t{=1 11HDavid Byers 1001 26 15 11 9 5 96 0 160 1 26 15 11 9 5 96 0 160 1 5 0 5 0 5 1 77 1 1 0} @end example This example shows how text number one is used as the message of the day for conference six (which happens to be a mailbox.) The @ref{get-conf-stat-old} calls before and after demonstrate the change in the conference structure. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions to set the MOTD of conference @code{conf-no}. @item too-many-marks Adding a mark to text @code{text-no} would cause it to have too many marks. @end table @node set-supervisor, set-permitted-submitters, set-etc-motd, Protocol Requests @subsection set-supervisor (1) Recommended @findex set-supervisor @example set-supervisor [18] (( conf-no : Conf-No; admin : Conf-No; )) -> ( ); @end example The set-supervisor call changes the supervisor of an existing conference. The result is that all members of the conference @code{admin} become supervisors of the conference @code{conf-no}. Typically, but not always, @code{admin} will be a letterbox. @i{Example:} @example 1 50 4 @t{=1 17HNyheter om LysKOM 0000 48 11 17 13 8 91 5 255 1 15 12 11 9 5 96 0 160 1 0 0 0 0 0 0 77 1 1 1} 1 18 4 6 @t{=1} 1 50 4 @t{=1 17HNyheter om LysKOM 0000 48 11 17 13 8 91 5 255 1 15 12 11 9 5 96 0 160 1 0 0 6 0 0 0 77 1 1 1} @end example This example makes the members of conference six supervisors of conference four (which is usually the ``News about LysKOM'' conference). The change in the conference structure is evident from the @ref{get-conf-stat-old} calls before and after the set-supervisor call. Note that the original supervisor was not set. In order to change the supervisor of such a conference, the session issuing the call must have administration privileges. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} or conference @code{admin} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions or privileges to change the supervisor of conference @code{conf-no}. @end table @node set-permitted-submitters, set-super-conf, set-supervisor, Protocol Requests @subsection set-permitted-submitters (1) Recommended @findex set-permitted-submitters @example set-permitted-submitters [19] (( conf-no : Conf-No; perm-sub : Conf-No; )) -> ( ); @end example This call grants the right to send articles to the conference @code{conf-No} to all members of the conference @code{perm-sub}. The right to submit articles is per default only granted to the members of the conference. When a person tries to submit an article but does not have the right to do so, the client is expected to send the article to the super-conference instead. @i{Example:} @example 1 50 4 @t{=1 17HNyheter om LysKOM 0000 48 11 17 13 8 91 5 255 1 15 12 11 9 5 96 0 160 1 0 0 6 0 0 0 77 1 1 1} 1 19 4 1 @t{=1} 1 50 4 @t{=1 17HNyheter om LysKOM 0000 48 11 17 13 8 91 5 255 1 15 12 11 9 5 96 0 160 1 0 0 6 1 0 0 77 1 1 1} @end example This example shows how all members of conference one are given permission to send articles to conference four. From the beginning, only members of conference four were permitted to submit articles. The change is evident from the @ref{get-conf-stat-old} calls before and after the set-permitted-submitters call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} or conference @code{perm-sub} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions to change the permitted submitters of conference @code{conf-no}. @end table @node set-super-conf, set-conf-type, set-permitted-submitters, Protocol Requests @subsection set-super-conf (1) Recommended @findex set-super-conf @example set-super-conf [20] (( conf-no : Conf-No; super-conf : Conf-No; )) -> ( ); @end example Makes the conference @code{super-conf} the super-conference of the conference @code{conf-no}. When an article is submitted to a conference that does not accept it, it is sent to the super-conference instead. @i{Example:} @example @end example This example demonstrates how the super-conference of conference 1 is set to conference 8. The calls to @ref{get-conf-stat-old} demonstrate the change in the conference structure. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} or conference @code{super-conf} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions to change super-conference of conference @code{conf-no}. @end table @node set-conf-type, set-garb-nice, set-super-conf, Protocol Requests @subsection set-conf-type (1) Recommended @findex set-conf-type @example set-conf-type [21] (( conf-no : Conf-No; type : Any-Conf-Type )) -> ( ); @end example Sets the conference type of conference @code{conf-no} to @code{type}. Before protocol version 8, @code{type} could only be four bits. Starting with protocol version 8, either a four-bit conference type or an @code{Extended-Conf-Type} is allowed. @example 1 78 4 @t{=1 17HNyheter om LysKOM 00001000 1 77} 1 21 4 00000000 @t{=1} 1 78 4 @t{=1 17HNyheter om LysKOM 00000000 1 77} @end example This example shows a user removing the allow-anonymous bit from conference four. The @ref{get-uconf-stat} call shows all eight bits of the conference type before and after the set-conf-type call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item secret-public @code{type} has both the @code{secret} bit and @code{rd-prot} bits set. @item permission-denied Not enough permissions or privileges to change the conference type of conference @code{conf-no}. @item letterbox Attempt to change the @code{letterbox} flag. @end table @node set-garb-nice, get-marks, set-conf-type, Protocol Requests @subsection set-garb-nice (1) Recommended @findex set-garb-nice @example set-garb-nice [22] (( conf-no : Conf-No; nice : Garb-Nice )) -> ( ); @end example Sets the expiration time for articles in conference @code{conf-no} to @code{nice} days. An article that is older than the maximum expiration time of each conference it is sent to may be deleted by the LysKOM server unless it has marks. @example 1 78 4 @t{=1 17HNyheter om LysKOM 00000000 1 77} 1 22 4 7 @t{=1} 1 78 4 @t{=1 17HNyheter om LysKOM 00000000 1 7} @end example This example shows the expiration time of conference four being lowered from 77 to just seven days. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not enough permissions to change the expiration time for conference @code{conf-no}. @end table @node get-marks, mark-text-old, set-garb-nice, Protocol Requests @subsection get-marks (1) Recommended @findex get-marks @example get-marks [23] ( ) -> ( ARRAY Mark ); @end example This call returns the list of marks the current user has set. @example 1 23 @t{=1 3 @{ 13020 100 13043 95 12213 95 @}} @end example In this example, the current user has three marks, one on text 13020 with mark type 100, one on text 13042 with mark type 95 and one on text 12213 with mark type 95. The maximum number of marks may be arbitrarily limited in the LysKOM server. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @end table @node mark-text-old, get-text, get-marks, Protocol Requests @subsection mark-text-old (1) Obsolete @findex mark-text-old @example mark-text-old [24] (( text : Text-No; mark-type : INT8 )) -> ( ); @end example This call has been replaced by @ref{mark-text} and @ref{unmark-text} and should no longer be used. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text} does not exist. @item permission-denied No read permission on text @code{text}. @item undefined-person The person currently logged in does not exist (can't happen error.) @item too-many-marks Marking the text would cause the person doing the marking to have too many marks, or cause the text to have too many marks. @end table @node get-text, get-text-stat-old, mark-text-old, Protocol Requests @subsection get-text (1) Recommended @findex get-text @example get-text [25] (( text : Text-No; start-char : INTEGER; end-char : INTEGER; )) -> ( HOLLERITH ); @end example Retrieve text number @code{text} from the LysKOM database, starting at position @code{start-char} and ending at position @code{end-char}. The first character in the text is numbered 0 and the last can be retrieved using @ref{get-text-stat}. It is also permitted to request a character position beyond the actual end of the text, in which case as much text as is available will be returned. @example 1 25 100 0 32766 @t{=1 25HYawn^JNothing is happening} 2 25 100 5 32766 @t{=2 20HNothing is happening} 3 25 100 0 3 @t{=3 4HYawn} @end example In this example, text 100 is requested three times, first from position 0 to position 32766, then from position 5 to position 32766 and finally from position 0 to position 4. The first reply contains the entire text, the following two contain only the requested portion. @unnumberedsubsubsec Error codes @table @code @item no-such-text The text @code{text} does not exits or no read permission. This error code will also be used when attempting to fetch any text except the motd-of-lyskom text without logging in first. @item text-zero Attempt to retrieve text number 0. @item index-out-of-range @code{start-char} is larger than the length of the text. @end table @node get-text-stat-old, mark-as-read, get-text, Protocol Requests @subsection get-text-stat-old (1) Obsolete (10) @findex get-text-stat-old @example get-text-stat-old [26] ( text-no : Text-No ) -> ( Text-Stat-Old ); @end example Get information about text number @code{text-no}. The text-stat contains information about the size of the text, its recipients, comments, author and more. @example 1 26 100 =1 7 35 16 15 6 96 1 196 1 14 1 22 1 @t{7 @{ 0 7 6 85 0 15 6 1 8 13 9 12 37 16 15 6 96 1 196 1 3 311 @}} @end example In this example, text number 100 was created by person 7 at approximately 4:35PM on July 15 1996. Its recipients are conferences 7 and 15, and it was sent to conference 15 by person 13 at 16:37 on the day it was created. The text has a single comment: text 311. @unnumberedsubsubsec Error codes @table @code @item no-such-text The text @code{text-no} does not exist, or no read access. This error code will also be used when attempting to fetch any text except the motd-of-lyskom text without logging in first. @item text-zero Attempt to retrieve text number 0. @end table @node mark-as-read, create-text-old, get-text-stat-old, Protocol Requests @subsection mark-as-read (1) Recommended @findex mark-as-read @example mark-as-read [27] (( conference : Conf-No; text : ARRAY Local-Text-No; )) -> ( ); @end example Marks text @code{text} in conference number @code{conference} as read for the current user. This call updates the membership record for the user. @example 1 9 6 7 @t{=1 20 32 11 17 6 96 3 198 1 7 1 240 0 *} 1 78 7 @ifinfo @t{=1 13HInlägg @}t mig 00001000 241 1} @end ifinfo @iftex @t{=1 13HInl@"a{}gg @}t mig 00001000 241 1} @end iftex 1 27 7 1 @{ 241 @} @t{=1} 1 9 6 7 @t{=1 20 32 11 17 6 96 3 198 1 7 1 241 0 *} @end example This example shows person 6 marking local text number 241 in conference 7 as read. In the first query-read-texts call the person has read local text 240, but nothing higher. The mark-as-read call is reflected in the second query-read-texts call, where the user is seen to have read text 241 in conference 7. To mark a global text number as read it is necessary to translate it into local text numbers by looking as the Misc-Info list in the Text-Stat and calling mark-as-read once for each recipient. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conference} does not exist or is secret. @item zero-conference @code{conference} is zero. @item not-member The person logged on is not a member of conference @code{conference}. @item no-such-local-text One of the numbers in @code{text} is not a local text number in @code{conference}. The error argument indicates the index of the invalid number. @item local-text-zero One of the numbers in @code{text} is zero. @end table @node create-text-old, delete-text, mark-as-read, Protocol Requests @subsection create-text-old (1) Obsolete (10) @findex create-text-old @example create-text-old [28] (( text : HOLLERITH; misc-info : ARRAY Misc-Info; )) -> ( Text-No; ); @end example Creates a new text with contents from @code{text} and recipients etc. defined by @code{misc-info} (@pxref{The Misc-Info List}.) In addition to the result, the server will send an asynchronous message to all members of any of the recipients of the new text. It is not defined whether this messages comes before or after the reply to the create-text message. Clients should be prepared for either situation. The text up to the first line feed is considered to be the subject line. The remaining text is the message body. Although messages with only a subject are valid, clients should avoid letting users create such messages. The only Misc-Info items valid for this call are recpt, cc-recpt, bcc-recpt (protocol version 10), comm-to and footn-to. @example 1 28 20HExample\nMessage body 3 @{ 0 5 1 112 2 33467 @} @t{:16 0 33502 13 16 15 16 6 97 3 196 1 119 1 20 0} @t{ 5 @{ 0 5 6 148 1 112 6 3438 2 33467 @} } @t{=1 33502} @end example In this example, person 119 creates a text containing a subject and a one-line body. The recipient of the text is conference five, conference 112 is a CC recipient and the text is a comment to text 33467. The server reply indicates that the new text has been given number 33502. Finally there is an asynchronous message sent to all members of recipient conferences. Note how the message was sent before the reply to the client. The misc-info list in this message has two additional fields, the local numbers of the text in each of its recipient conferences. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{text} is longer than the maximum length of a message. @item temporary-failure The text could not be created at the moment. @item no-such-text Attempt to comment or footnote a non-existent or secret text. @item not-author Attempt to footnote a text authored by someone else. @item footnote-limit Attempt to footnote a text with the maximum number of footnotes already set. @item comment-limit Attempt to comment a text with the maximum number of comments already set. @item access-denied Attempt to send a text to a conference failed because no access to the conference or any superconference that will accept a text. @item anonymous-rejected Attempt to send an anonymous text to a conference that does not accept anonymous texts. @item illegal-misc Invalid misc-info list. A recipient is listed more than once or there is an unknown misc item in the misc-info list. @end table @node delete-text, add-recipient, create-text-old, Protocol Requests @subsection delete-text (1) Recommended @findex delete-text @example delete-text [29] ( text : Text-No ) -> ( ); @end example Deletes the text @code{text} from the LysKOM database, if the person issuing the command may do so. @example 1 29 33467 @t{=1} @end example This simple example shows the deletion of text number 33467. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text} does not exist or no read access. @item not-author The person logged in is not the text author or supervisor of the text author. @end table @node add-recipient, sub-recipient, delete-text, Protocol Requests @subsection add-recipient (1) Recommended @findex add-recipient @example add-recipient [30] (( text-no : Text-No; conf-no : Conf-No; recpt-type : Misc-Info; )) -> ( ); @end example Adds @code{conf-no} as recipient to text @code{text-no}. If @code{recpt-type} is 1, then a cc-recept (@pxref{The Misc-Info List}) is created; otherwise a recept is created. Since protocol version 8 this call can also be used to change a cc_recept into a recept and vice versa by simply adding a recipient that already exists. Since protocol version 10 the @code{carbon-copy} parameter is a @code{Misc-Info}, not a @code{BOOL}. Only infos @code{recpt}, @code{cc-recpt} and @code{bcc-recpt} are accepted. @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 30 1 5 0 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1} @t{ 3 @{ 0 5 6 1 9 34 34 17 17 6 97 4 197 1 @}} 1 30 1 5 1 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1} @t{ 3 @{ 1 5 6 1 9 34 34 17 17 6 97 4 197 1 @}} @end example This example show how conference 5 is added first as a recipient of text 1, then changed to a carbon-copy recipient. The misc-info list reflects these changes. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conf-no} does not exist. @item zero-conference @code{conference} is zero. @item no-such-text The text @code{text-no} does not exist. @item already-recipient The conference @code{conf-no} is already a recipient of the same type as @code{recpt-type}. @code{text-no}. @item illegal-info-type @code{carbon-copy} is not @code{recpt}, @code{cc-recpt} or @code{bcc-recpt}. @item recipient-limit The text already has the maximum number of recipients. @item permission-denied Attempt to change recipient types of a recipient, but not the author of the text or supervisor of the recipient. @end table @node sub-recipient, add-comment, add-recipient, Protocol Requests @subsection sub-recipient (1) Recommended @findex sub-recipient @example sub-recipient [31] (( text-no : Text-No; conf-no : Conf-No; )) -> ( ); @end example Removes @code{conf-no} from the list of recipients of text @code{text-no}. Recipients may be removed by the author of the text or by the supervisor of the recipients of the text or by the supervisor of the author. @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1} @t{ 3 @{ 1 5 6 1 9 34 34 17 17 6 97 4 197 1 @}} 1 31 1 5 =1 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 31 1 5 %1 30 0 @end example In this example, conference 5 is removed from the recipient list of text number 5. When the call is repeated, the server simply returns an error since conference 5 is not a recipient of the text. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text-no} does not exist or is secret. @item not-recipient The conference @code{conf-no} is not a recipient of text @code{text-no}. @item undefined-conference The conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item permission-denied Not supervisor of text author or conference, and not sender of text to @code{conf-no} and not enough privileges set and enabled. @end table @node add-comment, sub-comment, sub-recipient, Protocol Requests @subsection add-comment (1) Recommended @findex add-comment @example add-comment [32] (( text-no : Text-No; comment-to : Text-No; )) -> ( ); @end example Add a comment link between the text @code{comment-to} and the text @code{text-no} (@code{text-no} becomes a comment to the text @code{comment-to}). This call is used to add comment links after a text has been created. The normal procedure for creating comments is to add a @code{comm_to} element to the text's misc-info list when the text is created (@pxref{The Misc-Info List}.) @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1 2 @{ 0 2 6 1 @}} 1 32 2 1 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 1 @{ 3 2 @}} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1} @t{ 4 @{ 0 2 6 1 2 1 9 19 52 18 17 6 97 4 197 1 @}} @end example In this example, text number two is added as a comment to text number one. The change is reflected in the Misc-Info List of the texts. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item index-out-of-range The texts @code{text-no} and @code{comment-to} are identical. @item no-such-text The text @code{text-no} of @code{comment-to} are undefined. @item comment-limit The text @code{comment-to} already has the maximum number of comments. @end table @node sub-comment, get-map, add-comment, Protocol Requests @subsection sub-comment (1) Obsolete (10) @findex sub-comment @example sub-comment [33] (( text-no : Text-No; comment-to : Text-No; )) -> ( ); @end example This call removes the text @code{text-no} from @code{comment-to}'s list of comments. @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 1 @{ 3 2 @}} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1} @t{ 4 @{ 0 2 6 1 2 1 9 19 52 18 17 6 97 4 197 1 @}} 1 33 2 1 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1 2 @{ 0 2 6 1 @}} @end example In this example text 2 is a comment to text 1, as shown by the misc-info lists of the two texts. The @code{sub-comment} is called. The misc-info lists are changed to reflect the change. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text One of the texts @code{text-no} or @code{comment-to} does not exist. @item no-comment The text @code{text-no} is not a comment to @code{comment-too}. @item permission-denied Not supervisor of author of @code{text-no} or not sender of the comment and not enough privileges set and enable to complete the call anyway. @end table @node get-map, get-time, sub-comment, Protocol Requests @subsection get-map (1) Recommended @findex get-map @example get-map [34] (( conf-no : Conf-No; first-local-no : Local-Text-No; no-of-texts : INTEGER; )) -> ( Text-List ); @end example This call has been superceded by @ref{local-to-global}. This call retrieves an array mapping local text numbers to global numbers. It is most often used to get a list of unread texts in a conference. Clients will usually use the @code{query-read-texts} (@pxref{query-read-texts}) or @code{get-membership} (@pxref{get-membership}) calls to find the last local number a user has read in a particular conference, then use the @code{get-map} call to retrieve the global numbers of all unread texts in the conference. The @code{conf-no} parameter specifies which conference to get the map of. @code{first-local-no} is the local number of the first text returned by the call. @code{no-of-texts} is the maximum number of text the client wants. The result is a list of global text numbers. The first element of the list is the global number of local number @code{first-local-no}, specified by the call; the second element is the global number of local number @code{first-local-no} plus one; and so forth. The list returned by the server is at most @code{no-of-texts} long, but may be shorter if the call specifies more texts that there are in the conference. If @code{first-local-no} is higher than the highest local text number, the server will return an error. If @code{first-local-no} is lower than the lowest number that still exists, the server will set @code{result.first-local-no} in the returned Text-List to the first text that still exists. The size of the returned array will be decreased by the same amount as @code{result.first-local-no} is increased. This may result in an empty array being returned. (This paragraph applies even when @code{first-local-no} is 0.) If no texts at all exists in @code{conf-no} the resulting array will be empty, and @code{result.first-local-no} will be set to the number the next text to be created will receive. @example 1 34 119 10 5 @t{=1 10 5 @{ 0 0 466 478 391 @}} 2 34 119 16 5 @t{=2 16 3 @{ 481 0 491 @}} 3 34 119 19 5 @t{%3 16 0} 4 34 120 1 5 @t{=4 4 2 @{ 480 485 @}} 5 34 120 1 2 @t{=5 4 0 *} @end example This example shows five @code{get-map} calls. The first retrieves the mappings of local numbers 10 to 15; the second call returns local numbers 16 to 18. As this example shows the maps are not necessarily sorted in ascending order, since texts may be added after their creation, and the maps may contain zeroes anywhere. These represent texts that have been removed for some reason. Since the first example returned two leading zeroes we can be certain that at least one text with a local text number lower than 10 still exists. Otherwise the result would have been truncated in the front as it is in examples 4 and 5. The third exchange in the example shows what happens when @code{first-local-no} is too large. The forth and fifth examples shows what happens when an attempt to retrieve a mapping from a conference where the first local text numbers have been deleted. In the example local text numbers 1, 2 and 3 no longer exist, and 4 corresponds to 480, and 5 to 485. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conf-no} is zero. @item access-denied Conference @code{conf-no} is read protected. @item no-such-local-text @code{first-local-no} is higher than the highest local text number that ever has existed in this conference. @end table @node get-time, get-info-old, get-map, Protocol Requests @subsection get-time (1) Recommended @findex get-time @example get-time [35] ( ) -> ( Time ); @end example This call simply returns the local time according to the server. @example 1 35 @t{=1 23 47 19 17 6 97 4 197 1} @end example This example demonstrates the call. According to the server the time is 19:47:23, Thursday July 17, 1997. The result also shows that it is the 197th day of the year, and that daylight savings time is in effect. @unnumberedsubsubsec Error codes This call always succeeds @node get-info-old, add-footnote, get-time, Protocol Requests @subsection get-info-old (1) Obsolete (10) @findex get-info-old @example get-info-old [36] ( ) -> ( Info-Old; ); @end example This call returns the @code{Info} structure for the server (@pxref{LysKOM Data Types}. Clients should call this in order to find out which conferences are used for presentations and such. This call has been superceded by @ref{get-info}. This call can be issued without logging in. @example 1 36 @t{=1 10900 1 2 3 4 1} @end example In this example, the server version is 1.9, the conference for presentation of new conferences is conference 1, the conference for presentation of new persons is conference 2, the conference for door messages is conference 3, the LysKOM news conference is conference 4 and the login message is text number 1. @unnumberedsubsubsec Error codes This call always succeeds. @node add-footnote, sub-footnote, get-info-old, Protocol Requests @subsection add-footnote (1) Recommended @findex add-footnote @example add-footnote [37] (( text-no : Text-No; footnote-to: Text-No; )) -> ( ); @end example Add a footnote link between the text @code{footnote-to} and the text @code{text-no} (@code{text-no} becomes a footnote to the text @code{footnote-to}). This call is used to add footnote links after a text has been created. Only the author of both texts is allowed to add the footnote link. @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1 2 @{ 0 2 6 1 @}} 1 37 2 1 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 1 @{ 5 2 @}} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1} @t{ 4 @{ 0 2 6 1 4 1 9 19 52 18 17 6 97 4 197 1 @}} @end example In this example, text number two is added as a footnote to text number one. The change is reflected in the Misc-Info List of the texts. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text-no} or @code{footnote-to} does not exist or is secret. @item index-out-of-range Maximum number of texts in database already. @item not-author Not author of @code{footnote-to}. @item footnote-limit Text @code{footnote-to} already has the maximum number of footnotes. @item already-footnote Text @code{text-no} is already a footnote to @code{footnote-to}. @end table @node sub-footnote, who-is-on-old, add-footnote, Protocol Requests @subsection sub-footnote (1) Recommended @findex sub-footnote @example sub-footnote [38] (( text-no : Text-No; footnote-to : Text-No; )) -> ( ); @end example This call removes the text @code{text-no} from @code{footnote-to}'s list of footnotes. Only the author of a footnote may remove it. @example 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 1 @{ 5 2 @}} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1} @t{ 4 @{ 0 2 6 1 4 1 9 19 52 18 17 6 97 4 197 1 @}} 1 38 2 1 @t{=1} 1 26 1 @t{=1 2 22 12 17 6 97 4 197 1 5 4 256 1 0 *} 1 26 2 @t{=1 49 49 18 17 6 97 4 197 1 5 1 52 1 2 @{ 0 2 6 1 @}} @end example In this example text 2 is a footnote to text 1, as shown by the misc-info lists of the two texts. The @code{sub-footnote} is called. The misc-info lists are changed to reflect the change. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text-no} or @code{footnote-to} does not exist or is secret. @item not-footnote The text @code{text-no} is not a footnote to @code{footnote-to}. @item permission-denied Not supervisor of the author of @code{text-no} and not enough privileges set and enabled to complete call anyway. @end table @node who-is-on-old, set-unread, sub-footnote, Protocol Requests @subsection who-is-on-old (1) Obsolete @findex who-is-on-old @example who-is-on-old [39] ( ) -> ( ARRAY Who-Info-Old ); @end example This call is obsolete. Use @ref{get-static-session-info} and @ref{who-is-on-dynamic} instead. If the server does not support these calls, use @ref{who-is-on} instead. The returned list contains all sessions where a person is logged in and the invisible flag of the session is unset. @unnumberedsubsubsec Error codes This call always succeeds. @node set-unread, set-motd-of-lyskom, who-is-on-old, Protocol Requests @subsection set-unread (1) Recommended @findex set-unread @example set-unread [40] (( conf-no : Conf-No; no-of-unread : INTEGER; )) -> ( ); @end example Only read the last @code{no-of-unread} in the conference @code{conf-no}. This call modified the @code{last-text-read} of current person's membership for the conference. This call is sometimes used to implement the ``only read last N texts'' command found in many clients. Due to possible race conditions, this call is usually better implemented using the @ref{set-last-read} call which explicitly sets @code{last-text-read} field of the membership. @example 1 9 5 6 @t{=1 1 34 21 17 6 97 4 197 1 6 100 0 0 *} 1 40 6 0 @t{=1} 1 9 5 6 @t{=1 1 34 21 17 6 97 4 197 1 6 100 4 0 *} @end example This example shows that person 5 last read text 0 in conference 6 (and since 0 is an illegal local text number, that implies that the person has not read anything in the conference.) After calling set-unread and asking to have zero unread texts in conference 6, this is reflected by the call to query-read-texts. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conf-no} does not exist or is secret. @item not-member Not a member of conference @code{conf-no}. @end table @node set-motd-of-lyskom, enable, set-unread, Protocol Requests @subsection set-motd-of-lyskom (1) Recommended @findex set-motd-of-lyskom @example set-motd-of-lyskom [41] ( text-no : Text-No ) -> ( ); @end example This call sets the login message of LysKOM. It can only be executed by a privileged person, with the proper privileges enabled. A somewhat less convenient way of doing this is to use the @ref{set-info} call. @example 1 36 @t{=1 10900 1 2 3 4 0} 1 41 435 @t{=1} 1 36 @t{=1 10900 1 2 3 4 435} @end example This example shows how the login message of LysKOM is set using the set-motd-of-lyskom call. The results of the @code{get-info} calls demonstrate the effect. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied Administrator bit not set or privilege level not enabled. @item no-such-text The text @code{text-no} does not exist. @item mark-limit The text @code{text-no} already has the maximum number of marks. @end table @node enable, sync-kom, set-motd-of-lyskom, Protocol Requests @subsection enable (1) Recommended @findex enable @example enable [42] ( level : INT8 ) -> ( ); @end example Sets the security level for the current session to @code{level} (@pxref{Security} for details.) The only levels that make any sense right now are 0 and 255. This call may be issued by any person, but without the right privilege bits set, it has no effect. @example 1 41 1 @t{%1 12 0} 1 42 255 @t{=1} 1 41 1 @t{=1} @end example This example shows how @code{enable} makes a privileged call possible, in this case a call to @ref{set-motd-of-lyskom}. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @end table @node sync-kom, shutdown-kom, enable, Protocol Requests @subsection sync-kom (1) Recommended @findex sync-kom @example sync-kom [43] ( ) -> ( ); @end example This call instructs the LysKOM server to make sure the permanent copy of its database is current. Processing of requests is normally blocked until this call has completed, but the exact details depend on the server implementation. This call is privileged in most implementations. @example 1 42 255 @t{=1} 1 43 @t{:7 0} @t{:7 0} @t{=1} @end example This example shows how the @ref{enable} call is used to enable all privileges, then the @code{sync-kom} call is used to save the database. The server responds with two asynchronous messages signaling that the database is being saved. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied Administrator bit not set or privileges not enabled. @end table @node shutdown-kom, broadcast, sync-kom, Protocol Requests @subsection shutdown-kom (1) Recommended @findex shutdown-kom @example shutdown-kom [44] ( exit-val : INT8 ) -> ( ); @end example This call instructs the server to save all data and shut down. @code{exit-val} is currently not used. This call is privileged. @example 1 42 255 @t{=1} 1 44 0 @t{=1} @t{:2 13 5 3} @end example This example shows the shutdown of a server. The asynchronous message sent after the call returns is the result of a session being forced to log out. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied Administrator bit not set or privileges not enabled. @end table @node broadcast, get-membership-old, shutdown-kom, Protocol Requests @subsection broadcast (1) Obsolete @findex broadcast @example broadcast [45] ( message : HOLLERITH ) -> ( ); @end example This call can been replaced by @ref{send-message}. It is a privileged call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{message} is too long. @item feature-disabled Messages have been disabled. @end table @node get-membership-old, get-created-texts, broadcast, Protocol Requests @subsection get-membership-old (1) Obsolete (10) @findex get-membership-old @example get-membership-old [46] (( person : Pers-No; first : INT16; no-of-confs : INT16; mask : BITSTRING ( want-read-texts ); )) -> ( ARRAY Membership-Old ); @end example This call retrieves the membership record for a list of conferences for a single person. @code{person} is the person whose memberships are to be retrieved. @code{first} is the first position in the membership list to retrieve, numbered from 0 and up. @code{no-of-confs} is the number of membership records to retrieve. @code{mask} is a set of flags. Currently the only flag is @code{want-read-texts}, which instructs the server not to send the @code{read-texts} array of the memberships. The server will return a membership list that is shorter than @code{no-of-confs} if @code{no-of-confs} + @code{first} is larger than the number of conferences the person is a member of. @example 1 46 5 0 3 1 @t{=1 2 @{ 49 14 17 13 8 91 5 255 1 5 255 0 0 * } @t{ 20 14 22 17 6 97 4 197 1 6 100 2 0 * @}} 1 46 5 0 1 1 @t{=1 1 @{ 49 14 17 13 8 91 5 255 1 5 255 0 0 * @}} 1 46 5 1 4 1 @t{=1 1 @{ 20 14 22 17 6 97 4 197 1 6 100 2 0 * @}} @end example In this example we retrieve the memberships of person 5. The first call asks for three memberships, starting with number 0. Since this person is only a member of two conferences, the list returned only contains two memberships. The next two calls retrieve a single membership each. The first by asking for only one, and the second by asking for four memberships, starting with number 1. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person The person @code{person} does not exist. @item undefined-conference The conference @code{person} does not exist or is secret. @item index-out-of-range @code{first} is higher than the index of the first conference in the person's membership list. @end table @node get-created-texts, get-members-old, get-membership-old, Protocol Requests @subsection get-created-texts (1) Obsolete (10) @findex get-created-texts @example get-created-texts [47] (( person : Pers-No; first : Local-Text-No; no-of-texts : INTEGER; )) ( Text-List ); @end example This call is obsolete; @xref{map-created-texts} should be used instead. This call returns a list of the texts written by a person. @code{person} is the person whose created texts are to be retrieved. @code{first} is the first text to retrieve. @code{no-of-texts} is the number of texts to retrieve. This call is essentially the same as @ref{get-map}, but instead of returning the texts sent to a single conference, it returns the texts written by a single person to any conference. The number of texts written by any one person is contained in the Person record for that person. If @code{first} is lower than the first text written by @code{person} that still exists, it will be automatically increased to the first still existing text written by @code{person}. The @code{get-created-texts} will still attempt to return information about @code{no-of-texts} texts. (In this regard @code{get-map} and @code{get-created-texts} differ, since @code{get-map} will never ever return information about a later text than specified in the arguments to the call.@footnote{This difference was not intentional, but it is now too late to change the semantics of either @code{get-map} or @code{get-created-texts}. Besides, they are both obsolete calls.}) @example 1 47 5 0 100 @t{=1 1 8 @{ 1 2 3 4 5 6 7 8 @}} 2 47 5 4 2 @t{=2 4 2 @{ 4 5 @}} 3 47 10 8 8 @t{=3 12 8 @{ 309 312 324 327 329 339 0 387 @}} @end example In this example we have retrieved all texts written by person five. The first call asked for 100 texts, but only 8 were returned, which implies that person number 5 only created a total of 8 texts. We can also see that person 5 wrote all the first 8 texts in the conference system. The second call shows how a part of the map can be retrieved. The third call asks for eight texts written by person 10, starting with the eighth number. Since the first eleven texts written by that person no longer exists the server instead returns information about eight texts staring from the twelfth text person 10 created. One of the eight texts has been deleted. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person The person @code{person} does not exist or is secret. @item undefined-conference The conference @code{person} does not exist or is secret. @item no-such-local-text @code{first} is higher than the local text number of the last created text. @end table @node get-members-old, get-person-stat, get-created-texts, Protocol Requests @subsection get-members-old (1) Obsolete (10) @findex get-members-old @example get-members-old [48] (( conf : Conf-No; first : INT16; no-of-members : INT16; )) -> ( ARRAY Pers-No ); @end example This call returns a list of members of the conference @code{conf-no}. @code{first} is the first index in the membership to return, numbered from zero and up. @code{no-of-members} is the maximum number of members to return. @example 1 48 1 0 100 @t{=1 4 @{ 7 8 9 10 @}} 1 48 6 0 100 @t{=1 4 @{ 5 7 9 10 @}} 1 48 6 2 2 @t{=1 2 @{ 9 10 @}} @end example In this example the client first requests the first 100 members in conference 1. The second request is for the first 100 members of conference 6. The last request is for members 2 and 3 in conference 6. As can be seen from the examples, the returned list is truncated if there are fewer members than requested. @unnumberedsubsubsec Error codes @table @code @item undefined-conference The conference @code{conf} does not exist or is secret. @item index-out-of-range @code{first} is higher than the number of members in @code{conf}. @end table @node get-person-stat, get-conf-stat-old, get-members-old, Protocol Requests @subsection get-person-stat (1) Recommended @findex get-person-stat @example get-person-stat [49] ( pers-no : Pers-No; ) -> ( Person ); @end example This call returns the person @code{pers-no}. This call does not return all the information a client usually needs since the name is not included in the Person data structure. Use @ref{get-conf-stat} on the same number to get additional information about the person. @example 1 49 8 @t{=1 44Hbyers@@lage.lysator.liu.se 0000010000000000 00000000} @t{ 44 21 19 18 6 97 5 198 1 0 2 3 0 0 0 0 0 0 1 0 0 2} 1 50 8 @t{=1 11HPaul Dekker 1001 8 6 19 18 6 97 5 198 1} @t{ 8 6 19 18 6 97 5 198 1 8 0 8 0 0 0 77 1 1 0} @end example This simple example shows how person number 8 is retrieved from the server. The second call shows the @code{get-conf-stat-old} call on the same ID number. @unnumberedsubsubsec Error codes @table @code @item undefined_person The person @code{pers-no} does not exist. @item undefined_conference The conference @code{pers-no} does not exist or is secret. @end table @node get-conf-stat-old, who-is-on, get-person-stat, Protocol Requests @subsection get-conf-stat-old (1) Obsolete (10) @findex get-conf-stat-old @example get-conf-stat-old [50] ( conf-no : Conf-No ) -> ( Conference-Old ); @end example This call retrieves the conference data structure for conference number @code{conf-no}. Important note: This call does not return the extra flag bits that were introduced in protocol version 8. To get this information, use the @code{get-uconf-stat} call instead. However, clients should be able to handle @code{Conference} structures with an arbitrary number of flag bits since we may decide to change the behavior of this call in the future. @example 1 50 1 @ifinfo @t{=1 27HPresentation (av nya) möten 0000 48 11 17 13 8 91 5 255} @end ifinfo @iftex @t{=1 27HPresentation (av nya) m@"oten 0000 48 11 17 13 8 91 5 255} @end iftex @t{ 1 18 34 21 17 6 97 4 197 1 0 0 0 0 0 0 77 0 1 1} 1 50 8 @t{=1 11HPaul Dekker 1001 8 6 19 18 6 97 5 198 1} @t{ 8 6 19 18 6 97 5 198 1 8 0 8 0 0 0 77 1 1 0} @end example This simple example retrieves conferences 1 and 8 from the server. Conference 1 is a regular conference, and conference 8 is a letterbox. @unnumberedsubsubsec Error codes @table @code @item undefined-conference The conference @code{conf-no} does not exist or is secret. @end table @node who-is-on, get-unread-confs, get-conf-stat-old, Protocol Requests @subsection who-is-on (1) Obsolete (9) @findex who-is-on @example who-is-on [51] ( ) -> ( ARRAY Who-Info ); @end example This call is obsolete. Please use @ref{who-is-on-dynamic} and @code{get-static-session-info} instead. Nonetheless, servers should support this call since many clients still use it. This call should simply return a list of visible sessions (sessions where a person is logged in and the invisible flag is unset). The data structure is described elsewhere (@pxref{LysKOM Data Types}.) @unnumberedsubsubsec Error codes This call always succeeds. @node get-unread-confs, send-message, who-is-on, Protocol Requests @subsection get-unread-confs (1) Recommended @findex get-unread-confs @example get-unread-confs [52] ( pers-no : Pers-No ) -> ( ARRAY Conf-No ); @end example This call returns a list of conferences in which the person @code{pers-no} may have unread texts. This call will return a result for any valid @code{pers-no}. To retrieve information about secret persons, or to get information about unread texts in secret conference, the session must log on as a person with access to that information. The result is guaranteed to include all conferences where @code{pers-no} has unread texts. It may also return some extra conferences. @example 1 52 7 @t{=1 2 @{ 1 6 @}} 1 52 1 @t{%1 10 0} 1 52 1000 @t{%1 10 0} @end example This example shows how a session first retrieves the list of conferences in which person 7 has unread texts. The next request is for the unread conferences of person 1, but that happens to be a conference. The last request is for the unread conferences of person 1000, but that person didn't exist in the test database. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person Person @code{pers-no} does not exist or is secret. @end table @node send-message, get-session-info, get-unread-confs, Protocol Requests @subsection send-message (1) Recommended @findex send-message @example send-message [53] (( recipient : Conf-No; message : HOLLERITH; ) -> ( ); @end example This call sends the message @code{message} to all members of @code{recipient} that are currently logged in. @example 1 53 4 14HThis is a test @t{=1} 1 53 1 14HThis is a test @t{:3 12 1 8 14HThis is a test} @t{=1} 1 53 0 14HThis is a test @t{:3 12 0 8 14HThis is a test} @t{=1} 1 53 5 14HThis is a test @t{%1 16 0} 1 53 3 14HThis is a test @t{%1 42 0} @end example @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{message} is too long. @item undefined-conference Conference @code{recipient} does not exist or is secret. @item feature-disabled The message feature has been disabled in the server. @item message-not-sent The message was not sent for some other reason. Perhaps the recipient is not accepting messages. @end table @node get-session-info, disconnect, send-message, Protocol Requests @subsection get-session-info (1) Obsolete @findex get-session-info @example get-session-info [54] ( session-no : Session-No ) -> ( Session-Info ); @end example This call is obsolete. It has been replaced by @code{get-session-info-ident}, which in turn is also obsolete. See @pxref{get-session-info-ident} for more information. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-session The session @code{session-no} does not exist. @end table @node disconnect, who-am-i, get-session-info, Protocol Requests @subsection disconnect (1) Recommended @findex disconnect @example disconnect [55] ( session-no : Session-No ) -> ( ); @end example This call disconnects the session @code{session-no} from the LysKOM server. A session can always disconnect itself, even without logging in. If the session is logged in as user @i{foo} it can also disconnect any session logged in as a person for which @i{foo} is the supervisor. @example 1 56 @t{=1 7} 1 55 7 @t{=1} @t{:2 13 8 7} @t{Connection closed by foreign host.} @end example In this example the client asks for its own session number, then disconnects itself. The asynchronous message sent just before the session is disconnected is the logout message for the user that was logged on in the session. The ``Connection closed by foreign host.'' is not part of the server output. This message was generated by telnet. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call if @code{session-no} is not the session issuing the call. @item permission-denied Attempt to disconnect another session and not supervisor of person logged in and not enough privileges set and enabled to complete the call anyway. @item undefined-session The session @code{session-no} does not exist. @end table @node who-am-i, set-user-area, disconnect, Protocol Requests @subsection who-am-i (1) Recommended @findex who-am-i @example who-am-i [56] ( ) -> ( Session-No ); @end example This call simply returns the session number of the session issuing the call. @example 1 56 @t{=1 7} @end example In this example the session number of the session issuing the call is seven. @unnumberedsubsubsec Error codes This call always succeeds. @node set-user-area, get-last-text, who-am-i, Protocol Requests @subsection set-user-area (2) Recommended @findex set-user-area @example set-user-area [57] (( pers-no : Pers-No; user-area : Text-No; )) -> ( ); @end example This call sets the user-area field for the person @code{pers-no} in the database to the text @code{user-area}. The user area is used to store client data for a particular person. See @pxref{The User Area} for more details. @example 1 49 7 @t{=1 43Hdavby@@lage.lysator.liu.se 0000010000000000 00000000} @t{ 6 58 21 19 6 97 6 199 1 0 458 7 3 12 7 12 0 0 3 0 0 4} 1 57 7 11 @t{=1} 1 49 7 @t{=1 43Hdavby@@lage.lysator.liu.se 0000010000000000 00000000} @t{ 6 58 21 19 6 97 6 199 1 11 458 7 71 2592 7 13 0 0 3 1 0 4} @end example In this example the user area of person 7 is set to text number 11. The original user area was text numbers zero, which means that the person had no user area. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person The person @code{pers-no} does not exist or is secret. @item permission-denied Not enough access to person @code{pers-no} to complete the call. @end table @node get-last-text, create-anonymous-text-old, set-user-area, Protocol Requests @subsection get-last-text (3) Recommended @findex get-last-text @example get-last-text [58] ( before : Time ) -> ( Text-No ); @end example This call returns the number of the last text created before @code{before}. There is no guarantee that the text is readable by the person making the request, or that the text even exists. @example 1 58 49 6 22 19 6 97 6 199 1 @t{=1 11} 1 58 49 6 22 18 6 97 6 199 1 @t{=1 8} 1 58 49 6 22 1 6 97 6 199 1 @t{=1 0} @end example In this example the text created most recently before 22:06 on July 19, 1997 was text number 11; the text created most recently before 22:06 on July 18 was text number 8; and the text created most recently before 22:06 on July 1st was text number 0, which means that there is no text that old in the database. @unnumberedsubsubsec Error codes This call never fails. @node create-anonymous-text-old, find-next-text-no, get-last-text, Protocol Requests @subsection create-anonymous-text-old (3) Obsolete (10) @findex create-anonymous-text-old @example create-anonymous-text-old [59] (( text : HOLLERITH; misc-info : ARRAY Misc-Info; )) -> ( Text-No ); @end example Similar to @pxref{create-text-old}, but the text is created the author field set to zero. Not even the server has a record of who created the text. the original intended use for this call was for importing texts from other sources, such as WWW, FTP or Gopher, but some clients include explicit support for sending anonymous texts to a server. It is only possible to send anonymous texts to a conference with the right flag bit set. The only Misc-Info items valid for this call are recpt, cc-recpt, bcc-recpt (protocol version 10) comm-to and footn-to. @example 1 28 20HExample\nMessage body 3 @{ 0 5 1 112 2 33467 @} @t{:16 0 33502 13 16 15 16 6 97 3 196 1 0 1 20 0} @t{ 5 @{ 0 5 6 148 1 112 6 3438 2 33467 @} } @t{=1 33502} @end example In this example, person 119 creates a text containing a subject and a one-line body. The recipient of the text is conference five, conference 112 is a CC recipient and the text is a comment to text 33467. The server reply indicates that the new text has been given number 33502. Finally there is an asynchronous message sent to all members of recipient conferences. Note how the message was sent before the reply to the client. The misc-info list in this message has two additional fields, the local numbers of the text in each of its recipient conferences. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{text} is longer than the maximum length of a message. @item temporary-failure The text could not be created at the moment. @item no-such-text Attempt to comment or footnote a non-existent or secret text. @item not-author Attempt to footnote a text authored by someone else. @item footnote-limit Attempt to footnote a text with the maximum number of footnotes already set. @item comment-limit Attempt to comment a text with the maximum number of comments already set. @item access-denied Attempt to send a text to a conference failed because no access to the conference or any superconference that will accept a text. @item anonymous-rejected Attempt to send an anonymous text to a conference that does not accept anonymous texts. @item illegal-misc Invalid misc-info list. A recipient is listed more than once or there is an unknown misc item in the misc-info list. @end table @node find-next-text-no, find-previous-text-no, create-anonymous-text-old, Protocol Requests @subsection find-next-text-no (3) Recommended @findex find-next-text-no @example find-next-text-no [60] ( start : Text-No ) -> ( Text-No ); @end example This call returns the next readable text in the database created after text @code{start}. @code{start} does not have to be a valid or readable text number, as shown in the examples. @example 1 60 0 @t{=1 2} 1 60 2 @t{=1 4} @end example This example shows how to retrieve the first readable text in the LysKOM database by calling @code{find-next-text} with @code{start} set to zero. In the example, the first text is number 2. The second example gets the text following number 2, which happens to be text number 4. @unnumberedsubsubsec Error codes @table @code @item no-such-text There is no text following text @code{start}. @end table @node find-previous-text-no, login, find-next-text-no, Protocol Requests @subsection find-previous-text-no (3) Recommended @findex find-previous-text-no @example find-previous-text-no [61] ( start : Text-No ) -> ( Text-No ); @end example This call returns the first readable text in the database created most recently before @code{start}. @code{start} does not have to be a valid or readable text number, as shown in the examples. @example 1 61 134217727 @t{=1 11} 1 61 4 @t{=1 2} @end example This example shows that the last readable text in the database is number 11 (unless by some odd coincidence all text from 11 to text number 134217727 have been deleted.) It also shows that the most recent text before number 4 is text number 2. @unnumberedsubsubsec Error codes @table @code @item no-such-text There is no text preceding text @code{start}. @end table @node login, who-is-on-ident, find-previous-text-no, Protocol Requests @subsection login (4) Recommended @findex login @example login [62] (( person : Pers-No; passwd : HOLLERITH; visibility : BITSTRING ( is-invisible; ); ) -> ( ); @end example This call is used to log in. The session is logged in as person number @code{pers-no} is @code{passwd} is the correct password for that person. If @code{is-invisible} is true, the session is invisible. It will not be returned by @code{who-is-on} and @code{who-is-on-ident} and the invisible flag of the dynamic session info (@pxref{LysKOM Data Types} will have the invisible flag set. Invisible sessions are primarily used by software agents that do not act on the behalf of real users. @example 1 62 7 6Hgazonk 1 @t{=1} 1 62 7 6Hgazonk 0 @t{:2 9 7 1} 1 62 7 6Hgazonk 0 @t{:2 13 7 1} @t{:2 9 7 1} @t{=1} @end example This example first shows a session log in as person seven with the invisible flag set. Because of this the asynchronous login message is not sent. The second call logs in as person seven again. This time a login message is sent, but not a logout message since the login was invisible. The third example shows a third login as person 7, but this time both the logout and login messages are sent. @unnumberedsubsubsec Error codes @table @code @item undefined-person The person @code{person} does not exist. @item login-disallowed Logins have been disabled and person @code{person} does not have enough privileges to override. @item invalid-password The password @code{passwd} is not the password of @code{person} and the currently logged in person is not the supervisor of @code{person} and does not have enough privileges set and enabled to log in anyway. @item conference-zero Attempt to log in as person number 0. @end table @node who-is-on-ident, get-session-info-ident, login, Protocol Requests @subsection who-is-on-ident (4) Obsolete (9) @findex who-is-on-ident @example who-is-on-ident [63] ( ) ( ARRAY Who-Info-Ident ); @end example This call is obsolete. It has been replaced by @pxref{who-is-on-dynamic} and @pxref{get-static-session-info}. It used to return a list of all active and visible sessions. @unnumberedsubsubsec Error codes This call always succeeds. @node get-session-info-ident, re-lookup-person, who-is-on-ident, Protocol Requests @subsection get-session-info-ident (4) Obsolete (9) @findex get-session-info-ident @example get-session-info-ident [64] ( session-no : Session-No ) -> ( Session-Info-Ident ); @end example This call is obsolete. Use @pxref{who-is-on-dynamic} and @code{get-static-session-info} instead. It used to return information about a single session. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-session The session @code{session-no} does not exist. @end table @node re-lookup-person, re-lookup-conf, get-session-info-ident, Protocol Requests @subsection re-lookup-person (5) Obsolete @findex re-lookup-person @example re-lookup-person [65] ( regexp : HOLLERITH ) ( ARRAY Pers-No ); @end example This call is obsolete. It has been replaced by @pxref{re-z-lookup}. It used to return a list of persons matching the regular expression @code{regexp}. The regexp syntax used was that of the @code{ed(1)} Unix utility. @unnumberedsubsubsec Error codes @table @code @item regexp-error Error compiling the regexp @code{regexp}. Perhaps the pattern is not a correct regexp. @end table @node re-lookup-conf, lookup-person, re-lookup-person, Protocol Requests @subsection re-lookup-conf (5) Obsolete @findex re-lookup-conf @example re-lookup-conf [66] ( regexp : HOLLERITH ) -> ( ARRAY Conf-No ); @end example This call is obsolete. It has been replaced by @pxref{re-z-lookup}. It used to return a list of conferences matching the regular expression @code{regexp}. The regexp syntax used was that of the @code{ed(1)} Unix utility. @unnumberedsubsubsec Error codes @table @code @item regexp-error Error compiling the regexp @code{regexp}. Perhaps the pattern is not a correct regexp. @end table @node lookup-person, lookup-conf, re-lookup-conf, Protocol Requests @subsection lookup-person (6) Obsolete @findex lookup-person @example lookup-person [67] ( name : HOLLERITH ) -> ( ARRAY Pers-No ); @end example This call is obsolete. It has been replaced by @pxref{lookup-z-name}. This call used to return a list of persons with names matching the contracted name in @code{name}. See @pxref{Name Expansion} for a description of the matching process. @unnumberedsubsubsec Error codes This call always succeeds. @node lookup-conf, set-client-version, lookup-person, Protocol Requests @subsection lookup-conf (6) Obsolete @findex lookup-conf @example lookup-conf [68] ( name : HOLLERITH ) -> ( ARRAY Conf-No ); @end example This call is obsolete. It has been replaced by @pxref{lookup-z-name}. This call used to return a list of conferences with names matching the contracted name in @code{name}. See @pxref{Name Expansion} for a description of the matching process. @unnumberedsubsubsec Error codes This call always succeeds. @node set-client-version, get-client-name, lookup-conf, Protocol Requests @section set-client-version (6) Recommended @findex set-client-version @example set-client-version [69] (( client-name : HOLLERITH; client-version : HOLLERITH; )) -> ( ); @end example This call is used to tell the server which client and which version of that client is being used. The name of the client is passed in @code{client-name} and the version in @code{client-version}. The information sent in this call is made available to other sessions through the @pxref{get-client-name} and @pxref{get-client-version} calls. @example 1 56 @t{=1 7} 2 69 11Helisp-client 4H0.45 @t{=2} 3 70 7 @t{=3 11Helisp-client} 4 71 7 @t{=4 4H0.45} @end example In this example the @pxref{who-am-i} call is used to find the ID of the current session. Next, set-client-version is used to set the name of the client to ``elisp-client'' and the version to ``0.45''. The third call is to @pxref{get-client-name}, which returns the string just sent to the server. Finally @pxref{get-client-version} is used to retrieve the client version of session number 7, which is, as expected, the string ``0.45''. @unnumberedsubsubsec Error codes @table @code @item string-too-long The string @code{client-name} or @code{client-version} is too long. @end table @node get-client-name, get-client-version, set-client-version, Protocol Requests @subsection get-client-name (6) Recommended @findex get-client-name @example get-client-name [70] ( session : Session-No ) -> ( HOLLERITH ); @end example This call returns the name of the client that owns session number @code{session}. This client name string returned is the one set by the client using @pxref{set-client-version}. If @code{set-client-version} has not been issued in session number @code{session}, the empty string is returned. See @pxref{set-client-version} for an example of this call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-session The session @code{session} does not exist. @end table @node get-client-version, mark-text, get-client-name, Protocol Requests @subsection get-client-version (6) Recommended @findex get-client-version @example get-client-name [71] ( session : Session-No ) -> ( HOLLERITH ); @end example This call returns the version of the client that owns session number @code{session}. This client version string returned is the one set by the client using @pxref{set-client-version}. If @code{set-client-version} has not been issued in session number @code{session}, the empty string is returned. See @pxref{set-client-version} for an example of this call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-session The session @code{session} does not exist. @end table @node mark-text, unmark-text, get-client-version, Protocol Requests @subsection mark-text (4) Recommended @findex mark-text @example mark-text [72] (( text : Text-No; mark-type : INT8; )) -> ( ); @end example This call associates the mark @code{mark-type} with the text @code{text}. The list of marks set by a person can be retrieved using the @pxref{get-marks} call. Currently, servers do not associate any particular meaning to the different types of marks, but that may change in the future. Currently, servers should not delete texts that have marks, except by user request. @example 1 23 @t{=1 *} 2 72 110 230 @t{=2} 3 23 @t{=3 1 @{ 110 230 @}} @end example This example shows how a person with no marks set sets mark 230 on text number 110. The calls to @pxref{get-marks} show the effect of the call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text} does not exists or is secret. @item permission-denied No read access to text @code{text}. @item undefined-person The person currently logged in does not exist (can't happen error.) @item mark-limit Already the maximum number of marks on text @code{text}. @end table @node unmark-text, re-z-lookup, mark-text, Protocol Requests @subsection unmark-text (4) Recommended @findex unmark-text @example unmark-text [73] ( text-no : Text-No ) -> ( ); @end example This call removes any marks the logged-in person has set on the text @code{text-no}. @example 1 23 @t{=1 1 @{ 110 230 @}} 2 73 110 @t{=2} 3 23 @t{=3 *} @end example This example shows how a user with a mark set on text number 110 removes it using the @code{unmark-text} call. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person The person currently logged in does not exist (can't happen error.) @item not-marked The text @code{text-no} was not marked. @end table @node re-z-lookup, get-version-info, unmark-text, Protocol Requests @subsection re-z-lookup (7) Recommended @findex re-z-lookup @example re-z-lookup [74] (( regexp : HOLLERITH; want-persons : BOOL; want-confs : BOOL; )) -> ( ARRAY Conf-Z-Info ); @end example This call returns a list of those conferences and/or persons matching the regular expression @code{regexp}. If @code{want-confs} is true, then the result will include non-letterbox conferences. If @code{want-persons} is true, then the result will include letterbox conferences. See also @pxref{lookup-z-name} for an alternative way to look up names. Refer to @pxref{Name Expansion} for more details on how name lookup works. @example 1 74 2H.* 1 1 @t{=1 4 @{ 15HTest Conference 0000 10 11HDavid Byers 1001 6} @t{ 21HTrains (-) Discussion 0000 11 4HJohn 1001 9 @}} 2 74 2H.* 0 1 @t{=1 2 @{ 15HTest Conference 0000 10} @t{ 21HTrains (-) Discussion 0000 11@}} 3 74 4HT.*C 1 1 @t{=3 2 @{ 15HTest Conference 0000 10} @t{ 21HTrains (-) Discussion 0000 11@}} @end example This example shows three calls to @code{re-z-lookup}. The first call returns all conferences and persons in the entire database, in this case two conferences and two persons. The second example uses the same regular expression, but in this case, the call specifies that the result is only to contain conferences, so the two persons are not returned. The third example simply returns all names matching the pattern ``T.*C''. @unnumberedsubsubsec Error codes @table @code @item regexp-error Error compiling the regexp @code{regexp}. Perhaps the pattern is not a correct regexp. @end table @node get-version-info, lookup-z-name, re-z-lookup, Protocol Requests @subsection get-version-info (7) Recommended @findex get-version-info @example get-version-info [75] ( ) -> ( Version-Info ); @end example This call returns information about the server version. The data returned by this call are primarily useful for presenting to the user. A client should not use this call to determine what the server's capabilities are. @example 1 75 @t{=1 9 7Hlyskomd 5H1.9.0} @end example This example lets us know that the server is lyskomd, version 1.9.0, which at the time of writing this is the only really usable server. @unnumberedsubsubsec Error codes This call always succeeds. @node lookup-z-name, set-last-read, get-version-info, Protocol Requests @subsection lookup-z-name (7) Recommended @findex lookup-z-name @example lookup-z-name [76] (( name : HOLLERITH; want-confs : BOOL; want-pers : BOOL; )) -> ( ARRAY Conf-Z-Info ); @end example This call looks up the name @code{name} in the server, and returns a list of all matching conferences and/or persons. If @code{want-confs} is true, then the result will include conferences that are not letterboxes. If @code{want-pers} is true, then the result will include conferences that are letterboxes. See also @pxref{re-z-lookup} for an alternative way to look up names. Refer to @pxref{Name Expansion} for details on the matching process. @example 1 74 0H 1 1 @t{=1 4 @{ 15HTest Conference 0000 10 11HDavid Byers 1001 6} @t{ 21HTrains (-) Discussion 0000 11 4HJohn 1001 9 @}} 2 74 0H 0 1 @t{=1 2 @{ 15HTest Conference 0000 10} @t{ 21HTrains (-) Discussion 0000 11@}} 3 74 3HT C 1 1 @t{=3 2 @{ 15HTest Conference 0000 10} @t{ 21HTrains (-) Discussion 0000 11@}} @end example This example shows three calls to @code{lookup-z-name}. The first call retrieves all conferences and persons in the server. The second request looks up the same name as the first, but this time the result is restricted to conferences. The final request requests all conferences and persons matching the pattern ``T C''. @unnumberedsubsubsec Error codes This call always succeeds. @node set-last-read, get-uconf-stat, lookup-z-name, Protocol Requests @subsection set-last-read (8) Recommended @findex set-last-read @example set-last-read [77] (( conference : Conf-No; last-read : Text-No; )) -> ( ); @end example This call tells the server that the last local text number the person issuing the call has read in conference @code{conference} is @code{last-read}. This call is typically used when a user wants to have a specific number of unread texts in a particular conference. @example 1 9 7 6 @t{=1 2 4 22 18 6 97 5 198 1 6 100 6 0 *} 2 77 6 3 @t{=2} 3 9 7 6 @t{=3 2 4 22 18 6 97 5 198 1 6 100 3 0 *} @end example This example shows how person 7 originally had read everything up to and including local text number 6 in conference 6. After the call to @code{set-last=read}, the @pxref{query-read-texts} call reports that person 7 has read everything up to and including local text number 3. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conference} does not exist or is secret. @item not-member Not a member of conference @code{conference}. @end table @node get-uconf-stat, set-info, set-last-read, Protocol Requests @subsection get-uconf-stat (8) Recommended @findex get-uconf-stat @example get-uconf-stat [78] ( conference : Conf-No ) -> ( UConference ); @end example This call returns some information about conference @code{conference}. The information it returns is sufficient for most uses of conference information, and this call should be used instead of @pxref{get-conf-stat} wherever possible. It uses less bandwidth and the lyskomd server always keeps all @code{UConferences} in memory, so this call is significantly faster than @pxref{get-conf-stat}. This is also currently the only way to get all the flag bits of the conference. @example 1 50 6 @t{=1 8HTestconf 0000 1 34 21 17 6 97 4 197 1} @t{ 37 3 22 18 6 97 5 198 1 5 4 5 0 5 0 77 4 1 6} 2 78 6 @t{=2 8HTestconf 00001000 6 77} 3 50 7 @t{=3 11HDavid Byers 1111 13 4 19 18 6 97 5 198 1} @t{ 13 4 19 18 6 97 5 198 1 7 0 7 0 0 0 77 1 1 0} 4 78 7 @t{=4 11HDavid Byers 11111000 0 77} @end example This example shows the difference between @pxref{get-conf-stat-old} and @code{get-uconf-stat}. In the first two examples conference 6 is retrieved, and in the second two, conference 7, which happens to be a person, is retrieved. Note the difference in length of the flag field. @unnumberedsubsubsec Error codes @table @code @item undefined-conference The conference @code{conference} does not exist or is secret. @item zero-conference @code{conference} is zero. @end table @node set-info, accept-async, get-uconf-stat, Protocol Requests @subsection set-info (9) Recommended @findex set-info @example set-info [79] ( info : Info-Old ) -> ( ) @end example This call sets the server information retrieved by @ref{get-info}. The version number in the info structure is ignored (but must be present); all other fields are stored permanently in the LysKOM database. This is a privileged call. @i{Example:} @example 1 79 10901 1 2 3 4 1080 @t{=1} @end example This example sets the conference presentation conference to one, the user presentation conference to two, the motd conference to three and the news conference to four. It also sets the login message to text 1080. It also attempts to set the version number to 1.9.1, but that number is silently ignored by the server. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied Administrator bit not set or privileges not enabled. @item undefined-conference One of the conferences in @code{info} does not exist. @item no-such-text The MOTD text in @code{info} does not exist. @item mark-limit The MOTD text in @code{info} already has the maximum number of marks. @end table @node accept-async, query-async, set-info, Protocol Requests @subsection accept-async (9) Recommended @findex accept-async @example accept-async [80] ( request-list : ARRAY INT32 ) -> ( ) @end example This call advises the server that the client wants to receive the asynchronous messages listed in @code{request-list}. The server must send these messages to the client when applicable, but may also send other types of messages if it so desires. The list of currently requested asynchronous messages may be retrieved using the @ref{query-async} call. Don't forget that message type 12 is personal, group and global text messages. Most users will not want these turned off. @i{Example:} @example 1 80 2 @{ 7 9 @} @t{=1} @end example This example tells the server that the client wants to receive asynchronous messages when the database is being synched (message 7) and when someone logs in (message 9). @unnumberedsubsubsec Error codes If the client requests a message that the server does not send, the server will reply with an error message saying which message number it does not support. The call will succeed anyway. This mechanism is useful for clients that want new versions of some messages, but need to be compatible with older servers. @table @code @item unknown-async At least one of the numbers in @code{request-list} is not the number of an async message the server knows about. The error-status indicates the first offending number. Please note that a bug in lyskomd 1.9.0 prevented the server from sending this error message (frankly, we simply forgot about it.) @end table @node query-async, user-active , accept-async, Protocol Requests @subsection query-async (9) Recommended @findex query-async @example query-async [81] ( ) -> ( ARRAY INT32 ) @end example This call queries the server for which asynchronous messages the client is receiving. Note that the client may not be able to turn off all messages returned in this list since the server may consider some messages to be mandatory. Also note that the client may still receive messages that are not listed in the result of this call. Even though those messages are turned off, the server may decide to send them under certain circumstances. @i{Example:} @example 1 81 @t{=1 7 @{ 0 5 7 9 11 12 13 @}} @end example In this example the client is receiving seven types of asynchronous messages: messages about new articles, changed names, database synching, new logins, rejected connections, personal messages and logouts. This particular set was the default for new connections to lyskomd 1.9 servers. @xref{Asynchronous Messages}, for the currently recommended list of asynchronous messages that servers should preselect. @unnumberedsubsubsec Error codes This call always succeeds. @node user-active, who-is-on-dynamic, query-async, Protocol Requests @subsection user-active (9) Recommended @findex user-active @example user-active [82] ( ) -> ( ); @end example This call simply notifies the server that the session is active. The server uses the time of the last user-active call to calculate how long a session has been idle. @unnumberedsubsubsec Error codes This call always succeeds. @node who-is-on-dynamic, get-static-session-info, user-active, Protocol Requests @subsection who-is-on-dynamic (9) Recommended @findex who-is-on-dynamic @example who-is-on-dynamic [83] (( want-visible : BOOL; want-invisible : BOOL; active-last : INT32; )) -> ( ARRAY Dynamic-Session-Info ); @end example This call returns a list of information about sessions. If @code{want-visible} is true then information about visible sessions is returned. If @code{want-invisible} is true then information about invisible sessions is returned. If @code{active-last} is zero then the result is a list of all sessions. If @code{active-last} is nonzero then the result is a list of all sessions that have issued an @code{user-active} call within the last @code{active-last} seconds or that have never issued an @code{user-active} call. Sessions where no-one is logged in are considered invisible, and the @code{invisible} flag is always set in the corresponding @code{Dynamic-Session-Info} that is returned. @unnumberedsubsubsec Error codes This call always succeeds. @node get-static-session-info, get-collate-table, who-is-on-dynamic, Protocol Requests @subsection get-static-session-info (9) Recommended @findex get-static-session-info @example get-static-session-info [84] ( session-no : Session-No ) -> ( Static-Session-Info ); @end example This call returns information about session number @code{session-no}. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-session The session @code{session-no} does not exist. @end table @node get-collate-table, create-text, get-static-session-info, Protocol Requests @subsection get-collate-table (10) Recommended @findex get-collate-table @example get-collate-table [85] ( ) -> ( HOLLERITH ); @end example @unnumberedsubsubsec Error codes This call always succeeds. @node create-text, create-anonymous-text, get-collate-table, Protocol Requests @subsection create-text (10) Recommended @findex create-text @example create-text [86] (( text : HOLLERITH; misc-info : ARRAY Misc-Info; aux-items : ARRAY Aux-Item-Input; )) -> ( Text-No ); @end example Creates a new text with contents from @code{text} and recipients etc. defined by @code{misc-info} (@pxref{The Misc-Info List}.) In addition to the result, the server will send an asynchronous message to all members of any of the recipients of the new text. It is not defined whether this messages comes before or after the reply to the create-text message. Clients should be prepared for either situation. The text up to the first line feed is considered to be the subject line. The remaining text is the message body. Although messages with only a subject are valid, clients should avoid letting users create such messages. The items in @code{aux-items} are attached to the new text. The only Misc-Info items valid for this call are recpt, cc-recpt, bcc-recpt (protocol version 10), comm-to and footn-to. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{text} is longer than the maximum length of a message. @item temporary-failure The text could not be created at the moment. @item no-such-text Attempt to comment or footnote a non-existent or secret text. @item not-author Attempt to footnote a text authored by someone else. @item footnote-limit Attempt to footnote a text with the maximum number of footnotes already set. @item comment-limit Attempt to comment a text with the maximum number of comments already set. @item access-denied Attempt to send a text to a conference failed because no access to the conference or any superconference that will accept a text. @item anonymous-rejected Attempt to send an anonymous text to a conference that does not accept anonymous texts. @item illegal-misc Invalid misc-info list. A recipient is listed more than once or there is an unknown misc item in the misc-info list. @item illegal-aux-item One of the aux-items in @code{aux-items} is illegal. The tag might be out of range, the item not applicable to texts or whatever @item aux-item-permission One of the items looks valid but could not be created anyway. @end table @node create-anonymous-text, create-conf, create-text, Protocol Requests @subsection create-anonymous-text (10) Recommended @findex create-anonymous-text @example create-anonymous-text [87] (( text : HOLLERITH; misc-info : ARRAY Misc-Info; aux-items : ARRAY Aux-Item-Input; )) -> ( Text-No ); @end example Similar to @pxref{create-text}, but the text is created the author field set to zero. Not even the server has a record of who created the text. the original intended use for this call was for importing texts from other sources, such as WWW, FTP or Gopher, but some clients include explicit support for sending anonymous texts to a server. It is only possible to send anonymous texts to a conference with the right flag bit set. The only Misc-Info items valid for this call are recpt, cc-recpt, bcc-recpt (protocol version 10) comm-to and footn-to. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item string-too-long The string @code{text} is longer than the maximum length of a message. @item temporary-failure The text could not be created at the moment. @item no-such-text Attempt to comment or footnote a non-existent or secret text. @item not-author Attempt to footnote a text authored by someone else. @item footnote-limit Attempt to footnote a text with the maximum number of footnotes already set. @item comment-limit Attempt to comment a text with the maximum number of comments already set. @item access-denied Attempt to send a text to a conference failed because no access to the conference or any superconference that will accept a text. @item anonymous-rejected Attempt to send an anonymous text to a conference that does not accept anonymous texts. @item illegal-misc Invalid misc-info list. A recipient is listed more than once or there is an unknown misc item in the misc-info list. @item illegal-aux-item One of the aux-items in @code{aux-items} is illegal. The tag might be out of range, the item not applicable to texts or whatever @item aux-item-permission One of the items looks valid but could not be created anyway. @end table @node create-conf, create-person, create-anonymous-text, Protocol Requests @subsection create-conf (10) Recommended @findex create-conf @example create-conf [88] (( name : HOLLERITH; type : Any-Conf-Type; aux-items : ARRAY Aux-Item-Input; )) -> ( Conf-No ); @end example This call is used to create new conferences. @code{name} is the name of the new conference and @code{type} is its type. If successful, the call returns the conference number of the newly created conference. The list @code{aux-items} contains the aux items to attach to the conference. To use this call the session must have logged in as a user with privileges to create conferences (@pxref{Security}). @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item permission-denied The server does not allow anyone to create a conference and user does not have the @code{create-conf} bit set. @item conference-exists A conference named @code{name} already exists. @item bad-name @code{name} contains invalid characters. @item string-to-long @code{name} is too long to be used as a conference name. @item secret-public The conference type has the @code{secret} bit set, but the @code{rd-prot} bit is cleared. @item illegal-aux-item One of the aux-items in @code{aux-items} is illegal. The tag might be out of range, the item not applicable to conferences or whatever @item aux-item-permission One of the items looks valid but could not be created anyway. @end table @node create-person, get-text-stat, create-conf, Protocol Requests @subsection create-person (10) Recommended @findex create-person @example create-person [89] (( name : HOLLERITH; passwd : HOLLERITH; aux-items : ARRAY Aux-Item-Input; )) -> ( Pers-No ); @end example This call requests that the server create a new person with the name and password given as arguments. To create a person the session must be logged in as a person with sufficient privileges. The list @code{aux-items} contains the aux items that are to be attached to the new person's letterbox conference. The new person will be a member of exactly one conference: the associated letterbox. That membership will have priority 255 and (of course) position 0. All flags of the membership will be 0. @unnumberedsubsubsec Error codes @table @code @item login-first The session is not logged in and the server does not allow person creation before logging in. @item permission-denied The server does not allow anyone to create person and the person currently logged on does not have the @code{create-pers} bit set. @item conference-exists There is already a conference named @code{name}. @item invalid-password The string @code{passwd} is not a valid password. @item illegal-aux-item One of the aux-items in @code{aux-items} is illegal. The tag might be out of range, the item not applicable to conferences or letterboxes or whatever. @item aux-item-permission One of the items looks valid but could not be created anyway. @end table @node get-text-stat, get-conf-stat, create-person, Protocol Requests @subsection get-text-stat (10) Recommended @findex get-text-stat @example get-text-stat [90] ( text-no : Text-No ) -> ( Text-Stat ); @end example Get information about text number @code{text-no}. The text-stat contains information about the size of the text, its recipients, comments, author and more. @unnumberedsubsubsec Error codes @table @code @item no-such-text The text @code{text-no} does not exist, or no read access. This error code will also be used when attempting to fetch any text except the motd-of-lyskom text without logging in first. @item text-zero Attempt to retrieve text number 0. @end table @node get-conf-stat, modify-text-info, get-text-stat, Protocol Requests @subsection get-conf-stat (10) Recommended @findex get-conf-stat @example get-conf-stat [91] ( conf-no : Conf-No ) -> ( Conference ); @end example This call retrieves the conference data structure for conference number @code{conf-no}. @unnumberedsubsubsec Error codes @table @code @item undefined-conference The conference @code{conf-no} does not exist or is secret. @end table @node modify-text-info, modify-conf-info, get-conf-stat, Protocol Requests @subsection modify-text-info (10) Recommended @findex modify-text-info @example modify-text-info [92] (( text : Text-No; delete : ARRAY Aux-No; add : ARRAY Aux-Item-Input; )) -> ( ); @end example This call deletes the aux-items listed in @code{delete} from the text @code{text} and then adds the ones listed in @code{add} to the text. Either list may be empty, and the call is guaranteed to either completely fail or completely succeed. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item no-such-text The text @code{text} does not exist or is secret. @item aux-item-permission No permission to delete one or more of the items in @code{delete}, or not enough permissions to add one or more of the items in @code{add}. @item illegal-aux-item One of the items in @code{add} is illegal for some reason. @end table @node modify-conf-info, get-info, modify-text-info, Protocol Requests @subsection modify-conf-info (10) Recommended @findex modify-conf-info @example modify-conf-info [93] (( conf : Conf-No; delete : ARRAY Aux-No; add : ARRAY Aux-Item-Input; )) -> ( ); @end example This call deleted the aux-items listed in @code{delete} from the conference @code{conference} and then adds the ones listed in @code{add} to the text. Either list may be empty, and the call is guaranteed to either completely fail or completely succeed. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conference} does not exist or is secret. @item aux-item-permission No permission to delete one or more of the items in @code{delete}, or not enough permissions to add one or more of the items in @code{add}. @item illegal-aux-item One of the items in @code{add} is illegal for some reason. @end table @node get-info, modify-system-info, modify-conf-info, Protocol Requests @subsection get-info (10) Recommended @findex get-info @example get-info [94] ( ) -> ( Info ); @end example This call returns the @code{Info} structure for the server (@pxref{LysKOM Data Types}. Clients should call this in order to find out which conferences are used for presentations and such. It can be issued without logging in. @unnumberedsubsubsec Error codes This call always succeeds. @node modify-system-info, query-predefined-aux-items, get-info, Protocol Requests @subsection modify-system-info (10) Recommended @findex modify-system-info @example modify-system-info [95] (( items-to-delete : ARRAY Aux-No; items-to-add : ARRAY Aux-Item-Input; )) -> ( ); @end example This call modifies the aux-item list of the server information (which can be retrieved using @ref{get-info}.) It only succeeds when issued by a person with the admin bit set and privileges enabled. @unnumberedsubsubsec Error codes @table @code @item login-first Login requires before issuing this call. @item permission-denied Admin bit not set or privileges not enabled. @item illegal-aux-item Attempt to create an invalid aux item. @item aux-item-permission Attempt to delete an undeletable item or create an uncreateable item. @end table @node query-predefined-aux-items, set-expire, modify-system-info, Protocol Requests @subsection query-predefined-aux-items (10) Recommended @findex query-predefined-aux-items @example query-predefined-aux-items [96] ( ) -> ( ARRAY INT32 ); @end example Returns the list of aux-items that have specific definitions in the server. These items are the only items within the restricted tag ranges that can be created. The meanings of the various item types are defined in this document. @unnumberedsubsubsec Error codes This call always succeeds. @node set-expire, query-read-texts, query-predefined-aux-items, Protocol Requests @subsection set-expire (10) Recommended @findex set-expire @example set-expire [97] (( conf-no : Conf-No; expire : Garb-Nice; )) -> ( ); @end example This call sets the @code{expire} field of the conference @code{conf-no} to @code{expire}. This call can only be issued by the conference's supervisor or a privileged user. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference The conference @code{conf-no} does not exist or is secret. @item permission-denied Not supervisor of conference @code{conf-no} and not privileged enough to complete the call anyway. @end table @node query-read-texts, get-membership, set-expire, Protocol Requests @subsection query-read-texts (10) Recommended @findex query-read-texts @example query-read-texts [98] (( person : Pers-No; conference : Conf-No; )) -> ( Membership ); @end example This call is used to find the number of unread texts in a conference. The data it returns is actually a membership structure which specifies which texts have been read. It is up to the client to transform the data to a more usable form. @code{person} is the person being queried is to be made and @code{conference} is the conference in question. This call may be issued without logging in. Calling @code{query-read-texts-old} does not require the session to be logged in. @i{Example:} @example 1 98 6 1 @t{=1 32 5 11 12 7 93 1 193 1 1 20 133} @t{ 3 @{ 135 136 137 @} 5 01000000} @end example This example finds the read texts for user 6 in conference 1. The returned data indicates that the user last read conference 1 (the tenth number) on Monday July 12th, 1993 at 11:05:32 (the first nine numbers), that the person has assigned priority 20 to the conference (the eleventh number) and that all articles up to and including local number 133 plus articles 135, 136 and 137 have been read. The membership was added by person 5, and it is passive. @unnumberedsubsubsec Error codes @table @code @item undefined-person @code{person} does not exist, or no access to person. @item undefined-conference Conference @code{conference} does not exist, or is secret. @item zero-conference @code{conference} is zero. @item not-member @code{person} is not a member of @code{conference} or insufficient privileges to find out if @code{person} is a member. @end table @node get-membership, add-member, query-read-texts, Protocol Requests @subsection get-membership (10) Recommended @findex get-membership @example get-membership [99] (( person : Pers-No; first : INT16; no-of-confs : INT16; mask : BITSTRING ( want-read-texts ); )) -> ( ARRAY Membership ); @end example This call retrieves the membership record for a list of conferences for a single person. @code{person} is the person whose memberships are to be retrieved. @code{first} is the first position in the membership list to retrieve, numbered from 0 and up. @code{no-of-confs} is the number of membership records to retrieve. @code{mask} is a set of flags. Currently the only flag is @code{want-read-texts}, which instructs the server not to send the @code{read-texts} array of the memberships. The server will return a membership list that is shorter than @code{no-of-confs} if @code{no-of-confs} + @code{first} is larger than the number of conferences the person is a member of. Elements of the member list that the person requesting the list does not have sufficient privileges to see may be cleared. Cleared elements simply have all fields set to zero. @example 1 99 5 0 3 1 @t{=1 2 @{ 49 14 17 13 8 91 5 255 1 5 255 0 0 * 5 00000000} @t{ 20 14 22 17 6 97 4 197 1 6 100 2 0 * 5 00000000 @}} 1 99 5 0 1 1 @t{=1 1 @{ 49 14 17 13 8 91 5 255 1 5 255 0 0 * 5 00000000 @}} 1 99 5 1 4 1 @t{=1 1 @{ 20 14 22 17 6 97 4 197 1 6 100 2 0 * 5 00000000 @}} @end example In this example we retrieve the memberships of person 5. The first call asks for three memberships, starting with number 0. Since this person is only a member of two conferences, the list returned only contains two memberships. The next two calls retrieve a single membership each. The first by asking for only one, and the second by asking for four memberships, starting with number 1. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-person The person @code{person} does not exist. @item undefined-conference The conference @code{person} does not exist or is secret. @item index-out-of-range @code{first} is higher than the index of the first conference in the person's membership list. @end table @node add-member, get-members, get-membership, Protocol Requests @subsection add-member (10) Recommended @findex add-member @example add-member [100] (( conf-no : Conf-No; pers-no : Pers-No; priority : INT8; where : INT16; type : Membership-Type; )) -> ( ); @end example Make the person @code{pers-no} a member of conference @code{conf-no}. The membership priority is set to @code{priority} and its position in the membership list is set to @code{where}. This call can be used to change the priority, position and flags of a conference in the person's membership list if the person is already a member of the conference. The person doing this must either be a supervisor of the affected person, or have sufficient privileges enabled. @example 1 99 119 0 10 0 @t{=1 1 @{ 49 14 17 13 8 91 5 255 1 119 255 0 0 * 119 00001111 @}} 1 100 1 119 250 0 10000000 @t{=1} 1 100 119 119 251 1 00000000 @t{=1} 1 99 119 0 10 0 @t{=1 2 @{ 52 30 14 11 5 96 2 162 1 1 250 0 0 * 119 00000000 49 14 17 13 8 91 5 251 1 119 255 0 0 * 10000000 @}} @end example This example makes person 119 (me) a member of conference number 1 and changes the priority and some flags of the preexisting membership in conference 119. The priority is set to 250 and the conference is placed first in the membership list. The first and last calls of the example show the membership list for person 119 before and after the calls. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @item undefined-conference Conference @code{conf-no} does not exist or is secret. @item zero-conference @code{conference} is zero. @item undefined-person Person @code{pers-no} does not exist @item access-denied Not enough permissions or privileges to add members to conference or to change privileges, position or type of a preexisting membership. @code{conf-no}. @item permission-denied Person @code{pers-no} is already a member of conference @code{conf-no}, but the person logged on is not a supervisor and does not have enough privileges to change the priorities of person @code{pers-no}. @end table @node get-members, set-membership-type, add-member, Protocol Requests @subsection get-members (10) Recommended @findex get-members @example get-members [101] (( conf : Conf-No; first : INT16; no-of-members : INT16; )) -> ( ARRAY Member ); @end example This call returns a list of members of the conference @code{conf-no}. @code{first} is the first index in the membership to return, numbered from zero and up. @code{no-of-members} is the maximum number of members to return. Some of the elements of the result may be cleared if the person requesting the information does not have sufficient privileges to see the contents. Cleared elements simply have all fields set to zero. @example 1 101 1 0 100 @t{=1 4 @{ 7 7 00000000 8 8 00000000 9 8 00000000 } @t{ 10 10 00000000 @}} 1 101 6 0 100 @t{=1 4 @{ 5 5 01000000 7 7 01000000 9 8 10000000 } @t{ 10 10 00000000 @}} 1 101 6 2 2 @t{=1 2 @{ 9 8 10000000 10 10 00000000@}} @end example In this example the client first requests the first 100 members in conference 1. The second request is for the first 100 members of conference 6. The last request is for members 2 and 3 in conference 6. @unnumberedsubsubsec Error codes @table @code @item undefined-conference The conference @code{conf} does not exist or is secret. @item index-out-of-range @code{first} is higher than the number of members in @code{conf}. @end table @node set-membership-type, local-to-global, get-members, Protocol Requests @subsection set-membership-type (10) Recommended @findex set-membership-type @example set-membership-type [102] (( pers : Pers-No; conf : Conf-No; type : Membership-Type; )) -> ( ); @end example This call modifies the type of a membership. The person @code{pers} membership in conference @code{conf} is affected. The server may impose arbitrary restrictions on how the membership type may be changed. Typically it will only be possible to clear the @code{invitation} bit. It is possible that the server will not permit the @code{secret} bit to be set. Attempting to set a membership type that does not agree with the server's restrictions will result in an error. @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @c FIXME: more codes here @end table @node local-to-global, map-created-texts, set-membership-type, Protocol Requests @subsection local-to-global (10) Recommended @findex local-to-global @example local-to-global [103] (( conf-no : Conf-No; first-local-no : Local-Text-No; no-of-existing-texts : INTEGER; )) -> ( Text-Mapping ); @end example FIXME: more text here @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @c FIXME: more codes here @end table @node map-created-texts, , local-to-global, Protocol Requests @subsection map-created-texts (10) Recommended @findex map-created-texts @example map-created-texts [104] (( author : Pers-No; first-local-no : Local-Text-No; no-of-existing-texts : INTEGER; )) -> ( Text-Mapping ); @end example Return information about existing texts that @code{author} has written. FIXME: more text here @unnumberedsubsubsec Error codes @table @code @item login-first Login required before issuing this call. @c FIXME: more codes here @end table @node Asynchronous Messages, , , Top @chapter Asynchronous Messages Asynchronous messages are information messages sent from the server to the client. Clients can select which messages to receive by issuing an @code{@ref{accept-async}} call. They can find out which messages are being sent by issuing the @code{@ref{query-async}} call. Note that the server can send other messages as well. For example, a broadcast message from a person with admin bits set may get through even if the client has not requests broadcast messages. When a connection is opened some messages are selected by default. Clients should use the @code{@ref{accept-async}} call to select which messages they want. Servers are encouraged to preselect the @code{new-text-old}, @code{new-name}, @code{sync-db}, @code{leave-conf}, @code{login}, @code{rejected-connection}, @code{send-message} and @code{logout} messages. These correspond to the useful messages that were sent prior to the introduction of @code{accept-async}. An asynchronous message is sent as a colon immediately followed by the number of message parameters, the message numbers and the message parameters. For example, message number 5 could be sent as @example :3 5 119 11HDavid Byers 13HDavid C Byers @end example The parameters of each message are listed in the same format as server calls. The messages with status "O" are included here for historical purposes only. Servers are not required to handle them, and are encouraged to reject them if a client uses it as an argument to @code{@ref{accept-async}}. @menu Message Name Status Description Number ------------------------------------------------------------------------------- * async-new-text-old:: A text has been created (0) * async-i-am-off:: O Logged off (obsolete) (1) * async-i-am-on-obsolete:: O Client changed i-am-on string (obsolete) (2) * async-new-name:: Conference or person changed name (5) * async-i-am-on:: Client changed i-am-doing string (6) * async-sync-db:: Server is saving the database (7) * async-leave-conf:: Person has been removed from a conf while in (8) * async-login:: Someone has logged in (9) * async-broadcast:: O Broadcast message (obsolete) (10) * async-rejected-connection:: LysKOM is full. Log out to make room. (11) * async-send-message:: Text message to group or person (12) * async-logout:: A person has logged out (13) * async-deleted-text:: A text was deleted (14) * async-new-text:: A text has been created (15) ------------------------------------------------------------------------------- @end menu @node async-new-text-old, async-i-am-off, , Asynchronous Messages @subsection async-new-text-old (1) Obsolete (10) @example async-new-text-old [0] (( text-no : Text-No; text-stat : Text-Stat-Old; )); @end example This message is sent when a text is created. The text number of the text is sent in @code{text-no} and the text stat in @code{text-stat}. This message is sent to all logged-in members of any recipient of the text. In protocol version 10 this call has been superceded by @ref{async-new-text}. @node async-i-am-off, async-i-am-on-obsolete, async-new-text-old, Asynchronous Messages @subsection async-i-am-off (1) Obsolete @example async-i-am-off [1] ( person : Pers-No ); @end example This message was sent when a person logged off. It has been replaced by call @code{Async logout}. @node async-i-am-on-obsolete, async-new-name, async-i-am-off, Asynchronous Messages @subsection async-i-am-on-obsolete (1) Obsolete @example async-i-am-on-obsolete [2] (( person : Pers-No; conference : Conf-No; what-am-i-doing : HOLLERITH; )); @end example This message was sent when a user changed his what-i-am-doing string or working conference. It has been replaced by call number 6, @ref{async-i-am-on}. @node async-new-name, async-i-am-on, async-i-am-on-obsolete, Asynchronous Messages @subsection async-new-name (1) Recommended @example async-new-name [5] (( conf-no : Conf-No; old-name : HOLLERITH; new-name : HOLLERITH; )); @end example This message is sent when a person or conference changes names. The conference whose name is being changed is sent in @code{conf-no}, the old name in @code{old-name} and the new name in @code{new-name}. @node async-i-am-on, async-sync-db, async-new-name, Asynchronous Messages @subsection async-i-am-on (1) Recommended @example async-i-am-on [6] ( info : Who-Info ); @end example This message is sent when a session's working conference, what-i-am-doing string or username changes. The new information is sent in @code{info}. FIXME: can the username change? @node async-sync-db, async-leave-conf, async-i-am-on, Asynchronous Messages @subsection async-sync-db (1) Recommended @example async-sync-db [7] ( ); @end example This message is sent once just before the server blocks to save its database and once just after it blocks. There is no good way to tell the difference between the two cases. @node async-leave-conf, async-login, async-sync-db, Asynchronous Messages @subsection async-leave-conf (1) Recommended @example async-leave-conf [8] ( conf-no : Conf-No ); @end example This message is sent to a user if the user's membership in the working conference is forcefully revoked. The conference the user is being removed from is sent in @code{conf-no}. @node async-login, async-broadcast, async-leave-conf, Asynchronous Messages @subsection async-login (1) Recommended @example async-login [9] ( pers-no : Pers-No; session-no : Session-No; ); @end example This message is sent when someone logs in. The identity of the person logging in is sent in @code{pers-no}. @node async-broadcast, async-rejected-connection, async-login, Asynchronous Messages @subsection async-broadcast (1) Obsolete @example async-broadcast [10] (( sender : Pers-No; message : HOLLERITH; )); @end example This message has been superceded by @code{send-message} which is more flexible. It used to be sent when the administrator broadcast a string to all LysKOM users. @node async-rejected-connection, async-send-message, async-broadcast, Asynchronous Messages @subsection async-rejected-connection (1) Recommended @example async-rejected-connection [11] ( ); @end example This message is sent when someone fails to log in because the maximum number of allowed connections has been reached. Some clients may take this as a signal to log out. Administrators should take it as a signal to allow more connections. @node async-send-message, async-logout, async-rejected-connection, Asynchronous Messages @subsection async-send-message (1) Recommended @example async-send-message [12] (( recipient : Conf-No; sender : Pers-No; message : HOLLERITH; )); @end example This message is sent when someone sends a message string. The recipient of the message is sent in @code{recipient}. If it is zero, then the message was sent to all connections. If it is a conference, then the message is being sent to all logged-in members of that conference. If it is a letterbox then the message is personal and is only sent to members of the letterbox conference. @node async-logout, async-deleted-text, async-send-message, Asynchronous Messages @subsection async-async-logout (1) Recommended @example async-logout [13] (( pers-no : Pers-No; session-no : Session-No; )); @end example This message is sent when someone logs out. @code{pers-no} is the person logging out and @code{session-no} is the session in which the person is logging out. @node async-deleted-text, async-new-text, async-logout, Asynchronous Messages @subsection async-deleted-text (10) Recommended @example async-deleted-text [14] (( text-no : Text-No; text-stat : Text-Stat; )); @end example This message is sent when a text is deleted and the currently logged-in person is a member of one of the recipients. The text number being deleted is sent in @code{text-no} and the text stat in @code{text-stat.} @node async-new-text, , async-deleted-text, Asynchronous Messages @subsection async-new-text (10) Recommended @example async-new-text [15] (( text-no : Text-No; text-stat : Text-Stat; )); @end example This message indicates that a new text has been created. The text has number @code{text-no}, and the text stat is @code{text-stat}. The message is sent to all logged-in members of any recipient of the text. @node Error Codes, , , Top @chapter Error Codes If a call cannot complete successfully, LysKOM will respond with an error reply, as defined below and earlier (@pxref{Client-Server Dialog}). @example error-reply ::= ( "%" ref-no : INT32; error-no : Error-No; error-status : INT32; ) error-no ::= INT32; @end example A client should be prepared for any error code in response to any call, no matter if the response makes any sense or not. The value returned in @code{error-status} was more or less undefined before protocol version 10. For protocol version 10, the meaning of @code{error-status} is defined below. The meaning of @code{error-status} can be modified by any call. In particular the calls that deal with Misc-Info lists set @code{error-status} to the index of the misc item that caused the error (if the error was caused by a misc item.) Client should handle the error messages listed with each call in a graceful manner. In addition, the following error types should always be handled gracefully: @code{temporary-failure}, @code{internal-error}, @code{feature-disabled}, @code{not-implemented}, @code{obsolete-call}, @code{ldb-error}, @code{feature-disabled}, @code{out-of-memory}. Client should also be able to handle any error in any situation without choking completely since bugs might cause the wrong error message to be sent or new errors might be added later on. @table @code @item no-error (0) No error has occurred. @code{error-status} is undefined. This should never happen, but it might. @item not-implemented (2) The call has not been implemented yet. @code{error-status} is undefined. @item obsolete-call (3) The call is obsolete and no longer implemented. @code{error-status} is undefined. @item invalid-password (4) Attempt to set a password containing illegal characters, or to use an incorrect password. @item string-too-long (5) A string was too long (see descriptions of each call.) @code{error-status} indicates the maximum string length. @item login-first (6) Login is required before issuing the call. @code{error-status} is undefined. @item login-disallowed (7) The system is in single-user mode. You need to be privileged to log in despite this. @code{error-status} is undefined. @item conference-zero (8) Attempt to use conference number 0. @code{error-status} is undefined. @item undefined-conference (9) Attempt to access a non-existent or secret conference. @code{error-status} contains the conference number in question. @item undefined-person (10) Attempt to access a non-existent or secret person. @code{error-status} contains the person number in question. @item access-denied (11) No read/write access to something. This might be returned in response to an attempt to create a text, when the recipient conference and its super conferences are read-only, or when attempting to add a member to a conference without enough permission to do so. @code{error-status} indicates the object to which we didn't have enough permissions to. @item permission-denied (12) Not enough permissions to do something. The exact meaning of this response depends on the call. @code{error-status} indicated the object for which permission was lacking, or zero. @item not-member (13) The call requires the caller to be a member of some conference that the caller is not a member of. @code{error-status} indicates the conference in question. @item no-such-text (14) Attempt to access a text that either does not exist or is secret in some way. @code{error-status} indicates the text number in question. @item text-zero (15) Attempt to use text number 0. @code{error-status} is undefined. @item no-such-local-text (16) Attempt to access a text using a local text number that does not represent an existing text. @code{error-status} indicates the offending number. @item local-text-zero (17) Attempt to use local text number zero. @code{error-status} is undefined. @item bad-name (18) Attempt to use a name that's too long, too short or contains invalid characters. @code{error-status} is undefined. @item index-out-of-range (19) Attempt to use a number that's out of range. The range and meaning of the numbers depends on the call issued. @code{error-status} is undefined. @item conference-exists (20) Attempt to create a conference or person with a name that's already occupied. @code{error-status} is undefined. @item person-exists (21) Attempt to create a person with a name that's already occupied. @code{error-status} is undefined. This error code is probably not used, but you never know for sure. @item secret-public (22) Attempt to give a conference a type with both the @code{secret} and @code{rd-prot} bits set at the same time. This is an error since such a conference type is inconsistent. @code{error-status} is undefined. @item letterbox (23) Attempt to change the @code{letterbox} flag of a conference. @code{error-status} indicates the conference number. @item ldb-error (24) Database is corrupted. @code{error-status} is an internal code. @item illegal-misc (25) Attempt to create an illegal misc item. @code{error-status} contains the index of the illegal item. @item illegal-info-type (26) Attempt to use a Misc-Info type that the server knows nothing about. @code{error-status} is undefined. @item already-recipient (27) Attempt to add a recipient that is already a recipient of the same type. @code{error-status} contains the recipient that already is. @item already-comment (28) Attempt to add a comment to a text twice over. @code{error-status} contains the text number of the text that already is a comment. @item already-footnote (29) Attempt to add a footnote to a text twice over. @code{error-status} contains the text number of the text that already is a footnote. @item not-recipient (30) Attempt to remove a recipient that isn't really a recipient. @code{error-status} contains the conference number in question. @item not-comment (31) Attempt to remove a comment link that does not exist. @code{error-status} contains the text number that isn't a comment. @item not-footnote (32) Attempt to remove a footnote link that does not exist. @code{error-status} contains the text number that isn't a footnote. @item recipient-limit (33) Attempt to add a recipient to a text that already has the maximum number of recipients. @code{error-status} is the text that has the maximum number of recipients. @item comment-limit (34) Attempt to add a comment to a text that already has the maximum number of comments. @code{error-status} is the text with the maximum number of comments. @item footnote-limit (35) Attempt to add a footnote to a text that already has the maximum number of footnote. @code{error-status} is the text with the maximum number of footnote. @item mark-limit (36) Attempt to add a mark to a text that already has the maximum number of marks. @code{error-status} is the text with the maximum number of marks. @item not-author (37) Attempt to manipulate a text in a way that required the user to be the author of the text, when not in fact the author. @code{error-status} contains the text number in question. @item no-connect (38) Currently unused. @item out-of-memory (39) The server ran out of memory. @item server-is-crazy (40) Currently unused. @item client-is-crazy (41) Currently unused. @item undefined-session (42) Attempt to access a session that does not exist. @code{error-status} contains the offending session number. @item regexp-error (43) Error using a regexp. The regexp may be invalid or the server unable to compile it for other reasons. @code{error-status} is undefined. @item not-marked (44) Attempt to manipulate a text in a way that requires the text to be marked, when in fact it is not marked. @code{error-status} indicates the text in question. @item temporary-failure (45) Temporary failure. Try again later. @code{error-code} is undefined. @item long-array (46) An array sent to the server was too long. @code{error-status} is undefined. @item anonymous-rejected (47) Attempt to send an anonymous text to a conference that does not accept anonymous texts. @code{error-status} is undefined. @item illegal-aux-item (48) Attempt to create an invalid aux-item. Probably the tag or data are invalid. @code{error-status} contains the index in the aux-item list where the invalid item appears. @item aux-item-permission (49) Attempt to manipulate an aux-item without enough permissions. This response is sent when attempting to delete an item set by someone else or an item that can't be deleted, and when attempting to create an item without permissions to do so. @code{error-status} contains the index at which the item appears in the aux-item list sent to the server. @item unknown-async (50) Sent in response to a request for an asynchronous message the server does not send. The call succeeds, but this is sent as a warning to the client. @code{error-status} contains the message type the server did not understand. @item internal-error (51) The server has encountered a possibly recoverable internal error. @code{error-status} is undefined. @item feature-disabled (52) Attempt to use a feature that has been explicitly disabled in the server. @code{error-status} is undefined. @item message-not-sent (53) Attempt to send an asynchronous message failed for some reason. Perhaps the recipient is not accepting messages at the moment. @code{error-status} is undefined. @end table @node LysKOM Content Types, , , Top @chapter LysKOM Content Types LysKOM defines a few special content types for texts. They are all described in this chapter. In addition to these, clients must support text/plain, should support text/enriched and are encouraged to support text/html. @menu * Reformattable Text (x-kom/basic) :: * The User Area (x-kom/user-area) :: * Conference Lists (x-kom/conflist) :: @end menu @node Reformattable Text (x-kom/basic), The User Area (x-kom/user-area),, LysKOM Content Types @section Reformattable Text This type of content corresponds to the mime type x-kom/basic. It is raw text that can be reformatted by the client without ill effects, but that can be legibly displayed on a text terminal without formatting. @itemize @bullet @item Lines must be no longer than 70 characters. @item Each line is terminated by a single newline character. @item Two newline characters in succession signal the end of the paragraph. @item There must be no whitespace or newlines after the last character @end itemize The following rules apply when reformatting: @itemize @bullet @item The indentation of the first line of a paragraph is to be applied to all lines in the paragraph. @item If the first line of a paragraph matches ">+ *" then the string that matched that regexp is to be prefixed to all lines of the paragraph. @end itemize @node The User Area (x-kom/user-area), Conference Lists (x-kom/conflist), Reformattable Text (x-kom/basic), LysKOM Content Types @section The User Area @node Conference Lists (x-kom/conflist), , The User Area (x-kom/user-area), LysKOM Content Types @section Conference Lists @node The User Area, , , Top @chapter The User Area The user area is a regular text that is used to store client-specific information in the server. Most clients use this to store settings a user has made that are specific to a particular server. There are also provisions to store settings that are shared between clients. The user-area is divided into several sub-blocks. The common block is shared by all clients, and its formats and contents dictated by this protocol specification. Clients may also create one or more blocks. The entire user-area is coded as a @code{HOLLERITH}. This string in turn contains a list of pairs of @code{HOLLERITH} strings. Each pair consists of one string containing the block name and one containing the data. This format ensures that clients can copy or read past other clients' blocks without knowing their structure. The following block names have been defined: @table @code @item common The common block shared by all clients. The format of the common block is described below. @item elisp The block created by the Emacs list client. The format is completely undocumented, but you'll need a lisp reader to parse it. @end table If you're writing a client that uses the user-area, please let us know what you name your client's block. @section The Common Block This defines the theoretical structure of the common block. The real world probably does not agree entirely with this, and it is likely to change just as soon as I have time to define something better. In the mean while you're probably better off ignoring the common block and storing all your settings in a client block. The Emacs lisp client uses the common block, but I have a feeling that it might store data that other clients can't read. The common block contains a list of variable settings. Each variable setting consists of a name, some whitespace, and a value. Settings are separated by a line feed character. As of protocol version 10, values can be integers, strings, booleans or lists. The encoding is such that a value is encoded as a single protocol A token. That means that strings and lists are both encoded as HOLLERITHs. The reason for this is to simplify for clients that need to ignore the value, and so it is possible to add new value types without confusing old clients (new types will be encoded as HOLLERITHs.) The grammar below sort of defines the syntax of the common block. @example common-block : settings settings : settings setting | /* empty */ setting : variable ' ' value '\n' variable : [A-Za-z-_0-9]+ value : boolean | HOLLERITH | list | integer boolean : 1 | 0 integer : -?[0-9]+ list : integer elems // Encoded in a HOLLERITH elems : elems value | empty @end example Currently the following variables are used, but more may be added, and as of protocol version 10, clients should be able to cope with variables they know nothing of in the common block, as long as they are of one of the types above. Pre-protocol version 10 clients can't deal with HOLLERITHs in the common block. As of protocol 10 the following variables are stored in the common block: @table @code @item created-texts-are-read True if the user wants texts s/he creates to be marked as read automatically. Boolean. @item dashed-lines True if the user wants dashed lines around the text body when it's displayed. Boolean. @item presence-messages True if the user wants messages about people logging in and logging out of LysKOM. Boolean. @item print-number-of-unread-on-entrance True if the user wants to see the number of unread texts when entering a conference. Boolean. @item read-depth-first True if the user wants to read text in depth-first order. Boolean. @item reading-puts-comments-in-pointers-last True if the user wants the client to display comment links after the text body. Boolean. @item confirm-multiple-recipients True if the user wants the client to ask for confirmation before sending a text to many conferences. @item default-mark The default mark to set on marked texts. @end table @node Writing Clients, , , Top @chapter Writing Clients This chapter is not really part of the protocol specification, but it contains some information that may be useful for client writers. @menu * Common Commands:: Common commands and how they're implemented. * Client Conventions:: Conventions clients should follow. @end menu @node Common Commands, Client Conventions, , Writing Clients @section Common Commands Most clients will implement certain commands. This main purpose of this section is to get client writers started on some of these commands, and to answer some questions that seem to come up over and over again. @menu * What do I have unread:: * Only read the most recent N texts:: * Review the last N by FOO to BAR:: @end menu @node What do I have unread, Only read the most recent N texts,,Common Commands @node Only read the most recent N texts, Review the last N by FOO to BAR, What do I have unread, Common Commands @node Review the last N by FOO to BAR,,Only read the most recent N texts, Common Commands @node Client Conventions, , Common Commands, Writing Clients @section Client Conventions There are certain conventions that most clients follow, and that users expect. These are not part of the protocol and are subject to change. In particular those conventions that address deficiencies in the protocol will go away when the protocol is updated to correct these deficiencies. @menu * Text formatting:: The format of texts in the database. * Content type specification:: Clients can tag the content type of a text. * Remote control:: Some clients can be remotely controlled. @end menu @node Text formatting, Content type specification, , Client Conventions @subsubsection Text formatting Traditionally the only clients for LysKOM were text-based and only displayed texts exactly as they were stored in the server. Although there are a number of clients now that can wrap lines automatically, texts should still be stored in preformatted style, suitable for display in a monospaced font. If the client accepts texts from the user and then reformats them, such as a client with an editor with a variable-width font, it should ensure that it follows the following simple rules: @itemize @bullet @item Lines should be no longer than 72 characters. @item Lines are terminated with a single newline character. @item Paragraphs are separated by two newlines in succession. @item There are no empty lines at the end of the text. @end itemize Clients that include editors but do not alter the text before sending it to the server should attempt to ensure that texts confirm to the above conventions. The same conventions apply to messages sent with the @pxref{send-message} call. @node Content type specification, Remote control, Text formatting, Client Conventions @subsubsection Content type specification This convention is understood by all popular clients. If the first line is one of a few predefined strings, then this string specifies the type of text. Currently only the strings ``html:'' and ``enriched:'' are supported, specifying text/html and text/enriched respectively. Starting with protocol version 10, this ugly workaround is obsolete. Use aux-items to specify content type instead. @node Remote control, Type Index, Content type specification, Client Conventions This convention is only implemented by the Emacs-Lisp client, but since I work on that client, I'm free to write about it. This is a subprotocol between clients, transferred by messages sent using @pxref{send-message}. @node Type Index, Request Index, Remote control, Top @chapter Type Index @printindex tp @node Request Index, , Type Index, Top @chapter Request Index @printindex fn @bye

https://www-physics.lbl.gov/~stapp/ec.tex

lbl.gov

CC-MAIN-2022-33

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2022-33/segments/1659882571210.98/warc/CC-MAIN-20220810191850-20220810221850-00510.warc.gz

%REPORTMASTER (revised 8/24/88) \documentstyle[12pt]{article} %\input math_macros.tex \def\baselinestretch{1.2} \def\thefootnote{\fnsymbol{footnote}} \begin{document} \begin{titlepage} \begin{center} %IN PROGRESS \today \hfill LBNL-xxxxx \\ \vskip .5in {\large \bf The Emergence of Consciousness} \footnote{This work is supported in part by the Director, Office of Science, Office of High Energy and Nuclear Physics, Division of High Energy Physics, of the U.S. Department of Energy under Contract DE-AC03-76SF00098} \vskip .50in Henry P. Stapp\\ {\em Lawrence Berkeley National Laboratory\\ University of California\\ Berkeley, California 94720} \end{center} \vskip .5in \begin{abstract} ABSTRACT \end{abstract} \end{titlepage} \newpage \renewcommand{\thepage}{\arabic{page}} \setcounter{page}{1} %THIS IS PAGE 1 (INSERT TEXT OF REPORT HERE) \noindent {\bf Introduction} It is widely believed by both scientists and philosophers that consciousness, as we experience it, was not always present in this universe, but emerged gradually from a more purely physical stratum in conjunction with the development of biological systems, and, in particular, nervous systems. But if one assumes that the physical foundation from which consciousness emerged is adequately described by classical physical theory then one is put in a quandry by the deterministic character of that theory. For the dynamical completeness of classical physical theory entails that either the emerging structure causes actual violations of the deterministic laws or that this emerging structure makes no actual difference to the course of physical events. The second option seems implausible, because then there could be no feed back that would allow survival considerations to lead to the gradual development and improvement of this emerging structure of the basis of its fitness. And the close coordination that we can recognized in our own conscious process and the capacities of our bodies to behave in ways that can actualize our mental intentions would have no natural explanation. On the other hand, the laws of classical physics are so tightly and beautifully woven into a rigid rational structure that the idea that something can step in from the outside and simply over-ride them seems ad hoc and unnatural. We know, of course, that classical physical theory is basically invalid: it has been replaced at the fundamental level by quantum field theory. The indeterministic character of this latter theory obviously opens up the possibility for the gradual emergence of structures that would act strictly within the bounds allowed by quantum theory, and yet exhibit the two-way causal connection between the emerging structures and the underlying physical organism that would permit a rationally understandable development of an emergent structure from rudimentary beginnings to human-type consciousness. A misunderstanding that has blocked the development of this natural idea has been the notion that the indeterminism of quantum theory is exclusively random. There is indeed one aspect of this quantum indeterminism that is intrinsically random, and any tampering or biasing of that randomness would destroy the very fabric of quantum theory, and replace it by some ad hoc and arbitrary mutant that would not be quantum theory at all, but some mutilated structure that would lack the cohesiveness and beauty that places quantum theory apart from all pretenders. However, there is a second, and very important, element of indeterminism in quantum theory, and this second element is perfectly suited to accomodate an emerging structure that could arise from the physical organism, and maintain a two-way causal connection to it within the strict confines of quantum field theory. This second element of indeterminism is the general form of the freedom that is called, within quantum theory, the freedom of the experimenter to choose which aspect of nature he wants to probe, or, at a more impersonal level, the indeterminism of the ``basis''. This ``basis problem'' is the root of the controversies about how quantum theory should be ``interpreted''. The thesis of this paper is that this second element of indeterminism of quantum theory is precisely the ingredient of quantum theory that underlies the process of the emergence of proto-consciousness in the primitive organisms, and then the gradual evolution of such rudimentary systems with proto-consciousness into higher forms such as thinking human beings. \noindent {\bf The Principles} The main first principle is that ``feelings'' are primordial ingredients of nature. They are causally connected to the physical aspects of nature, but are not reducible to, or re-expressible in terms of, the physical aspects. This is in line with Wm. James's position that it is logically possible for experiential-type realities to be prior to any observing entities that ``experience'' them. Indeed, since we are aware of, or know, the ``self'', that self must be *within* thought, and part of it, not something that stands behind the thought, or the act of knowing [See MMandQM, p. 21]. The ``self'' that appears in human experience is assumed, in this theory, to be a slowly changing `fringe' part of a stream of human conscious experience [MMandQM p. 160]. This ``self'' is perhaps ubiquitous in human experience, but the concept of a ``knower'' is asserted to be inessential to the primordial concept of a``feel''. Each quantum collapse has a ``feel'', or perhaps one should say a ``proto-feel'', regardless of whether there is a larger ``feel'' that feels, or knows, both the feel and a ``self'' that ``feels'' it. The second key element is the body-world scheme [MMandQM p. 41, 150ff], which is the (human) brain's representation of the body it controls, and the world around that body. There are the ``current'', ``projected'', and ``historical'' body-world schemata. The first one is the system's representation of the current state of the body and world, the second is the system's representation of an intended state, and the third one is the system's representation of the history known to it. These are described in MMandQM. The third key ingredient is the ``top-level process'', which is called the top-level `code' in MMandQM. It accesses and acts upon, the body-world schemata. The problematic element in quantum theory is the choice of ``basis''. This choice can be reduced to the choice of projection operator P. In the Copenhagen interpretation this choice is done by the human experimenter. I carry this idea over to the von Neumann-Wigner formulation of quantum theory. In order to have a simple definite model I assume that the operator P(t) is defined to be the possible P that maximizes $Tr P S(t)$, where the `possible' P's are those such that the collapse $S(t)\longrightarrow PS(t)P$ has a definite ``feel''. The operator P(t) is presented to nature if and only if the system gives its `consent'. This consent is either given or withheld on the basis of an evaluation of the feel of P(t). I have conjectured that the operator P acts on the low frequency elecromagnetic field, and in particular on the ``coherent state'' part of that field, and more specifically on the coulomb part of that field in the radiation gauge, in the rest frame of the cosmic background radiation. Then the ``feel'' of the component picked out by P(t) is essentially the feel of a ``quasi classical'' state consisting of a host of `oscillators' distributed over the body/brain of the individual: the `feel' would be like the `feel' of a symphony orchestra. The evaluation of this `feel', and the action of collapsing the state $S(t)$ to $PS(t)P$, or to $(1-P)S(t)(1-P)$, requires that the state and the `feel' be aspects of some enveloping reality that has the capacity to do this evaluation and action. No attempt is made in this model to describe this enveloping reality: the model simply describes the rules of operation at the level of the dynamics of the quantum state S(t). The question of exactly what it is that makes the state behave in the way it does is like the question of why Newton's laws hold. Thus the model no more aspires to be a complete description of the totality of reality than Newton's theory was intended, in Newton's view, to be the complete and final last word of science: it strives to be a scientific theory with significant explanatory power. This is the outline of my vN/W QT model of human mind-brain dynamics. The question here is how this model of the human mind-brain dynamics fits into a general theoretical structure that can encompass the evolutionary predecessors of human beings, and provide an account of how human consciousness, and the brains that support it, could develop, jointly and naturally, from very simple beginnings, via the quantum dynamics described by this model together with considerations of fitness and survival. The principal observation here is that there is in the model nothing fundamental that cannot be present also in very simple systems. The essential features of collapse based in `consent' based on `evaluation' based on `feel', can be present also in rudimentary systems. In human beings the collapses act on the top-level process, which accesses and acts upon the body-world schemata, which act upon the motor centers, and upon other low-level brain processes, whereas in a primitive system the collapses act directly to select a course of action. Thus although there is a huge difference as regards the complexity of the state selected by the operator P in the case of human beings as contrasted to a rudimentary system, and hence a huge difference in the quality of the `feel' of the events associated with the collapse, the basic forms are the same for primitive systems and human mind/brains. So the evolutionary advantage that is given to systems that exploit this quantum process can be effective for both rudimentary and complex systems. In particular, the effect of the quantum collapses---in conjunction with the quantum Zeno effect---of keeping the behaviour of a system focussed on a task can be beneficial for both simple and complex systems. \end{document}

http://ctan.sharelatex.com/tex-archive/macros/latex/contrib/xymtex/lowcycle.sty

sharelatex.com

CC-MAIN-2013-20

text/x-tex

crawl-data/CC-MAIN-2013-20/segments/1368709224828/warc/CC-MAIN-20130516130024-00082-ip-10-60-113-184.ec2.internal.warc.gz

%% %% This is file `lowcycle.sty', %% generated with the docstrip utility. %% %% The original source files were: %% %% lowcycle.dtx (with options: `lowcycle') %% %% This is a generated file. %% %% Copyright 1996,1998,2001,2002,2004 by Shinsaku Fujita %% %% This file is part of the XyMTeX system. %% ======================================= %% %% Version 1.01 Released on August 16, 1996 %% Version 1.02 Released on October 31, 1996 (private version) %% Version 2.00 Released on December 25, 1998 %% Version 2.01 Released on June 20, 2001 (private version) %% Version 3.00 Released on April 30, 2002 %% Version 4.00 Released on May 30, 2002 (private version) %% Version 4.00 Released on August 30, 2004 %% %% Copyright (C) 1996, 1998, 2001, 2002, 2004 by Shinsaku Fujita, %% all rights reserved. %% This style file is created for drawing chemical structural formulas %% This style file is to be contained in the ``xymtex'' directory which %% is an input directory for TeX. %% %% Copying of this file is authorized only if either %% %% (1) you make absolutely no changes to your copy, including name and %% directory name %% (2) if you do make changes, %% (a) you name it something other than the names included in the %% ``xymtex'' directory and %% (b) you acknowledge the original name. %% This restriction ensures that all standard styles are identical. %% %% ======================================= %% %% This file contains several codes modified from latex.tex (LaTeX2.09) %% and from latex.ltx (a LaTeX2e), the reused parts of which are subject to %% Copyright 1994 the LaTeX3 project and the individual authors (For further %% copyright information see the file legal.txt of the LaTeX2e standard %% distribution, and any other copyright indicated in this file.) %% %% File: lowcycle.dtx %% \CharacterTable %% {Upper-case \A\B\C\D\E\F\G\H\I\J\K\L\M\N\O\P\Q\R\S\T\U\V\W\X\Y\Z %% Lower-case \a\b\c\d\e\f\g\h\i\j\k\l\m\n\o\p\q\r\s\t\u\v\w\x\y\z %% Digits \0\1\2\3\4\5\6\7\8\9 %% Exclamation \! Double quote \" Hash (number) \# %% Dollar \$ Percent \% Ampersand \& %% Acute accent \' Left paren \( Right paren \) %% Asterisk \* Plus \+ Comma \, %% Minus \- Point \. Solidus \/ %% Colon \: Semicolon \; Less than \< %% Equals \= Greater than \> Question mark \? %% Commercial at \@ Left bracket \[ Backslash \\ %% Right bracket \] Circumflex \^ Underscore \_ %% Grave accent \` Left brace \{ Vertical bar \| %% Right brace \} Tilde \~} \typeout{XyMTeX for Drawing Chemical Structural Formulas. Version 4.01} \typeout{ -- Released August 30, 2004 by Shinsaku Fujita} \def\j@urnalname{lowcycle} \def\versi@ndate{August 30, 2004} \def\versi@nno{ver4.01} \def\copyrighth@lder{SF} % Shinsaku Fujita \typeout{XyMTeX Macro File `\j@urnalname' (\versi@nno) <\versi@ndate>% \space[\copyrighth@lder]} \@ifundefined{setsixringv}{\input chemstr.sty\relax}{} \@ifundefined{threehetero}{\input hetarom.sty\relax}{} \@ifundefined{sixheteroh}{\input hetaromh.sty\relax}{} \unitlength=0.1pt \def\cyclopentanev{\@ifnextchar[{\@cyclopentanev[@}{\@cyclopentanev[]}} \def\@cyclopentanev[#1]#2{% \iforigpt \typeout{command `cyclopentanev' % is based on `fiveheterov'.}\fi% \fiveheterov[#1]{}{#2}} \def\cyclopentanevi{\@ifnextchar[{\@cyclopentanevi[@}{\@cyclopentanevi[]}} \def\@cyclopentanevi[#1]#2{% \iforigpt \typeout{command `cyclopentanevi' % is based on `fiveheterovi'.}\fi% \fiveheterovi[#1]{}{#2}} \def\cyclopentaneh{\@ifnextchar[{\@cyclopentaneh[@}{\@cyclopentaneh[]}} \def\@cyclopentaneh[#1]#2{% \iforigpt \typeout{command `cyclophentaneh' % is based on `fiveheteroh'.}\fi% \fiveheteroh[#1]{}{#2}} \def\cyclopentanehi{% \@ifnextchar[{\@cyclopentanehi[@}{\@cyclopentanehi[]}} \def\@cyclopentanehi[#1]#2{% \iforigpt \typeout{command `cyclopentanehi' % is based on `fiveheterohi'.}\fi% \fiveheterohi[#1]{}{#2}} \def\indanev{\@ifnextchar[{\@indanev[@}{\@indanev[rb]}} \def\@indanev[#1]#2{% \iforigpt \typeout{command `indanev' % is based on `nonaheterov'.}\fi% \nonaheterov[#1]{}{#2}} \def\indanevi{\@ifnextchar[{\@indanevi[@}{\@indanevi[rb]}} \def\@indanevi[#1]#2{% \iforigpt \typeout{command `indanevi' % is based on `nonaheterovi'.}\fi% \nonaheterovi[#1]{}{#2}} \def\indaneh{\@ifnextchar[{\@indaneh[@}{\@indaneh[rb]}} \def\@indaneh[#1]#2{% \iforigpt \typeout{command `indaneh' % is based on `nonaheteroh'.}\fi% \nonaheteroh[#1]{}{#2}} \def\indanehi{\@ifnextchar[{\@indanehi[@}{\@indanehi[rb]}} \def\@indanehi[#1]#2{% \iforigpt \typeout{command `indanehi' % is based on `nonaheterohi'.}\fi% \nonaheterohi[#1]{}{#2}} \def\cyclobutane{\@ifnextchar[{\@cyclobutane[@}{\@cyclobutane[]}} \def\@cyclobutane[#1]#2{% \iforigpt \typeout{command `cyclobutane' % is based on `fourhetero'.}\fi% \fourhetero[#1]{}{#2}} \def\cyclopropane{\@ifnextchar[{\@cyclopropane[@}{\@cyclopropane[]}} \def\@cyclopropane[#1]#2{% \iforigpt \typeout{command `cyclopropane' % is based on `threehetero'.}\fi% \threehetero[#1]{}{#2}} \let\cyclopropanev=\cyclopropane \def\cyclopropanei{\@ifnextchar[{\@cyclopropanei[@}{\@cyclopropanei[]}} \def\@cyclopropanei[#1]#2{% \iforigpt \typeout{command `cyclopropanei' % is based on `threeheteroi'.}\fi% \threeheteroi[#1]{}{#2}} \let\cyclopropanevi=\cyclopropanei \def\cyclopropaneh{\@ifnextchar[{\@cyclopropaneh[@}{\@cyclopropaneh[]}} \def\@cyclopropaneh[#1]#2{% \iforigpt \typeout{command `cyclopropaneh' % is based on `threeheteroh'.}\fi% \threeheteroh[#1]{}{#2}} \def\cyclopropanehi{\@ifnextchar[{\@cyclopropanehi[@}{\@cyclopropanehi[]}} \def\@cyclopropanehi[#1]#2{% \iforigpt \typeout{command `cyclopropanehi' % is based on `threeheterohi'.}\fi% \threeheterohi[#1]{}{#2}} \endinput %% %% End of file `lowcycle.sty'.