url
stringlengths 22
1.01k
| url_host_registered_domain
stringlengths 5
36
⌀ | crawl
stringlengths 15
15
| content_mime_type
stringlengths 2
68
| content_mime_detected
stringlengths 9
39
⌀ | warc_filename
stringlengths 108
138
| warc_record_offset
int64 16.1k
1.59B
| warc_record_length
int64 537
1.05M
| content
stringlengths 0
1.05M
|
|---|---|---|---|---|---|---|---|---|
https://isabelle.in.tum.de/repos/testboard/raw-diff/85d7dd40106a/doc-src/AxClass/style.tex | tum.de | CC-MAIN-2021-49 | text/plain | application/x-tex | crawl-data/CC-MAIN-2021-49/segments/1637964358078.2/warc/CC-MAIN-20211127013935-20211127043935-00297.warc.gz | 396,156,021 | 856 |
diff -r c9c615d970db -r 85d7dd40106a doc-src/AxClass/style.tex
--- a/doc-src/AxClass/style.tex Mon Oct 11 11:04:56 1999 +0200
+++ b/doc-src/AxClass/style.tex Mon Oct 11 11:08:30 1999 +0200
@@ -1,7 +1,6 @@
\documentclass[11pt,a4paper,fleqn]{article}
-\usepackage{english,a4,bbb,../pdfsetup}
-\usepackage[latin1]{inputenc}
+\usepackage{bbb,../pdfsetup}
\makeatletter
|
https://ftp.linux.cz/pub/tex/CTAN/digests/texline/no8/rept.tex | linux.cz | CC-MAIN-2022-40 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2022-40/segments/1664030337595.1/warc/CC-MAIN-20221005073953-20221005103953-00273.warc.gz | 307,866,962 | 8,437 |
%Carol Hewlett's report on UK TUG, held at Nottingham University on
% 4 November 1988.
%
\centerline{\bf UK \TeX\ Users' Group}
\medskip
\noindent
The Inaugural Meeting of the UK \TeX\ Users' Group was held at the
University of Nottingham, on 4 November 1988.
\smallskip
\leftline{Summary of Papers:}
\par
\noindent{\it\MFsl\ ---\ An Overview: Charles Curran, Oxford University}
\noindent
Charles Curran started out by asking What is \MF? He then proceeded to give
some reasons why it might be used:
\item{1} to design `odd characters', but not usually a whole
fount;
\item{2} there were problems with
different device drivers and these
could be cured via \MF\ by altering the device
parameters for various printers,
particularly with reference to the write-white versus write-black enigma;
\item{3} sometimes defective characters needed redesigning.
\noindent
He said that existing characters can often be adapted;
he suggested people speak to Dominik Wujastyk if they needed to get founts for
alphabets other than european.
He then showed diagrammatically the relationship between \MF\ and \TeX\ and
the various ouput files, some of which should be tuned to the desired output
device.
Various implementations of \MF\ exist, running on {\sc vms}, {\sc sun} and
Macintosh. Some have preview capability.
Charles said that \MF\ can be used to
generate Computer Modern fonts at various
resolutions\slash magnifications; to generate device-specific fonts by modifying
e.g., |waits.mf|, |local.mf|; and to generate odd characters.
It was possible that there was a need for a UK \MF\ group, although the
r\^ole of answering \MF\ problems was currently dealt with by newsletters
and bulletin boards.
Charles then made a number of general points about the matching of founts
to page-printers. It was not generally known which print engine
was used in which page-printer (and it could be very difficult to find out).
Further, the average user (or implementer) didn't always know
how a fount {\it should} look and whether
what was being produced was the best possible. This suggested another
area for the exchange of information: information on page-printers and their
print engines and examples of the best possible printing that could be
achieved with any given machine. Another field for discussion/education
was that of type design in general.
In the discussion that followed Charles' paper, it was suggested that
a sample book be put together. The relationship (if that's the right
word) between \MF\ and \PS\ was mentioned: will \PS\ take over
all that \MF\ now does?
Finally it was pointed out that while \MF\ can be used to design {\it families},
programs like Fontographer were good for single characters but needed a
lot of work to retain any consistency when designing more than a few
characters.
\medskip
\noindent{\it Installing \TeX\ --- the scenic route: David Osborne, Nottingham
University}
\noindent
David Osborne's paper had a subtitle --- the long road to implementing \TeX.
At Nottingham, several years had been spent in trying to provide a \TeX\
user service. David explained that they had
originally obtained a \WEB\ source
for their VAX machines. \WEB\ contains both the program source and
its documentation. The code is run through a program called \Tangle, which
gives Pascal program output and documentation separately; the documentation
file then goes through \Weave\ to produce the real documentation and the Pascal
compiler is used to produce the \TeX\ executable program. \Tangle\ needs to
read a system-specific change file as well as \WEB.
There was lots of documentation, but very little help as to where to start
reading it. However, most of these problems were solved reasonably quickly.
The real difficulty came when trying to fix the printer for \TeX. That
particular problem had still not been solved, although they were now
considering an AGFA PostScript page-printer, which promised a reasonable
printing speed and for which a \TeX-\PS\ driver could be used.
He summed up by giving three points which new implementers of \TeX\ should
follow:
\item{$\bullet$} Choose the output device {\it first\/}.
\item{$\bullet$} Allow plenty of time for the implementers to become familiar with
the package and documentation.
\item{$\bullet$} Allow plenty of time for the implementation
\noindent
David further suggested that better documentation directed at implementers
was needed; and that there were implications for training both users
and those who would advise them.
\medskip
\noindent{\it An Introduction to \LaTeX: Sue Brooks, Bradford University
Software Services Limited}
\noindent
Sue Brooks gave a very persuasive talk about the benefits of using \LaTeX.
She set out a number of questions that were asked and told us her answers.
First, what was \LaTeX? It was a macro package that was somewhat similar to
Scribe (which was itself like Troff). The assumption was made that a
document had a structure; additionally, \LaTeX\ was able to handle book-like
items like table of contents.
Second, why use \LaTeX? Because it uses a document model rather than a
page description, as |plain|
\TeX\ did. It also included certain other sets
of macros, namely \BibTeX\ and \SliTeX. Sue compared \LaTeX\ to DTP packages
where she felt that \LaTeX\ won hands down.
Third, why did Sue use \LaTeX? Partly this was historical --- she had learned
\LaTeX\ while at the Open University. She still felt that it was the best
way for her to do her current publishing work. It provided a user service,
without the need for the user to write macros.
Fourth, who would benefit from using it? Authors (especially when
collaborating), authors' minions and documentation producers.
Fifth, what was wrong with \LaTeX? For a start, it was too structured; the
style files were not fully understood (except by Leslie Lamport?) and there
was no good {\it reference} manual (although the `User's Manual' was fine).
But there was no alternative, either!
Next, Sue said that \LaTeX\ was certainly not going to disappear, but there
were a number of things that would improve it, especially for the UK. In
particular, the distribution needed sorting out; more information should be
available on the implementation details and style files. There should be
a |doc| to |sty| convertor and English hyphenation.
Finally, to ease the user's burden, Sue suggested: good editing interfaces,
\LaTeX-intelligent spelling checkers, indexing tools, \BibTeX, \SliTeX\ and
its fonts, and style files.
\medskip
\noindent{\it TUG, Montr\'eal 1988 Conference: Cathy~Booth, Exeter
University}
\noindent
Cathy's report appears in full
elsewhere in \TeXline.
\medskip
\noindent{\it\TeX\ in Germany: report from Freiburg Meeting:
Chris~Rowley, Open University}
\noindent
Chris opened his report by saying that there was a lot of \TeX\ going on
in W. Germany. \TeX\ does acknowledge that there are countries other than
the US, so is welcomed by Germans. It seems to be widely used at the high-end
by commercial users. Among other things, there is work on fount design.
The meeting had held a `problem session', in which there was a discussion
of extensions to \TeX. A program of development for \TeX\ and \LaTeX\ was
proposed, for which 24 extensions were suggested.
\medskip
Sebastian~Rahtz (Southampton University)
was due to present a paper on Picture Languages, but as the proceedings
were running late, it was omitted. Peter Abbott (Aston University) asked for
\TeX\ contributions for an issue of {\it University Computing}. He also
asked for volunteers to help with the task of checking over the Aston
Archive to try to keep duplicated material to a minimum and to make sure
that what was there was up-to-date.
\medskip
\noindent{\it A UK TUG?: Malcolm Clark, Imperial College}
\noindent
Malcolm started by giving the meeting a pep talk, which he said was his
review of the world through \TeX-coloured glasses. He outlined the activities
of TUG, which included a newsletter, courses, annual conference, hotline
support (and email), products and a speakers bureau. He reminded the meeting
of the three electronic \TeX\ things --- \TeXhax, UK\TeX\ and the Aston
Archive. Malcolm noted the other European countries with \TeX\ groups of
various sorts, including \TeX interessen (W. Germany and Austria), Gutenberg
in France, a Dutch group, a Nordic grouping,
a \TeX-produced journal in Spain and also activity in Poland, Israel and Eire.
He listed the European \TeX\ meetings, in Italy in 1985, Strasbourg, 1986,
Exeter, 1988 and to come, Karslruhe/Freiburg or Stockholm in 1989 and Cork in
1990. The last topic of his review was of other groups with an interest
in electronic typesetting --- the Electronic Publishing Specialist Group of
the British Computer Society, the British Computer Society's Displays
Group and the \sgml\ users' group.
It had been revealed to the meeting that Malcolm had been asked to be
the European co-ordinator for TUG. His next points were on the subject
of what we wanted from TUG and what we could do. On the second point,
be believed that the big thing was to try to solve the ignorance factor.
\item{$\bullet$}we could produce a brief flyer to define \TeX; answer such
questions as where can \dvi\ files be typeset; perhaps document and provide an
index to the other \LaTeX\ style files and exchange \hbox{information} on
implementing \TeX.
\item{$\bullet$}someone could make a map showing the interrelation between \WEB,
\Weave, \Tangle, \TeX, Pascal, C, |gf|, |pk|, |pxl|, etc.
\item{$\bullet$}pronounciation could be standardised.
\item{$\bullet$}\TeX\ could be taught English hyphenation. (It was agreed that
Charles~Curran and Chris~Martin would investigate this area.)
\item{$\bullet$}perhaps even more use could be made of bulletin boards, electronic
mail and the Aston Archive.
\item{$\bullet$}workshops could be arranged on certain subjects, such as \MF\ type
design, macros, style files, graphics, etc.
\noindent
The rest of Malcolm's talk, group discussion and so forth was not so
structured. Although no conclusion was reached, there was much talk about
the relationship between any UK \TeX\ group and TUG. It was suggested
that we could be a {\sc TUG} subgroup, such that a subscription to the UK
Group would also form a subscription to TUG itself.
Then UK subscribers could get `local' services and {TUG\sc boat}.
Alternately, could the
UK group merely collect subscriptions in sterling on behalf of TUG,
to save us from buying \$ drafts or using credit cards? How did Europe as
a whole fit in? The only conclusion reached was that there should be a
group of some sort concerned with \TeX\ that holds regular meetings. It
was agreed that there would be another meeeting to be held in London,
probably in March, after Malcolm got back from the US where he would have
found out more about what being European co-ordinator entailed.
Another subject that was raised from time to time was the fact that
the Nottingham conference had been arranged at short notice (about 3 weeks)
and was successful because those attending had been sent electronic mail
over {\sc janet}. This gave University staff an advantage over commercial users.
It was established that commercial companies could have a
legitimate {\sc janet} address if they wished to communicate with the academic
community. They were not supposed to use {\sc janet} to communicate with other
commercial users. For the purposes of receiving UK\TeX, etc.,
provided mail boxes could be established,
there was no reason why commercial users should not be able to have
a {\sc janet} address.
It was suggested that universtity recipients of UK\TeX\ send one
(printed) copy to a non-email user.
The meeting ended with a very warm vote of thanks to David Osborne who made all
the local arrangements.
\smallskip
\rightline{\sl Carol Hewlett}
\bigskip
\centerline{\bf A UK \TeX\ Users Group?}
\medskip\noindent
On Friday November 4th I had the pleasure of attending a meeting
organised in Nottingham for the purpose of discussing a possible
UK \TeX\ Users Group. The impetus for this came from the very successful
\TeX88 conference, one of an informal series of get-togethers for
European \TeX ies, coupled with the remarkable rise to power of the
UK's own \TeX\ Archive at Aston under the benign leadership of Peter
Abbott. David Osborne put together a colloquium at short notice in the
congenial surroundings of the Cripps Computing
Centre, and about 40 people were able
to come. The problem with the short notice was that David perforce
used electronic mail to advertise the event, leading to a high
proportion of committed gurus present, not many dumb users and more or
less nobody from outside academia.
The day started officially at 11\,am. For some of us, this meant rising
at 5\,am, tripping over the cat and stumbling onto a train at 6\,am. Thank
god for British Rail egg and cress sandwiches. Anyway, at 11 or
thereabouts, Charles Curran from Oxford ambled onto the stage and
started talking about \MF. He claimed to have had his brief
changed 2 minutes before, but managed somehow to suggest that since
Computer Modern and \MF\ won't go away in the near future, and since the whole
situation of different printers and drivers is a mess, it would not do any harm
at all to have a UK group advising neophytes on which files to
sacrifice black cocks in front of (this apparently being the correct
way to get a good value for `blacker' in your |local.mf| file). Anyone
in the audience who still thought \TeX\ was something you bought off the
shelf at Safeway were then disillusioned by David Osborne's outline of
\TeX\ installation at Nottingham. While his problems revolved mainly
around printers, it was clear that the apparent `free' nature of \TeX\
is more than paid for by the arcane nature of the installation from a
raw tape. Again, it was clear that new people would benefit from
experience from a local group.
A breath of fresh air came from Sue Brooks (late of the OU, now in
commercial software documentation) with her unashamed plug for
writers (as opposed to \TeX ies) to use Lamport's \LaTeX\ macros; she
gave a clear outline of the advantages and even some solutions to the
answers to problems. She was followed after a fine lunch by
Cathy Booth (Exeter) who told us about the \TeX\ Users Group meeting in
Montreal; the interest here was in its concentration on \TeX\ in
real world production environments, which confirmed the impression
given in Seattle that \TeX\ has gone beyond implementation details (a
lesson the UK group could take on board?). Cathy also passed on some
gob-smacking gossip from commercial vendors about their new products. She was
followed by the most valuable talk (to me), a report by Chris Rowley (OU) on the
most recent German \TeX interessen meeting, in which he gave an impression of
what went on in German \TeX ery. Their work on customizing \TeX\ for German,
writing new books and listing the definite things a NEW\TeX\ should do, shows
up how lax we have been in the UK in simply accepting what the Americans give
us --- as was pointed out, we still lack English hyphenation
patterns. The Germans (and other European groups) seemed to be putting
more effort than the British into getting \LaTeX\ right, and this seemed
to be an area where progress could actually be expected.
I was scheduled to give a talk on picture languages in the afternoon,
but in the interests of discussion I agreed to be left out; Malcolm
Clark, the charismatic Leaderene of \TeX88, and
editor of the prestigious \TeXline, then took the stage and
harangued the populace on the State of the World according to \TeX,
outlining what sources of information we had now in Europe and the UK,
what the \TeX\ Users Group does, and what we needed in the UK. It turned
out that Malcolm had been unilaterally appointed European Coordinator
for TUG, so he was able to promise
a firm presentation of our desires to TUG. He outlined issues that
needed to be addressed, such as general ignorance in the world at
large about what \TeX\ was and how to get it, hyphenation problems,
teaching \TeX\ etc. Finally, we got around to the question of whether a
formal British group was needed, as opposed to simply sticking with
the main TUG or forming a pan-European group. Dissatisfaction over
what we got from TUG for the money prompted suggestions of an
autonomous group, while others wanted an affiliated chapter --- the
consensus seemed to me that we would like to join a UK version of TUG
which charged us a subscription, but sent most of it off to America
and joined TUG on our behalf, saving us bank charges etc., and
(hopefully) letting TUG ease administration and postage costs. Three
problems prevented a formal constitution being set up on the spot: a)
we did not know how TUG would react --- Malcolm would find this out in
January; b) nobody had tabled any suggestions, and it was getting
dark; c) we were not at all representative of UK \TeX\ users (i.e.~we were
mostly academic \TeX bores). It was therefore decided to hold another
meeting in London in February, with wider invitations, when we would
formally set up a group (or not, as the meeting went!).
\TeX\ is hampered by its free image, to the same extent as it is aided
by its free image. Without commercial support, it can only exist if a
committed user group continues to keep its distribution and use at a
high standard. Ten years after the foundation of TUG, are cracks
showing? Will \TeX\ survive in the `real world'? Chaotic and inefficient
as it was (I did not see why a full meeting of users could not have
taken place later on without this initial peculiar subset), the
meeting in Nottingham was another valuable contribution to The Cause
of keeping the \TeX\ flame alight. Let us hope a UK group is successfully
formed.
\smallskip
\rightline{\sl Sebastian Rahtz}
|
https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/06-02-1.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-00156.warc.gz | 258,219,981 | 1,121 | %%
%% Ein Beispiel der DANTE-Edition
%%
%% 7. Auflage
%%
%% Beispiel 06-02-1 auf Seite 86.
%%
%% 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}[showgrid=true](3,2)
\psdot*[dotstyle=pentagon,dotscale=5](1.5,1.5)
\psdots[dotsize=.4cm,dotstyle=square,
linecolor=red](0,0)(0.5,0)(1,1)(1.5,1)(2,2)(2.5,2)
\psdots*(2.5,0.6)\psdot(2.5,0.2)
\end{pspicture}
\end{document}
|
https://theanarchistlibrary.org/library/petr-kropotkin-constitutional-agitation-in-russia2.tex | theanarchistlibrary.org | CC-MAIN-2021-39 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-39/segments/1631780057913.34/warc/CC-MAIN-20210926175051-20210926205051-00284.warc.gz | 594,639,886 | 23,109 | \documentclass[DIV=12,%
BCOR=10mm,%
headinclude=false,%
footinclude=false,%
fontsize=11pt,%
twoside,%
paper=210mm:11in]%
{scrartcl}
\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{LinLibertine_R.otf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/opentype/linux-libertine/,%
BoldFont=LinLibertine_RB.otf,%
BoldItalicFont=LinLibertine_RBI.otf,%
ItalicFont=LinLibertine_RI.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{LinLibertine_R.otf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/opentype/linux-libertine/,%
BoldFont=LinLibertine_RB.otf,%
BoldItalicFont=LinLibertine_RBI.otf,%
ItalicFont=LinLibertine_RI.otf]
\let\chapter\section
% 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{The Constitutional Agitation in Russia}
\date{1905-01}
\author{Pëtr Kropotkin}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Constitutional Agitation in Russia, The},%
pdfauthor={Pëtr Kropotkin},%
pdfsubject={},%
pdfkeywords={Russia}%
}
\begin{document}
\thispagestyle{empty}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge The Constitutional Agitation in Russia\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Pëtr Kropotkin\par}}%
\vskip 1.5em
{\usekomafont{date}{1905-01\par}}%
\end{center}
\vskip 3em
\par
The greatest excitement has prevailed in Russia for the last few weeks since it became known that representatives of the Zemstvos of thirty-four provinces of the Empire were going to meet at St. Petersburg in order to discuss the necessary reforms in the general political organization of the country. The very fact that such an authorization had been granted was equivalent to an invitation to discuss a scheme of a Constitution; and so it was understood everywhere. When the Zemstvo delegates were leaving their respective provincial towns they were sent off by groups of enthusiastic friends, whose parting words were: 'Return with a Constitution!'
Their original intention was to make of their conference a solemn official gathering which would speak to the Government in its official capacity, but at the last moment the Minister of the Interior refused to grant the necessary authorization; and as the Zemstvo delegates declared that they were decided to meet nevertheless, they were informed that they could do so only in private, and that their conference would be treated as a private gathering, but that their resolutions could be handed by a few delegates to the Minister of the Interior, and through his intermediacy to the Emperor. This is how this Conference, which surely will become an important historical date, took place on the 19th, 20th, and 21st of November at St. Petersburg.
The decisions of the Conference were expressed in eleven resolutions, which, as will be seen presently, are now becoming the program of an agitation which is gradually spreading all over Russia. Moreover, in contrast with all the petitions addressed to the Czar on previous occasions by certain Zemstvos, the present memorandum is couched in far more dignified language and in definite terms. It begins by mentioning the abnormal character of State government which has developed since the beginning of the eighties [1881], and consists in a complete estrangement of the Government from the people, and the absence of that mutual confidence which is necessary for the life of the State' (Section 1). 'The present relations hetween the Government and the people'—they say further on—' are based on a fear of the people's self-administration, and on the exclusion of the people from the management of State affairs' (Section 2). The result of it is that while the bureaucracy separates the Supreme Power [read \emph{The Emperor}] from the nation, it thus creates the very conditions for an entire lawlessness in the administration, in which the personal will of every functionary takes the place of law (Section 3). This destroys confidence in the Government and hampers the development of the State (Sections 3 and 4). Consequently, the Zemstvos express the following desiderata, which deserve to be given in full, because in such history-making documents as this the wording is almost as important as the general idea:
\begin{quote}
(5) In order to put an end to this lawlessness of the Administration, the inviolability of the individual and the private dwelling must be proclaimed and thoroughly carried out in life. Nobody can have a punishment or any restriction of his rights inflicted upon him without a sentence having been pronounced to this effect by an independent magistrate. For this purpose it is moreover necessary to establish such a responsibility of the members of the Administration as would allow of their being legally prosecuted for each breach of the law, in order thus to secure legality in the actions of the functionaries.
(6) For the full development of the intellectual forces of the nation, as also the expression of the real wants of society and the free exercise of public opinion, freedom of conscience, religion, speech, and press, as also of meeting and association, must be guaranteed.
(7) The personal and political rights of all the citizens of the empire must be equal.
(8) Self-administration being the main condition for the development of the political and economical life of the country, and the main body of the population of Russia belonging to the class of the peasants, these last must be placed in the conditions that are necessary for the development of self-help and energy, and this can only be obtained by putting an end to the present subordinate and lawless position of the peasants. Therefore it is necessary: (a) to equalize the rights of the peasants with those of all other classes; (b) to free them from the rule of the Administration in all their personal and social affairs; and (c) to grant them a regular form of justice.
(9) The provincial and the municipal institutions which are the main organs of local life must be placed in such conditions as to render them capable of performing the functions of organs of self-administration, endowed with wide powers. It is necessary for this purpose: (a) that the representation in the Zemstvos should not be based on class principles, and that all forces of the population should be summoned, as far as possible, to take part in that administration; (6) that the Zemstvo institutions should be brought nearer to the people by instituting a smaller self-administrative unit;\footnote{The smallest self-administrating unit is now the district (uyezd), which embodies from 100,000 to 200,000 inhabitants. The next unit below it, the canton (volost), has also a self-administration, but only for the peasants. The Zemstvo resolution asks for a self-governed canton, composed of all the inhabitants, while the peasant self-government would be limited to the village community. It must be said that all the peasant self-government, introduced in 1861, had been entirely wrecked under Alexander III. by the introduction of special 'land-chiefs,' nominated by the Governor of the Province, and endowed with unlimited rights.} (c) that the circle of activity of the Zemstvos and the municipal institutions should include all the local needs; and (d) that these institutions should acquire the necessary stability and independence, without which no regular development of their activity and their relations to the organs of the Government is possible. Local self-government must be extended to all the parts of the Empire.
(10) For creating and maintaining a close intercourse between the Government and the nation, on the basis of the just-mentioned principles, and for the regular development of the life of the State, it is absolutely necessary that representatives of the nation, constituting a specially elected body, should participate in the legislative power, the establishment of the State's budget, and the control of the Administration. [The minority of the conference, consisting of twenty-seven persons, accepted this paragraph only as far as the words 'should participate in the legislative power.']
(11) In view of the gravity and the difficulties of both the internal and external conditions which the nation is now living through, this private conference expresses the hope that the supreme power will call together the representatives of the nation, in order to lead our Fatherland, with their help, on to a new path of national development in the sense of establishing a closer union between the State's authority and the nation.
\end{quote}
This memorandum, signed by 102 delegates out of 104—two abstaining—was handed to Prince Sviatopolk Mirsky, and through him to the Emperor. Four more resolutions were taken later on by the same Conference, and they offer a special interest, as they represent a first attempt at legislation upon a definite subject in the form, well known in olden times in this country, of a Royal petition. Three of these resolutions, which concern education, blame the Government for its negative attitude in this matter, and ask full freedom for the Zemstvos to deal with it; while the fourth demands the abrogation of the state-of-siege law and an amnesty in the following terms:
\begin{quote}
Considering that the Law of the 26th of August 1881, embodying the Measures for the Maintenance of Order in the State [state-of-siege law] is one of the chief causes which favor the development of lawlessness in the Administration and breed popular discontent, which both stand in the way of mutual confidence and unity between the Government and the population, the Conference finds that the repeal of this law is desirable. Besides, taking into consideration that the system of administratively inflicted penalties, which has been applied lately on a large scale in virtue of that law, has produced a great number of victims of the arbitrary actions of the Administration who are now suffering various penalties and limitations in their legal rights, the Conference considers it its duty to express itself in favor of a complete remission of all penalties inflicted by mere orders of the Administration. It expresses at the same time the hope that the Supreme Power will introduce pacification in the country by an act of amnesty for all persons undergoing penalties for political offenses.
\end{quote}
The Press was not permitted to mention the Zemstvo Conference, or to discuss its resolutions; but the latter were hectographed in thousands of copies at St. Petersburg, reprinted in a more or less clandestine way in many cities, and spread broadcast all over Russia. On the other side, as soon as Sviatopolk Mirsky had made his declarations about the need of 'confidence between the Government and the nation'—confirming his declarations by the release of a small number of 'administrative' exiles—the Press at once adopted quite a new tone. The need for a new departure, under which the nation would be called to participate in the government of the country, began to be expressed in a very outspoken way. All the main questions concerning the revision of taxation, the necessity of not merely returning to the original law of the Zemstvos (altered in 1890), but of revising it in the sense of an abolition of the present division into 'orders'; the necessity of reestablishing the elected Justices of the Peace, and of granting a thorough self-government to all the provinces of the Empire; the equality of political rights of all citizens, and so on—these and numbers of similar questions are discussed now with the greatest liberty in the daily Press, and nobody conceals any longer his disgust of the reactionary \emph{régime} which has swayed Russia for the last thirty years.
Of course, censorship continues to make its victims. The review \emph{Law (Pravo)} has already received two warnings, and of the two new dailies, one (\emph{Son of the Fatherland}), which came out under a new 'populist' editorship, is already suppressed for three months; while the other (\emph{Our Life}), which has Social Democratic tendencies, has its sale in the streets forbidden. With all that, the Press, with a striking unanimity, support the Zemstvo resolutions, without naming them. Even the \emph{Novoye Vremya}, which has always vacillated between ultra-Conservative and Liberal opinions, according to the direction of the wind in the upper spheres, is now Constitutionalist. As to the ultra-reactionary Prince Meschersky, owner of the \emph{Grazhdanin}, he has published some of the most outspoken articles against the old \emph{régime}—only to turn next day \emph{against} those who demand a Constitution. Since 1861, this gentleman's house has been the center of a semi-Slavophile but chiefly landlord and bureaucracy opposition to the reforms of Alexander the Second. Hold was adroitly taken in this center of the two successive heirs to the throne, Nikolai Alexandrovitch and his brother, who became later on Alexander the Third, in order to secure, through them, an overthrow of all the reforms made by their father.\footnote{The Memoirs of Prince Meschersky contain extremely instructive data in this respect.} Now, the \emph{Grazhdanin} reflects the unsettled condition of mind in the Winter Palace spheres. The \emph{Moscow Gazette} is thus the only consequent defender of the old \emph{régime}. At the same time, the provincial Press acquires a new importance every day, especially in Southern, South-Western, and South-Eastern Russia. I have several of these papers before me, and cannot but admire the straightforward and well-informed way in which they discuss all political questions. They reveal quite a new provincial life.
It would be impossible to render in a few words the depth and breadth of the agitation provoked in Russia by the Zemstvo Conference. To begin with, 'the Resolutions' were signed at once by numbers of persons of high standing in St. Petersburg society, who do not belong to the Zemstvos. The same is now done in the provinces, so that the memorandum of the Zemstvos becomes a sort of ultimatum—it cannot be called a petition—addressed by the educated portion of the nation to the Emperor. In most provincial cities the return of the Zemstvo delegates is being made the occasion of influential meetings, at which the members of the Provincial Assemblies (the District Assemblies will follow suit) send to St. Petersburg their approval of the resolutions; while numbers of landlords and other influential persons in the provinces seize this opportunity for adding their signatures to those of the Zemstvo delegates.
Wherever a few educated persons come together, nothing is spoken of but the coming Constitution. Even the appalling war has been relegated to the background, while the constitutional agitation takes every day some new form. In the universities, both professors and students join it. The former sign the resolutions, while the latter formulate similar resolutions, or organize street demonstrations to support them. Such demonstrations have taken place already at St. Petersburg, Moscow, and Kiev, and they surely will be joined by working men as soon as they spread southwards. And if they are dispersed by force they will result in bloodshed, of which none can foresee the end.
Another important current in the movement was created by the celebrations of the fortieth anniversary of the Judicial Law, which was promulgated on the 2nd of December 1864. Large meetings of lawyers (\emph{avocats}), followed by banquets, at which all professions of 'intellectuals' were represented, including members of the magistracy and, occasionally, of the administration, have been held at St. Petersburg, Moscow, Saratov, Minsk, Tomsk, and so on; and at all these meetings the program of the Zemstvos, reinforced by strong resolutions requiring the repeal of the exceptional state-of-siege law and condemning the whole \emph{régime} under which Russia is now, was voted and transmitted to the Minister of the Interior. At Moscow the resolutions passed at the meeting of the lawyers were worded very strongly, as may be seen from the following characteristic abstracts:
\begin{quote}
1 (1) The fundamental principles of Right, expressed in the Judicial Law of the 2nd of December 1864, and which recognize only such a form of State life, in which all the actions of all are submitted to law, equal for all, and applied by the Courts with no regard to any outside influence, are incompatible with the principles of the bureaucratic lawlessness which endeavors to take hold of every manifestation of life and to submit it to its uncontrolled power.' . . . '(4) The principle of religious tolerance, proclaimed in this law, was brought into nonexistence by a series of by-laws and circulars, by means of which large portions of the population were placed into special categories, and deprived of important personal, family and property rights—and this, not for crimes of theirs, and not in virtue of legal sentences, but merely for the expression of the dictates of their conscience, and by mere orders of the Administration.' . . . '(7) The principle of an independent Justice, equal for all, has been reduced to naught by the abolition of all guarantees of independence ' ; and the declaration enumerates the main by-laws by means of which this purpose was achieved.
\end{quote}
And, finally, their last resolution expresses what every educated Russian is thinking, while at the same time it contains a reply to the Czar's manifesto of April 1903. It runs as follows:
\begin{quote}
It appears from all the life of Russia for the last forty years that it is absolutely hopeless to endeavor to introduce in our country the reign of Right, so long as the arbitrary rule of bureaucracy continues to exist, even though all sorts of rights may be inscribed in our code.
\end{quote}
Nothing short of a thorough reform in the fundamental laws of the State can secure the ends of justice and law—such is the conclusion of the Moscow lawyers.
Striking facts were produced at these meetings. Thus, the following figures just published by The \emph{Messenger of Law} will illustrate the lawlessness which prevails under Nicholas the Second in all matters concerning political offenses. From 1894 till 1901, not one single political affair was brought before a court of justice or an examining magistrate. All inquests were dealt with by police officers or functionaries of the Ministry of the Interior. As to the numbers of such cases, they are simply extravagant. Thus in 1903 no fewer than 1988 political cases, concerning 5,590 persons, were opened, in addition to all those which were pending. In the same year, 1,522 inquests, involving 6,450 persons, were terminated. Out of this number 1,583 persons were liberated, 45 were sent before courts-martial, and \emph{no fewer than 4,867 persons were submitted to various penalties, including imprisonment, inflicted by the Administration, without the interference of any magistrate}. Out of these, \emph{no fewer than 1502 were sent into exile}, for terms up to ten years, to various remote provinces of Russia and Siberia! Nothing on this scale was done even under Alexander the Third, the corresponding figure for the last year of his reign being only 55 (in 1894).
The Judicial Law of 1864 contained certain guarantees against the arbitrary action of the police. But, as has been indicated during the last few days, already in 1870 and 1875 the preliminary inquest was taken out of the hands of independent examining magistrates and was handed to the ordinary police and the State police officers. No fewer than \emph{seven hundred by-laws} have been issued since 1864 for tearing the Judicial Law to pieces—limiting the rights of the courts, abolishing trial by jury in numerous cases, and so on; so that—to use the expression of the Saratov lawyers' meeting\&mdash: 'all the principles of the law of Alexander the Second have been annihilated. This law exists only in name.'
At the same time the exceptional laws promulgated during the last two reigns have given to every police officer, in every province of the Empire, the right to arrest every Russian subject without warrant, and to keep him imprisoned as a suspect for seven days— and much longer under various other pretexts—without incurring any responsibility. More than that. It was 'publicly vouched at one of the lawyers' meetings that when arrests are made \emph{en masse}, simple policemen receive in advance printed and signed warrants of arrest and searching, on which they have only to inscribe the names of the persons whom they choose to arrest! Let me add that all these resolutions and comments have been printed in full, in both the provincial and the Moscow papers, and that the figures are those of official reports.
At St. Petersburg the fortieth anniversary of the Judicial Law was celebrated by nearly 700 persons—lawyers, literary people, and soon—and their resolutions were equally outspoken.
\begin{quote}
The martyrology of the Judicial Law [they said] is a striking illustration of the fact that under the autocratic and bureaucratic \emph{régime} which prevails in Russia the most elementary conditions of a regular civil life cannot be realized, and partial reforms of the present structure of the State would not attain their aim.
\end{quote}
The Assembly confirmed therefore the resolutions of the Zemstvo representatives, only wording the chief ones still more definitely, in the following terms:
\begin{quote}
3. That all laws be made and taxes established only with the participation and the consent of representatives, freely elected by all the nation.
4. That the responsibility of the Ministers before the Assembly of Representatives of the nation should be introduced, in order to guarantee the legality of the actions and the orders of the Administration.
\end{quote}
For this purpose, and in view of the extremely difficult conditions in which the country is now involved, the Assembly demanded the immediate convocation 'of a Constituent Assembly, freely elected by the people,' and 'a complete and unconditional amnesty for all political and religious offenses,' as well as measures guaranteeing the freedom and the possibility of responsible elections, and also the inviolability of the representatives of the people. This declaration was signed by 673 persons, and sent to the Minister of the Interior.
The anniversary meetings of the Judicial Law being over, the agitation has already taken a new form. It is the municipalities, beginning with Moscow and St. Petersburg, which now pass the same resolutions. They ask for the abolition of the exceptional laws and for the convocation of a representative Assembly, and they insist upon holding a general Conference of representatives of all the Russian cities and towns, which would certainly express the same desires.
It is evident that the reactionary party is also at work, and a meeting of reactionists took place at the house of Pobiedonostsev, in order to discuss how to put a stop to the constitutional movement. They will leave, of course, not a stone unturned to influence the Czar in this direction, and, to begin with, they hit upon the idea of convoking meetings of the nobility in different provinces. They expected that such meetings would vote against a Constitution. But, beginning with Moscow, they met with a complete fiasco; the Moscow nobility adopted the same resolutions as the Zemstvos. More than that. A new movement was set on foot, in the old capital, in the same direction. A few days ago, at a meeting of the Moscow Agricultural Society, one of the members proposed a resolution demanding the abolition of the exceptional state-of-siege law promulgated in 1881. He met with some opposition, but after brilliant speeches had been pronounced in support of the resolution it was voted with only one dissentient.
One may expect now that many other societies, economic and scientific, will follow the example of the Moscow agriculturists. In the meantime the public libraries, both municipal and supported by private contributions, have inaugurated a movement for demanding a release from the rigors of censorship. There is in Russia a special censorship for the libraries, and even out of those books which have been published in Russia with the consent of the censorship many works, chiefly historical and political, are not permitted to be kept in the circulating libraries. The Smolensk public library has now petitioned the Minister of the Interior asking for the abolition of these restrictions, and this petition is sure to be followed by many others of a similar kind, the more so as simply prohibitive restrictions are imposed upon the village libraries, the public lectures, and, in fact, in the whole domain of popular education.\footnote{Here is the resolution passed on the 9th of December by the Zadneprovsk public library at Smolensk, and published in the Russian papers:— 'After having heard the statement of the committee concerning the difficulties standing in its way the meeting decided to ask from the Minister of Interior: (1) The abolition of the bylaws according to which the administration and the helpers of the library have to receive the investiture of the Government; (2) that all books allowed to circulate in Russia be allowed to be kept in the library; (3) the abolition of censorship; (4) to permit educational societies to be opened after a mere notification. At the same time the meeting has entrusted its committee to inform the Minister of the Interior of its deep conviction that the spreading of education in the country is quite impossible without the rights and the dignity of the individual, and the liberty of conscience, speech, the Press, the associations and meetings being guaranteed.'}
It will be noticed that in all the above resolutions the form to be given to representative government has not yet been defined. Must Russia have two Houses or one? Will she have seven or nine Parliaments (like Canada) and a Federal Senate? What extension is to be given to the federative principle? And so on. All these matters have not yet been discussed in detail. It is only known that some Zemstvo delegates, under the presidency of M. Shipov, are discussing these vital questions. However, as the Zemstvos exist in thirty-four provinces only, out of fifty, of European Russia proper, and there are besides Finland, Poland, the Caucasus, Siberia, Turkestan, and the Steppe Region, no scheme of representative government can be worked out without the consent of these units. This is why the idea of a Constituent Assembly is gaining ground. All that can be said in the meantime is, that the Jacobinist ideas of the centralizers find but little sympathy in Russia, and that, on the contrary, the prevailing idea is that of a federation, with full home rule for its component parts, of which Finnish home rule may be taken as a practical illustration.
Such are, then, up to the 18th of December, the main facts of the constitutional agitation which is going on in Russia. And from all sides we hear the same questions: "Is it really the end of autocracy that is coming? Is Russia going to pass from autocracy to representative government, without a revolution similar to that of 1789 to 1793 in France? Is the present movement deep enough to attain its goal? And, again, are the Czar and his nearest advisers prepared to make the necessary concessions, without being compelled to do so by popular uprisings and internal commotions?"
First of all, let it be well understood that there is nothing unforeseen in the demand of a Constitution, so unanimously expressed by the representatives of provincial self-government. Over and over again, for the last forty years, they have expressed the same desire, and it is for the third or fourth time that they now address similar demands to the Emperor. They did it in 1880-1881. They repeated it in 1894, as soon as Nicholas the Second came to the throne, and again in 1902 in connection with the Committees on the depression of agriculture. At the beginning of this year, when the war broke out and the Zemstvos decided to send their own field-hospitals to the seat of war (these hospitals, by the way, are described as the best in Manchuria), representatives of all the Zemstvos demanded the permission to meet together, to agree upon joint action in the organization of relief for the wounded, as well as for the families of the Reservists. On both occasions the authorization was refused and the meetings forbidden; but on both occasions the Zemstvo delegates held secret conferences at Moscow and discussed their affairs in spite of the menaces of Plehve (Shipoff went for that into exile). And in both cases they concluded that the convocation of a National Assembly had become an imperative necessity. The present move is thus a further development of several former ones. It is the expression of a long-felt need.
The necessity of a representative government for Russia was spoken of immediately after the death of Nicholas the First, and we are informed by Prince Tatischeff (\emph{Alexander The Second and his Times}) that as early as in 1856 Alexander the Second had had a plan of a Constitution worked out. However, precedence had to be given then to the abolition of serfdom and the terrible corporal punishments then in use (which meant a judicial reform); besides, some sort of local self-government had first to be created. These reforms filled up the years 1859-1866. But in the meantime the Polish revolution broke out (in 1863), and it was then believed at the Russian Ministry of Foreign Affairs that the uprising was supported by promises of intervention given to its leaders by the Western Powers.
This revolution had the worst imaginable consequences for Russia. It closed the reform period. Reaction set in—the reaction which has lasted up to the present day, and which has cost Russia hecatombs of her best and most devoted men and women. All schemes of constitutional changes were abandoned, and we learn from the same author that the reason which Alexander the Second gave for this abandonment was his fear for the integrity of the Empire. He came to Moscow in 1865, and there, at his Illynsky Palace, he received Golohvastoff—that same President of Nobility in one of the districts of the Moscow province who had forwarded to the Czar an address, in the name of the nobility he represented, demanding a Constitution. The words which Alexander is reported to have said to Golohvastoflf during the interview are most characteristic: 'I give you my word,' he said, 'that on this same table I would sign any Constitution you like if I were sure that this would be for the good of Russia. But I know that if I did it to-day, to-morrow Russia would go to pieces. And you do not desire such an issue. Last year you yourselves [the Moscow nobility] told me that, and you were the first to say so.'\footnote{They had asked indeed that the integrity of the Empire should be maintained, and that Poland should not be separated from Russia.} There is no reason to doubt the authenticity of these words. They are just what Alexander the Second would have said, and while he was uttering them he was quite sincere. But, as I have explained in my Memoirs, his was a very complicated nature, and while the menace of the Western Powers, ready to favor the dismemberment of the Empire, must have strongly impressed him, the Autocrat also spoke in him, and still more so the man who demanded above all to be trusted implicitly. On this last point he was extremely sensitive.
Be that as it may, the idea of giving Russia a Constitution was temporarily abandoned; but it cropped up again ten years later. The great movement 'towards the people' was then in full swing. The prisons were overflowing with political prisoners, and a series of political trials, which had taken place with open doors, had produced a deep impression on the public. Thereupon Alexander the Second handed in a scheme of a Constitution, to be reported upon to the Professor of Civil Law and the author of a book much spoken of on this subject—K. P. Pobiedonostseff!
What the appreciations of Pobiedonostseff were, we do not know; but, as he has expressed his views on representative government in a number of works, we may be certain that his report was negative. His ideal is a Church, as strongly organized as the Catholic Church, permeating all the life of society and assuming, if need be, a fighting attitude against the rival Churches. Freedom and Parliamentary rule are the enemies of such a Church; consequently, he concludes, autocracy must be maintained; and Russia is predestined to realize the happiness of the people under the rod of the Church. The worst was that Pobiedonostseff succeeded for years in maintaining a reputation for honesty, and only lately has it become evident that, although he does not care for wealth, he cherishes power and is most unscrupulous as to the means by which he maintains his influence at Court.\footnote{See, for instance, his article in the North American Review, September 1901, in which he threw the responsibility for the law in virtue of which students, for university disturbances, were marched as private soldiers to Port Arthur—\emph{a law of which, we now know, he himself was the promoter}, and which led to such serious disturbances—upon the Minister of Public Instruction, already killed by a student, and the Minister of the Interior, who was killed soon after that by Balmashoff.}
In 1876 Alexander the Second was thus besieged with doubts. But then came the uprising in Servia, the Turkish War, the Berlin Treaty, and once more the inner reforms were postponed. The Turkish War revealed, however, such depths of disorganization in the State machine that, once it was over, the time had apparently come for making a serious move in the constitutional direction. Discontent "was general," and when the trial of "The Hundred and Ninety-three" began at the end of 1878, and full reports of it were given in the papers, the sympathies of the educated classes went all in favor of the accused, and all against their accusers. The moment was opportune; but one of those omnipotent functionaries who had teen nurtured in the atmosphere of the Winter Palace, Trépoff, gave a different turn to affairs.
The history of the years 1878-1881 is so fresh in the memories of all that it need not be retold. How, immediately after the excitement produced at St. Petersburg by the above trial, Trépoff, the head of the St. Petersburg Police, ordered one of the 'politicals' to be flogged in prison; how thereupon Véra Zasulitch shot at Trépoff, and wounded him; how Alexander the Second, inspired by the Chief of the State Police, Mézentsoff, revised the relatively mild sentences pronounced by the Court in the trial of 'The Hundred and Ninety-three,' and rendered them very much heavier; how, in reply to this, Mézentsoff was killed in broad daylight; and how this was the beginning of a fearful struggle between the Government and the revolutionists, which ended in a wholesale slaughter and transportation to Siberia of the best elements of a whole generation, including children sixteen years old, and in Alexander the Second losing his life—all this is well known. It is also known that he was killed the very day that he had made a timid and belated concession to public opinion by deciding to submit to the State Council a scheme for the convocation of an \emph{Assemblée des Notables.}
This scheme is often described as a Constitution. But Alexander the Second himself never attributed to it this meaning. The proposal of Loris Melikoff, which received the approval of the Czar on the 17th of February (March 1), 1881, consisted in this: the Ministries were to bring together by the next autumn all the materials which they possessed concerning the reorganization of the Central Government. Then special Committees, composed of representatives of the different Ministries, as well as of persons invited by the Government for this purpose, would prepare schemes for reform of the Central Government 'within the limits which would be indicated by the Emperor.' These schemes, before submitting them to the State Council, would be discussed by a general Commission composed as follows: (a) Persons nominated by the Emperor out of members of the above Committees; (b) delegates from the provinces in which the Zemstvos have been introduced—two delegates per province, elected by the provincial Zemstvos—as also delegates from a few important cities; and (c) members nominated by the Government to represent the provinces which had no Zemstvo institutions. Only the members mentioned under (a) would have the right of voting; the others, (b) and (c), would only express their opinions, but not vote. The Commission itself would have no legislative power; its resolutions would be submitted to the State Council and the Emperor in the usual way.\footnote{After the Council has voted, the Emperor decides himself whether he accepts the opinion of the majority or that of the minority. This opinion becomes the law.}
This measure had to be made public, and on the 1st (13th) of March Alexander the Second approved the draft of a manifesto which had to be issued to this effect. He only desired it to be read at a meeting of the Committee of the Ministers on the following Wednesday. He was killed, as is well known, a few hours later, and the next Committee of Ministers, which took place on the 8th (20th) of March, was presided over by his son, Alexander the Third. The meeting fully approved the manifesto, which had now only to be printed. But Alexander the Third hesitated. Old Wilhelm the First had advised him to yield; but the reactionary party, headed by Pobiedonostseff and Katkoff, was very active in the opposite direction. Katkoff was called from Moscow to exert a pressure on the Czar by the side of Pobiedonostseff, and Alexander was easily persuaded by Count Ignatieff and such a specialist in police matters as the \emph{Préfet} of Paris, M. Andrieux, that the revolutionary movement could easily be crushed. Whilst all this was going on the Liberal Ministers, who were in favor of constitutional reforms, undertook nothing decisive, and Alexander the Third, who had already written to his brother: 'I feel so happy: the weight is off my shoulders, I am granting a Constitution,' yielded the other way. On the 29th of April (11th of May) he issued his autocratic manifesto, written by Pobiedonostseff, in which he declared: 'Amid our affliction, the voice of God orders us to vigorously take the ruling power in our own hands, with faith in Providence and trust in the truth and might of the Autocratic Power which we are called upon to reinforce and to protect against all attacks, for the welfare of the nation.'
One of the first acts of this personal power was the promulgation of that state-of-siege law which, as we saw, handed all classes of Russia to the now omnipotent police officials, and made of Russia one great State prison. Thus began those gloomy years 1881-1894, of which none of those who lived them through can think otherwise than as of a nightmare.
To tell the truth, Alexander the Third was not exactly a despot in his heart, although he acted like one. Under the influence of the Slavophile, Konstantin Aksakoff, he had come to believe that the mission of autocracy in Russia is to give a certain well-being to the peasants, which could never be attained under a representative government. Towards the end of his life he even used to say that there were only two thorough Socialists, Henry the Fourth and himself. What induced him to say so I do not know. At any rate, when he came to the throne he adopted a program which was explained in a French review, in an article generally attributed to Turguéneff.\footnote{See Stepniak's "King Stork and King Log: a Study of Modern Russia." 2 vols. London (Downey \& Co.), 1896, pp. 22 "seq."} Its main points were: a considerable reduction of the redemption tax which the ex-serfs paid for their liberation; a radical change in the system of imperial taxation, including the abolition of the 'poll-tax,' and the excise on salt; measures facilitating both the temporary migrations of the peasants and emigration to the Urals and Siberia; rural banks, and so on. Most of these measures were carried through during his reign; but in return the peasants were deprived of some of the most elementary personal and civil rights which they had obtained under Alexander the Second. Suffice it to say that instead of the Justices of the Peace, formerly elected by all the population, special police officers, nominated by the Governors, were introduced, and they were endowed with the most unlimited rights over the village communities, and over every peasant individually. Flogging, as in the times of serfdom, was made once more an instrument of 'educating' the peasants. Every rural policeman became a governor of his village. The majority of the schools were handed over to Pobiedonostseff. As to the Zemstvos, not only were they gradually transformed more and more into mere boards of administration under the local Governor, but the peasants were deprived of the representation which they hitherto had in that institution. The police officers became even more omnipotent than ever. If a dozen schoolmasters came together they were treated as conspirators. The reforms of 1861-1866 were treated as the work of rank revolutionists, and the very name of Alexander the Second became suspect. Never can a foreigner realize the darkness of the cloud which hung over Russia during that unfortunate reign. It is only through the deep note of despair sounded in the novels and sketches of Tchéekoff and several of his contemporaries— 'the men of the eighties'—that one can get a faint idea of that gloom.
However, man always hopes, and as soon as Nicholas the Second came to the throne new hopes were awakened. I have spoken of these hopes in the pages of this Review, and shown how soon they faded away. Since then Nicholas the Second has not shown the slightest desire to repair any one of the grave faults of his father, but he has added very many new ones.
Everywhere he and his Ministers have bred discontent—in Finland, in Poland, in Armenia (by plundering the Armenian Church), in Georgia, in the Zemstvos, among all those who are interested in education, among the students—in fact, everywhere. But that is not all. There is one striking feature in this reign. All these last ten years there has been no lack of forces which endeavored to induce the ruler of Russia to adopt a better policy; and all through these ten years he himself—so weak for good—found the force to resist them. At the decisive moment he always had enough energy to turn the scales in favor of reaction by throwing in the weight of his own personal will. Every time he interfered in public matters—be it in the student affairs, in Finland, or when he spoke so insolently to the Zemstvo delegates on his advent to the throne—every time his interference was for bad.
However, already during the great strikes of 1895, and still more so during the student disturbances of 1897, it had become apparent that the old \emph{régime} could not last long. Notwithstanding all prosecutions, a quite new Russia had come into existence since 1881. In the seventies it was only the youth which revolted against the old \emph{régime}. In our circles a man of thirty was an old man. In 1897 men of all ages, even men like Prince Viazemskiy, member of the Council of State, or the Union of Writers, and thousands of elderly men scattered all over the country, joined in a unanimous protest against the autocratic bureaucracy.
It was then that Witte began to prepare the gradual passage from autocracy to some sort of a constitutional \emph{régime}. His Commissions on the Impoverishment of Agriculture in Central Russia were evidently meant to supply that intermediate step. In every district of the thirty-four provinces which have the Zemstvo institutions, Committees, composed of the Zemstvos and of local men invited \emph{ad hoc}, were asked to discuss the causes of this impoverishment. Most remarkable things were said in these Committees, by noblemen and functionaries, and especially by simple peasants—all coming to one conclusion: Russia cannot continue to exist under the police rule which was inaugurated in 1881. Political liberties and representative government have become a most urgent necessity. 'We \emph{have} something to say about our needs, and we \emph{will} say it'—this was what peasant and landlord alike said in these Commissions. The convocation of an Assembly of the representatives of all provinces of Russia had thus become unavoidable. But then Nicholas the Second, under the instigation and with the connivance of Plehve, made his little \emph{coup d'etat}. Witte was shelved in the Council of State, and Plehve became an omnipotent satrap. However, it is now known that in 1902 Plehve had handed to Nicholas the Second a memoir in which he accused Witte of preparing a revolutionary movement in Russia, and already then the Czar had decided in his mind to get rid of Witte and his Commissions. This he did, handing Russia to that man whom the worst reactionists despised, even though they called upon him to be their savior.
An orgy of insolent police omnipotence now began: the wholesale deportation of all discontents; massacres of the Jews, of which the instigators, such as the Moldavian Krushevan, editor of the \emph{Bessarabets}, were under the personal protection of the Minister; an orgy of wholesale bribery, general corruption, and intimidation. And Nicholas the Second had not one word to say against that man! Only now, when Plehve's successors have brought to the Czar the copies of all his Majesty's correspondence with the Grand Dukes, which Plehve opened and had carefully copied for some unknown purpose— only now they go about in the Winter Palace exclaiming: 'It is Plehve who is the cause of all that agitation! It is he who has brought upon us all this odium!' As if Plehve was not \emph{their} last hope—the last card of autocracy! Truly has the lawyer Korobchevsky said before the Court, in defense of his client Sazonoff: 'The bomb which killed the late Minister of the Interior was filled, not with dynamite, but with the burning tears of the mothers, sisters wives, and daughters of the men whom he sent to the gallows or to die slowly in prison or in Siberia!'
But who are these new men of the Zemstvos—it will be asked— who come now so prominently to the front? Are they capable of playing the responsible part which history seems to bestow upon them?
When provincial self-government was introduced forty years ago there certainly was among the promoters of this reform some sort of idea like this: 'Let the landlords, the merchants, the peasants, familiarize themselves, through the provincial and the district assemblies, with representative government and the management of public affairs.' This is also how the reform was understood on the spot, and this is why the Zemstvos attracted at the outset so many of the best provincial forces.
The mode of composition of these assemblies is original. Russia, as is known, is divided into provinces, and each province into ten to twelve districts. Leaving aside Poland (ten provinces), Finland (which has its own Parliament), Caucasia and Asiatic Russia (Siberia, Turkestan, the Steppe Region), European Russia is divided into fifty provinces, out of which thirty-four have now the institution of the Zemstvo. This means that in these provinces each district has an assembly, elected by all the inhabitants, for the management of quite a number of local matters. Each assembly nominates its own executive, and all the district assemblies nominate a Provincial Assembly, which also has its executive, and is presided over by the provincial President of the Nobility. The towns have their own municipal government. The district elections, however, are made separately by the three 'orders'—the nobility, the mixed landowners (merchants and peasant proprietors), and the peasants belonging to the village communities. Besides, as the foundation of the electoral rights is the value of landed property owned by each person in the district, and the nobility are the chief landowners, the result is that in most assemblies the number of peasant representatives is inferior to those of the other two orders taken together. Only in certain north-eastern provinces such as Vyatka have the peasants a dominating voice. This is, at least, how the Zemstvos were constituted till 1890, when the would-be 'Peasant Czar' further reduced the number of peasant delegates.
It would seem that under such an organization the Zemstvos would soon become mere administrative boards, on which the country squires would find a number of well-paid positions. So it was indeed at the outset in some central provinces, where the landlords of the old school had the upper hand. But on the other hand there were also provinces, such as Tver (an old nest of 'Decembrists'), Voronezh, Poltava, partly Ryazán, etc., in which the nobility, owing to various circumstances, took the lead of the reform movement. In these provinces, as also in the north-eastern ones, in which the peasants dominate, the Zemstvos became an active force for introducing in the villages all sorts of useful institutions on a democratic basis. These two sorts of Zemstvos became the leaders of the others. This is why, notwithstanding all the obstacles opposed to them by the Central Government, the Zemstvos, as a rule, have accomplished something. They have laid the foundation of a rational system of popular education. They have placed sanitation in the villages on a sound basis, and worked out the system which answers best the purpose of free medical help for the peasants and the laboring classes. They elected Justices of Peace who were decidedly popular. And some of the Zemstvos are doing good work by spreading in the villages better methods of agriculture, by the supply of improved machinery at cost price, by spreading cooperative workshops and creameries, by mutual insurance, by introducing school gardens, and so on. All this, of course, within the narrow limits imposed by the present economical conditions, but capable, like similar beginnings in Western Europe, of a considerable extension.
Another important feature is that the Zemstvos draw into their service a considerable number of excellent men, truly devoted to the people, who in their turn exercise a decided influence upon the whole of the Zemstvo institution. Here is a country district in North-Western Russia. Its district assembly consists of twenty noblemen elected by the nobility, one deputy from the clergy (nominated by the Church), one functionary of the Crown (who sits by right), five deputies elected by the second 'order' of mixed landowners (merchants, peasant proprietors, etc.), and nine peasants from the third 'order,' representing the village communities.\footnote{Taking a district of North-Eastern Russia where, owing to the small number of nobles, the first two 'orders' vote together, we have three functionaries of the Crown sitting by right, twelve members elected by the first two orders (three nobles, the remainder are merchants, etc.), and seven peasants representing the village communities.} They decide, let us say, to open a number of village schools. But the salaries of the teachers are low, the schoolmasters' houses are poor log-huts, and the assembly people know that nobody but a' populist,' who loves the people and looks upon his work as upon his mission, will come and stay. And so the 'populist' comes in as a teacher. But it is the same with the Zemstvo doctor, who is bound to attend to a number of villages. He has to perform an incredible amount of work, traveling all the year round, every day, from village to village, over impassable roads, amid a poverty which continually brings him to despair—read only Tchékoff's novels! And, therefore, nobody but a 'populist' will stay. And it is the same with the midwife, the doctor's aid, the agricultural inspector, the cooperator, and so on. And when several Zemstvos undertook, with their limited budgets, to make house-to-house statistical inquests in the villages, whom could they find but devoted 'populists' to carry on the work and to build up that wonderful monument, the 450 volumes of the Zemstvo inquests? Read Ertel's admirable novel, \emph{Changing Guards}, and you will understand the force which these teachers, doctors, statisticians, etc., represent in a province.
The more the Zemstvos develop their activity, the more this 'third element' grows; and now it is they—the men and women on the spot, who toil during the snowstorm and amid a typhus-stricken population—who speak for the people and make the Zemstvo speak and act for it. A new Russia has grown in this way. And this Russia hates autocracy, and makes the Zemstvos hate it with a greater hatred than any which would have sprung from theories borrowed from the West. At every step every honest man of the Zemstvo finds the bureaucracy—dishonest, ignorant, and arrogant—standing in his way. And if these men shout, 'Down with autocracy!' it is because they know \emph{by experience} that autocracy is incompatible with real progress.
These are, then, the various elements which are arraigned in Russia against the old institutions. Will autocracy yield, and make substantial concessions—\emph{in time}, because time plays an immense part under such conditions? This we do not know. But that they never will be able any more to stop the movement, this is certain. It is said that they think at the Winter Palace to pass a few measures in favor of the peasants, but to avoid making any constitutional concessions. However, this will not help. Any improvement in the condition of the peasants will be welcome. But if they think that therefore they will be able to limit their concessions to the invitation of a few representatives of the provinces to the Council of State, where they may take part in its deliberations, this is a gross mistake. Such a measure might have pacified the minds in 1881, if Alexander the Third had honestly fulfilled the last will of his father. It might have had, perhaps, some slight effect ten years ago, if Nicholas the Second had listened then to the demand of the Zemstvos. But now this will do no longer. The energy of the forces set in motion is too great to be satisfied with such a trifling result. And if they do not make concessions very soon, the Court party may easily learn the lesson which Louis Philippe learned in the last days of February 1848. In those days the situation at Paris changed every twenty-four hours, and therefore the concessions made by the Ministry always came too late. Each time they answered no longer to the new requirements.
In all the recent discussions nothing has yet been said about the terrible \emph{economical} conditions of the peasants and the working men in the factories. All the resolutions were limited to a demand of \emph{political} rights, and thus they seem to imply that the leading idea of the agitation was to obtain, first, political rights, and to leave the discussion of the economical questions to the future representative Government. If this were so, I should see in such a one-sidedness the weak point of the agitation. However, we have already in the resolutions of the committees on the Impoverishment of Central Russia a wide program of changes, required by the peasants themselves and it would be of the greatest importance to circulate this program at once in the villages.
It is quite certain that every Russian—even the poorest of the peasants—is interested in the destruction of the secular political yoke to which all Russia is harnessed. But the destruction of that yoke, if it has to be done in reality, and not on paper only, is an immense work, which cannot be accomplished unless all classes of society, and especially the toiling classes, join in it. Autocracy has its outgrowths in every village. It is even probable that no progress in the overthrow of that institution will be made so long as the peasant masses do not bring their insurrections to bear upon the decisions of the present rulers. They must be told, therefore, frankly and openly by the educated classes, what the intentions of the latter are concerning the great problem which is now at this very moment facing millions of Russian peasants: 'How to live till the next crop?' Let us hope, therefore, that those who have started the present agitation with so much energy will also see that they must tell the ninety million Russian peasants the improvements in the economical conditions of the toiling masses which they can expect under the new \emph{régime}, in addition to the acquisition of political rights.
P. Kropotkin.
FOOTNOTES
% 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}
The Anarchist Library
\smallskip
Anti-Copyright
\bigskip
\includegraphics[width=0.25\textwidth]{logo-en}
\bigskip
\end{center}
\strut
\vfill
\begin{center}
Pëtr Kropotkin
The Constitutional Agitation in Russia
1905-01
\bigskip
"The Constitutional Agitation in Russia." \emph{The Nineteenth Century}, January, 1905. Online source: \href{http://www.revoltlib.com/?id=142}{RevoltLib.com}.
\bigskip
\textbf{theanarchistlibrary.org}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
http://dlmf.nist.gov/16.14.E3a.tex | nist.gov | CC-MAIN-2017-17 | application/x-tex | null | crawl-data/CC-MAIN-2017-17/segments/1492917123048.37/warc/CC-MAIN-20170423031203-00265-ip-10-145-167-34.ec2.internal.warc.gz | 101,962,371 | 686 | \[x(1-x)\frac{{\partial}^{2}\mathop{{F_{3}}\/}\nolimits}{{\partial x}^{2}}+y%
\frac{{\partial}^{2}\mathop{{F_{3}}\/}\nolimits}{\partial x\partial y}+\left(%
\gamma-(\alpha+\beta+1)x\right)\frac{\partial\mathop{{F_{3}}\/}\nolimits}{%
\partial x}-\alpha\beta\mathop{{F_{3}}\/}\nolimits=0,\] |
http://www.math.uni-magdeburg.de/~christop/lehre/2005.s7.tex | uni-magdeburg.de | CC-MAIN-2020-50 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-50/segments/1606141185851.16/warc/CC-MAIN-20201126001926-20201126031926-00519.warc.gz | 144,510,664 | 4,259 | \documentclass[12pt,a4paper]{report}
%\usepackage[final]{graphicx}
%\usepackage{emlines2}
\usepackage{german,a4}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{ngerman}
\usepackage{pictex}
%\input amssym12.def
%\input amssym12
%\input{prepictex}
%\input{pictex}
%\input{postpictex}
%\input{btcomart}
%\input{btcomrep}
\newcommand{\D}{\displaystyle}
\begin{document}
\thispagestyle{empty}
\noindent
Fakult"at f"ur Mathematik\\
Institut f"ur Mathematische Stochastik\\
Prof. Gerd Christoph
\begin{center}
{\bf "Ubungsaufgaben zur Vorlesung Mathematik III f"ur Ingenieure, WS 2005/06}\\
(7. Serie)\\
\end{center}
\begin{enumerate}
\item[174.]
Berechnen Sie folgende Doppelintegrale! Skizzieren Sie den
Integrationsbereich! Deuten Sie die Ergebnisse geometrisch!\\[2ex]
a) $ \int\limits^2_{x=1} \quad \int\limits^{2x}_{y=x} (2x + 4y + 10)
dy \, dx$ \quad \quad
b) $\int\limits^2_{y=1} \quad \int\limits^{2\,/\,y}_{x =
1\,/\, y} dx \, dy$
%
\item[175.]
%{\bf F2IM 2}\\
Skizzieren Sie den Integrationsbereich und vertauschen Sie die
Integrationsreihenfolge!\\[1ex]
a) $ \int\limits^1_{y = 0} \quad \int\limits^{1-y}_{x = - \sqrt{1-y^2}}
f(x,y) \, dx \, dy$ \quad \quad
b) $ \int\limits^1_{x=0} \quad
\int\limits^{\sqrt{1-x^2}}_{y=(1-x^2)/2} f(x,y)
dy \, dx$
%
\item[176.]
% und die Datei f2im3.eps ins Arbeitsverzeichnis kopieren!!!!
%{\bf F2IM 3}\\
Man berechne folgende Doppelintegrale "uber den angegebenen \\
Gebieten $B$.\\[2ex]
a) $ I = \int \!\! \int\limits_{\!\!\!\!\!B} x \cdot
\frac{\D e^y}{\D y^2} \, dx \, dy
$ \quad \quad \quad\quad \quad
\quad \quad $b) \int \!\! \int\limits_{\!\!\!\!\!B} (y^2 + 2x + 1) \, dx
\, dy$\\[2ex]
\begin{minipage}[t]{6cm}\vspace{0.1cm}
\beginpicture
\setcoordinatesystem units <2 cm , 2 cm>
\setplotarea x from -0.15 to 2.3, y from -0.15 to 1.7
\axis bottom shiftedto y=0
ticks %numbered from 1 to 2 by 1
length <0pt> withvalues $x$ / at 2.3 / /
\axis left shiftedto x=0
ticks %numbered from -2 to -1 by 1
% from 1 to 2 by 1
length <0pt>
withvalues $y$ / at 1.6 / /
\put{\vector(1,0){0.4}}[Bl] at 2.3 0.00
\put{\vector(0,1){0.4}}[Bl] at 0 1.7
\setlinear
\plot 0.0 0.0
1.5 1.5 /
\setquadratic
\plot 0.0 0.0
0.25 0.5
1.0 1.0
1.69 1.3
2.25 1.5 /
\put{$y=\sqrt{x}$}[Bl] at 1.4 1.1
\put{$y=x$}[Bl] at 0.7 1.3
\put{$B$}[Bl] at 0.3 0.4
\endpicture
\end{minipage}
\qquad \qquad
\begin{minipage}[t]{6cm}\vspace{0.1cm}
\beginpicture
\setcoordinatesystem units <2 cm , 2 cm>
\setplotarea x from -0.15 to 2.5, y from -0.15 to 1.7
\axis bottom shiftedto y=0
ticks numbered from 1 to 1 by 1
length <0pt> withvalues $x$ / at 2.5 / /
\axis left shiftedto x=0
ticks numbered
from 1 to 1 by 1
length <0pt>
withvalues $y$ / at 1.6 / /
\put{\vector(1,0){0.4}}[Bl] at 2.5 0.00
\put{\vector(0,1){0.4}}[Bl] at 0 1.7
\setlinear
\plot 0.0 0.0
1.5 1.5 /
\plot 1.0 0.0
2.5 1.5 /
\plot 1.0 1.0
2.0 1.0 /
\put{$y=x-1$}[Bl] at 1.7 0.5
\put{$y=x$}[Bl] at 0.7 1.3
\put{$B$}[Bl] at 1 0.5
\endpicture
\end{minipage}
\item[177.]
%{\bf F2IM 5}\\
Berechnen Sie \\[1ex]
$
\begin{array}{ll}
\mbox{a)} \quad \int\limits^4_{x=2} \int\limits^x_{ y=1} dydx \quad ; &
\mbox{b)} \quad \int\limits^1_{y=0} \int\limits^1_{x=y}
(x^2 + y^2 + 1) dx dy \\[4ex]
\mbox{c)} \quad \int\limits^1_{x=0} \int\limits^1_{y=0} \,
\frac{\D x^2}{\D 1 + y^2} \; dy dx \quad ;\quad & \mbox{d)} \quad
\int\limits^{+ \infty}_0 \int\limits^{+ \infty}_0 xy e^{-x^2 - y^2} dx dy \,!
\end{array} $\\[2ex]
Skizzieren Sie jeweils den Integrationsbereich!
\newpage
\item[178.]
%{\bf F2IAW 1}\\
Berechnen Sie mit Hilfe von Doppelintegralen den Inhalt der
Fl"achen, die von folgenden Kurven begrenzt werden:
$$\begin{array}{llll}
a) & y & = & ex^2\\
& y & = & e^x \\
& x & = & 0 \end{array} \quad \quad \begin{array}{cccc}
b) & 4y & = & x^2 - 4x\\
& x-y-3 & = & 0 \end{array} \quad \quad \begin{array}{cccc}
c) & y & = & \mbox{ln} x\\
& y & = & x-1\\
& y & = & -1 \end{array}$$
\item[179.]
%{\bf F2IAW 4}\\
Ermitteln Sie den geometrischen Schwerpunkt des Halbkreises \\[1ex]
$\{ (x,y) : y \geq 0 \,;\quad x^2 + y^2 \leq r^2 \} \; ! $
\item[180.]
%{\bf F2IAW 16}\\
Bestimmen Sie mit Hilfe von Doppelintegralen den Inhalt der Fl"achen,
die von folgenden Kurven begrenzt werden:
\begin{enumerate}
\item[a)] $y = x - 2$ \quad und \quad $y^2 = x \, ;$
\item[b)] $xy = 4$ \quad und \quad $y = 5 - x$ !
\end{enumerate}
\item[181.]
%{\bf F2IAW 18}\\
Bestimmen Sie das Volumen des K"orpers, der von folgenden Fl"achen
begrenzt wird!
\begin{enumerate}
\item[a)] $ z = 0\, ;\quad z = \frac{\D 4}{\D 1 + x^2 + y^2}\, ;\quad
y = \sqrt{1-x^2} $\quad
und \quad $y = 0$;
\item[b)] $ z = 0 $\quad und \quad $ z = e^{-x^2 - y^2} $!
\end{enumerate}
%
\item[182.]
%{\bf F2IAW 19}\\
Berechnen Sie die Koordinaten des Schwerpunktes der von den
Kurven $y = x-3$\quad und\quad
$4y - x^2 + 4x = 0$ eingeschlossenen Fl"ache!
\item[183.]
%{\bf F2IAW 21}\\
Bestimmen Sie die Masse des K"orpers, der durch die Fl"achen\\
$x = a \,;\quad
2x + z = 2a \,;\quad x + z = a \,;\quad y = \sqrt{ax}\, ;\quad y = 0$
begrenzt wird, wenn die
Dichte in jedem Punkt gleich der Ordinate $y$ dieses Punktes ist!
\item[184.]
%{\bf F2IT 1}\\
Berechnen Sie mit Hilfe von Polarkoordinaten\\[2ex]
a) $ \int\limits^{+ \infty}_{- \infty} \int\limits^{+ \infty}_{- \infty}
e^{- \frac{1}{2} (x^2 + y^2)} dx dy$ \quad \quad b) $ \int\limits^{+ \infty}_{- \infty}
\int\limits^{+ \infty}_{- \infty} \frac{\D dx dy}{\D 4 + 3x^2 + 3y^2}
\quad !$
\item[185.]
Bestimmen Sie das Doppelintegral "uber dem Kreisringsegment $D$ :
$$\int \! \! \int\limits_{\! \! \! \! \!\!\!D} \arctan \frac{\D y}{\D x} \;
dx dy \,, \quad D = \{ 1 \,\leq\, x^2 + y^2 \,\leq\, 9\,,\; y \geq x/\sqrt{3}
\, ,\; y \leq \sqrt{3}\,x \}.$$
\item[186.] Man berechne den Fl"acheninhalt der Oberfl"ache $S$ f"ur
$$
S = \{ (x,y,z) \in I\!\!R^3 : \frac{\D x^2}{\D a} +
\frac{\D y^2}{\D b} - 2z = 0 \, ; \; \frac{\D x^2}{\D a^2} +
\frac{\D y^2}{\D b^2} \leq 1 \} \, .
$$
Skizzieren Sie $S$.
\item[187.]
Sei $B = \{ (x,y,z) \in I\!\!R^3 : x^2 + y^2 + z^2 \leq 1 \, , \;
x^2 + y^2 \leq z^2 , z \geq 0 \}$. Man berechne den Schwerpunkt von
$ B $ ($\rho =$ const). Skizzieren Sie $B$.
\item[188.]
Man ermittle
$$
I = \int\! \! \! \int\limits_{\!\!\! B} \! \! \! \int f(x,y,z) \,
dx dy dz \, ,
$$
falls
$$
B = \{ (x,y,z) \in I\!\!R^3 : 0 \leq x \leq 1 \, , \; 0 \leq
y \leq x \, , \; 0 \leq z \leq x \}
$$
und $f(x,y,z) = xyz$.
Skizzieren Sie $B$.
\item[189.]
Berechnen Sie das Tr"agheitsmoment
$$
I = \int\limits_{ S} (x^2 + y^2) \rho (x,y,z) dS
$$
der Oberfl"ache
$S = \{ (x,y,z) \in I\!\!R^3 : x^2 + y^2 + z^2 = 1 \, , \;
x^2 + y^2 \leq z^2 \, , \; z \geq 0 \}$ \\
bez"uglich der $z$-Achse, wenn $\rho (x,y,z)=1$ gilt. Skizzieren Sie
$S$ und die Projektion von $S$ in die $(x,y)$-Ebene.
\item[190.]
%{\bf F2IK 1}\\
Berechnen Sie das Kurvenintegral
$$ \int\limits^{B(1,0)}_{A(0,1)} (x \sqrt{y} dx + y^2 dy)$$
l"angs der Wege \\[0.5ex]
a) $y = 1-x^2$\\
b) Gerade $AB$ !\\
c) Streckenzug $ABC$ mit $C(1,1)$ (jeweils achsenparallel)!
\item[191.]
%{\bf F2IK 3}\\
In dem Kraftfeld
$\vec{F} = (2x - \frac{\D 1}{\D 2} y + 3 ) \vec{e_1} +
(\frac{\D 1}{\D 2} x + 3y) \vec{e_2}$
wird eine Masse von $P (-2, 0)$ nach
$Q(0, 2)$ transportiert. \\[0.5ex]
Man berechne die Arbeit bei folgenden Wegen\\
a) Strecke $ \overline{PQ}$ ; \\
b) Viertelkreis mit dem Mittelpunkt $M(0, 0)$.
\item[192.]
%{\bf F2IK 5}\\
Im Kraftfeld $\vec{F} = \left[ \frac{\D x}{\D x^2 + y^2} \, , \,
\frac{\D y}{\D x^2 + y^2} \, , 1 \right]^T$ wird eine Masse l"angs des Weges
$\vec{r} (t) = \left[ \cos t, \sin t , \frac{\D 2}{\D \pi} t \right]^T$ mit
$ 0 \leq t \leq \frac{\D \pi}{\D 2}$ transportiert. Berechnen Sie die
Arbeit.
\newpage
\item[193.]
%{\bf F2IK 6}\\
Sind die Integranden folgender Kurvenintegrale totale
Differentiale einer Funktion $\Phi$? Wenn ja, berechne man nach Bestimmung
von $\Phi$ die Integrale.
\begin{enumerate}
\item[a)] $ \int ((x^2 + y) dx + (x-y^2 ) dy)$ \qquad
l"angs der Wege\\[1ex]
(1) $\frac{\D x^2}{\D a^2} + \frac{\D y^2}{\D b^2} = 1$\,,\\[1ex]
(2) geradlinig von $(1,1)$ nach $ (a,a)$\,,\\[1ex]
(3) $\vec{r} (t) = [ 2 \cos 3t , 4 \sin 3t]^T$ mit
$ 0 \leq t \leq 2 \pi$\,.\\[1ex]
\item[b)] $\int (xe^y dx - ye^x dy)$ \qquad
l"angs der Wege \\[0.5ex]
(1) geradlinig von $(0,1) $ nach $(1,0)\,,$\\[0.5ex]
(2) Viertelkreis von $(0,1)$ nach $(1,0)\,.$
\end{enumerate}
\item[194.]
%{\bf F2IK 8}\\
\begin{minipage}[t]{8.5cm}
Ermitteln Sie den Wert des Kurvenintegrals
$$\oint ((x^2 + y^2 + x) dx + (x^2 + y^2 + 2) dy)$$
l"angs des skizzierten
Weges!
\end{minipage} \quad
\begin{minipage}[t]{5cm}\vspace{0.1cm}
\beginpicture
\setcoordinatesystem units <0.7 cm , 0.7 cm>
\setplotarea x from -1 to 4.5, y from -2.5 to 2.7
\axis bottom shiftedto y=0
ticks numbered from 1 to 2 by 1
length <0pt> withvalues $x$ / at 4.5 / /
\axis left shiftedto x=0
ticks numbered from -2 to -1 by 1
from 1 to 2 by 1 length <0pt>
withvalues $y$ / at 2.5 / /
\put{\vector(1,0){0.4}}[Bl] at 4.5 0.00
\put{\vector(0,1){0.4}}[Bl] at 0 2.70
\setlinear
\plot 0.0 -2.0
2.0 0.0 /
\setquadratic
\plot 0.0 2.0
0.25 1.98431
0.5 1.936
0.75 1.85404
1.0 1.732
1.25 1.56124
1.4 1.4283
1.5 1.323
1.6 1.2
1.7 1.0536
1.75 0.96825
1.9 0.6245
2.0 0.0 /
\put{\vector(1,1){0.4}}[Bl] at 1.5 -0.5
\put{\vector(-1,1){0.4}}[Bl] at 1.0 1.732
\put{\vector(0,-1){0.4}}[Bl] at 0.0 -1.5
\put{{\footnotesize Viertelkreis}}[Bl] at 2.0 1.5
\endpicture
\end{minipage}
%
\item[195.]
Berechnen Sie unter Verwendung eines Doppelintegrals das
Kurvenintegral\\
$\oint \left( \frac{\D dx}{\D y} - \frac{\D dy}{\D x} \right)$
l"angs des Umfangs des Dreiecks $ABC$ mit $A(1\,,\, 1) , B(2\,,\, 1)$ und
$C(2\,,\, 2)$!
\item[196.]
%{\bf F2IK 15}\\
Bestimmen Sie die Fl"ache der Astroide $x = 2 \cos^3 t \; , \;
y = 2 \sin^3 t$ mit Hilfe eines Kurvenintegrals!
\item[197.]
%{\bf F2IK 13}\\
Gegeben ist $\vec{F} (x, y) = (12x^2 + cxy + 2ye^{2xy} ) \vec{e}_1
+ (8x^2 + 2xe^{2xy} + 10 y + 3) \vec{e}_2\,.$
\begin{enumerate}
\item[a)] F"ur welchen Wert $c$ ist das Kurvenintegral $\int\limits^E_A
\vec{F} \cdot \vec{dr} $ vom Wege unabh"angig?
\item[b)] Bestimmen Sie die Kr"aftefunktionen $\Phi (x\,,\, y)$, wenn
$d \Phi = \vec{F} \cdot \vec{dr}$!
\end{enumerate}
\end{enumerate}
\end{document}
|
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%201131%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-2020-05 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2020-05/segments/1579250592261.1/warc/CC-MAIN-20200118052321-20200118080321-00395.warc.gz | 129,279,159 | 1,264 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Gimber1992} Gimber, A. (1992). Los rufianes de la primera {\textquotedblleft}Celestina{\textquotedblright}: observaciones acerca de una influencia literaria. \textit{Celestinesca}, 16 (2), 63--76.
\end{thebibliography}
\end{document}
|
https://ctan.math.washington.edu/tex-archive/info/examples/LaTeX-Bib/03-03-20.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656103850139.45/warc/CC-MAIN-20220630153307-20220630183307-00600.warc.gz | 224,067,708 | 1,168 | %%
%% Ein Beispiel der DANTE-Edition
%%
%% Beispiel 03-03-20 auf Seite 68.
%%
%% 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.
%%
%%
%% ==command biber ++FILE++==
% Show page(s) 1
%%
\documentclass[]{article}
\pagestyle{empty}
\setlength\textwidth{190.324pt}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage[ngerman]{babel}
\AtBeginDocument{\setlength\parindent{0pt}}
\usepackage[paper=a7,paper=9cm:8cm,pagesize,DIV16]{typearea}
\usepackage[autostyle]{csquotes}
\usepackage[style=verbose-inote,
backend=biber]{biblatex}
\bibliography{examples}
\begin{document}
Aristoteles~\footcite{aristotle:rhetoric},
Aristoteles~\footcite{aristotle:rhetoric},
Nietzsche~\footcite{nietzsche:ksa} und
Nietzsche~\footcite{nietzsche:ksa}
and Aristoteles.%
~\footcite{aristotle:rhetoric}
\ldots
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=119561&type=tex | zentralblatt-math.org | CC-MAIN-2019-47 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-47/segments/1573496669422.96/warc/CC-MAIN-20191118002911-20191118030911-00318.warc.gz | 1,065,458,730 | 1,257 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 1990h.01181}
\itemau{Dzieia, W.; Oberthuer, W.; Zastrow, P. (and others)}
\itemti{Mathematical and physical fundamentals for technical vocations. Mathematische und physikalische Grundlagen fuer technische Berufe.}
\itemso{Duderstadt: EPV Elektronik-Praktiker-Verlagsgesellschaft. 1989. 193 p. Ser. Title: EPV-Elektronik-Fachbuchreihe. [ISBN 3-924544-11-5]}
\itemab
\itemrv{~}
\itemcc{M57 U27}
\itemut{Further Education; Technical Mathematics; Technology; Physics; Technical Mathematics; Textbooks; Arithmetic; Calculators; Solving Equations (Theory); Graphical Representations; Trigonometry; Optics; Mechanics; Thermodynamics; Electrodynamics; Electrical Engineering; ; Weiterbildung; Technische Mathematik; Technik; Physik; Technische Mathematik; Lehrbuch; Arithmetik; Taschenrechner; Gleichungslehre; Graphische Darstellung; Trigonometrie; Optik; Mechanik; Thermodynamik; Elektrodynamik; Elektrotechnik}
\itemli{}
\end |
https://dlmf.nist.gov/18.28.E8.tex | nist.gov | CC-MAIN-2021-43 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-43/segments/1634323587770.37/warc/CC-MAIN-20211025220214-20211026010214-00307.warc.gz | 285,247,610 | 860 | \[\frac{1}{2\pi}\int_{0}^{\pi}Q_{n}\left(\cos\theta;a,b\,|\,q\right)Q_{m}\left(%
\cos\theta;a,b\,|\,q\right)\*{\left|\frac{\left(e^{2i\theta};q\right)_{\infty}%
}{\left(ae^{i\theta},be^{i\theta};q\right)_{\infty}}\right|}^{2}\mathrm{d}%
\theta=\frac{\delta_{n,m}}{\left(q^{n+1},abq^{n};q\right)_{\infty}},\] |
http://ctan.math.utah.edu/ctan/tex-archive/macros/latex/contrib/engtlc/engtlc.tex | utah.edu | CC-MAIN-2020-29 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-29/segments/1593657143365.88/warc/CC-MAIN-20200713100145-20200713130145-00511.warc.gz | 33,958,497 | 9,338 | \documentclass[11pt,a4paper,openany]{book}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage[english]{babel}
\usepackage{amsmath, amssymb}
\usepackage{tabularx}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{listings}
\usepackage{booktabs}
\usepackage{colortbl}
\usepackage{xcolor}
\usepackage{textcomp}
\lstset{language=[LaTeX]TeX,%
basicstyle=\footnotesize\ttfamily}
\usepackage{engtlc}
\usepackage[pdfpagelabels,plainpages=false,colorlinks=true,hyperindex=true]{hyperref}
% Commands for the documentation
\newcommand*{\meta}[1]{{\normalfont\textlangle\textit{#1}\textrangle}}
\newcommand*{\marg}[1]{\texttt{\{\meta{#1}\}}}
\newcommand*{\cs}[1]{\texttt{\char92#1}}
\setlength{\headheight}{14pt}
\begin{document}
\frontmatter
\begin{titlepage}
\title{\begin{huge}\textbf{The \textsf{Engtlc} package}\end{huge}\\[.5cm]
\begin{large}Version 3.2\end{large}}
\author{\begin{LARGE}Claudio Fiandrino \end{LARGE}}
\maketitle
\end{titlepage}
\hypersetup{urlcolor=blue}
\hypersetup{linkcolor=blue}
\pagestyle{fancy}
\renewcommand{\chaptermark}[1]{%
\markboth{\MakeUppercase{%
\chaptername}\ \thechapter.%
\ #1}{}}
\renewcommand{\sectionmark}[1]{\markright{\thesection.\ #1}}
\fancyhead[RO,LE]{\thepage}
\fancyhead[RE]{\leftmark}
\fancyhead[LO]{\rightmark}
\fancyfoot{}
\tableofcontents
\mainmatter
\chapter{Introduction}
This package has been realized in four different periods: in the first one I wrote the macros for measurement units and general symbols; in the second one I extended the units part and I added some other symbols such as the impedance and admittance ones.
In the third version, in which Alessio Sanna gave me precious suggestions, I inserted byte and chip units and the symbols for electrical and magnetic fields. I finished it on 18/12/2009 and on 13/01/2010 it had been published on CTAN.
In that third version there were some mistakes due of my inexperience in \LaTeX\ programming. Thanks to Enrico Gregorio, who send me a list of them, I decided to correct them in a new version and added some new symbol commands.
This fourth version, thanks to Claudio Beccari for the precious help, complies to ISO regulations and introduces \emph{alias} commands in english, as explained in section~\ref{sec:simboli}. Moreover some new commands have been added: probability symbols, commands to define signals in temporal, frequency, discrete and z-transform domain are the major novelties.
The purpose to create \textsf{engtlc} is very simple: it can be used by all those who work in electrical engineering or telecommunication area; indeed, \textsf{engtlc} is the acronym of \emph{Engineering Telecommunications}.
Where does it help?
It helps in writing a document with \LaTeX, of course; in my personal experience I observed that \LaTeX\ code isn't very user friendly when you have to repeat over and over again some words where the code is a little bit different every time.
If you have to write the probability of $x$ you can write the \LaTeX\ code like:
\begin{tabbing}
\hspace{7cm}\=\kill
\begin{lstlisting}
$\mathcal{P}(x)$
\end{lstlisting} \> $\mathcal{P}(x)$
\end{tabbing}
If, after some time, you have to write the probability of the event A:
\begin{tabbing}
\hspace{7cm}\=\kill
\begin{lstlisting}
$\mathcal{P}(\text{A})$
\end{lstlisting} \> $\mathcal{P}(\text{A})$
\end{tabbing}
or you can copy the previous code and change the argument.
With \textsf{engtlc} it is easier; you simply write:
\begin{flushleft}
\texttt{\$\cs{prob}\marg{argument}\$}
\end{flushleft}
where \meta{argument} is the argument you have to put like $x$ or A.
The following chapters are structured in this way:
\begin{itemize}
\item[$\star$] the procedures to install the package and its dependencies are explained in chapter~\ref{chap:installazione};
\item[$\star$] the specific new commands introduced by \textsf{engtlc} are shown in chapter~\ref{chap:comandi}.
\end{itemize}
\chapter{How to install \textsf{engtlc}}
\label{chap:installazione}
If it is not already intalled in your \TeX\ distribution, you can find the package in my website \url{http://claudiofiandrino.altervista.org} within the ``latex projects'' section; alternatively you can download it from the official \LaTeX\ packages website \url{http://tug.ctan.org/tex-archive/macros/latex/contrib/engtlc}.
After downloading the \emph{.zip} file, decompress it and move all the files into the \texttt{~/texmf/tex/latex/engtlc/} in your home directory (if you don't have a personal \texttt{texmf} tree in your home directory, create one). After moving the unzipped files in the aforementioned folder, rembeber to refresh the filename database if your \TeX\ distribution and operating system require it.
The home folder, shown with \texttt{\textasciitilde}, is a normal way of indicating it on Linux platforms. On Macs the \texttt{texmf} personal tree should be rooted in \texttt{\textasciitilde/Library}; on Windows platforms, from Vista and newer releases, the concept of ``home'' is now well known; for previous version you should root your personal \texttt{texmf} tree somewhere such as \texttt{C:\char92Documents and Settings\char92\meta{your username}}.
Remember: This package is dependent on some external packages such as \textsf{textcomp}, \textsf{amsmath}, \textsf{amssymb}. The package does not expressly load them in order to avoid conflicts among different sets of options the user might want to specify. Therefore the user is responsable for loading them with the options s/he likes best. Since these packages are generally loaded by the user for other purposes, this should not be an inconvenience. Anyway, if you do not load
\textsf{amsmath} and \textsf{amssymb}, you will receive an error: this because some commands need this packages. On the contrary, if you do not load \textsf{textcomp}, you will see a warning.
\chapter{Commands introduced by \textsf{engtlc}}\label{chap:comandi}
Let's start to examine \textsf{engtlc} commands.
In the first section several commands for writing units of measurement are shown, while in the second section several new symbol commands are listed.
\section{Units of measurement}
I believe that the possibility of introducing units of measurement in a short and consistent way might be very useful. Of course there are other packages that allow to do the same, but possibly with longer constructs. For example with siunuitx if you have to use ``kbit/s'' you have to type in:
\begin{tabbing}
\hspace{7cm}\= \kill
Code \> Visualization \\
\begin{lstlisting}
\si{\kibi\bit\per\second}
\end{lstlisting} \> \kbits
\end{tabbing}
So I decided to create shorter codes that can replace the longer ones shown above.
\textsf{Engtlc} units of measurement must used only within math environments \texttt{\$ \$}, \texttt{[ ]} or within any kind \emph{equation like} ones.
Be careful: if in your text you use a unit command and forget that the space after a control sequence is absorbed by the control sequence itself, you observe this mistake:
\begin{tabbing}
\hspace{4cm}\= \kill
Code \> Visualization\\
\begin{lstlisting}
8 \cm and
\end{lstlisting} \> 8 \cm and
\end{tabbing}
\subsubsection{Time units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
hours & \cs{ho} & \ho \\
seconds & \cs{s} & \s \\
milliseconds & \cs{ms} & $\ms$ \\
microseconds & \cs{us} & $\us$ \\
nanoseconds & \cs{ns} & $\ns$\\
picoseconds & \cs{ps} & $\ps$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Length units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
micrometres & \cs{um} & $\um$ \\
millimetres & \cs{mm} & $\mm$ \\
centimetres & \cs{cm} & $\cm$ \\
decimetres & \cs{dm} & $\dm$\\
metres & \cs{m} & $\m$\\
kilometres & \cs{km} & $\km$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Current units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
microampere & \cs{uA} & $\uA$ \\
milliampere & \cs{mA} & $\mA$ \\
ampere & \cs{A} & $\A$ \\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Voltage units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
microvolt & \cs{uV} & $\uV$ \\
millivolt & \cs{mV} & $\mV$ \\
volt & \cs{V} & $\V$\\
megavolt & \cs{MV} & $\MV$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Resistance units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
milliohm & \cs{mohm} & $\mohm$ \\
ohm & \cs{ohm} & $\ohm$\\
kilohm & \cs{kohm} & $\kohm$\\
megaohm & \cs{Mohm} & $\Mohm$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Conductance units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
picosiemens & \cs{pSi} & $\pSi$\\
nanosiemens & \cs{nSi} & $\nSi$ \\
microsiemens &\cs{uSi} & $\uSi$ \\
millisiemens & \cs{mSi} & $\mSi$ \\
siemens & \cs{Si} & $\Si$\\
kilosiemens & \cs{kSi} & $\kSi$\\
megasiemens & \cs{MSi} & $\MSi$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Capacity units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
femtofarad & \cs{fFa} & $\fFa$ \\
picofarad & \cs{pFa} & $\pFa$\\
nanofarad & \cs{nFa} & $\nFa$ \\
microfarad & \cs{uFa} & $\uFa$\\
millifarad & \cs{mFa} & $\mFa$ \\
farad & \cs{Fa} & $\Fa$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Inductance units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
femtohenry & \cs{fHe} & $\fHe$ \\
picohenry & \cs{pHe} & $\pHe$\\
nanohenry & \cs{nHe} & $\nHe$ \\
microhenry & \cs{uHe} & $\uHe$\\
millihenry & \cs{mHe} & $\mHe$ \\
henry & \cs{He} & $\He$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Level units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
dB & \cs{dB} & $\dB$ \\
dBm & \cs{dBm} & $\dBm$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Power units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
microwatt & \cs{uW} & $\uW$\\
milliwatt & \cs{mW} & $\mW$ \\
watt & \cs{W} & $\W$\\
kilowatt & \cs{kW} & $\kW$\\
megawatt & \cs{MW} & $\MW$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Frequency units}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
hertz & \cs{Hz} & $\Hz$\\
kilohertz & \cs{kHz} & $\kHz$ \\
megahertz & \cs{MHz} & $\MHz$\\
gigaahertz& \cs{GHz} & $\GHz$\\
terahertz & \cs{THz} & $\THz$\\
\bottomrule
\end{tabular}
\end{center}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsubsection{Bit, byte, and chip units according to the ISO regulations}
\begin{center}
\begin{tabular}{lll}
\toprule
Unit & Equivalent code & Visualization\\
\midrule
bit & \cs{bit} & $\bit$\\
kibibit & \cs{kbit} & $\kbit$ \\
mebibit & \cs{Mbit} & $\Mbit$\\
byte & \cs{Byte} & $\Byte$\\
kibibyte & \cs{kByte} & $\kByte$ \\
mebibyte & \cs{MByte} & $\MByte$\\
gibibyte & \cs{GByte} & $\GByte$ \\
tebibyte & \cs{TByte} & $\TByte$ \\
bit per second & \cs{bits} & $\bits$\\
kibibit per second & \cs{kbits} & $\kbits$ \\
mebibit per second & \cs{Mbits} & $\Mbits$\\
byte per second & \cs{Bytes} & $\Bytes$\\
kibibyte per second & \cs{kBytes} & $\kBytes$ \\
mebibyte per second & \cs{MBytes} & $\MBytes$\\
gibibyte per second & \cs{GBytes} & $\GBytes$\\
tebibyte per second & \cs{TBytes} & $\TBytes$\\
chip per second & \cs{chips} & $\chips$\\
kibichip per second & \cs{kchips} & $\kchips$ \\
mebichip per second & \cs{Mchips} & $\Mchips$\\
chip su bit per second & \cs{chipsubit} & $\chipsubit$\\
\bottomrule
\end{tabular}
\end{center}
\section{Symbols}\label{sec:simboli}
Several symbol macros are listed in this section.
All these macros are supposed to be used only in math mode. Each macro has an English and an Italian contracted name and the examples will show both of them: in the first line there will be the English version and in the second line the Italian one; if only one line is shown, there is no difference between the English and the Italian names.
\subsection{General symbols}
\subsubsection{End of exercise}
The command of end exercise puts a black square flush to the right side of the text block.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{exerend} & $\blacksquare$\\
\cs{finees} & $\blacksquare$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Spaced ``implies'' command}
This command is very similar to \cs{implies}, but it puts before and after the symbol a space that can be chosen by the user by means of an optional argument; by default this space is 0.5\,cm; you can change the unit of measure for the spacing by assigning a value to the length register \cs{Implspace}, for example:
\begin{verbatim}
\setlength{\Implspace}{3mm}
\end{verbatim}
The syntax is therefore:
\begin{flushleft}
\cs{Spimplies}\texttt{[\meta{optional space in units of \normalfont\cs{Implspace}}]}\\
\cs{frecciadex}\texttt{[\meta{optional space in units of \normalfont\cs{Implspace}}]}
\end{flushleft}
In the following table, keeping in mind that \cs{Spimpiles} and \cs{frecciadex} are synonymous, in the first line the optional argument has been used, while in the second line the default spacing has been used, so as to evaluate the difference; in both cases the length register \cs{Implspace} was not reset and contains the value of 0.5\,cm.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\texttt{A\cs{Spimplies[0.3]} B} & $A\Spimplies[0.3]B$ \\
\texttt{A\cs{frecciadex} B} & $A\Spimplies B$ \\
\bottomrule
\end{tabular}
\end{center}
Notice that, by inserting in the optional argument the default length, you will obtain the same result:
\begin{center}
\begin{tabular}{cc}
\toprule
Codice & Visualizzazione\\
\midrule
\texttt{A\cs{Spimplies} B} & $A\Spimplies B$ \\
\texttt{A\cs{frecciadex[0.5]} B} & $A\frecciadex[0.5] B$ \\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Vertical ``implies'' command}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Downimplies} & $\Downarrow$\\
\cs{frecciadown} & $\Downarrow$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{White noise command}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{noisevar} & \noisevar\\[1ex]
\cs{varianzarumore} & \varianzarumore\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Fourier Transform}
Command for the Fourier transform of $x$.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{fourier\{x\}} & \fourier{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Inverse Fourier Transform}
This command is very similar to the previous one.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{invfourier\{x\}} & \invfourier{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Real part}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{bfRe\{x\}} & \partereale{x}\\
\cs{partereale\{x\}} & \partereale{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Imaginary part}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{bfIm\{x\}} & \parteimm{x}\\
\cs{parteimm\{x\}} & \parteimm{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Information element}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Info\{x\}} & \Info{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Signals in different domains}
The following four macros define signal functions, by using as a convention lower case letters for signals in the time domain and for discrete sequences while signals in frequency and $z$-transform domains have automatically the upper case letter.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{signt\{f\}} & \signt{f}\\
\cs{signf\{g\}} & \signf{g}\\
\cs{signn\{h\}} & \signn{h}\\
\cs{signz\{k\}} & \signz{k}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Analytic signal}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{analytic\{x\}} & \analytic{x}\\
\cs{analitic\{x\}} & \analitic{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Unit vector}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{unitvec\{x\}} & \versore{x}\\
\cs{versore\{x\}} & \versore{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Vector}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{vector\{x\}} & \vettore{x}\\
\cs{vettore\{x\}} & \vettore{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Cosine wave of a given frequency}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{cosine\{f\_0\}} & \coseno{f_0}\\
\cs{coseno\{f\_0\}} & \coseno{f_0}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Sine wave of a given frequency}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{sine\{f\_0\}} & \seno{f_0}\\
\cs{seno\{f\_0\}} & \seno{f_0}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Energy}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{energy\{m\}} & \energia{m}\\
\cs{energia\{m\}} & \energia{m}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Module}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Abs\{x\}} & \modulo{x}\\
\cs{modulo\{x\}} & \modulo{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Exponential with ISO compliant natural base}
The ISO regulations require that the base of natural logarithms and of the exponential function be set in roman type.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{rmexp\{x\}} & \rmexp{x}\\
\cs{ex\{x\}} & \ex{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{ISO compliant imaginary unit, engineering style}
Similarly the ISO regulations require the imaginary unit to be typeset in roman type; electrical and telecommunications engineers use the letter ``j'' in order to avoid any possible confusion with the standard current symbol $i$; the roman type avoids also any possible confusion with the standard symbols for the current density~$j$.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{iu\cs{omega}} & $\iu\omega$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Module with exponent}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{AbsPow\{x\}\{2\}} & \moduloexp{x}{2}\\
\cs{moduloexp\{x\}\{2\}} & \moduloexp{x}{2}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Function value for a certain value of the independent variable}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{for\{f(x)\}\{x\_0\}} & \for{f(x)}{x_0}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{A ratio in dB}
A special application of the previous command \cs{for}.
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{indB\{\cs{dfrac}\{C\}\{I\}\}} & $\indB{\dfrac{C}{I}}$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Maximum}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Max\{x\}} & \massimo{x}\\
\cs{massimo\{x\}} & \massimo{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Minimum}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Min\{x\}} & \minimo{x}\\
\cs{minimo\{x\}} & \minimo{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Speed of light}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{clight} & $\valc$\\
\cs{valc} & $\valc$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Logarithm with specified base}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Log\{2\}\{x\}} & \loga{2}{x}\\
\cs{loga\{2\}\{x\}} & \loga{2}{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Integral}
An integral on the whole real domain, from $-\infty$ to $+\infty$:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{infint\{x\cs{diff} x\}} & \intinf{x\diff x}\\[1ex]
\cs{intinf\{x\cs{diff} x\}} & \intinf{x\diff x}\\
\bottomrule
\end{tabular}
\end{center}
Notice the use of the differential sign \cs{diff} that complies with the ISO regulations that require the differential sign be set in roman type with the proper spacings on the left and on the right.
\subsubsection{Dirac's Delta with independent variable}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{deltain\{x\}} & \deltain{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsection{Reflectances}
The reflectance symbols used in electrical and magnetic field theory courses are described; you have two kind of commands, the generic ones, and the specific ones where you can specify the point of measure.
\subsubsection{Generic reflectances}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Vgamma} & \gammatens\\
\cs{gammatens} & \gammatens\\
\cs{Cgamma} & \gammacorr\\
\cs{gammacorr} & \gammacorr\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Specific reflectances}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{Vgammain\{A\}} & \gammatensin{A}\\
\cs{gammatensin\{A\}} & \gammatensin{A}\\
\cs{Cgammain\{A\}} & \gammacorrin{A}\\
\cs{gammacorrin\{A\}} & \gammacorrin{A}\\
\bottomrule
\end{tabular}
\end{center}
Since the voltage reflectance (gamma) is used more often than the current one, it may be input with a shorter command:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{gammain\{A\}} & \gammain{A}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{The Kurokawa reflectance}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{gammak} & \gammak\\
\bottomrule
\end{tabular}
\end{center}
\subsection{Usage examples}
Here are some examples that clearly show the usefulness of \textsf{engtlc}:
\begin{enumerate}
\item \begin{tabbing}
\hspace{7cm}\=\kill
Code \> Visualization\\
\cs{AbsPow\{\cs{gammak}\}\{2\}} \> \AbsPow{\gammak}{2}
\end{tabbing}
\item \begin{tabbing}
\hspace{9cm}\=\kill
Code \> Visualization \\
\cs{bfRe\{\cs{fourier}\{\cs{AbsPow}\{x\}\{2\}\}\}} \> $\bfRe{\fourier{\AbsPow{x}{2}}}$
\end{tabbing}
The standard code to write the above expression is:
\begin{lstlisting}
$\textbf{Re}\left\lbrace \mathcal{F}\left\lbrace
\left\vert x \right\vert^{2} \right\rbrace \right\rbrace$
\end{lstlisting}
\end{enumerate}
\subsection{Wave length symbols}
There are three different types of symbols:
\subsubsection{In the open space}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{lbvt} & $\lbvt$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{In a guide filled with generic dielectric}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{lbg} & $\lbg$\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{In an empty guide }
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{lbgvt} & $\lbgvt$\\
\bottomrule
\end{tabular}
\end{center}
\subsection{Impedance and admittance symbols}
With \textsf{engtlc} you can also write any kind of impedance and admittance.
\subsubsection{Generic impedance and admittance}
To input an impedance or admittance at a specific port or line section~A use:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{z\{A\}} & \z{A}\\
\cs{y\{A\}} & \y{A}\\
\bottomrule
\end{tabular}
\end{center}
To input a normalized impedance or admittance at a specific port or line section~A use:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{znorm\{A\}} & \znorm{A}\\
\cs{ynorm\{A\}} & \ynorm{A}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Characteristic impedance and admittance}
To input the symbol for characteristic impedance or admittance use:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{zinf} & \zinf\\
\cs{yinf} & \yinf\\
\bottomrule
\end{tabular}
\end{center}
In a guide there are several mode dependent characteristic impendances: you may use another command in order to distinguish them; for example if you want to label with~2 a second impedance you may use:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{zinf[2]} & \zinf[2]\\
\cs{zinfn\{2\}} & \zinfn{2}\\
\cs{yinf[2]} & \yinf[2]\\
\cs{yinfn\{2\}} & \yinfn{2}\\
\bottomrule
\end{tabular}
\end{center}
To avoid confusion pay attention when you input a numbered impedance and you use the \cs{zinf} or \cs{yinf} commands: you must use either the optional argument command or the n-extended command:
\begin{tabbing}
\hspace{7cm}\=\kill
Impedance with optional argument \> Visualization \\
\cs{zinf[2]} \> \zinf[2] \\
n-extended impedance Code \> Visualization \\
\cs{zinfn\{2\}} \> \zinfn{2} \\
Generic impedance Code \> Visualization \\
\cs{zinf\{2\}} \> \zinf{2}
\end{tabbing}
The last code is not wrong under the \LaTeX\ point of view, but probably the output is not the expected one\dots
The open space impedance and admittance is input by means of:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{zvt} & \zvt\\
\cs{yvt} & \yvt\\
\bottomrule
\end{tabular}
\end{center}
\subsection{Some more usage examples}
\noindent With \textsf{engtlc} commands the available power can be written with the code:
\begin{verbatim}
\[\availpow=\frac{\AbsPow{V}{2}}{\bfRe{4\cdot\z{G}}}\]
\end{verbatim}
that yields:
\[ \availpow=\frac{\AbsPow{V}{2}}{4\cdot \bfRe{\z{G}}} \]
Without the \textsf{engtlc} commands the code would be:
\begin{verbatim}
\[P_{\mathrm{disp}}=\frac{\left| V \right|^2}%
{ 4\cdot\textbf{Re}\left\{ Z_\mathrm{G}\right\}}\]
\end{verbatim}
\subsection{Power symbols}
Here we have the commands to input power symbols; the following commands may be used in both text and math modes.
\subsubsection{Power into a port}
To write the power entering into a specific port or line\slash guide section~A use:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{powerin\{A\}} & \powerin{A}\\
\cs{potin\{A\}} & \potin{A}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Available Power}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{availpow} & \potdisp\\
\cs{potdisp} & \potdisp\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Power supply}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{potDC} & \potDC\\
\cs{potCC} & \potCC\\
\bottomrule
\end{tabular}
\end{center}
For compatibility reasons, there is also the possibility of exploit \cs{potalim} the old name for the symbol.
\subsubsection{Radiation Power}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{irrpow} & \potirr\\
\cs{potirr} & \potirr\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Dissipated Power}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{disspow} & \potdiss\\
\cs{potdiss} & \potdiss\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Incident power}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{incpow} & \potinc\\
\cs{potinc} & \potinc\\
\bottomrule
\end{tabular}
\end{center}
Pay attention that, in this version, all shortcuts describing power symbols, a part from the first one \cs{powerin\{A\}}, have an optional argument: it is used to indicate explicitly the point in which you can measure the power. To describe, for example, the dissipated power for a general transmitting device, you should use \cs{disspow[tx]} which give as a result $\disspow[tx]$. Be careful: if you put \{ \} instead of [ ] you obtain a different, undesired result. Indeed, \cs{irrpow\{rx\}} becomes $\irrpow{rx}$.
\subsection{Electrical and magnetic field symbols}
With regards to electrical and magnetic fields, \textsf{engtlc} commands are not so well established, as they depend on every particular school, whether they are typeset or handwritten, etcetera. For informal handouts the underlined vector convention is often used. We distinguish:
\begin{itemize}
\item[$\star$] electric and magnetic field as a function of a vector position \vector{r} and time;
\item[$\star$] electric and magnetic field phasors as a function of a vector position~\vector{r}.
\end{itemize}
In several electric and magnetic fields courses in order to denote $A$ as a vector, instead of using arrows ``accents'' or bold symbols, the convention $\underline{A}$ is used:
\begin{center}
\begin{tabular}{lc@{\qquad}lr}
\toprule
\multicolumn2{c@{\qquad}}{Time dependent fields}&
\multicolumn2c{Field phasors} \\
%\midrule
Code & Visualization & Code & \makebox[3em][r]{Visualization} \\
\midrule
\cs{Efield} & \campoe & \cs{phasorEfield} & \campoefas \\
\cs{campoe} & \campoe & \cs{campoefas} & \campoefas \\
\cs{Hfield} & \campoh & \cs{phasorHfield} & \campohfas \\
\cs{campoh} & \campoh & \cs{campohfas} & \campohfas \\
\bottomrule
\end{tabular}
\end{center}
Pay attention: we distinguish the symbols of energy \cs{energy\marg{argument}} and electric field \cs{campoe} because the second one is a vector and it does not have subscript symbols.
\subsection{Probability symbols}
\subsubsection{Probability}
The probability of event A, or of variable $x$, is input as:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{prob\{\cs{text}\{A\}\}} & \prob{\text{A}}\\
\cs{prob\{x\}} & \prob{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Expected value}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{expval\{x\}} & \expval{x}\\
\cs{valatt\{x\}} & \valatt{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Variance}
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{var\{x\}} & \var{x}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Joint probability}
This macro inserts a well separated comma between two stochastic variables:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{comma} & \prob{x\comma y}\\
\bottomrule
\end{tabular}
\end{center}
\subsubsection{Conditional probability}
These macros insert a vertical bar separator between two stochastic variables:
\begin{center}
\begin{tabular}{cc}
\toprule
Code & Visualization\\
\midrule
\cs{given} & \prob{x\given y}\\
\cs{dato} & \prob{x\dato y}\\
\bottomrule
\end{tabular}
\end{center}
\section*{Aknowledgements}
I wish to thank prof.~Enrico Gregorio, who very kindly sent me a complete list of errors in my third package edition and documentation.
I wish to thank also prof.~Claudio Beccari for many useful suggestions and the adaptation of several commands to the ISO regulations.
\chapter{LPPL Licence}
\textsf{engtlc} is distributed under LPPL Licence: \LaTeX\, Project Public Licence.
\begin{footnotesize}
\begin{verbatim}
%% engtlc.sty
%% Copyright 2010-2012 Claudio Fiandrino
%
% This work 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.
% The latest version of this license is in
% http://www.latex-project.org/lppl.txt
% and version 1.3 or later is part of all distributions of LaTeX
% version 2005/12/01 or later.
%
% This work has the LPPL maintenance status `maintained'.
%
% The Current Maintainer of this work is Fiandrino Claudio.
%
% This work consists of the file engtlc.sty.
\end{verbatim}
\end{footnotesize}
\end{document}
|
https://wiki.horde.org/Doc/Dev/Help?actionID=export&format=tex | horde.org | CC-MAIN-2021-39 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-39/segments/1631780057371.69/warc/CC-MAIN-20210922163121-20210922193121-00025.warc.gz | 677,220,278 | 1,994 | \documentclass{article}
\usepackage{ulem}
\pagestyle{headings}
\begin{document}
\part{Help File Format}
\tableofcontents
Help File FormatHelp File LocationHelp File TranslationHelp File Format
This document is intended to help developers create/edit an application's help file.
\section{Help File Location}
The help file is located in an application's locale directory at this location:
\begin{verbatim}
locale/xx_XX/help.xml
\end{verbatim}
Where xx\_XX is the locale (country and language code), e.g. en\_GB or es\_ES.
The master help file is in English and is located at:
\begin{verbatim}
locale/en/help.xml
\end{verbatim}
Any help entry additions \textbf{MUST} be made in the master English help file. These changes will be propagated to the translated help files through the translation build process.
\section{Help File Translation}
See Doc/Dev/Translation.
\section{Help File Format}
The help file has the following format:
\begin{verbatim}
<?xml version='1.0'?>
<help>
<entry id="[id]">
<title>Title</title>
[Entry content (see below)]
</entry>
...
<view id="[view]">
<entry>
...
</entry>
...
</view>
</help>
\end{verbatim}
Help structure tags are as follows:
\begin{tabular}{|l|l|}
\hline
Tag & Description\\
\hline
help & Defines the help data. All other tags must live under this tag.\\
\hline
entry & Defines a help entry. The 'id' attribute is a unique (by application) identifier to this entry. Entries living directly under <help> are shown in all views.\\
\hline
title & The title of the entry. Displayed in the help topics tree to allow a user to quickly browse for the entry.\\
\hline
view & Defines entries only shown in this view. Children are <entry> elements. The 'id' attribute identifies the view in which to show these entries (currently: \texttt{basic} and \texttt{dynamic}).\\
\hline
\end{tabular}
Each <entry> tag can have one or more of the following:
\begin{tabular}{|l|l|}
\hline
Tag & Description\\
\hline
para & A paragraph block.\\
\hline
raw & A raw block. Content will be displayed in fixed format.\\
\hline
tip & Tip block. Used to identify the containing text as tip (i.e. useful instructions; UI shortcuts) content.\\
\hline
warn & Warning block. Used to identify the containing text as warning (i.e. potential issues; dangerous behavior) content.\\
\hline
\end{tabular}
Each <entry> block can be formatted with the following tags:
\begin{tabular}{|l|l|}
\hline
Tag & Description\\
\hline
b & Strong formatting of text. This tag can contain additional formatting tags in its content.\\
\hline
css & Outputs containing data in a CSS class. The 'class' atrribute contains the CSS class name. This tag can contain additional formatting tags in its content.\\
\hline
eref & Create URL link. The 'url' attribute contains the URL to link to.\\
\hline
i & Emphasis formatting of text. This tag can contain additional formatting tags in its content.\\
\hline
pre & Preformatted formatting of text. This tag can contain additional formatting tags in its content.\\
\hline
ref & Reference to another Help entry. The 'module' attribute should be the application id. The 'topic' attribute should be the id attribute of the entry to link to.\\
\hline
text & Raw text contained in this node (sub-tags are ignored).\\
\hline
\end{tabular}
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=33676&type=tex | zentralblatt-math.org | CC-MAIN-2019-35 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-35/segments/1566027315174.57/warc/CC-MAIN-20190820003509-20190820025509-00218.warc.gz | 1,052,842,006 | 1,038 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2015d.00043}
\itemau{Kaput, James J. (ed.); Carraher, David W. (ed.); Blanton, Maria L. (ed.)}
\itemti{Algebra in the early grades.}
\itemso{Studies in Mathematical Thinking and Learning Series. London: Routledge (ISBN 978-0-8058-5472-5/hbk; 978-0-8058-5473-2/pbk). xxi, 526~p. (2008).}
\itemab
The articles of this volume will be reviewed individually in MathEduc.
\itemrv{~}
\itemcc{A60 H10}
\itemut{}
\itemli{}
\end |
http://porocila.imfm.si/2018/rac/clani/zitnik.tex | imfm.si | CC-MAIN-2020-34 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-34/segments/1596439738777.54/warc/CC-MAIN-20200811115957-20200811145957-00321.warc.gz | 87,805,757 | 2,332 | \clan {Arjana Žitnik}
%--------------------------------------------------------
% A. objavljene znanstvene monografije
%--------------------------------------------------------
%\begin{skupina}{A}
%\disertacija
% {NASLOV}
% {UNIVERZA}
% {FAKULTETA}
% {ODDELEK}
% {KRAJ} {DRZAVA} {LETO}
%\magisterij
% {NASLOV}
% {UNIVERZA}
% {FAKULTETA}
% {ODDELEK}
% {KRAJ} {DRZAVA} {LETO}
%\monografija
% {AVTORJI}
% {NASLOV}
% {ZALOZBA}
% {KRAJ} {DRZAVA} {LETO}
%\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% B. raziskovalni clanki sprejeti v objavo v znanstvenih
% revijah in v zbornikih konferenc
%--------------------------------------------------------
%\begin{skupina}{B}
%\sprejetoRevija
% {AVTORJI}
% {NASLOV}
% {REVIJA}
%\sprejetoZbornik
% {AVTORJI}
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
\begin{skupina}{B}
\sprejetoRevija
{P.~Terwilliger, \crta}
{The quantum adjacency algebra and subconstituent algebra of a graph}
{J. Combin.\ Theory Ser.\ A}
\end{skupina}
%--------------------------------------------------------
% C. raziskovalni clanki objavljeni v znanstvenih revijah
% in v zbornikih konferenc
%--------------------------------------------------------
\begin{skupina}{C}
%\objavljenoRevija
% {AVTORJI}
% {NASLOV}
% {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\objavljenoZbornik
% {AVTORJI}
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
% {ZBORNIK} {STRANI}
\objavljenoRevija
% 1. J.~Bokowski, J.~Kovič, T.~Pisanski, A.~Žitnik. Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces. Ars Math.\ Contemp. [Tiskana izd.]. 2018, vol. 14, no. 1, str. 97-116. ISSN 1855-3966. https://amc-journal.eu/index.php/amc/article/download/1109/1112. [COBISS.SI-ID 18064473]
{J.~Bokowski, J.~Kovič, T.~Pisanski, \crta}
{Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces}
{Ars Math.\ Contemp.} {14} {2018} {} {97--1{1}6}
\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% D. urednistvo v znanstvenih revijah in zbornikih
% znanstvenih konferenc
%--------------------------------------------------------
\begin{skupina}{D}
%\urednikRevija
% {OPIS}
% {REVIJA}
%\urednikZbornik
% {OPIS}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
\urednikRevija
% 3. Ars Math.\ Contemp. A.~Žitnik (član uredniškega odbora 2018-, tehnični urednik 2016-). [Tiskana izd.]. Ljubljana: Društvo matematikov, fizikov in astronomov, 2008-. ISSN 1855-3966. https://amc-journal.eu/index.php/amc/issue/archive, http://amc.imfm.si/index.php/amc. [COBISS.SI-ID 239049984]
{Članica uredniškega odbora}
{Ars Mathematica Contemporanea}
\urednikRevija
% 2. Art Dis.\ Appl.\ Math.. A.~Žitnik (član uredniškega odbora 2018-). Koper: Fakulteta za matematiko, naravoslovje in informacijske tehnologije, 2018-. ISSN 2590-9770. https://adam-journal.eu/index.php/ADAM/index. [COBISS.SI-ID 290758912]
{Članica uredniškega odbora}
{The Art of Discrete and Applied Mathematics}
\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% E. organizacija mednarodnih in domacih znanstvenih
% srecanj
%--------------------------------------------------------
%\begin{skupina}{E}
%\organizacija
% {OPIS}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% F. vabljena predavanja na tujih ustanovah in
% mednarodnih konferencah
%--------------------------------------------------------
%\begin{skupina}{F}
%\predavanjeUstanova
% {NASLOV}
% {OPIS}
% {USTANOVA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\predavanjeKonferenca
% {NASLOV}
% {OPIS}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% G. aktivne udelezbe na mednarodnih in domacih
% konferencah
%--------------------------------------------------------
%\begin{skupina}{G}
%\konferenca
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
\begin{skupina}{G}
\konferenca
{Chiral astral realizations of cyclic 3-configurations}
{International Workshop on Symmetries of Graphs and Networks}
{Sanya} {Kitajska} {januar/februar} {2018}
\end{skupina}
%--------------------------------------------------------
% H. strokovni clanki
%--------------------------------------------------------
%\begin{skupina}{H}
%\clanekRevija
% {AVTORJI}
% {NASLOV}
% {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\clanekZbornik
% {AVTORJI}
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
% {ZBORNIK} {STRANI}
%\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% I. razno
%--------------------------------------------------------
\begin{skupina}{I}
%\razno
% {OPIS}
\razno
% Mentor pri diplomskih delih (bolonjski študij 1. stopnje)
% 4. MARANCINA, Sabina. Kriptografija na osnovi kodiranja : diplomsko delo : interdisciplinarni univerzitetni študijski program prve stopnje Računalništvo in matematika. Ljubljana: [S. Marancina], 2018. 70 str. http://eprints.fri.uni-lj.si/4246/. [COBISS.SI-ID 1537967811]
% 5. GERŠAK, Jan. Povečanje povezavne povezanosti grafa : diplomsko delo : interdisciplinarni univerzitetni študijski program prve stopnje Računalništvo in matematika. Ljubljana: [J. Geršak], 2018. 53 str., ilustr. http://eprints.fri.uni-lj.si/4245/. [COBISS.SI-ID 1537969091]
{Mentorstvo pri 2 diplomskih delih}
\end{skupina}
% Ni podatkov za to sekcijo
%--------------------------------------------------------
% tuji gosti
%--------------------------------------------------------
%\begin{seznam}
%\gost {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO} {POVABILO}
%\end{seznam}
%--------------------------------------------------------
% gostovanja
%--------------------------------------------------------
%\begin{seznam}
%\gostovanje {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{seznam}
|
https://www.cds.caltech.edu/~murray/amwiki/extensions/wikitex/tmp/18b7a398c03a0a19447ace26632689a3 | caltech.edu | CC-MAIN-2020-05 | unk | application/x-tex | crawl-data/CC-MAIN-2020-05/segments/1579251776516.99/warc/CC-MAIN-20200128060946-20200128090946-00356.warc.gz | 789,975,044 | 780 | \documentclass[12pt]{article}
\usepackage{amssymb,amsmath,amscd,concmath,amsfonts}
\usepackage{color}
\pagestyle{empty}
\begin{document}
\begin{equation*}dGyr/dC\end{equation*}
\end{document}
|
https://git.bettercrypto.org/ach-master.git/blob_plain/05049065b50211c614c41ab100970b3b62ddb766:/src/practical_settings/ssh.tex | bettercrypto.org | CC-MAIN-2021-43 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2021-43/segments/1634323587915.41/warc/CC-MAIN-20211026165817-20211026195817-00538.warc.gz | 409,022,796 | 2,274 | %%----------------------------------------------------------------------
\subsection{OpenSSH}
\subsubsection{Tested with Version} OpenSSH 6.1
\subsubsection{Settings}
\paragraph*{sshd\_config}
\begin{lstlisting}[breaklines]
# ...
Protocol 2
PermitEmptyPasswords no
PermitRootLogin no
StrictModes yes
HostKey /etc/ssh/ssh_host_rsa_key
ServerKeyBits 4096
Ciphers [email protected] [email protected] aes256-ctr aes128-ctr
MACs [email protected],hmac-sha2-512,hmac-sha2-256,hmac-ripemd160
KexAlgorithms [email protected],diffie-hellman-group-exchange-sha256,diffie-hellman-group14-sha1,diffie-hellman-group-exchange-sha1
\end{lstlisting}
\textbf{Note:} Older Linux systems won't support SHA2. PuTTY (Windows) does not support
RIPE-MD160. Curve25519, AES-GCM and UMAC are only available upstream (OpenSSH
6.1). DSA host keys have been removed on purpose, the DSS standard does not
support for DSA keys stronger than 1024bit
\footnote{\url{https://bugzilla.mindrot.org/show_bug.cgi?id=1647}} which is far
below current standards (see section \ref{section:keylengths}). Legacy systems
can use this configuration and simply omit unsupported ciphers, key exchange
algorithms and MACs.
\subsubsection{Additional settings}
The setting \texttt{ServerKeyBits 4096} has no effect until you re-generate new ssh host keys. There might be issues if you have users which rely on the fingerprint of the old ssh host key being stored in their clients' \texttt{.ssh/known\_hosts} file.
%\subsubsection{Justification for special settings (if needed)}
\subsubsection{References}
The openssh sshd\_config man page is the best reference: \url{http://www.openssh.org/cgi-bin/man.cgi?query=sshd_config}
\subsubsection{How to test}
Connect a client with verbose logging enabled to the SSH server \\
\begin{lstlisting}[breaklines]
$ ssh -vvv myserver.com
\end{lstlisting}and observe the key exchange in the output.
%%----------------------------------------------------------------------
\subsection{Cisco ASA}
\subsubsection{Tested with Version} 9.1(3)
\subsubsection{Settings}
\begin{lstlisting}[breaklines]
crypto key generate rsa modulus 2048
ssh version 2
ssh key-exchange group dh-group14-sha1
line vty 0 4
transport input ssh
\end{lstlisting}
Note: When the ASA is configured for SSH, by default both SSH versions 1 and 2 are allowed. In addition to that, only a group1 DH-key-exchange is used. This should be changed to allow only SSH version 2 and to use a key-exchange with group14. The generated RSA key should be 2048 bit (the actual supported maximum). A non-cryptographic best practice is to reconfigure the lines to only allow SSH-logins.
\subsubsection{References}
\url{http://www.cisco.com/en/US/docs/security/asa/asa91/configuration/general/admin\_management.html }
\subsubsection{How to test}
Connect a client with verbose logging enabled to the SSH server \\
\begin{lstlisting}[breaklines]
$ ssh -vvv myserver.com
\end{lstlisting}and observe the key exchange in the output.
%----------------------------------------------------------------------
\subsection{Cisco IOS}
\subsubsection{Tested with Version} 15.0, 15.1, 15.2
\subsubsection{Settings}
\begin{lstlisting}[breaklines]
crypto key generate rsa modulus 2048 label SSH-KEYS
ip ssh rsa keypair-name SSH-KEYS
ip ssh version 2
ip ssh dh min size 2048
\end{lstlisting}
Note: Same as with the ASA, also on IOS by default both SSH versions 1 and 2 are allowed and the DH-key-exchange only use a DH-group of 768 Bit.
In IOS, a dedicated Key-pair can be bound to SSH to reduce the usage of individual keys-pairs.
\subsubsection{References}
\url{http://www.cisco.com/en/US/docs/ios/sec\_user\_services/configuration/guide/sec\_secure\_shell\_v2.html }
% add any further references or best practice documents here
\subsubsection{How to test}
Connect a client with verbose logging enabled to the SSH server \\
\begin{lstlisting}[breaklines]
$ ssh -vvv myserver.com
\end{lstlisting}and observe the key exchange in the output.
|
https://www.math.bgu.ac.il/he/teaching/fall2019/courses/introduction-to-probability-and-statistics-a.tex | bgu.ac.il | CC-MAIN-2022-27 | text/tex | application/x-tex | crawl-data/CC-MAIN-2022-27/segments/1656104244535.68/warc/CC-MAIN-20220703134535-20220703164535-00181.warc.gz | 928,957,361 | 2,401 | \documentclass[oneside,final,11pt]{article}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}
\usepackage{fancyhdr}
\addtolength{\headheight}{5\baselineskip}
\renewcommand{\headrulewidth}{0pt}
\fancyhead[L,R]{}
\fancyhead[C]{\includegraphics[scale=0.5]{bguhead.png}}
\fancyfoot[L,C,R]{}
\addtolength{\voffset}{-70pt}
\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}
\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{hebrew}
\setotherlanguage{english}
\setmainfont[Script=Hebrew,Ligatures=TeX]{Libertinus Serif}
\newfontfamily{\hebrewfonttt}{Libertinus Serif}
\SepMark{.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal
% vim: ft=eruby.tex:
\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}
\pagestyle{fancy}
\begin{center}
\huge{המחלקה למתמטיקה}\\[0.1\baselineskip]
\Large{סמסטר 19--2018--א}\\[0.2\baselineskip]
\end{center}
\begin{description}
\item[שם הקורס]
מבוא להסתברת וסטטיסטיקה א
\item[מספר קורס]
\LRE{201.1.9091}
\item[עמוד הקורס ברשת]\mbox{}\\
\url{https://www.math.bgu.ac.il//he/teaching/fall2019/courses/introduction-to-probability-and-statistics-a}
\item[מרצה אחראי]
ד``ר לובה ספיר,
\nolinkurl{<[email protected]>},
חדר 109-
\item[שעות קבלה]
\url{https://www.math.bgu.ac.il/he/teaching/hours}
\end{description}
\section*{תקציר}
\section*{דרישות והרכב ציון הקורס\footnote{דרישות הקורס יכולות להשתנות במהלך השבועיים הראשונים של הסמסטר, ויש לשים לב להודעות באתר הקורס}}
\section*{נושאי לימוד}
1) מרחב ההסתברות2) הסתברות מותנית, אי-תלות מאורעות, נוסחת ההסתברות השלמה, נוסחת בייס.3) משתנה מקרי בדיד. התפלגויות בדידות: אחידה, בינומית, גיאומטרית, היפרגאומטרית, בינומית שלילית, פואסון.4) משתנה מקרי רציף. התפלגויות רציפות: אחידה, מעריכית, נורמלית.5) משתנה מקרי דו-מימדי בדיד, אי-תלות של משתנים מקריים.6) תוחלת, שונות, מקדם המתאם.7) אי-שייון צ`בישב, חוק המספרים הגדולים.8) משפט הגבול המרכזי, קירוב נורמלי.
% vim: ft=eruby.tex:
\end{document}
% vim: ft=eruby.tex:
|
https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/22-01-21.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656104512702.80/warc/CC-MAIN-20220705022909-20220705052909-00403.warc.gz | 246,310,168 | 1,381 | %%
%% Ein Beispiel der DANTE-Edition
%%
%% 7. Auflage
%%
%% Beispiel 22-01-21 auf Seite 366.
%%
%% 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{193.16928pt}
\setlength\parindent{0pt}
\usepackage{pst-3d}
\makeatletter
\def\xyEbene#1{%
\ThreeDput[normal=0 0 1](0,0,0){% xy-Ebene
\psgrid(0,0)(#1,#1)%
\psline{->}(0,0)(0,#1) \psline{->}(0,0)(#1,0)
\ifdim\psk@gridlabels pt>\z@
\uput[180]{0.2}(0,#1){$y$} \uput[-90]{0.2}(#1,0){$x$}%
\fi
}}
\def\xzEbene#1{%
\ThreeDput[normal=0 -1 0](0,0,0){% xz-Ebene
\psgrid(0,0)(#1,#1)%
\psline{->}(0,0)(0,5) \psline{->}(0,0)(#1,0)
\ifdim\psk@gridlabels pt>\z@
\uput[180]{0.2}(0,#1){$z$} \uput[-90]{0.2}(#1,0){$x$}%
\fi
}}
\def\yzEbene#1{%
\ThreeDput[normal=1 0 0](0,0,0){% yz-Ebene
\psgrid(0,0)(#1,#1)%
\psline{->}(0,0)(0,#1) \psline{->}(0,0)(#1,0)
\ifdim\psk@gridlabels pt>\z@
\uput[180]{0.2}(0,#1){$z$} \uput[-90]{0.2}(#1,0){$y$}%
\fi
}}
%
\def\DreiDKOSystem{\@ifnextchar[{\DreiDKOSystem@i}{\DreiDKOSystem@i[]}}
\def\DreiDKOSystem@i[#1]#2{{%
\psset{#1}%
\xyEbene{#2}\xzEbene{#2}\yzEbene{#2}}}
\makeatother
%StartShownPreambleCommands
\usepackage{pst-3d,multido}
%StopShownPreambleCommands
\begin{document}
\begin{pspicture}(-3,-1.75)(3,4)
\psset{unit=0.75,viewpoint=1 1 0.5}
\DreiDKOSystem[subgriddiv=0,gridcolor=black!40]{5}
\end{pspicture}\hfill
\begin{pspicture}(-3,-1.75)(2.2,3.5)
\psset{unit=0.75,viewpoint=1 1.5 0.5,gridlabels=6pt}
\DreiDKOSystem[subgriddiv=0,gridcolor=black!40]{5}
\end{pspicture}
\end{document}
|
http://build.openvpn.net/doxygen/latex/lladdr_8c.tex | openvpn.net | CC-MAIN-2018-13 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2018-13/segments/1521257645830.10/warc/CC-MAIN-20180318165408-20180318185408-00579.warc.gz | 47,896,167 | 1,198 | \hypertarget{lladdr_8c}{}\subsection{/root/openvpn/src/openvpn/lladdr.c File Reference}
\label{lladdr_8c}\index{/root/openvpn/src/openvpn/lladdr.\+c@{/root/openvpn/src/openvpn/lladdr.\+c}}
{\ttfamily \#include \char`\"{}syshead.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}error.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}misc.\+h\char`\"{}}\newline
Include dependency graph for lladdr.\+c\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{lladdr_8c__incl}
\end{center}
\end{figure}
\subsubsection*{Functions}
\begin{DoxyCompactItemize}
\item
int \hyperlink{lladdr_8c_ab5b26563cdb293fa660ba5697832cfd6}{set\+\_\+lladdr} (const char $\ast$ifname, const char $\ast$lladdr, const struct \hyperlink{structenv__set}{env\+\_\+set} $\ast$es)
\end{DoxyCompactItemize}
\subsubsection{Function Documentation}
\mbox{\Hypertarget{lladdr_8c_ab5b26563cdb293fa660ba5697832cfd6}\label{lladdr_8c_ab5b26563cdb293fa660ba5697832cfd6}}
\index{lladdr.\+c@{lladdr.\+c}!set\+\_\+lladdr@{set\+\_\+lladdr}}
\index{set\+\_\+lladdr@{set\+\_\+lladdr}!lladdr.\+c@{lladdr.\+c}}
\paragraph{\texorpdfstring{set\+\_\+lladdr()}{set\_lladdr()}}
{\footnotesize\ttfamily int set\+\_\+lladdr (\begin{DoxyParamCaption}\item[{const char $\ast$}]{ifname, }\item[{const char $\ast$}]{lladdr, }\item[{const struct \hyperlink{structenv__set}{env\+\_\+set} $\ast$}]{es }\end{DoxyParamCaption})}
Definition at line 16 of file lladdr.\+c.
References argv\+\_\+msg(), argv\+\_\+new(), argv\+\_\+printf(), argv\+\_\+reset(), M\+\_\+\+I\+N\+FO, M\+\_\+\+W\+A\+RN, msg, and openvpn\+\_\+execve\+\_\+check().
Referenced by do\+\_\+open\+\_\+tun(), and do\+\_\+persist\+\_\+tuntap().
|
http://dlmf.nist.gov/35.6.E10.tex | nist.gov | CC-MAIN-2014-10 | application/x-tex | null | crawl-data/CC-MAIN-2014-10/segments/1394011473737/warc/CC-MAIN-20140305092433-00008-ip-10-183-142-35.ec2.internal.warc.gz | 50,520,779 | 647 | \[\lim_{{a\to\infty}}\mathop{\Gamma_{{m}}\/}\nolimits\!\left(a\right)\mathop{%
\Psi\/}\nolimits\!\left(a+\nu;\nu+\tfrac{1}{2}(m+1);a^{{-1}}\mathbf{T}\right)=%
\mathop{B_{{\nu}}\/}\nolimits\!\left(\mathbf{T}\right).\] |
https://docs.netgate.com/pfsense/en/latest/_downloads/0350e7195987521e6b6803fb1d87293e/libunistring_GFDL | netgate.com | CC-MAIN-2022-49 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2022-49/segments/1669446711552.8/warc/CC-MAIN-20221209213503-20221210003503-00642.warc.gz | 251,802,583 | 11,960 | \input texinfo @c -*-texinfo-*-
@comment %**start of header
@setfilename libunistring.info
@documentencoding UTF-8
@settitle GNU libunistring
@finalout
@c Indices:
@c am = autoconf macro @amindex
@c cp = concept @cindex
@c fn = function @findex
@c tp = type @tindex
@c Unused predefined indices:
@c ky = keystroke @kindex
@c pg = program @pindex
@c vr = variable @vindex
@defcodeindex am
@syncodeindex am cp
@syncodeindex fn cp
@syncodeindex tp cp
@ifclear texi2html
@firstparagraphindent insert
@end ifclear
@c texi2html-1.76 does not support @arrow{}.
@ifset texi2html
@macro arrow{}
→
@end macro
@end ifset
@comment %**end of header
@include version.texi
@c Location of the POSIX specification on the web.
@set POSIXURL http://pubs.opengroup.org/onlinepubs/9699919799
@c Macro for referencing a POSIX header.
@ifinfo
@macro posixheader{header}
@code{<\header\>}
@end macro
@end ifinfo
@ifnotinfo
@macro posixheader{header}
@uref{@value{POSIXURL}/basedefs/\header\.html,,@code{<\header\>}}
@end macro
@end ifnotinfo
@c Macro for referencing a POSIX function.
@c We don't write it as func(), see section "GNU Manuals" of the
@c GNU coding standards.
@ifinfo
@macro posixfunc{func}
@code{\func\}
@end macro
@end ifinfo
@ifnotinfo
@macro posixfunc{func}
@uref{@value{POSIXURL}/functions/\func\.html,,@code{\func\}}
@end macro
@end ifnotinfo
@c Macro for referencing a normal function.
@c We don't write it as func(), see section "GNU Manuals" of the
@c GNU coding standards.
@macro func{func}
@code{\func\}
@end macro
@c Macro for an advisory ragged line break in TeX mode.
@c Needed because there are long unbreakable pieces of text (such as URLs or
@c formulas), TeX is too shy to move them to a new line. TeX considers only
@c two choices: a line break in aligned mode (which it rejects due to aesthetic
@c reasons) and writing into the margin. What we want in many cases is a line
@c break without filling the first line. Like what @* delivers. But we want it
@c only when needed, so that it disappears when unrelated changes in the same
@c paragraph cause a line break in a nearby position. And we need it only in
@c TeX mode. info and HTML modes are fine.
@c This trick is from Karl Berry.
@iftex
@macro texnl
@hfil@penalty9000@hfilneg
@end macro
@end iftex
@ifnottex
@macro texnl
@end macro
@end ifnottex
@ifinfo
@dircategory Software development
@direntry
* GNU libunistring: (libunistring). Unicode string library.
@end direntry
@end ifinfo
@ifinfo
This manual is for GNU libunistring.
@ignore
@c This was: @copying but it triggers a makeinfo 4.13 bug
Copyright (C) 2001-2018 Free Software Foundation, Inc.
This manual is free documentation. It is dually licensed under the
GNU FDL and the GNU GPL. This means that you can redistribute this
manual under either of these two licenses, at your choice.
This manual is covered by the GNU FDL. Permission is granted to copy,
distribute and/or modify this document under the terms of the
GNU Free Documentation License (FDL), either version 1.2 of the
License, or (at your option) any later version published by the
Free Software Foundation (FSF); with no Invariant Sections, with no
Front-Cover Text, and with no Back-Cover Texts.
A copy of the license is included in @ref{GNU FDL}.
This manual is covered by the GNU GPL. You can redistribute it and/or
modify it under the terms of the GNU General Public License (GPL), either
version 3 of the License, or (at your option) any later version published
by the Free Software Foundation (FSF).
A copy of the license is included in @ref{GNU GPL}.
@end ignore
@end ifinfo
@titlepage
@title GNU libunistring, version @value{VERSION}
@subtitle updated @value{UPDATED}
@subtitle Edition @value{EDITION}, @value{UPDATED}
@author Bruno Haible
@ifnothtml
@page
@vskip 0pt plus 1filll
@c @insertcopying
Copyright (C) 2001-2018 Free Software Foundation, Inc.
This manual is free documentation. It is dually licensed under the
GNU FDL and the GNU GPL. This means that you can redistribute this
manual under either of these two licenses, at your choice.
This manual is covered by the GNU FDL. Permission is granted to copy,
distribute and/or modify this document under the terms of the
GNU Free Documentation License (FDL), either version 1.2 of the
License, or (at your option) any later version published by the
Free Software Foundation (FSF); with no Invariant Sections, with no
Front-Cover Text, and with no Back-Cover Texts.
A copy of the license is included in @ref{GNU FDL}.
This manual is covered by the GNU GPL. You can redistribute it and/or
modify it under the terms of the GNU General Public License (GPL), either
version 3 of the License, or (at your option) any later version published
by the Free Software Foundation (FSF).
A copy of the license is included in @ref{GNU GPL}.
@end ifnothtml
@end titlepage
@c Table of Contents
@contents
@ifnottex
@node Top
@top GNU libunistring
@end ifnottex
@menu
* Introduction:: Who may need Unicode strings?
* Conventions:: Conventions used in this manual
* unitypes.h:: Elementary types
* unistr.h:: Elementary Unicode string functions
* uniconv.h:: Conversions between Unicode and encodings
* unistdio.h:: Output with Unicode strings
* uniname.h:: Names of Unicode characters
* unictype.h:: Unicode character classification and properties
* uniwidth.h:: Display width
* unigbrk.h:: Grapheme cluster breaking
* uniwbrk.h:: Word breaks in strings
* unilbrk.h:: Line breaking
* uninorm.h:: Normalization forms
* unicase.h:: Case mappings
* uniregex.h:: Regular expressions
* Using the library:: How to link with the library and use it?
* More functionality:: More advanced functionality
* The wchar_t mess:: Why @code{wchar_t *} strings are useless
* Licenses:: Licenses
* Index:: General Index
@detailmenu
--- The Detailed Node Listing ---
Introduction
* Unicode:: What is Unicode?
* Unicode and i18n:: Unicode and internationalization
* Locale encodings:: What is a locale encoding?
* In-memory representation:: How to represent strings in memory?
* char * strings:: What to keep in mind with @code{char *} strings
* Unicode strings:: How are Unicode strings represented?
unistr.h
* Elementary string checks::
* Elementary string conversions::
* Elementary string functions::
* Elementary string functions with memory allocation::
* Elementary string functions on NUL terminated strings::
Elementary string functions
* Iterating::
* Creating Unicode strings::
* Copying Unicode strings::
* Comparing Unicode strings::
* Searching for a character::
* Counting characters::
Elementary string functions on NUL terminated strings
* Iterating over a NUL terminated Unicode string::
* Length::
* Copying a NUL terminated Unicode string::
* Comparing NUL terminated Unicode strings::
* Duplicating a NUL terminated Unicode string::
* Searching for a character in a NUL terminated Unicode string::
* Searching for a substring::
* Tokenizing::
unictype.h
* General category::
* Canonical combining class::
* Bidi class::
* Decimal digit value::
* Digit value::
* Numeric value::
* Mirrored character::
* Arabic shaping::
* Properties::
* Scripts::
* Blocks::
* ISO C and Java syntax::
* Classifications like in ISO C::
General category
* Object oriented API::
* Bit mask API::
Properties
* Properties as objects::
* Properties as functions::
unigbrk.h
* Grapheme cluster breaks in a string::
* Grapheme cluster break property::
uniwbrk.h
* Word breaks in a string::
* Word break property::
uninorm.h
* Decomposition of characters::
* Composition of characters::
* Normalization of strings::
* Normalizing comparisons::
* Normalization of streams::
unicase,h
* Case mappings of characters::
* Case mappings of strings::
* Case mappings of substrings::
* Case insensitive comparison::
* Case detection::
Using the library
* Installation::
* Compiler options::
* Include files::
* Autoconf macro::
* Reporting problems::
Licenses
* GNU GPL:: GNU General Public License
* GNU LGPL:: GNU Lesser General Public License
* GNU FDL:: GNU Free Documentation License
@end detailmenu
@end menu
@node Introduction
@chapter Introduction
This library provides functions for manipulating Unicode strings and
for manipulating C strings according to the Unicode standard.
It consists of the following parts:
@table @code
@item <unistr.h>
elementary string functions
@item <uniconv.h>
conversion from/to legacy encodings
@item <unistdio.h>
formatted output to strings
@item <uniname.h>
character names
@item <unictype.h>
character classification and properties
@item <uniwidth.h>
string width when using nonproportional fonts
@item <unigbrk.h>
grapheme cluster breaks
@item <uniwbrk.h>
word breaks
@item <unilbrk.h>
line breaking algorithm
@item <uninorm.h>
normalization (composition and decomposition)
@item <unicase.h>
case folding
@item <uniregex.h>
regular expressions (not yet implemented)
@end table
@cindex use cases
@cindex value, of libunistring
libunistring is for you if your application involves non-trivial text
processing, such as upper/lower case conversions, line breaking, operations
on words, or more advanced analysis of text. Text provided by the user can,
in general, contain characters of all kinds of scripts. The text processing
functions provided by this library handle all scripts and all languages.
libunistring is for you if your application already uses the ISO C / POSIX
@posixheader{ctype.h}, @posixheader{wctype.h} functions and the text it
operates on is provided by the user and can be in any language.
libunistring is also for you if your application uses Unicode strings as
internal in-memory representation.
@menu
* Unicode:: What is Unicode?
* Unicode and i18n:: Unicode and internationalization
* Locale encodings:: What is a locale encoding?
* In-memory representation:: How to represent strings in memory?
* char * strings:: What to keep in mind with @code{char *} strings
* Unicode strings:: How are Unicode strings represented?
@end menu
@node Unicode
@section Unicode
@cindex Unicode
Unicode is a standardized repertoire of characters that contains characters
from all scripts of the world, from Latin letters to Chinese ideographs
and Babylonian cuneiform glyphs. It also specifies how these characters
are to be rendered on a screen or on paper, and how common text processing
(word selection, line breaking, uppercasing of page titles etc.) is supposed
to behave on Unicode text.
Unicode also specifies three ways of storing sequences of Unicode
characters in a computer whose basic unit of data is an 8-bit byte:
@cindex UTF-8
@cindex UTF-16
@cindex UTF-32
@cindex UCS-4
@table @asis
@item UTF-8
Every character is represented as 1 to 4 bytes.
@item UTF-16
Every character is represented as 1 to 2 units of 16 bits.
@item UTF-32, a.k.a@. UCS-4
Every character is represented as 1 unit of 32 bits.
@end table
For encoding Unicode text in a file, UTF-8 is usually used. For encoding
Unicode strings in memory for a program, either of the three encoding forms
can be reasonably used.
Unicode is widely used on the web. Prior to the use of Unicode, web pages
were in many different encodings (ISO-8859-1 for English, French, Spanish,
ISO-8859-2 for Polish, ISO-8859-7 for Greek, KOI8-R for Russian, GB2312 or
BIG5 for Chinese, ISO-2022-JP-2 or EUC-JP or Shift_JIS for Japanese, and many
many others). It was next to impossible to create a document that contained
Chinese and Polish text in the same document. Due to the many encodings for
Japanese, even the processing of pure Japanese text was error prone.
References:
@itemize @bullet
@item
The Unicode standard:@texnl{} @url{http://www.unicode.org/}
@item
Definition of UTF-8:@texnl{} @url{http://www.rfc-editor.org/rfc/rfc3629.txt}
@item
Definition of UTF-16:@texnl{} @url{http://www.rfc-editor.org/rfc/rfc2781.txt}
@item
Markus Kuhn's UTF-8 and Unicode FAQ:@texnl{}
@url{http://www.cl.cam.ac.uk/~mgk25/unicode.html}
@end itemize
@node Unicode and i18n
@section Unicode and Internationalization
@cindex internationalization
Internationalization is the process of changing the source code of a program
so that it can meet the expectations of users in any culture, if culture
specific data (translations, images etc.) are provided.
Use of Unicode is not strictly required for internationalization, but it
makes internationalization much easier, because operations that need to
look at specific characters (like hyphenation, spell checking, or the
automatic conversion of double-quotes to opening and closing double-quote
characters) don't need to consider multiple possible encodings of the text.
Use of Unicode also enables multilingualization: the ability of having text
in multiple languages present in the same document or even in the same line
of text.
But use of Unicode is not everything. Internationalization usually consists
of four features:
@itemize @bullet
@item
Use of Unicode where needed for text processing. This is what this library
is for.
@item
Use of message catalogs for messages shown to the user, This is what
GNU gettext is about.
@item
Use of locale specific conventions for date and time formats, for numeric
formatting, or for sorting of text. This can be done adequately with the
POSIX APIs and the implementation of locales in the GNU C library.
@item
In graphical user interfaces, adapting the GUI to the default text direction
of the current locale (see
@url{https://en.wikipedia.org/wiki/Right-to-left,right-to-left languages}).
@end itemize
@node Locale encodings
@section Locale encodings
@cindex locale
A locale is a set of cultural conventions. According to POSIX, for a program,
at any moment, there is one locale being designated as the ``current locale''.
(Actually, POSIX supports also one locale per thread, but this feature is not
yet universally implemented and not widely used.)
@cindex locale categories
The locale is partitioned into several aspects, called the ``categories''
of the locale. The main various aspects are:
@itemize @bullet
@item
The character encoding and the character properties. This is the
@code{LC_CTYPE} category.
@item
The sorting rules for text. This is the @code{LC_COLLATE} category.
@item
The language specific translations of messages. This is the
@code{LC_MESSAGES} category.
@item
The formatting rules for numbers, such as the decimal separator. This is
the @code{LC_NUMERIC} category.
@item
The formatting rules for amounts of money. This is the @code{LC_MONETARY}
category.
@item
The formatting of date and time. This is the @code{LC_TIME} category.
@end itemize
@cindex locale encoding
In particular, the @code{LC_CTYPE} category of the current locale determines
the character encoding. This is the encoding of @samp{char *} strings.
We also call it the ``locale encoding''. GNU libunistring has a function,
@func{locale_charset}, that returns a standardized (platform independent)
name for this encoding.
All locale encodings used on glibc systems are essentially ASCII compatible:
Most graphic ASCII characters have the same representation, as a single byte,
in that encoding as in ASCII.
Among the possible locale encodings are UTF-8 and GB18030. Both allow
to represent any Unicode character as a sequence of bytes. UTF-8 is used in
most of the world, whereas GB18030 is used in the People's Republic of China,
because it is backward compatible with the GB2312 encoding that was used in
this country earlier.
The legacy locale encodings, ISO-8859-15 (which supplanted ISO-8859-1 in
most of Europe), ISO-8859-2, KOI8-R, EUC-JP, etc., are still in use in
some places, though.
UTF-16 and UTF-32 are not used as locale encodings, because they are not
ASCII compatible.
@node In-memory representation
@section Choice of in-memory representation of strings
There are three ways of representing strings in memory of a running
program.
@itemize @bullet
@item
As @samp{char *} strings. Such strings are represented in locale encoding.
This approach is employed when not much text processing is done by the
program. When some Unicode aware processing is to be done, a string is
converted to Unicode on the fly and back to locale encoding afterwards.
@item
As UTF-8 or UTF-16 or UTF-32 strings. This implies that conversion from
locale encoding to Unicode is performed on input, and in the opposite
direction on output. This approach is employed when the program does
a significant amount of text processing, or when the program has multiple
threads operating on the same data but in different locales.
@item
As @samp{wchar_t *}, a.k.a@. ``wide strings''. This approach is misguided,
see @ref{The wchar_t mess}.
@end itemize
Of course, a @samp{char *} string can, in some cases, be encoded in UTF-8.
You will use the data type depending on what you can guarantee about how
it's encoded: If a string is encoded in the locale encoding, or if you
don't know how it's encoded, use @samp{char *}. If, on the other hand,
you can @emph{guarantee} that it is UTF-8 encoded, then you can use the
UTF-8 string type, @code{uint8_t *}, for it.
The five types @code{char *}, @code{uint8_t *}, @code{uint16_t *},
@code{uint32_t *}, and @code{wchar_t *} are incompatible types at the C
level. Therefore, @samp{gcc -Wall} will produce a warning if, by mistake,
your code contains a mismatch between these types. In the context of
using GNU libunistring, even a warning about a mismatch between
@code{char *} and @code{uint8_t *} is a sign of a bug in your code
that you should not try to silence through a cast.
@node char * strings
@section @samp{char *} strings
@cindex C string functions
The classical C strings, with its C library support standardized by
ISO C and POSIX, can be used in internationalized programs with some
precautions. The problem with this API is that many of the C library
functions for strings don't work correctly on strings in locale
encodings, leading to bugs that only people in some cultures of the
world will experience.
@cindex locale, multibyte
The first problem with the C library API is the support of multibyte
locales. According to the locale encoding, in general, every character
is represented by one or more bytes (up to 4 bytes in practice --- but
use @code{MB_LEN_MAX} instead of the number 4 in the code).
When every character is represented by only 1 byte, we speak of an
``unibyte locale'', otherwise of a ``multibyte locale''. It is important
to realize that the majority of Unix installations nowadays use UTF-8
or GB18030 as locale encoding; therefore, the majority of users are
using multibyte locales.
@cindex char, type
The important fact to remember is:
@cartouche
@emph{A @samp{char} is a byte, not a character.}
@end cartouche
As a consequence:
@itemize @bullet
@item
The @posixheader{ctype.h} API is useless in this context; it does not work in
multibyte locales.
@item
The @posixfunc{strlen} function does not return the number of characters
in a string. Nor does it return the number of screen columns occupied
by a string after it is output. It merely returns the number of
@emph{bytes} occupied by a string.
@item
Truncating a string, for example, with @posixfunc{strncpy}, can have the
effect of truncating it in the middle of a multibyte character. Such
a string will, when output, have a garbled character at its end, often
represented by a hollow box.
@item
@posixfunc{strchr} and @posixfunc{strrchr} do not work with multibyte strings
if the locale encoding is GB18030 and the character to be searched is
a digit.
@item
@posixfunc{strstr} does not work with multibyte strings if the locale encoding
is different from UTF-8.
@item
@posixfunc{strcspn}, @posixfunc{strpbrk}, @posixfunc{strspn} cannot work
correctly in multibyte locales: they assume the second argument is a list of
single-byte characters. Even in this simple case, they do not work with
multibyte strings if the locale encoding is GB18030 and one of the
characters to be searched is a digit.
@item
@posixfunc{strsep} and @posixfunc{strtok_r} do not work with multibyte strings
unless all of the delimiter characters are ASCII characters < 0x30.
@item
The @posixfunc{strcasecmp}, @posixfunc{strncasecmp}, and @posixfunc{strcasestr}
functions do not work with multibyte strings.
@end itemize
The workarounds can be found in GNU gnulib
@url{http://www.gnu.org/software/gnulib/}.
@itemize @bullet
@item
gnulib has modules @samp{mbchar}, @samp{mbiter}, @samp{mbuiter} that
represent multibyte characters and allow to iterate across a multibyte
string with the same ease as through a unibyte string.
@item
gnulib has functions @func{mbslen} and @func{mbswidth} that can be
used instead of @posixfunc{strlen} when the number of characters or the
number of screen columns of a string is requested.
@item
gnulib has functions @func{mbschr} and @func{mbsrrchr} that are
like @posixfunc{strchr} and @posixfunc{strrchr}, but work in multibyte locales.
@item
gnulib has a function @func{mbsstr}, like @posixfunc{strstr}, but works
in multibyte locales.
@item
gnulib has functions @func{mbscspn}, @func{mbspbrk}, @func{mbsspn}
that are like @posixfunc{strcspn}, @posixfunc{strpbrk}, @posixfunc{strspn}, but
work in multibyte locales.
@item
gnulib has functions @func{mbssep} and @func{mbstok_r} that are
like @posixfunc{strsep} and @posixfunc{strtok_r} but work in multibyte locales.
@item
gnulib has functions @func{mbscasecmp}, @func{mbsncasecmp},
@func{mbspcasecmp}, and @func{mbscasestr} that are like @posixfunc{strcasecmp},
@posixfunc{strncasecmp}, and @posixfunc{strcasestr}, but
work in multibyte locales. Still, the function @code{ulc_casecmp} is
preferable to these functions; see below.
@end itemize
The second problem with the C library API is that it has some assumptions built-in that are not valid in some languages:
@itemize @bullet
@item
It assumes that there are only two forms of every character: uppercase
and lowercase. This is not true for Croatian, where the character
@sc{LETTER DZ WITH CARON} comes in three forms:
@sc{LATIN CAPITAL LETTER DZ WITH CARON} (DZ),
@sc{LATIN CAPITAL LETTER D WITH SMALL LETTER Z WITH CARON} (Dz),
@sc{LATIN SMALL LETTER DZ WITH CARON} (dz).
@item
It assumes that uppercasing of 1 character leads to 1 character. This
is not true for German, where the @sc{LATIN SMALL LETTER SHARP S}, when
uppercased, becomes @samp{SS}.
@item
It assumes that there is 1:1 mapping between uppercase and lowercase forms.
This is not true for the Greek sigma: @sc{GREEK CAPITAL LETTER SIGMA} is
the uppercase of both @sc{GREEK SMALL LETTER SIGMA} and
@sc{GREEK SMALL LETTER FINAL SIGMA}.
@item
It assumes that the upper/lowercase mappings are position independent.
This is not true for the Greek sigma and the Lithuanian i.
@end itemize
The correct way to deal with this problem is
@enumerate
@item
to provide functions for titlecasing, as well as for upper- and
lowercasing,
@item
to view case transformations as functions that operates on strings,
rather than on characters.
@end enumerate
This is implemented in this library, through the functions declared in @code{<unicase.h>}, see @ref{unicase.h}.
@node Unicode strings
@section Unicode strings
libunistring supports Unicode strings in three representations:
@cindex UTF-8, strings
@cindex UTF-16, strings
@cindex UTF-32, strings
@itemize @bullet
@item
UTF-8 strings, through the type @samp{uint8_t *}. The units are bytes
(@code{uint8_t}).
@item
UTF-16 strings, through the type @samp{uint16_t *}, The units are 16-bit
memory words (@code{uint16_t}).
@item
UTF-32 strings, through the type @samp{uint32_t *}. The units are 32-bit
memory words (@code{uint32_t}).
@end itemize
As with C strings, there are two variants:
@itemize @bullet
@item
Unicode strings with a terminating NUL character are represented as
a pointer to the first unit of the string. There is a unit containing
a 0 value at the end. It is considered part of the string for all
memory allocation purposes, but is not considered part of the string
for all other logical purposes.
@item
Unicode strings where embedded NUL characters are allowed. These
are represented by a pointer to the first unit and the number of units
(not bytes!) of the string. In this setting, there is no trailing
zero-valued unit used as ``end marker''.
@end itemize
@node Conventions
@chapter Conventions
This chapter explains conventions valid throughout the libunistring library.
@cindex argument conventions
Variables of type @code{char *} denote C strings in locale encoding.
See @ref{Locale encodings}.
Variables of type @code{uint8_t *} denote UTF-8 strings. Their units
are bytes.
Variables of type @code{uint16_t *} denote UTF-16 strings, without byte
order mark. Their units are 2-byte words.
Variables of type @code{uint32_t *} denote UTF-32 strings, without byte
order mark. Their units are 4-byte words.
Argument pairs @code{(@var{s}, @var{n})} denote a string
@code{@var{s}[0..@var{n}-1]} with exactly @var{n} units.
All functions with prefix @samp{ulc_} operate on C strings in locale
encoding.
All functions with prefix @samp{u8_} operate on UTF-8 strings.
All functions with prefix @samp{u16_} operate on UTF-16 strings.
All functions with prefix @samp{u32_} operate on UTF-32 strings.
For every function with prefix @samp{u8_}, operating on UTF-8 strings,
there is also a corresponding function with prefix @samp{u16_},
operating on UTF-16 strings, and a corresponding function with prefix
@samp{u32_}, operating on UTF-32 strings. Their description is
analogous; in this documentation we describe only the function that
operates on UTF-8 strings, for brevity.
A declaration with a variable @var{n} denotes the three concrete
declarations with @var{n} = 8, @var{n} = 16, @var{n} = 32.
All parameters starting with @samp{str} and the parameters of
functions starting with @code{u8_str}/@code{u16_str}/@code{u32_str}
denote a NUL terminated string.
@cindex return value conventions
Error values are always returned through the @code{errno} variable,
usually with a return value that indicates the presence of an error
(NULL for functions that return an pointer, or -1 for functions that
return an @code{int}).
Functions returning a string result take a
@code{(@var{resultbuf}, @var{lengthp})}
argument pair. If @var{resultbuf} is not NULL and the result fits
into @code{*@var{lengthp}} units, it is put in @var{resultbuf}, and
@var{resultbuf} is returned. Otherwise, a freshly allocated string
is returned. In both cases, @code{*@var{lengthp}} is set to the
length (number of units) of the returned string. In case of error,
NULL is returned and @code{errno} is set.
@include unitypes.texi
@include unistr.texi
@include uniconv.texi
@include unistdio.texi
@include uniname.texi
@include unictype.texi
@include uniwidth.texi
@include unigbrk.texi
@include uniwbrk.texi
@include unilbrk.texi
@include uninorm.texi
@include unicase.texi
@include uniregex.texi
@node Using the library
@chapter Using the library
This chapter explains some practical considerations, regarding the
installation and compiler options that are needed in order to use this
library.
@menu
* Installation::
* Compiler options::
* Include files::
* Autoconf macro::
* Reporting problems::
@end menu
@node Installation
@section Installation
@cindex dependencies
Before you can use the library, it must be installed. First, you have to
make sure all dependencies are installed. They are listed in the file
@file{DEPENDENCIES}.
@cindex installation
Then you can proceed to build and install the library, as described in the
file @file{INSTALL}. For installation on Windows systems, please refer to
the file @file{INSTALL.windows}.
@node Compiler options
@section Compiler options
Let's denote as @code{LIBUNISTRING_PREFIX} the value of the @samp{--prefix}
option that you passed to @code{configure} while installing this package.
If you didn't pass any @samp{--prefix} option, then the package is installed
in @file{/usr/local}.
Let's denote as @code{LIBUNISTRING_INCLUDEDIR} the directory where the
include files were installed. This is usually the same as
@code{$@{LIBUNISTRING_PREFIX@}/include}. Except that if you passed an
@samp{--includedir} option to @code{configure}, it is the value of that
option.
Let's further denote as @code{LIBUNISTRING_LIBDIR} the directory where
the library itself was installed. This is the value that you passed
with the @samp{--libdir} option to @code{configure}, or otherwise the
same as @code{$@{LIBUNISTRING_PREFIX@}/lib}. Recall that when building
in 64-bit mode on a 64-bit GNU/Linux system that supports executables
in either 64-bit mode or 32-bit mode, you should have used the option
@code{--libdir=$@{LIBUNISTRING_PREFIX@}/lib64}.
@cindex compiler options
So that the compiler finds the include files, you have to pass it the
option @code{-I$@{LIBUNISTRING_INCLUDEDIR@}}.
So that the compiler finds the library during its linking pass, you have
to pass it the options @code{-L$@{LIBUNISTRING_LIBDIR@} -lunistring}.
On some systems, in some configurations, you also have to pass options
needed for linking with @code{libiconv}. The autoconf macro
@code{gl_LIBUNISTRING} (see @ref{Autoconf macro}) deals with this
particularity.
@node Include files
@section Include files
Most of the include files have been presented in the introduction, see
@ref{Introduction}, and subsequent detailed chapters.
Another include file is @code{<unistring/version.h>}. It contains the
version number of the libunistring library.
@deftypevr Macro int _LIBUNISTRING_VERSION
This constant contains the version of libunistring that is being used
at compile time. It encodes the major and minor parts of the version
number only. These parts are encoded in the form @code{(major<<8) + minor}.
@end deftypevr
@deftypevr Constant int _libunistring_version
This constant contains the version of libunistring that is being used
at run time. It encodes the major and minor parts of the version
number only. These parts are encoded in the form @code{(major<<8) + minor}.
@end deftypevr
It is possible that @code{_libunistring_version} is greater than
@code{_LIBUNISTRING_VERSION}. This can happen when you use
@code{libunistring} as a shared library, and a newer, binary
backward-compatible version has been installed after your program
that uses @code{libunistring} was installed.
@node Autoconf macro
@section Autoconf macro
@cindex autoconf macro
GNU Gnulib provides an autoconf macro that tests for the availability
of @code{libunistring}. It is contained in the Gnulib module
@samp{libunistring}, see@texnl{}
@url{http://www.gnu.org/software/gnulib/MODULES.html#module=libunistring}.
@amindex gl_LIBUNISTRING
The macro is called @code{gl_LIBUNISTRING}. It searches for an installed
libunistring. If found, it sets and AC_SUBSTs @code{HAVE_LIBUNISTRING=yes}
and the @code{LIBUNISTRING} and @code{LTLIBUNISTRING} variables and augments
the @code{CPPFLAGS} variable, and defines the C macro
@code{HAVE_LIBUNISTRING} to 1. Otherwise, it sets and AC_SUBSTs
@code{HAVE_LIBUNISTRING=no} and @code{LIBUNISTRING} and @code{LTLIBUNISTRING}
to empty.
The complexities that @code{gl_LIBUNISTRING} deals with are the following:
@itemize @bullet
@item
On some operating systems, in some configurations, libunistring depends
on @code{libiconv}, and the options for linking with libiconv must be
mentioned explicitly on the link command line.
@item
GNU @code{libunistring}, if installed, is not necessarily already in the
search path (@code{CPPFLAGS} for the include file search path,
@code{LDFLAGS} for the library search path).
@item
GNU @code{libunistring}, if installed, is not necessarily already in the
run time library search path. To avoid the need for setting an environment
variable like @code{LD_LIBRARY_PATH}, the macro adds the appropriate
run time search path options to the @code{LIBUNISTRING} variable. This works
on most systems.
@end itemize
@node Reporting problems
@section Reporting problems
@cindex bug reports
@cindex bug tracker
@cindex mailing list
If you encounter any problem, please don't hesitate to send a detailed
bug report to the @code{bug-libunistring@@gnu.org} mailing list. You can
alternatively also use the bug tracker at the project page
@url{https://savannah.gnu.org/projects/libunistring}.
Please always include the version number of this library, and a short
description of your operating system and compilation environment with
corresponding version numbers.
For problems that appear while building and installing @code{libunistring},
for which you don't find the remedy in the @file{INSTALL} file, please include
a description of the options that you passed to the @samp{configure} script.
@node More functionality
@chapter More advanced functionality
@cindex bidirectional reordering
For bidirectional reordering of strings, we recommend the GNU FriBidi library:
@url{http://www.fribidi.org/}.
@cindex rendering
For the rendering of Unicode strings outside of the context of a given toolkit
(KDE/Qt or GNOME/Gtk), we recommend the Pango library:
@url{http://www.pango.org/}.
@include wchar_t.texi
@node Licenses
@appendix Licenses
@cindex Licenses
The files of this package are covered by the licenses indicated in each
particular file or directory. Here is a summary:
@itemize @bullet
@item
The @code{libunistring} library and its header files are dual-licensed under
"the GNU LGPLv3+ or the GNU GPLv2". This means, you can use it under either
@itemize @bullet
@item @minus{}
the terms of the GNU Lesser General Public License (LGPL) version 3 or
(at your option) any later version, or
@item @minus{}
the terms of the GNU General Public License (GPL) version 2, or
@item @minus{}
the same dual license "the GNU LGPLv3+ or the GNU GPLv2".
@end itemize
You find the GNU LGPL version 3 in @ref{GNU LGPL}. This license is
based on the GNU GPL version 3, see @ref{GNU GPL}.
@*
You can find the GNU GPL version 2 at
@url{https://www.gnu.org/licenses/old-licenses/gpl-2.0.html}.
@*
Note: This dual license makes it possible for the @code{libunistring} library
to be used by packages under GPLv2 or GPLv2+ licenses, in particular. See
the table in @url{https://www.gnu.org/licenses/gpl-faq.html#AllCompatibility}.
@item
This manual is free documentation. It is dually licensed under the
GNU FDL and the GNU GPL. This means that you can redistribute this
manual under either of these two licenses, at your choice.
@*
This manual is covered by the GNU FDL. Permission is granted to copy,
distribute and/or modify this document under the terms of the
GNU Free Documentation License (FDL), either version 1.2 of the
License, or (at your option) any later version published by the
Free Software Foundation (FSF); with no Invariant Sections, with no
Front-Cover Text, and with no Back-Cover Texts.
A copy of the license is included in @ref{GNU FDL}.
@*
This manual is covered by the GNU GPL. You can redistribute it and/or
modify it under the terms of the GNU General Public License (GPL), either
version 3 of the License, or (at your option) any later version published
by the Free Software Foundation (FSF).
A copy of the license is included in @ref{GNU GPL}.
@end itemize
@menu
* GNU GPL:: GNU General Public License
* GNU LGPL:: GNU Lesser General Public License
* GNU FDL:: GNU Free Documentation License
@end menu
@page
@node GNU GPL
@appendixsec GNU GENERAL PUBLIC LICENSE
@cindex GPL, GNU General Public License
@cindex License, GNU GPL
@include gpl.texi
@page
@node GNU LGPL
@appendixsec GNU LESSER GENERAL PUBLIC LICENSE
@cindex LGPL, GNU Lesser General Public License
@cindex License, GNU LGPL
@include lgpl.texi
@page
@node GNU FDL
@appendixsec GNU Free Documentation License
@cindex FDL, GNU Free Documentation License
@cindex License, GNU FDL
@include fdl.texi
@node Index
@unnumbered Index
@printindex cp
@bye
@c Local Variables:
@c indent-tabs-mode: nil
@c whitespace-check-buffer-indent: nil
@c End:
|
http://kleine.mat.uniroma3.it/mp_arc/e/02-165.latex | uniroma3.it | CC-MAIN-2019-13 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2019-13/segments/1552912203548.81/warc/CC-MAIN-20190325031213-20190325053213-00229.warc.gz | 122,068,121 | 16,774 | \documentstyle[12pt]{article}
\makeatletter
\textheight 23 cm
\textwidth 15.8 cm
\addtolength{\topmargin}{-2.1cm}
\addtolength{\oddsidemargin}{-1.4cm}
\parskip 5pt plus 2pt minus 2pt \parindent 17pt \topsep 0pt plus 1pt
\partopsep 3pt plus 1pt minus 2pt \itemsep 0pt
\parsep 3pt plus 1pt minus 1pt
\@addtoreset{equation}{section}
\renewcommand{\theequation}{\thesection.\arabic{equation}}
\let\Nsection\section
\def\section#1{\@ifstar{Nsection*}{\def\thesection{\arabic{section}.}\@startsect
ion{section}{1}{\z@}{-3.5ex
plus -1ex minus
-.2ex}{2.3ex plus .2ex}{\bf}{\uppercase\expandafter{#1}}
\def\thesection{\arabic{section}}}}
\def\subsection{\@startsection{subsection}{2}{\z@}{-3.25ex plus -1ex minus
-.2ex}{-1em}{\bf}}
\def\thesubsection {\thesection.\alph{subsection}}
\def\thebibliography#1{\par\vskip 6 mm\noindent {\bf REFERENCES} \par \list
{[\arabic{enumi}]}{\settowidth\labelwidth{[#1]}\leftmargin\labelwidth
\advance\leftmargin\labelsep
\usecounter{enumi}}
\def\newblock{\hskip .11em plus .33em minus -.07em}
\sloppy
\sfcode`\.=1000\relax}
\let\endthebibliography=\endlist
\arraycolsep 5pt \tabcolsep 6pt \arrayrulewidth .4pt \doublerulesep 2pt
\tabbingsep \labelsep
\def\address#1{\gdef\@address{#1}}
\def\maketitle{\par
\begingroup
\def\thefootnote{\fnsymbol{footnote}}
\def\@makefnmark{\hbox
to 0pt{$^{\@thefnmark}$\hss}}
\if@twocolumn
\twocolumn[\@maketitle]
\else \newpage
\global\@topnum\z@ \@maketitle \fi\thispagestyle{empty}\@thanks
\endgroup
\setcounter{footnote}{0}
\let\maketitle\relax
\let\@maketitle\relax
\gdef\@thanks{}\gdef\@author{}\gdef\@title{}\let\thanks\relax}
\def\@maketitle{\newpage
\null
\vskip 10mm \begin{center}
{\bf\uppercase\expandafter{\@title}\par} \vskip 4 mm
{\bf\@author \par}% \vskip 4 mm {\@address \par} %\address ist neu
\end{center}
\vskip 20 mm}
\newcommand{\nc}{\newcommand}
\newtheorem{lemma}{Lemma} [section]
\newtheorem{theorem}[lemma]{Theorem}
\newtheorem{proposition}[lemma]{Proposition}
\newtheorem{corollary}[lemma]{Corollary}
\newtheorem{remark}[lemma]{Remark}
\newtheorem{assumption}[lemma]{Assumption}
\newtheorem{example}[lemma]{Example}
\newenvironment{Remark}{\begin{remark}\rm }{\end{remark}
\medskip}
\newtheorem{definition}[lemma]{Definition}
\newenvironment{Definition}{\begin{definition}\rm }{\end{definition}\medskip}
\nc{\QED}{\mbox{}\hfill \raisebox{-2pt}{\rule{5.6pt}{8pt}\rule{4pt}{0pt}}
\medskip\par}
\newenvironment{Proof}{\noindent
\parindent=0pt\abovedisplayskip = 0.5\abovedisplayskip
\belowdisplayskip=\abovedisplayskip{\bf Preuve. }}{\QED}
\newenvironment{Example}{\begin{example}\rm }{\QED\end{example}\medskip}
\nc{\di}{\displaystyle}
\nc{\SS}{{\rm I\mkern-4.0mu S}}
\nc{\SSs}{{\sf S\mkern-6.5mu S}}
\nc{\C}{{\rm I\mkern-4.0mu C}}
\nc{\R}{{\rm I\mkern-4.0mu R}}
\nc{\Z}{{\sf Z\mkern-6.5mu Z}}
\nc{\CCa}{\mbox{$C \mkern-10.5mu\raisebox{.18em}{$\scriptstyle/$}\mkern3mu$}}
\nc{\CCb}{C\mkern-11.5mu I\mkern4mu}
\nc{\Cc}{\mathchoice{\CCa}{\CCa}{\CCb}{C\mkern-10.5mu I\mkern3mu}}
\renewcommand{\Re}{\mathop{\rm Re}}
\renewcommand{\Im}{\mathop{\rm Im}}
\newcommand{\pp}{{ \partial }}
\renewcommand{\O}[1]{{\cal O}(#1)}
\nc{\Ref}[1]{~\mbox{\rm (\ref{#1})}}
\nc{\REF}[1]{~\mbox{\rm \ref{#1}}}
\nc{\Norm}[2]{\|#1\|\left.\vphantom{T_{j_0}^0}\!\!\right._{#2}}
\nc{\Log}{\mathop {\rm Log}\nolimits}
%\pagestyle{empty}
% Store the catcode of the @ in the csname so that it can be restored later.
\expandafter\chardef\csname pre amssym.def at\endcsname=\the\catcode`\@
% Set the catcode to 11 for use in private control sequence names.
\catcode`\@=11
\def\undefine#1{\let#1\undefined}
\def\newsymbol#1#2#3#4#5{\let\next@\relax
\ifnum#2=\@ne\let\next@\msafam@\else
\ifnum#2=\tw@\let\next@\msbfam@\fi\fi
\mathchardef#1="#3\next@#4#5}
\def\mathhexbox@#1#2#3{\relax
\ifmmode\mathpalette{}{\m@th\mathchar"#1#2#3}%
\else\leavevmode\hbox{$\m@th\mathchar"#1#2#3$}\fi}
\def\hexnumber@#1{\ifcase#1 0\or 1\or 2\or 3\or 4\or 5\or 6\or 7\or 8\or
9\or A\or B\or C\or D\or E\or F\fi}
\font\tenmsa=msam10
\font\sevenmsa=msam7
\font\fivemsa=msam5
\newfam\msafam
\textfont\msafam=\tenmsa
\scriptfont\msafam=\sevenmsa
\scriptscriptfont\msafam=\fivemsa
\edef\msafam@{\hexnumber@\msafam}
\mathchardef\dabar@"0\msafam@39
\def\dashrightarrow{\mathrel{\dabar@\dabar@\mathchar"0\msafam@4B}}
\def\dashleftarrow{\mathrel{\mathchar"0\msafam@4C\dabar@\dabar@}}
\let\dasharrow\dashrightarrow
\def\ulcorner{\delimiter"4\msafam@70\msafam@70 }
\def\urcorner{\delimiter"5\msafam@71\msafam@71 }
\def\llcorner{\delimiter"4\msafam@78\msafam@78 }
\def\lrcorner{\delimiter"5\msafam@79\msafam@79 }
\def\yen{{\mathhexbox@\msafam@55 }}
\def\checkmark{{\mathhexbox@\msafam@58 }}
\def\circledR{{\mathhexbox@\msafam@72 }}
\def\maltese{{\mathhexbox@\msafam@7A }}
\font\tenmsb=msbm10
\font\sevenmsb=msbm7
\font\fivemsb=msbm5
\newfam\msbfam
\textfont\msbfam=\tenmsb
\scriptfont\msbfam=\sevenmsb
\scriptscriptfont\msbfam=\fivemsb
\edef\msbfam@{\hexnumber@\msbfam}
\def\Bbb#1{\fam\msbfam\relax#1}
\def\widehat#1{\setbox\z@\hbox{$\m@th#1$}%
\ifdim\wd\z@>\tw@ em\mathaccent"0\msbfam@5B{#1}%
\else\mathaccent"0362{#1}\fi}
\def\widetilde#1{\setbox\z@\hbox{$\m@th#1$}%
\ifdim\wd\z@>\tw@ em\mathaccent"0\msbfam@5D{#1}%
\else\mathaccent"0365{#1}\fi}
\font\teneufm=eufm10
\font\seveneufm=eufm7
\font\fiveeufm=eufm5
\newfam\eufmfam
\textfont\eufmfam=\teneufm
\scriptfont\eufmfam=\seveneufm
\scriptscriptfont\eufmfam=\fiveeufm
\def\frak#1{{\fam\eufmfam\relax#1}}
\let\goth\frak
% Restore the catcode value for @ that was previously saved.
\catcode`\@=\csname pre amssym.def at\endcsname
\begin{document}
\title{On the mathematical theory of the Aharonov-Bohm effect}
\author{Ph. Roux and D. Yafaev
\\Department of Mathematics, University of Rennes,\\
Campus Beaulieu, 35042, Rennes, France,
\\ [email protected], [email protected]}
\maketitle
\begin{abstract}
We consider the Schr\"odinger operator $H=(i\nabla+A)^2 $ in the space
$L_2({\Bbb R}^2)$ with
a magnetic potential
$A(x)=a(\hat{x})(-x_2,x_1) |x|^{-2}$,
where $a$ is an arbitrary function on the unit circle.
Our goal is to study spectral properties of the corresponding scattering
matrix $S(\lambda)$,
$\lambda>0$. We obtain its stationary representation and show that its
singular part (up to
compact terms) is a pseudodifferential operator of zero order whose symbol
is an explicit
function of
$a$. We deduce from this result that the essential
spectrum of
$S(\lambda)$ does not depend on $\lambda$ and consists of two complex
conjugated and perhaps
overlapping closed intervals of the unit circle. Finally, we calculate the
diagonal singularity of the scattering amplitude (kernel of $S(\lambda)$
considered as an integral
operator). In particular, we show that for all these properties only the
behaviour of a potential at
infinity is essential.
The preceeding papers on this subject treated the case $a(\hat{x})={\rm
const}$ and used the
separation of variables in the Schr\"odinger equation in the polar
coordinates.
This technique does not of course work for
arbitrary $a$. From analytical point of view, our paper relies on some
modern tools of scattering
theory and well-known properties of pseudodifferential operators.
\end{abstract}
\section {Introduction }
>From mathematical point of view the famous Aharonov-Bohm effect \cite{AB,
Hen, RUI} consists in
unusual spectral properties of the scattering matrix (SM)
$S_\alpha(\lambda)$, $\lambda>0$, for the
Schr\"odinger operator $H_\alpha$ with magnetic potential $
A_\alpha(x)=\alpha (-x_2,x_1) |x|^{-2}$,
$\alpha\in{\Bbb R}$, $x=(x_1,x_2)$, in the space $L_2({\Bbb R}^2)$. For
such potentials the
Schr\"odinger equation admits separation of variables in polar coordinates
$(r,\theta)$, and for
every fixed angular momentum $m=0, \pm 1, \pm 2,\ldots$ the radial equation
\[
-u_m^{\prime\prime}+((m-\alpha)^2-1/4)r^{-2}u_m=\lambda u_m,\quad \lambda> 0,
\]
can be solved in terms of the Bessel functions $u_m(r)=r^{1/2}{\cal
I}_{|m-\alpha|}(\lambda^{1/2}r)$. Using the asymptotics of these functions
as $r\rightarrow\infty$,
we see that $S_\alpha(\lambda)$ has two eigenvalues $e^{i\alpha\pi}$ and
$e^{-i\alpha\pi}$
with corresponding eigenfunctions $e^{im\theta}$ for $m\leq \alpha$ and
$m\geq \alpha$,
respectively. This is qualitatively different both from the case of
short-range (satisfying the
condition
$O(|x|^{-1-\varepsilon})$, $\varepsilon>0$, at infinity) electric and
magnetic potentials and from
the electric (Coulomb) potential decaying as $|x|^{-1}$. In the first case
the essential spectrum of
the SM consists of the only point $1$ and in the second it covers the whole
unit circle (see, e.g.,
\cite{Y5}).
Since eigenvalues and eigenfunctions of $S_\alpha(\lambda)$ are known, the
spectral theorem yields
directly an explicit expression (see \cite{RUI}) for the kernel of
$S_\alpha(\lambda)$ considered
as an integral operator. As usual, it is singular only on the diagonal, but
its singularity is
quite different from the case of short-range magnetic and electric
potentials (as well as
from the electric Coulomb potential). Indeed, in the short-range case the
leading singularity is
given by the Dirac function whereas for the Aharonov-Bohm potential it is a
linear combination
(with coefficients depending on $\alpha$) of the Dirac function and of the
singular denominator
understood as the principal value.
Note also that if $H_\alpha$ is considered for $|x|\geq r_0$ with the
Dirichlet boundary condition at
$|x| = r_0$ (see \cite{RUI}), then the corresponding SM has infinitely
many eigenvalues which
however accumulate at the points $e^{i\alpha\pi}$ and $e^{-i\alpha\pi}$
only. To put it
differently, the essential spectrum of such SM consists again of the points
$e^{i\alpha\pi}$ and
$e^{-i\alpha\pi}$.
In the present paper we study spectral properties of the SM and the
diagonal singularity of its
kernel in a more general context. Actually, we suppose that, for
sufficiently large $|x|$,
\begin{equation}\label{eq:A'}
A(x)=a(\hat{x})(-x_2,x_1) |x|^{-2},\quad \hat{x}=x/|x|,
\end{equation}
where $a$ is an arbitrary real $C^\infty$-function on the unit circle.
For such potentials $A(x)=(A_1(x), A_2(x))$ the magnetic field
$B(x)=\partial A_1(x)/\partial
x_2- \partial A_2(x)/\partial x_1$ vanishes (for large $|x| $).
An arbitrary short-range potential can be added to $A(x)$ without
changing significantly our results. In particular, only the
behaviour of a potential at infinity is essential.
Of course, except the case $a(\hat{x})={\rm const}$, for potentials
(\ref{eq:A'})
the variables in the two-dimensional Schr\"odinger equation cannot be
separated. Therefore to
solve the problem, we use modern tools of scattering theory (a
stationary formula for the SM in
a general framework, different resolvent estimates, etc.) and some
well-known properties of
pseudodifferential operators (PDO). Note that we consider the SM as a PDO
on the unit circle. We
try here to single out the main ideas and to keep the presentation as
simple as possible, so
that technical details are usually omitted.
In fact, we follow rather closely the paper
\cite{Y3} where electric long-range potentials were considered. The
technique of this paper applies
automatically to magnetic potentials, but the concrete expressions for
symbols of the SM and for
diagonal singularities of their kernels (if the SM are considered as
integral operators) are
qualitatively different for electric and magnetic potentials decaying as
$|x|^{-1}$ at infinity.
This leads also to a qualitative difference in spectral properties of the
corresponding SM.
\section { Main results }
We consider the pair of self-adjoint operators $H_0=-\Delta$,
\[
H=(i\nabla+A(x))^2,\quad x\in{\Bbb R}^2,
\]
with a magnetic potential (\ref{eq:A'}) in the space ${\cal H}=L_2({\Bbb
R}^2)$. As was noticed in
\cite{LOSTHA}, although the potential
$A(x)$ decays only as $|x|^{-1}$
at infinity, due to the transversal gauge
\begin{equation}\label{eq:H3}
\langle A(x),x \rangle =0,
\end{equation}
the usual wave operators $W_\pm(H,H_0)$ exist. In their terms are defined
the scattering operator ${\bf S}$ and the
SM $S(\lambda)$, $\lambda>0$. Recall that, for
general short- and long-range electric and magnetic potentials, the SM
is a unitary operator in
the space $L_2 ({\Bbb S})$. It is usually considered as an integral
operator, that is
\[
(S(\lambda)u)(\omega)=\int_{\Bbb S} s(\omega,\omega^\prime;\lambda)
u(\omega^\prime)d\omega^\prime.
\]
The kernel
$s(\omega,\omega^\prime,\lambda)$ of the SM (the scattering amplitude) is a
smooth function of
$\omega,\omega^\prime\in {\Bbb S}$ for $\omega\neq\omega^\prime$ but can be
very singular on the
diagonal
$\omega=\omega^\prime$ (see, e.g., \cite{Y5}). In particular, this is true
in the case considered.
Let us formulate our main result on the essential spectrum $\sigma_{ess}$
of $S(\lambda)$. Set
\begin{equation}
f (\omega)= \int_{{\Bbb S}(-\omega,\omega)} a(\theta)d\theta,
\label{eq:s0b4}
\end{equation}
where the integral is taken in the positive (counter-clockwise) direction
over the half-circle
between the points
$-\omega$ and $\omega$. Note that
\begin{equation}\label{eq:A4}
f (\omega)+ f (-\omega)=\int_{\Bbb S} a(\theta)d\theta=:\phi
\end{equation}
is the total magnetic flux.
\begin{theorem}\label{ABS}
For all $\lambda>0$
\begin{equation}\label{eq:Spess}
\sigma_{ess}(S(\lambda))= e^{if({\Bbb S})}\cup e^{-if({\Bbb S})},
\end{equation}
that is $\sigma_{ess}(S(\lambda))$ consists of the two complex conjugated
and perhaps
overlapping closed intervals of the unit circle.
\end{theorem}
We emphasize that the essential
spectrum of $S(\lambda)$ does not depend on $\lambda$.
For concrete functions
$a$ in (\ref{eq:A'}), one can compute integral (\ref{eq:s0b4}) and find
$\sigma_{ess}(S(\lambda))$
explicitly. We give only one example.
\begin{corollary}\label{AB2}
Let
\begin{equation}\label{eq:f2}
a(\hat{x})=\alpha+\gamma \cos\vartheta
\end{equation}
where $\vartheta$ is the polar angle of $\hat{x}$. Then relation
$(\ref{eq:Spess})$ holds with
\begin{equation}\label{eq:Spess2}
f({\Bbb S})=[\pi\alpha-2|\gamma|,\pi\alpha +2|\gamma|].
\end{equation}
In particular, if $a(\hat{x})=\alpha$, then $\sigma_{ess}(S(\lambda))$
consists of the two points
$\exp(\pm i\pi\alpha)$ which equal $(-1)^n$ for $\alpha=n\in\Z$.
\end{corollary}
Indeed, for function (\ref{eq:f2}), we have that
$f(\omega)=\pi\alpha+ 2\gamma\sin \psi$ where $\psi$ is the polar angle of
$\omega$. This yields
formula (\ref{eq:Spess2}).
Next we can describe the diagonal singularity of the scattering amplitude.
\begin{theorem}\label{ABStilde}
Let $S_0$ be the integral operator on $L_2({\Bbb S})$ with kernel
\begin{equation}\label{eq:SAB}
s_{0} (\omega,\omega^\prime)= e^{if(\omega)-i\phi/2} \Bigl(\cos(\phi/2)\,
\delta(\omega,\omega^\prime) + (2\pi )^{-1} \sin(\phi/2)\, {\rm
P.V.}\frac{1}{\sin (\{\omega,\omega^\prime\}/2)}\Bigr),
\end{equation}
where $\delta(\omega,\omega^\prime)$ is the Dirac function on the unit circle,
$\rm P.V.$ is the principal value and $\{\omega,\omega^\prime\}$ is the
oriented angle between an
initial vector $\omega$ and a final vector
$\omega^\prime$. Then
\[
| s (\omega,\omega^\prime;\lambda)- s_0
(\omega,\omega^\prime)|=O\left(|\ln|\omega-\omega^\prime|\,|\right),\quad
\omega-\omega^\prime\rightarrow 0.
\]
In particular, the operator $S(\lambda)-S_{0}$ belongs to the
Hilbert-Schmidt class.
\end{theorem}
It follows from (\ref{eq:s0b4}) and (\ref{eq:A4}) that if the function $a$
is even, then
$f(\omega)=\phi/2$ for all $\omega\in{\Bbb S}$ and hence the first factor
in the right-hand side
of (\ref{eq:SAB}) equals $1$. Thus, for an arbitrary even $a$, the formula
(\ref{eq:SAB}) for the
singular part of the SM is the same as for a constant $a(\hat{x})=\alpha $
but the role of
$\alpha$ is played by $(2\pi)^{-1}\phi$. If $a$ is odd, then
$\phi=0$ and $f$ is also odd. In this case
$ s_{0} (\omega,\omega^\prime)= e^{i f(\omega)}
\delta(\omega,\omega^\prime)$,
so that $S_0 $ is the operator of multiplication by $ e^{i f(\omega)}$. Note
that $ s_{0} (\omega,\omega^\prime)$ is a real function if $a$ is even,
but this is of course
wrong in the general case.
Theorem~\ref{ABStilde} implies
\begin{corollary} \label{B6Y}
Let $\omega\neq\omega^\prime$ and $\omega-\omega^\prime\rightarrow
0$. Then
\[
s(\omega ,\omega^\prime;\lambda)=\frac
{\exp\Bigl(if(\omega)-i\phi/2 \Bigr)\sin(\phi/2)}
{ 2\pi\sin (\{\omega,\omega^\prime\}/2)}
+O\left(|\ln|\omega-\omega^\prime|\,| \right).
\]
\end{corollary}
Now we can give an explicit asymptotics of the scattering cross-section
\[
\Sigma_{diff}(\omega ;\omega_0,\lambda)={2\pi\over
\sqrt{\lambda}}| s (\omega_0,\omega;\lambda)|^2, ~~\omega\neq\omega_0
\]
for an incident direction $\omega_0$ of a beam of particules and a
direction of observation
$\omega$.
\begin{corollary} \label{B6}
Let $\omega\rightarrow\omega_0$. Then
\begin{equation}\label{eq:diff}
\Sigma_{diff}(\omega;\omega_0,\lambda)={1\over2\pi\sqrt{\lambda}}
{\sin^2(\phi/2)\over\sin^2(\{\omega,\omega_0\}/2)}
+O\left({|\ln|\omega-\omega_0|\,|\over|\omega-\omega_0|}\right).
\end{equation}
The total cross section
\[
\Sigma_{tot}(\omega_0,\lambda)=
\int_0^{2\pi}\Sigma_{diff}(\omega;\omega_0,\lambda)d\omega
\]
is finite $($for all $\omega_0$ at the same time$)$ if and only if
$\phi\in 2\pi{\Bbb Z}$. In this case
\[
\Sigma_{diff}(\omega;\omega_0,\lambda)= O\left( \ln^2|\omega-\omega_0|
\right).
\]
\end{corollary}
We emphasize that formula (\ref{eq:diff}) depends on the total magnetic
flux $\phi$ only.
It looks quite natural from the physics point of view. Indeed, the
potential (\ref{eq:A'})
with $a(\hat{x})=\alpha$ was chosen in the original paper \cite{AB}
essentially by phenomenological reasons.
It was required that the magnetic flux take the given value $\phi$
(determined by the current)
and the magnetic field be zero. In the general case the potential
(\ref{eq:A'}) also satisfies
both these conditions. So it is not astonishing that for potentials with
asymptotics (\ref{eq:A'})
the leading singularity of $\Sigma_{diff}(\omega;\omega_0,\lambda)$, which
is the main quantum mechanical
observable, depends on $\phi$ only.
Note that $\sin (\{\omega,\omega^\prime\}/2)$ and $\sin
(\{\omega,\omega_0\}/2)$ in the formulas
above can be replaced by $ \{\omega,\omega^\prime\}/2 $ and $
\{\omega,\omega_0\}/2 $,
respectively. The results of Theorem~\ref{ABStilde} and
its corollaries generalize the well known formulas (see, e.g.,
\cite{RUI}) for scattering on
the Aharonov-Bohm potential to the case where the function $a(\hat{x})$ is
not constant.
Of course in the case $a(\hat{x})=\alpha$ (then $f(\omega)=\pi\alpha$)
they reduce to these
formulas.
The paper is organized as follows. In Section~3 we give precise definitions
of basic objects.
The structure of the SM is studied in Section~4. Theorem~\ref{ABS} is
proved in Section~5. Finally, in Section~6 we find the diagonal singularity
of the scattering
amplitude (Theorem~\ref{ABStilde}).
\section {Scattering theory}
Although for the pair $H_0=-\Delta$, $ H=(i\nabla+A(x))^2 $ the usual wave
operators exist,
we first treat $A(x)$ as a long-range potential and
consider wave operators
\[
W_\pm = W_\pm(H,H_0;J_\pm ) = s-\lim_{t\rightarrow\pm\infty} e^{iHt} J_\pm
e^{-iH_0t}
\]
with non-trivial ``identifications"
$J_\pm$ (depending on the sign of $t$). This idea first appeared in \cite{IK3}.
The operators $J_\pm$ emerge naturally as PDO with symbols
$j_\pm(x,\xi)$ constructed in terms of approximate eigenfunctions
$\Psi_\pm(x,\xi)=
e^{i\varphi_\pm(x,\xi)}$ of the operator $H$. Substituting
$\Psi=e^{i\varphi}$ in the Schr\"odinger equation $H\Psi=|\xi|^2\Psi$,
we obtain the eikonal equation
\[
|\nabla \varphi|^2-2<A,\nabla\varphi> =|\xi|^2,
\quad \nabla=\nabla_x,
\]
for the phase function $\varphi=\varphi_\pm$. Following \cite{Y3}, we
construct approximate
solutions of this equation by explicit formulas
\begin{equation}\label{eq:E3}
\varphi_\pm(x,\xi)= \langle x,\xi \rangle +\Phi_\pm(x,\xi)
\end{equation}
and
\begin{equation}\label{eq:E7}
\Phi_\pm(x,\xi)= \mp \int_0^\infty
\Bigl( \langle A(x\pm t\xi)- A(\pm t\xi),\xi\rangle\Bigr) dt=\mp \int_0^\infty
\langle A(x\pm t\xi),\xi\rangle dt.
\end{equation}
Note that the last equality is a consequence of the
transversal gauge condition (\ref{eq:H3}).
Then the Schr\"odinger equation
for $\Psi_\pm=e^{i\varphi_\pm}$ is satisfied up to a short-range term off
any neighbourhood of the
direction $\hat{x}=\mp\hat{\xi}$. To be more precise,
\begin{equation}\label{eq:E16}
((i\nabla+A)^2 -|\xi|^2) \Psi_\pm =e^{i\varphi_\pm}q_\pm,
\end{equation}
where
\begin{equation}\label{eq:E16X}
q_\pm=|\nabla \Phi_\pm |^2- \langle A, \nabla \Phi_\pm\rangle+|A|^2 +i{\rm
div}\:A.
\end{equation}
It follows from (\ref{eq:A'}) and (\ref{eq:E7}) that
\begin{equation}\label{eq:Eph}
|\partial^\alpha_x \partial^\beta_\xi \Phi_\pm(x,\xi)| \leq
C_{\alpha,\beta}(\kappa)
(1+|x| )^{ -|\alpha|},
\end{equation}
and hence
\begin{equation}\label{eq:E15}
|\partial^\alpha_x \partial^\beta_\xi q_\pm(x,\xi)| \leq
C_{\alpha,\beta}(\kappa)
(1+|x| )^{-m-|\alpha|},
\end{equation}
where $m=2$, for all multi-indices
$\alpha$, $\beta$ in the region
$\pm\langle\hat{x},\hat{\xi}\rangle\geq \kappa$ for any $\kappa> -1 $.
Here and below we suppose that $|\xi|$ belongs to a compact and disjoint
from zero interval of
${\Bbb R}_+$. This is possible due to the conservation of energy.
Let $\Sigma$ be an open set in the space ${\Bbb R}^d$. Recall that a PDO
$P: C_0^\infty (\Sigma)\rightarrow C^\infty (\Sigma)$ with symbol
$p(\zeta,y)$ is defined by the formula
\begin{equation}\label{eq:PDO}
(P f)(\zeta)=(2\pi)^{-d/2}\int_{{\Bbb R}^d}e^{i \langle \zeta,y\rangle}
p(\zeta,y)\hat{f}(y) dy,
\end{equation}
where $\hat{f}={\cal F} f$ is the Fourier transform of $f$. Here $\zeta$
plays the role of the
space variable and $y$ is the dual one. A symbol
$p(\zeta,y)$ (or a PDO $P$)
belongs to the H\"ormander class $ {\cal S}^n $
if, for all $\alpha$ and $\beta$,
\[
|\partial^\alpha_y \partial^\beta_\zeta p (\zeta,y)| \leq C_{\alpha,\beta}
(1+|y| )^{n-|\alpha|}.
\]
We construct $J_\pm$ as a PDO by the formula
\begin{equation}\label{eq:W1}
(J_\pm f)(x)=(2\pi)^{-1}\int_{{\Bbb R}^2}e^{i \langle x,\xi\rangle
+i\Phi_\pm (x,\xi) }
\sigma_\pm ( \langle\hat{x},\hat{\xi}\rangle)\hat{f}(\xi) d\xi,
\end{equation}
where the cut-off function
$\sigma_\pm\in C^\infty$ is such that $\sigma_\pm(\tau)=1$ near $\pm 1$
and $\sigma_\pm(\tau)=0$
near $\mp 1$. We deliberately ignore here some technical details which can
be found in \cite{Y3}.
For example, strictly speaking, additional cut-offs of low and high
energies by a function
of $ |\xi|^2 $ and of a neighbourhood of $x=0$ by a function of $x$
should be added in
(\ref{eq:W1}) to the symbol
\begin{equation}\label{eq:W1sy}
j_\pm (x,\xi)=e^{ i\Phi_\pm (x,\xi) }
\sigma_\pm ( \langle\hat{x},\hat{\xi}\rangle)
\end{equation}
of the PDO $J_\pm$. Compared to
(\ref{eq:PDO}), $\xi$ and $x$ play in (\ref{eq:W1}) the roles of $\zeta$ and
$y$, respectively. Thus, only the operator $P_\pm={\cal F} J_\pm^\ast
{\cal F}^\ast$
is a PDO with symbol $p_\pm(\xi,x)=
\overline{j_\pm (-x,\xi)}$ in the sense of the definition (\ref{eq:PDO}).
Nevertheless all usual
definitions and results of the PDO theory can be directly applied to the
operators (\ref{eq:W1}).
In particular, according to (\ref{eq:Eph}), the PDO $J_\pm$ belongs to the
class $ {\cal S}^0 $.
Below all PDO acting on functions of $x\in{\Bbb R}^2$ are understood in
the same sense as $J_\pm$.
We note that both wave operators $W_\pm(H,H_0;J_\pm )$ and $W_\pm(H,H_0 )$
exist and
\[
W_\pm(H,H_0;J_\pm )=W_\pm(H,H_0)
\]
(see \cite{LOSTHA} and \cite{Y5}).
However introduction of the auxiliary identifications $J_\pm$ is necessary
to obtain a
representation of the SM in terms of the resolvent $R(z)=(H-z)^{-1}$ of the
operator $H$.
Since the scattering operator ${\bf S}=W_+^\ast W_-$ commutes with $H_0$,
it reduces in the spectral
representation of $H_0$ to the multiplication by the operator-function
$S(\lambda),~\lambda>0,$
acting in the space $ L_2({\Bbb S})$ and known as the SM. Let us construct
the standard
spectral representation of the operator $H_0$. Let
\begin{equation}\label{eq:DV1}
(\Gamma_0(\lambda)f)(\omega)=2^{-1/2} \hat{f}(\lambda^{1/2}\omega)
=2^{-1/2}(2\pi)^{-1}\int_{{\Bbb R}^2}e^{-i\lambda^{1/2}\langle
x,\omega\rangle} f(x) dx,
\quad\omega\in{\Bbb S},
\end{equation}
be, up to the numerical factor, the restriction of $\hat{f} $ to the
circle of radius $\lambda^{1/2}$ and $({\cal
U}f)(\lambda)=\Gamma_0(\lambda)f, ~f\in C_0^\infty ({\Bbb
R}^2),~\lambda>0$. Then the operator ${\cal
U}$ extends by continuity to a unitary operator ${\cal U}:L_2({\Bbb
R}^2)\rightarrow
L_2({\Bbb R}_+;L_2({\Bbb S}))$, and the operator $H_0$ is diagonalized by
$\cal U$, that is
$({\cal U}H_0f)(\lambda)=\lambda\:({\cal U}f)(\lambda)$. This implies that
$({\cal U}{\bf S}
f)(\lambda)= S(\lambda) ({\cal U}f)(\lambda)$.
Let
\begin{equation}\label{eq:TT}
T_\pm = H J_\pm - J_\pm H_0
\end{equation}
be the ``effective perturbation" for the triple $\{H_0,H,J_\pm\}$.
We proceed from the following (see
\cite{IK4, Y3,Y5}) stationary representation
\begin{equation}\label{eq:S2}
S(\lambda)=-2\pi i\Gamma_0(\lambda)\left(J_+^\ast T_-
-T_+^\ast R(\lambda+i0)T_-\right)\Gamma_0^\ast (\lambda)
\end{equation}
for the SM $S(\lambda)$.
To justify it, we need two following analytical results. The first of
them
(the limiting absorption principle; see, e.g., \cite{CFKS,M1})
can easily be obtained by the Mourre method. We use the notation
$\langle x \rangle$ for the
operator of multiplication by the function $\langle x \rangle
=(1+|x|^2)^{1/2}$.
\begin{proposition}\label{PR6}
For any $\gamma>1/2$ the
operator-function $\langle x \rangle^{-\gamma}R(z)\langle x
\rangle^{-\gamma}$ is
continuous in norm with respect to the parameter $z$ in the closed complex
plane cut along
$[0,\infty)$ with exception of the point $0$. In particular, the positive
spectrum
of $H$ is absolutely continuous.
\end{proposition}
We need also more delicate resolvent estimates called usually
propagation estimates. The following assertion was proven in
\cite{J,JMP,M2} using again the Mourre estimate \cite{M1}.
\begin{proposition}\label{PR8}
Let $P_\pm$ be the PDO
with symbol $p_\pm (x,\xi)\in{\cal S}^n$. Suppose that the support of
$p_\pm (x,\xi)$ is contained in the cone
$\mp \langle \hat{x},\hat{\xi}\rangle \geq \varepsilon $
for some $\varepsilon >0$. Then the operator-functions
\begin{equation}\label{eq:PE1}
\langle x\rangle^{\gamma-\beta}P_+^\ast R(z)\langle x\rangle^{-\gamma},
\quad \langle x\rangle^{-\gamma} R(z)P_-\langle x\rangle^{\gamma-\beta},
\quad \gamma>1/2,\; \beta>n+ 1,
\end{equation}
and
\begin{equation}\label{eq:PE2}
\langle x\rangle^\gamma P_+^\ast R(z)P_-\langle x\rangle^\gamma,\quad
\forall \gamma,
\end{equation}
are bounded and continuous in norm with respect to the parameter $z$ in
the region
$\Re z \in(\lambda_0,\infty),\lambda_0 > 0,\; \Im z \geq 0$.
\end{proposition}
We recall also the Sobolev trace theorem.
\begin{proposition}\label{Sob}
The operator $\Gamma_0(\lambda)\langle
x\rangle^{-\gamma}: L_2({\Bbb R}^2)\rightarrow L_2({\Bbb S})$ is compact
for any $\gamma>1/2$.
\end{proposition}
\section {The structure of the scattering matrix}
Let us first find a convenient representation for the operator (\ref{eq:TT}).
The next result follows directly from definition (\ref{eq:W1}), equation
(\ref{eq:E16}) and
estimates (\ref{eq:Eph}), (\ref{eq:E15}).
\begin{proposition}\label{W2}
The operator $T_\pm$ admits the decomposition
$T_\pm=T_\pm^{(s)}+T_\pm^{(r)}$ where $T_\pm^{(s)},T_\pm^{(r)}$ are,
respectively, PDO with symbols
\begin{equation}\label{eq:W6}
t^{(s)}_\pm(x,\xi)=-2 i e^{i\Phi_\pm(x,\xi)}\langle\xi, \nabla
\sigma_\pm( \langle \hat{x},\hat{\xi}\rangle)\rangle
=-2 i e^{i\Phi_\pm(x,\xi)}|x|^{-1} |\xi| (1- \langle
\hat{x},\hat{\xi}\rangle^2)
\sigma_\pm^\prime( \langle \hat{x},\hat{\xi}\rangle)
\in{\cal S}^{-1}
\end{equation}
and $t^{(r)}_\pm\in {\cal S}^{-2}$.
\end{proposition}
We always suppose that the functions $\sigma_\pm$ in (\ref{eq:W1})
satisfy, for some
$\varepsilon\in(0,1/2)$, the relations
\begin{equation}\label{eq:S7}
\sigma_+(\tau)=1 \quad {\rm for}\quad \tau\in [-\varepsilon,1],
\quad
\sigma_+(\tau)=0\quad{\rm for} \quad \tau\in [-1,-2\varepsilon]
\end{equation}
and $\sigma_-(\tau)=\sigma_+(-\tau)$. Then the operators $T_\pm^{(s)}$
satisfy the assumptions
of Proposition~\ref{PR8}. It follows from its assertion about the operators
(\ref{eq:PE1}) that
the operators $ \langle x\rangle^\gamma (T_+^{(s)})^\ast
R(\lambda+i0)T_-^{(r)} \langle
x\rangle^\gamma$ and $ \langle x\rangle^\gamma (T_+^{(r)})^\ast
R(\lambda+i0)T_-^{(s)} \langle
x\rangle^\gamma$ are bounded for $\gamma<1$. The boundedness of the
operator (\ref{eq:PE2})
implies that $ \langle x\rangle^\gamma (T_+^{(s)})^\ast
R(\lambda+i0)T_-^{(s)} \langle
x\rangle^\gamma$ is bounded for any $\gamma$. Finally, the operator $
\langle x\rangle^\gamma (T_+^{(r)})^\ast R(\lambda+i0)T_-^{(r)} \langle
x\rangle^\gamma$ is
bounded for $\gamma<3/2$ by Proposition~\ref{PR6}.
Therefore the operator
\begin{equation}\label{eq:bou}
B_\gamma(\lambda)= \langle x\rangle^\gamma T_+^\ast R(\lambda+i0)T_-
\langle x\rangle^\gamma
\end{equation}
is bounded for any $\gamma<1$. Hence, by Proposition~\ref{Sob}, the operator
\begin{equation}\label{eq:comp}
\Gamma_0(\lambda) T_+^\ast R(\lambda+i0)T_-\Gamma_0^\ast (\lambda)
=\Bigl(\Gamma_0(\lambda) \langle x\rangle^{-\gamma}\Bigr) B_\gamma
(\lambda)\Bigl(\Gamma_0(\lambda)
\langle x\rangle^{-\gamma}\Bigr)^\ast,\quad \gamma\in(1/2,1),
\end{equation}
is compact. Since the operator
$\langle x\rangle J_+^\ast T_-^{(r)} \langle x\rangle$ is bounded,
the operator
$\Gamma_0(\lambda) J_+^\ast T_-^{(r)} \Gamma_0^\ast (\lambda) $
is also compact by Proposition~\ref{Sob}. Thus, we obtain
\begin{proposition}\label{Ts}
Let
\begin{equation}\label{eq:Ts}
S_1(\lambda)=-2\pi i\Gamma_0(\lambda) J_+^\ast T_-^{(s)} \Gamma_0^\ast
(\lambda).
\end{equation}
Then for all $\lambda>0$ the operator
$S(\lambda)-S_1(\lambda)$
is compact.
\end{proposition}
\begin{corollary}\label{Ts1}
The essential spectra of the operators $S(\lambda)$ and $S_1(\lambda)$ are
the same.
\end{corollary}
It follows (see, e.g., \cite{Y5}) from definition (\ref{eq:Ts}) that,
considered as an integral operator, $S_1(\lambda)$ (as well as
the SM $S(\lambda)$ itself) has smooth kernel
$s_1(\omega,\omega^\prime;\lambda)$,
$\omega,\omega^\prime\in{\Bbb S}$, off the diagonal
$\omega =\omega^\prime$.
Therefore its essential spectrum is determined by the diagonal singularity of
$s_1(\omega,\omega^\prime;\lambda)$. Actually, it is more convenient to treat
$S_1(\lambda)$ as a PDO on the unit circle. We fix an arbitrary point
$\omega_0\in{\Bbb S}$ and
consider standard chart coordinates in its neighbourhood
$\Omega\subset{\Bbb S}$.
Let $\Lambda_{\omega_0}$ be the line (identified with ${\Bbb R}$)
orthogonal to $\omega_0$,
and let
$\zeta=\kappa(\omega)$ be the orthogonal projection of $\omega\in\Omega$ on
$\Lambda_{\omega_0}$.
In particular, we assume that
$\kappa(\omega_0)=0$.
We denote by $\Sigma\subset\Lambda_{\omega_0}$ the orthogonal projection of
$\Omega$ and identify
points $\omega\in\Omega$ and $\zeta=\kappa(\omega)\in\Sigma$. Let us also
consider the unitary
mapping $ Z_\kappa~: L_2({\Omega})\to L_2(\Sigma)$ defined by
\begin{equation}\label{eq:U}
\left(Z_\kappa u\right)(\zeta)= (1-|\zeta|^2)^{-1/4}u(\omega).
\end{equation}
We shall see that the operator $S_1^\kappa (\lambda)=Z_\kappa S_1
(\lambda)Z_\kappa^\ast$ is a
PDO defined by formula (\ref{eq:PDO}) for $d=1$ and, up to terms from
the class
${\cal S}^{-1}$, its symbol $p_1^\kappa(\zeta,y)$ is an asymptotically
homogeneous function
$p_0^\kappa(\zeta,y)$ of $y$ of order zero.
The function
$p_0^\kappa(\zeta,y)$ is called the principal symbol of the PDO
$S_1^\kappa(\lambda)$.
It is invariant with respect to diffeomorphisms, which allows one to
define the principal symbol
of the PDO $S_1(\lambda)$ on the cotangent bundle of ${\Bbb S}$ by the
equality
\begin{equation}\label{eq:CB}
p_0(\omega,b)=p_0^\kappa(\zeta,y),\quad |\omega|=1,\quad
\langle\omega,b\rangle=0,
\end{equation}
where $\zeta=\kappa(\omega)$ and $b$ is the orthogonal projection of $y$
on the line
$\Lambda_\omega$. Alternatively, one can say that, for a PDO from the class
${\cal S}^n$, the principal symbol is the full symbol,
considered modulo functions from ${\cal S}^{n-1}$.
In the rest of this section, we shall find an explicit expression for the
principal symbol
of $S_1(\lambda)$. According to definition (\ref{eq:Ts}), we have to
consider first the operator
${\bf G}=J_+^\ast T_-^{(s)}$. Recall that $J_+$ and $ T_-^{(s)}$ are PDO
with symbols
(\ref{eq:W1}) and (\ref{eq:W6}), respectively.
Let us use (see, e.g.,
\cite{Hor3, Sh}) that $J_+^\ast$ is also a PDO with the principal symbol
$\overline{j_+(x,\xi)}$ and
${\bf G}=J_+^\ast T_-^{(s)}$ is a PDO with the principal symbol ${\bf g}_0
(x,\xi)$ which equals
the product of the symbols of PDO $J_+^\ast$ and $ T_-^{(s)}$. It follows
that
\begin{equation}\label{eq:PDOx}
({\bf G} f)(x)=(2\pi)^{-1}\int_{{\Bbb R}^2}e^{i \langle x,\xi\rangle }
{\bf g} (x,\xi)\hat{f}(\xi) d\xi,
\end{equation}
where ${\bf g}\in {\cal S}^{-1}$ and the principal symbol
\begin{equation}\label{eq:W6ab}
{\bf g}_0 (x,\xi)=\overline{j_+(x,\xi)} t_-^{(s)}(x,\xi)
=-2 i e^{i\Theta(x,\xi)}\sigma_+( \langle \hat{x},\hat{\xi}\rangle)
\langle\xi,
\nabla
\sigma_-( \langle\hat{x},\hat{\xi}\rangle)\rangle.
\end{equation}
Here
\begin{equation}\label{eq:Tsa}
\Theta(x,\xi)=\Phi_-(x,\xi)- \Phi_+(x,\xi)=\int_{-\infty}^\infty
\langle A(x+ t\xi) ,\xi\rangle dt
= \int_{-\infty}^\infty
\langle A(\hat{x}+ t\hat{\xi}) ,\hat{\xi}\rangle dt
\end{equation}
according to (\ref{eq:E7}).
At the last step we have used that $A(x)$ is a homogeneous function of
order $-1$, so that the
function
$\Theta(x,\xi)$ is homogeneous of order $0$ in both variables. Note also that
\begin{equation}\label{eq:A2}
\Theta(x,\xi)=- \Theta(x,-\xi).
\end{equation}
Remark now that, due to the function $\nabla\sigma_-(
\langle\hat{x},\hat{\xi}\rangle)$, the symbol (\ref{eq:W6ab}) equals zero
on the
conormal bundle to every circle $|\xi|^2=\lambda$, that is ${\bf
g}_0(x,\xi)=0$ if $x=t\xi$ for
some
$t\in{\Bbb R}$. Therefore we can use the following general result of
\cite{LY} guaranteeing the existence
of the operators $\Gamma_0(\lambda) {\bf G}\Gamma_0^\ast (\lambda)$.
\begin{proposition}\label{LY}
Let ${\bf G}\in {\cal S}^{-1}$ be a PDO defined by formula
$(\ref{eq:PDOx})$, and let
${\bf g}_0$ be its principal symbol. Suppose that
${\bf g}_0 ( t\omega,\lambda^{1/2}\omega )=0$ for all $\omega\in{\Bbb S}$ and
$t\in{\Bbb R}$. Then the operator $G(\lambda)=\Gamma_0(\lambda) {\bf G}
\Gamma_0^\ast (\lambda)$ is well-defined as a bounded operator in the space
$L_2({\Bbb S})$.
Moreover,
$G(\lambda)$ is a PDO on the unit sphere from the class ${\cal S}^0$ with
the principal symbol
given by the absolutely convergent integral
\begin{equation}\label{eq:LY}
g_0( \omega,b;\lambda)=(4\pi)^{-1}\lambda^{-1/2}\int_{-\infty}^\infty {\bf
g}_0(t\omega
-\lambda^{-1/2}b,
\lambda^{1/2}\omega) dt, \quad |\omega|=1,\quad
\langle\omega,b\rangle=0.
\end{equation}
\end{proposition}
Let us apply this result to the operator (\ref{eq:Ts}) and calculate
integral
(\ref{eq:LY}) for the function (\ref{eq:W6ab}). Under assumption
(\ref{eq:S7}) $\sigma_+(
\langle \hat{x},\hat{\xi}\rangle)=1$ on support of $\nabla\sigma_-(
\langle\hat{x},\hat{\xi}\rangle)$, so that the function $\sigma_+(
\langle\hat{x},\hat{\xi}\rangle)$ can be omitted in (\ref{eq:W6ab}). Next
we take
into account that, by definition (\ref{eq:Tsa}),
\[
\Theta(t\omega - \lambda^{-1/2}b,\lambda^{1/2}\omega)=\Theta(- b, \omega).
\]
Since
\begin{eqnarray*}
\int_{-\infty}^\infty \langle\omega,\nabla\sigma_-(\langle \frac{t\omega -
\lambda^{-1/2}b}{|t\omega -
\lambda^{-1/2}b|},\omega\rangle)\rangle dt&=&\int_{-\infty}^\infty
\frac{\partial}{\partial t}
\sigma_-(\frac{t}{( t^2+\lambda^{-1}b^2)^{1/2}}) dt
\\
&=& \sigma_-(1)- \sigma_-(-1)=-1,
\end{eqnarray*}
we arrive at the following conclusion.
\begin{proposition}\label{SP}
The operator $S_1(\lambda)$ is a PDO on the unit sphere with the principal
symbol
\[
p_0( \omega,b )= e^{i\Theta(- b,\omega)},
\quad |\omega|=1,\quad
\langle\omega,b\rangle=0.
\]
\end{proposition}
We emphasize that $p_0( \omega,b )$ does not depend on $\lambda$.
Let us calculate the integral (\ref{eq:Tsa}). Recall that the function $f
$ was defined by
formula (\ref{eq:s0b4}).
\begin{lemma}\label{A1}
Suppose that $\hat{b}$ is obtained from
$\omega$ by rotation at angle $\mp\pi/2$. Then
\begin{equation}
\Theta(b,\omega)= \pm f (\pm \omega).
\label{eq:Thg}
\end{equation}
\end{lemma}
{\it Proof.} --
By virtue of (\ref{eq:A2}), it suffices to consider the case of the upper
sign. Let $\omega=(\omega_1,\omega_2)$, $\hat{b}=(\hat{b}_1, \hat{b}_2)$ and
$\theta_t=(\hat{b}+t\omega)|\hat{b}+t\omega|^{-1}$. Below we identify the
points $\theta$ on the
unit circle with the angle between $\theta$ and $\hat{b}$. Then
$\tan\theta_t=t$. Since
$-\omega_1\hat{b}_2+\omega_2\hat{b}_1=1$, we have that for the potential
(\ref{eq:A'})
$$<A (\hat{b}+t\omega),\omega>=a(\theta_t)(t^2+1)^{-1}.$$
Plugging this expression into
(\ref{eq:Tsa}) and making the change of variables $t=\tan \theta$, we
get formula (\ref{eq:Thg}).$\quad\Box$
Thus, we arrive at
\begin{theorem}\label{SPX}
The operator $S_1(\lambda)$ is a PDO on the unit sphere with the
principal symbol
\begin{equation}\label{eq:SPX}
p_0( \omega,b )= e^{\pm if(\pm \omega)},
\quad |\omega|=1,\quad
\langle\omega,b\rangle=0,
\end{equation}
if $\hat{b}$ is obtained from
$\omega$ by rotation at angle $\pm\pi/2$.
\end{theorem}
\section {The proof of theorem~1.1}
We can now describe the essential spectrum of the SM. Below we need the
following result which
can be checked by a direct calculation.
\begin{lemma}\label{calc}
Let $P$ be a PDO on $L_2({\Bbb R})$ with an asymptotically homogeneous
symbol $p(\zeta,y)$ of order
zero such that $p(\zeta,y)=p_\pm(\zeta )$ for sufficiently large $\pm y$. Set
\begin{equation}\label{eq:corr1}
v_{\varepsilon,\tau}^{(\pm)}(\zeta)= \varepsilon^{-1/2}
g(\zeta/\varepsilon)e^{\pm i\tau\zeta},
\quad \hat{g}\in C_0^\infty({\Bbb R}).
\end{equation}
Then
%\begin{equation}\label{eq:corr2}
\[
\left( P v^{(\pm)}_{\varepsilon,\tau}\right)(\zeta) = p_\pm(\zeta )
v^{(\pm)}_{\varepsilon,\tau}(\zeta),
\]
if $\varepsilon\in(0,1)$ and $\varepsilon\tau$ is large enough.
\end{lemma}
It follows from (\ref{eq:CB}) and
(\ref{eq:SPX}) that the principal symbol
of the PDO $S_1^\kappa (\lambda)=Z_\kappa S_1 (\lambda)Z_\kappa^\ast$ is
given by
\begin{equation}\label{eq:B1}
p^\kappa_0 ( \zeta,y ) =e^{-if(-\omega)}h_0(y)+e^{if(\omega)}h_0(-y),
\end{equation}
where $h_0\in C^\infty({\Bbb R} )$, $h_0(y)=1$ for sufficiently large
$y$ and $h_0(y)=0$ for sufficiently large $-y$. Note that $S_1^\kappa
(\lambda)$ differs from the
PDO $S_0^\kappa$ with full symbol (\ref{eq:B1}) by a compact term.
Let $\mu^{(\pm)}=e^{\mp if (\mp\omega_0)}$ for some $\omega_0\in{\Bbb
S}$. We shall first
construct a Weyl sequence for the point $\mu^{(\pm)}$ and the operator
$S_0^\kappa$.
Clearly, the functions (\ref{eq:corr1}) tend weakly to zero as
$\varepsilon\to 0$ uniformly in
$\tau\in{\Bbb R}$ and $\|v^{(\pm)}_{\varepsilon,\tau}\|=\| g \|$. Let us set
\[
u^{(\pm)}_{\varepsilon}(\zeta)=\varphi(\zeta)
v^{(\pm)}_{\varepsilon,\varepsilon^{-2}}(\zeta),
\]
where $\varphi\in C_0^\infty (\Sigma)$ and $\varphi (0)=1$. It can be
easily deduced from
Lemma~\ref{calc} that
\begin{equation}\label{eq:WWS}
\lim_{\varepsilon\rightarrow 0}\left\|S_0^\kappa u^{(\pm)}_{\varepsilon
}-\mu^{(\pm)}
u^{(\pm)}_{\varepsilon }\right\|= 0.
\end{equation}
The same relation is of course true also for the operator $S_1^\kappa
(\lambda)$.
Since $s_1(\omega,\omega^\prime;\lambda)$ is a smooth function for
$\omega\neq\omega^\prime$, we
have that
\begin{equation}\label{eq:WSS}
\lim_{\varepsilon\rightarrow 0} (I-\chi_\Omega)S_1 (\lambda) Z_\kappa^\ast
u^{(\pm)}_{\varepsilon
} = 0
\end{equation}
($\chi_\Omega$ is the characteristic function of $\Omega$).
Therefore, comparing (\ref{eq:WWS}) and (\ref{eq:WSS}), we see that
$Z_\kappa^\ast
u^{(\pm)}_\varepsilon$ is the
Weyl sequence for the point $\mu^{(\pm)}$ and the operator $S_1(\lambda)$.
This implies that
$\mu^{(\pm)} \in\sigma_{ess}(S_1 (\lambda))$ and hence, by Corollary~\ref{Ts1},
$\mu^{(\pm)} \in\sigma_{ess}(S (\lambda))$.
Let us prove, on the contrary, that $\sigma_{ess}(S_1(\lambda))$ is contained
in the right-hand side
of (\ref{eq:Spess}). Suppose that
$\mu_0\neq e^{\pm i f (\pm\omega)}$ for all $\omega\in{\Bbb S}$ (and both
signs ``$\pm$").
Let ${\cal R}(\mu_0)$ be a PDO on the unit circle with the principal
symbol
\begin{equation}\label{eq:R}
\rho ( \omega,b)= (e^{\pm i f (\pm\omega)}-\mu_0 )^{-1},\quad
|\omega|=1,\quad
\langle \omega,b\rangle =0,
\end{equation}
if $\hat{b}$ is obtained from
$\omega$ by rotation at angle $\pm\pi/2$. Since $\rho\in{\cal S}^0 $, the
operator
${\cal R}(\mu_0)$ is bounded in $L_2({\Bbb S})$.
Comparing (\ref{eq:SPX} ) and (\ref{eq:R}), we see that
the principal
symbol of the product ${\cal R}(\mu_0)(S_1(\lambda)-\mu_0 I)$ equals
$1$. It follows that
\begin{equation}\label{eq:calR}
{\cal R}(\mu_0)(S_1(\lambda)-\mu_0 I )= I+ K,
\end{equation}
where $K$ is a compact operator on $L_2({\Bbb S})$. Now suppose that there
exists a sequence $u_n$
such that
\begin{equation}\label{eq:suite}
\|u_n\|=1,\quad w-\lim_{n\to\infty}u_n=0, \quad
\lim_{n\to\infty}\|S_1(\lambda)u_n-\mu_0 u_n\|=0.
\end{equation}
Using (\ref{eq:calR}), we get the estimate
$$\|u_n\|\le \|{\cal R}(\mu_0)\| \|S_1(\lambda)u_n-\mu_0 u_n\|+
\|Ku_n\|,$$
which contradicts (\ref{eq:suite}). This concludes the proof of
Theorem~\ref{ABS}.
\section {The diagonal singularity
\newline of the scattering amplitude}
Our final goal is to find explicitly the leading diagonal singularity of
the kernel ${\rm
s}(\omega,\omega^\prime;\lambda)$ of the SM
$S(\lambda)$. To that end, we need to construct better approximate
solutions of the Schr\"odinger equation than those of Section~3, using
additionally (see
\cite{Y3,Y5}) the transport equation. Let the functions $\varphi_\pm$,
$\Phi_\pm$ and
$q_\pm$ be defined by equalities (\ref{eq:E3}),
(\ref{eq:E7}) and (\ref{eq:E16X}), respectively. Set
%\begin{equation}\label{eq:AB10}
\[
g_\pm(x,\xi)= 1 \mp 2^{-1}i\int_0^\infty q_\pm(x\pm
t\xi,\xi)dt
\]
and $\Psi_\pm(x,\xi)= e^{i \varphi_\pm(x,\xi)} g_\pm(x,\xi)$. Then
equation (\ref{eq:E16}) is
satisfied with the corresponding functions
$q_\pm$ obeying estimates
(\ref{eq:E15}) for $m=3$.
Let now $J_{\pm}$ be the PDO with symbol (cf. (\ref{eq:W1sy}))
\begin{equation}\label{eq:jnew}
j_\pm(x,\xi)=e^{i\Phi_\pm(x,\xi)}g_\pm(x,\xi)\sigma_\pm(\langle
\hat{x},\hat{\xi}\rangle),
\end{equation}
and let $T_\pm$ be the operator (\ref{eq:TT}). Then
Proposition~\ref{W2} is true with $t_\pm^{(r)}\in{\cal S}^{-3}$.
Of course, the representation (\ref{eq:S2}) for the SM
$S(\lambda)$ remains valid for this choice of $J_{\pm}$. Using
Propositions~\ref{PR6} and
\ref{PR8},
we can show that now the operator (\ref{eq:bou}) is bounded for any
$\gamma<3/2$.
It follows from (\ref{eq:DV1}) that kernel of the operator (\ref{eq:comp})
equals
\[
\tilde{s}(\omega,\omega^\prime;\lambda)=2^{-1} (2\pi)^{-2}(B_\gamma(\lambda)
u_{\omega^\prime}(\lambda), u_{\omega}(\lambda)), \quad \gamma \in(1,3/2),
\]
where $ u_{\omega}(x;\lambda)=\langle
x\rangle^{-\gamma}e^{i\lambda^{1/2}\langle x,\omega\rangle}$.
Since for $\gamma >1$, these functions are continuous in the space
$L_2({\Bbb R}^2)$ with respect
to
$\omega\in {\Bbb S}$, the kernel $\tilde{s}(\omega,\omega^\prime;\lambda)$
is a continuous
function of $\omega$ and $\omega^\prime$. Quite similarly, the continuity
of the kernel of the
operator
$\Gamma_0(\lambda) J_+^\ast T_-^{(r)}\Gamma_0^\ast (\lambda)$ follows
directly from
the boundedness of the operator $\langle x\rangle^{3/2} J_+^\ast
T_-^{(r)}\langle x\rangle^{3/2}$.
Thus, we obtain
\begin{proposition}\label{61}
Let $J_{\pm}$ be the PDO with symbol $(\ref{eq:jnew})$, and let
$S_1(\lambda)$ be the
operator $(\ref{eq:Ts})$. Then for all $\lambda>0$ the operator
$S(\lambda)-S_1(\lambda)$ has
continuous kernel.
\end{proposition}
Hence, to prove
Theorem~\ref{ABStilde}, it remains to find
the diagonal singularity of the operator $S_1(\lambda)$.
As in the previous section, we consider first the operator
$S_1^\kappa(\lambda)=Z_\kappa
S_1 (\lambda) Z_\kappa^\ast$ acting on functions from the class $
C_0^\infty (\Sigma)$,
$\Sigma\subset{\Bbb R}$. Since
\[
\int_0^\infty e^{ iy\zeta}dy= \pi \delta(\zeta)+ i{\rm P.V.} \zeta^{-1},
\]
the kernel of the operator $S_0^\kappa$ with symbol
(\ref{eq:B1}) equals (up to smooth terms)
\begin{eqnarray}\label{eq:hea}
s_0^\kappa(\zeta,\zeta^\prime)=(2\pi)^{-1}\int _{-\infty}^\infty e^{i
(\zeta -\zeta^\prime)y }
p^\kappa_0 ( \zeta,y ) dy
\nonumber \\ =
2^{-1}\Bigl(e^{i f(\omega)}+e^{-i
f(-\omega)}\Bigr) \delta(\zeta-\zeta^\prime) + (2 \pi i)^{-1} \Bigl(e^{i
f(\omega)}- e^{-i
f(-\omega)}\Bigr) {\rm P.V.}(\zeta-\zeta^\prime)^{-1}.
\end{eqnarray}
The symbol $p_1^\kappa(\zeta,y)-p_0^\kappa(\zeta,y)$ of the operator
$S_1^\kappa(\lambda)-S_0^\kappa$ belongs to the class
${\cal S}^{-1}$ and therefore its kernel is bounded by
$|\ln|\zeta-\zeta^\prime|\,|$. This implies that
\begin{equation}\label{eq:B4}
s_1^\kappa(\zeta,\zeta^\prime;
\lambda)=s_0^\kappa(\zeta,\zeta^\prime)+O(|\ln|\zeta-\zeta^\prime|\,|).
\end{equation}
Next, we remark that, according to (\ref{eq:U}), the
kernels of the operators
$ S_1(\lambda) $ and $S_1^\kappa(\lambda)$ are related by the
equality
\[
s_1(\omega,\omega^\prime;\lambda)= s^\kappa_1(\zeta,\zeta^\prime;\lambda)
(1-|\zeta|^2)^{1/4}(1-|\zeta^\prime|^2)^{1/4}, \quad
\omega,\omega^\prime\in\Omega.
\]
Making this change of variables in (\ref{eq:hea}) and using (\ref{eq:A4}), we
obtain the kernel (\ref{eq:SAB}).
Finally, we take into account estimate (\ref{eq:B4}) and
Proposition~\ref{61}.
This proves Theorem~\ref{ABStilde}.
\begin{thebibliography}{99}
\bibitem {AB} Aharonov Y and Bohm D 1959 Significance of electromagnetic
potential in the quantum
theory {\it Phys. Rev.} {\bf 115} 485-491.
\bibitem{CFKS} Cycon H, Froese R, Kirsch W and Simon B 1987 {\it
Schr\"odinger operators with
application to quantum mechanics and global geometry} (Springer-Verlag).
\bibitem{Hen} Henneberger W C 1980 Some aspects of the Aharonov-Bohm
effect {\it Phys. Rev. A} {\bf
22} 1383-1388.
\bibitem {Hor3} H\"ormander L 1985 {\it The Analysis of Linear Partial
Differential Operators} III
(Springer-Verlag).
\bibitem {IK3} Isozaki H and Kitada H 1985 Modified wave operators with
time-independent modifies
{\it J. Fac. Sci. Univ. Tokyo} {\bf 32} 77-104.
\bibitem {IK4}Isozaki H and Kitada H 1986 Scattering matrices for two-body
{S}chr\"odinger
operators {\it Sci. Papers College Arts Sci. Univ. Tokyo}
{\bf 35} 81-107.
\bibitem {J} Jensen A 1985 Propagation estimates for Schr\"odinger-type
operators {\it Trans. Amer.
Math. Soc.} {\bf 291} 129-144.
\bibitem {JMP} Jensen A, Mourre E and Perry P 1984 Multiple commutator
estimates and resolvent
smoothness in quantum scattering theory {\it Ann. Inst. Henri Poincar\'e,
Phys. th\'eor.} {\bf 41}
207-225.
\bibitem {LY} Lerner N and Yafaev D R 1998 Trace theorems for
pseudo-differential operators {\it
J. Analyse Math.} {\bf 74} 113-164.
\bibitem {LOSTHA} Loss M and Thaller B 1987 Scattering of particules by
long-range magnetic fields
{\it Ann. Phys.} {\bf 176} 159-180.
\bibitem {M1} Mourre E 1980/81 Absence of singular continuous spectrum for
certain selfadjoint
operators {\it Comm. Math. Phys.} {\bf 78} 391-408.
\bibitem {M2} Mourre E 1983 Op\'erateurs conjugu\'es et propri\'et\'es de
propagation {\it Comm.
Math. Phys.} {\bf 91} 279-300.
\bibitem{RUI} Ruijsenaars S N M 1983 The Aharonov-Bohm effect and
scattering theory {\it Ann.
Phys.} {\bf 146} {1-34}.
\bibitem {Sh} Shubin M A 1987 {\it Pseudodifferential Operators and
Spectral Theory}
(Springer-Verlag).
\bibitem {Y3} Yafaev D R 1998 The scattering amplitude for the
Schr\"odinger equation with a
long-range potential {\it Comm. Math. Phys.} {\bf 191} 183-218.
\bibitem {Y5} Yafaev D R 2000 {\it Scattering theory: some old and new
problems}, Lecture Notes
Math. {\bf 1735} (Springer-Verlag).
\end{thebibliography}
\end{document}
|
https://melusine.eu.org/syracuse/B/BaseCollege/Quatrieme/thales/appli/exo37.tex?enregistrement=ok | eu.org | CC-MAIN-2021-21 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-21/segments/1620243991537.32/warc/CC-MAIN-20210513045934-20210513075934-00131.warc.gz | 405,604,531 | 1,064 | %@metapost:4thalesexo37.mp
\og La croix de bûcheron\fg\ est un instrument permettant de
déterminer rapidement la hauteur d'un arbre. On l'utilise de la façon
suivante :
\[\includegraphics{4thalesexo37.1}\]
{\em La figure n'est pas en vraie grandeur.}\\
N'ayant pas besoin d'une précision importante sur la hauteur de
l'arbre, on suppose que la longueur $B'D'$ est la hauteur de l'arbre.
\\On donne les mesures suivantes : $KN=15$~cm; $LK=10$~cm; $KM=1,5$~cm
et $B'N=27$~m.
\\Détermine alors \og la hauteur de l'arbre\fg\ $B'D'$. |
https://fisica.cab.cnea.gov.ar/bt/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%20FROM%20refs%20WHERE%20serial%20%3D%20556%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=10&rowOffset=&wrapResults=1&citeOrder=&citeStyle=Chicago&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | cnea.gov.ar | CC-MAIN-2022-33 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2022-33/segments/1659882571536.89/warc/CC-MAIN-20220811224716-20220812014716-00185.warc.gz | 250,795,112 | 1,230 | %&LaTeX
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Daudin1981} Daudin, B. "Thermal conductivity of amorphous La70Cu30." \textit{Solid State Communications} 37, no. 2 (1981): 149--152.
\end{thebibliography}
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=55188&type=tex | zentralblatt-math.org | CC-MAIN-2019-39 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-39/segments/1568514573105.1/warc/CC-MAIN-20190917181046-20190917203046-00286.warc.gz | 1,025,829,468 | 1,168 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2004d.03676}
\itemau{Vollrath, Hans-Joachim}
\itemti{Geometric surveys with a surveying table. (Landvermessung mit einem Messtisch.)}
\itemso{Math. Lehren, No. 124, 20-22, 47-48 (2004).}
\itemab
Anhand von historischen Beispielen werden die klassischen Grundaufgaben der Landvermessung vorgestellt. Diese Aufgaben k\"onnen mithilfe eines Messtisches konstruktiv gel\"ost werden. Ein einfacher Messtisch l\"asst sich nach historischem Muster leicht selbst basteln. Mit ihm k\"onnen Sch\"ulerinnen und Sch\"uler konkrete Vermessungen im Gel\"ande vornehmen und damit die gelernte Geometrie anwenden.
\itemrv{~}
\itemcc{M53 G43 D83}
\itemut{mathematical instruments}
\itemli{}
\end |
https://www.chrisstucchio.com/work/resume.tex | chrisstucchio.com | CC-MAIN-2021-21 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2021-21/segments/1620243991829.45/warc/CC-MAIN-20210514214157-20210515004157-00338.warc.gz | 733,336,349 | 5,855 | %% start of file `template_en.tex'.
%% Copyright 2007 Xavier Danaux ([email protected]).
%
% This work may be distributed and/or modified under the
% conditions of the LaTeX Project Public License version 1.3c,
% available at http://www.latex-project.org/lppl/.
\documentclass[11pt,a4paper]{moderncv}
%\usepackage{hyperref}
% moderncv themes
\moderncvtheme[green]{casual} % optional argument are 'blue' (default), 'orange', 'red', 'green', 'grey' and 'roman' (for roman fonts, instead of sans serif fonts)
%\moderncvtheme[green]{classic} % idem
% character encoding
\usepackage[utf8]{inputenc} % replace by the encoding you are using
% adjust the page margins
\usepackage[scale=0.8]{geometry}
\recomputelengths % required when changes are made to page layout lengths
% personal data
\firstname{Chris}
\familyname{Stucchio}
%\title{Resumé title (optional)} % optional, remove the line if not wanted
%\address{170 W 74th St, Apt 1212}{NY, NY 10023} % optional, remove the line if not wanted
%\mobile{646.926.7840}
\email{[email protected]} % optional, remove the line if not wanted
\extrainfo{https://github.com/stucchio}
% optional, remove the line if not wanted
%\photo[64pt]{picture} % '64pt' is the height the picture must be resized to and 'picture' is the name of the picture file; optional, remove the line if not wanted
%\quote{"They can kill you, but the legalities of eating you are quite a bit dicier" - David Foster Wallace} % optional, remove the line if not wanted
%\nopagenumbers{} % uncomment to suppress automatic page numbering for CVs longer than one page
%----------------------------------------------------------------------------------
% content
%----------------------------------------------------------------------------------
\begin{document}
\maketitle
\section{Profile}
I'm a product-focused data science and engineering leader. I focus on turning business problems into engineering problems and using data to inform strategy. My ideal role will be hands-on leadership, focused more on mentoring and strategy than day to day management.
See also my github (\link{https://github.com/stucchio}) and blog (\link{https://chrisstucchio.com}).
\section{Experience}
\cventry{2017-2020}{GetSimpl Technologies}{Director of Data Science}{Bangalore, India}{}{
Simpl is a mobile-first lending startup for thin file/no file customers. I led the data science and engineering team, primarily focused on credit risk, fraud prevention, as well as all the engineering details of owning a data science platform.
\newline
- Built alternative-data ML-based underwriting system currently responsible for 80\% of new user growth. This system reduced delinquency from unsustainable levels to cohort level profitability.
\newline
- Reduced fraud from existential threat to a tertiary concern. Built automated fraud prevention systems and created policies to improve merchant underwriting.
\newline
- Designed and implemented data platform which enables rapid experimentation and analysis. More than half of our A/B tests go from conception to production in under a week.
\newline
- Tech stack: Python/Pandas/Spark/Dask for offline analysis. Scala/Akka for high performance services.
}
\cventry{2014-2015}{Wingify/VWO}{Consultant}{USA, India}{}{}
\cventry{2015-2017}{Wingify (VWO/Pushcrew)}{Director of Data Science}{NY, USA and Pune, India}{}{
Led a team of data scientists and engineers focused on data science and highly performance infrastructure. Communicated and evangelized the importance of statistics to customers and prospects.
\newline
- I designed and architected SmartStats, VWO's new Bayesian A/B testing engine. Prior to SmartStats, A/B testing on the web was broken. The statistics were often calculated incorrectly and virtually always misinterpreted. SmartStats adjusts the statistics to match the way humans use them and fixes these problems.
\newline
- Built a behavioral targeting system for push notifications and site modifications.
\newline
- Worked as temporary engineering manager of PushCrew (Wingify's push notification product), focusing on engineering best practices. Used statistical techniques to improve delivery and click through rates of push notifications, giving PushCrew the highest delivery rates in the industry.
\newline
- Led backend engineering team focused on high performance systems. I sped up our push notifications by a factor of ~1000, built high performance data collectors, etc. (Most of this work done with Scala/Akka.)
}
\cventry{2013-2015}{Independent Consultant}{}{USA, UK, India}{}{
Consultant for a variety of clients in the legal, financial and e-commerce spaces. More interesting projects include:
\newline
- Forensic accounting, analyzing equity and options trades in search of criminal and tortious activity. Modeling price impact and analyzing regulatory compliance.
\newline
- Consumer credit underwriting. I did analysis and implementation of microfoundation-based macroeconomic models in order to perform macroeconomic modelling beyond the regime of historical data, as well as exploratory work building data systems in Scala.
\newline
- Design and analysis of Bayesian algorithms for improving product discovery on e-commerce sites.
}
\cventry{2012-2013}{Patch}{Senior Software Engineer}{NY, NY}{}{
I taught Patch about data driven decisions. I introduced A/B testing and brought it to the forefront of Patch engineering culture. I was also the primary architect on the realtime monitoring and recommendation system that powered Patch's content selection. Primary technologies used were Scala, Akka and Hadoop.
\newline
- Designed realtime Bayesian recommendation system, generating an 120\% increase in Click Through Rate. (Biggest lift to site traffic of all major initiatives at that time.)
\newline
- Built behavioral spam filtering system which blocked spammers based on site behavior.
\newline
- Built funnel tracking system, discovering numerous bottlenecks in the creation of User Generated Content.
\newline
- Major contributions to backend infrastructure. Made the site hundreds of milliseconds faster and drove major data migration while deleting more code than I added. Received ``Green Monster'' (best individual contributor) award for this.
\newline
}
\cventry{2011-2012}{Styloot}{CTO/Principal}{NY, NY and Pune, India}{}{
Designed and built \href{http://styloot.com}{Styloot}, a visual search engine for women's fashion. Users can take a photograph of a fashion item with the iPhone app and Styloot will find similar items for them to purchase. This was done using an expert systems style ontology, together with a custom semantic search engine.
\newline
- Performed experiments on women's perception to determine what features are important in fashion search. E.g., although visually different, a ``sweetheart neckline'' and a ``deep V-neck'' are perceived as similar by women.
\newline
- Designed/managed workflows for human taggers/ontologists.
\newline
- Managed a technology team of 3 people as well as a staff of human oracles.
}
\cventry{2010-2011}{Mesh Capital}{Quantitative Trader}{Jersey City, NJ}{}{
Devised and implemented strategies for high frequency trading. Designed a global predictive strategy using activity in high volume stocks to predict price movements of low volume stocks. Micro-optimized various system components to reduce latency during high volume periods. Devised dynamic portfolio rebalancing strategy to reduce risk and increase profits. All work done in Java.
}
\section{Skills}
\cventry{}{Analytical Skills}{}{Credit underwriting (alternative data), conversion rate optimization, time series analysis, Bayesian decision theory}{}{}
\cventry{}{Technical}{}{Python, Scala, Java, Emacs Lisp. I haven't used C++, Haskell or Julia in a long time but I'd love to use them again}{}{}
\cventry{}{Topics for conversation}{}{why I love Dask and hate Spark, the importance of a utility function, why ethical decisionmaking is ``impossible'', why I want data scientists to be good engineers.}{}{}
\section{Education}
\cventry{2007--2010}{New York University}{Postdoctoral Scholar, Mathematics}{}{NY, NY}{Studied applications of computational harmonic analysis in image reconstruction (specifically Magnetic Resonance Imaging). Developed new numerical algorithms for solving wave equations, focused primarily on non-rectangular computational grids in phase space. }
\cventry{2002-2008}{Rutgers University}{Ph.D., Mathematics}{}{Piscataway, NJ}{Thesis work in computational harmonic analysis of partial differential equations, nonlinear optics, and foundations of quantum mechanics.}
\cventry{2000-2002}{Stevens Institute of Technology}{B.S. Mathematics and Physics}{}{Hoboken, NJ}{}
\section{Talks (Selected)}
\cventry{2019}{Fifth Elephant}{The Final Stage of Grief (about bad data) is Acceptance}{}{Bangalore, India}{}{}
\cventry{2018}{Crunch Conf}{AI Ethics, Impossibility Theorems and Tradeoffs}{}{Budapest, Hungary}{}{}
\cventry{2018}{Fifth Elephant}{Bayesian Linear Regression and Generalized Linear Models}{}{Bangalore, India}{}{}
\cventry{2018}{50p Fintech Conf.}{Low Rate Loans for Ladies, Stags Pay Extra: The Role of Ethics in AI/ML}{}{Bangalore, India}{}{}
\cventry{2015}{Crunch Conf}{Multiple Comparisons: Make Your Boss Happy with False Positives}{}{Budapest, Hungary}{}{}
\cventry{2014}{Pune Scala Symposium}{Number Crunching in Scala}{}{Pune, India}{}{}
\cventry{2008}{Wolfgang Pauli Institute}{}{}{Vienna, Austria}{}{}
\cventry{2007}{University of Chicago Applied Mathematics Seminar}{}{}{Chicago, IL}{}{}
\cventry{2007}{SIAM Conference on Dynamical Systems}{}{}{Snowbird, UT}{}{}
\cventry{2007}{Princeton Mathematical Physics Seminar}{}{}{Princeton, NJ}{}{}
\closesection{} % needed to renewcommands
% PUBLICATIONS
\nocite{us:waveCollapsedoesntMatter, us:TDPSFjcp, us:TDPSFrigorous, us:multiscale, us:anisotropic, us:solitongun, us:dipoledelta, us:ionizationPRL, us:dirichleterrorbound, barak:153901, meleslie:wavefrontPaper, meleslie:curveppaer, stucchiomahapatra:aibias}
\bibliographystyle{abbrv}
\bibliography{/mnt/c/Users/stucc/Dropbox/Documents/my_papers/stucchio}
\cventry{}{Author of \url{www.chrisstucchio.com}, a widely read blog.}{}{}{}{Referenced by the Huffington Post, National Review, Reuters, Business Insider, and MarginalRevolution.com (among others).}{ }
\renewcommand{\listitemsymbol}{-} % change the symbol for lists
% Publications from a BibTeX file
\end{document}
%% end of file `template_en.tex'.
|
https://gitlab.s1.0x39b.fr/freyja/trans-cec/raw/main/mysite/pdfgenerator/templates/pdfgenerator/latex/procuration_conciliateurcpam.tex | 0x39b.fr | CC-MAIN-2021-43 | text/plain | application/x-tex | crawl-data/CC-MAIN-2021-43/segments/1634323585653.49/warc/CC-MAIN-20211023064718-20211023094718-00300.warc.gz | 377,102,213 | 4,085 | \documentclass[12pt,origdate]{lettre}%
\usepackage[utf8x]{inputenc}
\usepackage[french]{babel}
%\usepackage[T1]{fontenc}
%\usepackage{mltex}
\newcommand{\ChangementPrenom}{ {{- cleaned_data["changementprenom"] -}} } % 0 = oui 1 = non
\newcommand{\ChangementCivilite}{ {{- cleaned_data["changementcivilite"] -}} } % 0 = oui 1 = non
%-------------------------------------------------------------------------
% Partie sur le. procurant.e
%-------------------------------------------------------------------------
% Mettre ici le prenom de la personne faisant la procuration
% et entre les {} le nom de famille
\newcommand{\ProcurantId}{ {{- cleaned_data["procurantfirstname"] -}} {} \textsc{ {{- cleaned_data["procurantlastname"] -}} }}
% Mettre ici la suite des pr\'{e}noms de la personne faisant la procuration
% et entre les {} le nom de famille
\newcommand{\ProcurantFullId}{ {{- cleaned_data["procurantlistofname"] -}} {} \textsc{ {{- cleaned_data["procurantlastname"] -}} } }
% Mettre ici le num\'{e}ro de t\'{e}l\'{e}phone de la personnne faisant la
% procuration
\newcommand{\ProcurantTel}{ {{- cleaned_data["procuranttelephone"] -}} }
% Mettre ici le num\'{e}ro, le type de voie et le nom de la voie
% de la personne faisant la procuration
\newcommand{\ProcurantAddresseRue}{ {{- cleaned_data["procurantaddress1"] -}} }
% Mettre ici le code postal (les 2 premiers chiffres avant le ~)
% et entre {} le nom de la ville
\newcommand{\ProcurantAddresseVille}{ {{- cleaned_data["procurantaddress2"] -}} }
% Ne pas toucher
\newcommand{\ProcurantAddressFull}{\ProcurantId\\\ProcurantAddresseRue\\\ProcurantAddresseVille}
% Mettre entre {} le nom de la ville où est r\'{e}dig\'{e}e la procuration
\newcommand{\ProcurantLocation}{\textsc{ {{- cleaned_data["procurantlocation"] -}} }}
% Mettre ici l'adresse mail de la personne faisant la procuration
\newcommand{\ProcurantEmail}{ {{- cleaned_data["procurantemail"] -}} }
% Mettre ici le nom du d\'{e}partement où habites la personne
% cela est utilis\'{e} pour la caisse de CPAM dont elle d\'{e}pend
\newcommand{\ProcurantDepartement}{ {{- cleaned_data["procurantdepartement"] -}} }
% Mettre ici la date de naissance de la personne faisant la procuration
\newcommand{\ProcurantDOB}{ {{- cleaned_data["procurantdob"] -}} }
% Mettre ici la ville de naissance et entre () le d\'{e}partement de
% naissance de la personne faisant la procuration
\newcommand{\ProcurantPOB}{ {{- cleaned_data["procurantpob"] -}} }
% Malheureusement, pour des raisons d'idenfication, il faut mettre
% le deadname de la personne faisant la procuration et son nom de
% famille
\newcommand{\ProcurantOldId}{ {{- cleaned_data["procurantdeadname"] -}} {} \textsc{ {{- cleaned_data["procurantlastname"] -}} }}
% Mettre ici le num\'{e}ro de s\'{e}curit\'{e} sociale de la personne faisant
% la procuration
\newcommand{\ProcurantSecu}{ {{- cleaned_data["procurantss"] -}} }
% Mettre ici le nom de la ville dont la personne faisant la
% procuration d\'{e}pend d'un point de vue des imp\^{o}ts
\newcommand{\ProcurantImpots}{Ville du centre des impots}
% Mettre ici le num\'{e}ro fiscal de la personne faisant la procuration
\newcommand{\ProcurantFiscal}{num\'{e}ro fiscal}
% Mettre ici le type d'accord souhait\'{e} pour la personne faisant
% la procuration.
% 0 = femme trans
% 1 = homme trans
\newcommand{\ProcurantGender}{ {{- cleaned_data["procurantgender"] -}} } % 0 = femme, 1 = homme
% Mettre ici le nom de l'\'{e}cole/universit\'{e}/autre \`{a} laquelle la demande
% de rectification et d'information est demand\'{e}e
\newcommand{\ProcurantEcole}{Nom de l'\'{e}cole}
% Mettre ici le nom de la banque de la personne faisant la procuration
\newcommand{\ProcurantBanque}{Nom de la banque}
% Mettre ici le nom de l'entreprise \`{a} laquelle la personne faisant
% la procuration veut faire un changement
\newcommand{\ProcurantEntreprise}{Nom de l'entreprise}
% Mettre ici le num\'{e}ro de contrat de l'entreprise cit\'{e}e au dessus
\newcommand{\ProcurantContrat}{Num\'{e}ro de contrat}
% Date de fin de la procuration
\newcommand{\FinProc}{ {{- cleaned_data["finprocuration"] -}} }
\newcommand{\DebutProc}{ {{- cleaned_data["debutprocuration"] -}} }
% Date d'envoi du premier courrier \`{a} Free (utile pour la relance)
\newcommand{\DateCourrierFree}{XX mois XXXX}
% Date d'envoi du premier courrier aux Impôts (utile pour la relance)
\newcommand{\DateCourrierImpots}{XX mois XXXX}
% Date d'envoi du premier courrier \`{a} la CPAM (utile pour la relance)
\newcommand{\DateCourrierCPAM}{XX mois XXXX}
% Date d'envoi du premier courrier \`{a} l'\'{e}cole (utile pour la relance)
\newcommand{\DateCourrierEcole}{XX mois XXXX}
% Date d'envoi du premier courrier \`{a} la banque (utile pour la relance)
\newcommand{\DateCourrierBanque}{XX mois XXXX}
% Date d'envoi du premier courrier \`{a} l'entreprise (utile pour la relance)
\newcommand{\DateCourrierEntreprise}{XX mois XXXX}
%-------------------------------------------------------------------------
% Partie sur le. procur\'{e}.e
%-------------------------------------------------------------------------
% Mettre ici le pr\'{e}nom et le nom de famille entre {} de la personne
% faisant la d\'{e}marche
\newcommand{\PersonId}{ {{- cleaned_data["personfirstname"] -}} {} \textsc{ {{- cleaned_data["personlastname"] -}} }}
% Mettre ici tous les pr\'{e}noms de la personne faisant la d\'{e}marche et
% le nom de famille entre {}
\newcommand{\PersonFullId}{ {{- cleaned_data["personlistofname"] -}} {} \textsc{ {{- cleaned_data["personlastname"] -}} }}
% Mettre ici le num\'{e}ro de t\'{e}l\'{e}phone
\newcommand{\PersonTel}{ {{- cleaned_data["persontelephone"] -}} }
% Mettre ici : num\'{e}ro de la voie, type de voie, nom de la voie
\newcommand{\PersonAddresseRue}{ {{- cleaned_data["personaddress1"] -}} }
% Mettre ici le code postal et la ville
\newcommand{\PersonAddresseVille}{ {{- cleaned_data["personaddress2"] -}} }
% Ne pas toucher
\newcommand{\PersonAddressFull}{\PersonId\\\PersonAddresseRue\\\PersonAddresseVille}
% Mettre ici le nom de la ville d'où est \'{e}crit le courrier
\newcommand{\PersonLocation}{\textsc{ {{- cleaned_data["personlocation"] -}} }}
% Mettre ici le mail de la personne faisant les d\'{e}marches
\newcommand{\PersonEmail}{ {{- cleaned_data["personemail"] -}} }
% Mettre ici la date de naissance de la personne faisant les d\'{e}marches
\newcommand{\PersonDOB}{ {{- cleaned_data["persondob"] -}} }
% Mettre ici la ville et d\'{e}partement de naissance de la personne faisant
% les d\'{e}marches
\newcommand{\PersonPOB}{ {{- cleaned_data["personpob"] -}} }
% Pour les accords
% 0 = feminin
% 1 = masculun
\newcommand{\PersonGender}{ {{- cleaned_data["persongender"] -}} } % 0 = femme, 1 = homme
% Ne pas toucher
\newcommand{\Civilite}{
En effet, comme l'a rappel\'{e} de nombreuses fois le D\'{e}fenseur des Droits dans des rapports, synth\`{e}ses, recommandations et d\'{e}cisions, la civilit\'{e} est une affaire d'usage et n'est aucunement li\'{e}e \`{a} la mention de sexe \`{a} l'\'{E}tat-Civil. Je vous engage \`{a} vous renseigner plus avant sur le site du D\'{e}fenseur des Droits si le moindre doute persiste.
\newpage
De surcro\^{\i}t, il a not\'{e} qu'une persistence d'une civilit\'{e} erronn\'{e}e, c'est-\`{a}-dire non conforme \`{a} l'identit\'{e} de genre r\'{e}elle d'une personne transgenre, relevait du harc\`{e}lement discriminatoire bas\'{e} sur l'identit\'{e} de genre.
\medskip
Enfin, il est fait état dans la circulaire du 10 mai 2017 de présentation des dispositions de l'article 56 de la loi n°2016-1547 du 18 novembre 2016 qu'une personne transgenre peut utiliser comme preuve pour une procédure de changement de mention de sexe à l'État-Civil « […] l'avis d'imposition, ou tout autre document administratif reprenant la civilité revendiquée et le prénom dont il est fait usage ». Cela indique que les documents administratifs peuvent afficher la civilité revendiquée avant tout changement de mention de sexe à l'État-Civil.
\medskip
Pour toutes ces raisons, je vous demande de mettre \`{a} jour, dans les plus brefs d\'{e}lais, \if\ChangementPrenom0 le pr\'{e}nom et \fi la civilit\'{e} de \ProcurantId {} dans vos registres, et de me tenir \if\PersonGender0 inform\'{e}e \else inform\'{e} \fi par retour de courrier \'{e}lectronique de la bonne prise en compte de ces informations.
}
\begin{document}
%-----------------------------------------------%
% Le blabla pas int\'{e}ressant %
%-----------------------------------------------%
\begin{letter}{\`{A} l'attention du service conciliation de la CPAM du \ProcurantDepartement}
\date{le \DebutProc}
\name{\ProcurantId}
\address{\centering\ProcurantAddressFull}
\telephone{\ProcurantTel}
\nofax
\lieu{\ProcurantLocation}
\signature{\ProcurantId}
\email{\ProcurantEmail}
\conc{Procuration}
\opening{Madame, Monsieur,}
%-----------------------------------------------%
% Le corps de la lettre de motivation %
% \`{a} vous de jouer ! %
%-----------------------------------------------%
%-% remplacer par votre lettre de motivation
Je \if\ProcurantGender0 sous-sign\'{e}e \else sous-sign\'{e} \fi \ProcurantFullId, \if\ProcurantGender0 n\'{e}e \else n\'{e} \fi le \ProcurantDOB {} \`{a} \ProcurantPOB, demeurant au \ProcurantAddresseRue {} \ProcurantAddresseVille {} agissant en tant que mandant d\'{e}clare donner pouvoir par la pr\'{e}sente \`{a} \PersonFullId, \if\PersonGender0 n\'{e}e \else n\'{e} \fi le \PersonDOB {} \`{a} \PersonPOB, demeurant au \PersonAddresseRue {} \PersonAddresseVille {} aupr\`{e}s de la CPAM du \ProcurantDepartement.
\medskip
Par cette procuration valable du \DebutProc {} jusqu'au \FinProc, le mandataire est en droit d'effectuer toutes les d\'{e}marches n\'{e}cessaires afin de faire valoir mon changement de \if\ChangementPrenom0 pr\'{e}nom et \fi de civilit\'{e}.
%-----------------------------------------------%
% Le blabla pas int\'{e}ressant %
%-----------------------------------------------%
\closing{Pour faire valoir ce que de droit,}
%-% \cc{Listes des autres destinataires}
\encl{Copie des pi\`{e}ces d'identit\'{e} de \ProcurantId {} et de \PersonId}
\end{letter}
\begin{letter}{\`{A} l'attention du service conciliation de la CPAM du \ProcurantDepartement}
\date{le \DebutProc}
\name{\PersonId}
\address{\centering\PersonAddressFull}
\telephone{\PersonTel}
\nofax
\lieu{\PersonLocation}
\signature{\PersonId}
\email{\PersonEmail}
\conc{Demande de changement \if\ChangementPrenom0 de pr\'{e}nom et \fi de civilit\'{e} d'une personne transgenre}
\opening{Madame, Monsieur,}
%-----------------------------------------------%
% Le corps de la lettre de motivation %
% à vous de jouer ! %
%-----------------------------------------------%
%-% \`{À} remplacer par votre lettre de motivation
Je suis \if\PersonGender0 mandat\'{e}e \else mandat\'{e} \fi par \ProcurantFullId \if\ChangementPrenom0 qui a r\'{e}cemment obtenu son changement de pr\'{e}nom à l'\'{E}tat-Civil \fi afin d'effectuer les d\'{e}marches de changement \if\ChangementPrenom0 de pr\'{e}nom et \fi de civilit\'{e} dans les registres de la CPAM du \ProcurantDepartement.
\if\ChangementPrenom0
\medskip
\ProcurantId, est \if\ProcurantGender0 connue \else connu \fi de vos services sous le nom de \ProcurantOldId {} et a le num\'{e}ro de S\'{e}curit\'{e} Sociale \ProcurantSecu.
\medskip
En vertu de la d\'{e}cision de changement de pr\'{e}nom d\'{e}livr\'{e}e par l'\'{E}tat-Civil, je vous prie de bien vouloir changer son pr\'{e}nom dans vos registres.
\medskip
De plus, je \else \medskip Je \fi vous prie de bien vouloir changer sa civilit\'{e} de \if\ProcurantGender0 \og Monsieur \fg{} à \og Madame \fg{} \else \og Madame \fg{} à \og Monsieur \fg{} \fi dans vos registres, et ce pr\'{e}alablement à toute d\'{e}cision de changement de mention de sexe à l'\'{E}tat-Civil, puisqu'il s'agit d'une personne transgenre.
\medskip
\Civilite
\medskip
Faute d'une rapide modification de ces informations et d'un prompt retour de votre part, je me verrais \if\PersonGender0 contrainte \else contraint \fi de saisir le Défenseur des Droits et la CNIL.
%-----------------------------------------------%
% Le blabla pas int\'{e}ressant %
%-----------------------------------------------%
\closing{Je vous prie de bien vouloir croire, Madame, Monsieur, en l'assurance de ma consid\'{e}ration,}
%-% \cc{Listes des autres destinataires}
\encl{Copie des pi\`{e}ces d'identit\'{e} de \ProcurantId, \PersonId, procuration de \ProcurantId {} \if\ChangementPrenom0 et d\'{e}cision de changement de pr\'{e}nom de \ProcurantId \fi}
\end{letter}
\end{document}
|
https://theanarchistlibrary.org/library/subcomandante-marcos-until-death-if-it-is-needed.tex | theanarchistlibrary.org | CC-MAIN-2021-17 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-17/segments/1618038469494.59/warc/CC-MAIN-20210418073623-20210418103623-00580.warc.gz | 666,043,721 | 8,034 | \documentclass[DIV=12,%
BCOR=10mm,%
headinclude=false,%
footinclude=false,%
fontsize=11pt,%
twoside,%
paper=210mm:11in]%
{scrartcl}
\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{LinLibertine_R.otf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/opentype/linux-libertine/,%
BoldFont=LinLibertine_RB.otf,%
BoldItalicFont=LinLibertine_RBI.otf,%
ItalicFont=LinLibertine_RI.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{LinLibertine_R.otf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/opentype/linux-libertine/,%
BoldFont=LinLibertine_RB.otf,%
BoldItalicFont=LinLibertine_RBI.otf,%
ItalicFont=LinLibertine_RI.otf]
\let\chapter\section
% 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{Until death if it is needed}
\date{11\Slash{}08\Slash{}2020}
\author{Subcomandante Marcos}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Until death if it is needed},%
pdfauthor={Subcomandante Marcos},%
pdfsubject={},%
pdfkeywords={EZLN; Zapatistas}%
}
\begin{document}
\thispagestyle{empty}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Until death if it is needed\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Subcomandante Marcos\par}}%
\vskip 1.5em
{\usekomafont{date}{11\Slash{}08\Slash{}2020\par}}%
\end{center}
\vskip 3em
\par
“Until death if it is needed.”
\forcelinebreak
“Until death if it is needed!”
I heard this sentence in 1992, in Tzeltal\dots{} in Tzotzil\dots{} Ch’ol, Tojoloab’al\dots{} I think also in Mam\dots{} and also in Spanish. In 1992, 500 years after the Spaniards came to conquer these lands. I heard it when our peoples, our men, women, children and elderly decided to take arms against the supreme government.
Nine months ago, or a bit more, we published the \emph{Sixth Declaration of the Selva Lacandona}.\footnote{\href{https://theanarchistlibrary.org/library/ezln-sixth-declaration-of-the-selva-lacandona}{\texttt{https://theanarchistlibrary.org/library/ezln-sixth-declaration-of-the-selva-lacandona}}} We committed ourselves to make an effort to unite all the resistances, all the rebellions, and all the fights that rose from below and from the left in Mexico, against the voracity of the governments and the powerful ones who control them. As the first act, we decided to go all over the Mexican Republic, and we heard this same phrase, this same sentence, in the voice of other indigenous peoples, of peasants, proletarians, students, women, young people, teachers, elders: “To death, if necessary.”
Them and us, with \emph{La Otra Campaña}, we decided to unite our fights, not to change a government but to overthrow it, not to beg to the rich, but drive them out of this country; the one who is there [Marcos points in the distance to his right] is going to leave and the one who is there [Marcos points in the distance to his left] is also going to leave! They will leave, and we will overthrow! And we Zapatistas are used to keeping our word.
We heard the voices of peasants deceived by the PROCEDE and the PROCECOM, stripped of their \emph{ejidos}, with no prices on their products, desperate, without even the opportunity to be able to emigrate to the city or to another country, cornered against the precipice and seeing how the big companies, the agro-industries, the tourist centres begin to take possession of their lands, and instead of the army, the deputies, the senators, the political parties, the officials of the federal government arrive to take away the land of their grandparents, of their great-grandparents, of their parents, and that should belong to their children.
“Until death if it is needed,” they said.
And we have seen the indigenous peoples dispossessed of their communal lands, no matter which political party: PRI\footnote{\href{https://en.wikipedia.org/wiki/Institutional\_Revolutionary\_Party}{\texttt{https://en.wikipedia.org/wiki/Institutional\_Revolutionary\_Party}}}, PAN\footnote{\href{https://en.wikipedia.org/wiki/National\_Action\_Party\_\%28Mexico\%29}{\texttt{https://en.wikipedia.org/wiki/National\_Action\_Party\_(Mexico)}}}, PRD\footnote{\href{https://en.wikipedia.org/wiki/Party\_of\_the\_Democratic\_Revolution}{\texttt{https://en.wikipedia.org/wiki/Party\_of\_the\_Democratic\_Revolution}}}, PT\footnote{\href{https://en.wikipedia.org/wiki/Labor\_Party\_\%28Mexico\%29}{\texttt{https://en.wikipedia.org/wiki/Labor\_Party\_(Mexico)}}}, Verde Ecologista\footnote{\href{https://en.wikipedia.org/wiki/Ecologist\_Green\_Party\_of\_Mexico}{\texttt{https://en.wikipedia.org/wiki/Ecologist\_Green\_Party\_of\_Mexico}}}\dots{} When the indigenous people arrive in the city to sell their products, [they receive] kicks from the police, buckets of cold water, they are insulted\dots{} And the PRD governs, and the PRI governs, and the PAN governs\dots{} And still for us indigenous peoples the same story, the same plundering, the same mockery, the same despise of our language, our culture, our colour, the way we are as we are.
And these indigenous peoples said “Until death if it is needed.”
We heard the young, men and women, anarchists, libertarians, punks, goths, skinheads, and whatever do those who rebel against those who rule from above call themselves\dots{} And they told us how the police pursues them. How there is a crime and instead of catching those who govern, those who are responsible, they help them. And so we have to fight with the police so that they do not put them in prison, so that they do not beat them any more, so that they do not rape them, so that they do not treat them as if they were filthy animals. These young men and women are looked upon with suspicion by those above because of the way their hair look, the way they talk, the way they dress and even the music they listen to.
“Until death if it is needed.”
And we have listened to women of all types\dots{} We are tired of being seen as an object to be beaten, to be whipped, to be chased, to be sold, to be humiliated and to be killed.
“Until death if it is needed.” said these women.
And we have heard those who work in the city, employees treated like in the times of Porfirio Díaz, men and women forced to work 12, 14, 16 hours for 45, 46 pesos a day, and they see that it is not enough.
“Until death if it is needed.” said the workers of the maquiladora.\footnote{\href{https://en.wikipedia.org/wiki/Maquiladora}{\texttt{https://en.wikipedia.org/wiki/Maquiladora}}}
And we have listened to the small traders evicted by the police of the governments of the PRI, PAN, PRD, PT, Verde Ecologista, Convergencia\footnote{\href{https://es.wikipedia.org/wiki/Convergencia\_\%28partido\_pol\%C3\%ADtico\%29}{\texttt{https://es.wikipedia.org/wiki/Convergencia\_(partido\_pol\%C3\%ADtico)}}}, all so that the city does not look dirty. So that the big shopping centres, such as SAM’S, Walmart, Comercial Mexicana, Soriana, and all the rest of these things that are the same, whatever they call themselves, can have their luxury customers, without those customers having to offend their sense of smell with our odour, which is the odour of work.
The small traders told us “Until death if it is needed.”
And we have heard workers, employees who have had all their labour rights taken away, who have been tricked by the same hacks now under a different name, because above they want to elect a new government under a different name, and keep us as we are.
”Until death if it is needed,” they said.
And we have heard from elderly men and women who are tired, fed up with a lifetime of work, of struggle and being thrown into a corner, as if they were a burden, a piece of rubbish. And even if sometimes those above give them a penny or two, they have a lifetime of seeing the same Mexico from below, fucked, despised, humiliated.
”Until death if it is needed,” they said.
And before leaving the mountains of the Mexican southeast, my comrades, the chiefs, the leaders of the Ejército Zapatista de Liberación Nacional told me: we are in this “until death if it is needed.” Alive or dead, in prison or free, disappeared or in the streets, the mountains, the river, or the sea. We come to repeat the same to those above, to the politicians, to the greatly rich. We are going to tear them to pieces.
Here we are, we weren’t summoned for a commercial, we weren’t promised an advertising spot, it wasn’t a roll call that brought us to where we are, it wasn’t the deception of above, in the radio, the TV, the newspapers, but it was our heart which decided we had to do something else, and we will take from Slim\footnote{\href{https://en.wikipedia.org/wiki/Carlos\_Slim}{\texttt{https://en.wikipedia.org/wiki/Carlos\_Slim}}} TELMEX, the SAMBORNS, everything that he has we are going to take away, and give it to the workers, the telephone operators, the employees of those businesses, and we are going to take the land away from the landowners and the peasants are going to work it, without GMOs, without chemicals, since they work the land already. And we are going to take the schools away from the corrupt, idiotic and mediocre officials who have them, and we are going to give them to the university students, we are going to take the banks away from the bankers, we are going to take the industries away from the big owners and we are going to take the governments away from the bad governors, and we are going to take them no matter what.
The streets will shine again as they shone today, with the people from below, humble and simple with the pure desire to fight, to be part of this history that will change this country once and for all. The fields, the mountains, the rivers are going to shine with something that was not known until now, something which is the unity of all the rebellious humility in this country. Another Mexico is going to rise. And someone from above, a scholar, is going to ask when this began, and will say it was this 1\textsuperscript{st} of May 2006, it was with the sixth declaration, it was when in each state, in each locality people organized themselves.
And any answer of this kind is going to be a lie, because that which is the tomorrow of this country, of the other Mexico began when each one of us, men, women, children and elders took the fear we had, our anguish, our loneliness and crumpled it into a little ball and threw it on the ground when we decided as men, as women, as children and as elders to do something for this country. And the only thing we can do is remake it, pushing away those who are watching us, those who are back there [he points to a government building] and all who are above those who are, as they say, “fucking around.”
It is a question, companions, of making the loneliness we felt, the fear, the anguish change hands, to make those who are above fear that they will be filled with anguish, and that the stock market will fall and the only company that will see its own profits rise is the airline that has flights to Miami, because we are going to change this country once and for all. We are going to give it our name and our face, that of each and every one of you, the names and faces of the indigenous people, of the small traders, women, young people, students, teachers, workers of the countryside and the city, the elderly, and the suffering of these generations won’t go away until the downfall of the system that made us like this, the capitalist system.
And it will end here, in Mexico, and one day we will meet here in Zocalo again, and there will be another voice calling us; ours, the voice from below, and we will know then that it is the hour to start building another country, a country for us, from below and from the left, where what people think is taken into account, and with new laws we will send all the lawyers to study, because the laws they already studied will all be sent to hell. They are criticising us because the Zapatistas are taking out this word of rebellion, because we don’t take into account the correlation of forces. Comrades, the Zapatistas, all the Zapatistas, have never given a damn about the correlation of forces.
We are traveling all over the country and we are finding many people who are fighting and who until now have fought alone, who have resisted plundering, who have resisted repression, who have resisted each of the injustices that each one of us sees, we were alone and now we are learning to say, Compañero, y Compañera, with meaning, not as a slogan, but knowing that we are already together, as Zapatistas, as a family, as individuals, as collectives, as groups, as social organisations, as indigenous peoples, as political organisations of the left, in one big movement, in the only possibility that this country will survive, because if we don’t do it, those above will continue to destroy until all this is a pile of rubble with a sign that says it’s for sale.
We are going to change all this, together as it should be, from below and from the left, this great movement is going to rise when we end up listening to all the voices, to know each other among everything, we are going to set the time, date and place, so that those who are above can open the doors of the prison and free all our comrades who are imprisoned, and all the poor people who are unjustly imprisoned and the doors will be open only long enough later to put those above where they should be, in prison to join the rapists, the drug lords, the serial killers, because they are just like them!
This is what will happen; whomever sees us, we will be seen by those above, and we won’t appear in the newspapers or in the television and radio news, because \emph{La Otra Campaña} does not exist for those above, or rather they wish it did not exist. They see, filled with fear, that despite all the silence they’ve directed at us, and despite all the money they are directing towards the funding for their electoral campaigns, despite all of that, more and more people from below, without names and without faces, are taking the name and the face of those of us in \emph{La Otra Campaña}.
We will be a national boxing show where we fight with our words, we will create another country and with another constitution and where we will be able to forget these days in which we get home and we see on the table the water bill, and the telephone bill, and the taxes, and see that there are only beans to eat and sometimes not even that, that you don’t get paid enough even for \emph{tortillas} and yet you have to work from dawn and even before that until late at night, and see that we are not leaving the situation in which we are. Their houses, those of the ones above, will be ours, and we will have good housing, with services provided by us, since we are those who work.
We will have a decent job and a salary, we will have land to work on, good food, hospitals with medicine and doctors, education for all, secular, free, public, we will have independence, and never again will any government do what the government of Vicente Fox has done, which was to humiliate the historical memory of this country in front of George Bush and the American people, and we will see democracy as it should be seen, as ours, coming from below, not that of those politicians from above who have turned their politics into a commodity and their work into prostitution dressed in fancy dresses.
Comrades, we are \emph{La Otra Campaña}, and with us are sex workers, with us are homosexuals, lesbians, transgender people, with us are street children, street workers, small tenants, informal merchants, market traders, with us are indigenous peoples, with us are peasants without land or in the process of losing it, with us are workers, students, teachers, the elderly, and with us are the ugly ones, the filthy ones, and we are here in \emph{La Otra Campaña}, the best of this country, and that is all which we are going to do.
Thank you, Comrades. Thank you.
% 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}
The Anarchist Library
\smallskip
Anti-Copyright
\bigskip
\includegraphics[width=0.25\textwidth]{logo-en}
\bigskip
\end{center}
\strut
\vfill
\begin{center}
Subcomandante Marcos
Until death if it is needed
11\Slash{}08\Slash{}2020
\bigskip
https:\Slash{}\Slash{}intheredautumn.wordpress.com\Slash{}2020\Slash{}11\Slash{}08\Slash{}until-death-if-it-is-needed-supmarcos\Slash{}
\emph{This is a translated transcript of the speech of the Zapatista Subcomandante Insurgente Marcos, “Hasta morir si es preciso.”} \emph{The translation might be adapted at points for more clarity in the English language.}\forcelinebreak
\bigskip
\textbf{theanarchistlibrary.org}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
https://mirror.anarhija.net/fi.theanarchistlibrary.org/mirror/t/tj/tuntematon-joitain-merkintoja-kapinallisesta-anarkismista.tex | anarhija.net | CC-MAIN-2021-25 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2021-25/segments/1623487643703.56/warc/CC-MAIN-20210619051239-20210619081239-00360.warc.gz | 373,438,068 | 8,822 | \documentclass[DIV=12,%
BCOR=10mm,%
headinclude=false,%
footinclude=false,open=any,%
fontsize=11pt,%
twoside,%
paper=a4]%
{scrbook}
\usepackage{fontspec}
\usepackage{polyglossia}
\setmainfont{Linux Libertine O}
% these are not used but prevents XeTeX to barf
\setsansfont[Scale=MatchLowercase]{CMU Sans Serif}
\setmonofont[Scale=MatchLowercase]{CMU Typewriter Text}
\setmainlanguage{finnish}
% 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}
% footnote handling
\usepackage[fragile]{bigfoot}
\usepackage{perpage}
\DeclareNewFootnote{default}
\DeclareNewFootnote{B}
\MakeSorted{footnoteB}
\renewcommand*\thefootnoteB{(\arabic{footnoteB})}
\deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~}
% continuous numbering across the document. Defaults to resetting at chapter. Unclear
% \usepackage{chngcntr}
% \counterwithout{footnote}{chapter}
\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}
% 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{Joitain merkintöjä kapinallisesta anarkismista}
\date{}
\author{Anonyymi}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Joitain merkintöjä kapinallisesta anarkismista},%
pdfauthor={Anonyymi},%
pdfsubject={},%
pdfkeywords={Anarkismi; kapinallinen anarkismi; insurrektionismi; kapina; sabotaasi; vallankumouksellinen väkivalta; organisaatio}%
}
\begin{document}
\begin{titlepage}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Joitain merkintöjä kapinallisesta anarkismista\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Anonyymi\par}}%
\vskip 1.5em
\vfill
\strut\par
\end{center}
\end{titlepage}
\cleardoublepage
\tableofcontents
% start a new right-handed page
\cleardoublepage
Kapinallinen anarkismi\footnote{Insurrectionary anarchism on tavallisesti käännetty lainaten suoraan insurrektionalistiseksi anarkismiksi. Koska tämä ei kuitenkaan kerro suomenkieliselle lukijalle sinänsä juuri mitään sen lisäksi että on sanana aikamoinen hirvitys – käytän tässä käännöksessä hieman kokeellisestikin käsitettä kapinallinen anarkismi.} ei ole ideologinen ratkaisu kaikkiin yhteiskunnallisiin ongelmiin, eikä se ole hyödyke kapitalistisilla ideologioiden ja mielipiteiden markkinoilla. Sen sijaan se on jatkuvaa ajattelun ja toiminnan vuoropuhelua\footnote{’praxis’}, jonka päämääränä on tehdä loppu valtion ylivallasta ja kapitalismin jatkuvuudesta. Tämä edellyttää analyysiä ja keskustelua edetäkseen. Emme katso jonkun ihanneyhteiskunnan suuntaan tai tarjoa mielikuvaa utopiasta julkisuuden kulutettavaksi. Kautta aikojen useimmat anarkistit – lukuun ottamatta niitä, jotka uskoivat että yhteiskunta kehittyisi itsestään pisteeseen jossa se jättäisi valtion taakseen – ovat olleet kapinallisia anarkisteja. Kaikkein yksinkertaisimmin ilmaistuna tämä tarkoittaa, että valtio ei vain yhtäkkiä surkastu pois, ja että tästä syystä anarkistien täytyy hyökätä – sillä odottelu merkitsisi tappiota. Tarvitaan avointa kapinaa ja kumouksellisuuden levittämistä riistettyjen ja syrjäytettyjen keskuudessa.
Hahmottelemme tässä joitain johtopäätöksiä, joita me ja jotkut muut kapinalliset anarkistit vedämme tästä yleisestä ongelmasta: jos valtio ei katoa itsestään, niin kuinka me teemme lopun sen olemassaolosta? Kyseessä on siksi ennen kaikkea käytäntö, joka keskittyy hyökkäyksen järjestämiseen. Nämä merkinnät eivät millään muotoa ole lopullisia tai viimeisteltyjä tuotteita; toivomme niiden olevan osa jatkuvaa keskustelua, ja otamme erittäin mielellämme vastaan kaikki vastineet. Suuri osa tästä on peräisin Insurrection\footnote{Insurrection -lehdellä ei tiettävästi ole omaa sivua netissä, mutta joitain lehdessä julkaistuja artikkeleita löytyy täältä selailemalla.} -julkaisun aiemmista numeroista ja Elephant Editionsin pamfleteista.
\chapter{1: VALTIO EI TULE VAIN KATOAMAAN; HYÖKKÄÄ}
--Pääoman Valtio ei tule tuosta vain kuihtumaan pois, kuten monet anarkistit näyttäisivät päätyneen uskomaan. Nämä anarkistit eivät ole pelkästään kaivautuneet ’odottelun’ abstrakteihin asemiin, vaan jotkut jopa avoimesti tuomitsevat niiden toimet joille uuden maailman luominen merkitsee vanhan maailman tuhoamista. Hyökkäys merkitsee kieltäytymistä välikäsistä\footnote{alkutekstissä refusal of mediation: merkitsee täsmällisemmin sanottuna kieltäytymistä toiminnan delegoimisesta puolueelle, järjestölle, yhdistykselle tms; ja valintaa välittömän, itse ja yhdessä läheisten kanssa ilman muodollisia, toimintaa välittäviä organisaatioita tapahtuvan suoran toiminnan puolesta.}, rauhoittamisesta, uhrautumisesta, sopeutumisesta ja kompromissista.
--Tie kapinaan aukeaa toiminnan ja toimimaan oppimisen, ei propagandan kautta. Propagandalla on tästä huolimatta roolinsa toiminnan selkeyttämisessä. Odottelu opettaa vain odottamaan; toimiessaan oppii toimimaan.
--Kapinan voima on yhteiskunnallinen, ei sotilaallinen. Yleistyneen kapinoinnin merkityksen arvioinnin mitta ei ole aseellinen yhteenotto, vaan päin vastoin se kuinka laajalti talous ja asioiden normaali kulku halvaantuvat.
\chapter{2. OMATOIMISUUS vs. ohjattu kapina: kapinasta vallankumoukseen}
--Meille anarkisteille vallankumous on jatkuva viitekohta, riippumatta siitä mitä teemme tai mihin ongelmiin huomiomme kiinnittyy. Vallankumous viitepisteenä ei kuitenkaan ole vain myytti. Juuri siitä syystä että se on konkreettinen tapahtuma, täytyy sitä rakentaa päivittäin sellaisten maltillisempien yritysten kautta, joilla ei ole kaikkia yhteiskunnallisen vallankumouksen vapauttavia piirteitä varsinaisessa merkityksessään. Nämä maltillisemmat yritykset ovat kapinoita. Niissä yhteiskunnan kaikkein riistetyimpien ja syrjäytetyimpien sekä poliittisesti tietoisimman vähemmistön nousu kapinaan avaa tien yhä laajemman riistettyjen joukon osallistumiselle kapinallisuuden tulvaan, joka voi johtaa vallankumoukseen.
--Kamppailuita on kehitettävä sekä keskipitkällä että pitkällä aikavälillä. Selkeät strategiat ovat välttämättömiä, jotta erilaisia menetelmiä voitaisiin käyttää koordinoidulla ja hedelmällisellä tavalla.
--Omaehtoinen toiminta: kamppailun itse-ohjaaminen merkitsee, että kamppailuun osallistuvien päätöksenteko ja toiminta tapahtuu heidän omilla ehdoillaan. Tämä on vastakohta synteesin, yhtenäisen kokonaiskuvan järjestämiselle, joka pyrkii aina ottamaan kamppailun hallintaansa. Kamppailut, jotka on koottu ja yhtenäistetty yhteen ainoaan kontrolloivaan järjestöön, sulautuvat helposti vallitsevan yhteiskunnan valtarakenteeseen. Itse järjestetyt kamppailut ovat luonnostaan hallitsemattomia, kun ne leviävät kaikkialle yhteiskuntaan.
\chapter{3. HALLITSEMATTOMUUS vs. ohjattu kapina: hyökkäyksen leviäminen}
--Ei ole koskaan mahdollista nähdä tietyn kamppailun lopputulosta edeltä käsin. Jopa rajoitetulla kamppailulla voi olla mitä ennalta-arvaamattomimpia seurauksia. Siirtymää eri kapinoista – syvyydeltään ja laajuudeltaan rajoitetuista – vallankumoukseen ei voi etukäteen taata millään menetelmällä.
--Järjestelmä ei niinkään pelkää näitä sabotaasi-iskuja itsessään, kuin niiden leviämistä yhteiskunnallisesti. Jokainen työväenluokkainen henkilö, jolla on käytössään edes kaikkein vaatimattomimmat välineet, voi laatia omia tavoitteitaan yksin tai yhdessä toisten kanssa. Valtion ja pääoman on materiaalisesti mahdotonta valvoa yhteiskunnan alueella toimivaa hallintakoneistoa kokonaisuudessaan. Kuka tahansa, joka todella haluaa haastaa hallinnan verkoston, voi antaa oman teoreettisen tai käytännöllisen panoksensa. Ensimmäisen rikkinäisen linkin ilmaantuessa alkavat myös sabotaasi-tapaukset levitä. Yhteiskunnallisen itsevapautuksen harjoittaminen kasvottomasti voisi levitä kaikille yhteiskunnan alueille, jolloin se rikkoisi vallan asettamat ennaltaehkäisevät normit.
--Tästä syystä pienet, helposti toistettavat teot, joihin tarvitaan vain kaikkien ulottuvilla olevia yksinkertaisia välineitä, ovat yksinkertaisuudessaan ja spontaaniudessaan hallitsemattomia. Ne tekevät pilkkaa kapinoinnin vastaisen teknologian kaikkein kehittyneimmistäkin muodoista.
\chapter{4. ALITUINEN KONFLIKTI vs. institutionaalisten voimien kautta välittyminen}
--Konflikti pitäisi nähdä pysyvänä osana kamppailua vallanpitäjiä vastaan. Kamppailu, josta tämä elementti puuttuu, johdattaa meitä lopulta kohti instituutioiden kautta välittyvää toimintaa. Tällainen kamppailu tottuu delegoinnin tapoihin ja alkaa uskoa kuvitteelliseen vapautumiseen kansanedustuslaitoksen säätämässä järjestyksessä, aina niin pitkälle että se osallistuu aktiivisesti meidän itsemme riistoon.
--Saattaa kenties olla yksittäisiä syitä epäillä yritystä päästä tavoitteisiinsa väkivaltaisin keinoin. Mutta kun väkivallattomuus nostetaan rikkomattoman periaatteen tasolle, ja todellisuus jaetaan ’hyviin’ ja ’pahoihin’, niin argumenteilta katoaa arvo, ja kaikki nähdään suhteessa nöyrtymiseen ja tottelevaisuuteen. Globalisaation vastaisen liikkeen virkailijat ovat itsensä etäännyttämällä sekä toisia arvostelemalla ja ilmiantamalla tehneet yhden seikan erityisen selväksi: he pitävät omia periaatteitaan – joihin he kokevat olevansa velvoitettuja sitoutumaan – oikeutuksena valta-asemaan suhteessa liikkeeseen kokonaisuutena.
\chapter{5. LAITTOMUUS; kapinointi ei ole vain pankkien ryöstelyä}
--Kapinallinen anarkismi ei ole selviytymistä koskevaa etiikkaa: me kaikki tulemme toimeen eri tavoilla, usein antaen myöten pääomalle – yhteiskunnallisesta asemastamme, taidoistamme ja mieltymyksistämme riippuen. Emme todellakaan vastusta moraalisin perustein laittomia tapoja vapauttaa itsemme palkkaorjuuden kahleista, jotta voisimme elää ja toteuttaa omia projektejamme. Emme kuitenkaan myöskään ihannoi laittomuutta tai tee siitä jonkinlaista uskontoa marttyyreineen; se on yksinkertaisesti vain keino, ja usein hyvä sellainen.
\chapter{6. EPÄMUODOLLINEN JÄRJESTÄYTYMINEN; ei ammattimaisia vallankumouksellisia tai aktivisteja, ei pysyviä järjestöjä}
Puolueesta\Slash{}ammattiliitosta itseorganisoitumiseen:
--Vallankumouksellisen liikkeen sisällä on merkittäviä eriäväisyyksiä: anarkistinen taipumus kamppailun laadun ja sen itseorganisoitumisen suuntaan, sekä autoritaarinen taipumus kohti määrää ja keskittymistä.
--Järjestäytyminen on konkreettisia tehtäviä varten: siksi vastustamme puoluetta, syndikaattia ja pysyviä järjestöjä. Nämä kaikki toimivat yhtenäistääkseen kamppailun, ja niistä tulee pääoman ja valtion hyödynnettäväksi sopivia sulauttamisen aineksia. Niiden tavoitteeksi muodostuu lopulta niiden oma olemassaolonsa – pahimmassa tapauksessa ne luovat ensin järjestön ja vasta sitten etsivät tai luovat kamppailun. Meidän tehtävämme on toimia; järjestäytyminen on keino. Siksi vastustamme toiminnan tai käytännön delegoimista järjestölle: tarvitsemme kaikkialle leviävää toimintaa joka johtaa kapinaan, emme hallittuja kamppailuita. Järjestäytymisen ei pitäisi tapahtua tiettyjen etujen puolustamiseksi, vaan tiettyjä etuja vastaan hyökkäämiseksi.
--Epämuodollinen järjestäytyminen perustuu muutamiin tovereihin, joita yhdistää yhteinen läheisyyden tunto; sen eteenpäin vievä aines on aina toiminta. Mitä useampia ongelmia nämä toverit kohtaavat yhdessä, kokonaisuutena, sitä läheisempiä toisilleen he ovat. Tästä seuraa, että todellinen järjestäytyminen, kyky toimia yhdessä tehokkaasti (ts. tietää mistä löytää toinen toisensa), ongelmien tutkailu ja analysointi yhdessä, sekä toimeen ryhtyminen, nämä kaikki tapahtuvat suhteessa saavutettuun läheisyyden tuntuun, eikä sillä ole mitään tekemistä ohjelmien, platformien\footnote{Kirjoittajat viittaavat anarkismin platformistiseen suuntaukseen, jonka kannattajat saavat innoituksensa maanpaossa olleiden venäläisten anarkistien Pariisissa vuonna 1926 kirjoittamasta manifestista. Ks. esim. Wikipedia (englanniksi)}, lippujen, kansalaisjärjestöjen tai enemmän tai vähemmän naamioituneiden puolueiden kanssa. Epämuodollinen anarkistinen organisaatio on siis erityinen järjestäytymisen muoto, joka perustuu yhteiseen läheisyyden tuntoon.
Anarkistinen vähemmistö sekä riistetyt ja syrjäytetyt:
--Me olemme riistetyt ja syrjäytetyt, ja siksi on meidän tehtävämme toimia. Jotkut kuitenkin kritisoivat kaikkea toimintaa, mikä ei ole osa laajempaa ja näkyvää yhteiskunnallista liikettä, siitä että se ”toimii työväenluokan sijaan”. He neuvovat analysoimaan ja odottamaan toiminnan sijaan. Oletetaan että me emme ole riistettyjä riistettyjen rinnalla; meidän halumme, raivomme ja heikkoutemme eivät ole osa luokkataistelua. Tämä ei ole mitään muuta kuin jälleen yksi ideologinen eronteko riistettyjen ja kapinallisten välillä.
--Aktiivinen anarkistinen vähemmistö ei ole lukujen orja, vaan jatkaa toimintaansa valtaa vastaan silloinkin kun luokkataistelu on matalalla tasolla yhteiskunnan riistettyjen keskuudessa. Anarkistisen toiminnan ei siksi pitäisi tähdätä koko riistettyjen luokan järjestämiseen ja puolustamiseen yhden suuren, kamppailua alusta loppuun valvovan järjestön muodossa. Sen sijaan anarkistisen toiminnan pitäisi tunnistaa kamppailun yksittäisiä osa-alueita ja saattaa hyökkäys niillä loppuun asti. Meidän pitää myös päästä eroon suurten joukkotaistelujen stereotyyppisistä mielikuvista, sekä kaiken järjestämiseen ja hallintaan kykenevän, loputtomasti kasvavan liikkeen ajatuksesta.
--Suhdetta riistettyjen ja syrjäytettyjen moninaiseen joukkoon ei voi rakentaa niin että sen pitäisi kestää ajan kulku, ts. se ei voi perustua äärettömään kasvuun ja riistäjien hyökkäyksiltä puolustautumiseen. Sen sijaan sillä täytyy olla erityinen, pelkistetympi ulottuvuus, joka itsepintaisen puolustautumisen sijaan rajoittuu tietoisesti hyökkäykseen.
--Voimme alkaa kamppailumme rakentamisen niin, että olosuhteet kapinalle voivat ilmetä, piilevä konflikti voi kehittyä ja se voidaan nostaa esiin. Tällä tavoin luodaan yhteys anarkistisen vähemmistön sekä kamppailun kehittämisen mahdollistavan erityisen tilanteen välille.
\chapter{7. YKSILÖLLINEN JA YHTEISKUNNALLINEN: individualismi ja kommunismi, aiheeton ongelma}
--Omaksumme parhaat puolet sekä individualismista että kommunismista.
--Kapinat saavat alkunsa yksilöiden halusta murtautua vapaaksi rajoitetuista ja kontrolloiduista olosuhteista, heidän halustaan saada takaisin kyky luoda oma elämänsä parhaaksi näkemällään tavalla. Tämä edellyttää että he ylittävät heidän ja heidän olemassaolonsa edellytysten välille tehdyn eron. Siellä missä harvat ja etuoikeutetut hallitsevat olemassolon edellytyksiä, on useimpien ihmisten mahdotonta todella päättää olemassaolostaan omilla ehdoillaan. Yksilöllisyys voi kukoistaa ainoastaan sellaisessa todellisuudessa, jossa olemassaolon edellytykset ovat tasavertaisesti kaikkien käytettävissä. Tämä käyttömahdollisuuksien tasavertaisuus on kommunismia; se mitä ihmiset tällä mahdollisuudella tekevät on kiinni heistä itsestään ja ihmisistä heidän lähellään. Siksi todellinen kommunismi ei viittaa yksilöiden tasapäisyyteen tai samanlaisuuteen. Nykyisen järjestelmän asettamat sosiaaliset roolit ne pakottavat meitä tasapäisyyteen ja olemassaolon samanlaisuuteen. Individualismin ja kommunismin – yksilöllisyyden ja yhteisöllisyyden – välillä ei ole ristiriitaa.
\chapter{8. ME OLEMME RIISTETYT, me olemme ristiriita: tämä ei ole odottelun aika.}
--Kapitalismi sisältää ilmiselvästi syviä ristiriitoja. Nämä ristiriidat johtavat kapitalismia hienosäätöön ja kehittelyyn, joiden tarkoitus on estää sitä vaivaavat säännölliset kriisit. Emme kuitenkaan voi tuudittautua odottelemaan näitä kriisejä. Kun ne koittavat, ne otetaan tervetulleina vastaan – jos ne vastaavat kapinaan johtavien kehityskulkujen kiihdyttämisen vaatimuksiin. Riistettyinä me olemme kuitenkin kapitalismin pohjimmainen ristiriita. Siksi aika on aina kypsä kapinalle, ja aivan samoin voimme todeta että ihmiskunta olisi voinut tehdä lopun valtion olemassaolosta missä tahansa historian vaiheessa. Murtuma tämän hyväksikäytön ja sorron järjestelmän jatkuvassa uusintamisessa on aina ollut mahdollinen.
% 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}
Anarkistinen kirjasto
\smallskip
Anti-Copyright
\strut
\end{center}
\strut
\vfill
\begin{center}
Anonyymi
Joitain merkintöjä kapinallisesta anarkismista
\bigskip
Haettu 5.7.2012 osoitteesta: http:\Slash{}\Slash{}takku.net\Slash{}article.php\Slash{}20051121135322351
Käännös alkuaan Killing King Abacus-lehdessä ilmestyneestä tekstistä Some Notes on Insurrectionary Anarchism. Viitteet suomentajan.
\bigskip
\textbf{fi.theanarchistlibrary.org}
\end{center}
% end final page with colophon
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=5836&type=tex | zentralblatt-math.org | CC-MAIN-2019-35 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-35/segments/1566027322170.99/warc/CC-MAIN-20190825021120-20190825043120-00207.warc.gz | 1,043,980,046 | 1,363 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2015d.00365}
\itemau{Thiede, Keith W.; Brendefur, Jonathan L.; Osguthorpe, Richard D.; Carney, Michele B.; Bremner, Amanda; Strother, Sam; Oswalt, Steven; Snow, Jennifer L.; Sutton, John; Jesse, Dan}
\itemti{Can teachers accurately predict student performance?}
\itemso{Teach. Teach. Educ. 49, 36-44 (2015).}
\itemab
Summary: In two studies, we examined the effect of professional development to improve mathematics instruction on the accuracy of teachers' monitoring of student learning. Study 1 was conducted with 36 teachers participating in three years of professional development. Judgment accuracy was influenced by the fidelity with which what was learned in the professional development. Study 2 was conducted with 64 teachers from 8 schools, which were randomly assigned to receive professional development or serve as a control. Judgment accuracy was greater for teachers receiving professional development than for teachers who did not and teachers were better to predict students' computational skills.
\itemrv{~}
\itemcc{D39 D60}
\itemut{teacher judgment; judgment accuracy; mathematics achievement}
\itemli{doi:10.1016/j.tate.2015.01.012}
\end |
https://www.bengriffy.com/wp-content/uploads/2022/05/Lecture27_DirectedSearch.tex | bengriffy.com | CC-MAIN-2022-21 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-21/segments/1652662644142.66/warc/CC-MAIN-20220529103854-20220529133854-00296.warc.gz | 732,572,996 | 6,460 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Beamer Presentation
% LaTeX Template
% Version 1.0 (10/11/12)
%
% This template has been downloaded from:
% http://www.LaTeXTemplates.com
%
% License:
% CC BY-NC-SA 3.0 (http://creativecommons.org/licenses/by-nc-sa/3.0/)
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% ----------------------------------------------------------------------------------------
% PACKAGES AND THEMES
% ----------------------------------------------------------------------------------------
\documentclass[hyperref={colorlinks=true}]{beamer}
\mode<presentation> {
% The Beamer class comes with a number of default slide themes
% which change the colors and layouts of slides. Below this is a list
% of all the themes, uncomment each in turn to see what they look like.
\usetheme{default}
% \usetheme{AnnArbor}
% \usetheme{Antibes}
% \usetheme{Bergen}
% \usetheme{Berkeley}
% \usetheme{Berlin}
% \usetheme{Boadilla}
% \usetheme{CambridgeUS}
% \usetheme{Copenhagen}
% \usetheme{Darmstadt}
% \usetheme{Dresden}
% \usetheme{Frankfurt}
% \usetheme{Goettingen}
% \usetheme{Hannover}
% \usetheme{Ilmenau}
% \usetheme{JuanLesPins}
% \usetheme{Luebeck}
% \usetheme{Madrid}
% \usetheme{Malmoe}
% \usetheme{Marburg}
% \usetheme{Montpellier}
% \usetheme{PaloAlto}
% \usetheme{Pittsburgh}
% \usetheme{Rochester}
% \usetheme{Singapore}
% \usetheme{Szeged}
% \usetheme{Warsaw}
% As well as themes, the Beamer class has a number of color themes
% for any slide theme. Uncomment each of these in turn to see how it
% changes the colors of your current slide theme.
% \usecolortheme{albatross}
% \usecolortheme{beaver}
% \usecolortheme{beetle}
% \usecolortheme{crane}
% \usecolortheme{dolphin}
% \usecolortheme{dove}
% \usecolortheme{fly}
% \usecolortheme{lily}
% \usecolortheme{orchid}
\usecolortheme{rose}
% \usecolortheme{seagull}
% \usecolortheme{seahorse}
% \usecolortheme{whale}
% \usecolortheme{wolverine}
% \setbeamertemplate{footline} % To remove the footer line in all slides uncomment this line
% \setbeamertemplate{footline}[page number] % To replace the footer line in all slides with a simple slide count uncomment this line
% \setbeamertemplate{navigation symbols}{} % To remove the navigation symbols from the bottom of all slides uncomment this line
}
\usepackage{graphicx} % Allows including images
\usepackage{booktabs} % Allows the use of \toprule, \midrule and \bottomrule in tables
\usepackage{cancel}
\usepackage{amsmath}
\usepackage{amssymb}
% \usepackage{showframe}
\usepackage{caption}
%\usepackage{subcaption}
\usepackage{tcolorbox}
\usepackage{tikz}
\usepackage{tabularx}
\usepackage{array}
\usepackage{pgfplots}
\tcbuselibrary{skins}
\usepackage{subfig}
\beamertemplatenavigationsymbolsempty
\usepackage{color, colortbl}
\definecolor{LRed}{rgb}{1,.8,.8}
\definecolor{MRed}{rgb}{1,.6,.6}
\usepackage{tikz}
\usetikzlibrary{shapes,arrows,shapes.multipart,fit,shapes.misc,positioning}
\newcommand{\der}[2]{\frac{\partial #1}{\partial #2}}
%\usepackage[labelformat=empty]{caption}
\newcommand{\ra}[1]{\renewcommand{\arraystretch}{#1}}
\newcommand\marktopleft[1]{%
\tikz[overlay,remember picture]
\node (marker-#1-a) at (0,1.5ex) {};%
}
\newcommand\markbottomright[1]{%
\tikz[overlay,remember picture]
\node (marker-#1-b) at (7ex,0) {};%
\tikz[overlay,remember picture,thick,dashed,inner sep=3pt]
\node[draw=black,rounded corners=0pt,fill=red,opacity=.2,fit=(marker-#1-a.center) (marker-#1-b.center)] {};%
}
% ----------------------------------------------------------------------------------------
% TITLE PAGE
% ----------------------------------------------------------------------------------------
\title[]{Macro II} % The short title appears at the bottom of every slide, the full
% title is only on the title page
\author{Professor Griffy} % Your name
\institute[University at Albany, SUNY] % Your institution as it will appear on the bottom of
% every slide, may be shorthand to save space
{
UAlbany \ % Your institution for the title page
}
\date{Spring 2021} % Date, can be changed to a custom date
\begin{document}
\begin{frame}
\titlepage % Print the title page as the first slide
\end{frame}
%----------------------------------------------------------------------------------------
% PRESENTATION SLIDES
%----------------------------------------------------------------------------------------
% ------------------------------------------------
\section{Introduction} % Sections can be created in order to organize your presentation into discrete blocks, all sections and subsections are automatically printed in the table of contents as an overview of the talk
% ------------------------------------------------
\begin{frame}
\frametitle{Announcements}
\begin{itemize}
\item Today:
\begin{enumerate}
\item Random vs. directed search
\item Change primitive: workers can observe wage offers prior to match.
\item i.e., Moen (1997)
\end{enumerate}
\item Homework due on Wednesday.
\item Final: 24 hours starting Friday at 9am.
\item 3 questions, any part of course is fair game.
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Random vs. Directed Search}
\begin{itemize}
\item How do workers find jobs?
\item How much information do they have about a job before applying?
\item Two extremes:
\begin{enumerate}
\item Random Search: {\it no} information about a job prior to receiving offer.
\item Directed Search: {\it all} information about a job prior to application.
\end{enumerate}
\item Why does this matter?
\begin{enumerate}
\item Random search is generically inefficient: one worker may reject a job offer than another would accept.
\item Directed search is generically efficient: by applying for a job, a worker signals that the job is already acceptable.
\end{enumerate}
\item As we will see next time, it also changes computational complexity.
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Random vs. Directed Search II}
\begin{itemize}
\item Empirically, how can we tell them apart?
\item Hazard rate to wage w generically:
\begin{align}
H_{U}(w) = \underbrace{\lambda(w)}_{Arrival\;Rate} \times \underbrace{f(w)}_{Prob. Offer\;=\;W}
\end{align}
\item Random search:
\begin{align}
H_{U}(w) = \underbrace{\lambda}_{Arrival\;Rate}\underbrace{[1 - F(w_{R})]}_{Selectivity}\underbrace{f(w)}_{P.(Offer\;=\;W)}
\end{align}
\item Directed search:
\begin{align}
H_{U}(w) &= \underbrace{\lambda(w)}_{Arrival}\underbrace{\cancel{[1 - F(w_{R})]}}_{F(w_{R})=0}\underbrace{f(w)}_{P(Offer\;=\;w)}\\
&= \underbrace{\lambda(W)}_{Arrival}\cancel{\underbrace{f(w)}_{P(w=w_{j})=1}}\\
&= \underbrace{\lambda(w)}_{Arrival\;Rate\;\;of\;Wage\;w}
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Some Evidence}
\begin{itemize}
\item (First couple Borrowed from Shouyong Shi)
\item Hall and Krueger (08):
\begin{enumerate}
\item 84\% had information on wage prior to first interview.
\end{enumerate}
\item Holzer, Katz, and Krueger (91)
\begin{enumerate}
\item Firms in high-wage industries receive more applications than low-wage industries, controlling for observables.
\end{enumerate}
\item Braun, Engelhardt, Griffy, and Rupert: unemployment insurance changes $\lambda(w)$ $\rightarrow$ inconsistent with random search.
\end{itemize}
\end{frame}
% ------------------------------------------------
\section{The Mortensen and Pissarides Model}
% ------------------------------------------------
\begin{frame}
\frametitle{Mortensen and Pissarides Model}
\begin{itemize}
\item Unemployed flow value:
\begin{align}
rU = b + p(\theta)E[W(w) - U]
\end{align}
\item Employed flow value:
\begin{align}
rW(w) = w + \delta[U - W(w)]
\end{align}
\item Vacant flow value:
\begin{align}
rV = -\kappa + q(\theta)E[J(w) - V]
\end{align}
\item Matched flow value:
\begin{align}
rJ(w) = (p - w) + \delta[V - J(w)]
\end{align}
\item Free entry equilibrium condition:
\begin{align}
V &= 0\\
\rightarrow \frac{\kappa}{E[J(w)]} &= q(\theta)
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Equilibrium}
\begin{itemize}
\item The equilibrium we have described is a steady-state equilibrium characterized by value functions $U, W, J, V$, a wage function $w$, a market tightness function $\theta$, and steady-state level unemployment $u$, such that
\begin{enumerate}
\item A steady-state level of unemployment, derived from the flow unemployment equation.
\item A wage rule that splits the surplus of a match according to a sharing rule with bargaining weight $\beta$
\item A free entry condition that determines $\theta$ given wages and steady-state unemployment.
\end{enumerate}
\item What were these policy functions?
\begin{enumerate}
\item $w = (1 - \beta) b + \beta p + \beta\theta\kappa$
\item $\theta = q^{-1}(\frac{\kappa(r + \delta)}{(p - w)})$
\item $u &= \frac{\delta}{\delta + p(\theta)}$
\end{enumerate}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Equilibrium}\label{surplus}
\centering\begin{tikzpicture}[scale=0.8]
% Axis
\draw [thick] (-0.3,0) node [below] (-0.5,0)-- (0,0) -- (5.5,0) node [right];
\node [below] at (5.5,-0.2) {$w^{*}$};
\draw [thick] (0,-0.5)-- (0,0) -- (0,5.5);
\node [left] at (0,5.3) {$\theta$};
%Downward slopping line
\node [above] at (0.5,5);
\draw [thick] (0.5,5) to [out=280,in=140] (4.5,0);
\node [above] at (4.5,0.2) {$VCC$};
% Upward Slopping PQ
\draw [thick] (0.3,0.5) -- (3.8,4);
\node [right] at (3.8,4) {$w(\theta)$};
% dashed lines
\draw [dashed](2,0)--(2,2.15);
\node [below] at (2,0) {$w^{*}$};
\draw [dashed](0,2.15)--(5,2.15);
\node [left] at (0,2.15) {$\theta^{*}$};
\end{tikzpicture}%
\begin{tikzpicture}[scale=0.8]
% Axis
\draw [thick] (-0.3,0) node [below] (-0.5,0)-- (0,0) -- (5.5,0) node [right];
\node [below] at (5.5,-0.2) {$u$};
\draw [thick] (0,-0.5)-- (0,0) -- (0,5.5);
\node [left] at (0,5.3) {$\theta$};
%Downward slopping line
\node [above] at (0.5,5) {$BC$};
\draw [thick] (0.5,5) to [out=280,in=140] (4.5,0);
% dashed lines
\draw [dashed](2,0)--(2,2.15);
\node [below] at (2,0) {$u^{*}$};
\draw [dashed](0,2.15)--(2,2.15);
\node [left] at (0,2) {$\theta^{*}$};
\end{tikzpicture}
\end{frame}
% ------------------------------------------------
\section{Directed Search}
% ------------------------------------------------
\begin{frame}
\frametitle{Directed/Competitive Search}
\begin{itemize}
\item In DMP, wages are negotiated/revealed after meeting.
\item This can create inefficiency:
\begin{enumerate}
\item Consider example with unemployed workers A and B.
\item $w_{R}^{A} = 10$, $w_{R}^{B} = 15$
\item Firm pays a cost $\kappa$ to open a vacancy and posts a wage 12.
\item Both worker A and B apply for the job. Firm randomly picks worker B.
\item Worker B rejects job that would have been acceptable to worker A.
\end{enumerate}
\item Directed search: Worker B applies for different job with $w\geq w_{R}^{B}$.
\item (Directed and competitive search generally used interchangeably).
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{The Competitive Search Model (Moen, 1997)}
\begin{itemize}
\item Agents:
\begin{enumerate}
\item Employed workers employed in submarket $i$;
\item unemployed workers considering searching in $i\in\{1,...,N\}$;
\item unmatched firms indexed by productivity $y_{i}\in{y_{1},...,y_{N}}$;
\item matched firms indexed by productivity $y_{i}\in{y_{1},...,y_{N}}$;
\item ``Market Maker'': benevolent overlord who announces eqm. $w_{i}$.
\end{enumerate}
\item Linearity: ($u = z, u = w_{i}$) and $y = y_{i}>z$ in open submarkets.
\item Matching function:
\begin{enumerate}
\item Determines {\it number} of meetings between firms \& workers in submarket $i$:
\begin{align}
M(u_{i}L_{i},v_{i}L_{i}) = u_{i}L_{i}\times M(1,\frac{v_{i}}{u_{i}}) = u_{i}L_{i}\times p(\theta_{i})
\end{align}
\item where $\theta_{i} = \frac{v_{i}}{u_{i}}$ is ``submarket tightness''
\item Match rates:
\begin{align}
\underbrace{p(\theta_{i})}_{Worker\;wage\;i}= \theta_{i} \underbrace{q(\theta_{i})}_{Firm\;wage\;i}
\end{align}
\end{enumerate}
\item $i$ indexes both the productivity and wage.
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Worker Value Functions}
\begin{itemize}
\item Value functions:
\begin{enumerate}
\item Employed in submarket $i$: $W_{i}$
\item Unemployed and searching in submarket $i$: $U_{i}$.
\item Unemployed: $U = \max\{U_{1},...,U_{N}\}$.
\end{enumerate}
\item Unemployed flow value in submarket $i$:
\begin{align}
rU_{i} = z + p(\theta_{i})(W_{i} - U_{i})
\end{align}
\item Employed flow value in submarket $i$:
\begin{align}
rW_{i} = w_{i} + \delta(U_{i} - W_{i})
\end{align}
\item Both problems are stationary: optimal choice of $i$ true $\forall\;t$.
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Worker Value Functions II}
\begin{itemize}
\item We can solve for match rates:
\begin{align}
rU_{i} &= z + p(\theta_{i})(W_{i} - U_{i})\\
(r + p(\theta_{i}))U_{i} &= z + p(\theta_{i})\frac{w_{i} + \delta U_{i}}{r + \delta}\\
(r + \delta)(r + p(\theta_{i}))U_{i} - p(\theta_{i})\delta U_{i} &= (r + \delta)z + p(\theta_{i})w_{i} \\
rU_{i} &= \frac{(r + \delta)z + p(\theta_{i})w_{i}}{(r + \delta + p(\theta_{i}))} \\
p(\theta_{i}) &= \frac{rU_{i} - z}{w_{i} - rU_{i}}(r + \delta) \\
\end{align}
\item $U = \max\{U_{1},...,U_{N}\}$ and ex-ante homogeneity among workers implies
\begin{align}
p(\theta_{i}) &= \frac{rU - z}{w_{i} - rU}(r + \delta) \\
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Firm Value Functions}
\begin{itemize}
\item Pays a cost $\chi$ to draw productivity.
\item Firm observes own productivity, chooses to open vacancy given submarkets $(w, \theta)$.
\item Value functions:
\begin{enumerate}
\item Vacant with productivity $y_{i}$: $V(y_{i},w,\theta)$
\item Filled with productivity $y_{i}$, paying wage w: $J(y_{i}, w)$
\end{enumerate}
\item Vacant flow value:
\begin{align}
rV(y_{i},w,\theta) = -\kappa + q(\theta)(J(y_{i},w) - V(y_{i},w,\theta))
\end{align}
\item Matched flow value:
\begin{align}
rJ(y_{i},w) = y_{i} - w + \delta(V(y_{i},w,\theta) - J(y_{i},w))
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Firm Value Functions II}
\begin{itemize}
\item Value functions:
\begin{enumerate}
\item Vacant with productivity $y_{i}$: $V(y_{i},w,\theta)$
\item Filled with productivity $y_{i}$, paying wage w: $J(y_{i}, w)$
\end{enumerate}
\item In equilibrium $V(y_{i},w,\theta) = 0$:
\begin{align}
rJ(y_{i},w) = y_{i} - w - \delta J(y_{i},w)
\end{align}
\item Asset value of vacancy in submarket $(y_{i},w,\theta)$:
\begin{align}
(r + q(\theta))V(y_{i},w,\theta) &= q(\theta)\frac{y_{i} - w}{r + \delta} - \kappa
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Equilibrium}
\begin{itemize}
\item We will be interested in the same equilibrium objects, but now for each submarket $i$:
\begin{enumerate}
\item Wages $w_{i}$;
\item unemployment $u_{i}$;
\item $\theta_{i} = \frac{v_{i}}{u_{i}}$ vacancies in each submarket.
\end{enumerate}
\item Before, 1 \& 3 were separate equilibrium conditions.
\item New equilibrium objects
\begin{enumerate}
\item set of open submarkets, $\mathcal{I}$;
\item value of unemployment $\bar{V}(U)$
\end{enumerate}
\item Market maker sets wages according to
\begin{align}
\max_{w} V(y_{i},w,\theta(w;U))
\end{align}
\item Given $p(\theta)$ from worker's problem, find $w$ that maximizes value of vacancy.
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Free Entry}
\begin{itemize}
\vfill \item Free entry implies that the expected value of opening a vacancy will be equal to the cost of opening it $\chi$
\vfill \item The expected value of opening a vacancy
$$\bar{V}(U) = \sum_{i=\iota(U)}^{n} f_i V(y_i,w_i^*(U),\theta_i^*(U))$$
\vfill \item equilibrium:
$$\bar{V}(U) = \kappa$$
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Equilibrium Number of Markets}
\begin{itemize}
\vfill \item We know that each productivity will form a separate market
\vfill \item There are $n$ productivities in the distribution
\vfill \item All submarkets such that $w_i \ge rU$ will remain open
\vfill \item Let $\iota$ denote the lowest submarket open
\end{itemize}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{``Competitive'' Search}
\begin{itemize}
\item What is shaded region?
\end{itemize}
\centering\includegraphics[width=0.8\textwidth]{Moen1.png}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{``Competitive'' Search}
\begin{itemize}
\item Inefficiency (rejected matches in DMP)
\end{itemize}
\centering\includegraphics[width=0.8\textwidth]{Moen2.png}
\end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{Equilibrium}
\begin{itemize}
\item The resulting competitive equilibrium with frictional labor markets is characterized by the following equations
\begin{align}
\bar{V}(U) &= \chi\\
w_{i} &= \arg\max V(y_{i},w,\theta(w;U)), i\geq i_{R}\\
rU_{i} &= \frac{(r + \delta)z + p(\theta_{i})w_{i}}{(r + \delta + p(\theta_{i}))}, i\geq i_{R}\\
\dot{u}_{i} &= 0; u_{i}p(\theta_{i}) = e_{i}\delta\\
\sum_{i}u_{i} &= u
\end{align}
\end{itemize}
\end{frame}
% ------------------------------------------------
% \begin{frame}
% \frametitle{Wage Posting}
% \begin{itemize}
% \item In previous description, wages were ``announced in equilibrium'' by a market maker.
% \item Would firms choose to deviate if they set their own wages?
% \item Suppose firms deviate and offer $w'$:
% \end{itemize}
% \centering\includegraphics[width=0.7\textwidth]{Moen3.png}
% \end{frame}
% % ------------------------------------------------
% \begin{frame}
% \frametitle{Wage Dispersion}
% \begin{itemize}
% \item Absent any ex ante heterogeneity on the worker side, is there still wage dispersion?
% \item Workers indifferent between open submarkets in equilibrium:
% \end{itemize}
% \centering\includegraphics[width=0.7\textwidth]{Moen4.png}
% \end{frame}
% ------------------------------------------------
\begin{frame}
\frametitle{What is ``valuable'' about directed search?}
\begin{itemize}
\item Submarkets are individually priced.
\item i.e., contracts $(w,\theta)$ are known given the state of the worker and firm.
\item Then, assuming that free entry binds in every open submarket, no longer need to condition on aggregate distributions as state variables (Menzio and Shi, 2011).
\item So models are computationally tractable.
\item Makes it possible to easily incorporate heterogeneity.
\end{itemize}
\end{frame}
% ------------------------------------------------
\section{Conclusion}
% ------------------------------------------------
\begin{frame}
\frametitle{Conclusion}
\begin{itemize}
\item Thank you for a good semester!
\item Hope everyone has a good summer and please come visit once we can all be in person.
\item Final on Friday, 24 hours to take exam, 3 hours to complete once started.
\item 3 questions, anything is fair game.
\end{itemize}
\end{frame}
\end{document}
|
https://ctan.math.washington.edu/tex-archive/info/examples/lgc2/5-13-27.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656104597905.85/warc/CC-MAIN-20220705174927-20220705204927-00414.warc.gz | 237,095,598 | 1,103 | %%
%% The LaTeX Graphics Companion, 2ed (first printing May 2007)
%%
%% Example 5-13-27 on page 292.
%%
%% Copyright (C) 2007 Michel Goossens, Frank Mittelbach, Denis Roegel, Sebastian Rahtz, Herbert Vo\ss
%%
%% 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.
%%
\documentclass{ttctexa}
\pagestyle{empty}
\setcounter{page}{6}
\setlength\textwidth{183.83385pt}
\StartShownPreambleCommands
\usepackage{pstricks}
\StopShownPreambleCommands
\begin{document}
\begin{pspicture}[showgrid=true](0,1)(3,3)
\pscustom[linewidth=1.5pt]{%
\moveto(0.5,1)
\rcurveto(0.5,2)(1.5,0)(2.5,2)}
\end{pspicture}
\end{document}
|
https://reference.macsur.eu/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%204722%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= | macsur.eu | CC-MAIN-2021-04 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2021-04/segments/1610703538082.57/warc/CC-MAIN-20210123125715-20210123155715-00512.warc.gz | 505,891,344 | 1,404 | %&LaTeX
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Seddaiu_etal2016} Seddaiu, G., Iocola, I., Farina, R., Orsini, R., Iezzi, G., \& Roggero, P. P. (2016). Long term effects of tillage practices and N fertilization in rainfed Mediterranean cropping systems: durum wheat, sunflower and maize grain yield. \textit{European Journal of Agronomy}, \textit{77}, 166--178.
\end{thebibliography}
\end{document}
|
https://ctan.math.washington.edu/tex-archive/macros/latex-dev/base/testpage.tex | washington.edu | CC-MAIN-2023-14 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2023-14/segments/1679296945183.40/warc/CC-MAIN-20230323194025-20230323224025-00031.warc.gz | 239,959,115 | 2,600 | % \iffalse meta-comment
%
% Copyright (C) 1993-2023
% The LaTeX 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
% https://www.latex-project.org/lppl.txt
% and version 1.3c or later is part of all distributions of LaTeX
% version 2008 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
% testpage.tex - created 21 January 1994.
% Copyright (C) 1994 by Rainer Schoepf
%
% Test of how accurately printer reproduces dimensions specified
% by LaTeX output.
\typeout{}
\typeout{*****************************************************}
\typeout{* Type paper type in form of document class option,}
\typeout{* e.g., `a4paper' or `letterpaper' (without the quotes).}
\typein[\papertype]{*************************************%
**************}
\typeout{}
\typeout{*****************************************************}
\typeout{* Do you want to produce two test pages for use with}
\typeout{* a double sided printer? (y/n)}
\typein[\doublesided]{*************************************%
**************}
\documentclass[\papertype]{article}
\usepackage{ifthen}
\pagestyle{empty}
\nofiles
\setlength{\oddsidemargin}{0pt}
\setlength{\evensidemargin}{0pt}
\setlength{\marginparwidth}{1in}
\setlength{\marginparsep}{0pt}
\setlength{\topmargin}{0pt}
\setlength{\headheight}{0pt}
\setlength{\headsep}{0pt}
\setlength{\topskip}{0pt}
\setlength{\footskip}{0pt}
\setlength{\textwidth}{\paperwidth}
\addtolength{\textwidth}{-2in}
\setlength{\textheight}{\paperheight}
\addtolength{\textheight}{-2in}
\setlength{\parindent}{0pt}
\setlength{\unitlength}{1sp}
\newcounter{textheight}
\newcounter{textwidth}
\setcounter{textheight}{\textheight}
\setcounter{textwidth}{\textwidth}
\newlength{\help}
\newcounter{help}
\newcommand{\sethelpcounter}[2]{%
\setlength{\help}{#2}\setcounter{#1}{\help}}
\newcounter{in}
\newcounter{halfin}
\newcounter{fifthin}
\newcounter{tenthin}
\newcounter{twtin}
\setlength{\help}{1in}
\setcounter{in}{\help}
\setlength{\help}{0.5in}
\setcounter{halfin}{\help}
\setlength{\help}{0.2in}
\setcounter{fifthin}{\help}
\setlength{\help}{0.1in}
\setcounter{tenthin}{\help}
\setlength{\help}{0.05in}
\setcounter{twtin}{\help}
\newcounter{mm}
\newcounter{tmm}
\newcounter{frmm}
\newcounter{fvmm}
\newcounter{tenmm}
\setlength{\help}{1mm}
\setcounter{mm}{\help}
\setlength{\help}{2mm}
\setcounter{tmm}{\help}
\setlength{\help}{4mm}
\setcounter{frmm}{\help}
\setlength{\help}{5mm}
\setcounter{fvmm}{\help}
\setlength{\help}{10mm}
\setcounter{tenmm}{\help}
\newcounter{foo}
\newcounter{x}
\newcounter{y}
\newcommand{\addtox}{\addtocounter{x}}
\newcommand{\addtoy}{\addtocounter{y}}
\newcommand{\putxy}{\put(\value{x},\value{y})}
\newcommand{\multiputxy}{\multiput(\value{x},\value{y})}
\begin{document}
\begin{picture}(0,0)
\scriptsize
\put(0,-\value{textheight}){%
\framebox(\value{textwidth},\value{textheight}){}}
% left mm ruler
\setcounter{x}{0}
\sethelpcounter{y}{-0.45\textheight}
\putxy{\line(-1,0){\value{in}}}
\addtox{-\value{fvmm}}
\addtoy{-\value{tmm}}
\multiputxy(-\value{fvmm},0){5}{\line(0,1){\value{frmm}}}
\addtoy{\value{mm}}
\multiput(-\value{mm},\value{y})(-\value{mm},0){25}%
{\line(0,1){\value{tmm}}}
\addtoy{\value{frmm}}
\setcounter{foo}{1}
\multiput(-\value{tenmm},\value{y})(-\value{tenmm},0){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% left in ruler
\setcounter{x}{0}
\sethelpcounter{y}{-0.55\textheight}
\putxy{\line(-1,0){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(-\value{tenthin},0){10}{\line(0,1){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(-\value{tenthin},0){10}{\line(0,1){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{-\value{twtin}}
\addtoy{\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(-\value{tenthin},0){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% right mm ruler
\sethelpcounter{x}{\textwidth}
\sethelpcounter{y}{-0.45\textheight}
\putxy{\line(1,0){\value{in}}}
\addtox{\value{mm}}
\addtoy{-\value{mm}}
\multiputxy(\value{mm},0){25}{\line(0,1){\value{tmm}}}
\addtox{\value{frmm}}
\addtoy{-\value{mm}}
\multiputxy(\value{fvmm},0){5}{\line(0,1){\value{frmm}}}
\addtox{\value{fvmm}}
\addtoy{\value{fvmm}}
\setcounter{foo}{1}
\multiputxy(\value{tenmm},0){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% right in ruler
\sethelpcounter{x}{\textwidth}
\sethelpcounter{y}{-0.55\textheight}
\putxy{\line(1,0){\value{in}}}
\addtox{\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(\value{tenthin},0){10}{%
\line(0,1){\value{fifthin}}}
\addtox{-\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(\value{tenthin},0){10}{%
\line(0,1){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{twtin}}
\addtoy{\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(\value{tenthin},0){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% top mm ruler
\sethelpcounter{x}{0.45\textwidth}
\setcounter{y}{0}
\putxy{\line(0,1){\value{in}}}
\addtox{-\value{tmm}}
\addtoy{\value{fvmm}}
\multiputxy(0,\value{fvmm}){5}{\line(1,0){\value{frmm}}}
\addtox{\value{mm}}
\addtoy{-\value{frmm}}
\multiputxy(0,\value{mm}){25}{\line(1,0){\value{tmm}}}
\setcounter{foo}{1}
\addtox{-\value{tmm}}
\addtoy{-\value{mm}}
\addtoy{\value{tenmm}}
\multiputxy(0,\value{tenmm}){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% top in ruler
\sethelpcounter{x}{0.55\textwidth}
\setcounter{y}{0}
\putxy{\line(0,1){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(0,\value{tenthin}){10}{\line(1,0){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{-\value{twtin}}
\multiputxy(0,\value{tenthin}){10}{\line(1,0){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{fifthin}}
\addtoy{\value{twtin}}
\multiputxy(0,\value{tenthin}){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% bottom mm ruler
\sethelpcounter{x}{0.45\textwidth}
\setcounter{y}{-\textheight}
\putxy{\line(0,-1){\value{in}}}
\addtox{-\value{tmm}}
\addtoy{-\value{fvmm}}
\multiputxy(0,-\value{fvmm}){5}{\line(1,0){\value{frmm}}}
\addtox{\value{mm}}
\addtoy{\value{frmm}}
\multiputxy(0,-\value{mm}){25}{\line(1,0){\value{tmm}}}
\setcounter{foo}{1}
\addtox{-\value{tmm}}
\addtoy{\value{mm}}
\addtoy{-\value{tenmm}}
\multiputxy(0,-\value{tenmm}){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% bottom in ruler
\sethelpcounter{x}{0.55\textwidth}
\setcounter{y}{-\textheight}
\putxy{\line(0,-1){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(0,-\value{tenthin}){10}{\line(1,0){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(0,-\value{tenthin}){10}{\line(1,0){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{fifthin}}
\addtoy{-\value{twtin}}
\multiputxy(0,-\value{tenthin}){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
\end{picture}
\setlength{\help}{\textwidth}
\addtolength{\help}{-2in}
\vfill
\mbox{}\hfill
\begin{minipage}{\help}
The frame on this page should be one
inch from each edge of the paper.\\[10pt]
The rulers at the four edges will indicate how much of the page is
useable. The ticks of the left and top rulers are $1 {\rm mm}$ apart.
The large ticks are $.1''$ apart.
\end{minipage}
\hfill\mbox{}
\vfill
\mbox{}
\ifthenelse{\equal{\doublesided}{y}}{\newpage}{\end{document}}
\begin{picture}(0,0)
\scriptsize
\put(0,-\value{textheight}){%
\framebox(\value{textwidth},\value{textheight}){}}
% left mm ruler
\setcounter{x}{0}
\sethelpcounter{y}{-0.45\textheight}
\putxy{\line(-1,0){\value{in}}}
\addtox{-\value{fvmm}}
\addtoy{-\value{tmm}}
\multiputxy(-\value{fvmm},0){5}{\line(0,1){\value{frmm}}}
\addtoy{\value{mm}}
\multiput(-\value{mm},\value{y})(-\value{mm},0){25}%
{\line(0,1){\value{tmm}}}
\addtoy{\value{frmm}}
\setcounter{foo}{1}
\multiput(-\value{tenmm},\value{y})(-\value{tenmm},0){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% left in ruler
\setcounter{x}{0}
\sethelpcounter{y}{-0.55\textheight}
\putxy{\line(-1,0){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(-\value{tenthin},0){10}{\line(0,1){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(-\value{tenthin},0){10}{\line(0,1){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{-\value{twtin}}
\addtoy{\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(-\value{tenthin},0){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% right mm ruler
\sethelpcounter{x}{\textwidth}
\sethelpcounter{y}{-0.45\textheight}
\putxy{\line(1,0){\value{in}}}
\addtox{\value{mm}}
\addtoy{-\value{mm}}
\multiputxy(\value{mm},0){25}{\line(0,1){\value{tmm}}}
\addtox{\value{frmm}}
\addtoy{-\value{mm}}
\multiputxy(\value{fvmm},0){5}{\line(0,1){\value{frmm}}}
\addtox{\value{fvmm}}
\addtoy{\value{fvmm}}
\setcounter{foo}{1}
\multiputxy(\value{tenmm},0){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% right in ruler
\sethelpcounter{x}{\textwidth}
\sethelpcounter{y}{-0.55\textheight}
\putxy{\line(1,0){\value{in}}}
\addtox{\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(\value{tenthin},0){10}{%
\line(0,1){\value{fifthin}}}
\addtox{-\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(\value{tenthin},0){10}{%
\line(0,1){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{twtin}}
\addtoy{\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(\value{tenthin},0){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% top mm ruler
\sethelpcounter{x}{0.45\textwidth}
\setcounter{y}{0}
\putxy{\line(0,1){\value{in}}}
\addtox{-\value{tmm}}
\addtoy{\value{fvmm}}
\multiputxy(0,\value{fvmm}){5}{\line(1,0){\value{frmm}}}
\addtox{\value{mm}}
\addtoy{-\value{frmm}}
\multiputxy(0,\value{mm}){25}{\line(1,0){\value{tmm}}}
\setcounter{foo}{1}
\addtox{-\value{tmm}}
\addtoy{-\value{mm}}
\addtoy{\value{tenmm}}
\multiputxy(0,\value{tenmm}){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% top in ruler
\sethelpcounter{x}{0.55\textwidth}
\setcounter{y}{0}
\putxy{\line(0,1){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{\value{tenthin}}
\multiputxy(0,\value{tenthin}){10}{\line(1,0){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{-\value{twtin}}
\multiputxy(0,\value{tenthin}){10}{\line(1,0){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{fifthin}}
\addtoy{\value{twtin}}
\multiputxy(0,\value{tenthin}){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% bottom mm ruler
\sethelpcounter{x}{0.45\textwidth}
\setcounter{y}{-\textheight}
\putxy{\line(0,-1){\value{in}}}
\addtox{-\value{tmm}}
\addtoy{-\value{fvmm}}
\multiputxy(0,-\value{fvmm}){5}{\line(1,0){\value{frmm}}}
\addtox{\value{mm}}
\addtoy{\value{frmm}}
\multiputxy(0,-\value{mm}){25}{\line(1,0){\value{tmm}}}
\setcounter{foo}{1}
\addtox{-\value{tmm}}
\addtoy{\value{mm}}
\addtoy{-\value{tenmm}}
\multiputxy(0,-\value{tenmm}){2}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
% bottom in ruler
\sethelpcounter{x}{0.55\textwidth}
\setcounter{y}{-\textheight}
\putxy{\line(0,-1){\value{in}}}
\addtox{-\value{tenthin}}
\addtoy{-\value{tenthin}}
\multiputxy(0,-\value{tenthin}){10}{\line(1,0){\value{fifthin}}}
\addtox{\value{twtin}}
\addtoy{\value{twtin}}
\multiputxy(0,-\value{tenthin}){10}{\line(1,0){\value{tenthin}}}
\setcounter{foo}{1}
\addtox{\value{fifthin}}
\addtoy{-\value{twtin}}
\multiputxy(0,-\value{tenthin}){9}{%
\makebox(0,0){\arabic{foo}}\addtocounter{foo}{1}}
\end{picture}
\setlength{\help}{\textwidth}
\addtolength{\help}{-2in}
\vfill
\mbox{}\hfill
\begin{minipage}{\help}
The frame on this page should be one
inch from each edge of the paper.\\[10pt]
The rulers at the four edges will indicate how much of the page is
useable. The ticks of the left and top rulers are $1 {\rm mm}$ apart.
The large ticks are $.1''$ apart.
\end{minipage}
\hfill\mbox{}
\vfill
\mbox{}
\end{document}
|
https://mirrors.ibiblio.org/CTAN/usergrps/uktug/baskervi/6_4/faqa.sty | ibiblio.org | CC-MAIN-2022-49 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-49/segments/1669446710801.42/warc/CC-MAIN-20221201053355-20221201083355-00330.warc.gz | 439,482,530 | 6,116 | % This is a LaTeX2e package for the UKTUG FAQ document.
%
\ProvidesPackage{faqa}[1996/07/22 UK TUG package for TeX FAQ]
%
% uses production LaTeX 2e commands
\NeedsTeXFormat{LaTeX2e}[1994/06/01]% at least!
%
% version 0.1 RF 1994/09/26
% 0.2 RF 1994/10/09-15
% 0.3 RF 1994/10/16 (after suggestions from Alan Jeffrey)
% 0.4 RF 1994/10/22
%
\def\fileversion{1.0b}
\def\filedate{1996/01/19}
%
\typeout{UK TUG FAQ macros v\fileversion, \filedate}
%
% what fonts are we going to typeset in?
% well not times for sure
\InputIfFileExists{faqfont.cfg}%
{\typeout{FAQ -- loading font configuration file faqfont.cfg}}
{\RequirePackage{times}%
% stretchability recommendations from psnfss2e.tex
\tolerance800
\emergencystretch2em
\doublehyphendemerits5000
\hfuzz0pt
\leftskip0pt minus 1pt
\rightskip0pt minus 1pt
% use cmtt for typewriter rather than Cou-beastly-rier
\renewcommand{\ttdefault}{cmtt}%
\@ifundefined{Dings}{\RequirePackage{pifont}%
\def\Dings{\nopagebreak{\footnotesize
\dingline{167}}}}%
{}}
%
% general support
%\RequirePackage{calc}
%
% code for handling logo font
\RequirePackage{mflogo}
%
% get texnames package (as amended)
\RequirePackage{texnames}
%
% ifthenelse for the undefined references
\RequirePackage{ifthen}
%
% we define html only stuff using Eijkhout's package
%\RequirePackage{comment}
%\excludecomment{htmlversion}
%
% the Baskerville and other logos and abbreviations
\providecommand\BV{\emph{Baskerville}}
\providecommand\DANTE{\acro{DANTE}\@}
\providecommand\MSDOS{\acro{MS-DOS}\@}
\providecommand\CDROM{\acro{CD-ROM}\@}
\providecommand\TeXXeT{\TeX-{}-X\lower.5ex\hbox{E}\kern-.1667emT\@}
\providecommand\MLTeX{ML-\TeX}
\def\careof{\leavevmode\hbox{\raise.75ex\hbox{c}\kern-.15em
/\kern-.125em\smash{\lower.3ex\hbox{o}}}}
%
% \cs{SMC} \emph{isn't} small caps~--- Barbara Beeton says she thinks
% of it as ``big small caps''. She says (modulo capitalisation of
% things\dots):
% \begin{quote}
% For the things it's used for, regular small caps are not
% appropriate~--- they're too small. Real small caps are
% appropriate for author names (and are so used in continental
% bibliographies), section headings, running heads, and, on
% occasion, words to which some emphasis is to be given. \cs{SMC}
% was designed to be used for acronyms and all-caps abbreviations,
% which look terrible in small caps, but nearly as bad in all caps
% in the regular text size. The principle of using ``one size
% smaller'' than the text size is similar to the design of caps in
% German~--- where they are smaller relative to lowercase than are
% caps in fonts intended for English, to improve the appearance of
% regular text in which caps are used at the heads of all nouns, not
% just at the beginnings of sentences.
% \end{quote}
%
% We define this in terms of the memory of the size currently selected
% that's maintained in \cs{@currsize}: if the user does something
% silly re.~selecting fonts, we'll get the wrong results. The
% following code is adapted from |relsize.sty| by Donald Arseneau and
% Matt Swift, from a 2.09 original by Bernie Cosell. (Note that the
% order of examination of \cs{@currsize} is to get the commonest cases
% out of the way first.)
% \begin{macrocode}
%<!latex2e>\def\SMC{\small}
%<*latex2e>
\DeclareRobustCommand\SMC{%
\ifx\@currsize\normalsize\small\else
\ifx\@currsize\small\footnotesize\else
\ifx\@currsize\footnotesize\scriptsize\else
\ifx\@currsize\large\normalsize\else
\ifx\@currsize\Large\large\else
\ifx\@currsize\LARGE\Large\else
\ifx\@currsize\scriptsize\tiny\else
\ifx\@currsize\tiny\tiny\else
\ifx\@currsize\huge\LARGE\else
\ifx\@currsize\Huge\huge\else
\small\SMC@unknown@warning
\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi
}
\newcommand\SMC@unknown@warning{\PackageWarning{faq}{Unknown text font
size command -- using \string\small}}
\DeclareRobustCommand\textSMC[1]{{\SMC #1}}
% \end{macrocode}
%
% The \cs{acro} command uses \cs{SMC} as it was originally intended.
% Note that, since most of these things are uppercase-only names, it
% fiddles with the spacefactor after inserting its text.
%
% \begin{macrocode}
\DeclareRobustCommand\acro[1]{\textSMC{#1}\@}
%</latex2e>
%<!latex>\def\acro#1{{\SMC #1}\spacefactor\@m}
%<!latex2e>\def\acro#1{{\SMC #1}\@}
% \end{macrocode}
%
%\TUGboat (effectively) takes arguments {<empty>}vol(issue)
\DeclareRobustCommand\TUGboat[1]{\expandafter\@TUGboat\ignorespaces}
\def\@TUGboat#1(#2){\textsl{TUGboat} \textbf{#1}(#2)}
%
% The NTS and eTeX (and for consistency Eplain) logos
\DeclareRobustCommand\NTS{$\mathcal{N}$\lower.5ex\hbox
{$\mathcal{T}$}$\mathcal{S}$\@}
\DeclareRobustCommand\eTeX{{$\varepsilon$}-\TeX}
\DeclareRobustCommand\Eplain{Eplain}
%
% Other odds and ends (appear differently in TeX and http or plain
% text
\DeclareRobustCommand\WYSIWYG{\textsc{wysiwyg}}
%
% Command for doing `square one' :-}
\newcommand\sqfbox[1]{\framebox{\makebox[\totalheight]{#1\/}}}
%
% Here's a \fullline macro that works in lists and so on
\newcommand\fullline[1]{\@tempdima\hsize\relax
\advance\@tempdima-\leftmargin\relax
\advance\@tempdima-\rightmargin\relax
\hb@xt@\@tempdima{#1}}
%
% 2e's LaTeX logo sets the A in scripstyle jammed up to the top of the T; it
% also has the advantage that it's set in the same font as the
% surrounding text. However, the esteemed bbeeton says the logo looks
% "squidge awful" in italic text (I agree; and the same is true of its
% behaviour in slanted text)
%
% So here's a version that allows for the slant of the leading L
\DeclareRobustCommand{\LaTeX}{L%
{\setbox0\hbox{T}%
\setbox\@tempboxa\hbox{$\m@th$%
\csname S@\f@size\endcsname
\fontsize\sf@size\z@
\math@fontsfalse\selectfont
A}%
\@tempdima\ht0
\advance\@tempdima-\ht\@tempboxa
\@tempdima\strip@pt\fontdimen1\font\@tempdima
\advance\@tempdima-.36em
\kern\@tempdima
\vbox to\ht0{\box\@tempboxa
\vss}%
}%
\kern-.15em
\TeX}
%
% Ditto for \AllTeX (as used in TUGboat)
\DeclareRobustCommand{\AllTeX}{(L%
{\setbox0\hbox{T}%
\setbox\@tempboxa\hbox{$\m@th$%
\csname S@\f@size\endcsname
\fontsize\sf@size\z@
\math@fontsfalse\selectfont
A}%
\@tempdima\ht0
\advance\@tempdima-\ht\@tempboxa
\@tempdima\strip@pt\fontdimen1\font\@tempdima
\advance\@tempdima-.36em
\kern\@tempdima
\vbox to\ht0{\box\@tempboxa
\vss}%
}\kern-.075em)%
\kern-.075em\TeX}
%
% A similar game is used in defining an `all LaTeX' sort of thing:
\DeclareRobustCommand\twee{2$_{\textstyle\varepsilon}$}
%
% it proves that, for Alan's stuff, the following needs to have been
% done _before_ we define the macros
\RequirePackage{shortvrb}
\MakeShortVerb{\|}
%
% A command which sets some text in typewriter, with the hyphenchar
% temporarily set to its first argument \FAQverb\HYPHEN{TEXT}.
% NB: This requires no catcode hackery, so should work inside moving
% arguments. It will, however, produce spurious spaces after CSs, and
% won't allow brace-unmatched input. It also won't survive going into a
% moving argument if \HYPHEN won't.
%
\let\FAQverbFamily\ttfamily
\DeclareRobustCommand{\FAQverb}[2]{{%
\ifvmode\leavevmode\fi
\lefthyphenmin=256\setlanguage\language
\FAQverbFamily\hyphenchar\the\font`#1\relax
\def\@tempa{#2}%
\expandafter\@faq@strip\meaning\@tempa\@faq@strip
\hyphenchar\the\font\m@ne
}\setlanguage\language}
\def\@faq@strip#1->#2\@faq@strip{#2}
%
% Document markup:
%
\makeatother % because @ is a delimiter here, it had better have the
% same catcode as it will when the macro's invoked
\def\Email|#1@#2|{\FAQverb\-{#1@}\penalty10\FAQverb\.{#2}} % email
\def\Emaildot|#1@#2|{\FAQverb\.{#1@}\penalty10\FAQverb\.{#2}}
\makeatletter
\def\FTP|#1|{\FAQverb\.{#1}} % FTP site
\def\File|#1|{\FAQverb\/{#1}} % file name
\def\CTAN{\FAQverb\/} % CTAN path
\def\Newsgroup|#1|{\FAQverb\.{#1}} % newsgroup
\def\URL|#1://#2/#3|{\FAQverb\.{#1://#2/}\penalty10\FAQverb\/{#3}}
\def\path|#1|{\FAQverb\/{#1}} % generic path
%
% same game, slightly different style
\def\ProgName|#1|{% % program name
{%
\def\FAQverbFamily{\rmfamily\mdseries\itshape}%
\FAQverb\_{#1}\/%
}%
}
\let\Package\ProgName % pro tem
%
% ISBN references
\def\ISBN#1{\mbox{\acro{ISBN}}~#1}
%
% have we read the CTAN references?
\newif\ifnotreadCTAN \notreadCTANtrue
%
% Alan's code for CTAN references:
%
% define a location for a package on CTAN
% #1 is the package name
% #2 is the CTAN path to the thing
% a package in a directory
\newcommand{\CTANdirectory}[2]{\@ifundefined{ctan-#1}{%
\expandafter\gdef\csname ctan-#1\endcsname{#2}%
}{%
\PackageWarning{faq}{Repeated definition of label: #1}%
}}
%
% a package in a single file (the same appearance, but the WWW version is
% different).
\let\CTANfile\CTANdirectory
%
% Make reference to a CTAN package
%
% counter for the undefined references
\newcounter{CTAN@unrefs}
%
% the command itself
\DeclareRobustCommand{\CTANref}[1]{\@ifundefined{ctan-#1}{%
\PackageWarning{CTAN}{Undefined reference: #1}%
\stepcounter{CTAN@unrefs}%
}{%
\edef\@tempa{\noexpand\CTAN{\csname ctan-#1\endcsname}}\@tempa
}}
%
% hook for diagnosing undefined references at the end
\AtEndDocument{\ifthenelse{\theCTAN@unrefs > 0}{%
\PackageWarning{CTAN}{There were \arabic{CTAN@unrefs} undefined
references to CTAN}%
}%
{}%
}
%
% a slight variation of description for lists of book titles
\newcommand{\booklabel}[1]{\hspace\labelsep\normalfont\itshape #1}
\newenvironment{booklist}{\begin{list}{}%
{\labelwidth\z@ \itemindent-\leftmargin \let\makelabel\booklabel}}%
{\end{list}}
%
% proglist is the same as booklist if we're using italics for program
% names, but will need hacking otherwise
\newenvironment{proglist}{\begin{booklist}}{\end{booklist}}
%
% \raggedwithindent is useful when we've got an URL or something
% overrunning the end of the line (and this line is terminated with
% \\)
%
% Typical usage is within the argument of a \nothtml command
\newcommand\raggedwithindent{%
\rightskip=\z@\@plus5em\relax
\spaceskip=.3333em\relax
\xspaceskip=.5em\relax
\hangindent=1pc\relax}
%
% the little bit(s) of code that's(re) going to be ignored when the
% html is generated are enclosed by the following two commands
\let\htmlignore\relax
\let\endhtmlignore\relax
%
% or it's the argument to \nothtml
\newcommand\nothtml[1]{#1}
%
% A Donald Arseneau marvel:
% \@removefromreset{FOO}{BAR} : removes counter FOO from the list of
% counters \cl@BAR to be reset when
% counter BAR is stepped.
% The opposite of \@addtoreset
\def\@removefromreset#1#2{\let\@tempb\@elt
\def\@tempa#1{@}\expandafter\let\csname @*#1*\endcsname\@tempa
\def\@elt##1{\expandafter\ifx\csname @*##1*\endcsname\@tempa\else
\noexpand\@elt{##1}\fi}%
\expandafter\edef\csname cl@#2\endcsname{\csname cl@#2\endcsname}%
\let\@elt\@tempb
\expandafter\let\csname @*#1*\endcsname\@undefined}
%
% the question structure
% \Question[label name]{question asked}
% if [label name] present, the named label is assigned with \Qlabel
\newcommand\Question[2][]{\subsection{\protect\raggedright#2}%
\def\reserved@a{#1}%
\ifx\reserved@a\@empty\else\Qlabel{#1}\fi}
%
% now let's hack around a bit in order to make things slightly
% prettier
%
% first: numbering of subsections -- doesn't include section nos, not
% reset for each section
\renewcommand{\thesubsection}{\arabic{subsection}}
\@removefromreset{subsection}{section}
%
% second: sections `numbered' alphabetically
\renewcommand{\thesection}{\Alph{section}}
%
% third: subquestions (added in between issues ...) are
% subsubsections, and they're lettered as appendages to the questions
% (and reset on them)
\renewcommand\thesubsubsection{\thesubsection\alph{subsubsection}}
\newcommand\subQ[2]{\def\reserved@a{#1}\def\reserved@b{\endhtmlignore}
\ifx\reserved@a\reserved@b
\def\reserved@a{#2}\def\reserved@b{\Question}
\ifx\reserved@a\reserved@b
\else\subQwarning\fi
\else\subQwarning\fi
\SubQuestion}
\newcommand\SubQuestion[2][]{\subsubsection{\protect\raggedright#2}%
\def\reserved@a{#1}%
\ifx\reserved@a\@empty\else\Qlabel{#1}\fi}
\newcommand\subQwarning{\PackageWarning{faq}{\string\subQ must be
followed by \string\endhtmlignore,\MessageBreak
and then by \string\Question}}
%
% tedious farting around to get \subsubsection looking almost like
% \subsection (I have my doubts about this, y'know ;-):
\renewcommand\subsubsection{\@startsection{subsubsection}{2}{\z@}%
{-3.25ex\@plus -1ex \@minus -.2ex}%
{1.5ex \@plus .2ex}%
{\normalfont\large\bfseries}}
\renewcommand*\l@subsubsection{\@dottedtocline{2}{1.5em}{2.3em}}
% The discerning will detect my awful cheek, above, of sticking a
% subsubsection head onto a subsection body...
%
% \Qlabel and \Qref: define and refer to labels
\let\Qlabel\label
\newcommand\Qref[3][see question]{#1~\ref{#3}}
%
% from doc package, then hacked about by yours truly
\DeclareRobustCommand\csx[1]{\def\@tempa{#1}{\FAQverbFamily\char`\\%
\expandafter\@faq@strip\meaning\@tempa\@faq@strip}}
\def\cs|#1|{\csx{#1}}
%
% for comments during maintenance
\def\Q#1{\footnote{{\ttfamily QUERY: #1}}}
%\def\Q#1{\marginpar{{\ttfamily QUERY: #1}}}
%
% Checking structure (null for now)
\newcommand\checked[2]{}
%
% for Alan's benefit
\newbox\@footnoteenvbox
\newenvironment{footnoteenv}
{\begin{lrbox}\@footnoteenvbox\reset@font\footnotesize\ignorespaces}
{\end{lrbox}%
\footnote{\unhbox\@footnoteenvbox}}
%
% end of package
\endinput
|
http://multiagent.fr/Special:CV/Gechter_franck.tex | multiagent.fr | CC-MAIN-2019-26 | application/x-latex | text/x-matlab | crawl-data/CC-MAIN-2019-26/segments/1560627997801.20/warc/CC-MAIN-20190616062650-20190616084650-00436.warc.gz | 117,350,925 | 12,192 | %
% LaTeX style is available on: http://www.arakhne.org/tex-utbm/index.html
% Ubuntu/Debian packages are also available on www.arakhne.org
%
\documentclass[a4paper,oneside,english,nodocumentinfo,article]{upmethodology-document}
\usepackage{graphicx}
\usepackage[utf8x]{inputenc}
\usepackage{wrapfig}
\UseExtension{multiagent.fr}
\declaredocument{Curriculum Vit\ae{} of Franck GECHTER}{}{CV-GECHTER-EN-2019-I37}
\addauthor[[email protected]]{Franck}{GECHTER}
\initialversion[1.0]{\makedate{16}{06}{2019} }{Automatic Generation from website}{\upmpublic}
% For IRTES institute style
\Set{irtes_contact_name}{{Dr.habil.}~{Franck GECHTER}}
\Set{irtes_contact_email}{[email protected]}
\Set{irtes_contact_phone}{0384583817}
% For old SeT lab style
\Set{setlab_contact_name}{{Dr.habil.}~{Franck GECHTER}}
\Set{setlab_contact_email}{[email protected]}
\Set{setlab_contact_phone}{0384583817}
% For new Set lab style
\Set{irtesset_contact_name}{{Dr.habil.}~{Franck GECHTER}}
\Set{irtesset_contact_email}{[email protected]}
\Set{irtesset_contact_phone}{0384583817}
% For Multiagent group style
\Set{mafr_contact_name}{{Dr.habil.}~{Franck GECHTER}}
\Set{mafr_contact_email}{[email protected]}
\Set{mafr_contact_phone}{0384583817}
\gdef\MYBIO{After a Master in engineering and a Master in photonics and image processing from the University L. Pasteur Strasbourg I (France), F. Gechter received the Ph.D. in Computer Science from University H. Poincare Nancy I (France) in 2003, where he served as an assistant Professor from 1999 to 2004 and as researcher at “Laboratoire lOrrain de Recherche en Informatique et ses Applications” (LORIA) from 1999 to 2004. In 2004, he became Associate Professor in Computer Science at {"}Universit{\'e} de Technologie de Belfort-Montbeliard UTBM{"} and Syst{\`e}mes et Transport Laboratory where he is member of the Computer Science: Communications, Agents and Perception Team. He works particularly on Reactive Multi-Agent models applied to problem solving, to decision processes and to data fusion. In 2012, he became also associate researcher to the Fuel Cell Laboratory (CNRS federation of laboratories) to focus on fuel cell systems simulation taking into account multi-level and multi-physics aspects. In 2013, Franck Gechter passed his Habilitation to Lead Research Work (HDR) at the Franche Comt{\'e} University (UFC). In February 2016, he was invited as Academic Visitor in the Digital Technology Group of the Computer Laboratory of the University of Cambridge. Since 2017, he is the head of the LE2I-SeT Research Team.}
\setdocabstract{\MYBIO}
\begin{document}
\begin{center}
\includegraphics[width=.25\linewidth]{anonymous_avatar.png}
\end{center}
\section{Identification}
\begin{tabularx}{\linewidth}{lX}
{\bf Name, Firstname:} & GECHTER Franck \\
{\bf Professional Position:} & Professor \\
{\bf French National Section:} & 27 - Informatique \\
{\bf Teaching Institution:}& Universit\'e de Technologie de Belfort-Montb\'eliard, Rue Thierry Mieg 90010 \textsc{Belfort} cedex, France\\
{\bf Research Laboratory:} & IRTES-SET (Laboratoire Syst\`emes et Transports, Institut de Recherche Transport \'Energie Soci\'et\'e, Belfort, France) \\
{\bf Email:} & [email protected] \\
{\bf Web site:} & http://multiagent.fr/People:Gechter\_franck \\
\end{tabularx}
\vfill
\textcolor{red}{\large This curriculum vit{\ae} is generated by a bot automatically, from data published on the website above. To obtain an official curriculum vit{\ae}, please contact Franck GECHTER directly.}
\section{Biography}
\MYBIO
\newpage
\section{Scientifical Publications}
\noindent\begin{tabularx}{\linewidth}{|X|X|X|X|X|X|X|X|X|X|X|}\hline
\small International journal with reading committee & \small National journal with reading committee & \small National journal without reading committee & \small International conference with proceedings & \small National conference with proceedings & \small International conference without proceedings & \small National conference without proceedings & \small Book & \small Book chapter & \small Invited Conference & \small Popularization Paper \\
\hline
24 & 4 & 2 & 57 & 10 & 1 & 3 & 2 & 3 & 8 & 1 \\
\hline
\end{tabularx}
\subsection{International journal with reading committee}
\subsubsection{2019}
\begin{itemize}
\item {Chen LIU}, {Rui MA}, {Hao BAI}, {\uline{Franck GECHTER}}, {Fei GAO}. ``FPGA-Based Real-time Simulation of High Power Electronic System with Nonlinear IGBT Characteristics.'' In IEEE Journal of Emerging and Selected Topics in Power Electronics, vol. 7(1), pp. 41-51, impact factor : 5.177 ; ranked Q1 (Scimago) ISSN: 2168-6777 (Print), 2168-6785 (Online). DOI: 10.1109/JESTPE.2018.2873157. 2019.
\end{itemize}
\subsubsection{2018}
\begin{itemize}
\item {Chen LIU}, {Xizheng GUO}, {Rui MA}, {Zhongliang LI}, {\uline{Franck GECHTER}}, {Fei GAO}. ``A System-Level FPGA-based Hardware-in-the-Loop Test of High-speed Train.'' In IEEE Transactions on Transportation Electrification, vol. 4(4), pp. 912-921 ISSN: 2332-7782. DOI: 10.1109/TTE.2018.2866696. 2018.
\item {Rui MA}, {Chen LIU}, {Zhixue ZHENG}, {\uline{Franck GECHTER}}, {Pascal BRIOIS}, {Fei GAO}. ``CPU-FPGA based Real-time Simulation of Fuel Cell Electric Vehicle.'' In Energy Conversion and Management, vol. 174, pp. 983-997, Elsevier, Ranked Q1 (Scimago) DOI: https://doi.org/10.1016/j.enconman.2018.08.099. 2018.
\item {Chen LIU}, {Rui MA}, {Zhongliang LI}, {\uline{Franck GECHTER}}, {Fei GAO}. ``Hybrid Modeling of Power Electronic System for Hardware-in-the-loop Application.'' In Journal of Electric Power Systems Research, Impact Factor = 2.856 2018.
\item {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}, {Christophe DEBAIN}, {Baudouin DAFFLON}, {Madeleine EL ZAHER}, {Romuald AUFR{\`E}RE}, {Roland CHAPUIS}, {Jean-Pierre DERUTIN}. ``Platoon Control Algorithm Evaluation: Metrics, Configurations, Perturbations and Scenarios.'' In Journal of Testing and Evaluation, vol. 48(2), Published electronically in 2018 to be published in Volume 48 Issue 2 in march 2020, ranked Q2 (Scimago) ISSN: ISSN 0090-3973. DOI: 10.1520/JTE20170347. 2018.
\item {Chen LIU}, {Fei GAO}, {Rui MA}, {\uline{Franck GECHTER}}. ``A New Approach for FPGA-based Real-time Simulation of Power Electronic System with no Simulation Latency in Subsystem Partitioning.'' In International Journal of Electrical Power and Energy Systems, vol. 99, pp. 650-658, Elsevier, impact factor= 3.610; ranked Q1 (Scimago) DOI: https://doi.org/10.1016/j.ijepes.2018.01.053. 2018.
\end{itemize}
\subsubsection{2017}
\begin{itemize}
\item {Baudouin DAFFLON}, {Maxime GUERIAU}, {\uline{Franck GECHTER}}. ``Using Physics Inspired Wave Agents in a Virtual Environment: Longitudinal Distance Control in Robots Platoon.'' In International Journal of Monitoring and Surveillance Technologies Research, vol. 5(2), pp. 15-28, IGI Publishing Hershey, PA, USA DOI: 10.4018/IJMSTR.2017040102. 2017.
\item {Baudouin DAFFLON}, {Maxime GUERIAU}, {\uline{Franck GECHTER}}. ``ViPS: A simulator for platoon system evaluation.'' In Simulation Modelling Practice and Theory (SIMPAT), vol. 77, pp. 157-176, ranked Q1 (Software) Q2 (Modeling and Simulation) (Scimago) 2017.
\end{itemize}
\subsubsection{2016}
\begin{itemize}
\item {Madeleine EL ZAHER}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Mohamed HAJJAM}. ``An interaction model for a local approach to vehicle platoons.'' In International Journal of Vehicle Autonomous Systems, vol. 13(2), Inderscience, ranked Q4 (Scimago) ISSN: 1471-0226. DOI: 10.1504/IJVAS.2016.078760. 2016.
\end{itemize}
\subsubsection{2015}
\begin{itemize}
\item {Bofei CHEN}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Multi-level decision system for the crossroad scenario.'' In Procedia Computer Science (Selected paper from the International Conference on Computational Science ICCS 2015) 2015.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Jos{\'e} VILCA}, {Lounis ADOUANE}. ``Adaptive Autonomous Navigation using Reactive Multi-agents System for Control Laws Merging.'' In Procedia Computer Science (Selected paper from the International Conference on Computational Science ICCS 2015) 2015.
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Ludovic LEFOULON}. ``Autonomous emergent painting triggered by music and motion.'' In International Journal of Arts and Technology, vol. 8(1), ranked Q1 (Visual arts and performing arts) (Scimago) DOI: 10.1504/IJART.2015.067392. 2015.
\end{itemize}
\subsubsection{2014}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Bruno RONZANI}, {Fabien RIOLI}. ``Sphericall: A Human/Artificial Intelligence interaction experience.'' In International Journal of Artificial Intelligence and Interactive Multimedia DOI: 10.9781/ijimai.2014.317. 2014.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}. ``Making Decision with reactive multi-agent systems: A possible alternative to regular decision processes for platoon control issue.'' In Research in Computing Science, vol. 10(3), Selected paper from the MICAI International Conference ISSN: 1870-4069. 2014.
\end{itemize}
\subsubsection{2013}
\begin{itemize}
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Vehicle platoon and obstacle avoidance: a reactive agent approach.'' In IET Intelligent Transport Systems, (3), pp. 257-264(7), Institution of Engineering and Technology ISSN: 1751-956X. 2013.
\item {Gillian BASSO}, {Nicolas GAUD}, {\uline{Franck GECHTER}}, {Vincent HILAIRE}, {Fabrice LAURI}. ``A Framework for Qualifying and Evaluating Smart Grids Approaches: Focus on Multi-Agent Technologies.'' In Smart Grid and Renewable Energy, vol. 4(4) DOI: 10.4236/sgre.2013.44040. 2013.
\item {Vincent HILAIRE}, {Massimo COSSENTINO}, {\uline{Franck GECHTER}}, {Sebastian RODRIGUEZ}, {Abderrafiaa KOUKAM}. ``An approach for the integration of swarm intelligence in {MAS}: an engineering perspective.'' In Expert Systems with Applications, vol. 40(4), pp. 1323-1332 DOI: http://dx.doi.org/10.1016/j.eswa.2012.08.058. 2013.
\end{itemize}
\subsubsection{2012}
\begin{itemize}
\item {Madeleine EL ZAHER}, {Jean-Michel CONTET}, {Pablo GRUER}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Compositional verification for reactive multi-agent systems applied to Platoon non collision verification.'' In Studia Informatica Universalis, vol. 10(3) 2012.
\item {Madeleine EL ZAHER}, {Baudouin DAFFLON}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}. ``Vehicle platoon control with multi-configuration ability.'' In Procedia Computer Science CS, vol. 9, pp. 1503-1512 2012.
\item {\uline{Franck GECHTER}}, {Jean-Michel CONTET}, {Olivier LAMOTTE}, {St{\'e}phane GALLAND}, {Abderrafiaa KOUKAM}. ``Virtual Intelligent Vehicle Urban Simulator: Application to Vehicle Platoon Evaluation.'' In Simulation Modelling Practice and Theory (SIMPAT), vol. 24, pp. 103-114 DOI: http://dx.doi.org/10.1016/j.simpat.2012.02.001. 2012.
\end{itemize}
\subsubsection{2011}
\begin{itemize}
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Reactive Multi-agent approach to local platoon control: stability analysis and experimentations..'' In International Journal of Intelligent Systems Technologies And Application. DOI: http://dx.doi.org/10.1504/IJISTA.2011.040348. 2011.
\end{itemize}
\subsubsection{2010}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Jean-Michel CONTET}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Car-driving assistance using organization measurement of reactive multi-agent system.'' In Procedia Computer Science CS, vol. 1(1), pp. 317-325 2010.
\end{itemize}
\subsubsection{2008}
\begin{itemize}
\item {Nicolas GAUD}, {St{\'e}phane GALLAND}, {\uline{Franck GECHTER}}, {Vincent HILAIRE}, {Abderrafiaa KOUKAM}. ``Holonic multilevel simulation of complex systems: Application to real-time pedestrians simulation in virtual urban environment.'' In Simulation Modelling Practice and Theory, vol. 16(10), pp. 1659-1676 DOI: 10.1016/j.simpat.2008.08.015. 2008.
\end{itemize}
\subsubsection{2006}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``A Reactive Agent-Based Problem-Solving Model : Application to Localization and Tracking.'' In ACM Transactions on Autonomous and Adaptive Systems (ACM TAAS), vol. 1(2), pp. 189-222 2006.
\end{itemize}
\subsection{National journal with reading committee}
\subsubsection{2019}
\begin{itemize}
\item {Pierre ROMET}, {\uline{Franck GECHTER}}, {El-Hassane AGLZIM}, {Beno{\^{\i}}te LEFORT}. ``La place du v{\'e}hicule autonome dans une mobilit{\'e} propre.'' In La Revue de l’Electricit{\'e} de de l’Electronique (REE) 2019.
\end{itemize}
\subsubsection{2014}
\begin{itemize}
\item {Abdeljalil ABBAS-TURKI}, {Cindy CAPPELLE}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}, {Yassine RUICHEK}, {Florent PERRONNET}. ``V{\'e}hicule connect{\'e} sans conducteur.'' In La Revue de l'Electricit{\'e} de de l'Electronique (REE), https://www.see.asso.fr/node/11512 2014.
\end{itemize}
\subsubsection{2004}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``Un mod{\`e}le de r{\'e}solution de probl{\`e}mes utilisant des agents r{\'e}actifs pour la localisation et le suivi..'' In Revue d'intelligence artificielle (RSTI-RIA), vol. 18(5-6), pp. 743-777 2004.
\end{itemize}
\subsubsection{2003}
\begin{itemize}
\item {Vincent CHEVRIER}, {\uline{Franck GECHTER}}. ``Une architecture r{\'e}active pour la localisation en robotique mobile.'' In Technique et Science Informatiques, vol. 22(4), pp. 345-358 2003.
\end{itemize}
\subsection{National journal without reading committee}
\subsubsection{2018}
\begin{itemize}
\item {Wendan DU}, {Abderrafiaa KOUKAM}, {Abdeljalil ABBAS-TURKI}, {\uline{Franck GECHTER}}. ``Traffic Jam Reduction Based on Vehicle Platoons and Cooperative Intersection Management.'' In Futurmob 2018 2018.
\end{itemize}
\subsubsection{2017}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Aglzim EL-HASSANE}, {Fabrice LAURI}, {Sidi-Mohammed SENOUCI}, {Abdeljalil ABBAS-TURKI}. ``Utilisation de la conduite en convoi pour la conception de nouveau syst{\`e}mes de transports innovants pour la livraison de marchandises dans les centres-villes..'' In FuturMob'17 2017.
\end{itemize}
\subsection{International conference with proceedings}
\subsubsection{2019}
\begin{itemize}
\item {Xinyue ZHANG}, {Chen LIU}, {Rui MA}, {Hao BAI}, {\uline{Franck GECHTER}}, {Fei GAO}. ``Stability Analysis of Grid Converter under Weak Grid Conditions.'' In Proc. of IEEE Transportation Electrification Conference and Expo, (to be published) 2019.
\item {Weizhu QIAN}, {\uline{Franck GECHTER}}, {Fabrice LAURI}. ``Comparison of machine learning algorithms on smartphone energy consumption modeling issue based on real user context data.'' In Proc. of The Eleventh International Conference on Information, Process, and Knowledge Management eKNOW 2019 2019.
\end{itemize}
\subsubsection{2018}
\begin{itemize}
\item {Weizhu QIAN}, {\uline{Franck GECHTER}}. ``Modeling Smartphone Energy Consumption Based on User Behavior Data.'' In Proc. of The 2018 International Conference on Computational Science and Computational Intelligence, (to be published) 2018.
\item {\uline{Franck GECHTER}}, {Fabrice LAURI}, {Anthony GUSSY}, {Florian STAINE}. ``Managing Power Flows in SmartGrids with physically-inspired reactive agents.'' In Proc. of 30th IEEE Int'l Conference on Tools with Artificial Intelligence ICTAI 2018 2018.
\item {Wendan DU}, {Abdeljalil ABBAS-TURKI}, {Abderrafiaa KOUKAM}, {St{\'e}phane GALLAND}, {\uline{Franck GECHTER}}. ``One the {V2X} speed synchronization at intersections: Rules based system for extended virtual platooning.'' In Proc. of The 8th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN 2018), pp. 258-262, Leuven, Belgium, Elsevier, volume 141. DOI: 10.1016/j.procs.2018.10.179. 2018.
\item {Barbara SCHIAVI}, {\uline{Franck GECHTER}}, {C{\'e}line GECHTER}, {Albert RIZZO}. ``Teach Me A Story : an Augmented Reality Application for Teaching History in middle school.'' In Proc. of IEEE VR Conference, pp. 679-680 DOI: 10.1109/VR.2018.8446412. 2018.
\item {Chen LIU}, {Rui MA}, {Hao BAI}, {\uline{Franck GECHTER}}, {Fei GAO}. ``An Ultra-fast Custom FPGA-based Solver to the Three-Level Voltage-source Converter Modeling for Real-Time Simulation Application.'' In Proc. of IEEE Transportation Electrification Conference \& Expo (ITEC 2018) 2018.
\item {Chen LIU}, {Rui MA}, {Hao BAI}, {Fei GAO}, {\uline{Franck GECHTER}}. ``FPGA based hardware in the Loop Test of Railway Traction System.'' In Proc. of IEEE International Conference on Industrial Electronics for Sustainable Energy Systems (IESES) 2018.
\end{itemize}
\subsubsection{2017}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {El-Hassane AGLZIM}, {Sidi-Mohammed SENOUCI}, {Nathalie RODET-KROICHVILI}, {Cindy CAPPELLE}, {Didier FASS}. ``Transportation of goods in inner-city centers: can autonomous vehicles in platoon be a suitable solution?.'' In Proc. of IEEE Vehicle Power and Propulsion Conference (VPPC) 2017.
\item {Bofei CHEN}, {\uline{Franck GECHTER}}. ``A cooperative control method for platoon and intelligent vehicles management.'' In Proc. of IEEE Vehicle Power and Propulsion Conference (VPPC) 2017.
\item {Ferdinand SCHAEFER}, {Daniela CHRENKO}, {\uline{Franck GECHTER}}, {Alexandre RAVEY}, {Reiner KRIESTEN}. ``No need to learn from each other? - Potentials of Knowledge Modeling in Autonomous Vehicle Systems Engineering.'' In Proc. of International Conference on Engineering, Technology and Innovation ICE Conference 2017 2017.
\end{itemize}
\subsubsection{2016}
\begin{itemize}
\item {Roua ELCHAMAA}, {Baudouin DAFFLON}, {Yacine OUZROUT}, {\uline{Franck GECHTER}}. ``Agent Based Monitoring for Smart Cities: Application to Traffic Lights.'' In Proc. of 10th International Conference on Software, Knowledge, Information Management \& Applications SKIMA 2016 2016.
\item {Baudouin DAFFLON}, {Maxime GUERIAU}, {\uline{Franck GECHTER}}. ``Wave Agents in a Virtual Environment: a Proof of Concept Applied to Longitudinal Distance Regulation in Platoon Control.'' In Proc. of The 28th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2016) 2016.
\item {Feng YANG}, {\uline{Franck GECHTER}}, {Robin ROCHE}, {Abderrafiaa KOUKAM}, {Fei GAO}. ``A fault-response approach for battery pack by reconfigurable topology using agents.'' In Proc. of The 28th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2016) 2016.
\item {Chen LIU}, {Xizheng GUO}, {Fei GAO}, {Elena BREAZ}, {Damien PAIRE}, {\uline{Franck GECHTER}}. ``FPGA based Real-time Simulation of High Frequency Soft-switching Circuit using Time-domain Analysis.'' In Proc. of IEEE Industrial Electronics Conference IECON 2016.
\item {\uline{Franck GECHTER}}, {Alastair BERESFORD}, {Andrew RICE}. ``Reconstruction of battery level curves based on user data collected from a smartphone.'' In Proc. of The 17th International Conference on Artificial Intelligence: Methodology, Systems, Applications, AIMSA 2016 2016.
\item {Bofei CHEN}, {\uline{Franck GECHTER}}. ``A cooperative control system for virtual train crossing.'' In Proc. of The 17th International Conference on Artificial Intelligence: Methodology, Systems, Applications - AIMSA 2016 2016.
\end{itemize}
\subsubsection{2015}
\begin{itemize}
\item {Madeleine EL ZAHER}, {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``A Cyber-Physical model for platoon system.'' In Proc. of The 9th International Conference on Software, Knowledge, Information Management and Applications 2015.
\item {Bofei CHEN}, {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Vehicles virtual train management at crossroads and roundabouts.'' In Proc. of The 7th International Conference on Logistics and Transport 2015.
\item {Madeleine EL ZAHER}, {\uline{Franck GECHTER}}. ``Platoon system: a novel reconfigurable and adaptable transportation system.'' In Proc. of In Proc. of The 7th International Conference on Logistics and Transport 2015.
\item {Feng YANG}, {Robin ROCHE}, {\uline{Franck GECHTER}}, {Fei GAO}, {Abderrafiaa KOUKAM}. ``An Agent-Based Approach for Battery Management Systems.'' In Proc. of IEEE Energy Conversion Congress and Exposition 2015 (ECCE) 2015.
\item {Didier FASS}, {\uline{Franck GECHTER}}. ``Towards a theory for Bio–Cyber Physical Systems Modeling.'' In Proc. of Lecture Notes in Computer Science LNCS 9184-9185 - Digital Human Modeling. Applications in Health, Safety, Ergonomics and Risk Management: Ergonomics and Health - the 17th International Conference on Human-Computer Interaction HCI 2015, Springer 2015.
\item {\uline{Franck GECHTER}}, {Baudouin DAFFLON}. ``Physics inspired multiagent systems applied to autonomous vehicle control and management..'' In Proc. of Control Architecture of Robots 2015.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``An agent based layered decision process for vehicle platoon control..'' In Proc. of Lecture Notes in Electrical Engineering 2015.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}. ``Multi-agents model for leader identification in platoon system.'' In Proc. of The Seventh International Conference on Adaptive and Self-Adaptive Systems and Applications ADAPTIVE 2015 2015.
\end{itemize}
\subsubsection{2014}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Baudouin DAFFLON}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Towards a hybrid real/virtual simulation of autonomous vehicles for critical scenarios..'' In Proc. of The Sixth International Conference on Advances in System Simulation (SIMUL 2014) 2014.
\item {Baudouin DAFFLON}, {Chen BOFEI}, {\uline{Franck GECHTER}}, {Pablo GRUER}. ``A self-adaptive agent-based path following control Lateral regulation and obstacles avoidance.'' In Proc. of International Workshop on Autonomic High Performance Computing 2014.
\end{itemize}
\subsubsection{2013}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {David BOUQUAIN}, {Fei GAO}, {Abderrafiaa KOUKAM}, {Abdellatif MIRAOUI}. ``A Multiagent Model for PEM-Fuel Cell Microscopic Simulation.'' In Proc. of 12th European Control Conference (ECC13), Zurich, Switzerland 2013.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``A layered multi-agent model for multi-configuration platoon control.'' In Proc. of International Conference on Informatics in Control, Automation and Robotics (ICINCO) 2013.
\end{itemize}
\subsubsection{2012}
\begin{itemize}
\item {Baudouin DAFFLON}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}. ``Toward a reactive agent based parking assistance system.'' In Proc. of International Conference on Tools with Artificial Intelligence 2012.
\item {Madeleine EL ZAHER}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Echelon platoon organisation: a distributed approach based on 2-spring virtual links.'' In Proc. of The 15th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA) Lecture Notes in Computer Science (LNCS) 7557, Springer-Verlag Berlin Heidelberg, (to be published) DOI: https://doi.org/10.1007/978-3-642-33185-5\_28. 2012.
\end{itemize}
\subsubsection{2011}
\begin{itemize}
\item {Madeleine EL ZAHER}, {Jean-Michel CONTET}, {Pablo GRUER}, {\uline{Franck GECHTER}}. ``Towards a compositional verification approach for multi-agent systems : Application to Platoon system.'' In Proc. of First International workshop on Verification and Validation of multi-agent models for complex systems (V2CS) 2011.
\item {Baudouin DAFFLON}, {\uline{Franck GECHTER}}, {Jean-Michel CONTET}, {Abdeljalil ABBAS-TURKI}, {Pablo GRUER}. ``Intelligent crossroads for vehicle platoons reconfiguration.'' In Proc. of Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (LNCS/LNAI) Vol. 6943 paper from the International Conference on Adaptive and Intelligent Systems ICAIS 2011, Klagenfurt, Austria,, Springer-Verlag Berlin Heidelberg 2011.
\item {Madeleine EL ZAHER}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Mohamed HAJJAM}. ``A new linear platoon model based on reactive multi-agent systems.'' In Proc. of The 23rd IEEE International Conference on Tools with Artificial Intelligence ICTAI, IEEE Computer Society 2011.
\item {\uline{Franck GECHTER}}, {Jean-Michel CONTET}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``A reactive agent based vehicle platoon algorithm with integrated obstacle avoidance ability.'' In Proc. of Fifth IEEE International Conference on Self-Adaptive and Self-Organizing Systems SASO 2011 DOI: http://doi.ieeecomputersociety.org/10.1109/SASO.2011.24. 2011.
\item {Madeleine EL ZAHER}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}. ``Reconfigurable and adaptable urban transportation systems: the platoon solution.'' In Proc. of the Insitution of Engineering and Technology Conference on Smart and Sustainable City 2011 (ICSSC11), Institute Engineering and Technology and Shanghai University, Shangha{\"{\i}}, China, Shangha{\"{\i}} University Press ISBN: 978-1-84919-326-9.. 2011.
\item {\uline{Franck GECHTER}}, {St{\'e}phane GALLAND}. ``Interactive Whiteboard for Collaborative Work - A Multiagent-based Solution.'' In Proc. of the 3rd International Conference on Computer Supported Education (CSEDU 2011), pp. 270-278, Noordwijkerhout, Netherlands, SciTePress ISBN: 978-989-8425-49-2. 2011.
\end{itemize}
\subsubsection{2010}
\begin{itemize}
\item {Olivier LAMOTTE}, {St{\'e}phane GALLAND}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}. ``Submicroscopic and Physics Simulation of Autonomous and Intelligent Vehicles in Virtual Reality.'' In Proc. of 2nd International Conference on Advances in System Simulation (SIMUL10), Nice, France, IEEE CPS 2010.
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``An Approach to Compositional Verification of Reactive Multiagent Systems.'' In Proc. of Working Notes of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI), Workshop on Model Checking and Artificial Intelligence 2010.
\end{itemize}
\subsubsection{2009}
\begin{itemize}
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Bending Virtual Spring-Damper: A Solution to Improve Local Platoon Control.'' In Proc. of Lecture Notes in Computer Science (LNCS) Vol. 5544, paper from the International Conference on Computational Science 2009 (ICCS 2009), Baton Rouge, Louisiana, U.S.A., Springer Verlag 2009.
\end{itemize}
\subsubsection{2008}
\begin{itemize}
\item {Sibo YANG}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Application of Reactive Multi-agent System to Vehicle Collision Avoidance.'' In Proc. of The 20th IEEE International Conference on Tools with Artificial Intelligence ICTAI, Dayton, Ohio, USA, pp. 197-204, IEEE Computer Society 2008.
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Evaluation of global system state thanks to local phenomenona.'' In Proc. of Biennial European Conference on Artificial Intelligence (ECAI), Gr{\`e}ce, Patras, june 21-27 2008.
\item {Drago MATKO}, {Gregor KLANCAR}, {Saso BLAZIC}, {\uline{Franck GECHTER}}, {Olivier SIMONIN}, {Jean-Michel CONTET}, {Pablo GRUER}. ``Control Strategy for Wheeled Mobile Robots Platoons.'' In Proc. of International Conference on Informatics in Control, Automation and Robotics (ICINCO), pp. 145-150, INSTICC Press, Funchal, Madeira, Portugal May 2008 2008.
\end{itemize}
\subsubsection{2007}
\begin{itemize}
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Physics inspired multiagent system for vehicle platooning.'' In Proc. of International conference on Autonomous Agents and Multiagent Systems (AAMAS), IFAAMAS, pp. 349-351, Honolulu, Hawai USA 2007.
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Application of reactive multiagent system to linear vehicle platoon.'' In Proc. of In 19th IEEE International Conference on Tools with Artificial Intelligence – ICTAI'2007, pp. 67-70, IEEE Computer Society, Volume 2, Gr{\`e}ce, Patras, october 29-31 2007.
\item {Sergio NOGUEIRA}, {Jean-Michel CONTET}, {Yassine RUICHEK}, {\uline{Franck GECHTER}}. ``WiFi based remote control system with video feedback for intelligent vehicle.'' In Proc. of The Biennial on Digital Signal Processing for In-Vehicle and Mobile Systems, Istanbul, Turkey 2007.
\item {Nicolas GAUD}, {\uline{Franck GECHTER}}, {St{\'e}phane GALLAND}, {Abderrafiaa KOUKAM}. ``Holonic multiagent multilevel simulation : Application to real-time pedestrians simulation in urban environment.'' In Proc. of the 30th International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 1275-1280, Hyderabad India 2007.
\end{itemize}
\subsubsection{2006}
\begin{itemize}
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}, {Abderrafiaa KOUKAM}. ``Multiagent system model for vehicle platooning with merge and split capabilities.'' In Proc. of the 3rd International Conference on Autonomous Robots and Agents – ICARA, pp. 41-46, Palmerston North, New Zealand 2006.
\item {Olivier SIMONIN}, {\uline{Franck GECHTER}}. ``An Environment-Based Methodology to Design Reactive Multi-agent Systems for Problem Solving.'' In Proc. of (Lecture Notes in Artificial Intelligence) LNAI Vol. 3830 : Environment for Multiagent Systems II (revised and selected papers of E4MAS 2005), pp. 32-49, Springer-Verlag Berlin Heidelberg 2006.
\end{itemize}
\subsubsection{2005}
\begin{itemize}
\item {Sergio NOGUEIRA}, {\uline{Franck GECHTER}}, {Yassine RUICHEK}, {Abderrafiaa KOUKAM}, {Fran{\c{c}}ois CHARPILLET}. ``Perception environment for vehicle autonomous navigation.'' In Proc. of The Biennial on DSP for In-Vehicle and Mobile Systems 2005.
\item {Olivier SIMONIN}, {\uline{Franck GECHTER}}. ``An environment-based principle to design reactive multi-agent systems for problem solving.'' In Proc. of Environments for Multi-Agent Systems E4MAS (AAMAS 2005 Workshop) 2005.
\end{itemize}
\subsubsection{2004}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``A Reactive Multi-Agent System for Localization and Tracking in Mobile Robotics.'' In Proc. of In 16th IEEE International Conference on Tools with Artificial Intelligence - ICTAI'2004 2004.
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``Localizing and Tracking Targets with a Reactive Multi-Agent System (Extended version of AAMAS 2004).'' In Proc. of Second European Workshop on Multi-Agent Systems - EUMAS'04 2004.
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``Localizing and Tracking Targets with a Reactive Multi-Agent System.'' In Proc. of Third International Joint Conference on Autonomous Agents and Multi-Agent Systems - AAMAS'04 2004.
\end{itemize}
\subsubsection{2001}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent THOMAS}, {Fran{\c{c}}ois CHARPILLET}. ``Localization by Stochastic Vision Based Device.'' In Proc. of In The 5th World Multi-Conference on Systemics, Cybernetics and Informatics - SCI 2001 – The 7th International Conference on Information Systems Analysis and Synthesis - ISAS 2001 2001.
\item {\uline{Franck GECHTER}}, {Fran{\c{c}}ois CHARPILLET}. ``Markov Based Localization Device for a Mobile Robot..'' In Proc. of Robotics and Automation in Space: A New Space Odyssey - i-SAIRAS 2001 2001.
\end{itemize}
\subsubsection{2000}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Fran{\c{c}}ois CHARPILLET}. ``Vision Based Localisation for a Mobile Robot.'' In Proc. of International Conference on tools with Artificial Intelligence (ICTAI) 2000.
\end{itemize}
\subsection{National conference with proceedings}
\subsubsection{2012}
\begin{itemize}
\item {Pichard GR{\'E}GOIRE}, {Martin GEOFFROY}, {Jean-Michel CONTET}, {Baudouin DAFFLON}, {\uline{Franck GECHTER}}. ``Syst{\`e}me multi-agents d’{\'e}vitement d’obstacles.'' In Proc. of Journ{\'e}e des jeunes chercheurs de l'UTBM (Ing{\'e}Doc'2012), Belfort, France, 2012, dec 2012 2012.
\item {Etienne FRAN{\c{C}}OIS}, {Etienne THUILLIER}, {Gillian BASSO}, {\uline{Franck GECHTER}}. ``Gestion Intelligente d'un r{\'e}seau {\'e}lectrique par un syst{\`e}me multi-agent.'' In Proc. of 2{\`e}mes Journ{\'e}es des Jeunes Chercheurs de l'UTBM (Ing{\'e}Doc 2012), Doceo, UTBM, UTBM Press, 2012.
\item {Alexis NIETO}, {David VIAL}, {\uline{Franck GECHTER}}. ``Visualisation d'un train de v{\'e}hicules hybride (r{\'e}el/virtuel) en r{\'e}alit{\'e} augment{\'e}e.'' In Proc. of 2{\`e}mes Journ{\'e}es des Jeunes Chercheurs de l'UTBM (Ing{\'e}Doc 2012), Doceo, UTBM, UTBM Press 2012.
\item {Dino BASIC}, {Jean-Michel CONTET}, {\uline{Franck GECHTER}}. ``Visualisation de donn{\'e}es capteurs d'un v{\'e}hicule intelligent avec une tablette tacticle.'' In Proc. of 2{\`e}mes Journ{\'e}es des Jeunes Chercheurs de l'UTBM (Ing{\'e}Doc 2012), Doceo, UTBM, UTBM Press 2012.
\end{itemize}
\subsubsection{2011}
\begin{itemize}
\item {Madeleine EL ZAHER}, {\uline{Franck GECHTER}}, {Pablo GRUER}. ``Convoi de v{\'e}hicule pour une nouvelle forme de mobilit{\'e}.'' In Proc. of In Proc. of 1{\`e}res Journ{\'e}es des Jeunes Chercheurs de l'UTBM (Ingedoc 2011) 2011.
\end{itemize}
\subsubsection{2009}
\begin{itemize}
\item {Jean-Michel CONTET}, {\uline{Franck GECHTER}}, {Pablo GRUER}. ``M{\'e}canisme d{\'e}cisionnel bas{\'e} sur la mesure de l'organisation d'un SMA: application {\`a} l'{\'e}vitement d'obstacles.'' In Proc. of Journ{\'e}es Francophones des Syst{\`e}mes Multi-Agents – JFSMA'2009, Lavoisier 2009.
\end{itemize}
\subsubsection{2005}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Olivier SIMONIN}. ``Conception de SMA r{\'e}actifs pour la r{\'e}solution de probl{\`e}mes :Une approche bas{\'e}e sur l’environnement.'' In Proc. of Journ{\'e}es Francophones des Syst{\`e}mes Multi-Agents - JFSMA'2005 2005.
\end{itemize}
\subsubsection{2003}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent CHEVRIER}, {Fran{\c{c}}ois CHARPILLET}. ``Une architecture r{\'e}active pour la localisation en robotique mobile..'' In Proc. of Journ{\'e}es Francophones des Syst{\`e}mes Multi-Agents - JFSMA'2003. 2003.
\end{itemize}
\subsubsection{2002}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Une m{\'e}thode de localisation d'un robot mobile utilisant une approche multi-agents pour la fusion de donn{\'e}es.'' In Proc. of 15eme Journ{\'e}es des Jeunes Chercheurs en Robotique - JJCR 2002 2002.
\end{itemize}
\subsubsection{2001}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Vincent THOMAS}, {Fran{\c{c}}ois CHARPILLET}. ``Utilisation d'un module de vision stochastique pour localiser un robot mobile..'' In Proc. of Troisi{\`e}mes Journ{\'e}es Nationales de la Recherche en Robotique - JNRR'2001 2001.
\end{itemize}
\subsection{International conference without proceedings}
\subsubsection{2015}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``What human-system integration model(s) for self-driving vehicles, multi autonomous vehicles synchronisation and multi-robots control?.'' In Proc. of 1st LORIA-NASA WORKSHOP on Safety Critical Human-System Integration Designs in the Aerospace, Defense and Medical Operational Domains 2015.
\end{itemize}
\subsection{National conference without proceedings}
\subsubsection{2018}
\begin{itemize}
\item {Chen LIU}, {Rui MA}, {\uline{Franck GECHTER}}, {Fei GAO}. ``Simulation en temps r{\'e}el d’un v{\'e}hicule {\'e}lectrique {\`a} pile {\`a} combustible.'' In Proc. of 4{\`e}me REUNION PLENIERES du GdR 3652 du CNRS HySP{\`a}C, Grenoble France 2018.
\end{itemize}
\subsubsection{2014}
\begin{itemize}
\item {Etienne FRAN{\c{C}}OIS}, {\uline{Franck GECHTER}}, {Andrew RICE}. ``Curve Estimation of Smartphone Power consumption.'' In Proc. of In Proc. of 3{\`e}mes Journ{\'e}es des Jeunes Chercheurs de l'UTBM (Ing{\'e}Doc 2014), UTBM Press, Poster Session 2014.
\end{itemize}
\subsubsection{2013}
\begin{itemize}
\item {Lounis ADOUANE}, {Romuald AUFR{\`E}RE}, {Pierre AVANZINI}, {Guillaume BRESSON}, {Roland CHAPUIS}, {Jean-Pierre DERUTIN}, {Eric ROYER}, {Benoit THUILOT}, {M VITA VENTURA}, {Baudouin DAFFLON}, {Madeleine EL ZAHER}, {\uline{Franck GECHTER}}, {Maxime GUERIAU}, {Pablo GRUER}, {Abderrafiaa KOUKAM}, {Christophe DEBAIN}, {Roland LENAIN}, {Monir BENCHOAIB}. ``SafePlatoon: S{\^u}ret{\'e} de Convois de V{\'e}hicules Autonomes.'' In Proc. of Journ{\'e}es Nationales des Communications dans les Transport (JNCT) 2013.
\end{itemize}
\subsection{Book}
\subsubsection{2016}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``SMA r{\'e}actifs d'inspiration physique pour la prise de d{\'e}cision.'' Editions Universitaires Europ{\'e}ennes ISBN: 978-3-8417-2887-6. 2016.
\end{itemize}
\subsubsection{2011}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Mod{\`e}le multi-agent r{\'e}actif pour la fusion de percepts Application {\`a} la localisation et au suivi en robotique mobile Informatique,.'' Editions Universitaires Europ{\'e}ennes ISBN: 978-613-1-56427-7. 2011.
\end{itemize}
\subsection{Book chapter}
\subsubsection{2017}
\begin{itemize}
\item {Didier FASS}, {\uline{Franck GECHTER}}. ``Virtual environments integrative design - From human in-the-loop to Bio-Cyber-Physical-Systems.'' Chapter in System Interaction in Mixed Reality Environments and Simulation, selected article from he 8th International Conference on Applied Human Factors and Ergonomics, Advances in Intelligent Systems and Computing book series AISC series, vol. 592, chapter 2, pp. 168-176 2017.
\end{itemize}
\subsubsection{2007}
\begin{itemize}
\item {Sergio NOGUEIRA}, {Yassine RUICHEK}, {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}, {Fran{\c{c}}ois CHARPILLET}. ``An artificial vision based environment perception system.'' Chapter in Advances for In-Vehicle and Mobile Systems - Challenges for International Standards, chapter 4, Springer ISBN: 978-0-387-33503-2. 2007.
\end{itemize}
\subsubsection{2006}
\begin{itemize}
\item {Sergio NOGUEIRA}, {\uline{Franck GECHTER}}, {Yassine RUICHEK}, {Abderrafiaa KOUKAM}, {Fran{\c{c}}ois CHARPILLET}. ``Environment perception for vehicle autonomous navigation in urban areas.'' Chapter in Digital Signal Processing for In-Vehicle and Mobile Systems II, pp. ,, Springer–Verlag Ed. 2006.
\end{itemize}
\subsection{Invited Conference}
\subsubsection{2018}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Potentialit{\'e}s de la R{\'e}alit{\'e} Augment{\'e}e pour la visualisation de la pollution..'' Journ{\'e}e ATMO Grand Est Besan{\c{c}}on 2018.
\end{itemize}
\subsubsection{2017}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Mod{\`e}le multi-agent d’inspiration physique pour la conduite de v{\'e}hicules autonomes.'' journ{\'e}e commune CONDUITE DES SYSTEMES DYNAMIQUES ET IA. organis{\'e} par l'AFIA et le groupe de travail Intelligent Manufacturing \& Services Systems (IMS2) du GDR Mod{\'e}lisation, Analyse et Conduite des Syst{\`e}mes dynamiques (MACS) 2017.
\item {\uline{Franck GECHTER}}. ``Innovation p{\'e}dagogique et R{\'e}alit{\'e} virtuelle et augment{\'e}e.'' 5eme European Workshop on Surgical Simulation: Mod{\'e}lisation et Simulation en sant{\'e} num{\'e}rique 2017.
\item {\uline{Franck GECHTER}}. ``From vehicle to trains of vehicles, how can multi-agent systems be applied to autonomous systems related issues?
.'' S{\'e}minaire F{\'e}d{\'e}ration Charles Hermite, Unmanned Vehicles / Multi-Agents Systems / Design of Fault Tolerant Control Methods 2017.
\end{itemize}
\subsubsection{2016}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Physics inspired multi-agent models: application to sensor data fusion and cyber-physical systems control..'' Talks of the University of Cambridge - Computer Laboratory - Digital Technology Group (DTG) meetings series 2016.
\end{itemize}
\subsubsection{2015}
\begin{itemize}
\item {\uline{Franck GECHTER}}. ``Syst{\`e}mes multi-agents d’inspiration physique pour le contr{\^o}le/management de syst{\`e}mes Cyber-Physiques: application aux v{\'e}hicules autonomes.'' Seminar of the Charles Hermite Federation Nancy 2015.
\item {\uline{Franck GECHTER}}. ``CPS: de la simulation au management par des approches d'intelligence artificielle d'inspiration Physique.'' S{\'e}minaire LORIA 2015.
\end{itemize}
\subsubsection{2010}
\begin{itemize}
\item {\uline{Franck GECHTER}}, {Abderrafiaa KOUKAM}. ``Syst{\`e}mes multi-agents et perspectives pour la reconstruction d’{\'e}v{\'e}nements dans la physique des hautes {\'e}nergies..'' laboratoire Leprince Ringuet Ecole Polytechnique/CNRS (UMR 7638) 2010.
\end{itemize}
\subsection{Popularization Paper}
\subsubsection{2016}
\begin{itemize}
\item {Abdeljalil ABBAS-TURKI}, {Jean-Charles CREPUT}, {Philippe DESCAMPS}, {St{\'e}phane GALLAND}, {Nicolas GAUD}, {\uline{Franck GECHTER}}, {Vincent HILAIRE}, {Abderrafiaa KOUKAM}, {Olivier LAMOTTE}, {Fabrice LAURI}. ``Dossier Intelligence Artificielle et Transport - L'{\'e}quipe syst{\`e}mes multiagents et optimisation de l'UTBM.'' In Bulletin AFIA, (91), pp. 37-40 2016.
\end{itemize}
\end{document} |
https://cheatography.com/akelian/cheat-sheets/custom-vim/tex/ | cheatography.com | CC-MAIN-2022-49 | text/plain | application/x-tex | crawl-data/CC-MAIN-2022-49/segments/1669446710829.5/warc/CC-MAIN-20221201153700-20221201183700-00039.warc.gz | 208,228,588 | 4,629 | \documentclass[10pt,a4paper]{article}
% Packages
\usepackage{fancyhdr} % For header and footer
\usepackage{multicol} % Allows multicols in tables
\usepackage{tabularx} % Intelligent column widths
\usepackage{tabulary} % Used in header and footer
\usepackage{hhline} % Border under tables
\usepackage{graphicx} % For images
\usepackage{xcolor} % For hex colours
%\usepackage[utf8x]{inputenc} % For unicode character support
\usepackage[T1]{fontenc} % Without this we get weird character replacements
\usepackage{colortbl} % For coloured tables
\usepackage{setspace} % For line height
\usepackage{lastpage} % Needed for total page number
\usepackage{seqsplit} % Splits long words.
%\usepackage{opensans} % Can't make this work so far. Shame. Would be lovely.
\usepackage[normalem]{ulem} % For underlining links
% Most of the following are not required for the majority
% of cheat sheets but are needed for some symbol support.
\usepackage{amsmath} % Symbols
\usepackage{MnSymbol} % Symbols
\usepackage{wasysym} % Symbols
%\usepackage[english,german,french,spanish,italian]{babel} % Languages
% Document Info
\author{Akelian (akelian)}
\pdfinfo{
/Title (custom-vim.pdf)
/Creator (Cheatography)
/Author (Akelian (akelian))
/Subject (Custom Vim Cheat Sheet)
}
% Lengths and widths
\addtolength{\textwidth}{6cm}
\addtolength{\textheight}{-1cm}
\addtolength{\hoffset}{-3cm}
\addtolength{\voffset}{-2cm}
\setlength{\tabcolsep}{0.2cm} % Space between columns
\setlength{\headsep}{-12pt} % Reduce space between header and content
\setlength{\headheight}{85pt} % If less, LaTeX automatically increases it
\renewcommand{\footrulewidth}{0pt} % Remove footer line
\renewcommand{\headrulewidth}{0pt} % Remove header line
\renewcommand{\seqinsert}{\ifmmode\allowbreak\else\-\fi} % Hyphens in seqsplit
% This two commands together give roughly
% the right line height in the tables
\renewcommand{\arraystretch}{1.3}
\onehalfspacing
% Commands
\newcommand{\SetRowColor}[1]{\noalign{\gdef\RowColorName{#1}}\rowcolor{\RowColorName}} % Shortcut for row colour
\newcommand{\mymulticolumn}[3]{\multicolumn{#1}{>{\columncolor{\RowColorName}}#2}{#3}} % For coloured multi-cols
\newcolumntype{x}[1]{>{\raggedright}p{#1}} % New column types for ragged-right paragraph columns
\newcommand{\tn}{\tabularnewline} % Required as custom column type in use
% Font and Colours
\definecolor{HeadBackground}{HTML}{333333}
\definecolor{FootBackground}{HTML}{666666}
\definecolor{TextColor}{HTML}{333333}
\definecolor{DarkBackground}{HTML}{3B3B3B}
\definecolor{LightBackground}{HTML}{F8F8F8}
\renewcommand{\familydefault}{\sfdefault}
\color{TextColor}
% Header and Footer
\pagestyle{fancy}
\fancyhead{} % Set header to blank
\fancyfoot{} % Set footer to blank
\fancyhead[L]{
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{C}
\SetRowColor{DarkBackground}
\vspace{-7pt}
{\parbox{\dimexpr\textwidth-2\fboxsep\relax}{\noindent
\hspace*{-6pt}\includegraphics[width=5.8cm]{/web/www.cheatography.com/public/images/cheatography_logo.pdf}}
}
\end{tabulary}
\columnbreak
\begin{tabulary}{11cm}{L}
\vspace{-2pt}\large{\bf{\textcolor{DarkBackground}{\textrm{Custom Vim Cheat Sheet}}}} \\
\normalsize{by \textcolor{DarkBackground}{Akelian (akelian)} via \textcolor{DarkBackground}{\uline{cheatography.com/41690/cs/12608/}}}
\end{tabulary}
\end{multicols}}
\fancyfoot[L]{ \footnotesize
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{LL}
\SetRowColor{FootBackground}
\mymulticolumn{2}{p{5.377cm}}{\bf\textcolor{white}{Cheatographer}} \\
\vspace{-2pt}Akelian (akelian) \\
\uline{cheatography.com/akelian} \\
\end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
\SetRowColor{FootBackground}
\mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Cheat Sheet}} \\
\vspace{-2pt}Published 26th August, 2017.\\
Updated 28th August, 2017.\\
Page {\thepage} of \pageref{LastPage}.
\end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
\SetRowColor{FootBackground}
\mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Sponsor}} \\
\SetRowColor{white}
\vspace{-5pt}
%\includegraphics[width=48px,height=48px]{dave.jpeg}
Measure your website readability!\\
www.readability-score.com
\end{tabulary}
\end{multicols}}
\begin{document}
\raggedright
\raggedcolumns
% Set font size to small. Switch to any value
% from this page to resize cheat sheet text:
% www.emerson.emory.edu/services/latex/latex_169.html
\footnotesize % Small font.
\begin{multicols*}{2}
\begin{tabularx}{8.4cm}{x{4.24 cm} x{3.76 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{\{\{fa-eye\}\} VISUAL}} \tn
% Row 0
\SetRowColor{LightBackground}
Sort Lines & {\bf{\textless{}Leader\textgreater{}}} s \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
Indent / Unident & \textless{} {\bf{and}} \textgreater{} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
Split paragraph & Q \tn
% Row Count 3 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{5.44 cm} x{2.56 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{\{\{fa-file-text-o\}\} {\bf{NORMAL MODE}}}} \tn
% Row 0
\SetRowColor{LightBackground}
Append a space. & \textless{}space\textgreater{} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
Find word under cursor & * {\bf{or}} \# \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
Toggle Spell checking & {\bf{\textless{}Leader\textgreater{}}} ss \tn
% Row Count 4 (+ 2)
% Row 3
\SetRowColor{white}
Disable search highlight & \textless{}C-n\textgreater{} \tn
% Row Count 5 (+ 1)
% Row 4
\SetRowColor{LightBackground}
Move to Split & \textless{}C-h\textgreater{} {\bf{Left}} \tn
% Row Count 7 (+ 2)
% Row 5
\SetRowColor{white}
& \textless{}C-j\textgreater{} {\bf{Bottom}} \tn
% Row Count 9 (+ 2)
% Row 6
\SetRowColor{LightBackground}
& \textless{}C-k\textgreater{} {\bf{Up}} \tn
% Row Count 11 (+ 2)
% Row 7
\SetRowColor{white}
& \textless{}C-l\textgreater{} {\bf{Right}} \tn
% Row Count 13 (+ 2)
% Row 8
\SetRowColor{LightBackground}
Echo current file path & {\bf{\textless{}Leader\textgreater{}}} p \tn
% Row Count 15 (+ 2)
% Row 9
\SetRowColor{white}
Auto Indent & = \tn
% Row Count 16 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 16 (+ 0)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{MOVEMENTS}}} \tn
% Row Count 17 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 17 (+ 0)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{basic}}} \tn
% Row Count 18 (+ 1)
% Row 14
\SetRowColor{LightBackground}
{\emph{first line}} & gg \tn
% Row Count 19 (+ 1)
% Row 15
\SetRowColor{white}
{\emph{last line}} & G \tn
% Row Count 20 (+ 1)
% Row 16
\SetRowColor{LightBackground}
{\emph{first character in line}} & \_ \tn
% Row Count 21 (+ 1)
% Row 17
\SetRowColor{white}
*last character in line" & \$ \tn
% Row Count 22 (+ 1)
% Row 18
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 22 (+ 0)
% Row 19
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{nouns}}} \tn
% Row Count 23 (+ 1)
% Row 20
\SetRowColor{LightBackground}
{\emph{word}} & w \tn
% Row Count 24 (+ 1)
% Row 21
\SetRowColor{white}
{\emph{back}} & b \tn
% Row Count 25 (+ 1)
% Row 22
\SetRowColor{LightBackground}
{\emph{sentence}} & s \tn
% Row Count 26 (+ 1)
% Row 23
\SetRowColor{white}
{\emph{line}} & j \tn
% Row Count 27 (+ 1)
% Row 24
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 27 (+ 0)
% Row 25
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{objects}}} \tn
% Row Count 28 (+ 1)
% Row 26
\SetRowColor{LightBackground}
{\emph{inner word}} & iw \tn
% Row Count 29 (+ 1)
% Row 27
\SetRowColor{white}
{\emph{inner tag (html)}} & it \tn
% Row Count 30 (+ 1)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{5.44 cm} x{2.56 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{\{\{fa-file-text-o\}\} {\bf{NORMAL MODE}} (cont)}} \tn
% Row 28
\SetRowColor{LightBackground}
{\emph{inner quote}} & i" \tn
% Row Count 1 (+ 1)
% Row 29
\SetRowColor{white}
{\emph{inner parenthesis}} & i( \tn
% Row Count 2 (+ 1)
% Row 30
\SetRowColor{LightBackground}
{\emph{inner paragraph}} & ip \tn
% Row Count 3 (+ 1)
% Row 31
\SetRowColor{white}
{\emph{a sentence}} & as \tn
% Row Count 4 (+ 1)
% Row 32
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 4 (+ 0)
% Row 33
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{target}}} \tn
% Row Count 5 (+ 1)
% Row 34
\SetRowColor{LightBackground}
{\emph{until \textless{}character\textgreater{} (including)}} & f \textless{}character\textgreater{} \tn
% Row Count 7 (+ 2)
% Row 35
\SetRowColor{white}
{\emph{until \textless{}character\textgreater{} (excluding)}} & t \textless{}character\textgreater{} \tn
% Row Count 9 (+ 2)
% Row 36
\SetRowColor{LightBackground}
{\emph{until \textless{}search\textgreater{}}} & / \textless{}search\textgreater{} \tn
% Row Count 10 (+ 1)
% Row 37
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 10 (+ 0)
% Row 38
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{screen based}}(don't move cursor)} \tn
% Row Count 11 (+ 1)
% Row 39
\SetRowColor{white}
{\emph{move cursor Hight/Middle/Low}} & H or M or L \tn
% Row Count 13 (+ 2)
% Row 40
\SetRowColor{LightBackground}
{\emph{Center to the cursor}} & zz \tn
% Row Count 14 (+ 1)
% Row 41
\SetRowColor{white}
{\emph{Move the current line to top of the sceen}} & zt \tn
% Row Count 16 (+ 2)
% Row 42
\SetRowColor{LightBackground}
{\emph{Move the screen down one line}} & \textless{}C-e\textgreater{} \tn
% Row Count 18 (+ 2)
% Row 43
\SetRowColor{white}
{\emph{Move the screen up one line}} & \textless{}C-y\textgreater{} \tn
% Row Count 20 (+ 2)
% Row 44
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 20 (+ 0)
% Row 45
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{bigger movements}}} \tn
% Row Count 21 (+ 1)
% Row 46
\SetRowColor{LightBackground}
{\emph{Move all half screen Down}} & \textless{}C-d\textgreater{} \tn
% Row Count 22 (+ 1)
% Row 47
\SetRowColor{white}
{\emph{Move all screen Up}} & \textless{}C-u\textgreater{} \tn
% Row Count 23 (+ 1)
% Row 48
\SetRowColor{LightBackground}
{\emph{Move all screen Down}} & \textless{}C-f\textgreater{} \tn
% Row Count 24 (+ 1)
% Row 49
\SetRowColor{white}
{\emph{Move all screen Up}} & \textless{}C-b\textgreater{} \tn
% Row Count 25 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{\{\{fa-scissors\}\} {\bf{INSERT MODE}}}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{} \tn
% Row Count 0 (+ 0)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{1.216 cm} x{4.484 cm} x{1.9 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{3}{x{8.4cm}}{\bf\textcolor{white}{AUTOCMD}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{3}{x{8.4cm}}{VimEnter} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\seqsplit{BufWritePre} & *.txt | *.js | *.py | *.wiki | *.sh | *.coffee & \seqsplit{CleanExtraSpace} \tn
% Row Count 4 (+ 3)
% Row 2
\SetRowColor{LightBackground}
\seqsplit{BufNewFile} & *.py | *.rb & Shebang \tn
% Row Count 6 (+ 2)
% Row 3
\SetRowColor{white}
& *.py & \seqsplit{SemanticHighlight} \tn
% Row Count 8 (+ 2)
% Row 4
\SetRowColor{LightBackground}
\seqsplit{BufEnter} & *.py & \seqsplit{SemanticHighlight} \tn
% Row Count 10 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}---}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{2.888 cm} x{1.596 cm} x{3.116 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{3}{x{8.4cm}}{\bf\textcolor{white}{Basic}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{3}{x{8.4cm}}{{\bf{VIM}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
Auto Indent & & = \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{3}{x{8.4cm}}{} \tn
% Row Count 2 (+ 0)
% Row 3
\SetRowColor{white}
\mymulticolumn{3}{x{8.4cm}}{{\bf{RANGER}}} \tn
% Row Count 3 (+ 1)
% Row 4
\SetRowColor{LightBackground}
open Ranger & & {\bf{\textless{}Leader\textgreater{}}} r \tn
% Row Count 4 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{3}{x{8.4cm}}{{\bf{BUFFERS}}} \tn
% Row Count 5 (+ 1)
% Row 6
\SetRowColor{LightBackground}
Cycle & & \textless{}Tab\textgreater{} {\bf{and}} \textless{}S-Tab\textgreater{} \tn
% Row Count 7 (+ 2)
% Row 7
\SetRowColor{white}
Close current buffer & & bc \tn
% Row Count 9 (+ 2)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{3}{x{8.4cm}}{{\bf{NERDTree}}} \tn
% Row Count 10 (+ 1)
% Row 9
\SetRowColor{white}
toggle NERDTree & & " \tn
% Row Count 11 (+ 1)
% Row 10
\SetRowColor{LightBackground}
Open in HSplit & \textless{}on file\textgreater{} & i \tn
% Row Count 13 (+ 2)
% Row 11
\SetRowColor{white}
Open in VSplit & \textless{}on file\textgreater{} & s \tn
% Row Count 15 (+ 2)
% Row 12
\SetRowColor{LightBackground}
Recursively open & \textless{}on folder\textgreater{} & O \tn
% Row Count 17 (+ 2)
% Row 13
\SetRowColor{white}
Show Menu & & m \tn
% Row Count 18 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}---}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{4.636 cm} p{0.912 cm} x{2.052 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{3}{x{8.4cm}}{\bf\textcolor{white}{Python}} \tn
% Row 0
\SetRowColor{LightBackground}
Jedi & \seqsplit{Usages} & {\bf{\textless{}Leader\textgreater{}}} z \tn
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
Help about element under cursor & & \textless{}S-k\textgreater{} \tn
% Row Count 4 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}---}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{3.6 cm} x{4.4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Folding}} \tn
% Row 0
\SetRowColor{LightBackground}
Close under cursor & zc {\emph{( zC - recursive)}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
Open under cursor & zo {\emph{(zO - recursive)}} \tn
% Row Count 2 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{2.08 cm} x{5.92 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Custom Commands}} \tn
% Row 0
\SetRowColor{LightBackground}
:Run & Save and execute current buffer in python \tn
% Row Count 2 (+ 2)
% Row 1
\SetRowColor{white}
:Pip & Pip install the currently highlighted word \tn
% Row Count 4 (+ 2)
% Row 2
\SetRowColor{LightBackground}
\seqsplit{:RangerChooser} & Open ranger \tn
% Row Count 6 (+ 2)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
% That's all folks
\end{multicols*}
\end{document}
|
http://git.csclub.uwaterloo.ca/?p=public/csc-propaganda.git;a=blob_plain;f=csc-useragree.tex;hb=21b7fbdfc1955d50316345b59a63f024895d9894 | uwaterloo.ca | CC-MAIN-2019-51 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2019-51/segments/1575541317967.94/warc/CC-MAIN-20191216041840-20191216065840-00504.warc.gz | 63,575,283 | 1,153 | \documentclass{article}
\usepackage[margin=.52in]{geometry}
\setlength{\parindent}{0in}
\setlength{\parskip}{1ex}
\thispagestyle{empty}
\begin{document}
\section*{CSC User Agreement}
\large
I have read and understood the usage policy of October 2010, and I agree to use
my account on the CSC network in accordance with this policy. I am responsible
for all actions taken by anyone using this account. Furthermore, I accept full
legal responsibility for all of the actions that I commit using the CSC network
according to any and all applicable laws.
I understand that with little or no notice machines on the CSC network and
resources on these machines may become unavailable. Machines may ``go down''
while users are using them, and I will not hold the CSC responsible for lost
time or data.
\vspace{2ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\vspace{1ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\vspace{1ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\vspace{1ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\vspace{1ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\vspace{1ex}
\hrule
Name:
Signature:
Office Staff:
Signature:
Date:
\end{document}
|
https://libre-soc.org/pinmux/pinmux_chennai_2018.tex | libre-soc.org | CC-MAIN-2020-29 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2020-29/segments/1593657172545.84/warc/CC-MAIN-20200716153247-20200716183247-00004.warc.gz | 473,899,166 | 6,008 | \documentclass[slidestop]{beamer}
\usepackage{beamerthemesplit}
\usepackage{graphics}
\usepackage{pstricks}
\title{Pin Multiplexer}
\author{Rishabh Jain}
\author{Luke Kenneth Casson Leighton}
\begin{document}
\frame{
\begin{center}
\huge{Pin Multiplexer}\\
\vspace{32pt}
\Large{Auto-generating documentation, code \\
and resources for a Pinmux}\\
\vspace{16pt}
\Large{Saving time and money for SoC / EC designers\\
in the RISC-V Ecosystem and beyond}\\
\vspace{24pt}
\Large{[proposed for] Chennai 9th RISC-V Workshop}\\
\vspace{16pt}
\large{\today}
\end{center}
}
\frame{\frametitle{Credits and Acknowledgements}
\begin{itemize}
\item TODO\vspace{10pt}
\end{itemize}
}
\frame{\frametitle{Glossary}
\begin{itemize}
\item GPIO: general-purpose reconfigureable I/O (Input/Output).
\item Pin: an I/O pad. May be driven (input) or may drive (output).
\item FN: term for a single-wire "function", such as UART\_TX,
I2C\_SDA, SDMMC\_D0 etc. may be an input, output or both
(bi-directional case: two wires are {\it always} allocated, one
for input to the function and one for output from the function).
\item Bus: a group of bi-directional functions (SDMMC D0 to D3)
where the direction is ganged and {\it under the Bus's control}
\item Input Priority Muxer: a multiplexer with N selector
wires and N associated inputs. The lowest (highest?) indexed
"selector" enabled results in its
input being routed to the output.
\item Output Muxer: a many-to-one "redirector" where any one
input is "routed" to the output, based on a selector "address".
\end{itemize}
}
\frame{\frametitle{Why, How and What is a Pinmux?}
\begin{itemize}
\item Why? To save cost, increase yield, and to target multiple
markets with the same design, thereby increasing uptake
and consequently taking advantage of volume pricing.\vspace{4pt}
\\
Summary: it's all about making more money!\vspace{4pt}
\item How? By multiplexing many more functions (100 to 1,200) than there
are actual available pins (48 to 500), the required chip package
is cheaper, smaller, and more versatile\vspace{4pt}
\item What? A many-to-many dynamically-configureable router of
I/O functions to I/O pins
\end{itemize}
\bf{Note: actual muxing is deceptively simple, but like a DRAM cell
it's actually about the extras (routing, docs, specs etc).\\
Just as DRAM Cell != DDR3/4, Muxer Cell != Pinmux}
}
\frame{\frametitle{What options are available (at time of writing)? [1]}
\vspace{6pt}
{\bf Commercial licensed}:
\vspace{4pt}
\begin{itemize}
\item Cost: unknown (and ultimately doesn't matter)
\item Flexibility: unknown (NDAs required in order to find out)
\item Language: unknown (NDAs required in order to find out)
\item Capability for auto-generation of Docs: unknown.
\item Capability for auto-generation of ancillary resources: unknown.
\item Suitability for wide range of systems: unknown.
\vspace{4pt}
\item Suitability for saving RISC-V ecosystem money: {\bf NONE }
\item Suitability for collaboration: {\bf ZERO} (prohibitive licensing)
\end{itemize}
\vspace{6pt}
Commercial licensees are isolated and cut off from the benefits
and resources of the Libre world. Translation: USD \$200k+ NREs.
}
\frame{\frametitle{What options are available (at time of writing)? [2]}
\vspace{6pt}
{\bf SiFive IOF (Freedom E310, Unleashed U540)}:
\vspace{4pt}
\begin{itemize}
\item License: Good!
\item Flexibility: not so good.
\item Language: chisel3.
\item Capability for auto-generation of Docs: none.
\item Capability for auto-generation of ancillary resources: partial.
\item Suitability for wide range of systems: not so good.
\vspace{4pt}
\item Suitability for saving RISC-V ecosystem money: {\bf Low }\\
\item Suitability for collaboration: {\bf GOOD} (but: written in Chisel3)
\end{itemize}
\vspace{6pt}
Using SiFive IOF has Libre benefits, but it's incomplete and
harder to find Chisel3 programmers (than e.g. for python).
}
\frame{\frametitle{What options are available (at time of writing)? [3]}
\vspace{10pt}
\begin{center}
{\Huge
None. No suitable\vspace{20pt}\\
Libre-licensed\vspace{20pt}\\
pinmux exists\vspace{20pt}
}
\\
(which is really weird, given how there's so many libre UART,
SPI and other peripheral libraries, even libre-licensed PCIe and
SATA PHYs and even USB3 Pipe. Hence the reason for this initiative)
\end{center}
}
\frame{\frametitle{Associated Extras}
\begin{itemize}
\item Design Specification ({\bf what} markets to target)
\item Scenario analysis ({\bf whether} the chip will fit "markets")
\item Documentation: Summary sheet, Technical Reference Manual.
\item Test suites
\item Control Interface (AXI4 / Wishbone / TileLink / other)
\item Simulation
\item Linux kernel drivers, DTB, libopencm3, Arduino libraries etc.
\end{itemize}
Example context:
\begin{itemize}
\item Shakti M-Class has 160 pins with a 99.5\% full 4-way mux
\item Almost 640-way routing, 6 "scenarios" (7th TBD),
100+ page Manual needed,
\bf{17,500 lines of auto-generated code}
\end{itemize}
}
\frame{
\vspace{30pt}
\begin{center}
{\Huge
ALL of these\vspace{20pt}\\
can be\vspace{20pt}\\
auto-generated\vspace{30pt}
}
\\
(from the Design Specification, after Scenario Analysis)
\end{center}
}
\frame{\frametitle{Example: 7 banks, 4-way mux, 160 pins}
\begin{center}
\includegraphics[height=1.5in]{example_pinmux.jpg}\\
7 "banks" with separate VCC. Each no more than 32 bits
\end{center}
\begin{itemize}
\item { \bf 17,500 lines of auto-generated HDL (and climbing)}
\item { \bf 12,500 lines of auto-generated Summary/Analysis}
\item Technical Reference Manual expected to be 100+ pages
\end{itemize}
}
\frame{\frametitle{Reduce workload, reduce duplication, reduce risk and cost}
\begin{itemize}
\item Auto-generate everything: documentation, code, libraries etc.\\
(including device-tree files, FreeBSD / Linux / RTOS kernel
drivers, Arduino, libopencm3 and other EC firmware libraries)
\vspace{4pt}
\item Standardise: similar to PLIC, propose GPIO and Pinmux\\
saves engineering effort, design effort and much more
\vspace{4pt}
\item Standardise format of configuration registers:
saves code duplication effort (multiple software environments)
\vspace{4pt}
\item Add support for multiple code formats: Chisel3 (SiFive IOF),
BSV (Bluespec), Verilog, VHDL, MyHDL.
\vspace{4pt}
\item Multiple auto-generated code-formats permits cross-validation:\\
auto-generated test suite in one HDL can validate a muxer
generated for a different target HDL.
\vspace{4pt}
\end{itemize}
}
\frame{\frametitle{Design Spec and Scenario Analysis}
\begin{itemize}
\item Analyse the target markets (scenarios) that the chip will sell in\\
(multiple markets increases sales volume, reduces chip cost)
\vspace{4pt}
\item Scenarios represent target markets: ICs to be connected\\
(GPS, NAND IC, WIFI etc. May require prototype schematics
drawn up, or client-supplied schematics analysed).
\vspace{4pt}
\item Create a formal (python-based) specification for the pinmux
\vspace{4pt}
\item Add scenarios (in python), check that they meet requirements\\
{ \bf (before spending money on hardware engineers!) }
\vspace{4pt}
\item Analyse the scenarios: if pins are missing, alter and repeat.\\
\vspace{4pt}
\item Eventually the pinmux meets all requirements...\\
{ \bf without spending USD \$5-50m to find out it doesn't!}
\end{itemize}
}
\frame{\frametitle{Muxer cases to handle (One/Many to One/Many) etc.}
\begin{itemize}
\item One FN output to Many Pins: no problem\\
(weird configuration by end-user, but no damage to ASIC)
\item One Pin to Many FN inputs: no problem\\
(weird configuration by end-user, but no damage to ASIC)
\item Many FN outputs simultaneously to one Pin: {\bf does not occur}\\
(not desirable and not possible, as part of the pinmux design)
\item Many Pins to One FN input: {\bf Priority Mux needed}\\
No priority mux: Pin1=HI, Pin0=LO and ASIC is destroyed
\item Some FNs (I2C\_SDA, SD\_D0..3) are I/O Buses\\
Bi-directional control of the Pin must be handed to the
FN
\item Nice to have: Bus sets pintype, signal strength etc.\\
e.g. selecting SD/MMC doesn't need manual pin-config.\\
\bf{caveat: get that wrong and the ASIC can't be sold}
\end{itemize}
}
\frame{\frametitle{Pin Configuration, input and output}
In/out: {\bf Note: these all require multiplexing }
\begin{itemize}
\item Output-Enable (aka Input disable): switches pad to Out or In
\item Output (actually an input wire controlling pin's level, HI/LO)
\item Input (actually an output wire set based on pin's driven level)
\end{itemize}
Characteristics: {\bf Note: these do not require multiplexing }
\begin{itemize}
\item Output current level: 10mA / 20mA / 30mA / 40mA
\item Input hysteresis: low / middle / high. Stops signal noise
\item Pin characteristics: CMOS Push-Push / Open-Drain
\item Pull-up enable: built-in 10k (50k?) resistor
\item Pull-down enable: built-in 10k (50k?) resistor
\item Muxing and IRQ Edge-detection not part of the I/O pin
\item Other? (impedance? not normally part of commercial pinmux)
\end{itemize}
}
\frame{\frametitle{Standard GPIO 4-way in/out Mux and I/O pad}
\begin{center}
\includegraphics[height=2.5in]{../shakti/m_class/mygpiomux.jpg}\\
{\bf 4-in, 4-out, pullup/down, hysteresis, edge-detection (EINT)}
\end{center}
}
\frame{\frametitle{Separating Pin Configuration, input and output}
\begin{itemize}
\item Standard Mux design {\bf cannot deal with many-to-one inputs}\\
(SiFive IOF source code from Freedom E310 cannot, either)
\vspace{4pt}
\item I/O pad configuration conflated with In-Muxer conflated with
Out-Muxer conflated with GPIO conflated with EINT.
\vspace{4pt}
\end{itemize}
{\bf IMPORTANT to separate all of these out:
\vspace{4pt}}
\begin{itemize}
\item EINTs to be totally separate FNs. managed by RISC-V PLIC\\
(If every GPIO was an EINT it would mean 100+ IRQs)
\vspace{4pt}
\item GPIO In/Out/Direction treated just like any other FN\\
(but happen to have AXI4 - or other - memory-mapping)
\vspace{4pt}
\item Pad configuration separated and given one-to-one Registers\\
(SRAMs set by AXI4 to control mux, pullup, current etc.)
\end{itemize}
}
\frame{\frametitle{Register-to-pad "control" settings}
\begin{center}
\includegraphics[height=2.5in]{reg_gpio_cap_ctrl.jpg}\\
{\bf pullup/down, hysteresis, current, edge-detection}
\end{center}
}
\frame{\frametitle{GPIO (only): Simplified I/O pad Diagram (FN only)}
\begin{center}
\includegraphics[height=1.3in]{reg_gpio_pinblock.jpg}
\end{center}
\begin{itemize}
\item GPIO In/Out/Direction is just another FN (effectively)
\item 3 wires: IN, OUT, OUTEN (=INEN\#)
\item FN however may be output-only (UART\_TX), input-only (UART\_RX)
or bi-directional (I2C\_SDA) and Bus-controlled.
\item GPIO is definitely bi-directional and under Register control
\end{itemize}
}
\frame{\frametitle{Output Muxer (very simple)}
\begin{center}
\includegraphics[height=1.1in]{reg_gpio_out_mux.jpg}\\
{\bf Output Muxer using 2-bit address selection}\\
\end{center}
\begin{itemize}
\item Very straightforward (deceptively so, like SRAM cells)
\item Used in both OUT routing and Direction-control routing\\
(same address for each, connected to same FNs)
\item More complex pinmux will have 3-bit addressing (8 FNs)\\
(Note: not all outputs will be connected, depends on pinmux)
\end{itemize}
}
\frame{\frametitle{In/Out muxing, direction control: GPIO just a FN}
\begin{center}
\includegraphics[height=2.5in]{reg_gpio_fn_ctrl.jpg}\\
{\bf Note: function can control I/O direction (bus)}
\end{center}
}
\frame{\frametitle{Direction Control: Function not bi-directional (bus)}
\begin{center}
\includegraphics[height=2.5in]{reg_gpio_fn_ctrl2.jpg}\\
Note: Function {\bf does not} control I/O direction
\end{center}
}
\frame{\frametitle{Output (and OUTEN) Wiring. 2 pins, 2 GPIO, 2 Fns}
\begin{center}
\includegraphics[height=2.5in]{reg_gpio_out_wiring.jpg}\\
{\bf Reg0 for Pin0, Reg1 for Pin1, Output and OUTEN same mux }
\end{center}
}
\frame{\frametitle{Input Selection and Priority Muxing}
\begin{center}
\includegraphics[height=0.75in]{reg_gpio_comparator.jpg}\\
{\bf Muxer enables input selection}\\
\vspace{10pt}
\includegraphics[height=1.25in]{reg_gpio_in_prioritymux.jpg}\\
{\bf However multiple inputs must be prioritised }
\end{center}
}
\frame{\frametitle{Input Priority-Mux Wiring: very different from Out-Mux}
\begin{center}
\includegraphics[height=2.5in]{reg_gpio_in_wiring.jpg}\\
{\bf Pin Mux selection vals NOT same as FN selection vals}
\end{center}
}
\frame{\frametitle{Input Priority-Mux Wiring}
\begin{itemize}
\item In-Muxer selection number (0,1,2,3) obviously has to match
with Out-Muxer order (otherwise a bi-directional FN
needs different Mux-register settings for
selecting either IN or OUT)
\vspace{6pt}
\item Priority-mux selection values do not actually matter,
and have nothing to do with the actual Muxer settings.
\vspace{6pt}
\item GPIO FN's input muxer is nothing more than an AND gate\\
(you never route more than one pin to one GPIO)
\vspace{6pt}
\item Any other FN with only 1:1 on its IN also just an AND gate \\
(this just always happens to be true for GPIO)
\vspace{6pt}
\item Not all FNs have input capability: clearly they will not
be included in the In-Muxing.
\end{itemize}
}
\frame{\frametitle{Summary}
\begin{itemize}
\item Value of Libre/Open pimux dramatically underestimated\\
(and does not presently exist: SiFive's IOF not suitable as-is)\\
{\bf Only current option: license a commercial Pinmux }
\item Actual muxing (like SRAM cells) is deceptively simple
\item Actual pinmuxes are enormous: auto-generation essential
\item HDLs completely unsuited to auto-generation task\\
(TRM, docs): {\bf Modern OO language needed i.e. python}
\item Scenario Analysis / Verification and auto-generation of
different HDLs far easier in a Modern OO language\\
(better libraries, more developers)
\item Standardisation for RISC-V saves implementors from huge
duplication cost (HDL, firmware, docs, maintenance)
\item { \bf Ultimately it's about saving money and reducing risk }
\end{itemize}
}
\frame{
\begin{center}
{\Huge The end\vspace{20pt}\\
Thank you\vspace{20pt}\\
Questions?\vspace{20pt}
}
\end{center}
\begin{itemize}
\item http://libre-riscv.org/shakti/m\_class/pinmux/
\end{itemize}
}
\end{document}
|
https://ctan.math.washington.edu/tex-archive/info/examples/tlc2/7-6-1.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656103640328.37/warc/CC-MAIN-20220629150145-20220629180145-00263.warc.gz | 246,720,651 | 1,057 | %%
%% The LaTeX Companion, 2ed (second printing August 2004)
%%
%% Example 7-6-1 on page 371.
%%
%% Copyright (C) 2004 Frank Mittelbach, Michel Goossens,
%% Johannes Braams, David Carlisle, and Chris Rowley
%%
%% 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.
%%
\documentclass{ttctexa}
\pagestyle{empty}
\setcounter{page}{6}
\setlength\textwidth{207.0pt}
\StartShownPreambleCommands
\StopShownPreambleCommands
\begin{document}
\centering
\fontsize{20mm}{22mm}% select size
\usefont{T1}{put}{b}{n}% select font
Utopia-Bold
\end{document}
|
http://dlmf.nist.gov/10.63.E5b.tex | nist.gov | CC-MAIN-2015-27 | application/x-tex | null | crawl-data/CC-MAIN-2015-27/segments/1435375098987.83/warc/CC-MAIN-20150627031818-00160-ip-10-179-60-89.ec2.internal.warc.gz | 76,433,985 | 604 | $q_{\nu}=\mathop{\mathrm{ber}_{\nu}\/}\nolimits x{\mathop{\mathrm{bei}_{\nu}\/}%
\nolimits^{\prime}}x-{\mathop{\mathrm{ber}_{\nu}\/}\nolimits^{\prime}}x\mathop%
{\mathrm{bei}_{\nu}\/}\nolimits x,$ |
https://ficpubs.uai.cl/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%20328%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= | uai.cl | CC-MAIN-2022-40 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2022-40/segments/1664030335257.60/warc/CC-MAIN-20220928145118-20220928175118-00252.warc.gz | 298,266,279 | 1,351 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Chandia_etal2013} Chandia, O., Mikhailov, A., \& Vallilo, B. C. (2013). A construction of integrated vertex operator in the pure spinor sigma-model in AdS(5) x S-5. \textit{J. High Energy Phys.}, \textit{2013}(11), 11 pp.
\end{thebibliography}
\end{document}
|
https://pharmascope.org/index.php/ijrps/article/download/4853/13935 | pharmascope.org | CC-MAIN-2021-49 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-49/segments/1637964358966.62/warc/CC-MAIN-20211130080511-20211130110511-00474.warc.gz | 505,695,068 | 19,887 | \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.ttf,%
ItalicFont=CAMBRIAI.TTF,%
BoldItalicFont=CAMBRIAZ.TTF]{Cambria.ttf}
\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}
\newcommand{\texttildeapprox}{{\fontfamily{pcr}\selectfont\texttildelow}}
\begin{document}
\def\RunningAuthor{Shivani Agarwal et al.}
\firstPage{2269}
\articleType{Review Article}
\receivedDate{18 Jun 2021}
\acceptedDate{22 Jul 2021}
\revisedDate{20 Jul 2021}
\journalVolume{2021, 12}
\journalIssue{3}
\journalDoi{ijrps.v12i3.4853}
\copyrightYear{2021}
\def\authorCount{3}
\def\affCount{1}
\def\journalTitle{International Journal of Research in Pharmaceutical Sciences}
\title{Artificial Intelligence in the Pharmacy Profession}
\author{Shivani~Agarwal\textsuperscript{*},
Rachit~Kumar~Gupta,
Shivang~Kumar~\\[5pt]{Moradabad Educational Trust Faculty of Pharmacy, Moradabad, Uttar Pradesh- 244001, India}}
\begin{abstract}
The scientist named `John McCarthy' used the term "Artificial Intelligence" for the very first time in 1956. Previously, it is only limited to engineering field, but in the recent years, it is briefly introduced into the other fields like pharma, healthcare, business, public sector etc. This review article presented to help as a short presentation of AI for the doctors and pharmacists. Here we describe the AI in various field of medical care, its advantage as well as disadvantages in pharmacy, and its tools. It is greatly advanced into the decision-making, problem solving and critical thinking and having applications in various fields like business, pharmacy, health care, and engineering as well. Now the robots are using in the various medical procedures as they are more trustworthy for doctors, as they are more advanced in their work, as they can do any task within the short time period and effectively than humans. This is concluded that AI is the new evolving field in every sector, even in pharmacy, and it need more development for updating the current scenario as well as for new researches.
\end{abstract}\def\keywordstitle{Keywords}
\begin{keywords}Artificial Intelligence (AI),\newline Clinical Trial,\newline Deep Learning,\newline Drug Discovery,\newline Machine Learning,\newline Oncology,\newline Robot
\end{keywords}
\twocolumn[ \maketitle {\printKwdAbsBox}]
\makeatletter\textsuperscript{*}Corresponding Author\par Name:\ Shivani~Agarwal~\\ Phone:\ 9456689876~\\ Email:\ [email protected]
\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}
The most evolving field ``Artificial intelligence (AI)'' which is known to impart a revolution change in the field of drug development as well as in the field of healthcare. This happens because of its prospective to handle the big data and awareness for clinical decision-making as well as accomplishing value-based care. It is difficult to know the strategy of AI expertise plus the way of working as well as improving the safety, efficiency, capability of working and supporting to the digital transformation of healthcare \unskip~\citep{1194903:23039437}. AI might affect the healthcare arrangements as well as the outcomes from the production and market in a huge advanced marketplace which is able to generate \$100 billion annually \unskip~\citep{1194903:23039465}. There is no world widely acceptable definition of Artificial intelligence, it is regarding as a general principle or procedure-formula, used in the all pharmaceutical industry with the general goals of making advance the technologies and increasing product yield. AI has incorporate in most of the all procedures, methods, calibration \& validation and in other techniques \unskip~\citep{1194903:23039451}. All these strategies are collectively known as AI: Artificial Intelligence. AI is continuously affecting and improving every aspect of healthcare system making it more and more advance for future generation. It involve clinical decision support to the patient care, as well as from self-management of many diseases to drug discovery \unskip~\citep{1194903:23039443}. It almost comprises all field of technologies. Employing Al in every field is costly and challenging because there are many challenges which resist the development of AI in the field of healthcare. Some of them challenges as follows:
\begin{enumerate}
\item \relax Lack of knowledge;
\item \relax Lack of planning strategy for employing AI into existing system to solve problems more efficiently that are currently evolving;
\item \relax Lack of personnel's which are trained in AI field;
\item \relax Lack of organization which give finical support to develop AI strategies;
\item \relax And a lack of medical data for the training and examining the algorithms \unskip~\citep{1194903:23039437,1194903:23039461}.
\end{enumerate}
Many reports and experts in industry believed that the development of new techniques using AI is important and should be launched. Machines which ae working under the influence of AI or ML, are more advance in the field of decision making and automation. It can be labelled as the system or whole system that is capable to take inputs from environment, enhance that input as well as acquire the inputs and take actions in respect to that input and help or modify work for achieving particular goal \unskip~\citep{1194903:23039451}. A team of researchers and institutions at Google Inc. are working on developing an AI system that could be worked like a physician so that it can predict the sensitivity at the human level and can diagnose, operate the particular condition as well as identifying the chances of risk in the implementation in healthcare so that those can be minimized \unskip~\citep{1194903:23039449}. Machine learning recognized as a tool of AI. It is somewhat that makes the whole system automatic. In other words, it gives the capability of automation to the system so that they can learn and improve the mistakes from experiences without changing in the programme. The goal of Machine learning is to develop a system that can admit and use or acquire the data to learn the improvement itself \unskip~\citep{1194903:23039439}. In other terms, Machine learning is the algorithms that is planned to examine or evaluate and make decisions and predictions according to new and experience work. Currently, machine learning has evolved in almost all fields of health care like diagnosis of diseases, recognition of general symptoms, as well as in the research field, radiology, oncology etc. and epidemic outbreak prediction \unskip~\citep{1194903:23039440}.
\textbf{Advantages of AI in the Medical Field}
There are following the reasons which make the more benefits of AI in the healthcare system:
\textbf{Improving Face to Face and Online Consultations}
\textbf{Clinical Help and Medication Management}
``Molly'' is a virtual nurse that was designed through a Sense.ly start-up with pleased face express plus a charming voice and work on the principle of ML. The general purpose of developing molly was to provide the immediate help and disease management to the patients in the middle of physicians 'visit'. The AiCure also uses the same concept that work by using phone's camera and AI to have an eye on patient so that he/she is taking prescription at time. This concept could be helpful in the case of clinical trial and patient having chronic condition \unskip~\citep{1194903:23039463}.
\textbf{Diagnosis Based on AI }
The Food and Drug Administration endorsed a software programme which lets medical experts to accomplish cardiovascular ultrasound imaging without any special training. It works on the concept of AI and give constant direction and furthermore the capacity to save pictures of diagnostic area. It gives the general instructions for user including their procedure of working and automatically gives response in the form of picture. It may be called ``co-pilot'' because who don't have such knowledge about ultrasound, can do ultrasound without an expert \unskip~\citep{1194903:23039455}.
\textbf{Mining Clinical Records}
The collection; storage; as well as tracking of medical records is a serious work for the purpose of future investigation or researches. This work is initially handled by AI platforms effectively like Google Deepmind Health is work in the collaboration of Moorfields Eye Hospital NHS Foundation Trust to give the assist in the eye treatment through investigation in the scan of retina. This algorithm can recognize the many eyes `problems and give results in the detailed determinations within 30s \unskip~\citep{1194903:23039470}.
\textbf{Precision Medicine}
In the many cases, doctors are using software which recognizes the change in the mutation of gene in the normal genes and cancerous genes. This advanced work results in the more focused therapies for the different types of cancers. E.g. Deep Genomics Company which works to recognize the patterns in the genetic data of patients and try to connect mutation to ailments and the A.I. - based algorithm named Oncompass Medicine differentiate the gene in the patient having cancer with the ongoing clinical trials \unskip~\citep{1194903:23039463}.
\textbf{Planning Treatment Strategies for Patients}
The most popular AI based concept that is IBM Watson which is useful for the oncologists designed to analyse the data of patient whether it is correctly structured or not, thereby turned into decision-making for the treatment. The software predict the way of treatment by comparing the data of patient with the clinical researches \unskip~\citep{1194903:23039456}. There are several examples in other fields of medical like in radiology, making an enhanced radiation therapy requires days. With the help of AI, this process can be speed up to couples of minutes \unskip~\citep{1194903:23039463}.
\textbf{Drug Creation}
The process of drug development requires several years as it go through many clinical trials and huge cost as well. By speeding up this trials while making it more costly, would be show a great impact on healthcare. Many companies are using AI based technologies to speeding up this process e.g. company Atomwise uses supercomputers from which they find out best treatment form a database of molecular structure. They have also been launched a search engine for the existing as well as unknown combination of drugs for the treatment of many infective diseases. This AI platform reduces the time taken by drug development process \unskip~\citep{1194903:23039457}.
\textbf{Disadvantage }
\textbf{Quality and Quantity of Data}
AI benefits from information as it can access more data and it can dominate at undertakings. Advanced algorithms need explained information to ensure those are expert in their work and intended to use in particular assignment. There are clinical experts who go about as information annotators which is a tedious and repetitive undertaking. Clinical algorithms could be beneficial in only enhancing the large annotated data. So that the role of annotators to assist executing AI in the medical care system. So here we conclude that the data annotators are play a vital role in the AI revolution in medical field \unskip~\citep{1194903:23039463}.
\textbf{Privacy or Security Issues}
AI in medical sector needs to access more and more data to learn new aspects of medical state timely, whether this learn data from medical algorithms, biosensors, applications or from institutions or whatever basis of information, it get. This data may access from an institution or an application or from any people. It was demonstrated much of the time that individual's profile can be tracked back easily if foundations makes information anonymized.
\textbf{Legal Issues and R} \textbf{esponsibility }
There is a possibility that deep learning can skip or miss a report during diagnosis of a patient, it predict the any treatment to the doctor, and the doctor accepts that judgment as it given by software and the patient is suffering from its medical condition continuously. Another problem during the surgeries which are done by automatic robots, what if automatic robots hurts a patient. There is a continuous discussion about who will be the responsible for the any harm or any problem when automatic robots and AI both are operating human together.
Current agreement expresses that the expert is responsible in the event that the person utilized the instrument in a circumstance or use besides its agreement, or abused it, or use it notwithstanding huge expert questions of the legal issues of the proof encompassing the tools. The responsibility such work is depend on the inventors and the organizations follow them.
\textbf{Trust}
The medical profession is all about trust on the medical expert that they are treating the patient in a correct way of monitoring. We need a lot of to make trust on the automated operating machines e.g. how an automatic car react in the circumstances we know or whether it settles on comparable choices in a crisis. Thus it takes even more to believe on it for patients and for medical experts too as it highly involve in the drug design, and decision making in the IBM Watson case. Trust issue point should be considered whenever we choose any technology in the medical profession.
\textbf{Patient Design}
The designing algorithms are involved in the clinical trial at a high level of thinking and decision making so that they met to the patents problems and changes are adapted as per the patients convenient. E.g. there was a start-up in Canada which comprised of an algorithm that was able to identify the Alzheimer in the phone calls of patients and showed various outcomes of patients who were not from the origin of Canada, whether they are from French or other country. This problem can be minimized by involving the people at the beginning of the improvement. So there are many researches that are being held for developing these algorithms in some way that they can address them all humans whether they belong to any part of the world. It can comprises all human beings \unskip~\citep{1194903:23039436}.
\textbf{Tools of AI}
There are enormous tools of AI which has been complied with the present issues of industries and continuously improving it. Some of the AI tools that are popular in the pharmaceutical industry are shown in Figure~\ref{f-2454ca3dcb75} and described below:
\bgroup
\fixFloatSize{images/f5a31fb4-f62d-467b-a9df-5f346b29eec4-upicture1.png}
\begin{figure*}[!htbp]
\centering \makeatletter\IfFileExists{images/f5a31fb4-f62d-467b-a9df-5f346b29eec4-upicture1.png}{\includegraphics{images/f5a31fb4-f62d-467b-a9df-5f346b29eec4-upicture1.png}}{}
\makeatother
\caption{\boldmath {Tools of Artificial Intelligence}}
\label{f-2454ca3dcb75}
\end{figure*}
\egroup
\textbf{IBM Watson for Oncology}
A supercomputer has developed by IBM (International Business Machines) for the oncologist to response to basic questions. It is a combination of AI plus modern diagnostic software technique, this supercomputer is known as Watson. It helps to oncologist to take better treatment plans for cancer by providing an appropriate therapy based on the evidence obtained. This supercomputer works by checking the clinical data of a patient and then aptitude, afterward gives the best options for the treatment of patient. This supercomputer has capacity to collect clinical data of patient easily, rewrite in the simple language and compares the data of patient with the research, and clinical researches then provide the suitable and best treatment plan according to the report of patient and then gives the best treatment plan for the patient \unskip~\citep{1194903:23039450,1194903:23039459}.
\textbf{Robot Pharmacy}
University of California San Fransisco (UCSF) uses the robote pharmacies for the production and stalking of drugs with the general goal of enhancing the safety and efficacy of the drugs for the patients. This technology has made almost 350,000 drug doses with increase yield and without any error, this is because of their size as well as capability of delivering accurate drugs and these two qualities makes them better than human in the handling of drug as there are many chances of mistake which may turn to be a great loss of company or may lead to dangerous to the life of patient. The robotic technology has capable to prepare oral and sterile injectable preparations of toxic substances in the case of chemotherapy drugs. The robotic technology has reduced the work load of pharmacists as well as nurses of UCSF and this results in better patient care because they can directly and fully available to the patient care and helping to the doctors.
The robotic technology is the fully automatic system that first receive the prescription electronically from the pharmacists and pick the individual doses of drug then packed and dispensed. There is an advantage of the automatic system that it is helpful in the handling of sterile preparations as it can fill the syringes with the right medications. These all facilities are fully automatic \unskip~\citep{1194903:23039447}.
\textbf{MEDi Robot}
``Medicine and Engineering Designing Intelligence'' is the full form of MEDi. This robot was developed by Tanya Beran, she is the professor of Community Health Sciences at the University of Calgary in Alberta. She got the thought of designing MEDi robot while working in a hospital where children were shout during the medical treatment. These robots are designed to make a bond with children to make them comfort and afterwards tell them about the medical treatment and what is expected during the procurement. It directs those general things that should done during the medical procedure like how to inhale during the procedure, and how to handle. It can be designed with the AI in such way that they can think, plan, or reason.
MEDi made by company Aldebaran Robotics and having intrinsic facial acknowledgment technology. These are capable to communicate in 20 different languages and versatile in their work as per different situations. They have retailer price of \$9000, however, this cost can be increased with the implementation of new application up to \$30000. The main purpose of the development of robot was the pain management of kids during medical procedures, but it has expanded their work as they are now capable to involve in medical procedures \unskip~\citep{1194903:23039450}.
\textbf{Erica Robot}
Erica is a new robot that has been developed by Hiroshi Ishiguro, a professor at Osaka University, in the collaboration with the Japan Science and Technology Agency, Kyoto University, and the Advanced Telecommunications Research Institute International (ATR). It can able to speak Japanese and has facial expression of European and Asian. It has desired to visit south-east Asia, want a life partner with whom it can talk and enjoys animated movies. Erica is the ``most excellent and smart'' as android. The robot could not walk properly; yet it has developed the ability of understanding and human like facial expressions \unskip~\citep{1194903:23039450}.
\textbf{TUG Robots}
These are designed for help in emergencies and delivering drugs, food as well as can convey the weight loads in the hospital. There are the two configurations of TUG robots that is fixed carts and exchange base platform. The fixed card can be used to convey the drugs, laboratory specimens whereas, the exchange base platform can be used to convey the material which are loaded in the different racks. TUG can convey a few kinds of trucks or racks subsequently making it a truly adaptable and utilizable asset. Monitoring TUG is a very simple task with the help of the touchscreen which allows clients to figure out where the TUG need to deliver and supply material. The TUG automatically decide the best way in the case of multiple destinations. The advantage of using TUG are the enhanced efficacy, patient safety, employee fulfilment as well \unskip~\citep{1194903:23039438}.
\textbf{Application of AI }
There are several applications of AI in the pharmacy shown in Figure~\ref{f-b3fd52910b0a} and these are the masters in their work:
\bgroup
\fixFloatSize{images/973cfb9b-de7a-4c1e-ae53-72d3806e07c1-upicture2.png}
\begin{figure*}[!htbp]
\centering \makeatletter\IfFileExists{images/973cfb9b-de7a-4c1e-ae53-72d3806e07c1-upicture2.png}{\includegraphics{images/973cfb9b-de7a-4c1e-ae53-72d3806e07c1-upicture2.png}}{}
\makeatother
\caption{\boldmath {Applications of Artificial Intelligence}}
\label{f-b3fd52910b0a}
\end{figure*}
\egroup
\textbf{Artificial Intelligence in Drug Discovery}
The drug discovery process is limited or resisted due to the lack of advanced technologies. Drug discovery process is the costly and time-consuming process \unskip~\citep{1194903:23039450}. With the implementation of AI in this field, it will eliminate the some additional steps like it can easily and quickly shows the drug target as well as predict the drug structure \unskip~\citep{1194903:23039444}. It also faces some problems in the growth, variety, and doubtful or incomplete data, it is unable to deal with such data whereas such data can be handled in the industry.
QSAR-based computer model (Quantitative structure-activity relationship) can be helpful in the quick prediction of physicochemical properties of unknown compound as well as their stability, efficacy and ADR of compound in the biological environment but this model has some problems such as experimental errors in the handling of small training sets, lack of validations etc. To solve this problem, there are DL (deep learning) and relevant modelling studies, new AI innovations, which is devised for the predictions of safety and efficacy evaluation parameters of drug compounds in the researches.
There are many tool which act as virtual chemical space and predict the environmental distribution of the molecules by illuminating the properties of drug molecules. Examples of such virtual chemical space are: PubChem, ChemDBChemBank, etc. the reason behind the virtual chemical space is the illumination the distribution of compound and the collection of data to explore the bioactive compounds \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence} \textbf{ in the Lifecycle of Pharmaceutical Products}
The pharmaceutical product can be developed with the implementation of AI in the sector of advance decision making, advanced drug design techniques which provides basis for the future researches, and it is helpful in generating clinical data for the proposed researches. There is an AI platform, developed by Eularis, worked on the principle of ML algorithms named E-VAI which is used as a decision making platform that help to predict the better way of marketing. E. g. it generates analytical data of a pharmaceutical product which helps to gain competition in market and it tells about the correct strategy for the maximum sale of pharmaceutical product, thus help the marketing executives to locate the exact location for marketing as well as increase the interest of investors to make more investments \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence} \textbf{ in Advance Pharmaceutical Product Development}
There is the step of formulating the suitable dosage form of new discovered drug molecule after the discovery of a new drug molecule and before the marketing the product, which retain the property of drug molecule and deliver the desired effect with minimum adverse effects. This step can be done with the aid of AI that replaces the older trial system and minimize the errors \unskip~\citep{1194903:23039464}. With the QSPR model of AI, this step can be helpful in minimizing the errors such as instability, disintegration, dissolution, and so on and the decision-making AI platforms helps to decide the nature, quantity as well as type of pharmaceutical excipient, it works as a feedback mechanism for entire process which monitor and modify it occasionally \unskip~\citep{1194903:23039452}.
Various mathematical tools which works in the AI, e.g. computational fluid dynamics (CFD), discrete element modelling (DEM) etc. used to analyse the flow properties of power in the tablet manufacturing process and its dissolution rate profile in the case of computational fluid dynamics (CFD). With the help of these all models of AI, production of pharmaceutical products has been very easy and quick process \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence } \textbf{in Pharmaceutical Manufacturing}
The involvement of AI in manufacturing is like power boost for the pharmaceutical industry. The AI is continuously changing the manufacturing process, as now modern manufacturing systems with AI are trying to give human knowledge to machines with expanding interest of efficiency and better product quality along with reducing the complexities in the manufacturing processes \unskip~\citep{1194903:23039464}.
AI platforms are making the manufacturing process so easy with the advanced tools like CFD, Reynolds-Averaged Navier-Stokes solvers technology that use to review the stress level in machine and misusing the automation in the many pharmaceutical process. In the similar way, mathematical simulations are also producing a progressed ways to deal with complex flow problems in manufacturing \unskip~\citep{1194903:23039469}.
It has been used in the manufacturing of many compounds like sildenafil, diphenhydramine hydrochloride with the maximum yield and purity as similar as convectional method of manufacturing. The working capacities of granulation has increased up to 600L with the aid of AI technologies and correlated neuro-fuzzy logic.
They provide prediction with the help of an equations which determines the quantity of fluid to be added, and necessary speed for the granulating machine, as well as the diameter of granules. Meta-classifier and tablet-classifier are the apparatuses which assist in the administration the quality of the final product, marking the possible error in the process of tablet manufacturing \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence } \textbf{in Quality Control (QC) and Quality Assurance (QA)}
The equilibrium of various factors should be maintained in the manufacturing of the product from the crude material \unskip~\citep{1194903:23039448}. The batch-to-batch consistency and Quality control tests on the products are required to maintain for the desired product. This methods probably won't be the best methodology for each situation, so that there is a requirement of AI implementation. The Current Good Manufacturing Practices (cGMP) was amended by Food \& Drug Administration (FDA) with the involvement of `Quality by Design' (QbD) methodology for the better understanding the critical operations and the specific quality of the pharmaceutical product.
Goh et al. considered the dissolution rate profile as an indicator of consistency for batch to batch operations with the help of artificial neutral network (ANN), that predict an error of {\textless}8\% in the dissolution rate of various batch to batch operations \unskip~\citep{1194903:23039464}. AI can be executed for the guidelines of processes manufacturing to accomplish the product. Gams et al. used an AI system which is a collaboration of both human efforts and AI where the primary or preliminary information were analysed from the various batches and the results from them are kept as prove which were additionally converted into guidelines and examined by various operators to lead the manufacturing set in the future \unskip~\citep{1194903:23039448}. The Freeze-drying process based on ANN-operating system which work as a group of self-adaptive evolution with backpropagation algorithms and used to give appropriate temperature and cake-thickness for the specific arrangement of working condition, hence help to maintain the quality and consistency of final product. There are many computerized platforms which are used to ensure the quality of the product. E.g. Electronic Lab Notebook. With use of data mining and various intelligent techniques in the TQM (Total Quality Management), improves the important methodologies during the complex decision, creating new technologies for the advanced quality product \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence i} \textbf{n Clinical Trial Planning}
The new drug discovery clinical trials are done for specific disease or infection with the purpose of building or checking safety and efficacy of a particular drug and it requires at least 6 to 10 years with a considerable money investment in completion and the chances of success are less there, which leads to huge loss of industry as well as investor \unskip~\citep{1194903:23039464}. There are many reasons of failure including shortage of technical arrangements as well as unsuitable patient selection. These losses can be minimized with execution of AI in clinical trials which provides a vast digital data for access \unskip~\citep{1194903:23039445}. The main step in the clinical trials is the appropriate selection of the patients which takes about 33\% of total time and the success rate can be ensured by the correct selection of the patients, if this step is taken wrong then leads to 86 \% or overall failure of trails (Kalafatis, 2000). AI can help in choosing the patient data on the basis of patient-specific gene{\textendash}exposome profile examination for the phase II and III of a specific disease clinical trial which will results in the early expectations of drug target in selected patients \unskip~\citep{1194903:23039445}. There is a problem of patients who give up at the time of clinical trials, this problem makes the selection process more sensitive otherwise it leads to 30\% failure of the clinical trials as well as time and money. This failure may be minimize by keeping close eye on the patient nursing and help them to monitor the rules related to clinical trial \unskip~\citep{1194903:23039446}. A mobile application was established by Ai Cure which is responsible for the close monitoring of regular medication consumption in Phase II trials by patients who are suffering from schizophrenia. This application increased the patient loyalty up to 25\% towards the clinical trial and ensuring the success of clinical trial \unskip~\citep{1194903:23039444}.
\textbf{Artificial Intelligence} \textbf{ in Product Management}
\textbf{Artificial Intelligence in Product Positioning in the Market}
Market positioning of product is defined as the mode of building a marketing value or recognition of a product in market where it attracts buyer to buy them. It tries to make a vital element in practical strategies in business for encouraging organizations to make their own matchless personality among all products.
The same methodology was followed by a company in the marketing of pioneer brand Viagra, and they focused on other aspects associated with the men's erectile dysfunction but not specifically on the treatment. It has become easier for companies to market their products and get a unique marketing value of their company using the AI strategy plus e-commerce sites for advertisement.
Companies are using web crawlers as one of the innovative AI platform for getting a marketing value in online market and helps to make a vital element in the market. Companies are trying to make their websites better than their competitors and offering reward system for a short time period which affect their market sale and make them popular \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence in Market Advice and Analysis}
The nonstop growth of business results in the success of a company. The results of R\&D department with the considerable access to technologies, is facing failure due to the lack of the new marketing strategy \unskip~\citep{1194903:23039464}. The advanced digital technologies is helping in the digital marketing by applying multi criteria decision-making approach which help in the collection and examination of the statistical and mathematical data and developing an AI-based decision making models by involving human inference with the general goal of building new advertising strategies \unskip~\citep{1194903:23039458}.
AI also work like a decision-maker which gives the new marketing strategy for a product depending on the customer's perspective and understanding the need of the market and ultimately results in the huge marketing of product. AI-based software's with the executive of ML observe the customers' history based on the last experience, and show the advertisements of products on different sites or platforms which will directly address to the commercial site of product by just a click. This method works on the natural language-processing tools that examines the words entered by you and relate them to the different probable products in the market \unskip~\citep{1194903:23039464}.
Several companies are allowing the searching of products in the web by using product's characteristic, specification and their brand name, this makes the market of a product by its work. In the similar way, many Pharmaceutical companies are launching their apps and making sites for the digitalization e.g. 1 mg, pharmacy etc. \unskip~\citep{1194903:23039458}. AI can predict the market situation for various essential pharmaceutical product which helps companies to keep their price, stock as per the market consuming capacity and reducing the loss. Example of AI platform for such work: Smart Sales Prediction Analysis.
\textbf{Advanced applications of Artificial Intelligence}
\textbf{The implementation of Artificial Intelligence in Nanorobots for drug delivery}
Nanorobots are involved for the most part of coordinated routes, biosensors, control, these all things are maintained and modified timely by AI system. Nanorobots are developed and modified to stay away from crash, detect and attach, target identification. Nano/microrobots with advanced techniques are able to explore more focus on the physicological condition at the target site such as pH, temperature and results in the improved efficacy with maximum bioavailability as well as reducing adverse reactions of drug in body \unskip~\citep{1194903:23039460}. For the delivery of genes and drugs within the parameters required, implantable nanorobots are developed. The drug release from the implantable nanorobots are influenced by AI tools like fuzzy logic etc. \unskip~\citep{1194903:23039464}.
\textbf{Artificial Intelligence based nanomedicine}
Nanotechnology based nanomedicines are become a novel field of drug delivery system for the treatment, detection, and nursing of complicated disease states Nanogel particle drug delivery system has become the novel and most important in the diagnostics and treatment as they show improved efficacy as well as bioavailability of many drugs. The working capacity can be advanced and modified by the implementation of AI \unskip~\citep{1194903:23039441}.
Methotrexate nanosususpension was prepared computationally which was prepared on the basis of energy released by drug molecules reactions and providing the suitable circumstances that that could result in the accumulation of drug particles \unskip~\citep{1194903:23039452}.
\textbf{Artificial Intelligence in Various Fields of Healthcare}
AI has developed in the almost all of the fields of healthcare, making it automatic, and advance as well as up to date. Some of them fields are described below:
\textbf{AI in Radiology}
AI in the radiology has gained more acceptance because of it vital applications in this field. The main reason for this acceptance is the gradual progress in the image-identifying tasks which is a critical step in the diagnostic and AI makes it easy by the accumulation of digital data. Its increased data accessibility in the radiological tests results in the expanded responsibilities of radiologists as well as a lack of professionals. For fasting the diagnosis process, many techniques has been developed which are based on computer vision and AI algorithms, and improving perception of pathogens \unskip~\citep{1194903:23039461}, help in the basic labour issues as well as make them advance for emergency situations. However, this development is not intended to replace humans with robots, not for augmenting with human, the intention behind this development is to assist the application which underline the information that may not be possible to access by humans and providing information in a couples of minutes. There is a platform which was developed by MaxQ-AI Ltd and it is CE approved, used for highlighting the intracranial bleeding area. This start-up is highly beneficial in the radiology and providing at time decision support to the professional and making results more precise in the current intense medical state. They involve the process of 3D CT scan (Computed tomography), which detect the intracranial bleeding area and highlight it. A spinoff company from San Francisco named Viz.ai Inc, is making this technique more advance and one step forward for better diagnosis, they focus on decreasing time consumed in the treatment after the CT scan. This platform is capable to identify the large vessel occlusion (LVO) in the brain which is a common reason for stokes. The platform analyse the images and send an alert to the radiologist where it detect LVO \unskip~\citep{1194903:23039462}. Now the detection of the many diseases has been possible after the implementation of AI like liver, bone, heart problems etc. e.g. the detection of vertebral fractures on the chest and abdomen has been possible with using a set of algorithms \unskip~\citep{1194903:23039461}. Expending AI and deep learning in the diagnosis has been demonstrated pretty much better than human execution in certain sectors, for example, node hub metastasis identification and mammography threat location \unskip~\citep{1194903:23039468,1194903:23039462}.
\textbf{AI in Cardiology}
The ML and AI brings about quicker understanding and conclusion in numerous spaces of cardiology e.g. the process of an Electrocardiogram has been fully automatic, this automatically predict the results in the 3D imaging mode with the capacities of heart plus the angiography which regulate other functions of coronary vessels like calcification etc. \unskip~\citep{1194903:23039442}. The EMR (electronic \textit{medical} record)technique with AI has been showed to be beneficial in the decrease number of death by means of early detection of heart attack and this happens because of its ability to do longitudinal assessment of data to find any clue that gives the predictions for heart failure \unskip~\citep{1194903:23039435}. Employing AI in the decision making process, it predict the best way of treatment in the case of angina, it uses the EMR of patient, and had a superior results in reducing mortality \unskip~\citep{1194903:23039462}.
\textbf{AI in Gastroenterology}
The treatment in this field is mainly depends on the endoscopic pictures of the affected areas. To improve identification in a clinical test that keeps going a couple of moments just, and is played out various times each day an AI based framework was created. The AI platforms such as CAD system (computer aided diagnosis), showed the abnormal area on the screen by highlighting them, thus helping the professional by saving their time. This system is capable in both diagnosis as well as in decision making as it can also define the pictures and predict the best treatment plan. This platform has shown 90\% of detection capacity with improved outcomes in the colonic polyps. This platform has proofed that the AI based platforms can make the diagnosis process more effective. The CAD system was used with the general goals of the early detection gastric cancers and colonic cancers which was not an easy task to detect these medical conditions in the minimum time. It was illustrated to have a 96.3\% accuracy in the detection of gastric diseases with an affectability of 95\% \unskip~\citep{1194903:23039462}.
\textbf{AI in Ophthalmology}
A medical condition known as Diabetic retinopathy (DR) which is currently affecting almost 400 million people globally who experience the ill effects of diabetes. This condition results in the vision and blindness as it affect the veins which goes through retina and may cause detachment of retinal \unskip~\citep{1194903:23039467}. The detection of Diabetic retinopathy can be improved and effective by the execution of AI and deep learning. A study was done by Gulshan et al. who use two approval arrays of 9963 and 1748 pictures and tracked down at high affectability and explicitness rate and contrasted with ophthalmology specialists \unskip~\citep{1194903:23039461}. It has concluded that the deep learning is effective in this field in the early detection of eye related problems, and these studies need further more study and more improvement \unskip~\citep{1194903:23039462}.
\textbf{AI in Oncology}
AI application may really demonstrate to give preferred outcomes over human readings. Somashekhar shown that AI is dependable for the finding of breast cancer \unskip~\citep{1194903:23039454}. The Watson oncology was found to effective in 90\% concordance rate with a specialist tumor board on proposals of best treatments in breast cancer. Bejnordi conducted a study for this. In this study, he contrasted a set of 129 slides, in which 49 slides were with metastases to lymph nodes and 80 slides were without metastases, he done this work with the collaboration of 11 pathologies. For this work, the pathologist need 30hours to compare all slides in actual, whereas these slides can be analysed with the AI algorithm, it requires only couples of minutes. The AI is seen to be more effective than human in the case of lungs cancer detection. A study conducted by KH Yu, C Zhang, they mainly focused on the AI accuracy for pathological diagnosis and they involved the set of 2186 stained slides of lung adenocarcinoma and squamous cell carcinoma.
The conclusions obtained from their study predict that the AI can accurately diagnose the lung cancer as well as giving them appropriate oncological treatment \unskip~\citep{1194903:23039453}. There are many studies that are being held and continuously occurring in the field of oncology and these all are studies are aim at making more advanced way of diagnosis as well as treatment in the cancer case.
\section{CONCLUSION }
The human is believe to be the most complex and cultured machine, but now, the situation has changed significantly. Human are no longer defined to be the most complex machine, the human brain is doing hard word to develop a system that is more complex and effective than human in working capacity and it has successful in doing so. Now it has become an essential part in the pharmaceutical industry in addition to health care system and the researchers are on the fact of implementing the AI in every field of so that many researches are being carried out globally to enhance the manufacturing process better, and enhancing other activities in industry as well as hospitals. The tools of AI like Watson for oncology, Erica robot, robotic pharmacy, etc. has been reformed the pharmacy professional, making it automatic as well as increasing working capacity at a much great extend and there are the less risks of errors. The aim of implementing AI in pharmaceutical is to decrease challenges which met in companies like increased cost of drug development etc. AI is also speeding up the needed time for the development and design as well quality, efficacy, and safety of product in the cost-effective manner, which is turns in the more start-ups in this field. However, execution of AI in the system is not intended to replace the humans but they are intended to help human and work under the guidance of humans. However, if we look at the unemployment ratio as it is increasing day by day and will increased more after the implementation of AI, then it forced to rethink otherwise all the activities that are done by humans, will be a part of AI executive.
\section{ACKNOWLEDGEMENT}
The authors are thankful to Moradabad Educational Trust Faculty of Pharmacy, Moradabad, Uttar Pradesh, India for their support in the completion of this review article.
\textbf{Funding Support}
The authors declare that they have no funding support for this study.
\textbf{Conflict of Interest}
The authors declare that there is no conflict of interest for this study.
\bibliographystyle{pharmascope_apa-custom}
\bibliography{\jobname}
\end{document}
|
https://mirror.anarhija.net/pl.anarchistlibraries.net/mirror/j/jm/john-moore-elementarz-prymitywisty.tex | anarhija.net | CC-MAIN-2022-21 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2022-21/segments/1652662627464.60/warc/CC-MAIN-20220526224902-20220527014902-00790.warc.gz | 453,308,167 | 10,855 | \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{polish}
\setmainfont{cmunrm.ttf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/truetype/cmu/,%
BoldFont=cmunbx.ttf,%
BoldItalicFont=cmunbi.ttf,%
ItalicFont=cmunti.ttf]
\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\polishfont{cmunrm.ttf}[Script=Latin,%
Ligatures=TeX,%
Path=/usr/share/fonts/truetype/cmu/,%
BoldFont=cmunbx.ttf,%
BoldItalicFont=cmunbi.ttf,%
ItalicFont=cmunti.ttf]
\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{Elementarz Prymitywisty}
\date{}
\author{John Moore}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Elementarz Prymitywisty},%
pdfauthor={John Moore},%
pdfsubject={},%
pdfkeywords={prymitywizm; eko; podstawy}%
}
\begin{document}
\begin{titlepage}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Elementarz Prymitywisty\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{John Moore\par}}%
\vskip 1.5em
\vfill
\strut\par
\end{center}
\end{titlepage}
\cleardoublepage
\tableofcontents
% start a new right-handed page
\cleardoublepage
\section{Czym jest anarchoprymitywzim?}
Anarchoprymitywizm (znany też jako radykalny prymitywizm, antyautorytarny prymitywizm, ruch antycywilizacyjny lub po prostu prymitywizm) to skrótowe określenie radykalnego nurtu, który krytykuje całokształt cywilizacji z anarchistycznej perspektywy i stawia sobie za cel zainicjowanie kompleksowej transformacji ludzkiego życia. Ściśle mówiąc nie ma czegoś takiego jak anarchoprymitywizm czy anarchoprymitywiści. Fredy Perlman, ważny głos tego nurtu stwierdził niegdyś, że „jedyny ‚-ista’, jaki do niego pasuje to wiolonczelista”\footnote{Fredy Perlman istotnie był wiolonczelistą.}. Osoby związane z tym nurtem nie chcą uchodzić za zwolenników ideologi. Dążą jedynie do bycia wolnymi jednostkami w wolnych społecznościach w harmonii z innymi, i z biosferą i dlatego mogą odmawiać ograniczania ich poprzez termin „anarchoprymistywista” lub inne ideologiczne etykiety. Zatem w najlepszym razie anarchoprymitywizm jest dogodnym terminem dla scharakteryzowania i objęcia różnych jednostek, mających wspólny projekt: zniesienie wszelkich stosunków władzy – t.j. struktur kontroli, przymusu, dominacji, eksploatacji – i stworzenie takiego społeczeństwa, które wyklucza wszystkie te zjawiska (\dots{})
\section{Czym anarchoprymitywizm różni się od anarchizmu i innych radykalnych ideologii?}
Z anarchoprymitywistycznej perspektywy wszystkie inne formy anarchizmu wydają się być reformistyczne, bez względu na to czy uważają same siebie za rewolucyjne czy nie. Marksizm i klasyczny anarchizm przykładowo, chcą przejąć cywilizację, przerobić jej struktury do pewnego stopnia i usunąć jej najgorsze nadużycia i opresje. Jednak 99\% życia w cywilizacji pozostaje niezmienione w ich przyszłym scenariuszu, właśnie dlatego, że krytykują minimalną ilość jej aspektów. Chociaż i jedni i drudzy chcą znieść kapitalizm, a klasyczny anarchizm chce również znieść państwo, ogólne formy życia wiele by się nie zmieniły. Mimo iż zaszłyby pewne zmiany w stosunkach socjoekonomicznych, takie jak wprowadzenie robotniczej kontroli w przemyśle i rad sąsiedzkich w miejsce państwa, a nawet skupienie się na kwestiach ekologicznych, podstawowe formy pozostałyby bez zmian. Zachodni model postępu byłby jedynie zmodyfikowany i nadal funkcjonowałby jako ideał. Społeczeństwo masowe generalnie kontynuowałoby swój żywot, z pracującą większością, żyjącą w sztucznych, stechnologizowanych środowiskach i pozostającą przedmiotem różnych form przymusu i kontroli. Radykalne ideologie na lewicy szukają sposobów na przejęcie władzy, a nie jej zniesienie. Skutkiem tego rozwijają różne formy ekskluzywnych grup – kadry, partie polityczne, grupy uświadamiające – w celu zdobycia konwertytów i planowania strategii uzyskania kontroli. Organizacje są dla anarchoprymitywistów jedynie naciągaczami i gangami, dążącymi do usadowienia partykularnej ideologii u władzy. Polityka – „sztuka i nauka rządzenia” nie jest częścią anarchoprymitywistycznego projektu; jest nią tylko polityka pragnień, przyjemności, wzajemności i radykalnej wolności.
\section{Dlaczego zatem, dla scharakteryzowania tego nurtu używa się terminu anarchoprymitywizm?}
W 1986 r. członkowie kręgu skupionego wokół pisma ‚Fifth Estate’ w Detroit zasygnalizowali , że pracują nad rozwinięciem „krytycznej analizy technologicznej struktury zachodniej cywilizacji (\dots{}), analizy połączonej z rewizją poglądu na tubylczy świat i charakter prymitywnych i pierwotnych społeczności(\dots{})”. Grupa ‚Fifth Estate’ starała się więc uzupełnić krytykę cywilizacji jako projektu kontroli o rewizję istoty prymitywności, którą traktowała jako potencjalne źródło odnowy i antyautorytarną inspirację. Ta ponowna ocena prymitywności dokonana została z anarchistycznego punktu widzenia, a więc poprzez pryzmat idei eliminacji wszelkich stosunków władzy. Obwieszczając „narodziny syntezy postmodernistycznej anarchii i prymitywności (w sensie pierwotności), ekstatycznej wizji bazującej na symbiozie z Ziemią” ‚Fifth Estate’ deklarowało: „Nie jesteśmy anarchistami per se, ale pro-anarchią, która jest dla nas żywym, integralnym doświadczeniem, niewspółmiernym do władzy i odrzucającym wszelką ideologię\dots{}eksploracja możliwości realizowania się w ten sposób jest częścią naszej działalności w projekcie ‚Fifth Estate’, lecz pracujemy również nad ponownym odkryciem prymitywnych korzeni anarchii. Jednocześnie badamy ewolucję władzy w celu wskazania na nowe obszary dla kontestacji i krytyki, mających na celu osłabienie współczesnej tyranii nowoczesnej, totalitarnej narracji – tej hiperrzeczywistości, która niszczy sens człowieczeństwa, imitując go w technologii. Zasadniczą potrzebą wszystkich bojów o wolność jest odzyskać prawdziwą, ludzką narrację, zakorzenioną w autonomicznej, intersubiektywnej wzajemności, ściśle związanej ze światem przyrody.”
Celem jest więc rozwinięcie syntezy pierwotnej i współczesnej anarchii, syntezy ekocentrycznej, niestatycznej, antyautorytarnej; fuzji prymitywnych sposobów życia z najbardziej zaawansowanymi formami anarchistycznej analizy stosunków władzy. Celem nie jest kopiowanie czy powrót do prymitywności, a jedynie uznanie jej za źródło inspiracji i przykładową formę anarchii. Dla anarchoprymitywistów cywilizacja jest nadrzędną strukturą, w której rozwija się różnorodność stosunków władzy. Pewne podstawowe stosunki władzy obecne są w prymitywnych społecznościach – i to jest jedna z przyczyn dla której anarchoprymitywiści odżegnują się od ich naśladowania – ale to właśnie w cywilizacji te stosunki władzy stały się wszechogarniające i zakorzeniły się praktycznie w każdym aspekcie ludzkiego życia i ludzkich relacji z biosferą. Cywilizacja – określana również megamaszyną lub Lewiatanem – stała się ogromną machiną, która nabrała rozpędu i wymknęła się spod kontroli nawet jej domniemanych władców. Zasilani przez rutynę codziennego życia, zdeterminowaną i kierowaną przez zinternalizowane wzorce posłuszeństwa, ludzie stają się niewolnikami maszyny, systemu cywilizacji. Tylko powszechne odrzucenie tego systemu i jego różnych form kontroli, rewolta przeciwko władzy, mogą znieść cywilizację i ustanowić radykalną alternatywę. Ideologie takie jak marksizm, klasyczny anarchizm i feminizm sprzeciwiają się jedynie pewnym aspektom cywilizacji. Tylko anarchoprymitywizm neguje ją jako całość, jako strukturę, w której rozmnażają się i rozpowszechniają różne formy opresji. Anarchoprymitywizm inkorporuje elementy z różnych opozycyjnych nurtów – świadomą ekologię, anarchistyczny antyautorytaryzm, feministyczną krytykę, idee sytuacjonistów, krytykę technologii – ale wychodzi poza sprzeciw wobec pojedynczej, specyficznej formy władzy i odrzuca je wszystkie, ustanawiając radykalną alternatywę.
\section{Gdzie według anarchoprymitywistów tkwią początki władzy?}
Jest to kolejna dyskusyjna kwestia wśród anarchoprymitywsitów. Perlman twierdzi, że przełomowym momentem jest utworzenie bezosobowych instytucji i abstrakcyjnych stosunków władzy. Wówczas to cywilizacyjne stosunki społeczne zaczęły wypierać pierwotną anarchię. Dla Zerzana zaś, środkami umożliwiającymi przejście od ludzkiej wolności do stanu domestykacji, były kultura symboliczna – w formie liczb, języka, czasu, sztuki, a następnie rolnictwo. Zagadnienie pochodzenia władzy jest bardzo istotne dla anarchoprymitywistów, gdyż dążą oni do zdefiniowania, przeciwstawienia się i zniesienia wszelkich form władzy, kształtujących indywidualne, społeczne relacje i interrelacje ze światem natury. Dokładne rozpoznanie pochodzenia władzy pozwala określić, co bezpiecznie można ratować z ruin cywilizacji, a co należy bezsprzecznie wyrugować by stosunki władzy nie uległy wznowieniu po upadku cywilizacji.
\section{Jaką przyszłość przewidują anarchoprymitywiści?}
Anarchoprymitywistyczne pismo‚ Anarchy; A Journal of Desire Armed’ przewiduje przyszłość „radykalnie kooperatywną i wspólnotową, ekologiczną i feministyczną, spontaniczną i dziką” i taki właśnie opis najbliżej odpowiada anarchoprymitywistycznej wizji. Tu nie ma konkretnego planu ani normatywnych wzorców, chociaż ważne jest by podkreślić, że prorokowana przyszłość nie jest „prymitywna” w żadnym stereotypowym sensie tego słowa. Jak stwierdzało ‚Fifth Estate’: „Pozwólcie nam antycypować krytyków, którzy chcieliby nas oskarżyć o chęć ‚powrotu do jaskiń’ lub o zwykłe pozerstwo z naszej strony – to znaczy korzystanie z wygód cywilizacji, przy jednoczesnym, najostrzejszym jej krytykowaniu. Nie proponujemy epoki kamienia jako modelu dla naszej utopii (\dots{}) ani nie sugerujemy powrotu do zbieractwa i myślistwa jako środków naszego utrzymania. W ramach poprawki do tego powszechnego nieporozumienia, ważne jest by podkreślić, że anarchoprymitywistyczna wizja przyszłości nie ma precedensu. Chociaż prymitywna kultura zawiera wskazówki dla przyszłości i ta przyszłość może również przejąć elementy wywodzące się z tych kultur, to anarchoprymitywistyczny świat prawdopodobnie różniłby się zupełnie od poprzednich form anarchii.
\section{Jak anarchoprymitywizm postrzega technologię?}
John Zerzan definiuje technologię, jako „całokształt podziału pracy\Slash{}produkcji i jego wpływ na nas i na naturę.” W jego opinii „technologia w całości przejęła funkcję pośrednika między nami i światem natury, separując nas jednocześnie od innych. To cała ta toksyczność wymagana do produkcji i reprodukcji. To etap hiperalienacji, którą pokutujemy, forma dominacji na każdym poziomie hierarchii.” Tymczasem Fredy Perlman, twierdził, że technologia „jest niczym więcej, jak arsenałem Lewiatana”, „jego pazurami i kłami”. Jak więc widać, pomimo bezdyskusyjnej opozycji wobec technologii, wśród anarchoprymitywistów toczy się dyskusja nad jej rolą w w cywilizacyjnej strukturze dominacji.
Należy też rozróżnić narzędzia i technologię. Perlman wskazuje, że prymitywni ludzie rozwinęli wiele form narzędzi, ale nie technologie: „Obiekty materialne, laski i łódki, motyki i ogrodzenia, były rzeczami, które mogła wykonać jedna osoba, lub jak w przypadku ogrodzenia, wymagana była współpraca kilku osób przy jednej, szczególnej okazji\dots{} Większość narzędzi jest prehistoryczna i [materialne] nadwyżki, [umożliwiające ich wykonanie] były dojrzałe już u zarania ludzkości, ale nie zrodziły bezosobowych instytucji”. Narzędzia są więc wytwarzane na małą, lokalną skalę, przez jednostki lub niewielkie grupy. Ich produkcja nie dawała podstaw dla systemu kontroli i przymusu.
Natomiast technologia jest produktem na dużą skalę, wytwarzanym przez kompleks powiązanych ze sobą systemów wydobycia, produkcji, dystrybucji i konsumpcji, które wymagają struktur kontroli i posłuszeństwa na masową skalę – owych Perlmanowskich bezosobowych instytucji. Jak głoszono na łamach ‚Fifth Estate’ w 1981 r.: „Technologia nie jest zwykłym narzędziem, które możemy użyć tak, jak nam się podoba. Jest to forma społecznej organizacji, system relacji społecznych. Ma swoje własne prawa. Jeśli zbytnio angażujemy się w jej użycie, musimy zaakceptować jej władzę. Ogromne rozmiary, stratyfikacja zadań i złożone powiązania, tworzące nowoczesne systemy technologiczne, czynią autorytarne dowodzenie nad nimi niezbędne i niezależne, uniemożliwiając jednocześnie indywidualną decyzję.”
Anarchoprymitywizm jest nurtem antysystemowym: przeciwstawia się wszystkim instytucjom, abstrakcjom, sztuczności, syntetyczności i maszynie, gdyż uosabiają one stosunki władzy. Anarchoprymitywiści są zatem przeciwnikami technologii lecz nie używania narzędzi. Kwestią dyskusyjną jest to, czy w anarchoprymitywistycznym świecie zachowane jednak zostaną jakieś formy technologii. W 1979 r. na łamach ‚Fifth Estate’ pisano: „Na najbardziej podstawowym poziomie, dyskusja na temat przyszłości powinna sensownie opierać się na tym czego życzymy sobie jako społeczeństwo i w związku z tym, jakie formy technologii są uzasadnione. Każdy z nas chce centralnego ogrzewania, spłukiwanych ubikacji i oświetlenia elektrycznego, ale nie kosztem naszego człowieczeństwa. Być może mogą one współistnieć, być może nie.
\section{A co z medycyną?}
W końcu anarchoprymitywizm jest przede wszystkim za uzdrowieniem. Za zagojeniem ran, które otworzyły się w jednostkach, pomiędzy ludźmi i pomiędzy ludźmi a naturą, za sprawą cywilizacji, władzy, państwa, kapitału i technologii. Jednostki, społeczności i Ziemia zostały okaleczone przez stosunki władzy charakterystyczne dla cywilizacji. Ludzie zostali zwichnięci psychicznie, ale i zaatakowani fizycznie przez różne choroby i dolegliwości. Anarchoprymitywizm nie ma recepty na ból i choroby! Jednakże badania wykazują, że wiele współczesnych schorzeń to efekt życia w warunkach cywilizacji i jeśli te uwarunkowania zostaną zniesione to tym samym mogłyby zniknąć niektóre choroby. Co do reszty, świat, który walkę z cierpieniem umiejscawia w swoim centrum, energicznie dążyłby do złagodzenia go poprzez znalezienie metod leczenia chorób. W tym sensie anarchoprymitywizm jest szczególnie zainteresowany medycyną. Jednak wyalienowane, generowane przez wysokotechnolgiczne koncerny farmaceutyczne formy medycyny praktykowane na Zachodzie nie są jedyną możliwą drogą leczenia. Medycyna w anarchoprymitywistycznej przyszłości dostosowana będzie do możliwości i wymagań ludzi, bez naruszania sposobów życia wolnych jednostek w ekocentrycznych wolnych społecznościach. Podobnie, jak w przypadku innych pytań i w tym przypadku nie ma dogmatycznej odpowiedzi.
\section{Kwestia populacyjna?}
Jest to zagadnienie kontrowersyjne, co do którego nie ma konsensusu wśród anarchoprymitywistów. Niektórzy z nich twierdzą, że redukcja populacji nie byłaby potrzebna; inni argumentują, że owszem, byłaby ze względów ekologicznych i z uwagi na stabilność planowanych przez anarchoprymitywistów form bytowania. George Bradford w pracy „How deep is deep ecology?”, dowodzi, że kobieca kontrola nad reprodukcją doprowadzi do spadku liczby ludności. Osobisty pogląd, piszącego te słowa jest taki, że populacja musi być zredukowana, ale może to nastąpić przez naturalne „ubytki” – tzn., że nie każdy umierający człowiek, musi być zastępowany nowym istnieniem. W skutek tego, ogólna liczba ludności mogłaby się obniżyć i ostatecznie ustabilizować. Anarchiści od dawna głoszą, że w wolnym świecie społeczny, ekonomiczny i psychologiczny nacisk na nadmierną reprodukcję byłby zniesiony. Po prostu istniałoby za dużo innych, interesujących rzeczy, angażujących ludzki czas. Feministki argumentują, że kobiety wolne od ograniczeń związanych z płcią i struktur rodzinnych, nie byłyby definiowane przez pryzmat zdolności rozrodczych, jak w patriarchalnych społeczeństwach, a to również doprowadziłoby do zmniejszenia liczby populacji. Przede wszystkim, jak to jasno wyraził Perlman, wzrost demograficzny jest czystym produktem cywilizacji : „Stały wzrost ludzkiej populacji jest tak trwały, jak sam Lewiatan. Ten fenomen zdaje się istnieć tylko wśród zlewiatanizowanych istot ludzkich. Zwierzęta, podobnie jak ludzie, żyjący w naturalnym stanie nie rozmnażają swojego rodzaju do tego stopnia by wypychać innych poza plac gry.” Zatem nie ma powodów by przypuszczać, że ludzka populacja nie ustabilizuje się po zniesieniu cywilizacji i przywróceniu wspólnotowej harmonii.
Należy też ignorować nieprawdopodobne fantasmagorie szerzone przez wrogów anarchoprymitywizmu, którzy sugerują, że według jego zwolenników populacja powinna być zredukowana poprzez masową eksterminację i obozy zagłady na nazistowską modłę. Anarchoprymitywistyczna zapowiedź zniesienia wszelkich struktur władzy, włączając w to państwo z całym administracyjnym i wojskowym aparatem oraz partie i organizacje oznacza, że tak zorganizowana rzeź byłaby niemożliwością, jak również zwyczajnie przerażającą okropnością.
W jaki sposób może wyłonić się anarchoprymitywistyczna przyszłość?
Nie ma w tym przypadku ścisłych wytycznych i planu. Najprościej można by rzec, że formy walki ujawnią się w trakcie rebelii. To prawda, ale niekoniecznie przydatna. Faktem jest, że anarchoprymitywizm nie jest ideologią, poszukującą władzy. Nie stara się przejąć państwa czy fabryk, nie dąży do zdobywania konwertytów, nie chce tworzyć politycznych organizacji i rozkazywać ludziom. Zamiast tego pragnie, by ludzie stali się wolnymi jednostkami, żyjącymi w wolnych wspólnotach, współdziałających ze sobą i z biosferą, którą zamieszkują. Chce totalnej transformacji tożsamości, sposobów życia i komunikacji. To oznacza, że środki próbowane i testowane przez ideologie, dążące do władzy nie przystają do anarchoprymitywistycznego projektu. A zatem należy rozwinąć nowe formy działania i bytowania, właściwe i współmierne dla anarchoprymitywistycznego projektu. Ponieważ jest to proces, który wciąż trwa trudno jest udzielić jednoznacznej odpowiedzi na pytanie: „co jest do zrobienia?”
Obecnie wielu się zgodzi, że wspólnoty oporu są ważnym elementem w anarchoprymitywistycznym projekcie. Samo słowo „wspólnota” uległo wypaczeniu poprzez absurdalne wiązanie go z pojęciami takimi jak chociażby „interes” – a więc mamy np. „wspólnoty interesu”. Tymczasem większość autentycznych nici wspólnotowych została zniszczona przez kapitał i państwo. Niektórzy twierdzą, że skoro tradycyjne wspólnoty, często ogniska oporu wobec władzy, zostały zniszczone, należy stworzyć nowe wspólnoty oporu, jako bazy dla akcji.
Stara anarchistyczna idea głosi, że nowy świat musi być stworzony w skorupie starego. To oznacza, że kiedy cywilizacja upadnie, czy to w efekcie samobójstwa czy też dzięki naszym wysiłkom lub kompilacji obu – na jej miejsce gotowa będzie alternatywa. Jest to konieczne, ponieważ w przypadku braku pozytywnej alternatywy, zakłócenia społeczne, spowodowane upadkiem cywilizacji, mogłyby w łatwy sposób wytworzyć psychologiczną niepewność i społeczną próżnię, tworząc w ten sposób podatny grunt dla rozwoju faszyzmu i innych totalitarnych dyktatur. Oznacza to, że anarchoprymitywiści muszą rozwinąć wspólnoty oporu (tak wiele, jak to możliwe) – mikrokosmosy nadchodzącej przyszłości, zarówno w miastach, jak i poza nimi. Będą one bazami dla akcji bezpośredniej, ale również miejscami rozwoju nowych dróg myślenia, zachowań, komunikowania się itd., oraz nowych zasad etycznych – w skrócie całej wyzwoleńczej kultury. Muszą stać się miejscami, w których ludzie będą odkrywać swoje prawdziwe pragnienia i przyjemności, i swoim przykładem udowadniać innym, że alternatywne drogi życia są możliwe.
Jest jednak wiele innych możliwości, które należy zbadać. Skala wolności w anarchoprymitywistycznej wizji świata nie ma precedensu, więc tu nie może być żadnych ograniczeń w formach oporu i buntu. Transformacja, przewidywana w tak szerokim zakresie, będzie potrzebowała każdej innowacyjnej myśli i aktywności.
% begin final page
\clearpage
% new page for the colophon
\thispagestyle{empty}
\begin{center}
Anarcho-Biblioteka
\smallskip
Dobry pieróg to wywrotowy pieróg
\bigskip
\includegraphics[width=0.25\textwidth]{logo-pl.pdf}
\bigskip
\end{center}
\strut
\vfill
\begin{center}
John Moore
Elementarz Prymitywisty
\bigskip
https:\Slash{}\Slash{}zielonaanarchia.wordpress.com\Slash{}2016\Slash{}04\Slash{}17\Slash{}elementarz-prymitywisty\Slash{}\#respond
tłumaczenie ap.pl
\bigskip
\textbf{pl.anarchistlibraries.net}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
http://mathsece.free.fr/Cours/Memento_Proba_disc.tex | free.fr | CC-MAIN-2018-09 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2018-09/segments/1518891816841.86/warc/CC-MAIN-20180225170106-20180225190106-00398.warc.gz | 222,667,031 | 5,126 | % format de la page
% numerotation
\documentclass[12pt]{article}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\usepackage{amsfonts}
\usepackage{fancyhdr,amssymb}
%TCIDATA{OutputFilter=Latex.dll}
%TCIDATA{Version=5.50.0.2890}
%TCIDATA{<META NAME="SaveForMode" CONTENT="1">}
%TCIDATA{BibliographyScheme=Manual}
%TCIDATA{Created=Sun Apr 02 15:50:46 2006}
%TCIDATA{LastRevised=Sunday, January 28, 2007 18:17:58}
%TCIDATA{<META NAME="GraphicsSave" CONTENT="32">}
%TCIDATA{Language=French}
%TCIDATA{CSTFile=Pierre.cst}
\setlength\parindent{0pt}
\setlength\voffset{-2cm}
\setlength\headheight{0cm}
\setlength\headsep{0.1cm}
\setlength\textheight{26cm}
\setlength\hoffset{-2.5cm}
\setlength\textwidth{18cm}
\renewcommand{\theenumii}{\alph{enumii}}
\renewcommand{\labelenumii}{\theenumii)}
\lfoot{Memento probabilit\'es discr\`etes}
\cfoot{}
\rfoot{ Page \thepage / 4}
\renewcommand{\headrulewidth}{0pt}
\renewcommand{\footrulewidth}{0.4pt}
\pagestyle{fancy}
\input{tcilatex}
\begin{document}
\begin{center}
{\Huge M\'{e}mento de probabilit\'{e}s discr\`{e}tes}
par Pierre Veuillez
\end{center}
\section*{Pr\'{e}alables :}
Passer du temps pour avoir en t\^{e}te toutes les donn\'{e}es de l'\'{e}nonc%
\'{e} : signification des notations et conditions de l'exp\'{e}rience.
Prendre des notations adapt\'{e}es et standard : majuscules pour les \'{e}v%
\'{e}nements et les variables al\'{e}atoires, minuscules pour leurs
probabilit\'{e}s.
Quand il y a r\'{e}p\'{e}tition de l'exp\'{e}rience, noter en indice le num%
\'{e}ro de l'exp\'{e}rience.
\section*{Traduction}
\subsection*{Formalisation de la langue :}
Tous, aucun, jamais, toujours, le premier : $\bigcap $ la probabilit\'{e}
est le produit des probabilit\'{e}s (ind\'{e}pendants) conditionn\'{e}s par
les pr\'{e}c\'{e}dents (en g\'{e}n\'{e}ral)
$\displaystyle
\mathrm{P}\left( \bigcap_{k=1}^{+\infty }A_{k}\right) =\lim_{N\rightarrow
+\infty }\left( \mathrm{P}\left( \bigcap_{k=1}^{N}A_{k}\right) \right) $
au moins un, ou : $\bigcup $ la probabilit\'{e} est la somme ou la somme de
la s\'{e}rie (incompatible) le crible (petites r\'{e}unions) ou l'\'{e}v\'{e}%
nement contraire.
si $A$ alors $B$ : $A\subset B$ et $\mathrm{P}\left( A\right) \le \mathrm{P}%
\left( B\right) $
Si $A$ : on parle alors de probabilit\'{e}s conditionnelle sachant $A.$
\subsection*{Concr\'{e}tisation :}
les probabilit\'{e}s conditionnelles se calculent le plus souvent par
traduction du conditionnement.
On reconna\^{\i}t alors souvent une loi usuelle, ou bien une m\^{e}me
situation avec un d\'{e}calage.
Ce n'est que lorsque l'on ne peut pas que l'on passe par la formule de Bayes.
\section*{Les situations usuelles :}
\subsection*{Esp\'{e}rance}
$E\left( X\right) =\sum_{k\in X\left( \Omega \right) }k\mathrm{P}\left(
X=k\right) $ ou somme de s\'{e}rie si convergence absolue.
$E\left( f\left( X\right) \right) =\sum_{k}f\left( k\right) \mathrm{P}\left(
X=k\right) $ si convergence absolue (th\'{e}or\`{e}me de transfert)
$E\left( \sum_{i}X_{i}\right) =\sum_{i}E\left( X_{i}\right) $ si chacune
existe (cf Bernouilli)
$E\left( f\left( X,Y\right) \right) =\sum_{i}\sum_{j}f\left( i,j\right)
\mathrm{P}\left( X=i\cap Y=j\right) $ si convergence absolue
$E\left( X\cdot Y\right) =E\left( X\right) E\left( Y\right) $ si ind\'{e}%
pendants.
$V\left( aX+b\right) =a^{2}V\left( X\right) $ et $V\left( X+Y\right)
=V\left( X\right) +V\left( Y\right) $ si ind\'{e}pendants.
\subsection*{Quand l'exp\'{e}rience se d\'{e}roule en deux temps,}
et que les conditions du second temps d\'{e}pendent du r\'{e}sultat du
premier.
En particulier quand le second temps d\'{e}pend de la valeur d'une variable
al\'{e}atoire d\'{e}finie dans le premier temps !
En particulier quand on reconna\^{\i}t une loi usuelle, \`{a} condition de
conna\^{\i}tre le r\'{e}sultat du premier temps.
\subsubsection*{Probabilit\'{e}s totales}
On donne comme syst\`{e}me complet d'\'{e}v\'{e}nement tous les r\'{e}%
sultats possibles du premier temps, (typiquement, $\left( N=n\right) _{n\in
\mathbb{N}^{*}}$ ) et on applique la formule des probabilit\'{e}s totales (%
\textbf{index\'{e}e par le syst\`{e}me complet})
\subsubsection*{Loi marginale}
On d\'{e}termine la loi du couple puis on a la loi de l'une comme loi
marginale en sommant sur l'autre param\`{e}tre
\subsection*{Quand l'exp\'{e}rience suivante d\'{e}pend du r\'{e}sultat pr%
\'{e}c\'{e}dent : $C_{n+1}=M\cdot C_{n}$}
Le SCE est form\'{e} des r\'{e}sultats possibles \`{a} l'\'{e}tape $n$.
Leurs probabilit\'{e}s sont mises en matrice colonne $C_{n}$
On applique les probabilit\'{e}s totales pour la probabilit\'{e} de chacun
des valeurs suivantes.
Et on \'{e}crit la matrice colonne des r\'{e}sultat sous forme de produit
matricielle $C_{n+1}=M\cdot C_{n}$.
L'\textbf{esp\'{e}rance} -qui est une somme de produit- peut aussi s'\'{e}%
crire en produit ligne des valeurs *colonne.des probabilit\'{e}s.
\subsection*{Quand on r\'{e}p\`{e}te une m\^{e}me exp\'{e}rience \`{a} deux
issues (\'{e}chec ou succ\`{e}s)}
\subsubsection*{le rang $X$ du premier succ\`{e}s est donn\'{e}}
\begin{itemize}
\item par une loi g\'{e}om\'{e}trique $\mathcal{G}\left( p\right) $ si on
fait une \textbf{suite} (infinie) d'exp\'{e}riences \textbf{ind\'{e}%
pendantes }qui ont toutes la m\^{e}me probabilit\'{e} $p$ de succ\`{e}s
\item par une loi g\'{e}om\'{e}trique $\mathcal{G}\left( p\right) $ si le
rang du premier succ\`{e}s est \textbf{sans m\'{e}moire} (tant que l'on a
\'{e}chec, la probabilit\'{e} de succ\`{e}s reste la m\^{e}me : $p$)
\item dans les autres cas, par $\left( X=k\right)
=\bigcap_{i=1}^{k-1}E_{i}\cap S_{k}$ et suivant que les exp\'{e}riences sont
ind\'{e}pendantes ou non, la probabilit\'{e} sera le produit des probabilit%
\'{e}s ou la formule des probabilit\'{e}s compos\'{e}e.
\end{itemize}
\subsubsection*{le nombre $X$ de succ\`{e}s est donn\'{e}}
\begin{itemize}
\item par une loi binomiale $\mathcal{B}\left( n,p\right) $ si$X$ est le
\textbf{nombre de succ\`{e}s} en un nombre entier $n$ (\textbf{fix\'{e}},
pas une variable al\'{e}atoire) d'exp\'{e}riences \textbf{ind\'{e}pendantes }%
et ayant toutes la \textbf{m\^{e}me probabilit\'{e} de succ\`{e}s }$p.$
\item par une loi hyperg\'{e}om\'{e}trique $\mathcal{H}\left( N,n,p\right) $%
si $X$ est le \textbf{nombre de r\'{e}sultats favorables }succ\`{e}s en $n$
tirages \textbf{simultan\'{e}s} ou \textbf{successifs sans remise }parmi $N$
objets \'{e}quiprobables dont la proportions de favorables est $p.$
\item par des variables de \textbf{Bernouilli}
si $X_{i}$ compte le nombre de succ\`{e}s lors de la $i^{\grave{e}me}$ exp%
\'{e}rience (0 ou 1 succ\`{e}s) alors $\sum_{i=1}^{n}X_{i}$ donnera le
nombre total de succ\`{e}s en $n$ exp\'{e}riences.
Elles permettent d'avoir facilement l'esp\'{e}rance (mais pas la loi)
\item Erreur : le nombre d'exp\'{e}rience avant le premier succ\`{e}s se
rapporte au premier succ\`{e}s et non pas au nombre d'\'{e}chec.
\item Erreur : Si le nombre d'exp\'{e}rience est donn\'{e} par une variable
al\'{e}atoire $N$, on ne retrouve la loi usuelle que sur les probabilit\'{e}%
s sachant $N=n$.\newpage
\end{itemize}
\section*{Lois usuelles :}
\subsubsection*{G\'{e}om\'{e}trique}
$X\hookrightarrow \mathcal{G}\left( p\right) $ si $X\left( \Omega \right) =%
\left[ \left[ 1,+\infty \right[ \right[ $ et pour tout $k\in \left[ \left[
1,+\infty \right[ \right[ :\mathrm{P}\left( X=k\right) =\left( 1-p\right)
^{k-1}p$
$E\left( X\right) =\frac{1}{p}$ et $V\left( X\right) =\frac{1-p}{p^{2}}$
\`{a} noter : $\mathrm{P}\left( X>k\right) =\left( 1-p\right) ^{k}$ (que des
\'{e}checs jusqu'\`{a} $k$ )
\subsubsection*{Bernouilli}
$X\hookrightarrow \mathcal{B}\left( 1,p\right) $ si $X\left( \Omega \right)
=\left\{ 0;1\right\} $ et $\mathrm{P}\left( X=1\right) =p$
$E\left( X\right) =p$ et $V\left( X\right) =p(1-p)$
\`{a} noter : une somme de variable de Bernouilli est le nombre total de succ%
\`{e}s.
\subsubsection*{Binomiale}
$X\hookrightarrow \mathcal{B}\left( n,p\right) $ si si $X\left( \Omega
\right) =\left[ \left[ 0,n\right] \right] $ et pour tout $k\in \left[ \left[
0,n\right] \right] :\mathrm{P}\left( X=k\right) =\binom{n}{k}p^{k}\left(
1-p\right) ^{n-k}$
$E\left( X\right) =n\,p$ et $V\left( X\right) =np\left( 1-p\right) $
\`{a} noter : Si $X\hookrightarrow \mathcal{B}\left( n,p\right) $ et $%
Y\hookrightarrow \mathcal{B}\left( m,p\right) $ \textbf{ind\'{e}pendantes }%
de \textbf{m\^{e}me param\`{e}tre} de succ\`{e}s $p$ alors $%
X+Y\hookrightarrow \mathcal{B}\left( n+m,p\right) $.
\subsubsection*{Poisson}
$X\hookrightarrow \mathcal{P}\left( \alpha \right) $ si si $X\left( \Omega
\right) =\mathbb{N}$ et pour tout $k\in \mathbb{N}:\mathrm{P}\left(
X=k\right) =\frac{e^{-\alpha }\alpha ^{k}}{k!}$
$E\left( X\right) =\alpha $ et $V\left( X\right) =\alpha $
\`{a} noter : Si $X\hookrightarrow \mathcal{P}\left( \alpha \right) $ et $%
Y\hookrightarrow \mathcal{P}\left( \beta \right) $ \textbf{ind\'{e}pendantes
} alors $X+Y\hookrightarrow \mathcal{P}\left( \alpha +\beta \right) $.
\subsubsection*{Hyperg\'{e}om\'{e}trique}
$X\hookrightarrow \mathcal{H}\left( N,n,p\right) $ avec $a=Np$ (nombre de
favorables) et $b=n\left( 1-p\right) $ nombre de d\'{e}favorables
$\mathrm{P}\left( X=k\right) =\frac{\binom{a}{k}\binom{b}{n-k}}{\binom{N}{n}}
$ pour tout $k\in \left[ \left[ \max \left( 0,n-b\right) ;\min \left(
a,n\right) \right] \right] =X\left( \Omega \right) $ les bornes se
retrouvent par les conditions sur les coefficients du bin\^{o}me. ($0\le
k\le a$ et $0\le n-k\le b$)
$E\left( X\right) =n\,p$ comme pour la loi binomiale.
\subsubsection*{Uniforme}
$X\hookrightarrow \mathcal{U}_{\left[ \left[ 1,n\right] \right] }$ si $%
X\left( \Omega \right) =\left[ \left[ 1,n\right] \right] $ et pour tout $%
k\in \left[ \left[ 1,n\right] \right] :\mathrm{P}\left( X=k\right) =\frac{1}{%
n}$
$E\left( X\right) =\frac{n+1}{2}$ et $V\left( X\right) =\frac{n^{2}-1}{12}$
\`{a} noter : Si $X\hookrightarrow \mathcal{U}_{\left[ \left[ a,b\right] %
\right] }$ ((valeurs de $\left[ \left[ a,b\right] \right] $ \'{e}%
quiprobables) alors $Y=X-a+1\hookrightarrow \mathcal{U}_{\left[ 1,b-a+1%
\right] }$ ce qui permet de calculer son esp\'{e}rance $\frac{a+b}{2}$ et sa
variance.
\subsection*{Approximations}
\begin{itemize}
\item Convergence en loi (les probabilit\'{e}s donn\'{e}es par une loi
tendent vers celles donn\'{e}es par une autre)
$\mathcal{H}\left( N,n,p\right) \rightarrow \mathcal{B}\left( n,p\right) $
quand $N\rightarrow +\infty $
$\mathcal{B}\left( n,\alpha /n\right) \rightarrow \mathcal{P}\left( \alpha
\right) $ quand $n\rightarrow +\infty $
\item Approximation : $\mathcal{H}\left( N,n,p\right) \simeq \mathcal{B}%
\left( n,p\right) \simeq \mathcal{P}\left( np\right) $ (tous de m\^{e}me esp%
\'{e}rance)
\item In\'{e}galit\'{e} Bienaym\'{e}-Tchebichev $\displaystyle\mathrm{P}%
\left( \left| X-m\right| >\varepsilon \right) \leq \frac{V\left( X\right) }{%
\varepsilon ^{2}}$ avec $m=E\left( X\right) $ et si $X$ a une esp\'{e}rance
et une variance.
\item Loi faible des grands nombres : les $X_{i}$ de m\^{e}me loi ayant une
esp\'{e}rance $m$ et une variance alors
$\mathrm{P}\left( \left| M_{n}-m\right| >\varepsilon \right) \rightarrow 0$
quand $n\rightarrow +\infty $
\end{itemize}
\section*{Programmation}
\subsection*{Compteur}
un compteur, est initialis\'{e} \`{a} 0 avant les boucles : \texttt{c:=0;}
et il est augment\'{e} de 1 chaque fois qu'il le faut : \texttt{c:=c+1;}
\subsection*{Accumulateur}
Un accumulateur est initialis\'{e} \`{a} 0 (sommes) ou 1 (produit ou
puissance) et il est augment\'{e} (somme) ou multipli\'{e} (produit)de la
quantit\'{e} \`{a} chaque fois \texttt{S:=S+?;} ou \texttt{P:=P*?; }
\subsection*{Tirage}
\texttt{randomize;} initialise le g\'{e}n\'{e}rateur de nombre al\'{e}atoire.
\texttt{random;} donne un nombre au hasard de [0,1[ suivant une loi uniforme.
\textsl{N.B. }\fbox{\textrm{(}\texttt{random\TEXTsymbol{<}x) }a une
probabilit\'{e} de $x$ pour tout $x\in \left[ 0,1\right] $}
\textsl{N.B. }\fbox{\texttt{(x\TEXTsymbol{<}random\TEXTsymbol{<}x+y) }a une
probabilit\'{e} de $y$ pour tout $x$ et $x+y\in \left[ 0,1\right] $}
\texttt{random(a);} donne un nombre al\'{e}atoire de l'intervalle [0,a[ si a
est un r\'{e}el ou de [[0,a-1]] si a est un entier, suivant une loi uniforme
\textsl{N.B. }\fbox{Pour simuler un lancer de d\'{e} : \texttt{%
D:=randomize(6)+1}}\texttt{\ }(dans [[0,5]]+1 donc dans [[1,6]] )
Pour avoir un \'{e}v\'{e}nement de probabilit\'{e} 0,28 : \texttt{if (random%
\TEXTsymbol{<}0,28) then...}
\subsection*{Rang du premier succ\`{e}s, nombre de succ\`{e}s, total des r%
\'{e}sultats.}
Pour obtenir le rang du premier succ\`{e}s, on a besoin d'un \textbf{compteur%
} pour le nombre d'exp\'{e}rience, et de \textbf{r\'{e}p\'{e}ter }l'exp\'{e}%
rience \textbf{jusqu'\`{a} }obtenir le succ\`{e}s.
Pour obtenir en plus la somme des r\'{e}sultats du d\'{e}, on utilise un
\textbf{accumulateur} de somme.
Pour conna\^{\i}tre le nombre de 2 obtenus entre temps, il faut un second
compteur.
\texttt{var c,c2,S,D:integer;}
\texttt{begin}
\texttt{randomize}
\texttt{c:=0;S:=0;c2:=0;}
\texttt{repeat}
\hspace{1cm}D\texttt{:=random(6)+1;}
\hspace{1cm}\texttt{c:=c+1;S:=S+D;}
\hspace{1cm}\texttt{if (D=2) then c2:=c2+1;}
\texttt{until D=6;}
\texttt{writeln(c,' ',S,' ',c2)}
\texttt{end.}
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=20414&type=tex | zentralblatt-math.org | CC-MAIN-2019-39 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-39/segments/1568514575168.82/warc/CC-MAIN-20190922053242-20190922075242-00342.warc.gz | 1,087,033,479 | 1,224 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2015d.00941}
\itemau{Sugden, Stephen J.}
\itemti{The Slumbarumba Jumbuck problem.}
\itemso{Spreadsheets Educ. 5, No. 1, 11 p., electronic only (2011).}
\itemab
Summary: The potential for simple linear relationships arising from a computer game to build student modelling and ``word problem" skills is explored. The fundamental capability of the spreadsheet to tabulate and graph possible solutions is used to lay bare the problem structure for the students.
\itemrv{~}
\itemcc{M90 H60 U70}
\itemut{mathematical model building; computer games; linear algebra; spreadsheets; inequalities; simultaneous linear equations; degrees of freedom; spreadsheet modelling; word problems; computer as educational medium; averages; conditional formatting}
\itemli{http://epublications.bond.edu.au/ejsie/vol5/iss1/2/}
\end |
https://cs.uwaterloo.ca/journals/JIS/VOL23/Khovanova/khova26.tex | uwaterloo.ca | CC-MAIN-2022-40 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2022-40/segments/1664030337529.69/warc/CC-MAIN-20221004215917-20221005005917-00522.warc.gz | 228,740,461 | 11,584 | \documentclass[12pt,reqno]{article}
\usepackage[usenames]{color}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{amscd}
\usepackage{graphicx}
\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}
\usepackage{latexsym}
\usepackage{epsf}
\usepackage{breakurl}
\setlength{\textwidth}{6.5in}
\setlength{\oddsidemargin}{.1in}
\setlength{\evensidemargin}{.1in}
\setlength{\topmargin}{-.1in}
\setlength{\textheight}{8.4in}
\newcommand{\seqnum}[1]{\href{https://oeis.org/#1}{\underline{#1}}}
\usepackage{verbatim}
\usepackage{enumerate}
\usepackage{tikz}
\usepackage{forest}
\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
Variants of Base 3 Over 2
}
\vskip 1cm
\large
Matvey Borodin, Hannah Han, Kaylee Ji, Alexander Peng, David Sun, Isabel Tu, Jason Yang, William Yang, Kevin Zhang, and Kevin Zhao \\
PRIMES STEP \\
Department of Mathematics\\
MIT\\
77 Massachusetts Avenue \\
Cambridge, MA 02139 \\
USA \\
\href{mailto: [email protected]}{\tt [email protected]}\\
\ \\
Tanya Khovanova \\
Department of Mathematics\\
MIT\\
77 Massachusetts Avenue \\
Cambridge, MA 02139 \\
USA \\
\href{mailto: [email protected]}{\tt [email protected]}
\end{center}
\vskip .2 in
\begin{abstract}
We conjecture that the sequence of even non-negative integers represented in base $\frac{3}{2}$ and then evaluated in base 3 is the same as the sequence of first terms of the infinite number of sequences that represent a greedy partition of non-negative integers into 3-free sequences. We also discuss some new sequences related to base $\frac{3}{2}$.
\end{abstract}
\section{Introduction}
Consider a real number $x$. The string $x_nx_{n-1}\cdots x_1x_0.x_{-1}\cdots$ is the representation of $x$ in base $\beta$ if $x = \sum_{i=-\infty}^nx_i\beta^i$.
A traditional non-integer base $\beta > 1$ was explored by R\'{e}nyi
\cite{R} and Parry \cite{P}; it represents numbers using non-negative
integer digits not exceeding $\beta$. Every nonnegative real number has
a representation in such a base. For example, such a representation can
be found by using a greedy algorithm that maximizes the digits $x_i$ from
left to right. In base $\beta$,
integers are typically represented as infinite strings.
Another approach for a rational base $\frac{b}{a}$ was suggested by Propp \cite{JP} and described as the division algorithm in \cite{AFS}. It was also called \textit{exploding dots} and popularized by Tanton \cite{JT}. For a rational base $\frac{b}{a}$ it allows using $\{0,1,\ldots,b-1\}$. The advantage of this approach is that integers can be represented by finite strings. These bases were thoroughly studied by Akiyama et al.~\cite{AFS} and by Frougny and Klouda \cite{FK}.
In this paper, we are interested in base $\frac{3}{2}$, which represents integers using digits 0, 1, and 2. We also consider sequence \seqnum{A256785} in the
{\it On-Line Encyclopedia of Integer Sequences} (OEIS) \cite{OEIS}, which uses digits 0 and 1, and symbol H to represent integers.
Surprisingly, we were able to connect these bases with another sequence, \seqnum{A265316} that is defined as follows. Consider a greedy way to divide non-negative integers into an infinite set of sequences not containing a 3-term arithmetic progression. Then \seqnum{A265316} is formed by taking the first number in each of these sequences. Now consider the following sequence: Take even numbers written in base $\frac{3}{2}$ using exploding dots with digits 0, 1, and 2, and interpret the result in ternary. This yields \seqnum{A265316}.
Here is how this paper is arranged. In Section~\ref{sec:explodingdots} we introduce exploding dots. In Section~\ref{sec:base32}, we describe a particular case of exploding dots called the $2 \leftarrow 3$ machine, which corresponds to base $\frac{3}{2}$. This base uses digits 0, 1, and 2 in their representations. In Section~\ref{sec:base15} we introduce some new sequences related to base $\frac{3}{2}$. And also, the sequence of our main interest which is a sequence of even non-negative integers written in base $\frac{3}{2}$ and then evaluated in base 3, which conjecturally is the same as sequence \seqnum{A265316}.
In Section~\ref{sec:mysteryseq} we define sequence \seqnum{A265316} using greedy partitioning of integers into 3-free sequences and discuss its connections to base $\frac{3}{2}$. We do not completely prove the fact that these sequences are the same, but we exhibit several common properties for both sequences.
\section{Exploding dots}\label{sec:explodingdots}
Here we explain exploding dots. We start with a row of boxes that can be extended to the left. We label the boxes from right to left. The rightmost box is labeled zero. The second one to the right is box 1, the third to the right is box 2, and so on.
We also have an integer $b$ that is our base. Consider integer $N$. To find its value in base $b$, we place $N$ dots in box 0. Now we allow ``explosions''. As soon as there are $b$ dots in box $k$, they ``explode''. That means we remove $b$ dots from box $k$ and add one dot in the box to the left numbered $k+1$. We continue exploding until nothing can explode anymore, meaning each box has no more than $b$ dots. This process is also called a $1 \leftarrow b$ machine. At the end, we write the number of dots in each box from left to right, dropping the leading zeros. The result is the representation of integer $N$ in base $b$.
For example, to calculate 5 in base 2, we start with 5 dots in the rightmost box, box 0. We can represent this state of our machine as 5. Since we have more than two dots, each pair of dots explodes, adding a dot to the box directly to the left. As there are two pairs, we add two dots to box 1 and remove 4 dots from box 0. We can represent the result as 21: one dot in the rightmost box and two dots in the box to the left. Now there are two dots together in box 1; therefore, we have another ``explosion'', which results in base-2 representation of 5 as $101$. This example is represented in Figure~\ref{fig:base2}.
\begin{figure}[ht]
\centering
\includegraphics[scale=0.7]{ExplodingDotsBase2.eps}
\caption{Exploding dots show how to represent 5 in base 2}\label{fig:base2}
\end{figure}
We denote the representation of $N$ in base $b$ as $(N)_b$ and the evaluation of string $w$ written in base $b$ as $[w]_b$. From our previous example we have that $(5)_2 = 101$ and $[101]_2 = 5$.
The exploding dots machines are easily generalized to rational bases. The $a \leftarrow b$ machine is a machine where each time there are at least $b$ dots in a box, there is an explosion. An explosion in box $k$ removes $b$ dots from box $k$ and adds $a$ dots to box $k+1$. To represent an integer $N$, we start with $N$ dots in box zero. After the process is complete, that is, all boxes have fewer than $b$ dots, we read the number of dots from left to right starting with the left most non-empty box. The result is $(N)_\frac{b}{a}$. See \cite{AFS,JP,JT} for more information on rational bases. We number the digits of this representation similar to the way we number boxes, from right to left, resulting in $d_k d_{k-1}\cdots d_1d_0$. As we mentioned we denote this string as $(N)_\frac{3}{2}$.
For example, to calculate 5 in base $\frac{3}{2}$, we start with 5 dots in the rightmost box, box 0. We can represent this state of our machine as 5. Since we have more than three dots we have an explosion: the number of dots in the rightmost box decreases by 3 and we add 2 dots to the box on the left. As the result we get $(5)_\frac{3}{2}= 22$. This example is represented in Figure~\ref{fig:base3over2}.
\begin{figure}[ht]
\centering
\includegraphics[scale=0.6]{ExplodingDotsBase3Over2.eps}
\caption{Exploding dots show how to represent 5 in base $\frac{3}{2}$.}\label{fig:base3over2}
\end{figure}
More formally, we express a non-negative integer $N$ in base $\frac{3}{2}$ recursively. The last digit $d_0$ is the remainder of $N$ modulo 3. The rest of the digits, $d_k d_{k-1}\cdots d_1$, is $\left(\frac{2(N-d_0)}{3}\right)_\frac{3}{2}$.
\section{Base $\frac{3}{2}$}\label{sec:base32}
The $2 \leftarrow 3$ machine is a machine where three dots explode and generate two new dots in the box on the left. More formally, we define how a positive integer $N$ is written in base $\frac{3}{2}$ recursively. Integers 1 and 2 are written as themselves. Represent $N$ as $N = 3N_1 + r$, where $r \in \{0,1,2\}$. Then $N$ is represented as a concatenation of the representation of $2N_1$ and $r$.
For example, number 7 in base $\frac{3}{2}$ becomes 211.
The first several integers written in base $\frac{3}{2}$ form sequence \seqnum{A024629} in the OEIS \cite{OEIS}: \[0, 1, 2, 20, 21, 22, 210, 211, 212, 2100, \ldots.\]
Here are a few observations for how integers are represented in base $\frac{3}{2}$ \cite{JP,JT}:
\begin{itemize}
\item Every integer representation only uses the digits 0, 1, and 2.
\item Every integer greater than 1 has its representation starting with 2.
\item Every integer greater than 7 has its representation starting with 21, followed by either 0 or 2.
\item The last digit of integer representations repeats in a cycle of 3, the last two digits repeat in a cycle of 9, and so on: the last $k$ digits repeat in a cycle of $3^k$.
\item Removing one or several last digits of an integer in this base gives another integer in the base.
\end{itemize}
It is interesting to note that base $\frac{6}{4}$ is different from base $\frac{3}{2}$. For example, numbers in base $\frac{6}{4}$ can have 5 as a digit, while numbers in base $\frac{3}{2}$ can not. For this reason, it is important not to reduce the fraction to simplest terms in this definition of the base. In particular, it is important to call this base `base $\frac{3}{2}$', not base 1.5.
The digits in base $\frac{3}{2}$ represent how the integer $N$ can be decomposed into powers of $\frac{3}{2}$ as the following lemma shows \cite{JP}.
\begin{lemma}
If $(N)_\frac{3}{2} = d_kd_{k-1}\cdots d_1d_0$, then
\[N = \sum_{i=0}^k d_i\frac{3^i}{2^i}.\]
\end{lemma}
\section{Sequences related to base $\frac{3}{2}$}\label{sec:base15}
Another definition of base $\frac{3}{2}$ is given in sequence \seqnum{A256785} in the OEIS \cite{OEIS} and in \cite{AFS,FK}. This base uses three symbols: 0, 1, and H. The symbol H represents 0.5. The letter H was likely chosen because of the word ``\textbf{h}alf''. This base was also studied by Akiyama et al.~\cite{AFS}, and Frougny and Klouda \cite{FK}.
Here are a few rational numbers using these three symbols in \textit{ascending} order of the number values:
\[\text{0, H, H0, 1, H00, HH, 10, H0H, H000, H1, HH0, 1H, H01, H00H, 100, }
\ldots.\]
We denote the terms of this sequence as $A_n$ for $n \ge 0$. The corresponding values are
\[0, 0.5, 0.75, 1, 1.125, 1.25, 1.5, 1.625, 1.6875, 1.75, 1.875, 2, 2.125, 2.1875, 2.25,
\ldots.\]
Correspondingly, we denote the terms of this sequence of values as $(A_n)$.
It is natural to ask how to write this sequence: that is, why is it possible to find the next number in value in an infinite set of numbers? The smallest number with $j$ symbols is H00$\cdots$0: it has $j-1$ zeros and the value of $0.5\cdot 1.5^{j-1}$. Since this value increases as $j$ increases, to find all numbers that are less than $0.5\cdot 1.5^{j-1}$, we only need to have a finite check of all the numbers with less than $j$ symbols.
Clearly, not all of these numbers are integers. The indices of integers in this sequence are
\[0, 3, 11, 25, 46, 77, 117, 169, 232, 308, 401, 508, 631, 771, 929, 1108, 1308, \ldots,\]
which is now sequence \seqnum{A320035}.
The first few natural numbers written in this base are
\[1 =1, \ 2 = 1\text{H}, \ 3 = 1\text{H}0, \ 4 = 1\text{H}1, \ 5 = 1\text{H}0\text{H}, \ 6 = 1\text{H}10, 7 = 1\text{H}11.\]
One interesting feature of this base is that an $i$-symbol number might be smaller than a $j$-symbol number where $i > j$.
There is another convenient order to write these numbers in, which we call the \textit{base} order. Consider numbers that use only zeros and two other digits $a < b$. Write the numbers in the increasing order. Replace $a$ by H, and $b$ by 1. In this order, the numbers with more symbols will go after the numbers with fewer symbols. We denote the terms of this sequence in the base order by $B_n$:
\[\text{0, H, 1, H0, HH, H1, 10, 1H, 11, H00, H0H, H01, HH0, HHH, HH1, }\ldots.\]
The corresponding values are
\[0, 0.5, 1, 0.75, 1.25, 1.75, 1.5, 2, 2.5, 1.125, 1.625, 2.125, 1.875, 2.375, 2.875, \ldots.\]
We denote the terms of this sequence of values as $(B_n)$.
The indices of integers in the base ordered sequence are:
\[0, 2, 7, 21, 23, 64, 69, 71, 193, 207, \ldots.\]
This is the beginning of the sequence \seqnum{A265316}, which is not related to any base. We discuss this unexpected connection in Section~\ref{sec:mysteryseq}.
Meanwhile, we want to introduce some remarkable sequences that show the connection between the ascending order and the base order. The first sequence shows the permutation to transform the numbers in ascending order to the base order. In other words, our sequence $a(n)$ is such that $a(n) = k$, if $(A_k)=(B_n)$. This is always possible because the sequences $(A_n)$ and $(B_n)$ contain the same numbers, just in a different order. This sequence is now \seqnum{A320274}:
\[0, 1, 3, 2, 5, 9, 6, 11, 17, 4, 7, 12, 10, 15, 23, 19, 27, 37, 14, 21, 29, 25, 34, 46,
\ldots.\]
Similarly, we can define sequence $b(n)$ such that $b(n) = k$ if $(B_k)=(A_n)$. This is now sequence \seqnum{A320273}:
\[0, 1, 3, 2, 9, 4, 6, 10, 27, 5, 12, 7, 11, 28, 18, 13, 30, 8, 81, 15, 29, 19,
\ldots.\]
The two sequences above are permutations of non-negative integers. Therefore, they contain every number. By definition, they are inverses of each other.
Writing numbers in base $\frac{3}{2}$ using 0, H, and 1 is very similar to writing numbers using 0, 1, and 2. The following theorem \cite{FK} provides the isomorphism.
\begin{theorem}
Every number in base $\frac{3}{2}$ written using 0, H, and 1 equals the number with 2 times its value in base $\frac{3}{2}$ except with the digits 0, H, 1 replaced by 0, 1, 2 correspondingly.
\end{theorem}
For example, 2 in the first base is 1H. That means 4 in base $\frac{3}{2}$ is 21.
From now on we look not only at integers in base $\frac{3}{2}$, but also all finite strings containing three digits 0, 1, and 2. These numbers are called $\frac{3}{2}$-\textit{integers}.
Using the isomorphism above we know that sequence \seqnum{A320035} is the indices of even integers in the sequence of $\frac{3}{2}$-integers written in ascending order in base $\frac{3}{2}$. The sequence for all integers in base $\frac{3}{2}$ is now sequence \seqnum{A320272}:
\[0, 1, 3, 6, 11, 17, 25, 34, 46, 60, 77, 96, 117, \ldots.\]
Interestingly, if we use the base order, then the indices of integers in $\frac{3}{2}$-integers form sequence \seqnum{A261691}:
\[0, 1, 2, 6, 7, 8, 21, 22, 23, 63, 64, 65, 69, 70, 71, 192, 193, 194, 207, 208, \ldots.\]
The indices of even integers form every other term in \seqnum{A261691}:
\[0, 2, 7, 21, 23, 64, 69, 71, 193, 207, \ldots.\]
As we mentioned, this sequence is one of our main interests.
In other words, this is the sequence of non-negative even integers written in base $\frac{3}{2}$ and then interpreted in base 3.
\section{The mysteries of sequence \seqnum{A265316}}\label{sec:mysteryseq}
\subsection{The definition of \seqnum{A265316}}
Now we go back to sequence \seqnum{A265316}, which appeared above as indices of even integers when numbers containing digits 0, 1, and 2 are written in the base order and interpreted in base $\frac{3}{2}$. We call this sequence the \textit{Stanley cross-sequence}. The first few members are
\[0, 2, 7, 21, 23, 64, 69, 71, 193, 207, 209, 214, \ldots.\]
Before providing the formal definition of the sequence, we need to give a few other definitions. A \textit{3-free} sequence is an integer sequence with no three elements forming an arithmetic progression. Given the start of a sequence of non-negative integers, the \textit{Stanley sequence} is the lexicographically smallest 3-free sequence with the given start \cite{OS}. The simplest Stanley sequence is the one that starts with 0, 1. It is sequence \seqnum{A005836} in the OEIS \cite{OEIS}:
\[0, 1, 3, 4, 9, 10, 12, 13, 27, 28, 30, \ldots.\]
Now we are ready to give a description of sequence \seqnum{A265316} from the OEIS \cite{OEIS}.
\begin{enumerate}
\item Consider the simplest Stanley sequence: 0, 1, 3, 4, 9, 10 and so on. We denote this sequence $S_0$. This sequence can be described as the non-negative integers that do not contain the digit 2 in their ternary representation.
\item Then we use the leftover integers (i.e., those that are not in the above sequence) and build a new minimal 3-free sequence. The new sequence is 2, 5, 6, 11, 14 and so on. This sequence is now sequence \seqnum{A323398} in the OEIS. We denote this new sequence $S_1$.
\item Then we exclude this sequence too and continue building a new greedy 3-free sequence $S_2$: 7, 8, 16, 17, 19, 20, 34, and so on. This sequence is now sequence \seqnum{A323418} in the OEIS.
\item We continue this procedure to the new sequence $S_3$: 21, 22, 24, 25, 48, 49, 51, and so on, which is now sequence \seqnum{A323419} in the OEIS.
\item R\'{e}nyi \cite{R} proved that 3-free sequences have density zero. Therefore, we can build an infinite number of such sequences. The first number of each of these sequences forms sequence \seqnum{A265316}, which is the subject of this section. In other words, \seqnum{A265316}$(n)$ is the first term of $S_n$.
\end{enumerate}
\subsection{Greedy 3-free sequences in base $\frac{3}{2}$}
We now want to repeat the procedure of building 3-free sequences in base $\frac{3}{2}$, using all finite strings containing three digits 0, 1, and 2, that is, all $\frac{3}{2}$-integers.
It is widely known \cite{OS} that the lexicographically first 3-free sequence, that is, the simplest Stanley sequence, consists of the numbers that are represented in base 3 without twos.
Our situation is somewhat similar. $\frac{3}{2}$-integers interpreted in base $\frac{3}{2}$ have different values when interpreted in base 3. Also, there are two different natural orders on all strings written with 0, 1, and 2. One is the value order if they are interpreted in base 3 or 10 (which we called the base order), and the other one is when they are evaluated in base $\frac{3}{2}$. The second order is different from the first. For example, $10 > 2$ in the first order and $10 < 2$ in the second. The first order is the base order we described before. However, the numbers without twos will be ordered the same way in both orders.
We want to show that the lexicographically first 3-free sequence in $\frac{3}{2}$-integers is the same sequence independently of which order we choose, base 3 value or base $\frac{3}{2}$ value.
\begin{lemma}
The sequence of $\frac{3}{2}$-integers in base $\frac{3}{2}$ that does not contain twos in their base $\frac{3}{2}$ interpretations is a 3-free sequence. Moreover, this sequence is the lexicographically first 3-free sequence in both orders: whether we interpret $\frac{3}{2}$-integers in base 3 or base $\frac{3}{2}$.
\end{lemma}
\begin{proof} The first part of the proof is similar to the corresponding proof for the Stanley sequence starting with 0, 1.
Any $\frac{3}{2}$-integer $x$ that has a digit 2 in base $\frac{3}{2}$ can be written in the form $2b-a$, where $a$ and $b$ are $\frac{3}{2}$-integers without a two in their $\frac{3}{2}$ representation and $b>a$. For example, $x=[20211022021220]_\frac{3}{2} = 2\cdot [10111011011110]_\frac{3}{2} - [00011000001000]_\frac{3}{2}$.
We can choose $(b)_\frac{3}{2}$ by changing twos in $(x)_\frac{3}{2}$ to ones; we can choose $(a)_\frac{3}{2}$ by changing twos in $(x)_\frac{3}{2}$ to zeros. Notice that $a,b < x$ in both orders: whether we interpret $a$, $b$, and $x$ as numbers in base 3 or base $\frac{3}{2}$.
Next, no three different $\frac{3}{2}$-integers without a 2 in their base $\frac{3}{2}$ representation can be in an arithmetic progression. To see why, suppose they were in such a progression. Let the numbers be $a$, $b$, and $2b-a$. If $(a)_\frac{3}{2}$ and $(b)_\frac{3}{2}$ are without a 2, then $(2b)_\frac{3}{2}$ is all 2s and 0s, and $(2b)_\frac{3}{2}$ would need all its 2s digits lined up with all of $(a)_\frac{3}{2}$'s ones for $(2b-a)_\frac{3}{2}$ to not have a 2 remaining after subtraction. But then $a$ and $b$ are the same number, leading to a contradiction. This is the same argument as in base 10. As there are no carries in the argument, the argument works in any base 3 or greater.
We showed that the sequence of $\frac{3}{2}$-integers without twos in base $\frac{3}{2}$ is a 3-free sequence. Now we need to show that it is lexicographically first in both orderings.
The sequence starts with 0 and 1 in both cases.
We continue by induction. Assume by induction that the first $n$ numbers are the $\frac{3}{2}$-integers without a 2 in base $\frac{3}{2}$, the $n$-th number being $y$. We know that the smallest number $z$ such that $z > y$ and $(z)_\frac{3}{2}$ does not have a 2 does not form a 3-free sequence with the previously found numbers, and we must prove it is of the smallest value in both orderings. Suppose it is not of minimal value, and the next term is instead a number $x$ between $y$ and $z$. Then $(x)_\frac{3}{2}$ must contain a 2. As we saw before, $x$ can be represented as $2b-a$, where integers $b$ and $a$ are such that $(b)_\frac{3}{2}$ and $(a)_\frac{3}{2}$ do not have a 2. As $a, b<x$ in both orderings, then $a$ and $b$ must both be among the first $n$ terms of the sequence. Then $a$, $b$, $x$ form a 3-term arithmetic progression, leading to a contradiction. Therefore, the next $\frac{3}{2}$-integer without twos in its base $\frac{3}{2}$ representation is the next term of the sequence.
\end{proof}
We denote the sequence of $\frac{3}{2}$-integers that contain only zeros and ones in their base $\frac{3}{2}$ representation and arranged in the base order as $\mathcal{S}_0$. Now we want to consider a set of sequences $\mathcal{S}_k$, where $\mathcal{S}_k = \mathcal{S}_0 +2k$, that is the $i$-th term of sequence $\mathcal{S}_k$ is the $i$-th term of sequence $\mathcal{S}_0$ to which $2k$ is added. We show several properties of these sequences.
\begin{lemma}
\begin{enumerate}[(a)]
\item Each sequence $\mathcal{S}_k$ is 3-free.
\item Sequences $\mathcal{S}_k$ do not overlap.
\item Every $\frac{3}{2}$-integer belongs to one of the sequences.
\item $\mathcal{S}_k$ is the lexicographically first sequence with no 3-term arithmetic progression chosen from the set of numbers $\cup_{i \geq k} \mathcal{S}_i$ when we use the base order.
\end{enumerate}
\end{lemma}
\begin{proof}
\begin{enumerate}[(a)]
\item Each sequence $\mathcal{S}_k$ does not contain a 3-term arithmetic progression. This follows from the fact that each sequence is a constant plus $\mathcal{S}_0$ and $\mathcal{S}_0$ does not contain a 3-term arithmetic progression.
\item Sequences $\mathcal{S}_k$ do not overlap. Consider an element $a_i$ in $\mathcal{S}_0$. We start by showing that $a_i + n$, for any integer $n > 1$, does not belong to $\mathcal{S}_0$. Integer $n$ must contain a two in its base $\frac{3}{2}$ representation. In fact, it starts with 2. If adding $(a_i)_\frac{3}{2}$ and $(n)_\frac{3}{2}$ does not generate a carry, the result must contain a 2, as $n$ has at least one 2. If there is a carry, the result must contain a 2. Indeed, consider the left-most carry performed during addition. The carry is always an even number. For the carry to be the last, the carry must be a 2, and the digit it is being added to must be 0. Therefore, the result contains a 2.
That means that in $\mathcal{S}_0$ no two numbers differ by an integer more than 1. Suppose $\mathcal{S}_k$ and $\mathcal{S}_j$ overlap, where $i \neq j$. That means there are two numbers $a_{i_1}$ and $a_{i_2}$ in $\mathcal{S}_0$ such that $a_{i_1} + 2k = a_{i_2} +2j$. That means $a_{i_1}$ and $a_{i_2}$ differ by $|2j-2k|$, a contradiction.
\item Every $\frac{3}{2}$-integer belongs to one of the sequences. This can be proven by showing that every $\frac{3}{2}$-integer in its base $\frac{3}{2}$ representation turns into a string with only 1 and 0 by repeatedly subtracting 2. Indeed, if a number contains a 2 in its base $\frac{3}{2}$ representation, then we can always subtract a 2 from it and get a positive $\frac{3}{2}$-integer. We continue subtracting 2 while we have a 2 in base $\frac{3}{2}$ representation of the number. As this process is finite we have to end with a $\frac{3}{2}$-integer consisting only of ones and zeros in its base $\frac{3}{2}$ representation.
\item We know that $\mathcal{S}_0$ is lexicographically first. We proceed by induction. Suppose for $j \leq k$ that sequence $\mathcal{S}_j$ is lexicographically first by value in the set
$\cup_{i \geq j} \mathcal{S}_i$. Consider the lexicographically first sequence $F$ in the set $\cup_{i \geq k} \mathcal{S}_i$. Notice that every element in $F$ has to contain a 2 in its base $\frac{3}{2}$ representation. That means if we subtract a 2 from every element of $F$, we get $\frac{3}{2}$-integers in the set $\cup_{i \geq k-1} \mathcal{S}_i$. It has to be lexicographically first, so it has to equal $\mathcal{S}_k$. Thus, sequence $F$ has to equal $\mathcal{S}_{k+1} =\mathcal{S}_{k} + 2$.
\end{enumerate}
\end{proof}
Let us prove one more property about sequences $\mathcal{S}_i$ written in base $\frac{3}{2}$ that we shall need later. We say that a set of numbers with digits 0, 1, and 2 satisfies the \textit{two-out-of-three property} if the following holds:
\begin{itemize}
\item The last digit of every number in the set written in base $\frac{3}{2}$ uses two out of three possible digits.
\item Numbers in the set that end with the same string $x$ when written in base $\frac{3}{2}$ can only have exactly two possibilities for a digit before $x$, and both possibilities are realized.
\end{itemize}
\begin{lemma}
Sequences $\mathcal{S}_n$ when written in base $\frac{3}{2}$ satisfy the two-out-of three property for all $n \geq 0$.
\end{lemma}
\begin{proof}
Sequence $\mathcal{S}_0$ consists of strings with only zeros and ones when written in base $\frac{3}{2}$. Thus, it satisfies the two-out-of three property. Sequence $\mathcal{S}_n$ is constructed by adding the same number $2n$ to all elements of $\mathcal{S}_0$.
Now we start from the last digit of elements of $\mathcal{S}_n$ when written in base $\frac{3}{2}$ and use induction. The last digit has two possibilities: the last digit of $2n$ and the last digit of $2n+1$, both when written in base $\frac{3}{2}$. Assume, by the induction hypothesis, that all the strings in $(\mathcal{S}_n)_\frac{3}{2}$ that end with the same $m$ digits have only two possibilities for the preceding digit. Now we want to show that the same is true for $m+1$. Consider numbers in $(\mathcal{S}_n)_\frac{3}{2}$ that end with the same string of $m+1$ digits. When we subtract $2n$ from all these numbers we get a set of numbers with a fixed string of length $m+1$ at the end. Before subtracting, we could only have 0 or 1 as a digit. Now when we add $2n$ back to these numbers, we have exactly two possibilities for the digit before the given string of length $m+1$. Both possibilities are realized.
\end{proof}
\subsection{Sequences $\mathcal{S}_i$ in base 3}
Let us first recall a well-known fact about 3-term integer arithmetic progressions.
\begin{lemma}
The last digits of a 3-term arithmetic progression written in base 3 are either all the same or all different.
\end{lemma}
Before proceeding, we need the following statement about sequences $\mathcal{S}_i$.
\begin{lemma}
For any $k \geq 0$, sequence $\mathcal{S}_k$ written in base $\frac{3}{2}$ and then interpreted in base 3 is 3-free.
\end{lemma}
\begin{proof}
Suppose sequence $\mathcal{S}_k$ written in base $\frac{3}{2}$ and then interpreted in base 3 contains an arithmetic progression $a,b,c$. There are only two possibilities for the last digit in base $\frac{3}{2}$. That means $a,b,c$ have the same last digit in base 3. We subtract this digit and divide the resulting numbers by 3, creating the numbers $a',b',c'$ that are numbers $a,b,c$ without the last digit when written in base 3. They have to form an arithmetic progression. By the two-out-of-three property, as the last digit is fixed, there are only two possibilities for the digit before it, which is now the last digit in the new progression $a',b',c'$. It follows that the last digit in $(a')_3$, $(b')_3$, $(c')_3$ is the same for all three numbers. By continuing in the same fashion, we obtain that the numbers $a$, $b$, and $c$ are equal to each other, leading to a contradiction.
\end{proof}
The following statement, which we were not able to prove, is the last step that is needed for our conjecture: each sequence $\mathcal{S}_n$ is lexicographically first 3-free sequence on the available numbers in base 3 order.
Now we state our main conjecture.
\begin{conjecture}
For any $k \geq 0$, sequence $\mathcal{S}_k$ written in base $\frac{3}{2}$ but interpreted in base 3 is sequence $S_k$.
\end{conjecture}
\begin{corollary}
The Stanley cross-sequence can be defined as follows: Take even numbers, write them in base $\frac{3}{2}$, and interpret the resulting string as numbers written in ternary.
\end{corollary}
Let us now describe the sequences $\mathcal{S}_i$, for $i = 1,2,3$ more explicitly.
\subsection{Examples}
We can easily describe the first few sequences $\mathcal{S}_i$ in terms of their representation in base $\frac{3}{2}$:
\begin{itemize}
\item $\mathcal{S}_0$ consists of numbers written with 0 and 1: 0, 1, 10, 11, 100, and so on.
\item $\mathcal{S}_1$ consists of numbers that contain exactly one 2 that might be followed by zeros: 2, 12, 20, 102, 112, 120, 200, and so on.
\item $\mathcal{S}_2$ consists of numbers such that the last digit is 1 or 2 and the rest is a substring from $\mathcal{S}_1$: 21, 22, 121, 122, 201, 202, and so on.
\item $\mathcal{S}_3$ consists of numbers such that the last two digits are from the set $\{10,11,20,21\}$ and the rest is a substring from $\mathcal{S}_1$. Equivalently, we can say that $\mathcal{S}_3$ has 0 and 1 as the last digit and the rest as $\mathcal{S}_2$: 210, 211, 220, 221, 1210, 1211, and so on.
\end{itemize}
\section{Acknowledgments}
This research was done by the PRIMES STEP junior group under the mentorship of Dr.~Tanya Khovanova. PRIMES STEP is a program based at MIT for students in grades 6-9 to try research in mathematics.
We are grateful to PRIMES STEP program and its director, Dr.~Slava Gerovitch, for giving us the opportunity to do this research. We also thank our anonymous reviewer for great comments.
\begin{thebibliography}{99}
\bibitem{AFS} S.~Akiyama, C.~Frougny, and J.~Sakarovitch, Powers of rationals modulo 1 and rational base number systems, {\it Israel J.~Math.}, \textbf{168} (2008), 53--91.
\bibitem{PSS} B.~Chen, R.~Chen, J.~Guo, T.~Khovanova, S.~Lee, N.~Malur, N.~Polina, P.~Sahoo, A.~Sakarda, N.~Sheffield, and A.~Tipirneni, On base 3/2 and its sequences, 2018. Available at \url{https://arxiv.org/abs/1808.04304}.
\bibitem{FK} C.~Frougny and K.~Klouda, Rational base number systems for $p$-adic numbers, \textit{RAIRO Theor.~Inform.~Appl.}, \textbf{46}, (2019), 87--106.
\bibitem{JP} J.~Propp, How do you write one hundred in base 3/2? \url{https://mathenchant.wordpress.com/2017/09/17/how-do-you-write-one-hundred-in-base-32/}, accessed in April 2018.
\bibitem{JT} J.~Tanton, {\it Companion Guide to Exploding Dots}, James Tanton, 2013.
\bibitem{GPS} J.~Gerver, J.~Propp, and J.~Simpson, Greedily partitioning
the natural numbers into sets free of arithmetic progression, {\it
Proc.~Amer.~Math.~Soc.}, \textbf{102} (1988). 765--772.
\bibitem{K} A.~J.~Kempner, Anormal systems of numeration, \textit{Amer.~Math.~Monthly}, \textbf{43} (1936), 610--617.
\bibitem{OS} A.~M.~Odlyzko and R.~P.~Stanley. Some curious sequences
constructed with the greedy algorithm. Bell Laboratories internal
memorandum, 1978.
\bibitem{P} W.~Parry, On the $\beta$-expansions of real numbers, \textit{Acta Math.~Acad.~Sci.~Hung.}, \textbf{11} (1960), 401--416.
\bibitem{R} A.~R\'{e}nyi, Representations for real numbers and their ergodic properties, \textit{Acta Math.~Acad.~Sci.~Hung.}, \textbf{8} (1957), 477--493.
\bibitem{OEIS} N. J. A. Sloane et al., The On-Line Encyclopedia of Integer Sequences, published electronically at \url{https://oeis.org}, 2018.
\end{thebibliography}
\bigskip
\hrule
\bigskip
\noindent 2010 {\it Mathematics Subject Classification}: Primary 11B99; Secondary 11P99.
\noindent \emph{Keywords:} fractional base, 3-free sequence.
\bigskip
\hrule
\bigskip
\noindent (Concerned with sequences
\seqnum{A005836},
\seqnum{A024629},
\seqnum{A244040},
\seqnum{A256785},
\seqnum{A261691},
\seqnum{A265316},
\seqnum{A320035},
\seqnum{A320272},
\seqnum{A320273},
\seqnum{A320274},
\seqnum{A322298},
\seqnum{A323398},
\seqnum{A323418}, and
\seqnum{A323419}.)
\bigskip
\hrule
\bigskip
\vspace*{+.1in}
\noindent
Received March 27 2019;
revised version received April 3 2019; January 27 2020; February 16 2020;
February 18 2020.
Published in {\it Journal of Integer Sequences}, February 20 2020.
\bigskip
\hrule
\bigskip
\noindent
Return to
\htmladdnormallink{Journal of Integer Sequences home page}{https://cs.uwaterloo.ca/journals/JIS/}.
\vskip .1in
\end{document}
|
https://stanford.edu/~jgrimmer/Text14/tc12.tex | stanford.edu | CC-MAIN-2021-25 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-25/segments/1623488512243.88/warc/CC-MAIN-20210622063335-20210622093335-00010.warc.gz | 485,565,782 | 13,545 | \documentclass{beamer}
%\usepackage[table]{xcolor}
\mode<presentation> {
\usetheme{Boadilla}
% \usetheme{Pittsburgh}
%\usefonttheme[2]{sans}
\renewcommand{\familydefault}{cmss}
%\usepackage{lmodern}
%\usepackage[T1]{fontenc}
%\usepackage{palatino}
%\usepackage{cmbright}
\setbeamercovered{transparent}
\useinnertheme{rectangles}
}
%\usepackage{normalem}{ulem}
%\usepackage{colortbl, textcomp}
\setbeamercolor{normal text}{fg=black}
\setbeamercolor{structure}{fg= black}
\definecolor{trial}{cmyk}{1,0,0, 0}
\definecolor{trial2}{cmyk}{0.00,0,1, 0}
\definecolor{darkgreen}{rgb}{0,.4, 0.1}
\usepackage{array}
\newcommand{\argmin}{\arg\!\min}
\beamertemplatesolidbackgroundcolor{white} \setbeamercolor{alerted
text}{fg=red}
\setbeamertemplate{caption}[numbered]\newcounter{mylastframe}
%\usepackage{color}
\usepackage{tikz}
\usetikzlibrary{arrows}
\usepackage{colortbl}
%\usepackage[usenames, dvipsnames]{color}
%\setbeamertemplate{caption}[numbered]\newcounter{mylastframe}c
%\newcolumntype{Y}{\columncolor[cmyk]{0, 0, 1, 0}\raggedright}
%\newcolumntype{C}{\columncolor[cmyk]{1, 0, 0, 0}\raggedright}
%\newcolumntype{G}{\columncolor[rgb]{0, 1, 0}\raggedright}
%\newcolumntype{R}{\columncolor[rgb]{1, 0, 0}\raggedright}
%\begin{beamerboxesrounded}[upper=uppercol,lower=lowercol,shadow=true]{Block}
%$A = B$.
%\end{beamerboxesrounded}}
\renewcommand{\familydefault}{cmss}
%\usepackage[all]{xy}
\usepackage{tikz}
\usepackage{lipsum}
\newenvironment{changemargin}[3]{%
\begin{list}{}{%
\setlength{\topsep}{0pt}%
\setlength{\leftmargin}{#1}%
\setlength{\rightmargin}{#2}%
\setlength{\topmargin}{#3}%
\setlength{\listparindent}{\parindent}%
\setlength{\itemindent}{\parindent}%
\setlength{\parsep}{\parskip}%
}%
\item[]}{\end{list}}
\usetikzlibrary{arrows}
%\usepackage{palatino}
%\usepackage{eulervm}
\usecolortheme{lily}
\newtheorem{com}{Comment}
\newtheorem{lem} {Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{thm}{Theorem}
\newtheorem{defn}{Definition}
\newtheorem{cor}{Corollary}
\newtheorem{obs}{Observation}
\numberwithin{equation}{section}
%\usepackage[latin1]{inputenc}
\title[Text as Data] % (optional, nur bei langen Titeln nötig)
{Text as Data}
\author{Justin Grimmer}
\institute[Stanford University]{Associate Professor\\Department of Political Science \\ Stanford University}
\vspace{0.3in}
\date{October 30th, 2014}%[Big Data Workshop]
%\date{\today}
\begin{document}
\begin{frame}
\titlepage
\end{frame}
\begin{frame}
\frametitle{Structured Topic Models}
\begin{itemize}
\item[1)] Task:
\begin{itemize}
\item[-] Examine how document attention, topic content varies$\leadsto$ over time, across authors, or with \alert{general set of covariates}
\end{itemize}
\item[2)] Objective Function
\begin{eqnarray}
&& f(\boldsymbol{X}, \boldsymbol{\pi}, \boldsymbol{\Theta}, \boldsymbol{\alpha}, \alert{\boldsymbol{W}}) \nonumber
\end{eqnarray}
Where:
\begin{itemize}
\item[-] $\boldsymbol{W}$ condition on information in document$\leadsto$ other potential modifications to objective function. \alert{Meta-data}.
\item[-] $f(\boldsymbol{X}, \boldsymbol{\pi}, \boldsymbol{\Theta}, \boldsymbol{\alpha}, \alert{\boldsymbol{W}})$ may encode additional information$\leadsto$ layers of clustering, layers of topics, etc
\end{itemize}
\item[3)] Optimization
\begin{itemize}
\item[-] EM, Variational Approximation, Gibbs Sampling, $\hdots $
\end{itemize}
\item[4)] Validation$\leadsto$ many of the same methods from clustering
\begin{itemize}
\item[-] Semantic, Convergent, Discriminant, Predictive, Hypothesis validity
\item[-] \alert{How do we avoid the electric machine critique}?
\end{itemize}
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{LDA Revisited}
\only<1>{\begin{eqnarray}
\boldsymbol{\theta}_{k} & \sim & \text{Dirichlet}(\boldsymbol{1}) \nonumber \\
\boldsymbol{\pi}_{i}|\boldsymbol{\alpha} & \sim & \text{Dirichlet}(\boldsymbol{\alpha}) \nonumber \\
\boldsymbol{\tau}_{im}| \boldsymbol{\pi}_{i} & \sim & \text{Multinomial}(1, \boldsymbol{\pi}_{i}) \nonumber \\
x_{im} | \boldsymbol{\theta}_{k}, \tau_{imk} = 1 & \sim & \text{Multinomial}(1, \boldsymbol{\theta}_{k}) \nonumber
\end{eqnarray}}
\only<2>{\begin{eqnarray}
\textbf{Unigram Model}_{k} & \sim & \text{Dirichlet}(\boldsymbol{1}) \nonumber \\
\textbf{Doc. Prop}_{i} & \sim & \text{Dirichlet}(\textbf{Pop. Proportion}) \nonumber \\
\textbf{Word Topic}_{im} & \sim & \text{Multinomial}(1, \textbf{Doc. Prop}_{i}) \nonumber \\
\text{Word}_{im} & \sim & \text{Multinomial}(1, \textbf{Unigram Model}_{k}) \nonumber
\end{eqnarray}}
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
LDA:
\begin{tikzpicture}
\node (col) at (0, 10) [] {\textbf{Pop. Proportion}} ;
\invisible<1>{
\node (doc1) at (-5, 8) [] {\textbf{Doc. Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Doc. Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Doc. Prop}$_{N}$} ;
\draw[->, line width=1.5pt] (col) to [out=240, in = 90] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-2>{
\node (word11) at (-5, 7) [] {\textbf{Word Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Word Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Word Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-3>{
\node (wordaa) at (-5, 6) [] {\textbf{Words}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Words}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Words}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\end{tikzpicture}
\pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
Dynamic Topic Model (Quinn et al 2010)
\begin{tikzpicture}
\node (col) at (0, 10) [] {\textbf{Dynamic Prior Across Days}} ;
\invisible<1>{
\node (doc1) at (-5, 8) [] {\textbf{Day Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Day Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Day Prop}$_{N}$} ;
\draw[->, line width=1.5pt] (col) to [out=240, in = 90] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-2>{
\node (word11) at (-5, 7) [] {\textbf{Speech Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Speech Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Speech Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-3>{
\node (wordaa) at (-5, 6) [] {\textbf{Speeches}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Speeches}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Speeches}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\end{tikzpicture}
\pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
Expressed Agenda Model (Grimmer 2010)
\begin{tikzpicture}
\node (col) at (0, 10) [] {\textbf{Average Attention Across Authors}} ;
\invisible<1>{
\node (doc1) at (-5, 8) [] {\textbf{Author Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Author Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Author Prop}$_{N}$} ;
\draw[->, line width=1.5pt] (col) to [out=240, in = 90] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-2>{
\node (word11) at (-5, 7) [] {\textbf{Text Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Text Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Text Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-3>{
\node (wordaa) at (-5, 6) [] {\textbf{Texts}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Texts}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Texts}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\end{tikzpicture}
\pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
Structural Topic Model (Roberts, Stewart, Airoldi 2014)
\begin{tikzpicture}
\node (col) at (0, 10) [] {$g(\boldsymbol{W}, \boldsymbol{\gamma}) $} ;
\invisible<1>{
\node (doc1) at (-5, 8) [] {\textbf{Strata Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Strata Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Strata Prop}$_{N}$} ;
\draw[->, line width=1.5pt] (col) to [out=240, in = 90] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-2>{
\node (word11) at (-5, 7) [] {\textbf{Text Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Text Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Text Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-3>{
\node (wordaa) at (-5, 6) [] {\textbf{Texts}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Texts}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Texts}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\invisible<1-4>{
\node (reg) at (3, 4) [] {$h(\tilde{\boldsymbol{W}}, \boldsymbol{\kappa})$ )};
\draw[->, line width = 1.5pt] (reg) to [out = 180, in = 0] (topics);
}
\end{tikzpicture}
\pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
Conditioning on Unknown Covariates$\leadsto$ levels of mixtures at proportions (Grimmer 2013; Wallach 2008)
\begin{tikzpicture}
\only<1>{\node (col_on) at (0, 10)[] {\textbf{Mixture of Top. Attn. Models}} ; }
\invisible<1>{\node (col1) at (-2, 10) [] {\textbf{Strata Indic.} } ;
\node (col) at (2, 10) [] {\textbf{Topic Attention Models} } ; }
\invisible<1-2>{
\node (doc1) at (-5, 8) [] {\textbf{Strata Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Strata Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Strata Prop}$_{N}$} ;
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (doc1);
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (doc2);
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (docN);
}
\invisible<1-3>{
\draw[->, line width=1.5pt] (col) to [out=270, in = 45] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-4>{
\node (word11) at (-5, 7) [] {\textbf{Text Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Text Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Text Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-5>{
\node (wordaa) at (-5, 6) [] {\textbf{Texts}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Texts}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Texts}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\end{tikzpicture}
\pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A General Hierarchical Structure}
Conditioning on Unknown Covariates for Topics$\leadsto$ hierarchy of topics (Li and McCallum 2006; Blaydes, Grimmer, and McQueen 2014)
\begin{tikzpicture}
\node (col) at (-1, 10)[] {\textbf{Population attention}} ;
\invisible<1>{
\node (doc1) at (-5, 8) [] {\textbf{Strata Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Strata Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Strata Prop}$_{N}$} ;
\draw[->, line width=1.5pt] (col) to [out=270, in = 45] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
}
\invisible<1-2>{
\node (word11) at (-5, 7) [] {\textbf{Text Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Text Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Text Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
}
\invisible<1-3>{
\node (wordaa) at (-5, 6) [] {\textbf{Texts}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Texts}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Texts}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
}
\invisible<1-4>{
\node (mix) at (3, 4) [] {\textbf{Hierarchy of Topics}} ;
\draw[->, line width = 1.5pt] (mix) to [out = 180, in = 0] (topics);
}
\end{tikzpicture}
\pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{Why Encode Structure in Extensions of LDA?}
\pause
\begin{itemize}
\invisible<1>{\item[-] Substantive reasons} \pause
\begin{itemize}
\invisible<1-2>{\item[-] Additional structure corresponds to substantively interesting content} \pause
\invisible<1-3>{\item[-] Avoids potential ad-hoc secondary analysis} \pause
\invisible<1-4>{\item[-] Clear data generating process} \pause
\end{itemize}
\invisible<1-5>{\item[-] Statistical reasons} \pause
\begin{itemize}
\invisible<1-6>{\item[-] \alert{Smoothing}$\leadsto$ borrow information across groups intelligently} \pause
\invisible<1-7>{\item[-] \alert{Uncertainty}$\leadsto$ potential for better uncertainty estimates} \pause
\invisible<1-8>{\item[-] \alert{Improved topics}$\leadsto$ small word conditions, structure could help}
\end{itemize}
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Plan for the Class}
\begin{itemize}
\item[1)] Discuss model with unknown covariates for strata proportions$\leadsto$ presentational style
\item[2)] Discuss model with hierarchy of topics$\leadsto$ mirrors genre
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Unknown Covariates for Issue Attention: Measuring Attention in Senate Press Releases}
Substantive problem: \pause \\
\invisible<1>{Senators (representatives) regularly engage the public $\rightarrow$ presentational style\\
But we know little about this engagement} \pause \\
\invisible<1-2>{Why? \alert{Hard to Measure} } \pause \\
\invisible<1-3>{Describe model that facilitates estimation of \alert{presentational styles} in Senate press releases} \pause
\begin{itemize}
\invisible<1-4>{\item[-] Characterize representation provided to constituents} \pause
\invisible<1-5>{\item[-] Divide attention over a set of topics} \pause
\invisible<1-6>{\item[-] Given attention to topics, write press releases}
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Presentational Styles$\leadsto$ Objective Function}
\begin{itemize}
\item[-] $\pi_{itk} \equiv$ Attention senator $i$ allocates to
issue $k$ in year $t$
\item[-] $\pi_{itk} \equiv$ Probability press release is
about issue $k$
\item[-] $\boldsymbol{\pi}_{it} = (\pi_{it1},
\hdots, \pi_{it 44}) $
\end{itemize}
\pause
\invisible<1>{Press release-level parameters (press release $j$ from senator $i$
in year $t$)} \pause
\begin{itemize}
\invisible<1-2>{\item[-] \alert{Assume}: Each press release $j$
assigned to one topic.
\item[-] Let
$\boldsymbol{\tau}_{ijt}$ indicate press release $j$'s topic.} \pause
\end{itemize}
\invisible<1-3>{\begin{center} $\boldsymbol{\tau}_{ijt} \sim
\text{Multinomial}(1, \boldsymbol{\pi}_{it}) $ \end{center}} \pause
\begin{itemize}
\invisible<1-4>{\item[-] Conditional on topic, draw document's
content.} \pause
\invisible<1-5>{\item[-] If $\tau_{ijtk} =1$ then
\end{itemize}
\begin{center}$\boldsymbol{x}_{ijt} \sim \text{Multinomial}(n_{ijt}, \boldsymbol{\theta}_k
).$}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Priors}
Each $\boldsymbol{\pi}_{it}$ is a draw from one-of-$S$ styles$\leadsto$ mixture of Dirichlet distributions \pause .
\begin{eqnarray}
\invisible<1>{\boldsymbol{\sigma}_{it} & \sim & \text{Multinomial}(1, \boldsymbol{\beta}). } \pause \nonumber \\
\invisible<1-2>{\boldsymbol{\pi}_{it}|\sigma_{its}=1, \boldsymbol{\alpha}_s & \sim & \text{Dirichlet}(\boldsymbol{\alpha}_s) \nonumber } \pause \\
\invisible<1-3>{\alpha_{ks} & \sim & \text{Gamma}(0.25, 1)} \pause \nonumber
\end{eqnarray}
\invisible<1-4>{Other priors:} \pause
\begin{eqnarray}
\invisible<1-5>{\boldsymbol{\theta}_k & \sim & \text{Multinomial}(\boldsymbol{\lambda}) \nonumber \\} \pause
\invisible<1-6>{\boldsymbol{\beta} & \sim & \text{Multinomial}(\boldsymbol{1})}
\nonumber
\end{eqnarray}
\end{frame}
%\begin{frame}
%\begin{eqnarray}
%\alpha_{sk} & \sim & \text{Gamma}(0.25, 1) \text{ for all } k, s \nonumber \\
%\boldsymbol{\beta} & \sim & \text{Dirichlet}(\boldsymbol{1}) \nonumber \\
%\boldsymbol{\theta}_k & \sim & \text{Dirichlet}(\boldsymbol{\lambda} ) \nonumber \\
%\boldsymbol{\sigma}_{it} | \boldsymbol{\beta} & \sim & \text{Multinomial}(1, \boldsymbol{\beta} ) \text{ for all } i ; t \nonumber \\
%\boldsymbol{\pi}_{it} | \boldsymbol{\sigma}_{its}=1, \boldsymbol{\alpha}_s & \sim & \text{Dirichlet}(\boldsymbol{\alpha}_s) \text{ for all } i ; t \nonumber \\
%\boldsymbol{\tau}_{ijt}|\boldsymbol{\pi}_{it} & \sim & \text{Multinomial}(1, \boldsymbol{\pi}_{it} ) \text{ for all } j ; t ; i \nonumber \\
%\boldsymbol{y}_{ijt} | \boldsymbol{\tau}_{ijtk} = 1,
%\boldsymbol{\theta}_k & \sim & \text{Multinomial}(n_{ijt},
%\boldsymbol{\theta}_k) \text{ for all } j ; t ; i \nonumber
%\end{eqnarray}
%\end{frame}
\begin{frame}
\frametitle{Presentational Styles$\leadsto$ Objective Function}
\pause
\begin{eqnarray}
\invisible<1>{\boldsymbol{\beta}& \sim & \text{Dirichlet}(\boldsymbol{1}) \nonumber } \\
\invisible<1>{\boldsymbol{\theta}_{k} & \sim & \text{Dirichlet}(\boldsymbol{\lambda}) \nonumber} \\
\invisible<1>{\alpha_{ks} & \sim & \text{Gamma}(0.25, 1) \nonumber} \\
\invisible<1-2>{\boldsymbol{\sigma}_{it} & \sim & \text{Multinomial}(1, \boldsymbol{\beta}) \nonumber } \\
\invisible<1-3>{\boldsymbol{\pi}_{it}| \sigma_{its} = 1, \boldsymbol{\alpha}_{s} & \sim & \text{Dirichlet}(\boldsymbol{\alpha}_{s})\nonumber} \\
\invisible<1-4>{\boldsymbol{\tau}_{ijt} | \boldsymbol{\pi}_{it} & \sim & \text{Multinomial}(1, \boldsymbol{\pi}_{it}) \nonumber \\}
\invisible<1-5>{\boldsymbol{x}_{ijt}| \tau_{ijtk} = 1, \boldsymbol{\theta}_{k} & \sim & \text{Multinomial}(n_{ijt}, \boldsymbol{\theta}_{k})\nonumber }
\end{eqnarray}
\pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{Mixture of Styles, Mixture of Topics}
\begin{tikzpicture}
\node (col1) at (-2, 10) [] {\textbf{Style Indicators} } ;
\node (col) at (2, 10) [] {\textbf{Dirichlet Distributions} } ;
\node (doc1) at (-5, 8) [] {\textbf{Senator Prop}$_{1}$} ;
\node (doc2) at (-1, 8) [] {\textbf{Senator Prop}$_{2}$} ;
\node (dots) at ( 2, 8) [] {$\hdots$} ;
\node (docN) at (4, 8) [] {\textbf{Senator Prop}$_{N}$} ;
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (doc1);
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (doc2);
\draw[->, line width=1.5pt, red] (col1) to [out=270, in = 135] (docN);
\draw[->, line width=1.5pt] (col) to [out=270, in = 45] (doc1);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (doc2);
\draw[->, line width=1.5pt] (col) to [out=270, in = 90] (docN);
\node (word11) at (-5, 7) [] {\textbf{Press Topics}$_{1}$} ;
\node (word22) at (-1, 7) [] {\textbf{Press Topics}$_{2}$} ;
\node (wordnn) at (4, 7) [] {\textbf{Press Topics}$_{N}$ } ;
\draw[->, line width=1.5pt] (doc1) to [out=270, in=90] (word11) ;
\draw[->, line width=1.5pt] (doc2) to [out=270, in=90] (word22) ;
\draw[->, line width=1.5pt] (docN) to [out=270, in=90] (wordnn) ;
\node (wordaa) at (-5, 6) [] {\textbf{Press}$_{1}$} ;
\node (wordbb) at (-1, 6) [] {\textbf{Press}$_{2}$} ;
\node (wordcc) at (4, 6) [] {\textbf{Press}$_{N}$ } ;
\draw[->, line width = 1.5pt] (word11) to [out = 270, in = 90] (wordaa);
\draw[->, line width = 1.5pt] (word22) to [out = 270, in = 90] (wordbb);
\draw[->, line width = 1.5pt] (wordnn) to [out = 270, in = 90] (wordcc);
\node (topics) at (-1, 4) [] {$\textbf{Unigram Models}$} ;
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordaa);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordbb);
\draw[->, line width = 1.5pt] (topics) to [out = 90, in = 270] (wordcc);
\end{tikzpicture}
\end{frame}
\begin{frame}
Posterior: \tiny
\begin{eqnarray}
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi},
\boldsymbol{\tau}|\boldsymbol{X}) & \propto &
\prod_{k=1}^{K}\prod_{s=1}^{S} \frac{\exp( -
\frac{\alpha_{ks}}{1/4})}{1/4} \times \frac{\Gamma(\sum_{w=1}^{W}
\lambda_w) }{\prod_{w=1}^{W} \Gamma(\lambda_w) } \prod_{w=1}^{W}
\theta_{k,w}^{\lambda_w - 1}
\times \nonumber \\
& & \prod_{i=1}^{N} \prod_{t=2005}^{2007} \prod_{s=1}^{S} \left[
\beta_s \frac{\Gamma(\sum_{k=1}^{K} \alpha_{ks})}{\prod_{k=1}^{K}
\Gamma(\alpha_{ks} )} \prod_{k=1}^{K} \pi_{itk}^{\alpha_{ks}-1}
\prod_{j=1}^{D_{it} }\prod_{k=1}^{K} \left[ \pi_{itk}
\prod_{w=1}^{W} \theta_{kw} ^{x_{ijtw} }
\right]^{\tau_{ijtk}} \right]^{\sigma_{its}} \nonumber
\end{eqnarray}
\pause
\normalsize
\begin{itemize}
\invisible<1>{\item[1)] Estimate with Variational Approximation} \pause
\invisible<1-2>{\item[2)] Determining number of clusters at top? (Grimmer, Shorey, Wallach, and Zlotnick, In Progress)} \pause
\begin{itemize}
\invisible<1-3>{\item[-] Non-parametric model$\leadsto$ statistical selection} \pause
\invisible<1-4>{\item[-] Experiments/Coding Exercises to assess}
\end{itemize}
\end{itemize}
\end{frame}
\begin{frame}
\only<1>{\scalebox{0.35}{\includegraphics{ShelbyPress.pdf}}}
\only<2>{\scalebox{0.35}{\includegraphics{SessionsPress.pdf}}}
\end{frame}
\begin{frame}
\frametitle{Notions of validity: From Quinn, Monroe, et al (2010) }
\begin{enumerate}
\item[-] \alert{Semantic Validity:} All categories are coherent and meaningful
\item[-] \alert{Convergent Construct Validity:} Measures concur with existing measures in critical details.
\item[-] \alert{Discriminant Construct Validity}: Measures differ from existing measures in productive ways.
\item[-] \alert{Predictive Measure:} Measures from the model corresponds to external events in expected ways.
\item[-] \alert{Hypothesis Validity:} Measures generated from the model can be used to test substantive hypotheses.
\end{enumerate}
To establish utility of new measures, demonstrate variety of \alert{validations}\\
\alert{None of these validations are performed using a canned statistic}\\
\alert{All}: require substantive knowledge on areas (and what we expect!) [
\end{frame}
\begin{frame}
\frametitle{Home Style Measures, Semantic Validity}
\alert{Must}: Demonstrate to reader that topics are coherent and semantically meaningful
\begin{tabular}{lll}
\hline\hline
Description & Stems & \% \\
\hline
Honorary& honor,prayer,rememb,fund,tribut& 5.0\\
Transp. Grants& airport,transport,announc,urban,hud&4.8\\
Iraq& iraq,iraqi,troop,war,sectarian& 4.7\\
DHS Policy& homeland,port,terrorist,dh,fema&4.1\\
Judicial Nom.& judg,court,suprem,nomin,nomine&3.8\\
Fire Dept. Grant& firefight,homeland,afgp,award,equip&3.7\\
\hline
\end{tabular}
How: \alert{examples} in text are also useful.
\end{frame}
\begin{frame}
\frametitle{Home Style Measures, Convergent Validity}
\only<1-3>{\alert{Over time variation} }
\only<4>{\alert{Supervised/Unsupervised Convergence} }
\only<1>{\scalebox{0.4}{\includegraphics{ImmigrationPlot.pdf}}}
\only<2>{\scalebox{0.4}{\includegraphics{IraqWarPlot.pdf}}}
%\only<3>{\scalebox{0.4}{\includegraphics{Worker5.pdf}}}
\only<3>{\scalebox{0.4}{\includegraphics{HonorPlot.pdf}}}
\only<4>{\scalebox{0.3}{\includegraphics{SupervisedUnsupervised.pdf}}}
\only<5>{\scalebox{0.3}{\includegraphics{ConvValid.pdf}}}
\end{frame}
\begin{frame}
\frametitle{Discriminant Construct Validity}
\scalebox{0.45}{\includegraphics{IdealAttn.pdf} }
\end{frame}
\begin{frame}
\frametitle{Predictive Validity}
\scalebox{0.4}{\includegraphics{CompareLeaders.pdf} }
\end{frame}
\begin{frame}
\frametitle{Hypothesis Validity}
\scalebox{0.28}{\includegraphics{PrioritiesPlotLabel.pdf}}
\begin{columns}[]
\invisible<1>{\column{0.25\textwidth}
\textcolor{blue}{Senate}\\
\textcolor{blue}{Statesperson}
\begin{itemize}
\item[-] \textcolor{blue}{Iraq War}
\item[-] \textcolor{blue}{Intelligence}
\item[-] \textcolor{blue}{Intl. Relations}
\item[-] \textcolor{blue}{Budget}
\end{itemize}}
\invisible<1-2>{\column{0.25\textwidth}
\textcolor{darkgreen}{Domestic}\\
\textcolor{darkgreen}{Policy}
\begin{itemize}
\item[-] \textcolor{darkgreen}{Environment}
\item[-] \textcolor{darkgreen}{Gas prices}
\item[-] \textcolor{darkgreen}{DHS}
\item[-] \textcolor{darkgreen}{Consumer Safety}
\end{itemize}}
\invisible<1-3>{\column{0.25\textwidth} \textcolor{brown}{Pork \&
Policy}
\begin{itemize}
\item[-] \textcolor{brown}{WRDA grants}
\item[-] \textcolor{brown}{Farming}
\item[-] \textcolor{brown}{Health Care}
\item[-] \textcolor{brown}{Education Policy}
\end{itemize}}
\invisible<1-4>{\column{0.25\textwidth}
\textcolor{red}{Appropriators}
\begin{itemize}
\item[-] \textcolor{red}{Fire Grants}
\item[-] \textcolor{red}{Airport Grants}
\item[-] \textcolor{red}{University Money}
\item[-] \textcolor{red}{Police Grants}
\end{itemize}}
\end{columns}
\pause\pause\pause\pause
\end{frame}
\begin{frame}
\frametitle{Hypothesis Validity}
Why do senators adopt different styles?\\
\alert{District Fit}
\scalebox{0.4}{\includegraphics{FinalAvoidance.pdf}}
\end{frame}
\begin{frame}
\frametitle{What are the right number of topics?}
\pause
\begin{itemize}
\invisible<1>{\item[-] Number of topics$\leadsto$ depends on task at hand}
\invisible<1-2>{\item[-] Coarse$\leadsto$ broad comparisons, lose distinctions}
\invisible<1-3>{\item[-] Granular$\leadsto$ specific insights, lose broader picture}
\invisible<1-4>{\item[-] \alert{Hierarchy of topics}$\leadsto$ Pachinko Allocation, Hierarchies of von-Mises Fisher Distributions}
\end{itemize}
\invisible<1-5>{Blaydes, Grimmer, and McQueen [In Progress]$\leadsto$ estimate nested topics to explore the \alert{Mirros for Princes}}
\pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{The Mirrors Genre}
26 Christian mirrors \pause
\begin{itemize}
\invisible<1>{\item[-] The Prince (1513 CE)} \pause
\invisible<1-2>{\item[-] Advice to Justinian (527 CE)} \pause
\invisible<1-3>{\item[-] The Adventures of Telemachus (1699 CE)} \pause
\end{itemize}
\invisible<1-4>{21 Islamic texts} \pause
\begin{itemize}
\invisible<1-5>{\item[-] Advice on the Art of Governance (1612 CE)} \pause
\invisible<1-6>{\item[-] Kalila wa Dimna (748 CE)} \pause
\invisible<1-7>{\item[-] The Sultan's Register of Laws (1632-1633 CE)} \pause
\end{itemize}
\invisible<1-8>{Work with translations}\pause\invisible<1-9>{$\leadsto$ little evidence of selection} \pause
\begin{itemize}
\invisible<1-10>{\item[-] Collect data on collection of 98 (51 Christian, 47 Islamic, some not translated)} \pause
\invisible<1-11>{\item[-] No difference on Year/Region}
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Preprocessing Texts}
47 books \invisible<1>{$\leadsto$ Each divided into paragraphs} \\
\invisible<1-2>{Create feature space}
\begin{itemize}
\invisible<1-3>{\item[-] Bag of words, stem, discard punctuation, stop words}
\invisible<1-4>{\item[-] Translate words left in Arabic (\alert{allah}) and discard proper nouns}
\invisible<1-5>{\item[-] Identified synonyms}
\begin{itemize}
\invisible<1-6>{\item[-] \alert{almighty}, \alert{god}}
\invisible<1-7>{\item[-] \alert{monarch}, \alert{prince}, \alert{king}, \alert{ruler}}
\invisible<1-8>{\item[-] \alert{Lord} $\neq$ \alert{lord} }
\end{itemize}
\end{itemize}
\invisible<1-9>{Result: short segment $j$ in book $i$ is a count vector}
\begin{eqnarray}
\invisible<1-10>{\textbf{x}_{ij} & = & (x_{ij1}, x_{ij2}, \hdots, x_{ij2124}) \nonumber}
\end{eqnarray}
\invisible<1-11>{We work with a normalized version of the documents, }
\begin{eqnarray}
\invisible<1-12>{\textbf{x}^{*}_{ij} & = & \frac{\textbf{x}_{ij}}{\sqrt{\textbf{x}^{'}_{ij}\textbf{x}_{ij}} } \nonumber}
\end{eqnarray}
\pause \pause \pause \pause \pause \pause \pause \pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{Measuring Themes in the Mirrors}
\only<1-3>{Model built around two hierarchies:
\begin{itemize}
\invisible<1>{\item[1)] Books $\leadsto$ paragraphs (Blei, Ng, Jordan 2003; Wallach, 2008; Quinn et al 2010; Grimmer 2010; Roberts et al 2014)}
\invisible<1-2>{\item[2)] Coarse topics $\leadsto$ granular topics (Li and McCallum 2006; Gopal and Yang 2014)}
\end{itemize}
}
\only<4->{
Estimate \alert{four} quantities of interest
\begin{itemize}
\invisible<1-4>{\item[1)] Granular topics (60)}
\invisible<1-5>{\item[2)] Coarse (broad) topics (3)}
\begin{itemize}
\invisible<1-6>{\item[-] Each granular topic classified into one coarse topic }
\end{itemize}
\invisible<1-7>{\item[3)] Each book $i'$s $\textbf{themes}_{i}}$
\invisible<1-8>{\item[4)] Each short segment's granular (and coarse) topic }
\end{itemize}
\begin{eqnarray}
\invisible<1-7, 9->{\textbf{themes}_{i} & = & (\text{theme}_{i1}, \text{theme}_{i2}, \hdots, \text{theme}_{i60} ) \nonumber }
\end{eqnarray}
}
\pause \pause \pause \pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\frametitle{A Hierarchy of Topics}
\begin{tikzpicture}
\node (Dummy) at (-9,8) [] {} ;
\node (theme1) at (-8, 9) [] {$\textbf{themes}_{i} $} ;
\invisible<1>{\node (draws) at (-4, 9) [] {$\textbf{Topic}_{ij}$};}
\invisible<1>{\draw[->, line width = 2pt] (theme1) to [out = 0, in = 180] (draws);}
\invisible<1-2>{\node (document) at (-1, 8) [] {$\textbf{x}^{*}_{ij}$ }; }
\invisible<1-2>{\draw[->, line width = 2pt] (draws) to [out = 350, in = 145] (document); }
\invisible<1-2>{\node (topics) at (-4, 7) [] {$\textbf{granular}$}; }
\invisible<1-2>{\draw[->, line width = 2pt] (topics) to [out = 0, in = 225] (document) ; }
\invisible<1-3>{\node (topic_sig) at (-6, 8.25) [] {$\textbf{broad}$} ; }
\invisible<1-3>{\draw[->, line width = 2pt] (topic_sig) to [out = 350, in = 110] (topics) ; }
\invisible<1-3>{\node (coarse) at (-8, 7) [] {$\textbf{coarse}$}; }
\invisible<1-3>{\draw[->, line width = 2pt] (coarse) to [out = 0, in= 180] (topics) ; }
\end{tikzpicture}
\begin{eqnarray}
\invisible<1>{\textbf{Topic}_{ij} & \sim & \text{Multinomial}(1, \textbf{themes}_{i}) \nonumber }\\
\invisible<1-2>{\textbf{x}^{*}_{ij} | \text{Topic}_{ijk} = 1 & \sim & \text{vMF} (\kappa, \textbf{granular}_{k} ) \nonumber }\\
\invisible<1-3>{\textbf{broad}_{k} & \sim & \text{Multinomial}(1, \textbf{Broad Theme Prior}) \nonumber }\\
\invisible<1-3>{\textbf{granular}_{k} | \text{broad}_{km} = 1 & \sim & \text{vMF}(\kappa, \textbf{coarse}_{m}) \nonumber }
\end{eqnarray}
\invisible<1-4>{Estimate model with Variational Approximation}\\
\invisible<1-5>{Model selection: automatic model fit, qualitative evaluation}
\pause \pause \pause \pause \pause
%%draws theme
%%then draws content from a topic specific distribution
%%our model classifies each of those granular themes into coarse themes
\end{frame}
\begin{frame}
\frametitle{Interpreting Unsupervised Models}
Two approaches to labeling output \pause
\begin{itemize}
\invisible<1>{\item[1)] \alert{Computational}: identify discriminating words }\pause
\invisible<1-2>{\item[2)] \alert{Manual}: Segments classified to coarse, granular topics. Read, discuss, and label} \pause
\end{itemize}
\invisible<1-3>{Unsupervised models \alert{structure} and \alert{guide} our reading}
\end{frame}
\begin{frame}
\frametitle{Art of Rulership}
Practices and ideals of political rule
\vspace{0.5in}
\begin{tabular}{l}
\invisible<1>{king}\invisible<1-2>{,princ}\invisible<1-3>{,citi}\invisible<1-4>{,great,place,work,emperor,enemi,armi,letter} \\
\end{tabular}
\vspace{0.5in}
\invisible<1-5>{36.5\% of paragraphs }
\pause \pause \pause \pause \pause
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Hist_Super1_p.pdf}}
\end{center}
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Super1.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Religion and Virtue}
Connection between religion, virtue, justice and political rule \pause
\vspace{0.5in}
\begin{tabular}{l}
\invisible<1>{almighti,good,virtu,power,ruler,justic,prayer,rule,prophet,mena \\}
\end{tabular}
\pause
\vspace{0.5in}
\invisible<1-2>{32.2\% of pargraphs}
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Hist_Super2_p.pdf}}
\end{center}
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Super2.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Inner Life of the Ruler}
Personal relationships, care for and practices of the self, and ultimate fate of the soul \pause
\vspace{0.5in}
\begin{tabular}{ll}
\invisible<1>{man,land,woman,know,bodi,eye,ladi,love,faculti,old} \pause
\end{tabular}
\vspace{0.5in}
\invisible<1-2>{31.2\% of paragraphs}
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Hist_Super3_p.pdf}}
\end{center}
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{Super3.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Granular: Best Practices for Ruling}
\begin{tabular}{l}
\hline
king,princ,citi,great,place,work,emperor,enemi,armi,letter \\
\hline
\alert{king,kingdom,royal,minist,reign,father,court,majesti,presenc,war}
\end{tabular}
\vspace{0.5in}
6.2\% of paragraphs
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{1point1.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Granular: Characteristics that distinguish Just Ruler from Tyrant}
\begin{tabular}{l}
\hline
king,princ,citi,great,place,work,emperor,enemi,armi,letter \\
\hline
king,kingdom,royal,minist,reign,father,court,majesti,presenc,war\\
\alert{princ,good,peopl,christian,tyranni,war,mind,ought,state,public}\\
\end{tabular}
\vspace{0.5in}
3.1\% of paragraphs
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{1point2.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Granular: Religious Virtues and Political Ideals}
\begin{tabular}{l}
\hline
almighti,good,virtu,power,ruler,justic,prayer,rule,prophet,mena\\
\hline
\alert{almighti,bless,grant,peac,messeng,prophet,merci,holi,command,grace}
\end{tabular}
\vspace{0.5in}
6.9\% of paragraphs
\end{frame}
\begin{frame}
\begin{center}
\scalebox{0.45}{\includegraphics{2point1.pdf}}
\end{center}
\end{frame}
\begin{frame}
\frametitle{Structural Topic Models}
\begin{itemize}
\item[-] Encode observed and unobserved meta data
\item[-] ?Improve substantive inferences
\end{itemize}
Next week:
\begin{itemize}
\item[1)] Hanna Wallach on canonical topic models
\item[2)] Introduction to supervised learning
\end{itemize}
Work on your problem sets!
\end{frame}
\begin{frame}
Appendix: Inference for both Models
\end{frame}
\begin{frame}
\frametitle{Inference}
Invariance in posterior makes it difficult (impossible) to
approximate with sampling based methods (relabeling, aliasing problem). \\
Deterministic alternative: variational approximations. \\
Intuition: approximate posterior with simpler (still very general)
approximating distribution. \\
Make approximation as ``close" as possible\\
\end{frame}
\begin{frame}
Approximate posterior with:
\scriptsize
\begin{eqnarray}
q(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau}) & = &
q(\boldsymbol{\alpha})q(\boldsymbol{\beta})q( \boldsymbol{\theta})q(\boldsymbol{\sigma})q(\boldsymbol{\pi})q(\boldsymbol{\tau}) \nonumber \\
& = & q(\boldsymbol{\beta} ) \prod_{k=1}^{K}
q(\boldsymbol{\theta})_{k} \prod_{i=1}^{n}
\prod_{t=2005}^{2007}\left[ q(\boldsymbol{\sigma})_{it}
q(\boldsymbol{\pi})_{it}
\prod_{j=1}^{J} q(\boldsymbol{\tau})_{ijt} \right] \prod_{s=1}^{S} q(\boldsymbol{\alpha})_{s}
\nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Variational Approximation} Optimization goal:
\begin{itemize}
\item[-] Minimize the Kullback-Leibler divergence
between approximating distribution $q$ and true posterior $p$
\begin{itemize}
\item[-] KL-divergence is a functional: takes
\alert{functions} as an input, returns a positive scalar
\item[-] Measures ``divergence" between two
measures
\end{itemize}
\item[-] Use calculus of variations and theory from
exponential models to derive iterative algorithm
\item[-] See ``An Introduce to Bayesian Inference via Variational
Approximations" for extended introduction (Grimmer, 2011)
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Minimize KL-divergence by Maximizing a Lower Bound}
\scriptsize
\begin{eqnarray}
\log p(\boldsymbol{Y}) & = & \log
\sum_{\boldsymbol{\sigma}}\sum_{\boldsymbol{\tau}} \iiiint
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi},
\boldsymbol{\tau}|\boldsymbol{Y}) d\boldsymbol{\theta}
d\boldsymbol{\alpha}d\boldsymbol{\beta}d\boldsymbol{\pi} \nonumber
\end{eqnarray}
\begin{eqnarray}
\log p(\boldsymbol{Y}) & = & \log
\sum_{\boldsymbol{\sigma}}\sum_{\boldsymbol{\tau}} \iiiint
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi},
\boldsymbol{\tau}|\boldsymbol{Y}) \frac{q(\boldsymbol{\alpha},
\boldsymbol{\beta}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\pi}, \boldsymbol{\tau})}{q(\boldsymbol{\alpha},
\boldsymbol{\beta}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\pi}, \boldsymbol{\tau})}d\boldsymbol{\theta}
d\boldsymbol{\alpha}d\boldsymbol{\beta}d\boldsymbol{\pi} \nonumber
\end{eqnarray}
\begin{eqnarray}
\log p(\boldsymbol{Y}) & \geq &
\underbrace{\sum_{\boldsymbol{\sigma}}\sum_{\boldsymbol{\tau}}
\iiiint q(\boldsymbol{\alpha}, \boldsymbol{\beta},
\boldsymbol{\theta}, \boldsymbol{\sigma}, \boldsymbol{\pi},
\boldsymbol{\tau}) \log\frac{p(\boldsymbol{\alpha},
\boldsymbol{\beta}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\pi},
\boldsymbol{\tau}|\boldsymbol{Y})}{q(\boldsymbol{\alpha},
\boldsymbol{\beta}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\pi}, \boldsymbol{\tau})}d\boldsymbol{\theta}
d\boldsymbol{\alpha}d\boldsymbol{\beta}d\boldsymbol{\pi}}_{\mathcal{L}(q)
}. \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Minimize KL-divergence by Maximizing a Lower Bound}
\begin{eqnarray}
\log p(\boldsymbol{Y}) & =& \mathcal{L}(q) + \text{KL}(q||p)
\nonumber
\\ \pause
\invisible<1>{\underbrace{\log p(\boldsymbol{Y})}_{\text{fixed
number}} & =& \mathcal{L}(q) +
\underbrace{\text{KL}(q||p)}_{\text{Positive}} \nonumber}
\end{eqnarray}
\pause \invisible<1-2>{If $\mathcal{L}(q)$ get bigger,
$\text{KL}(q||p)$
get smaller. $\Rightarrow$} \pause \\
\invisible<1-3>{If $\mathcal{L}(q)$ is at a maximum
$\text{KL}(q||p)$ is at a minimum (duals).}
\end{frame}
\begin{frame}
\frametitle{Maximizing $\mathcal{L}(q)$}
Goal: choose $q$ to maximize $\mathcal{L}(q)$. \\
\begin{eqnarray}
q(\boldsymbol{\alpha})^{\text{old}},
q(\boldsymbol{\beta})^{\text{old}}, q(
\boldsymbol{\theta})^{\text{old}},
q(\boldsymbol{\sigma})^{\text{old}},
q(\boldsymbol{\pi})^{\text{old}}, q(\boldsymbol{\tau})^{\text{old}}.
\nonumber
\end{eqnarray}
Iterative Algorithm: \\
\footnotesize Choose, $q(\boldsymbol{\pi})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\theta})^{\text{old}},q(\boldsymbol{\tau})^{\text{old}},q(\boldsymbol{\alpha})^{\text{old}},
q(\boldsymbol{\beta})^{\text{old}},q(\boldsymbol{\sigma})^{\text{old}}$
constant. \\
Choose, $q(\boldsymbol{\theta})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\pi})^{\text{new}},q(\boldsymbol{\tau})^{\text{old}},q(\boldsymbol{\alpha})^{\text{old}},
q(\boldsymbol{\beta})^{\text{old}},q(\boldsymbol{\sigma})^{\text{old}}$
constant. \\
Choose, $q(\boldsymbol{\tau})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\theta})^{\text{new}},q(\boldsymbol{\pi})^{\text{new}},q(\boldsymbol{\alpha})^{\text{old}},
q(\boldsymbol{\beta})^{\text{old}},q(\boldsymbol{\sigma})^{\text{old}}$
constant. \\
Choose, $q(\boldsymbol{\alpha})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\theta})^{\text{new}},q(\boldsymbol{\tau})^{\text{new}},q(\boldsymbol{\pi})^{\text{new}},
q(\boldsymbol{\beta})^{\text{old}},q(\boldsymbol{\sigma})^{\text{old}}$
constant. \\
Choose, $q(\boldsymbol{\beta})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\theta})^{\text{new}},q(\boldsymbol{\tau})^{\text{new}},q(\boldsymbol{\pi})^{\text{new}},
q(\boldsymbol{\alpha})^{\text{new}},q(\boldsymbol{\sigma})^{\text{old}}$
constant. \\
Choose, $q(\boldsymbol{\sigma})^{\text{new}}$ to max
$\mathcal{L}(q)$--holding
$q(\boldsymbol{\theta})^{\text{new}},q(\boldsymbol{\tau})^{\text{new}},q(\boldsymbol{\pi})^{\text{new}},
q(\boldsymbol{\alpha})^{\text{new}},q(\boldsymbol{\beta})^{\text{new}}$
constant.
\end{frame}
\begin{frame}
\frametitle{Example for $q(\boldsymbol{\pi})^{\text{new}}$} \tiny
\begin{eqnarray}
\mathcal{L}(q) & =& \int q(\boldsymbol{\pi})^{\text{new}}
\underbrace{\left\{ \sum_{\boldsymbol{\sigma}}
\sum_{\boldsymbol{\tau}} \iiint \log p(\boldsymbol{Y},
\boldsymbol{\pi}, \boldsymbol{\alpha}, \boldsymbol{\theta},
\boldsymbol{\tau})
q(\boldsymbol{\sigma})^{\text{old}}q(\boldsymbol{\tau})^{\text{old}}q(\boldsymbol{\theta})^{\text{old}}q(\boldsymbol{\alpha})^{\text{old}}q(\boldsymbol{\beta})^{\text{old}}
d\boldsymbol{\theta} d\boldsymbol{\alpha}
d\boldsymbol{\beta}\right\}}_{\text{E}_{\boldsymbol{\alpha},
\boldsymbol{\tau}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\beta} }[\log p(\boldsymbol{Y}, \boldsymbol{\pi},
\boldsymbol{\alpha},
\boldsymbol{\theta}, \boldsymbol{\tau}, \boldsymbol{\beta}, \boldsymbol{\sigma})]}d\boldsymbol{\pi} \nonumber \\
&&- q(\boldsymbol{\pi})^{\text{new}}\log
q(\boldsymbol{\pi})^{\text{new}} + \text{constants} \nonumber
\end{eqnarray}
\normalsize Define
\begin{eqnarray}
\log \tilde{p}(\boldsymbol{\pi}) & = &
\text{E}_{\boldsymbol{\alpha}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\sigma}, \boldsymbol{\beta} }[\log
p(\boldsymbol{Y}, \boldsymbol{\pi}, \boldsymbol{\alpha},
\boldsymbol{\theta}, \boldsymbol{\tau}, \boldsymbol{\beta},
\boldsymbol{\sigma})] + \text{constants} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Example for $q(\boldsymbol{\pi})^{\text{new}}$}
Substituting $\log \tilde{p}(\boldsymbol{\pi})$,
\begin{eqnarray}
& = & \int q(\boldsymbol{\pi})^{\text{new}} \log
\left(\frac{\tilde{p}(\boldsymbol{\pi})}{q(\boldsymbol{\pi})^{\text{new}}}
\right)d\boldsymbol{\pi} \nonumber \\
& = & -
\text{KL}(q(\boldsymbol{\pi})^{\text{new}}||\tilde{p}(\boldsymbol{\pi})
) \nonumber
\end{eqnarray}
$\Rightarrow$ At a maximum when $q(\boldsymbol{\pi})^{\text{new}}
=\tilde{p}(\boldsymbol{\pi}) $. \\
Equivalently,
\begin{eqnarray}
\log q(\boldsymbol{\pi})^{\text{new}} & = & \log
\tilde{p}(\boldsymbol{\pi}) \nonumber \\
& = & \text{E}_{\boldsymbol{\alpha}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\sigma}, \boldsymbol{\beta} }[\log
p(\boldsymbol{Y}, \boldsymbol{\pi}, \boldsymbol{\alpha},
\boldsymbol{\theta}, \boldsymbol{\tau}, \boldsymbol{\beta},
\boldsymbol{\sigma})] + \text{constants}\nonumber
\end{eqnarray}
Or,
\begin{eqnarray}
q(\boldsymbol{\pi})^{\text{new}} & = &
\frac{\exp(\text{E}_{\boldsymbol{\alpha}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\sigma}, \boldsymbol{\beta} }[\log
p(\boldsymbol{Y}, \boldsymbol{\pi}, \boldsymbol{\alpha},
\boldsymbol{\theta}, \boldsymbol{\tau}, \boldsymbol{\beta},
\boldsymbol{\sigma})])}{\int \exp(\text{E}_{\boldsymbol{\alpha},
\boldsymbol{\tau}, \boldsymbol{\theta}, \boldsymbol{\sigma},
\boldsymbol{\beta} }[\log p(\boldsymbol{Y}, \boldsymbol{\pi},
\boldsymbol{\alpha}, \boldsymbol{\theta}, \boldsymbol{\tau},
\boldsymbol{\beta}, \boldsymbol{\sigma})])d\boldsymbol{\pi}}
\nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
To maximize $\mathcal{L}(q)$ we use the following iterative
algorithm \scriptsize
\begin{eqnarray}
q(\boldsymbol{\sigma})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\tau}, \boldsymbol{\theta},
\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\pi} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber \\
q(\boldsymbol{\tau})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\sigma}, \boldsymbol{\theta},
\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\pi} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber \\
q(\boldsymbol{\theta})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\sigma}, \boldsymbol{\tau},
\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\pi} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber \\
q(\boldsymbol{\alpha})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\sigma}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\beta}, \boldsymbol{\pi} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber \\
q(\boldsymbol{\beta})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\sigma}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\alpha}, \boldsymbol{\pi} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber \\
q(\boldsymbol{\pi})^{\text{new}} & \propto &
\exp\left(\text{E}_{\boldsymbol{\sigma}, \boldsymbol{\tau},
\boldsymbol{\theta}, \boldsymbol{\alpha}, \boldsymbol{\beta} }[\log
p(\boldsymbol{\alpha}, \boldsymbol{\beta}, \boldsymbol{\theta},
\boldsymbol{\sigma}, \boldsymbol{\pi}, \boldsymbol{\tau},
\boldsymbol{Y}) ] \right) \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\sigma})_{it}$}
$q(\boldsymbol{\sigma})_{it}$ is a Multinomial$(1,
\boldsymbol{c}_{it})$ distribution, with typical parameter $c_{its}$
\scriptsize
\begin{eqnarray}
\boldsymbol{c}_{its} & \propto & \exp\left\{ \text{E}[\log \beta_s]
+ \log \Gamma (\sum_{k=1}^{K} \alpha_{ks} ) - \sum_{k=1}^{K} \log
\Gamma (\alpha_{ks}) +
\sum_{k=1}^{K} (\alpha_{ks} - 1 )\text{E}[\log \pi_{itk}] \right\}. \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\tau})_{ijt} $ }
$q(\boldsymbol{\tau})_{ijt} $ is a Multinomial$(1,
\boldsymbol{r}_{ijt})$ distribution with typical parameter,
\scriptsize
\begin{eqnarray}
r_{ijtk} & \propto & \exp \left\{\text{E}[\log \pi_{itk}] +
\sum_{w=1}^{W} y_{ijtw}\text{E}[\log \theta_{kw}] \right\}.\nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\pi})_{it}$}
$q(\boldsymbol{\pi})_{it}$ is a
Dirichlet($\boldsymbol{\gamma}_{it}$) distribution, with typical
parameter $\gamma_{itk}$ equal to
\scriptsize
\begin{eqnarray}
\gamma_{itk} & = & \sum_{s=1}^{S} c_{its} \alpha_{sk}^{*} +
\sum_{j=1}^{D_{it}} r_{ijtk} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\theta})_{k}$}
$q(\boldsymbol{\theta})_{k}$ is a Dirichlet($\boldsymbol{\eta}_k$)
distribution, with typical parameter equal to, \scriptsize
\begin{eqnarray}
\eta_{kw} & = & \lambda_w + \sum_{i=1}^{n} \sum_{t=2005}^{2007}
\sum_{j=1}^{D_{it}}r_{itjk}y_{itw} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\beta} )$}
$q(\boldsymbol{\beta} )$ is a Dirichlet$(\boldsymbol{\phi})$
distribution, with typical parameter $\phi_s$ equal to,\scriptsize
\begin{eqnarray}
\phi_s & = & 1 + \sum_{i=1}^{n} \sum_{t=2005}^{2007} c_{its}
\nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Completing $q(\boldsymbol{\sigma})_{it}$ and
$q(\boldsymbol{\tau})_{ijt}$}
Finishing $q(\boldsymbol{\sigma})_{it}$:
\begin{itemize}
\item[-] $\text{E}[\log \beta_s] = \Psi(\phi_s) -
\Psi(\sum_{z=1}^{S}\phi_{z})$ where $\Psi(\cdot)$ is the digamma
function (the derivative of the gamma function)
\item[-] $\text{E}[\log
\pi_{itk}] =\Psi(\gamma_{itk}) - \Psi(\sum_{z=1}^{K} \gamma_{itz})$
\end{itemize}
Finishing $q(\boldsymbol{\tau})_{ijt}$
\begin{itemize}
\item[-] $\text{E}[\log \theta_{kw}] =
\Psi(\eta_{kw} ) - \Psi(\sum_{z=1}^{w} \eta_{kz} ) $.
\end{itemize}
\end{frame}
\begin{frame}
\frametitle{Update Steps for $\boldsymbol{\alpha}_{s}$
}(Newton-Raphson, Minka 2000)
\begin{itemize}
\item[-] Define
$N_{s} = \sum_{i=1}^{n} \sum_{t=2005}^{2007} c_{its}$.
\end{itemize}
Differentiating with respect to $\alpha_{ks}$ shows that \scriptsize
\begin{eqnarray}
\frac{\partial \log
q(\boldsymbol{\alpha})_{k}^{\text{new}}}{\partial \alpha_{ks} } & =
& - \frac{1}{\lambda} + N_{s} \Psi(\sum_{k=1}^{K} \alpha_{ks} ) -
N_{s} \Psi(\alpha_{ks}) + \sum_{i=1}^{n} \sum_{t=2005}^{2007}
c_{its} \frac{\left(\Psi(\gamma_{itk}) - \Psi(\sum_{z=1}^{K}
\gamma_{itz} ) \right)}{N{s}} \nonumber
\end{eqnarray}
\normalsize
\begin{itemize}
\item[-] Call Gradient $\frac{\partial \log
q(\boldsymbol{\alpha})_{k}^{\text{new}}}{\partial
\boldsymbol{\alpha}_k}$.
\item[-] Define $\boldsymbol{\text{H}}$ as the Hessian (matrix of second
derivatives).
\item[-] Diagonal element $h_{jj} = N_{s}
\Psi^{'} (\sum_{k=1}^{K} \alpha_{ks} ) - N_{s} \Psi^{'}
(\alpha_{js} ) $ where $\Psi^{'} (\cdot)$ is the trigamma function
\item[-] Off-diagonal element ($a \neq b$)
$h_{ab} = N_{z} \Psi^{'} (\sum_{k=1}^{K} \alpha_{ks})$.
\end{itemize}
For each $s$
we iterate,
\scriptsize
\begin{eqnarray}
\boldsymbol{\alpha}_{s}^{\text{new}} & = &
\boldsymbol{\alpha}^{\text{old}}_{s} -
\boldsymbol{\text{H}}^{-1}\frac{\partial \log
q(\boldsymbol{\alpha})_{k}^{\text{new}}}{\partial
\boldsymbol{\alpha}_k} \nonumber
\end{eqnarray}
\normalsize until convergence
\end{frame}
\begin{frame}
%\tiny
%\begin{table}[hbt!]
%\caption{Pseudo Code for Variational Approximation}\label{code}
\footnotesize
% \framebox[6.35in]{
\begin{tabular}{l}
Initialize $\boldsymbol{\gamma}_{it}^{\text{old}}$ (for all $i$ and
$t$), $\boldsymbol{\eta}_k^{\text{old}}$ (for all $k$),
$\boldsymbol{\phi}^{\text{old}}$,
$\boldsymbol{\alpha}_s^{\text{old}}$ (for all $s$). \\
Do until convergence in lower-bound. \\
- \indent for all $i$, $t$, $j$ and $k$, set \\
$ r_{ijtk}^{\text{new}} \propto \exp\left(
\Psi(\gamma_{itk}^{\text{old}}) - \Psi(\sum_{z=1}^{K}
\gamma_{itz}^{\text{old}}) + \sum_{w=1}^{W}y_{ijtw} \left[
\Psi(\eta_{kw}^{\text{old}} ) - \Psi(\sum_{z=1}^{W}\eta_{kz}^{\text{old}} )\right] \right)$ \\
-\indent for all $i$,$t$, and $s$ set \\
$ c_{its}^{\text{new}} \propto \exp(\Psi(\phi_s^{\text{old}}) -
\Psi(\sum_{z=1}^{S}\phi_s^{\text{old}}) + \log \Gamma(\sum_{k=1}^{K}
\alpha_{ks}^{\text{old}} ) -
\sum_{k=1}^{K} \log \Gamma (\alpha_{ks}^{\text{old}} )$ \\
\hspace{2in}$+ \sum_{k=1}^{K} (\alpha_{ks}^{\text{old}}-1)[\Psi(\gamma_{itk}^{\text{old}}) - \Psi(\sum_{z=1}^{K} \gamma_{itz}^{\text{old}})] )$ \\
- \indent for all $i$, $t$ , and $k$ set \\
$\gamma_{itk}^{\text{new}} = \sum_{s=1}^{S}c_{its}^{\text{new}}\alpha_{ks}^{\text{old}} + \sum_{j=1}^{D_{it}} r_{ijtk}^{\text{new}} $\\
- \indent for all $k$ and $w$ set \\
$\eta_{kw}^{\text{new}} = \lambda_w +
\sum_{i=1}^{n}\sum_{t=2005}^{2007}
\sum_{j=1}^{D_{it}} r_{ijtk}^{\text{new}} y_{ijtw}$ \\
-\indent for all $s$ set \\
$\phi_s^{\text{new}} = 1 + \sum_{i=1}^{n} \sum_{t=2005}^{2007} c_{its}^{\text{new}}$\\
- For all $s$ obtain $\boldsymbol{\alpha}_s^{\text{new}}$ using Newton-Raphson algorithm. \\
- Evaluate lower-bound. \\
If converged:\\
Return posterior approximation.
\end{tabular}%}
%\end{table}
\end{frame}
\begin{frame}
$</$ Variational Approximation $>$
\end{frame}
\begin{frame}
$<$ Model Selection $>$
\end{frame}
\begin{frame}
\frametitle{Number of Topics}
\begin{enumerate}
\item[1)] Substantive search (about 40-50)
\item[2)] 10-fold cross-validation. Loss function, approximate predictive
posterior
\begin{eqnarray}
p(\hat{\boldsymbol{y}}| \boldsymbol{Y}) & \approx &
\sum_{\widehat{\boldsymbol{\tau}}} \iint p(\hat{\boldsymbol{y}}|
\hat{\boldsymbol{\tau}}, \boldsymbol{\theta})
p(\hat{\boldsymbol{\tau}}|\boldsymbol{\pi})
q(\boldsymbol{\theta}|\boldsymbol{\eta}) q(\boldsymbol{\pi})
d\boldsymbol{\theta} d\boldsymbol{\pi} \nonumber
\end{eqnarray}
\item[3)] Convergence with Nonparametric Bayesian model (Dirichlet
process prior)
\end{enumerate}
\Large All converge on about 44 topics
\end{frame}
\begin{frame}
\frametitle{Number of Styles}
BIC $= 2 \log p(\boldsymbol{Y})$
\begin{itemize}
\item[1)] BIC $\approx 2 (\mathcal{L}(q) + \log K! + \log S!) - (K \times
S)(n)$
\item[2)] BIC $ \approx 2 \log p(\boldsymbol{Y}|\bar{\boldsymbol{\pi}},\bar{\theta},\bar{\boldsymbol{\tau}} ) - (K \times
S)(n)$
\end{itemize}
\end{frame}
\begin{frame}
$</$ Model Selection $>$
\end{frame}
\begin{frame}
Hierarchy of Topics
\end{frame}
\begin{frame}
\frametitle{Posterior Distribution}
\begin{tiny}
\begin{eqnarray}
p(\boldsymbol{\alpha}, \boldsymbol{\pi}, \boldsymbol{\eta} , \boldsymbol{\beta}, \boldsymbol{\sigma}, \boldsymbol{\mu}, \boldsymbol{\tau}| \boldsymbol{X} ) & \propto & \prod_{m=1}^{M} c(\kappa) \exp\left(\kappa \boldsymbol{\eta}_{m}^{'} \boldsymbol{\frac{1}{\sqrt{J}}} \right) \times \prod_{m=1}^{M} \prod_{k=1}^{K} \left[\beta_{m} c(\kappa) \exp\left(\kappa \boldsymbol{\mu}_{k}^{'} \boldsymbol{\eta}_{m} \right) \right ]^{\sigma_{mk}} \prod_{k=1}^{K} \exp(-\alpha_{k} ) \times \nonumber \\
&& \prod_{i=1}^{48} \left[\frac{\Gamma (\sum_{k=1}^{K} \alpha_{k} )}{\prod_{k=1}^{K} (\alpha_{k} ) } \prod_{k=1}^{K} \pi_{ik}^{\alpha_{k}-1} \times \prod_{j=1}^{D_{i}} \prod_{k=1}^{K} \left[\pi_{ik} c(\kappa) \exp(\kappa \boldsymbol{x}^{*}_{ij} \boldsymbol{\mu}_{k} \right]^{\tau_{ijk} } \right] \label{e:post}
\end{eqnarray}
\end{tiny}
Which we approximate with:
\begin{tiny}
\begin{eqnarray}
q(\boldsymbol{\alpha}, \boldsymbol{\pi}, \boldsymbol{\eta} , \boldsymbol{\beta}, \boldsymbol{\sigma}, \boldsymbol{\mu}, \boldsymbol{\tau}) & = & q(\boldsymbol{\alpha}) q(\boldsymbol{\pi}) q(\boldsymbol{\eta} ) q(\boldsymbol{\beta}) q(\boldsymbol{\sigma}) q(\boldsymbol{\mu}) q(\boldsymbol{\tau}) \label{e:approx} \\
& = & q(\boldsymbol{\alpha}) \prod_{i=1}^{48} q(\boldsymbol{\pi})_{i} \prod_{m=1}^{M}q(\boldsymbol{\eta} )_{m} q(\boldsymbol{\beta}) \prod_{k=1}^{K} q(\boldsymbol{\sigma})_{k} \prod_{k=1}^{K} q(\boldsymbol{\mu})_{k} \prod_{i=1}^{48}\prod_{j=1}^{D_{i}} q(\boldsymbol{\tau})_{ij} \nonumber
\end{eqnarray}
\end{tiny}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\sigma})_{k}$}
$q(\boldsymbol{\sigma})_{k}$ is a Multinomial(1, $\boldsymbol{c}_{k}$ ) where typical element $c_{mk}$ is equal to
\begin{eqnarray}
c_{mk} & \propto & \exp\left(\text{E}[\log \beta_{m} ] +\text{E}[ \kappa \boldsymbol{\mu}_{k} \boldsymbol{\eta}_{m} ] \right). \nonumber
\end{eqnarray}
We will complete the update step when we have determined the remaining forms of the distribution
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\tau})_{ij}$}
$q(\boldsymbol{\tau})_{ij}$ is a Multinomial(1, $\boldsymbol{r}_{ij}$, with typical element of $r_{ijk}$ equal to
\begin{eqnarray}
r_{ijk} & \propto & \exp\left(\text{E}[\log \pi_{ik} ] + \text{E}[\kappa \boldsymbol{y}^{*}_{ij} \boldsymbol{\mu}_{k}] \right) \nonumber
\end{eqnarray}
Again, as we complete the parametric forms of the other update steps we can complete this update equation.
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\pi})_{i}$ }
$q(\boldsymbol{\pi})_{i}$ is a Dirichlet$(\boldsymbol{\gamma}_{i})$ distribution, where typical element $\gamma_{ik}$ is equal to
\begin{eqnarray}
\gamma_{ik} & = & \alpha_{k} + \sum_{j=1}^{D_{i}}r_{ijk} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\beta})$}
$q(\boldsymbol{\beta})$ is a Dirichlet($\boldsymbol{\phi}$) distribution with typical parameter $\phi_{m}$ equal to
\begin{eqnarray}
\phi_{m} & = & 1 + \sum_{k=1}^{K} c_{mk} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\eta})_{m}$ }
Given the complications of taking expectations with the vMF distribution, we instead provide maximization steps for the vMF parameters. To obtain the form of the updates we follow the derivation outlined in Banerjee et al (2005). To do this, we take the log of the posterior distribution and identify the parameters that depend upon $\boldsymbol{\eta}_{m}$.
\begin{eqnarray}
\log(p(\boldsymbol{\eta}_{m} ) & = & \sum_{k=1}^{K} c_{km} \kappa \boldsymbol{\mu}_{k} \boldsymbol{\eta}_{m} + \kappa \boldsymbol{\eta}_{m}\boldsymbol{\frac{1}{\sqrt{J}}} + \text{constants} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\eta})_{m}$ }
To set up the constrained optimization we also introduce the Langragian $\lambda$, with the constraint that $\boldsymbol{\eta}_{m}^{'} \boldsymbol{\eta}_{m}$ = 1,
\begin{eqnarray}
\log(p(\boldsymbol{\eta}_{m} ) & \propto & \sum_{k=1}^{K} c_{km} \kappa \boldsymbol{\mu}_{k} \boldsymbol{\eta}_{m} + \kappa \boldsymbol{\eta}_{m}\boldsymbol{\frac{1}{\sqrt{J}}} - \lambda(\boldsymbol{\eta}_{m}^{'} \boldsymbol{\eta}_{m} - 1). \nonumber
\end{eqnarray}
Differentiating with respect to $\boldsymbol{\eta}_{m}$, setting equal to zero and solving yields
\begin{eqnarray}
\frac{\kappa \left(\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}} \right) }{2 \lambda } & = & \boldsymbol{\eta}_{m} \label{e:Start}
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\eta})_{m}$ }
If we differentiate with respect to $\lambda$ and solve we see that $\boldsymbol{\eta}_{m}^{'} \boldsymbol{\eta}_{m} = 1$ or that $||\boldsymbol{\eta}_{m}^{'} \boldsymbol{\eta}_{m}|| =1$. Substituting this into Equation \ref{e:Start} we have,
\begin{eqnarray}
\frac{\kappa}{2 \lambda} \left( \left(\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}} \right)^{'} \left(\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}} \right) \right)^{1/2} & = & 1 \nonumber \\
\frac{\kappa ||\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}} || }{2} & = & \lambda \nonumber
\end{eqnarray}
Doing a final substitution we have
\begin{eqnarray}
\boldsymbol{\eta}^{*}_{m} & = & \frac{\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}}}{||\sum_{k=1}^{K} c_{mk} \boldsymbol{\mu}_{k} + \boldsymbol{\frac{1}{\sqrt{J}}}||} \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Update for $q(\boldsymbol{\mu})_{k}$ }
Following a very similar set of derivations, the update step for $\boldsymbol{\mu}_{k}$ is
\begin{eqnarray}
\boldsymbol{\mu}_{k}^{*} & = & \frac{ \sum_{i=1}^{48}\sum_{j=1}^{D_{i}} r_{ijk} \boldsymbol{x}_{ij}^{*} + \sum_{m=1}^{M} c_{mk} \boldsymbol{\eta}^{*}_{m} }{||\sum_{i=1}^{48}\sum_{j=1}^{D_{i}} r_{ijk} \boldsymbol{x}_{ij}^{*} + \sum_{m=1}^{M} c_{mk} \boldsymbol{\eta}^{*}_{m}|| } \nonumber
\end{eqnarray}
\end{frame}
\begin{frame}
\frametitle{Completing updates for $q(\boldsymbol{\sigma})_{k}$ and $q(\boldsymbol{\tau})_{ij}$}
Given the forms E$[\log \beta_{m} ] = \Psi(\phi_{m} ) - \Psi(\sum_{m=1}^{M} \phi_{m} ) $ and E$[\log \pi_{ik} ] = \Psi(\gamma_{ik} ) - \Psi(\sum_{k=1}^{K} \gamma_{ik} ) $ where $\Psi(\cdot)$ is the Digamma function.
\end{frame}
\begin{frame}
\frametitle{Update for q$(\boldsymbol{\alpha})$}
A closed form update for the $\boldsymbol{\alpha}$ parameters is unavailable. So we use the Newton-Raphson algorithm outlined in Minka (2000) and Blei, Ng, and Jordan (2003).
\end{frame}
\end{document} |
https://melusine.eu.org/syracuse/B/BaseCollege/Sixieme/demo/notion/exo3.tex?enregistrement=ok | eu.org | CC-MAIN-2022-49 | application/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-49/segments/1669446710777.20/warc/CC-MAIN-20221130225142-20221201015142-00532.warc.gz | 432,668,582 | 1,146 | %@metapost:604quadri.mp
%@Dif:2
Les figures ci-dessous ont été réalisées à main levée ; chaque dessin montre les quatre côtés d'un quadrilatère, et, pour certains d'entre eux, les diagonales. Certaines informations ont été portées sur les dessins sous forme codée.
\par
\begin{center}
\begin{tabular}{|c|c|c|c|}
\hline
\multicolumn{1}{|l|}{\pscirclebox{A}}&\multicolumn{1}{l|}{\pscirclebox{B}}&\multicolumn{1}{l|}{\pscirclebox{C}}&\multicolumn{1}{l|}{\pscirclebox{D}}\\
\includegraphics{604quadri.1}&\includegraphics{604quadri.2}&\includegraphics{604quadri.3}&\includegraphics{604quadri.4}\\
\hline
\end{tabular}
\end{center}
\begin{myenumerate}
\item Pour chaque figure, donne les informations qu'elle contient.
\item Pour chaque figure, trace, aux instruments, un quadrilatère qui respecte les informations.
\end{myenumerate}
%@Commentaire: Travail sur la liaison figure-texte. Intérêt de la figure à main levée. |
https://ctan.math.washington.edu/tex-archive/info/examples/Tabellen2/02-14-7.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656104542759.82/warc/CC-MAIN-20220705083545-20220705113545-00411.warc.gz | 229,723,594 | 1,100 | %%
%% A DANTE-Edition example
%%
%% Beispiel 02-14-7 auf Seite 77.
%%
%% 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{355.65944pt}
\setlength\parindent{0pt}
\usepackage{spreadtab}
\begin{document}
\begin{spreadtab}{{tabular}{r | ccc}}\hline
@ $x$-Werte & -1 & 0 \SThidecol & 2 & 3 \\\hline
@ $f(x)=2\cdot x-1$ & 2*[0,-1]-1& 2*[0,-1]-1 & 2*[0,-1]-1 & 2*[0,-1]-1\\
@ $g(x)=x-10$\SThiderow& [0,-2]-10 & [0,-2]-10 & [0,-2]-10 & [0,-2]-10 \\
@ $h(x)=1-x$ & 1-[0,-3] & 1-[0,-3] & 1-[0,-3] & 1-[0,-3] \\\hline
\end{spreadtab}
\end{document}
|
http://michaelpuff.de/Latex/Vorlagen/Briefpapier.tex | michaelpuff.de | CC-MAIN-2021-49 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-49/segments/1637964363290.59/warc/CC-MAIN-20211206072825-20211206102825-00053.warc.gz | 52,954,501 | 999 | \documentclass[pdftex, a4paper, german]{scrlttr2}
\KOMAoptions{%
fromalign=right,%
fromrule=afteraddress,%
fromphone=false,%
fromemail=false,%
fromurl=false,%
foldmarks=off,%
backaddress=false,%
addrfield=false,%
%footsepline=true,
%headsepline=true,
enlargefirstpage=true
}
\usepackage[ngerman]{babel}
\usepackage[T1]{fontenc}
\usepackage[latin1]{inputenc}
% Sans Serif Schrift
\renewcommand{\familydefault}{\sfdefault}
\usepackage{helvet}
% Kopfzeilen
\firsthead {
\begin{flushright}
\textsc{\usekomavar{fromname}}\\
\usekomavar{fromaddress}
\end{flushright}
\hrule
}
\setkomavar{fromname}{Michael Puff}
\setkomavar{fromaddress}{Schulstraße 1\\34246 Vellmar\\Deutschland}
\begin{document}
\begin{letter}
\setkomavar{place}{}
\setkomavar{date}{}
\opening{}
\end{letter}
\end{document} |
http://ctan.imsc.res.in/macros/texinfo/texinfo/doc/txi-cs.tex | imsc.res.in | CC-MAIN-2022-21 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-21/segments/1652663021405.92/warc/CC-MAIN-20220528220030-20220529010030-00387.warc.gz | 12,376,312 | 1,682 | % txi-cs.tex -- Czech translations for texinfo.tex.
%
% Copyright 1999, 2000, 2007, 2008 Free Software Foundation.
%
% Authors:
% Vladimir Michl <[email protected]>
% Stepan Kasal <[email protected]>
%
% 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 3 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, see <http://www.gnu.org/licenses/>.
\txisetlanguage{czech}{2}{3}
\plainfrenchspacing
\gdef\putwordAppendix{Přílohy}
\gdef\putwordChapter{Kapitola}
\gdef\putwordfile{soubor}
\gdef\putwordin{v~knize}
\gdef\putwordIndexIsEmpty{(Rejstřík je prázdný.)}
\gdef\putwordIndexNonexistent{(Rejstřík neexistuje.)}
\gdef\putwordInfo{Info}
\gdef\putwordInstanceVariableof{Proměnná pro instance třídy}
\gdef\putwordMethodon{Metoda třídy}
\gdef\putwordNoTitle{Bez nadpisu}
\gdef\putwordof{třídy}
\global\let\putwordon\putwordof
\gdef\putwordpage{stránka}
\gdef\putwordsection{oddíl}
\gdef\putwordSection{Oddíl}
\gdef\putwordsee{viz}
\gdef\putwordSee{Viz}
\gdef\putwordShortTOC{Stručný obsah}
\gdef\putwordTOC{Obsah}
%
\gdef\putwordMJan{ledna}
\gdef\putwordMFeb{února}
\gdef\putwordMMar{března}
\gdef\putwordMApr{dubna}
\gdef\putwordMMai{května}
\gdef\putwordMJun{června}
\gdef\putwordMJul{července}
\gdef\putwordMAug{srpna}
\gdef\putwordMSep{září}
\gdef\putwordMOct{října}
\gdef\putwordMNov{listopadu}
\gdef\putwordMDec{prosince}
%
\gdef\putwordDefmac{Makro}
\gdef\putwordDefspec{Speciální forma}
\gdef\putwordDefvar{Proměnná}
\gdef\putwordDefopt{Volby}
\gdef\putwordDeffunc{Funkce}
%
% Redefine \today to produce Czech
% preferred dates such as 28. januar 1999.
%
\gdef\today{%
\number\day.\nobreak\space
\ifcase\month
\or\putwordMJan\or\putwordMFeb\or\putwordMMar\or\putwordMApr
\or\putwordMMai\or\putwordMJun\or\putwordMJul\or\putwordMAug
\or\putwordMSep\or\putwordMOct\or\putwordMNov\or\putwordMDec
\fi
\penalty3000\relax\space\number\year}
%
|
https://www.coaps.fsu.edu/bibliography/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%20218%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=10&rowOffset=&wrapResults=1&citeOrder=&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | fsu.edu | CC-MAIN-2023-06 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2023-06/segments/1674764501407.6/warc/CC-MAIN-20230209045525-20230209075525-00407.warc.gz | 728,194,906 | 1,382 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Krishnamurti_etal2013} Krishnamurti, T. N., Stefanova, L., \&, M., V. (2013). \textit{Tropical Meteorology: An Introduction}. Springer.
\end{thebibliography}
\end{document}
|
https://unilab.gbb60166.jp/challenged/tex/menseki07.tex | gbb60166.jp | CC-MAIN-2021-21 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-21/segments/1620243989018.90/warc/CC-MAIN-20210509213453-20210510003453-00252.warc.gz | 641,394,190 | 1,949 | \documentclass[11pt,b4j,landscape,twocolumn]{jsarticle}
\usepackage{ascmac,epic,eepic,b4tate}
% PS形式を経由してPDFを作る場合はこちら
%\usepackage[dvips]{graphicx}
%\DeclareGraphicsRule{.jpg}{eps}{.bb}{`bmeps -c -tjpg #1}
%
% dvioutで印刷する場合はこちら
%\usepackage[dviout]{graphicx}
%
% dvipdfmx の場合はこちら
\usepackage[dvipdfmx]{graphicx}
\textwidth=310mm
\textheight=220mm
\columnseprule=0pt
\topmargin=-25mm
\oddsidemargin=-12mm
\begin{document}
%
% ===========================以下本文===============================
%
\def\namae{%
{\Large\bf 数学プリント（いろいろな面積） \# 7}\hfill
学習日 \hskip3ex 月 \hskip3ex 日
\hfill 年\hskip5ex 組\hskip5ex 号
\hskip30zw
\underline{氏名\rule[-2ex]{0cm}{6ex}\hskip30ex}}
\namae
\vskip3mm
\unitlength=1mm
{\large ■ 平行四辺形の面積}
\bigskip
\unitlength=1mm
\begin{center}
\begin{minipage}[t]{0.42\textwidth}
\begin{shadebox}
\hspace*{25mm}
\begin{picture}(30,20)(0,0)
\thicklines % ←太い線にする命令
\path(0,0)(20,0)(26,18)(6,18)(0,0)
\thinlines
\dashline[80]{0.7}(6,0)(6,18)
\path(6,1)(7,1)(7,0)
%%%\put(-28,17){■ 三角形の面積}
\footnotesize
\put(12,-2){\makebox(0,0){底辺}}
\put(8,7){\makebox(0,0){\shortstack{高\\[-3pt]さ}}}
%%%%%\put(16,6){\makebox(0,0){さ}}
\end{picture}
\hskip0mm
\begin{minipage}[b]{60mm}
\( 平行四辺形の面積=底辺 \times 高さ \)
\bigskip
\end{minipage}
\bigskip
\end{shadebox}
\end{minipage}
\end{center}
\large
\toi 次の平行四辺形の面積を求めなさい。
\vskip1zh
\nidangumi{\subtoi }{\subtoi }
\vspace*{1zh}
\hspace*{3zw}
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(3,0)(4,3)(1,3)(0,0)
\thinlines
\dashline[80]{0.1}(1,0)(1,3)
\footnotesize
\put(1.5,-0.5){\makebox(0,0){4cm}}
\put(1.7,1.2){\makebox(0,0){3cm}}
\end{picture}
\hspace*{60mm}%%%%%%%%%
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(6,0)(9,2)(3,2)(0,0)
\thinlines
\dashline[80]{0.1}(3,0)(3,2)
\footnotesize
\put(3.5,-0.5){\makebox(0,0){6cm}}
\put(3.2,1){\makebox(0,0){2cm}}
\end{picture}
\hfill
\vfill
\nidangumi{\subtoi }{\subtoi }
\vspace*{1zh}
\hspace*{3zw}
\begin{picture}(15,2)(0,10)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(5,0)(6,7)(1,7)(0,0)
\thinlines
\dashline[80]{0.1}(1,0)(1,7)
\footnotesize
\put(2.5,-0.5){\makebox(0,0){5cm}}
\put(1.7,3.5){\makebox(0,0){7cm}}
\end{picture}
\hspace*{60mm}%%%%%%%%%
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(5,0)(3,2)(0,2)(2,0)(5,0)
\thinlines
\dashline[80]{0.1}(3,0)(3,2)
\footnotesize
\put(3.5,-0.5){\makebox(0,0){3cm}}
\put(2.7,1){\makebox(0,0){2cm}}
\end{picture}
\hfill
\vfill
\newpage%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
{\large ■ 台形の面積}
\unitlength=1mm
\begin{center}
\begin{minipage}[t]{0.42\textwidth}
\begin{shadebox}
\hspace*{5mm}
\begin{picture}(30,24)(0,0)
\thicklines % ←太い線にする命令
\path(0,0)(20,0)(17,18)(6,18)(0,0)
\thinlines
\dashline[80]{0.7}(6,0)(6,18)
\path(6,1)(7,1)(7,0)
\footnotesize
\put(12,20){\makebox(0,0){上底}}
\put(12,-2){\makebox(0,0){下底}}
\put(8,7){\makebox(0,0){\shortstack{高\\[-3pt]さ}}}
\end{picture}
\hskip0mm
\begin{minipage}[b]{80mm}
\( 台形の面積=(上底 + 下底) \times 高さ \div 2\)
\bigskip
\end{minipage}
\bigskip
\end{shadebox}
\end{minipage}
\end{center}
\large
\toi 次の台形の面積を求めなさい。
\vskip1zh
\nidangumi{\subtoi }{\subtoi }
\vspace*{1zh}
\hspace*{3zw}
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(8,0)(6.8,2)(2.8,2)(0,0)
\thinlines
\dashline[80]{0.1}(2.8,0)(2.8,2)
\footnotesize
\put(4,-0.5){\makebox(0,0){8cm}}
\put(5,2.5){\makebox(0,0){4cm}}
\put(2.8,1){\makebox(0,0){2cm}}
\end{picture}
\hspace*{60mm}%%%%%%%%%
\begin{picture}(15,2)(0,10)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(10,0)(7.7,6)(5.7,6)(0,0)
\thinlines
\dashline[80]{0.1}(5.7,0)(5.7,6)
\footnotesize
\put(5,-0.5){\makebox(0,0){10cm}}
\put(7,6.5){\makebox(0,0){2cm}}
\put(5.7,3.5){\makebox(0,0){6cm}}
\end{picture}
\hfill
\vfill
\nidangumi{\subtoi }{\subtoi }
\vspace*{1zh}
\hspace*{3zw}
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(7,0)(5,4)(2,4)(0,0)
\thinlines
\dashline[80]{0.1}(2,0)(2,4)
\footnotesize
\put(3.5,-0.5){\makebox(0,0){7cm}}
\put(3.5,4.5){\makebox(0,0){3cm}}
\put(2,2){\makebox(0,0){4cm}}
\end{picture}
\hspace*{60mm}%%%%%%%%%
\begin{picture}(15,2)(0,5)
\unitlength=5mm
\thicklines % ←太い線にする命令
\path(0,0)(5,0)(4,3)(2,3)(0,0)
\thinlines
\dashline[80]{0.1}(2,0)(2,3)
\footnotesize
\put(2.5,-0.5){\makebox(0,0){5cm}}
\put(3,3.5){\makebox(0,0){2cm}}
\put(2,1.2){\makebox(0,0){3cm}}
\end{picture}
\hfill
\vfill
\vspace*{2zh}
\end{document}
|
https://mirror.anarhija.net/ru.theanarchistlibrary.org/mirror/f/ff/feral-favn-anarhistskaya-subkultura.tex | anarhija.net | CC-MAIN-2021-25 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2021-25/segments/1623488249738.50/warc/CC-MAIN-20210620144819-20210620174819-00264.warc.gz | 352,990,491 | 13,657 | \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{russian}
\setmainfont{PTF55F.ttf}[Script=Cyrillic,%
Path=/usr/share/fonts/truetype/paratype/,%
BoldFont=PTF75F.ttf,%
BoldItalicFont=PTF76F.ttf,%
ItalicFont=PTF56F.ttf]
\setmonofont{cmuntt.ttf}[Script=Cyrillic,%
Scale=MatchLowercase,%
Path=/usr/share/fonts/truetype/cmu/,%
BoldFont=cmuntb.ttf,%
BoldItalicFont=cmuntx.ttf,%
ItalicFont=cmunit.ttf]
\setsansfont{PTS55F.ttf}[Script=Cyrillic,%
Scale=MatchLowercase,%
Path=/usr/share/fonts/truetype/paratype/,%
BoldFont=PTS75F.ttf,%
BoldItalicFont=PTS76F.ttf,%
ItalicFont=PTS56F.ttf]
\newfontfamily\russianfont{PTF55F.ttf}[Script=Cyrillic,%
Path=/usr/share/fonts/truetype/paratype/,%
BoldFont=PTF75F.ttf,%
BoldItalicFont=PTF76F.ttf,%
ItalicFont=PTF56F.ttf]
% 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{Анархистская субкультура}
\date{2000}
\author{Ферал Фавн}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Анархистская субкультура},%
pdfauthor={Ферал Фавн},%
pdfsubject={},%
pdfkeywords={инсуррекционизм; На ножах со всем существующим; субкультура}%
}
\begin{document}
\begin{titlepage}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Анархистская субкультура\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Ферал Фавн\par}}%
\vskip 1.5em
\vfill
{\usekomafont{date}{2000\par}}%
\end{center}
\end{titlepage}
\cleardoublepage
\tableofcontents
% start a new right-handed page
\cleardoublepage
\section{1.}
Легко сказать, что анархистского движения в Северной Америке нет. Такое утверждение попросту освобождает тебя от исследования природы этого движения и твоей собственной роли в нём. Однако сеть книжных магазинов, анархистских общежитий, сквотов, публикаций, регулярный встреч и корреспонденций, связанных с антигосударственным и антикапиталистическим проектом, безусловно существует. И эта сеть определяет лицо целой субкультуры — со своими привычками, ритуалами и символами «бунта». Но может ли субкультура создать свободных индивидов, способных овладеть своими жизнями и действительно противостоять обществу? Думаю, анархистская субкультура оказалась в этом смысле бессильной. Стоит поговорить об этом подробнее.
Анархистская субкультура, несомненно, включает в себя разные формы активизма, исторические исследования, социальный анализ (теорию), креативную игру и опыты самоосвобождения. Но всё это существует не как глубокая практика, направленная на осознание общества и создание свободных жизней, а как ролевая социоактивность, цель которой — поддерживать себя и свою субкультуру, без которой индивиды как бы перестают существовать.
Толерантные и традиционные активисты определяют лицо анархистской субкультуры. Они отрицают необходимость радикального социального анализа, словно все темы уже раз и навсегда определены левыми либералами: феминизм, анти-расизм, борьба за права животных, геевское освобождение, экология, социализм, антимилитаризм\dots{} Добавьте сюда щепотку антигосударственности — вот вам и анархистская каша! Чтобы утвердить свой авторитет, эти активисты громче всех кричат на демонстрациях, практикуют сожжение разных флагов и призывают к атакам на полицию и фашистов. Они и не помышляют об анализе собственной позиции, которая в реальности сводится к роли лояльной оппозиции и поддерживает общий спектакль капитала. Эти люди воображают, что они являются частью массового движения сопротивления. Но на американском континенте нет никакого массового движения, нет организованного бунта, так что деятельность данных активистов — всего лишь повторение старых ритуалов и укрепление собственных позиций в субкультуре.
Что касается анархистских историков, то они по большей части являются профессорами, издателями и владельцами книжных магазинов, чей главный интерес — распространять информацию об истории анархизма. Многие из этих людей имеют добрые намерения, но никто из них не способен приложить настоящий критический анализ к своим исследованиям. Большинство анархистских исторических материалов служит созданию мифов, культу героев и конструированию моделей, которые нужно имитировать. Но все эти модели несостоятельны, а «герои», как известно, жили в истории и соответствовали конкретным историческим ситуациям, которых больше нет. Так анархистская история становится тем же, что и официальная история — сотворением мифа, который поддерживает существующие структуры (общество и субкультуру). Отдельные антиавторитарные теоретики разоблачили в своих книгах базовые институции современного общества и показали их роль в нашем одомашнивании. Некоторые из этих писателей решили отказаться от ярлыка «анархист», хотя их личные связи с субкультурой не прекратились. Однако несмотря на точность их критики, а также персональную практику мелкого воровства и отказа от работы, они остались «теоретиками», то есть сохранили ролевую функцию в субкультуре (и в более широком контексте). Не становясь орудием активного бунта, их мышление всего лишь выражает интеллектуальный край анархистского дискурса. Таким образом, ролевая модель интеллектуала воспроизводится в субкультуре, как и другие роли.
Креативная игра также оказалась специализирована внутри анархистского сообщества. Игнорируя критику, направленную на преодолении искусства (через спонтанную и свободную игру всех), различные mail-artists, «анти-художники», перформансисты захватывают область игры, разрушая спонтанность и свободу, и рассматривают свою деятельность как «альтернативное искусство».
Отдельные их мероприятия (фестивали, поэтические чтения, импровизированные jam sessions и «интерактивный театр») могут доставить удовольствие, но, поставленные в рамки искусства, теряют всякий подрывной потенциал. Вообще эти деятели считают, что «творчество» важнее атаки и удовольствия. Тем самым они возвращаются в лоно традиционного искусства и искусства институций. Их работа становится своего рода «продуктивистским трудом» по созданию произведений искусства. Игра превращается в спектакль. Игнорируя тот факт, что искусство — социальная и культурная категория, анархистские художники заявляют, что «искусство противостоит культуре», «искусство освобождает» и т. п. В конечном итоге, они конструируют для себя роль культурных деятелей внутри анархистского собщества. Их деятельность никому не угрожает и ничему не мешает.
Когда ситуационисты объявили, что революционная практика должна стать терапевтической процедурой, они и не подозревали, что некоторые американские анархисты найдут способ связать эту мысль с некоторыми другими плохо переваренными идеями и назвать свою мешанину «new age психотерапией». Эта последняя вошла в анархистскую субкультуру в основном через феминистское и геевское движения. Главная претензия названной практики — самооткрытие и самоосвобождение. Но все без исключения психотерапии — включая гуманистическую, «восточную» и так называемую «третью силу» — придуманы специально для интеграции людей в общество. Когда геи и феминистки начали использовать терапевтические техники, это помогло поместить индивидов в «общую рамку» социума, то есть умиротворить и нормализовать их. Анархо-терапевты усвоили практики, подобные медитации, игровой терапии, «группам поддержки» и т. п. Но что такое медитация? Не более, чем форма эскапизма (без урона, наносимого алкоголем или наркотиками). Она частично снимает ежедневные стрессы, уменьшая невыносимость жизни. Это может быть полезным, но отнюдь не самоосвобождающим. Игра как терапия, так же, как игра как искусство, теряет свой подрывной стержень. Она создает атмосферу безопасности, но не самооткрытия. В общем и целом, все терапевтические практики вырывают индивидов из их ежедневного опыта и помещают в отдельное «терапевтическое» пространство, и тем самым — в определённую социальную и идеологическую рамку. В случае анархо-терапевтов это опять-таки рамка анархистской субкультуры и ещё одной ролевой модели. Большинство людей, которых я встречал в анархистской субкультуре, искренние люди. Они действительно желают бунтовать против власти (авторитета) и мечтают разрушить порядок боссов. Но они — продукты данного общества, их научили не доверять себе и своим желаниям, бояться всего неизвестного. Обнаружив субкультуру ( с более или менее стабильными ролями, которые можно постоянно воспроизводить), они убеждают себя, что достигли земли бунтовщиков и что здесь можно расположиться вполне комфортабельно. Куда сложнее, однако, совершить настоящий прыжок в неизвестное — в области, где начинается реальная война против общества.
\section{2.}
Структура анархистской субкультуры в основном организована вокруг печатных проектов, книжных магазинов, коллективного существования и анархистского активизма. Эти проекты и сам метод, по которому они реализуются, напоминают практику евангелических религиозных сект.
Большая часть проектов ведётся коллективно, на основе консенсуального решения проблем. В других случаях проекты разрабатываются отдельными индивидами, которым помогают друзья. Я приберегу прицельную критику консенсуса для другой статьи. Пока же достаточно указать, что процедура консенсуса требует подчинения индивида ( и его воли) группе. Начинается с того, что индивид обязан приспособиться к периодичности и регламенту встреч и обсуждений, а также к ритуалу принятия решений. Это уже имеет косервативный характер, поскольку создаёт правила, которые могут быть изменены, только если все с этим согласны. Так создаётся невидимый авторитет, довлеющий над индивидами. Имя его — «коллективность». Многие анархисты живут отдельно или с любовниками. Другие отдают предпочтение коллективной жизни (иногда по той простой и наименее иллюзорной причине, что это облегчает финансовое бремя). Некоторые организуют «группы жизненной поддержки», заявляя, что таким образом проще «претворить теорию в практику». Коллективная жизнь, конечно, может упростить осуществление общего проекта. Но она может также превратить проект в идеологическое очковтирательство и самообман. Групповые ситуации часто ведут к созданию социальных ролей и блокируют индивидуальную критику. Большинство анархистов считает, что есть известные принципы, которые должны определять отношения между людьми. В сквотах и общежитиях эти принципы навязываются в качестве нормы. Так групповая жизнь перестаёт быть исследованием неизвестного и превращается в ещё одну структуру подчинения индивида готовой социальной идеологии. Группы перестают быть вызовом обществу (за исключением, пожалуй, сквотов, которые хотя бы угрожают безраздельной власти домовладельцев) и становятся безобидным привеском к господствующей системе. Разнообразные печатные проекты (включая периодические издания) и книжные магазины — главные поставщики истории, теории и информации в анархистской субкультуре. Так или иначе все эти проекты включены в капиталистический механизм и редко могут претендовать на подлинную автономность или революционность. И вряд ли есть что-то анархистское в бесконечных тоскливых посиделках и обсуждениях, как успешнее вести маленький бизнес, как оформить тот или иной журнал, как получше напечатать брошюру. Но что ещё хуже, эти издания чаще всего оказываются средством сужения мышления индивидов, а вовсе не предложением новых идей и практик. Большинство анархистских публикаций — некритические переиздания старых текстов, активистская информация, левацкие сплетни, бесконечное повторение устаревших концептов. И даже те статьи и книги, которые так или иначе представляют собой вызов, редко становятся предметом критической дискуссии. Наоборот, они воспринимаются как ещё один стандарт, модель, которой стоит подражать или от которой следует бездумно отказаться. Многие читатели не различают за печатным словом подвижность мысли или полемическое начало, но воспринимает текст как нечто святое или кощунственное, что нужно осквернить или на что нужно молиться. В обоих случаях идеи овеществляются, то есть становятся товарами на рынке идей.
Другой аспект анархистских публикаций — пропаганда. Эта (рекламная) сторона анархистской субкультуры неопровержимо свидетельствует, что анархизм для многих является товаром на идеологическом рынке. Цель пропаганды — создать привлекательный образ анархизма, чтобы привлечь новых адептов. Многое из этой литературы попросту убаюкивает сознание людей, внушая им, что анархия не так уж экстремальна, что она не разрушит общество, что она безопасна, что в ней нет вызова. И поскольку эти публикации обычно покупают (или воруют) сами же анархисты, создаётся впечатление, что они сами себя успокаивают и всеми силами стараются сохранить субкультуру.
Активизм — ещё один аспект всего этого. Что он означает? Прежде всего участие в левацких демонстрациях, хотя время от времени анархисты организуют свои собственные шествия, посвящённые конкретным темам. Главный мотив демонстраций — привлечение новых кадров. Анархисты должны организовать себя как легко различимую группу, привлекательную для новичков. Прежде всего нужно заинтересовать молодёжь, в частности, панков. Для этого необходимо как можно больше шуметь и вообще показывать, что анархисты — крутые люди.
Многие анархисты участвуют в демонстрациях, потому что это — «правильный анархистский поступок». По мнению таких активистов, «анархист» — это роль, включающая специфическую социальную деятельность и особое поведение. «Анархист» — вариант левака, шумный, иногда агрессивный, иногда высокомерно-замкнутый, подчас развязный, но всегда убеждённый в необходимости демонстраций. Такова внешняя личина. Скрывается ли за ней бунт и анархия? Проблема заключается в том, что чаще всего демонстрации не имеют с бунтом ничего общего. И вообще: анархия и бунт не входят в ежедневную жизнь анархистов, а это — ложь и капитуляция.
Хотя некоторые из рассмотренных структур (прежде всего связанные с публикациями) обладают потенциалом анархистского вызова, субкультура больше озабочена самовоспроизводством, чем подрывом общества или атакой на него. Субкультура предлагает индивидам «убежища» и «ниши», где они могут чувствовать себя в относительной безопасности, но где невозможно познать риск и приключение. Так, называя себя бунтовщиками, анархисты бегут от бунта в своё гетто. Анархистская субкультура убивает анархию, превращая её в товар, в болтовню, в спектакль, в ещё один клапан общественного механизма.
\section{3.}
Однако нельзя забывать, что главная особенность анархистской субкультуры — это то, что она «субкультура». Субкультуры представляют собой определённый социальный феномен со специфическими характеристиками. Если бы эти характеристики вели к бунту, если бы они понуждали людей к действию, то можно было бы надеяться на измение анархистской субкультуры, на придание ей революционных черт, на исправление ошибок. Однако все общие характеристики субкультуры указывают на то, что она в принципе не может иметь ничего общего с революцией и бунтом. В истории существовало много субкультур, и все они оказались захваченными властью. Это ясно показывает, что есть нечто в любой субкультуре, что мешает ей стать подлинным вызовом обществу.
Очевидно, что субкультура не является официальным или легальным единством. Вместе с тем существуют негласные законы и принципы, организующию всякую субкультуру. Это — общие ценности и идеалы, привычки и отношения, разделяемые всеми участниками субкультуры. Таким образом, пребывание в субкультуре требует согласия. Это, конечно, не исключает разногласий в интерпретации отдельных принципов — и такие разногласия возникают довольно часто. Люди трактуют ценности и идеалы по-разному, и это нормально. Но индивид, начисто отказывающийся принять «законы» (систему ценностей и отношений) субкультуры, оказывается для неё подлинной угрозой. Его отлучают. Он — опасен и аморален; его нужно изгнать, приговорить к молчанию. Он (вольно или невольно) обнаруживает, что субкультура держится на морали. Это то, что позволяет ей ощущать своё превосходство над обществом. Но тем самым субкультура создаёт модус отношения к другим — оперируя понятиями вины и правоты, то есть по примеру любой власти. Именно власть всегда и везде правит с помощью двух орудий — вины и правоты: я (власть) права, а вы (непокорные) виновны. Для существования субкультуры, таким образом, необходим авторитет.
Логика «законов» подразумевает нетерпимость по отношению к тем, кто не признаёт или восстаёт против них. Та же логика ведёт к снисходительности и терпимости ко всем, кто является частью субкультуры (даже если это последние конформисты и проходимцы). Из-за расхождений в интерпретации «законов» возможны споры и драки, однако — в рамках и под контролем. Всё для поддержания субкультуры! Никаких эксцессов! В результате конфликты сводятся к пошлости. Радикальность и экстремизм дозволяются только в малых дозах и лишь когда они пусты, то есть не угрожают субкультуре. Коммуникация одобряется до тех пор, пока она не раскаляет страсти (исключая стилизованную страсть, одобряемую субкультурой). Такт, осторожность, вежливость — нормы, ведь они поддерживуют «единство в разнообразии». Столкновения ритуализируются и ставятся в скобки. В субкультуре нет места для честных и страстных конфликтов, лицом к лицу. Индивидуальные вспышки подавляются во имя социальной гармонии, во славу консенсуса. Основа анархистской субкультуры — банальная идеализация анархии. Превознося модели прошлого (Испанскую революцию, деятельность Малатесты, Махно и т. п.), хранители субкультуры понимают анархию как идеальное общество будущего, способное решить все сущностные проблемы. Она становится Евангелием, слово которого покоряет и объединяет людей, а иногда и Богом, который требует жертв. Идеализированная анархия утрачивает все связи с реальностью и делается средством принуждения к толерантности, согласию и нормальности, гарантируя поддержку субкультуры.
Анархистская субкультура существует только потому, что она изымает анархию и бунт из области ежедневной жизни, превращая их в абстактные сущности. Субкультура превозносит «спонтанность», в то же время подавляя её. Свободное выражение чувств и желаний не одобряется. Любое новое исследование или эксперимент воспринимаются как угроза. Это объясняет абсурдные защитные реакции анархистов на некоторые дерзкие теоретические построения, которые именно из-за подобных реакций остаются теорией без практики. Субкультура — место капитуляции, сдачи, разоружения, безопасности, сохранности, где можно найти социальную роль и построить систему отношений, но где невозможно свободное исследование и поиск неизвестного.
Из всего этого следует, что анархистская субкультура не имеет ничего общего с проживаемой анархией и действительным восстанием, но является общественным способом мистифицировать и ограничивать бунт. Дети этого общества, мы все изощряемся в недоверии друг к другу, в страхе перед лицом неведомого, в предпочтении безопасности свободе. Поэтому неудивительно, что мы легко включаемся в проекты и акции, поддерживающие субкультуру. Но пора признаться, что это — наш способ приспособиться к обществу, которое мы якобы ненавидим. Субкультура — не повстанческий лагерь, но лояльная оппозиция, «законы» которой (как и все законы) утверждают необходимость общества.
Итак, пришло время послать осторожность к чёрту, похерить, как сказали бы сюрреалисты, все правила и законы, выйти за пределы субкультуры, а затем — разрушить и уничтожить её. Всегда найдутся люди, желающие построить что-нибудь на её месте, но вопрос заключается как раз в том, что на её месте ничего не нужно строить. Нам не нужен авторитет в наших мозгах, нам не нужен порядок, неписанные правила и табу, нам не нужен закон. Мы хотим расстаться с нашим страхом, заставляющим нас отказываться от неизвестного и превращающим бунт в видимость бунта. Мы хотим убить этот страх.
Без поддержки субкультуры мы останемся ни с чем — только с самими собой. И тогда мы — смертные, движущиеся к свободе, страстные индивиды, каждый из которых — единственное основание для созидания собственной жизни и отказа от общества — осуществим себя. Бунт перестанет быть ролью и превратится в ежеминутную борьбу против ограбления наших жизней. Анархия не будет больше идеалом, но станет атакой на власть. Первый шаг к этой новой реальности — перестать мыслить как жертвы и начать действовать как созидатели мира. Нерешительность и паранойя, пронизывающие наши отношения, должны быть отринуты, мы обязаны осознать нашу силу и увидеть скрытую слабость общества, против которого мы сражаемся. Мир откроется нам во всей своей красоте и радости. Мы научимся смотреть в лицо неизвестному, говорить друг с другом открыто, не бояться конфликтов. Мы сможем противостоять обществу самой силой наших желаний, смеха и жажды жизни. Мы откажемся от надёжных ответов и систем, мы разрушим безопасные тюрьмы, в которых мы сами себя похоронили, и предпочтём свободу, странствие, постижение, открытие. Но всё это будет возможно лишь тогда, когда мы разрушим субкультуру, которая связывает нас. Мы должны научиться рисковать.
% 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}
Библиотека Анархизма
\smallskip
Антикопирайт
\bigskip
\includegraphics[width=0.25\textwidth]{logo-en}
\bigskip
\end{center}
\strut
\vfill
\begin{center}
Ферал Фавн
Анархистская субкультура
2000
\bigskip
Сохранено 12 сентября 2011 с ресурса Бакуниста: \href{http://bakunista.nadir.org/index.php?option=com\_content\&task=view\&id=82\&Itemid=41}{bakunista.nadir.org}, также доступно на \href{http://www.anarhvrn.ru/info/subculture.html}{\texttt{http://www.anarhvrn.ru/info/subculture.html}}
Перевод Бренер и Шурц.
\bigskip
\textbf{ru.theanarchistlibrary.org}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
https://dfzljdn9uc3pi.cloudfront.net/2016/2139/1/Table_S1.tex | cloudfront.net | CC-MAIN-2021-39 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-39/segments/1631780058450.44/warc/CC-MAIN-20210927120736-20210927150736-00503.warc.gz | 249,143,027 | 1,567 | \documentclass[12pt]{article}
\usepackage{bm}
\usepackage{caption}
\begin{document}
\begin{table}[t]
\renewcommand{\arraystretch}{1.5}
\caption*{\ \textbf{Table S1. Type I error rates of seven tests with 1,000 individuals for trait with five categories at nominal significance level 0.05.}}
\centering
\begin{tabular}{ccllllllllll}\hline
&\multicolumn{9}{c}{\qquad \qquad \qquad \qquad \textbf{Scenario}}\\\cline{3-12}
$\bm{\rho}$&\bf{Test}& \bf{1}&\bf{2} &\bf{ 3 }&\bf{4} &\bf{ 5} & \bf{6} & \bf{7}& \bf{8 }& \bf{9} & \bf{10} \\\hline
0& MIT &0.060& 0.054& 0.062& 0.046 &0.032& 0.058 &0.052& 0.052& 0.054& 0.046\\
&aMIT&0.062&0.058&0.058&0.042& 0.030& 0.056 &0.054& 0.052& 0.058& 0.050\\
&Score&0.046 &0.040& 0.046& 0.044& 0.046& 0.036& 0.054& 0.048 &0.062& 0.044\\
&$\mathrm{SKAT}$-$\mathrm{O_{B}}$&0.062& 0.044& 0.050& 0.040& 0.038 & 0.042& 0.032& 0.034& 0.050& 0.030\\
&$\mathrm{aSPU_{B}}$&0.052& 0.060& 0.066& 0.038 &0.060& 0.034& 0.048& 0.062& 0.042& 0.048\\
&$\mathrm{GFLM_{B}}$&0.040& 0.032& 0.044& 0.050 &0.038& 0.038& 0.053& 0.034& 0.048& 0.032\\
&$\mathrm{KLT_{B}}$&0.046& 0.044& 0.046& 0.042& 0.040& 0.038& 0.050& 0.038& 0.050 &0.034\\
0.5& MIT &0.062& 0.056& 0.058& 0.052& 0.052 &0.046& 0.054& 0.056& 0.050& 0.066\\
&aMIT&0.064& 0.052& 0.052& 0.048& 0.056& 0.044 &0.052& 0.058& 0.044& 0.064\\
&Score&0.054& 0.044& 0.046& 0.038 &0.034 &0.050& 0.038& 0.058& 0.040& 0.046\\
&$\mathrm{SKAT}$-$\mathrm{O_{B}}$&0.046& 0.042& 0.054& 0.038& 0.032& 0.046& 0.040& 0.054& 0.052& 0.056\\
&$\mathrm{aSPU_{B}}$&0.060& 0.052& 0.057& 0.046& 0.050& 0.046& 0.046& 0.052& 0.060& 0.060\\
&$\mathrm{GFLM_{B}}$&0.048& 0.038& 0.036& 0.054& 0.034& 0.038& 0.046& 0.046& 0.048& 0.044\\
&$\mathrm{KLT_{B}}$&0.058 &0.042& 0.042& 0.054 &0.036& 0.058& 0.034& 0.046& 0.042& 0.036\\
0.9& MIT &0.046 & 0.066 & 0.044 & 0.050 & 0.066 & 0.054 & 0.054 & 0.066 & 0.044 & 0.052\\
&aMIT&0.048& 0.066& 0.046& 0.050& 0.066& 0.048& 0.050 &0.068& 0.046& 0.054\\
&Score&0.044& 0.048& 0.044& 0.044& 0.062& 0.050& 0.040& 0.044& 0.038& 0.044\\
&$\mathrm{SKAT}$-$\mathrm{O_{B}}$&0.046& 0.038& 0.030& 0.048& 0.046& 0.040& 0.050& 0.056& 0.054& 0.048\\
&$\mathrm{aSPU_{B}}$&0.048& 0.062& 0.050& 0.048& 0.044 &0.054& 0.050& 0.054& 0.066 &0.052\\
&$\mathrm{GFLM_{B}}$&0.046& 0.052& 0.048& 0.043& 0.048 &0.032& 0.054& 0.038& 0.042&0.048\\
&$\mathrm{KLT_{B}}$&0.032& 0.056& 0.042& 0.040& 0.048& 0.040& 0.056& 0.044& 0.038& 0.042\\
\hline
\end{tabular}
\end{table}
\end{document} |
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%203351%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=J%20Glaciol&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/1669446710712.51/warc/CC-MAIN-20221129232448-20221130022448-00139.warc.gz | 43,590,151 | 1,381 | %&LaTeX
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\section*{2019}
Joana Maria Pujadas-Mora, Alicia Fornes, Josep Llados, Gabriel Brea-Martinez and Miquel Valls-Figols. 2019. The Baix Llobregat (BALL) Demographic Database, between Historical Demography and Computer Vision (nineteenth{\textendash}twentieth centuries. \textit{Nominative Data in Demographic Research in the East and the West: monograph}.29--61.
\end{document}
|
https://dlmf.nist.gov/3.4.E8d.tex | nist.gov | CC-MAIN-2022-05 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2022-05/segments/1642320304760.30/warc/CC-MAIN-20220125035839-20220125065839-00687.warc.gz | 274,494,450 | 683 | $B_{2}^{3}=-\tfrac{1}{6}(1-3t^{2}).$ |
https://www.zentralblatt-math.org/matheduc/en/?id=165329&type=tex | zentralblatt-math.org | CC-MAIN-2019-51 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-51/segments/1575540529516.84/warc/CC-MAIN-20191210233444-20191211021444-00091.warc.gz | 916,035,229 | 1,193 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2001d.03354}
\itemau{Gruettner, Roland}
\itemti{A is for area and U is for circumference. A critical discussion of geometry nomenclature. (Flaechen-A und Umfangs-U. Kritische Auseinandersetzung mit den Bezeichnungen im Geometrieunterricht.)}
\itemso{Schulmag. 5-10 68, No. 11, 27-30 (2000).}
\itemab
Viele Schuelerinnen und Schueler haben selbst bei der Berechnung einfacher geometrischer Figuren grosse Verstaendnisschwierigkeiten, da sie sich von den unterschiedlichen Groessenbezeichnungen und Abkuerzungen verwirren lassen. Der Autor setzt sich daher in einem Plaedoyer fuer die Verwendung von Umgangssprache und einheitlichen Bezeichnungen im Geometrieunterricht ein. (Orig.)
\itemrv{~}
\itemcc{G33}
\itemut{}
\itemli{}
\end |
https://latex-cookbook.net/tex/tree.tex | latex-cookbook.net | CC-MAIN-2021-10 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2021-10/segments/1614178375529.62/warc/CC-MAIN-20210306223236-20210307013236-00451.warc.gz | 397,419,377 | 1,169 | % A simple Tree
% Author: Stefan Kottwitz
% https://www.packtpub.com/hardware-and-creative/latex-cookbook
\documentclass[border=10pt]{standalone}
%%%<
\usepackage{verbatim}
%%%>
\begin{comment}
:Title: A simple Tree
:Tags: Trees;Graphics;TikZ
:Author: Stefan Kottwitz
:Slug: tree
A simple tree with a style for all nodes.
A tree is a very common type of hierarchical graph. Tree nodes
have children. These are connected by edges and are usually displayed
in rows when growing down or in columns when growing horizontally.
Full explanation in Chapter 9, Creating Graphics:
[Growing a tree](https://latex-cookbook.net/tree/)
\end{comment}
\usepackage{tikz}
\begin{document}
\begin{tikzpicture}[sibling distance=10em,
every node/.style = {shape=rectangle, rounded corners,
draw, align=center,
top color=white, bottom color=blue!20}]]
\node {Formulas}
child { node {single-line} }
child { node {multi-line}
child { node {aligned at}
child { node {relation sign} }
child { node {several places} }
child { node {center} } }
child { node {first left,\\centered,\\last right} } };
\end{tikzpicture}
\end{document}
|
https://www2.ccs.neu.edu/research/demeter/papers/law-of-demeter/law-formulations/ss.tex | neu.edu | CC-MAIN-2019-13 | application/x-tex | text/x-matlab | crawl-data/CC-MAIN-2019-13/segments/1552912202324.5/warc/CC-MAIN-20190320085116-20190320111116-00310.warc.gz | 962,772,136 | 13,527 | %\documentstyle[12pt]{article}
\documentstyle{article}
%\documentstyle[proc]{article}
\pagestyle{headings}
\begin{document}
\bibliographystyle{alpha}
\title{Formulations and Implications\\ of the Law of Demeter}
\author{Karl J. Lieberherr, Ian Holland\\
Northeastern University, College of Computer Science\\
Cullinane Hall, 360 Huntington Ave., Boston MA 02115}
\maketitle
%\input /fiona/csfaculty/wand/tex/time.tex
%\centerline{Texed at \thetime\ \today}
\centerline{Copyright \copyright 1988 Karl Lieberherr}
\input common.tex
\begin{abstract}
Our publication of the Law of Demeter in IEEE Computer, June 88, and
in the CLOS mailing list has resulted in a wealth of feedback which
has prompted us to write more explicitly about formulations
and consequences of the Law.
\end{abstract}
\section{Introduction}
The Law of Demeter has been introduced in \cite{LHLR:law-paper} for message
passing object-oriented languages.
The motivation for the Law and its intent are given in that paper.
The purpose of this paper is to introduce several generalizations
and reformulations of the Law which preserve its spirit and make
it useful for many object-oriented languages.
We also discuss some implications of the Law in further detail.
\section{Alternatives}
There are two kinds of alternatives which are independent:
The first kind of alternatives takes either an ``object'' point of view
or a ``type'' point of view. The ``type'' point of view has two sub categories,
called ``pure type'' and ``associated classes''.
The second kind of alternatives relates to the object-oriented language
technology for which the Law is formulated.
We distinguish between ``message passing'' and ``generic function''
terminology.
% Therefore we introduce $3*2=6$ different formulations of the Law.
\subsection{Object and type alternatives}
In the first set of alternatives we distinguish between
an ``object'' and a ``type'' version of the Law.
\subsubsection{Object alternative}
This is the conceptual version of the Law which is easy to remember and to
explain.
\begin{formulation}
%We choose ``message passing'' (defined later) for
%the remaining choice:
Inside a method M attached to class C we can only send messages to
the following objects:
\begin{itemize}
\item
an argument object of M, including the self object, or
\item
an instance variable object of C
\end{itemize}
(Objects created by the method, or by methods which
it calls, and objects in global
variables are viewed as being passed by arguments of M.)
\end{formulation}
By an argument object we mean an object passed by an argument. By an
instance variable object we mean the object stored in an instance variable.
We should strive to follow this version of the Law although it
is difficult to enforce at compile-time for
even very restricted object-oriented languages. It requires an
analysis of aliases at compile-time.
Consider
\bv
;A = <x> B.
(defmethod (A :alias) (t)
(send self ':set-x (send t ':x)))
;T = <x> B.
(defmethod (T :m2) (a)
(send (send a ':x) ':m3))
\end{verbatim}
Is this in good style? It depends on the context.
The following is o.k.
\bv
(send iA ':alias iT)
(send iT ':m2 iA)
\end{verbatim}
But \verb?(send iT ':m2 iA)? by itself violates the Law.
Maybe a better name for the ``object'' version would be ``run-time'' version.
Theoretical results related to the complexity of checking
the object version of the Law are given in \cite{oppen:rec-data-80}.
The formulation of the Law has to be analyzed carefully. For example,
consider a method M attached to class C. What is the difference between:
an instance variable value of C and an immediate part of self?
Which formulation should we use in the formulations of the Law?
We have decided to use the formulation using instance variables.
The motivation is as follows: Consider the method
\bv
(defmethod (construction :walk)()
(loop for e in (send self ':child)
do (send e ':walk)))
\end{verbatim}
Here we send a message to a subpart of self, but we don't send a message
to an instance variable object of construction. Therefore this method
violates the Law. Why is this method considered dangerous? This method
which is attached to construction makes assumptions about the
subclasses of construction. It assumes that there is a method
{\sf child} which returns a list and each element in that list
should be responsive to a method {\sf walk}.
This should only be done if it is
well justified and should be very well documented.
The above method can be written in good style as follows:
\bv
(defmethod (construction :walk)()
(loop for e in (send self ':child)
do (send self ':aux-walk e)))
(defmethod (construction :aux-walk) (part)
(send part ':walk))
\end{verbatim}
\subsubsection{Type alternatives}
The type version of the Law is compile-time enforceable for useful subsets
of the underlying object-oriented languages. The type version can be
stated in terms of classes which is less stringent and in terms
of associated classes which is more restrictive and the most useful
formulation.
\begin{itemize}
\item pure type
\begin{formulation}
%We choose ``generic function'' (defined later) for
%the remaining choice.
In all function calls inside a method M all method selection arguments
must belong to one of the following classes:
\begin{itemize}
\item
argument classes of M
\item
instance variable classes of method selection argument classes of M.
\end{itemize}
A {\em method selection argument} is an argument which is used
for identifying the applicable methods.
\end{formulation}
Method selection arguments
are discussed further below.
This pure type formulation of the Law is easy to remember and
does not require Demeter specific terminology. However, it is much less
stringent than the object version and allows many more methods
to be in ``good style'' than the object version. The problem comes from
inheritance, e.g. it allows also instances of proper subclasses
of the argument classes to be passed in method selection
arguments of generic function calls. This reduces modularity.
The formulation
`` ... all method selection arguments must belong to one ...''
is important. We cannot replace it by
`` ... all method selection arguments must be instances of one ...''
because of abstract classes.
\item associated classes
\begin{formulation}
%We choose ``generic function'' (defined later) for
%the remaining choice.
In all function calls inside a method M all
method selection arguments must be instances of a class associated
with one of the following classes:
\begin{itemize}
\item
argument classes of M
\item
instance variable classes of method selection argument classes of M.
\end{itemize}
\end{formulation}
This version of the Law is the original version and comes close
to the conceptually ideal object version while being compile-time
checkable for useful classes of object-oriented programs.
\end{itemize}
\subsection{Message passing and generic function alternatives}
In the second set of independent alternatives we
discuss message passing versus generic function call formulations.
\subsubsection{Message passing alternative}
\begin{formulation}
%We choose ``type(associated classes)'' for
%the remaining choice.
In any method M attached to class C send only messages to
instances of a class associated with one of the following
classes:
\begin{itemize}
\item argument classes of M (which includes C)
\item the instance variable classes of C.
\end{itemize}
\end{formulation}
\subsubsection{Generic function alternative}
In the message passing framework we think of a method as attached to one
class. In the generic function generalization it is natural to think
of methods as being attached to several classes.
The idea of \oop\ is that we can attach functionality to classes.
These routines (functions or procedures,
which are called methods
in several object-oriented
systems) are an integral
part of the class and can access the parts of an object of that class
in an easier way than other functions. These functions are part of the
semantics of the class.
Attaching a routine to a class is like giving the routine
the right to access, at a primitive level, the instance variables. One
could achieve the same result by attaching the routine to any other class,
but accessing the required information would be less convenient.
Attaching a routine to a class in some sense reveals the
details of the class to the function.
Our law just re-affirms this notion and restricts the extent of the
revealed details.
In message passing languages where a method is
attached only to one class, we restrict
the message sending essentially to instance variables types of that class.
The arguments to the method act in support of the method BUT since
the method is not attached to the classes of the arguments, the method
is not an integral part of the semantics of those argument classes.
Therefore
the function had no right to access the details of the arguments
{\em at a primitive level}.
There is a real difference between the first argument to which
a message is sent
and the remaining arguments which act as support information.
With generic function call languages which allow several arguments
to select a method (e.g. CLOS) this is different.
There is potentially a case analysis of all
argument types to decide which method is being invoked;i.e., the function
is attached to many classes. If a function is attached to many classes
then it is a part of the semantics of each {\em and} should be allowed
to send messages
to instance variable types of all the classes to which it is attached.
Any remaining
arguments are treated in the same way as the second and following
arguments in message passing languages.
We must still distinguish between the two roles played by the arguments:
the method selection role and the supporting role.
Therefore the Law for generic function call languages with several
method selection arguments, allows the programmer of
a method to look directly at the instance variables of several classes.
We have to compensate for this by restricting more than the first
argument in a generic function call:
We require that
all function calls inside a method M must have a restricted set
of objects in all their method selection arguments.
An important idea behind the Law
is that the user has only to think about the classes
of the method selection arguments and the classes of the
immediate subparts of those argument classes when reading a method.
Consider the following example:
\bv
METHOD f (a : A, b : B) : C.
... (g a (h b)) ...
\end{verbatim}
Let's assume that g has two method selection arguments. The Law requires
that the return type of h is restricted. The reason is that we only
want to think about certain classes when figuring out which method
h will activate.
Furthermore, we want to restrict the effect of class changes.
Assume that the return type of h is Q which is a subsubpart type of A.
If Q changes, we might have to modify f since now a completely
different method might be selected.
If a class changes, we only want to change methods attached to that class.
The Law achieves this by restricting the
types of the method selection arguments.
\begin{formulation}
%We choose ``type(associated classes)'' for
%the remaining choice.
In all function calls inside a method M all method selection arguments
must be
instances of classes which
are associated with one of the following classes
\begin{itemize}
\item argument classes of M
\item instance variable classes of method selection argument classes of M.
\end{itemize}
(Objects created by the method, or by methods which it calls,
and objects in global
variables are considered as arguments.
A method selection argument is an argument which is used
for identifying the applicable methods.)
\end{formulation}
The message passing version and the generic function call
version are closely related: Only the first argument is a method
selection argument in the message passing version.
\section{Overloading and dynamic method selection}
Dynamic method selection with respect to an argument of a generic
function means that the arguments class is used at run-time to
determine a method to call.
Let o1 (o2) be of type T1 (T2), where T1 (T2) is a class with T1'=\{T1\}
(T2'=\{T2\}). This implies that T1 and T2 are construction, repetition or
terminal classes. In this case, (send o1 ':m) and (send o2 ':m)
can be compiled into the call of two specific methods. There is no need
for dynamic method selection for the types of o1 and o2 at run-time.
We say that message name m is overloaded. We can determine at compile-time
which method should be called.
Now, assume that T1 is a class with T1' different from
\{T1\}, i.e., T1 is an alternation
class with more than one alternative. In this case we need dynamic method
selection
at run-time to determine which method (send o1 ':m)
should execute.
Both for overloading and dynamic method selection several
arguments might be used to determine the effective method.
These possibilities are orthogonal to each other. How do they influence
the form of the Law of Demeter? It is the dynamic method selection
which has an influence on the Law.
The overloaded functions per se don't have special priviledges
regarding access to the instance variables; they are not
``attached'' to the classes of the arguments which influence
the overloading.
E.g., in C++, we have overloading
using several arguments but dynamic method selection
only for the first argument.
Therefore, the C++ formulation uses the message passing
formulation.
\paragraph{A brief comparison between CLOS and C++.}
There is certainly a huge difference between CLOS and
C++ but with respect to the Law, CLOS and C++ are not that far apart:
{\em In C++ also all arguments are used to determine which method (called
a member function) to execute.}
The difference is that in C++ the argument types (after the first) are
used to determine the member function at compile-time. I.e., C++ uses
static method selection for the second and following arguments.
The first argument in a method of a derived class
is used for dynamic method selection.
In other words:
CLOS supports dynamic method selection on all required arguments, while
C++ supports dynamic method selection only on the first argument.
Both C++ and CLOS support function overloading on all required arguments.
For C++ the message passing formulation of the Law is appropriate.
We view the compile-time method selection of C++ due to overloading
as syntactic sugar. We could always rename the methods by prefixing
their names with argument types to avoid the need of overloading.
But CLOS is inherently more powerful: it does true dynamic method
selection
on all the method selection arguments.
Therefore we need for CLOS the generalization of the Law as proposed
in the section on ``Formulation for existing languages''..
\section{The Law in mixed paradigm languages}
In languages which support both the action-oriented and the object-oriented
paradigm we have the coexistence of function or procedure calls with
message sendings or generic function calls. We can view a regular
function or procedure as a degenerate generic function with 0 method
selection arguments. Therefore the Law of Demeter does not restrict
the regular function or procedure calls inside a method.
Outside methods we disallow generic function calls, i.e., a regular
function or procedure may not contain generic function calls.
For mixed paradigm languages it makes sense to distinguish between
types and classes. The types include:
\begin{itemize}
\item
the types of the action-oriented base language
such as character, integer, real and other types
\item the classes of the object-oriented extension.
\end{itemize}
In CLOS many but not all Common Lisp types are classes and all
classes are types.
\section{Nesting of generic function calls}
The Law of Demeter has implications for the nesting of function
calls. To discuss those implications, we classify functions as follows:
\begin{definition}
\begin{itemize}
\item
A accessor function returns an object which exists before the
function was called.
\item
A constructor function returns an object which did not exist before
the function was called.
\end{itemize}
\end{definition}
The Law allows the nesting of constructor functions, as well as
the nesting of non-generic functions.
A generic function does not necessarily have to contain
an explicit 'make-instance' call (or its equivalent) to cause the
creation of a new object. If the generic function has within it
a call to a function which returns {\em a newly created object} then this
too is considered a creation of an object within the generic function.
However, the Law prohibits functional composition of accessor functions
which don't return instance variable objects.
Indeed, the Law of Demeter,
prohibits functional composition of list processing functions.
For example, the Law of Demeter
says that the following code is in "poor" style:
(We use the CLOS notation in this section.)
\bv
; Number-List ~ {Number}.
(defmethod third ((x Number-List))
(car (cdr (cdr x))))
\end{verbatim}
We view this in bad style for two reasons: Apparently, we know that
the list has at least three elements. Therefore we should define it
as a construction class:
\bv
; New = <p1>, <p2>, <third> Number <rest> Number-List.
\end{verbatim}
Then selecting the third element is much easier (more intuitive and
less error prone).
The second reason is that it is not good to ``dig'' into structures.
We choose another example to demonstrate this point:
\bv
;P0 = <p1> P1.
;P1 = <p2> P2.
;P2 = <p3> P3.
(defmethod get-p3 ((x P0))
(p3 (p2 (p1 x))))
\end{verbatim}
A better solution is:
\bv
(defmethod get-p3 ((x P0))
(get-p3 (p1 x))
(defmethod get-p3 ((x P1))
(p3 (p2 x)))
\end{verbatim}
If we update class {\sf P1} (say instead of p2 we have two other instance
variables), we have to modify in the first case
the triply nested method {\sf get-p3}
attached to class {\sf P0} (although
{\sf P0} did not change).
In the second case, we only have to update the method attached to {\sf P1}.
In the Number-List example we could not make the same point
since cdr returns again an Number-List. We view this as a coincidence.
The compile-time checkable version of the Law of Demeter allows
the nesting of accessor functions, if their return type is not
a ``new'' type, that is if it is an instance variable or an argument
type.
We give two more examples which use nesting of constructor functions.
The following nesting is in good style:
\bv
(defmethod good-style ((x float) (y float))
(+ (sqrt (- x y)) y))
\end{verbatim}
since the functions +, -, and sqrt are all constructor functions.
The result of applying the built-in generic function - is an argument
to the sqrt generic function, as is the result of sqrt to +.
The result of applying - and sqrt
is generated within the function body itself.
In other words,
the application of the '-' to the x and y causes the creation of a new
instance of the float class which is initialized to a value representing
'x - y'. So calling '-' is just the same as creating a new object and
giving the instance variables of that object some initial values depending
on the arguments and some procedural processing. Thus the argument to the
sqrt function is again valid.
As a less trivial example, consider the following. In Unix, the
pipe construct has the semantics of functional composition. Thus, to
format a troff document and send it to the line printer the following
command line is used:
\bv
troff <switches> <filename> | lpr -P<printer>
\end{verbatim}
Using functional composition in Lisp/CLOS, we have:
\bv
(defmethod output-document
((switches string)
(filename pathname)
(printer string))
(lpr printer (troff switches filename)))
(defmethod lpr
((printer string)
(document stream))
<<code to send document to the printer>> )
(defmethod troff
((switches string)
(filename pathname))
<<code to do troff,
might be in Lisp or a call to Unix>>)
\end{verbatim}
The method output-document is in good style since troff is a constructor
function which returns a new stream object.
% The functional programming style is a useful and powerful one,
%though, as with all programming styles, it has its limitations. One of
%the advantages of CLOS is that it makes a combination of functional
%and object-oriented styles possible, allowing side effect producing
%operations to be limited in extent, which, in turn, makes proofs of
%correctness easier. By eliminating functional composition for generic
%functions, the Law of Demeter puts unnecessary restrictions on the
%programmer.
It is important to note that we haven't ``thrown out the baby with the
bathwater'' with this interpretation of ``object creation''.
A generic function has the authority to make decisions and operate
in ways which are DEPENDENT on the 'valid' method selection objects
(argument objects and slot values of method selection arguments) and their
types, but IS NOT ALLOWED to be dependent on the sub-parts of those objects.
The deep structures of the objects are hidden from the generic function.
This is a real and
important restriction on the programmer.
\section{Interface of a function}
Let's assume we have a (non-generic) function
{\sf op-res} which takes as
first argument an operator of type
\bv
Operator : AddSym | MulSym.
\end{verbatim}
plus two other arguments which are numbers.
Function {\sf op-res} returns the value of applying the operator to the
two numbers. We have provided this function to our users and
given them the interface for the function.
Some time later, we decide to make the function generic in its first
argument. Should we inform the users about this change? (By the way,
in CLOS we are forced to make the function generic in all three arguments since
all three are required.) The users might have used this function {\sf op-res}
inside other methods and if we make now the first argument generic
the user's code might suddenly violate the Law. Why should the user
know about the fact that the first argument is generic now? The reason
is extensibility! The user has now an easy way to extend the {\sf op-res}
function to other types and that is very useful knowledge for the
future modification of the user's program.
When the function is generic in its first argument, its implementation must
look like: (pardon the new Flavors notation; this discussion is relevant
not only to CLOS but also to generic function
systems with only one dynamic method-selection argument (such as new Flavors)):
\bv
(defmethod (AddSym op-res) (e1 e2) ... )
(defmethod (MulSym op-res) (e1 e2) ... )
\end{verbatim}
If the user wants to extend the domain of {\sf op-res}, he/she just adds
another method. If the function is not generic, this won't work.
{\em Therefore, we view the number of method selection arguments of a function
as part of the interface of that function along with the typing information
and a formal or informal specification.}
HERE WE CLASH WITH THE VIEW OF THE CLOS INVENTORS. They view the syntactic
non-distinction as a contribution of CLOS, while we view the fact that
we can have several method selection arguments as one (among many) contributions
of CLOS.
What about the violation of the Law when we go from non-generic to
generic? Lets consider the following classes:
\bv
A = <x> Compound.
Compound = "(" <op> Operator <args> List(PrefixExp) ")".
\end{verbatim}
Consider the method:
\bv
(defmethod (A bad-style) (e1 e2) (op-res (op x) e1 e2))
\end{verbatim}
which is identical before and after the transition from non-generic to generic.
Why is method "bad-style" in bad-style after the transition?
Since it is attached to class {\sf A} AND
since it contains a dependency on the subparts of the {\sf Compound} class.
If {\sf Compound} changes to
\bv
Compound = "(" <additive-op> Operator <args> List(PrefixExp) ")".
\end{verbatim}
we have to modify the semantics of class {\sf A},
although class {\sf A} did not change:
\bv
(defmethod (A :bad-style) (e1 e2) (op-res (additive-op x) e1 e2))
\end{verbatim}
This violates the principle of modularity.
Why is "bad-style" in good-style before the transition?
It is the prerogative of the Law that
it can accept certain constructs which are in bad shape. We want to
have a Law without exceptions which is easy to remember and to follow.
We don't want to restrict non generic function calls since
we don't want to upset the Lisp or C programmers.
\section{Formulations for existing languages}
We give the formulation of some of the Law of Demeter
versions in a few object-oriented languages.
Each formulation adapts the Law to the terminology of the particular language.
\begin{itemize}
\item
Smalltalk-80:
object/ type,
message passing.
\bv
----- LAW OF DEMETER (Smalltalk-80, object version) ----
In all message expressions inside a method M
the receiver must be one of the following objects:
- an argument object of M including objects in
pseudo variables "self" and "super" or
- an instance variable object of the class to which M
is attached.
(Objects created by the method, or by methods which it calls,
and objects in global
variables are viewed as being passed by arguments.)
--------------------------------------------------------
\end{verbatim}
\item
C++:
type,
message passing.
C++ allows overloading of function names
with respect to several arguments.
But run-time implicit case analysis is done only with the first argument.
\bv
----- LAW OF DEMETER (C++, type version) -------------
Every member or friend function M of a
class C is only allowed to call member
or friend functions of the following classes:
- The argument classes of M (including C),
- The data member classes of C,
- The classes of objects created by M (directly,
by calling a constructor function or indirectly,
by calling a function which will call
eventually a constructor function)
- The classes of global objects.
----------------------------------------------------------
\end{verbatim}
\item
CLOS:
object/ type,
generic function.
\bv
----- LAW OF DEMETER (CLOS, object version) -------------
All function calls inside a method M must use only the
following objects as method selection arguments:
- M's argument objects or
- slot values of method selection argument classes of M.
(Objects created by the method, or by functions which
it calls, and objects in global variables are viewed as
being passed by arguments.
A method selection argument is an argument which is used
for identifying the applicable methods.)
----------------------------------------------------------
\end{verbatim}
Note that this formulation implies that the only legal use of
function slot-value is on method selection arguments.
\bv
----- LAW OF DEMETER (CLOS, pure type version) -----------
In all function calls inside a method M all method
selection argument objects must belong to one of the
following classes:
- argument classes of M
- slot classes of method selection argument classes of M.
----------------------------------------------------------
\end{verbatim}
\item
Old Flavors:
object/ type,
message passing.
\bv
----- LAW OF DEMETER (Old Flavors, object version) -----
In any method M attached to class C send only messages
to the following objects:
- M's argument objects
- the instance variable objects of C.
(Objects created by the method, or by methods or functions
which it calls, and objects in global
variables are considered as arguments of M.)
--------------------------------------------------------
\end{verbatim}
\bv
----- LAW OF DEMETER (Old Flavors, associated classes) ---
In any method M attached to class C send only messages
to instances of classes associated with the following classes
- argument classes of M
- instance variable classes of C.
(Objects created by the method, or by methods or functions
which it calls, and objects in global
variables are considered as arguments of M.)
----------------------------------------------------------
\end{verbatim}
\item
New Flavors:
object/ type,
generic function.
\item
Eiffel:
object/ type,
generic function.
\bv
----- LAW OF DEMETER (Eiffel, object version) -----------
In all calls of routines inside a routine M
the entity object must be one of the following objects:
- an argument object of M
- an attribute object of the class in which M is defined.
---------------------------------------------------------
\end{verbatim}
\end{itemize}
These formulations can be altered in the following ways:
\begin{itemize}
\item Use nested universal quantifiers. For all classes C, and for all methods M attached to C, ...
\item Use ``let'' phrases. Let C be any class, let M be any method attached to C,
let E be any message expression ...
\end{itemize}
\section{Questions and answers}
\begin{itemize}
\item
Question: The Law violates information hiding since to follow the Law you
have to know the "instance variable objects". You are not supposed
to know whether a value returned by a message is an instance variable
object or a value computed from instance variables.
Answer: The concept of "instance variable object" used in the Law
is a semantic one. An instance variable object is either stored
as immediate subpart of the object or computed as a new object
and returned by some message.
Remark: it is possible that some methods of a message return a
newly created object and others a new object.
\item
Question: How is the Law related to information hiding?
Answer: The Law selectively hides the protocol of a class in certain classes.
Consider the following implication of the Law: (we need two definitions first)
Definition: Class B is called a preferred supplier of class A if
B is a part class of A or
B has a method which uses an argument of class A or
A inherits from B or
B creates an object of class A or
B has a method which uses a global variable which is of class A.
Every class is a preferred supplier of itself.
Definition: The protocol of a class is the set of messages the class
knows about.
Implication of Law of Demeter: (selective information hiding)
The protocol of a class C can only be used in methods of preferred clients
of C.
\item
Question: How does the Law limit the effects of modifications?
Answer:
Fact: If the protocol of class B changes
at most the preferred clients of class B need to be modified.
Fact: If the immediate parts of class A change,
at most the methods of A and its subclasses need to be modified.
Fact: If the immediate parts of class A change, and the strong Law
is followed,
at most the methods of A need to be modified.
For a compiled system such as C++: Fact: If the Law is followed and
if class B is recompiled then at most the preferred
clients of B need to be recompiled.
\item
Question: What is "associated" about?
Answer: Use the following more permissive type version of the Law:
\bv
For all classes C, and for all methods M
attached to C, all
objects to which M sends a message must belong
to the following classes:
The argument classes of M (including C).
The instance variable classes of C.
Classes of objects created by M,
or by messages which M sends.
Classes of global objects.
\end{verbatim}
\item
Question: When is it justified to break the Law.
Answer: When you have a stable class organization, it makes sense to use
the protocol of a class in other classes than preferred
client classes. These uses
have to be well documented.
Example:
\bv
(defmethod (construction :walk) ()
(loop for e in (send self ':child) do
(send e ':walk)))
\end{verbatim}
We assume that class construction does not have any instance variables,
that the e's are not newly created objects and that there are no globals.
Since :walk does not have any arguments, and since e can belong
to a class different than construction, we have a violation of the Law.
We can conform to the Law, however, by:
\bv
(defmethod (construction :walk) ()
(loop for e in (send self ':child) do
(send self ':walk-auxiliary e)))
(defmethod (construction :walk-auxiliary) ; could be inline
(e :type universal)
(send e ':walk))
\end{verbatim}
Here we have effectively documented the dependency of method walk
on class universal.
\item
Question: In C++ it is possible to explicitly call member functions of
other classes. How does this affect the Law?
\begin{example}
\bv
typedef void* ent;
class slist {
private:
slink* last;
public:
int insert(ent a);
int append(ent a);
ent get();
void clear();
slist();
slist(ent a);
~slist();
};
struct name {
char* string;
};
struct nlist : slist {
void insert(name* a) {slist::insert(a);}
void append(name* a) {slist::append(a);}
name* get() {return (name*)slist::get();}
nlist() {}
nlist(name* a) : (a) {}
// from page 207 Stroustrup
};
\end{verbatim}
Here we call member function insert of slist. This is a special feature
of C++. The Law of Demeter does not allow us
\end{example}
\end{itemize}
\section{Clients, suppliers and dependencies}
Precondition: compile-time enforcing.
1. strong typing with explicit type declarations (C++)
2. strong typing with type hierarchy and signatures of methods
described by Demeter type notation.
The type of every statement or expression can be inferred at compile-time
through type inferencing. (Lisp Flavors, Smalltalk)
Goal of Law of Demeter: organize and reduce dependencies
between classes.
Approximations: Each method can only send messages to a ``limited'' set
of objects.
Each method is ``dependent'' on a ``limited'' set of objects.
(organize dependencies)
Each method ``collaborates'' with a limited set of objects.
(organize collaborations)
We adopt the client/supplier terminology from \cite{meyer:book-88}.
\begin{definition}
The protocol of a class C is the set of messages that can be sent
to C and its instances.
\end{definition}
\begin{definition}
Method M is a client of class B and B is a supplier of method M,
if an object of class B is sent a message in method M.
or if an instance of a class in associated(B) is sent a message in method M.
?? not precise enough ??
note: more restrictive than Meyers. Passing and never sending a message
does not count for client.
\end{definition}
Next we define a special kind of clients and suppliers.
\begin{definition}
Class B is called a preferred supplier of method M (attached to class C) if
class B is a supplier of method M and one of the following conditions holds:
B is an instance variable class of C or
B is an argument class of M, including C or
do not need: C inherits from B or
B is a class of objects created in M
B is a class of a global variable used in M.
%Include: have to send a message??
\end{definition}
\begin{definition}
Method M is called a preferred client of B if and only if
class B is a preferred supplier of method M.
\end{definition}
\begin{example}
In the following 4 examples,
class B is a preferred supplier of method M and M is a preferred client of B.
\bv
METHOD M (<self> Y <s> B ...)
// A = <s> B ...
METHOD M (<self> A ...)
METHOD M (<self> A ...)
{ ... f(s) ... }
// s is of type B, global to M
METHOD M (<self> A ...)
{ ... f(s) ... }
\end{verbatim}
\end{example}
\begin{fact}
Class B is a preferred supplier of method M attached to B.
Method M attached to class B is a preferred client of class B.
\end{fact}
Law of Demeter (type version):
In all classes C and in all methods M attached to C, use only the protocol of
the preferred suppliers of M.
\begin{fact}
Reformulation 1 of Law of Demeter (selective information hiding):
Only a preferred client method M of class B is allowed
to use the protocol of class B.
\end{fact}
\begin{fact}
Reformulation 2 of Law of Demeter (selective information hiding):
The protocol of a class B can only be used in preferred clients of B.
\end{fact}
\begin{definition}
A method M is dependent on class C, if M uses a method attached to C.
What does uses mean? Need compile-time checking.
\end{definition}
\begin{fact}
Reformulation 3 of Law of Demeter (selective information hiding):
Only a preferred client method M of class B is allowed
to be dependent on class B.
\end{fact}
This can be viewed as an equivalent formulation of the type version
of the Law which does not use associated.
%\begin{definition}
%Class A is dependent on class B if A uses B's protocol.
%\end{definition}
\begin{fact}
Method M is dependent on B if and only if M is a client of B.
Depends on definition of dependent.
\end{fact}
%If A is a client of B then A is not necessarily dependent on B since
%no method of A might use A's protocol. (An object of type A might
%be passed as second argument and never sent a message.)
%The Law reduces the dependency between classes since only a preferred
%client class of a class B is allowed to use the protocol of B.
%Using the dependency concept, we can give the following equivalent
%formulation of the Law:
%\begin{fact}
%Only a preferred client class of B is allowed to be dependent
%on B.
%\end{fact}
%Yet another definition:
%\begin{fact}
%In any method M attached to class C use only the protocol
%of classes of which C is a preferred client.
%\end{fact}
Yet another reformulation:
\begin{fact}
In any method M use only the protocol
of preferred suppliers of M.
\end{fact}
The current definition of preferred client and supplier does not
deal with associated classes.
%Refined definition:
%
%\begin{definition}
%A is a preferred client of class B if B sends a message to an instance
%The preferred clients A of class B are the classes which
%send a message
%to an instance of the classes associated with the following classes:
% instance variable classes of B or
% argument classes of methods of B or
% classes from which B inherits or
% classes which create
%
%A inherits from B or
% B creates an object of class A or
% B has a method which uses a global variable which is of class A.
% Every class is a preferred client and a
% preferred supplier of itself.
%\end{definition}
\section{Black boxes}
A black box is a message which takes inputs and returns outputs.
\bv
;;; C = .
(defmethod (C :m) (p :type Complex)
(send (send p ':imaginary-part) ':square))
\end{verbatim}
In this example, imaginary-part is a message which takes as input
a Complex number and returns as output the imaginary part which
belongs to class Real. This
is a violation of the Law since class C is not allowed to
use the protocol of class Real. Observe that C is not a preferred
client of Real. C is a preferred client of class Complex only.
Violations of the Law are justified as long as the following
conditions are satisfied:
\begin{itemize}
\item
Classes which are stable can expose their structure. In the above example,
class Complex has been studied for centuries and the imaginary
part of a complex number is a stable concept.
\item
The dependencies are clearly documented. In the above example, we have to
document that
Class C depends on Real since C uses the protocol of Real.
\item
We are willing to keep messages upward compatible.
Consider:
\bv
(defmethod (C :M) (p)
(send (send p ':F1) ':F2 self))
\end{verbatim}
If we are willing to keep F1 so that it will always return an object which
responds to F2.
\item
Efficiency: To gain efficiency we might want to violate the Law.
Consider the problem of multiplying a matrix by a vector.
Vector(n) = <elements> Array(n, Number).
Matrix(m,n) = <elements> List(Vector).
\end{itemize}
If we rewrite the above example in good style we get:
\bv
;;; C = .
(defmethod (C :m) (p :type Complex)
(send p ':square-imaginary-part))
;;; Complex = <real-part> Real <imaginary-part> Real.
(defmethod (Complex ':square-imaginary-part)()
(send (send self imaginary-part) ':square)
\end{verbatim}
or
\bv
;;; C = .
(defmethod (C :m) (p :type Complex)
(send self ':square-argument (send p ':imaginary-part))
(defmethod (C :square-argument) (p-real :type Real)
(send p-real ':square))
\end{verbatim}
Both solutions are not satisfactory: The first one makes class Complex
too ``heavy'' in that it defines an unnatural method for the class.
The second one makes class C too ``heavy''.
Therefore it is justified to violate the Law and expose the structure
of class Complex.
It is important to notice that stable classes are more the exception
than the rule. Each application needs its own classes and these classes
tend to evolve as the application evolves. Therefore the Law
of Demeter is important.
Each black box introduces a constraint for the programmer in that
the black boxes have to be maintained in an upward compatible way.
With many black boxes around, the programmer gets forced to
write the software in inappropriate ways when changes have
to be made. With a minimal number of black boxes, the programmer
has much more freedom to keep the software optimally tuned to the
current needs of the application.
\begin{center}
{\bf{Acknowledgements}
}
\end{center}
Members of the CLOS community (Daniel Bobrow, Richard Gabriel,
Jim Kempf, Alan Snyder, Gregor Kiczales, Lanning etc.) have participated
in the debate and formulation of
the CLOS version of the Law and prompted
us to write this paper.
Jim Kempf did contribute two examples.
Carl Woolf was initially proposing to view the object version
of the Law as the one to follow
conceptually and he did help us in wording the formulations.
Arthur Riel provided moral support and helped us with the formulations
and implications of the Law.
\bibliography{/fiona/csfaculty/lieber/papers/new-obj/bibliography/biblio}
\tableofcontents
\end{document}
|
https://www.kunihikokaneko.com/data/jasmine/report.tex | kunihikokaneko.com | CC-MAIN-2022-21 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2022-21/segments/1652662519037.11/warc/CC-MAIN-20220517162558-20220517192558-00056.warc.gz | 1,004,581,248 | 3,458 | \documentstyle[epsf]{jarticle}
\title{\LARGE{集計レポート}}
\author{牧之内研 M1 龍 浩志}
\begin{document}
\maketitle
\section{集計レポート}
データベースでは，問い合わせを行なって目的のデータを検索するという
だけでなく，データベースに登録されているデータや検索結果をいろいろな角度
から分析をすることができるようにデータの集計を行なうことができます．例
えば,売り上げテーブルから売り上げの合計を集計する，得意先ごとに売り上げを集計するなどです．そこで，今回はこのような集計結果をレポートする
ために必要となる集約関数や問い合わせについて，またJasmineでの例について説明します．
\section{集約関数}
複数のタプルを対象として，タプルの数，合計，平均，最大値，最小値といっ
た集計値を求める関数を集約関数といいます．SQLでは，
\begin{itemize}
\item count()
\item sum(属性名)
\item avg(属性名)
\item max(属性名)
\item min(属性名)
\end{itemize}
などがあり，count()はタプルの数を，それ以外は指定した属性について集約値を求めます．さらに，
where句の条件を使って絞り込むと，絞り込んだタプルのみを対象として，集
約値を求めることができます．
\begin{center}
\epsfile{file=syuyaku.eps}
\end{center}
Jasmineの場合は，count(),sum(),average(),min(),max()という関数が用意さ
れています．count()は任意の集合p1に対して，
\begin{verbatim}
p1.count();
\end{verbatim}
として，集合p1の要素数を求めることができますが,その他の関数は数値型の集
合(Integer,Decimal,Real)に対してのみ行なえます．
集合p2=${\{}$50,100,150${\}}$のような数値型の集合に対して,
\begin{verbatim}
p2.sum();
p2.average();
p2.min();
p2.max();
\end{verbatim}
として，各種の集約値を求めることができます．
\section{group-by}
group-by句は特定の列に同じ値をもつものをまとめて，グループ化を行ないま
す．さらに，集約関数を組み合わせて各グループごとの集約値を計算すること
ができます．下の図は，売り上げテーブルから商品ごとにグループ化を行ない，
商品ごとの売り上げを求めています．結果は，グループ化した属性と集約値の
２つの列となります．
\begin{center}
\epsfile{file=group.eps}
\end{center}
Jasmineで記述する場合，
\begin{verbatim}
> Bag<[Integer CommodityNo,Integer TotalSales]> g;
\end{verbatim}
（グループ化する属性，集約した結果）という形のタプルの集合変数gを用意
します．
\begin{verbatim}
> g = group s in Sales by (s.soldCommodtiyNo)
with (partition^amountSold.sum());
\end{verbatim}
\begin{itemize}
\item \begin{verbatim}group s in Sales\end{verbatim}
Salesクラスのオブジェクトsについてgroup化する．sは範囲変数とい
います．
\item \begin{verbatim}by (s.soldCommodityNo)\end{verbatim}
byの後にgroup化を行なう属性名を指定します．
オブジェクトsのsoldCommodityNoによってgroup化する．
\item \begin{verbatim}with (partition^amountSold.sum())\end{verbatim}
withの後には，各groupに対し，どのような集約計算を行なうかを指
定します．group化された後の個々の集合をpartitionとして扱います．
partitionに対し，amountSoldの合計を求めます．
partitionの要素数を求める場合は，
partition.count()とします．\\
\clearpage
各partitionに対し集約計算を行なわず，実際の要素を集合として出す場合は，
\begin{verbatim}partition^amountSold\end{verbatim}とします．取り出した結果は下の表のようになります．
この場合最初に宣言するタプルの中で集合であることを指定しておく必要があ
ります
\begin{verbatim}
Bag<[Integer CommodityNo,Bag<Integer> TotalSales]> g;
\end{verbatim}
\begin{center}
\epsfile{file=group2.eps}
\end{center}
\end{itemize}
\section{order-by}
order-by句を使うとデータベースからデータを取り出すときに，順序を並べ替えて取
り出すことができます．order-by句で指定した属性に従って，その属性値の順
で，昇順または降順で並べ替えることができます．SQLでは，
\begin{verbatim}
select 取り出したい属性名
from テーブル
order by ソートを行なう属性名
\end{verbatim}
という記述ができます．
Jasmineで並べ替えを行なうには，sort()関数を使用します．sort()は，単一
型の集合，複合型の集合に使えます．昇順(ASCEND),降順(DESCEND)を指定する
ことができ,指定しなかった場合は昇順になります．
\begin{itemize}
\item 単一型の集合の場合\\
\begin{verbatim}
> Bag<Integer> i;
> i={4,7,6,3};
> i.sort().print();
Bag{ 3, 4, 6, 7 }
> i.sort(DESCEND).print();
Bag{ 7, 6, 4, 3 }
\end{verbatim}
\item 複合型の集合の場合\\
この場合，sort()の引数として，ソートを行なう属性名を指定する必要があり
ます．
\begin{verbatim}
>Bag<Sales> s;
>s = Sales from Sales;
>s.sort(``amountSold'').print();
>s.sort(``amountSold'',DESCEND).print();
\end{verbatim}
\end{itemize}
注：上の例のようにある集合Aに対し，A.sort()としても，元の集合Aは実際に
は並べ替えられません．A.sort().print()というのは，集合Aをソートした順に
表示するという意味です．並べ替えを元の集合に反映させるには，
A=A.sort()とし，元の集合に代入してやる必要があります．
\clearpage
\section{問い合わせ例}
これまで，見てきた問い合わせ
(selection,projection,join,group-by,order-by)を組み合わせることにより
より複雑な集約計算を行なうことができます．以下では次のようなクエリにつ
いて考えてみます．
``得意先ごとの売り上げを売り上げが多い順に，その得意先名と売り上げを出力す
る''
\begin{center}
\epsfile{file=query.eps}
\end{center}
\begin{enumerate}
\item Join , projection\\
得意先クラス，売上クラスを得意先番号によってJoinを行ない，新しくできた
表から得意先名，売上額をprojectionによって取り出します．(表1)
\begin{verbatim}
> Bag<[String customer,Integer sales]> result;
> result = [Customer.customerName,Sales.amountSold] from Customer, Sales
where Customer.customerNo == Sales.purchaserNo
\end{verbatim}
\item group-by\\
1の結果の表に対し，得意先名によってグループ化し，各グループごとの売り
上げの合計(sum)を求めます．(表2)
\begin{verbatim}
> result = group g in result by (g.customer) with (partition^sales.sum());
\end{verbatim}
\item order-by\\
2の結果を売上総額の多い順(降順)に並べ替えます．(表3)
\begin{verbatim}
> result = result.sort(``sales'',DESCEND);
\end{verbatim}
注：問い合わせの結果を求める手順は１つとは限りません．例えば，上では１つの例
を示しましたが，最初にgroup-byをした後にJoinを行なうこともできます．
\end{enumerate}
\section{実習}
group-by,order-by，さらにselection,projection,joinを組み合わせて問い合
わせを行ないましょう．Commodityクラス，Customerクラス，Salesクラスにサ
ンプルデータを挿入するファイルを\\/u/ryu/work/rinkou/database/querydata.odqlに置いとき
ます．自分でデータを作って挿入しても構いません．以下のような問い合わせ
をやってみてください．
\begin{itemize}
\item 問い合わせ例
\begin{enumerate}
\item 得意先ごとに何を売ったか\\
結果例
\begin{verbatim}
Bag{
[store: "Astore", fruits: Bag{ "Orange", "Grape", "Mellon" }],
[store: "Bstore", fruits: Bag{ "Orange", "Banana", "Apple" }],
[store: "Csotre", fruits: Bag{ "Grape", "Mellon", "Apple", "Orange" }]
}
\end{verbatim}
\item 得意先ごとに売り上げの平均値を求め，多い順に出力\\
結果例
\begin{verbatim}
Bag{
[store: "Astore", salesAverage: 1066],
[store: "Csotre", salesAverage: 600],
[store: "Bstore", salesAverage: 466]
}
\end{verbatim}
\end{enumerate}
\end{itemize}
\end{document}
|
http://math.huji.ac.il/~ijmath/index_tex/index92.tex | huji.ac.il | CC-MAIN-2017-39 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2017-39/segments/1505818689686.40/warc/CC-MAIN-20170923141947-20170923161947-00074.warc.gz | 218,483,542 | 2,742 | %File content.tex, 9 September, 1992
%\magnification=\magstep1
\input ij.sty
\input mssymb
\def\ {\thinspace}
\lineskiplimit=100pt
\lineskip=7pt %This controls the spacing between indexitems of
%both kinds
\tenpoint
\null\vskip 3cm
\def\index\indexvolume#1\indexyear#2\endindextitle{
\rm\parindent=0pt%\overfullrule=0pt
\centerline{ISRAEL JOURNAL OF MATHEMATICS}
\vskip0.4cm
\centerline{TABLE OF CONTENTS, VOLUME #1\unskip, #2\unskip}
\vskip1.2cm
\frenchspacing}
\def\endindex{}
\def\indexitem\indexauthor#1\indextitle#2\indexpage#3\endindexitem
{\halign {\normalbaselines%
\vbox{\hsize=11cm\hangindent=2em\hangafter=1 ##}%
&\hbox to 1.3cm{\hfill ##}\cr%
{\smc #1\unskip}\quad{\sl #2} & #3 \cr}\par}
\def\indexauthor{}
\def\endindexitem{}
\def\indexpage{}
\def\indextitle{}
\def\indexsee\indexauthor#1\partner#2\endindexitem
{{\smc #1\unskip\enspace}{\sl See }{\smc #2\unskip}\par}
\index
\indexvolume 92
\indexyear 1995
\endindextitle
\indexitem
\indexauthor Alonso, A.~I. and R.~Obaya
\indextitle Linear invariant measures for recurrent linear systems
\indexpage 185
\endindexitem
\indexitem
\indexauthor Amour, L.
\indextitle Almost periodicity for the nonlinear cubic Schr\"odinger
equation
\indexpage 333
\endindexitem
\indexitem
\indexauthor Assani, I., E.~Lesigne and D.~Rudolph
\indextitle Wiener--Wintner return-times ergodic theorem
\indexpage 375
\endindexitem
\indexitem
\indexauthor Balcar, B. and P.~Simon
\indextitle Baire number of the spaces of uniform ultrafilters
\indexpage 263
\endindexitem
\indexitem
\indexauthor Berend, D., M.~D.~Boshernitzan and G.~Kolesnik
\indextitle Distribution modulo 1 of some oscillating sequences, II
\indexpage 125
\endindexitem
\indexitem
\indexauthor Berkovich, V.~G.
\indextitle On the comparison theorem for \'etale cohomology of
non-Archimedean analytic spaces
\indexpage 45
\endindexitem
\indexsee
\indexauthor Boshernitzan, M.~D.
\partner D.~Berend
\endindexitem
\indexitem
\indexauthor Caro, Y.
\indextitle Zero-sum subsequences in abelian non-cyclic groups
\indexpage 221
\endindexitem
\indexitem
\indexauthor Deshouillers, J-M. and G.~A.~Freiman
\indextitle On an additive problem of Erd\H{o}s and Straus, 1
\indexpage 33
\endindexitem
\indexitem
\indexauthor Dilworth, S.~J. and A.~L.~Koldobsky
\indextitle The Fourier transform of\break order statistics with
applications to Lorentz spaces
\indexpage 411
\endindexitem
\indexitem
\indexauthor Donin, J. and D.~Gurevich
\indextitle Some Poisson structures associated to Drinfeld--Jimbo
R-matrices and their quantization
\indexpage 23
\endindexitem
\indexitem
\indexauthor Drensky, V.
\indextitle New central polynomials for the matrix algebras
\indexpage 235
\endindexitem
\indexitem
\indexauthor van den Dries, L. and C.~Miller
\indextitle Correction to ``On the real\break exponential field with
restricted analytic functions" by Lou van den Dries and Chris
Miller, Israel Journal of Mathematics, Vol. 85, 1994, pp. 19--56
\indexpage 427
\endindexitem
\indexsee
\indexauthor Freiman, G.~A.
\partner J-M.~Deshouillers
\endindexitem
\indexitem
\indexauthor Ginzburg, D.
\indextitle On the symmetric fourth power $L$-function of GL$_2$
\indexpage 157
\endindexitem
\indexitem
\indexauthor Gitik, M.
\indextitle Some results on the nonstationary ideal
\indexpage 61
\endindexitem
\indexsee
\indexauthor Gurevich, D.
\partner J.~Donin
\endindexitem
\indexitem
\indexauthor Judah, H. and M.~Repick\'y
\indextitle No random reals in countable support iterations
\indexpage 349
\endindexitem
\indexitem
\indexauthor Kojman, M. and S.~Shelah
\indextitle Universal abelian groups
\indexpage 113
\endindexitem
\indexsee
\indexauthor Koldobsky, A.~L.
\partner S.~J.~Dilworth
\endindexitem
\indexsee
\indexauthor Kolesnik, G.
\partner D.~Berend
\endindexitem
\indexsee
\indexauthor Lesigne, E.
\partner I.~Assani
\endindexitem
\indexitem
\indexauthor Livn\'e, R.
\indextitle Motivic orthogonal two-dimensional representations of\break
Gal({$\bar{\Bbb Q}$}/${\Bbb Q}$)
\indexpage 149
\endindexitem
\indexitem
\indexauthor Margolis, S.~W. and M.~V.~Sapir
\indextitle Quasi-identities of finite semigroups and symbolic
dynamics
\indexpage 317
\endindexitem
\indexitem
\indexauthor Masuoka, A.
\indextitle Semisimple Hopf algebras of dimension 6, 8
\indexpage 361
\endindexitem
\indexsee
\indexauthor Miller, C.
\partner L.~van den Dries
\endindexitem
\indexsee
\indexauthor Obaya, R.
\partner A.~I.~Alonso
\endindexitem
\indexsee
\indexauthor Repick\'y, M.
\partner H.~Judah
\endindexitem
\indexsee
\indexauthor Rudolph, D.
\partner I.~Assani
\endindexitem
\indexsee
\indexauthor Sapir, M.~V.
\partner S.~W.~Margolis
\endindexitem
\indexsee
\indexauthor Shelah, S.
\partner M.~Kojman
\endindexitem
\indexsee
\indexauthor Simon, P.
\partner B.~Balcar
\endindexitem
\indexitem
\indexauthor Simon, R.~S., S.~Spie\.{z} and H.~Toru\'nczyk
\indextitle The existence of\break equilibria in certain games, separation
for families of convex\break functions and a theorem of Borsuk--Ulam type
\indexpage 1
\endindexitem
\indexsee
\indexauthor Spie\.{z}, S.
\partner R.~S.~Simon
\endindexitem
\indexitem
\indexauthor Taskinen, J.
\indextitle Linearization of holomorphic mappings on $C(K)$-spaces
\indexpage 207
\endindexitem
\indexsee
\indexauthor Toru\'nczyk, H.
\partner R.~S.~Simon
\endindexitem
\indexitem
\indexauthor Watanabe, T.
\indextitle The local theta correspondence for unramified unitary
groups
\indexpage 397
\endindexitem
\indexitem
\indexauthor Zhang, Q.
\indextitle An example of compact extensions of Kronecker factors
and skew products of irrational rotations with finite groups
\indexpage 249
\endindexitem
\endindex
%End of file, content.tex
|
http://refbase.athabascau.ca/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%20notes%20FROM%20refs%20WHERE%20serial%20%3D%20677%20ORDER%20BY%20type%20ASC%2C%20thesis%20DESC%2C%20year%20DESC%2C%20first_author%2C%20author_count%2C%20author%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=5&rowOffset=&wrapResults=1&citeOrder=type-year&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=¢er=fst | athabascau.ca | CC-MAIN-2018-51 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2018-51/segments/1544376823442.17/warc/CC-MAIN-20181210191406-20181210212906-00551.warc.gz | 245,725,177 | 1,315 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\section*{Conference Proceedings}
\subsection*{2009}
Li, S. - C., Chu, K.-K., \& Chang, M. (2009). Applying Formal Concept Analysis to Teaching Material Extraction. In \textit{In the Proceedings of the AACE World Conference on E-Learning in Corporate, Government, Healthcare \& Higher Education} (pp. 481--487).
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=54153&type=tex | zentralblatt-math.org | CC-MAIN-2019-43 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-43/segments/1570986657949.34/warc/CC-MAIN-20191015082202-20191015105702-00431.warc.gz | 1,139,386,877 | 1,085 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2005b.00119}
\itemau{Fothe, Michael}
\itemti{Time and space in Quicksort. (Zeit und Raum bei Quicksort.)}
\itemso{Log In 23, No. 130, 49-50 (2004).}
\itemab
In diesem Beitrag werden drei Schritte angegeben, in denen das Zeit- und Speicherverhalten des Sortierverfahrens Quicksort im Informatikunterricht - weder zu theoretisch, noch zu sehr vereinfachend - behandelt werden kann.
\itemrv{~}
\itemcc{Q84 P24}
\itemut{computer science education; teaching units; sorting algorithms}
\itemli{}
\end |
http://www.res-systemica.org/afscet/resSystemica/modeles/exemple-res-systemica.tex | res-systemica.org | CC-MAIN-2023-14 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2023-14/segments/1679296946445.46/warc/CC-MAIN-20230326173112-20230326203112-00107.warc.gz | 94,471,185 | 3,791 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Ce ficher est du LaTeX.
% exemple article pour ``Res-systemica''
% Fran\c{c}ois Dubois, 06 novembre 2014
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\documentclass[12pt,a4paper,twoside,final,notitlepage, leqno]{article}
\usepackage[english]{babel}
\usepackage[T1]{fontenc}
\usepackage{epsfig, graphicx, amssymb}
\usepackage{amsmath,amsthm,epsfig,amsfonts,bbm}
\usepackage{xcolor}
\setlength{\textheight}{23cm}
\setlength{\textwidth}{16cm} %
\setlength{\oddsidemargin}{0.0cm} %
\setlength{\parindent}{0.625cm}
\setlength{\hoffset}{0.cm}
\setlength{\voffset}{0.cm}
\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\topmargin}{-1cm}
\setlength{\footskip}{1cm}
\setlength{\headheight}{1.5cm}
\setlength{\headsep}{1cm}
\setlength{\unitlength}{1 mm}
\setlength{\leftmargini}{0cm}
\newenvironment{changemargin}[2]{\begin{list}{}{%
\setlength{\topsep}{0pt}%
\setlength{\leftmargin}{0pt}%
\setlength{\rightmargin}{0pt}%
\setlength{\listparindent}{\parindent}%
\setlength{\itemindent}{\parindent}%
\setlength{\parsep}{0pt plus 1pt}%
\addtolength{\leftmargin}{#1}%
\addtolength{\rightmargin}{#2}%
}\item }{\end{list}}
\DeclareFixedFont{\titre}{T1}{pag}{b}{n}{26pt}
\DeclareFixedFont{\soustitre}{T1}{pag}{b}{n}{13pt}
\definecolor{grenat}{cmyk}{0,1,1,.5}
\definecolor{doie}{cmyk}{0, 0, 1, .5}
\definecolor{bleue}{cmyk}{.67, .44, 0, .40}
\usepackage[bottom]{footmisc}% places footnotes at page bottom
%%%%%%%%%%%%%%%%%%%%%%%% footnote 01 sept 2012
\renewcommand{\thefootnote}{\arabic{footnote}}
%% \renewcommand{\thefootnote}{\fnsymbol{footnote}}
%%%%%%%%%%%%%%%%%%%%%%%% footnote 01 sept 2012
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% saut de ligne
\def\br {\break}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\linespread{1.1}
\pagestyle{myheadings}
%\raggedbottom % pour eviter les orphelins en debut et fin de page
\baselineskip 17.2 true pt
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% fin ajouts fd, 16 nov 07
% petite boulette (fd)
\def \smb {{\scriptstyle \bullet }}
\newcommand{\monitem}{ \smallskip \noindent $\bullet$ \quad }
\newcommand{\moneq}{\vspace*{-6pt} \begin{equation} \displaystyle }
\newcommand{\moneqstar}{\vspace*{-6pt} \begin{equation*} \displaystyle }
\newcommand{\monendstar}{\vspace*{-6pt} \end{equation*} }
\newcommand{\monend}{\vspace*{-6pt} \end{equation} }
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\newcommand{\dd}{{\rm d}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\N}{\mathbb{N}}
% la commande de carre non rempli :
\newcommand{\fin} {\Bb \hfill {\framebox[3mm]{ \rule{0cm}{1mm}}}}
\newcommand{\Int} {\displaystyle \int}
\newcommand{\Sup} {\displaystyle \sup}
\newcommand{\Inf} {\displaystyle \inf}
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% utilitaire a grande matrice...
\newcommand{\pet} { & \scriptscriptstyle \mathbf \!\!\!\!\!\! }
%\overfullrule=1pt
\hfuzz=11pt
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% fd nov 2010
% on abandonne les sections pre-programmees.
\def\section*#1{}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% fd nov 2010
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\usepackage{fancyhdr}
\fancyhf{}
\pagestyle{fancy}
\renewcommand{\headrulewidth}{0pt}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{document}
\hfill {\titre {\textcolor{grenat}{Res-Systemica}}}
\hfill {\soustitre {\textcolor{doie}{Revue Fran\c caise de Syst\'emique}}}
\hfill {\soustitre {\textcolor{bleue}{Fond\'ee par Evelyne Andreewsky}}}
\vskip -2.0cm
\noindent {\includegraphics[height=1.4cm] {afscet_m.png}}
\fancypagestyle{plain}{ \fancyfoot{} \renewcommand{\footrulewidth}{0pt}}
\fancypagestyle{plain}{ \fancyhead{} \renewcommand{\headrulewidth}{0pt}}
\bigskip \bigskip \bigskip \bigskip \bigskip \bigskip
\centerline {\bf \LARGE Premi\`ere ligne du titre }
\bigskip \centerline {\bf \LARGE seconde ligne \'eventuelle }
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 01 sept 2014
\bigskip \bigskip
\centerline { \large Pr\'enom Nom$^{a,b}$ et Second Auteur$^{c}$ }
\bigskip
\centerline { \it \small
$^a$ institution du premier auteur }
\centerline { \it \small adresse de l'institution}
\centerline { \it \small
$^b$ seconde institution \'eventuelle du premier auteur }
\centerline { \it \small adresse de la seconde institution}
\centerline { \it \small
$^c$ institution du seond auteur }
\centerline { \it \small adresse de cette institution}
\centerline { \it \small
[email protected], [email protected] }
\bigskip \smallskip %%% \bigskip \bigskip
\centerline { {\rm 04 novembre 2014}
\footnote {\rm \small $\,\,$ Cette contribution soumise \`a
{\it Res-Systemica} fait suite \`a un expos\'e donn\'e au groupe
de travail ``Mod\'elisation des Syst\`emes Complexes'' au CNAM
le 33 janvier 2999.}}
\smallskip %% \bigskip \bigskip
\begin{changemargin}{1cm}{1cm}
\noindent {\bf R\'esum\'e. }
\noindent
Introduire ici un r\'esum\'e. Il doit \^etre assez court de fa\c con que
tout ce qui se situe avant l'introduction
tienne si possible sur une seule page.
\end{changemargin}
\bigskip \bigskip
\centerline {\bf \large Titre traduit en anglais}
\begin{changemargin}{1cm}{1cm}
\noindent {\bf Abstract}
\noindent
Here is the abstract in english.
\end{changemargin}
\bigskip \noindent
{\bf Mots-cl\'es} : premier mot-cl\'e, second mot-cl\'e.
\smallskip \noindent
{\bf Classification} : \qquad [\'eventuellement]
\newpage
\fancyhead[EC]{\sc{Pr\'enom Nom et Second Auteur}}
\fancyhead[OC]{\sc{Premi\`ere ligne du titre seconde ligne \'eventuelle}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% jolie numerotation des pages
\fancyfoot[C]{\oldstylenums{\thepage}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% fin jolie numerotation des pages
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\bigskip \bigskip \noindent {\bf \large Introduction }
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\noindent
L'introduction se situe en haut de la seconde page.
Si par malheur le titre de l'article et le r\'esum\'e sont longs,
elle peut \'eventuellement d\'emarrer dans le courant de la seconde page.
\smallskip \noindent
On fait un petit saut de ligne entre deux paragraphes.
\smallskip \noindent
La langue conseill\'ee pour {\it Res Systemica} est le Fran\c cais.
Toutefois, certaines contributions en langue anglaise sont
les bienvenues.
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\bigskip \bigskip \noindent {\bf \large 1) \quad Premier paragraphe }
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\noindent
Il est possible de citer un article \cite{Bo13}
ou bien un livre \cite {Ma75}. Mais alors on fera attention que le
mode de pr\'esentation des deux r\'ef\'erences
n'est pas le m\^eme.
\smallskip \noindent
On peut avoir besoin de symboles math\'ematiques
au sein du texte comme la fonction d'onde $\psi(x)$.
Mais il peut \^etre utile aussi d'introduire une formule
%
\moneq \label{schroedinger}
H \, \psi \,=\, E \, \psi
\monend
%
avec un num\'ero de label.
On peut enfin citer la relation (\ref{schroedinger}).
\smallskip \noindent
L'introduction de figures est \'egalement
possible, comme pour la figure~1 ci-dessous. Leur num\'erotation se
fait ``\`a la main''. Leur placement est libre.
L'auteur doit faire attention de ne pas cr\'eer des pages quasiment blanches...
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Figure 1 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\bigskip
\centerline {\includegraphics[height=2.4cm] {afscet_m.png}}
\smallskip \noindent {\bf Figure 1}. \quad
Le logo de l'AFSCET, dont l'\'el\'egance n'\'echappera \`a personne...
\bigskip
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\bigskip \bigskip \noindent {\bf \large 2) \quad Second paragraphe }
%%%%%%%%%%%%%%%%%%%%%%%%%% 05 novembre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\noindent
Le document se poursuit...
%%%%%%%%%%%%%%%%%%%%%%%%%% 31 octobre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\bigskip \noindent {\bf \large Conclusion }
%%%%%%%%%%%%%%%%%%%%%%%%%% 31 octobre 2014 %%%%%%%%%%%%%%%%%%%%%%%%
\noindent
Quelques mots de conclusion sont toujours utiles !
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%% \bigskip \noindent {\bf \large A propos des auteurs }
%%%%%%%% \noindent
%%%%%%%% Une courte bio est parfois demand\'ee.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\bigskip \bigskip \noindent {\bf \large References }
\begin{thebibliography}{99}
\bibitem{Bo13}
N. Bohr.
``On the Constitution of Atoms and Moecules, Part 1'',
{\it Philosophical Magazine}, volume 26,
p.~1-24, 1913.
\bibitem{Ma75}
B. Mandelbrot. {\it Les Objets fractals, forme, hasard et dimension}, Flammarion,
Paris, 1975.
\end{thebibliography}
\end{document}
|
http://ofap.ulstu.ru/resources/1275/two_certificate.tex?association=resources&parent_scaffold=fremantle%2Fguest%2Fresource_types&resource_type_id=26 | ulstu.ru | CC-MAIN-2023-06 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2023-06/segments/1674764500151.93/warc/CC-MAIN-20230204173912-20230204203912-00309.warc.gz | 30,740,311 | 2,673 | %% LaTeX2e-файл
%% Создано движком Фримантл (https://gitlab.com/korobkov/fremantle)
%% в 2023-02-04T23:38:46+04:00
%% Фримантл — Свободный движок репозитория электронных ресурсов
%% Copyright © 2009—2018 Лаборатория «Автоматизированные системы» [email protected], УлГТУ
%%
%% Фримантл 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/two_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{Свидетельство №\,1275}}
\bigskip
о регистрации программно-информационного продукта
\end{tabu}
\bigskip
\begin{tabu}{ b{5cm} >{\raggedright \itshape}p{19cm} }\hline \\
Наименование: & \textbf{Моделирование листовых деталей в системе КОМПАС-3D} \\
Тип: & Методические указания \\
URI: & \textbf{http://ofap.ulstu.ru/1275} \\
Авторы: & Коршунов Дмитрий Александрович, Рандин Алексей Владимирович --
Кафедра «Начертательная геометрия и черчение» (УлГТУ/МФ) \\
Дата регистрации: & 27 октября 2009 г. \\
\end{tabu}
\vfill
\begin{tabu} to 24cm { b{2cm} l X >{\itshape}l }
& Директор Ульяновского областного центра НИТ & & \textit{К.В.\,Святов} \\
\psbarcode{2009-10-27 http://ofap.ulstu.ru/1275}{format=compact layers=4}{azteccode}
\rowfont{\small} & Администратор базы данных ОФАП & & \textit{Ю.А.\,Лапшов} \\
\end{tabu}
\end{center}
\end{hyphenrules}
\clearpage
\end{document}
|
https://theanarchistlibrary.org/library/morpheus-basic-principles-of-anarchism.tex | theanarchistlibrary.org | CC-MAIN-2020-45 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-45/segments/1603107910204.90/warc/CC-MAIN-20201030093118-20201030123118-00704.warc.gz | 541,877,446 | 16,408 | \documentclass[DIV=12,%
BCOR=10mm,%
headinclude=false,%
footinclude=false,open=any,%
fontsize=11pt,%
twoside,%
paper=210mm:11in]%
{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{english}
\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\englishfont{LinLibertine_R.otf}[Script=Latin,%
Path=/usr/share/fonts/opentype/linux-libertine/,%
BoldFont=LinLibertine_RB.otf,%
BoldItalicFont=LinLibertine_RBI.otf,%
ItalicFont=LinLibertine_RI.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{Basic Principles of Anarchism}
\date{25\textsuperscript{th} June 2003}
\author{Morpheus}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Basic Principles of Anarchism},%
pdfauthor={Morpheus},%
pdfsubject={},%
pdfkeywords={introductory; principles}%
}
\begin{document}
\begin{titlepage}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Basic Principles of Anarchism\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Morpheus\par}}%
\vskip 1.5em
\vfill
{\usekomafont{date}{25\textsuperscript{th} June 2003\par}}%
\end{center}
\end{titlepage}
\cleardoublepage
\tableofcontents
% start a new right-handed page
\cleardoublepage
\section{\textbf{Common Myths About Anarchism:}}
\subsection{\textbf{Anarchists advocate complete chaos}}
This is a complete myth with no basis in reality. Anarchists do not advocate chaos and anarchy does not mean chaos. Similar slander used to be said about the ideas of democracy and republics. In places where a Monarchy was thought necessary the idea of elected governments was often equated with complete chaos. This association is the result of slander by the powerful (the state, corporations, etc.) that control the media and is, unfortunately, not a surprise. Since anarchists seek to overthrow them it is not surprising that they would slander anarchism with all sorts of absurd nonsense.
\subsection{\textbf{Anarchists believe in mindless violence}}
Another common stereotype is that of the mad bomb-throwing anarchist who advocates carnage and destruction for the sake of it. This too is a myth. Anarchists do not normally go around throwing bombs at everyone nor do we consider beating up old ladies a virtue. It is true that there have been anarchists who have used violence to advance their cause but this is true of every political philosophy. Republicans and democrats have used much more violence throughout history then anarchists, yet they are never demonized as crazed bomb throwers. Indeed, the state is not only inherently violent but the most violent organization in human history. It uses violence on a systemic level (in the form of police \& militaries) and is responsible for numerous genocides. The state is vastly more violent than the most violent of anarchists.
\subsection{\textbf{Anarchists, by definition, are opposed to organization}}
The vast majority of anarchists are not opposed to organization. What anarchists are opposed to is hierarchical organization — organizations in which one group of people tells the other members what to do. Instead anarchists advocate organization without authority, where all members have an equal say in group decisions.
\section{\textbf{What Anarchism Really Stands For}}
Anarchy comes from the Greek and literally means “no rulers.” Anarchists are anti-authoritarians who seek to abolish domination. It is important to differentiate between different two types of authority: legitimate (or rational) authority and illegitimate (or irrational) authority. In other words, there’s a difference between being an authority and having authority. Being an authority means that a person is recognized as competent for any particular task based on her or his knowledge and individual skills. It is socially acknowledged expertise. Legitimate authorities are experts who are particularly knowledgeable, skillful or wise in any particular area. It may be in our best interests to follow their recommendations, but they have no power to force us to do so, nor should they. Legitimate authority is this kind of authority, the authority of an expert.
Having authority is a social relationship based on status and power derived from a hierarchical position within a group. It means dividing society\Slash{}the group into the order givers and the order takers. The order givers, the authorities, tell the order takers what to do and they must obey. This is illegitimate authority. A boss, for example, is an illegitimate authority because employees must obey his orders. When something is described as “authoritarian” it usually means that it uses illegitimate authority.
Hierarchy is essentially institutionalized authority. It is a pyramidally structured organization consisting of a series of grades, ranks or offices of increasing power, prestige, and\Slash{}or remuneration. Those with lower ranks must obey those with higher ranks. Hierarchies maintain control by coercion — the threat of negative sanctions (physical, economic, social, etc.) against those who don’t obey. Hierarchical organizations are, by definition, organizations that are run by elites. Those on the top, the elite, have more power then those on the bottom. Hierarchical authority is the authority that is inherent in any hierarchy. This is the same thing as illegitimate (or irrational) authority — that is, relations of command and obedience. Another name for this is domination.
Anarchism is extreme skepticism of authority. The basic idea is to abolish domination in favor of a society based on voluntary cooperation. As the anarchist Noam Chomsky said:
\begin{quote}
“I think it only makes sense to seek out and identify structures of authority, hierarchy, and domination in every aspect of life, and to challenge them; unless a justification for them can be given, they are illegitimate, and should be dismantled, to increase the scope of human freedom. That includes political power, ownership and management, relations among men and women, parents and children, our control over the fate of future generations (the basic moral imperative behind the environmental movement, in my view), and much else. Naturally this means a challenge to the huge institutions of coercion and control: the state, the unaccountable private tyrannies that control most of the domestic and international economy, and so on. But not only these. That is what I have always understood to be the essence of anarchism: the conviction that the burden of proof has to be placed on authority, and that it should be dismantled if that burden cannot be met. Sometimes the burden can be met. If I’m taking a walk with my grandchildren and they dart out into a busy street, I will use not only authority but also physical coercion to stop them. The act should be challenged, but I think it can readily meet the challenge. And there are other cases; life is a complex affair, we understand very little about humans and society, and grand pronouncements are generally more a source of harm than of benefit. But the perspective is a valid one, I think, and can lead us quite a long way.”\footnote{“Chomsky on Anarchism, Marxism and Hope for the Future” Inteview in Red \& Black Magazine 1995}
\end{quote}
Following Chomsky’s logic, anarchists argue that hierarchy, bodies of people having authority over others, is unjustified and should be abolished. Some anarchists take this a step further and oppose other forms of authority; a few argue that “legitimate authority” (expertise) is also unjustified, but most do not. Unless a good justification can be given for any form of authority it should be abolished. In the case of hierarchical authority anarchist believe there is no valid justification for it; all major hierarchical institutions should be abolished. Instead of dividing society into a hierarchy of order givers and order takers everyone should have control over their own life and an equal say in group decisions.
\section{\textbf{What Anarchists Oppose}}
\subsection{\textbf{Hierarchy}}
As explained above, anarchists are opposed to domination. Relations of command and obedience are not only unnecessary but also inherently detrimental to humanity. Everyone should have control of their own life instead of being bossed around by others.
\subsection{\textbf{Capitalism}}
Capitalism is an economic system based upon wage labor. Under capitalism a small group of people, the capitalist class, owns the means of production (land, factories, mines, etc.) and the working class (the majority of the population) must sell their labor to the capitalist class in order to survive. If the workers do not sell their labor they will starve because they do not have access to the means of production — the capitalist class monopolizes them. The ownership of the means of production by the capitalists does not have to be direct but can be through an organization they control, such as corporations. Anarchists are also opposed to all other class systems but focus on capitalism because it is the dominant economic system today. Class is economic hierarchy. Other class systems include feudalism, soviet-style “socialism” (which many anarchists consider to be a form of state-capitalism) and slavery.
\subsection{\textbf{The State}}
Sociologists define the state (also called government) as an organization with a monopoly (or near monopoly) on the legitimate use of violence. It is a centralized rule making body with a pyramidal, hierarchical structure that uses its monopoly of force to boss around all those within its territory. It maintains various armed bodies of people (police, military) and coercive institutions (courts, prisons) with which it coerces the population into obeying its dictates. Because of its hierarchical structure and monopoly of force the state always acts to enforce the rule of a small elite. It exists not to “enforce order” or anything like that but to enforce the will of the ruling class. Anarchists are opposed to all states, including:
\subsection{\textbf{Representative “Democracy”}}
Elected governments are run by and for a small elite, just like all other states. Elected representatives are not tied in any substantial way to particular policies, regardless of the preferences of the electorate. Ordinary people have no real control over the decisions of the politicians — once elected they can make what ever decisions they want regardless of what most people want. Representatives are separated from the population but exposed to powerful pressure groups including state bureaucracies, corporations, lobbyists and political party power brokers.
\subsection{\textbf{“Socialist” States}}
Attempts to overthrow the capitalist class and implement a socialist “workers’ state” inevitably lead to the replacement of the old ruling class with a new, bureaucratic ruling class that exploits the working class just as the old ruling class did. There is no effective way for the working class as a whole to control the state. It has a monopoly of force and will simply use that monopoly to establish itself as a new ruling class. Decision making power lies with the leaders, not with the masses of ordinary workers. When the politburo or parliament or council of people’s commissars or other leaders are making the decisions the workers are not.
\subsection{\textbf{Patriarchy}}
Patriarchy is male domination — a social relation in which men have power over women; gender hierarchy. In every society men and women are expected to behave in certain ways and if they do not they are subjected to various forms of coercion ranging from being made fun of to violence to exile. How a man or woman is expected to behave in a given society is called their gender. This is different from sex, which refers to the biological characteristics that distinguish male from female. Gender varies greatly from society to society. Under patriarchy gender is constructed so that, on average, men have more power than women. The results of this are quite negative — in addition to diminishing women’s freedom it also results in sexual harassment, reduced opportunities for women, rape and various other forms of sexual violence. Anarchists advocate equality of the sexes.
\subsection{\textbf{Heterosexism}}
Heterosexism is a natural outcome of the form of patriarchy that exists in the west and many other parts of the world. Gender in most modern patriarchical societies is constructed so that heterosexual behavior is the norm. Homosexuals deviate from how men and women are expected to behave and so are subjected to various forms of coercion as a result. There is thus a hierarchy between hetero and homosexuals. Anarchists are opposed to any sort of oppression on the basis of one’s sexuality.
\subsection{\textbf{White Supremacy}}
Race is a social construction. It divides a population into a hierarchical set of “races” with those on top — the white race — having privileges and power over those in other “lower” races. Race is hereditary. Usually people are assigned to their race based on some meaningless characteristic, such as skin color. Race is not at all biological but is a pure social construction. Looking at different societies that have different constructions of race easily proves this. What Americans call blacks are actually broken into several different races in most Latin American countries (blacks, mulattos, etc). In the US Irish, Italians and East Europeans were considered non-white a hundred years ago but today are considered whites. In Rwanda two groups most Americans would consider black, Hutus and Tutsis, are regarded as two different races. White supremacy first arose with the Atlantic Slave Trade as a way of justifying it and of splitting the working class to insure that poor whites did not ally with rebellious blacks.
\subsection{\textbf{Imperialism}}
Imperialism is a social relationship in which the rulers of one country dominate the population of another country or territory. At present the United States is the main imperialist nation, dominating most other countries in the world. Past imperialist powers have included the Soviet Union, Rome, Germany, England and the Aztecs.
\section{\textbf{Basic Principles of Anarchism}}
\subsection{\textbf{Anti-Authoritarianism}}
Anarchists are extremely skeptical about the need for any kind of authority. At minimum all anarchists believe that hierarchy should be abolished and some take this further and oppose other forms of authority. Instead of hierarchy, everyone should have control over their own life and an equal say in group decisions.
\subsection{\textbf{Free Association}}
Everyone should be allowed to associate freely with those they choose and to disassociate themselves when they choose. Individuals should not be forced into social relations against their will. Society should be based upon free agreement, rather than coercion.
\subsection{\textbf{Mutual Aid}}
Instead of attempting to dominate each other social relations should be based on solidarity and voluntary cooperation. When individuals come together to help each other they can accomplish more than when they work against each other.
\subsection{\textbf{Freedom}}
Freedom means the ability to control one’s own life instead of being controlled by others, as is the case with hierarchy. This is sometimes called liberty or autonomy. Controlling other people’s lives is not freedom but a restriction of freedom.
\subsection{\textbf{Self-Management}}
In groups decisions should be made in a manner so that everyone has an equal say. People should govern themselves, rather than dividing people into some who give orders and some who obey as in hierarchical organizations.
\subsection{\textbf{Radical Egalitarianism}}
Anarchists believe in an egalitarian society. This does not mean some totalitarian society where everyone is identical or lives identical lives. It does not mean denying individual diversity or uniqueness. Rather anarchists believe in equality of both wealth and power — a natural consequence of the abolition of hierarchy.
\subsection{\textbf{Feminism}}
Anarchists favor social, economic and political equality for men and women. The domination of men over women should be abolished and all people given control of their own lives.
\section{\textbf{What An Anarchist Society Would Look Like}}
There have been many different visions of what an anarchist society would look like. Any vision that abolishes the things anarchists are opposed to and is consistent with the earlier stated principles of anarchism is compatible with anarchy. There are, however, many institutions that have been proposed by anarchists to run a non-hierarchical society. Most of these are not based on idle speculation but by looking at how actually existing anarchist societies have worked. Some of them are:
\subsection{\textbf{Popular Assemblies}}
Also called general assemblies or mass assemblies. In any organization people can come together to meet and discuss whatever common problems or activities they face. At these assemblies everyone should have an equal opportunity to participate in both the discussion\Slash{}debate and the final decisions. These can be formed in workplaces where they would take over the running of all workplaces. Worker assemblies would then meet regularly to plan production, divvy up the tasks that need to be accomplished, etc. They can be formed in each neighborhood in order to deal with whatever particular issues confront that neighborhood and organize to deal with them. These are based on free association so whenever a group of people wants to get together to accomplish some goal they can simply form a general assembly to organize it. Free association also means that no one would have to participate in an assembly if they did not want to. Such assemblies can be formed to organize around anything — not only around workplace and neighborhood issues but potentially also universities, clubs, space exploration, etc. Worker assemblies, neighborhood assemblies, university assemblies, community assemblies and the like can all be formed to run society without hierarchy, based on self-management.
\subsection{\textbf{Councils}}
The different assemblies can coordinate their activities through the use of a council system. This is done by each assembly assigning a contact person(s) (sometimes called a spoke or delegate) to meet with other contact people from other assemblies which they want to coordinate things with. The meeting of contact people is called a council or spokescouncil. Position of contact person should rotate frequently. Each contact person is mandated, meaning that they are instructed by the assembly that they come from on how to deal with any issue. The contact people would be given binding instructions, committing them to a framework of policies, developed by their assembly, within which they would have to act. If at any time they violate their mandate their assembly would instantly recall them and their decisions revoked. Decision making power stays in the assemblies; contact people simply convey and implement those positions. Contact people do not have any authority or special privileges. Councils are organized from the bottom up, with control staying in the assemblies. They are not hierarchical organizations but simply coordinate the activities of the assemblies without authority. Instead of hierarchy there are decentralized confederations and networks. This differs from representative institutions in that decision making power stays in the assemblies whereas representatives can make whatever decisions they want and have authority over others. These councils can be formed to coordinate the activities of assemblies on whatever level needed. Worker councils can coordinate the activities of the worker assemblies; neighborhood councils can coordinate the activities of different neighborhood assemblies, etc. They can also do this on a regional scale — forming regional worker councils, etc — and those regional confederations can use the same method to coordinate with each other. In all cases decision making power stays with the assemblies upon which the councils are based — the assemblies would be the core of any organization.
\subsection{\textbf{Decision Making Processes}}
Any decision making process in which everyone has control over their own life and all members have an equal say, rather than dividing people into order givers and order takers, is theoretically compatible with anarchism. Although there are many different ways in which this can be done, there are two main methods of non-hierarchical decision making which are advocated by most anarchists:
\subsection{\textbf{Consensus}}
In consensus everyone in the group must agree to a decision before it can be put into action. All contributions are valued and participation is encouraged. Any member can block consensus, stopping a decision they strongly object to. Members may also “stand aside,” allowing a decision they do not like to be made without blocking or supporting it.
\subsection{\textbf{Direct Democracy}}
Decisions would be made by directly voting on the options — the option with a majority of votes is implemented. Anarchists who advocate direct democracy do not believe in a mechanical process whereby the majority just votes away the minority and ignores them. It is intended to be a dynamic discussion process where different people listen to each other and exchange ideas. Direct Democracy is combined with free association as well — meaning that anyone who is out-voted does not absolutely have to abide by the decision. They can simply leave the group.
These decision making processes would be used in the popular assemblies, councils, etc. There are many variations on them and it is also possible to synthesize consensus and direct democracy. Some groups could use direct democracy but require the majority be of a certain size (such as 2\Slash{}3rds or 3\Slash{}4ths) instead of a simple majority. Another variation is to attempt to achieve the largest majority possible.
\subsection{\textbf{Economics}}
There have been many different economic systems envisioned by anarchists. These different visions are not necessarily incompatable with each other and could probably co-exist within the same society. The main ones are:
\subsection{\textbf{Mutualism}}
In mutualism people would be either self-employed or part of a worker-controlled cooperative (individual cooperatives would be run by worker assemblies as described above). They would produce goods and trade them on a market. Although mutualism uses markets to coordinate production it is not capitalist because wage labor would be abolished. No one would sell their labor to others but would instead work in cooperatives or for themselves.
\subsection{\textbf{Collectivism}}
In Collectivism markets would be abolished. Instead of using markets to coordinate production they would set up workers councils, as described above, to coordinate production. Each workplace would be run by it’s own worker assembly and each assembly would federate with other workplace assemblies in the area, forming a local workers council. The workers councils would federate with each other (forming more councils) as needed on many levels. Money would be kept and people paid on the basis of how much they work. Most collectivists believe that collectivism would eventually evolve into a gift economy.
\subsection{\textbf{Participatory Economics}}
Also called Parecon. This is similar to collectivism; the biggest difference is that there are consumer assemblies in addition to worker assemblies. The underlying values parecon seeks to implement are equity, solidarity, diversity, and participatory self management. The main institutions to attain these ends are council self management, balanced job complexes, remuneration according to effort and sacrifice, and participatory planning. Consumers and workers directly democratically and cooperatively negotiate their production and consumption on an individual basis and via worker and consumer councils and federations of councils. Balanced job complexes share quality of work and empowering work equitably throughout the workplace and the entire economy. Workers are remunerated for effort and sacrifice, so in tandem with balanced job complexes consumption bundles are roughly equal, with minor discrepancies due to people’s chosen working hours and intensity.
\subsection{\textbf{Gift Economy}}
Also called anarcho-communism or libertarian communism. A gift economy would abolish money and trading all together. Production and distribution would be done purely on the basis of need through a confederation of free communes. The economy would be organized along the lines of “from each according to ability, to each according to need.” The “communism” in anarcho-communism has nothing to do with the countries which some erroneously call “Communist” (USSR, China, etc.). None of those countries actually claimed to be communist; they claimed to be in a transition to communism. Anarcho-communists opposed these dictatorships from the very beginning and have participated in many rebellions against them. Anarcho-communists would do away with money, central planning and the state — all of which were present in the USSR, China, etc.
\subsection{\textbf{Primitivism}}
Primitivists would abolish industry, civilization and most forms of technology. Instead anarcho-primitivists advocate a low-tech green society. This would be either an agrarian or hunter-gatherer society. Primitivists are split on the question of agriculture: some want to do away with it all together and others would keep some forms of primitive agriculture.
\section{\textbf{How Might An Anarchist Society Be Created}}
\subsection{\textbf{Self-Liberation}}
Anarchists believe in self-liberation. The liberation of the oppressed can only come about through the actions of the oppressed themselves (either individually or collectively). Those on the bottom of society have to rebel against those on the top and refuse to obey them. People cannot be forced to be free. Anarchy cannot be created by some vanguard seizing power but only by the self-liberation of the oppressed.
\subsection{\textbf{Direct Action}}
Direct action means that instead of relying on someone else to act for you (such as a politician) act for yourself. It is any action which people themselves decide upon and organize themselves that is based on their own collective strength and does not rely on getting intermediates to act for them. Examples of direct action include strikes, boycotts, sabotage, insurrections and civil disobedience. Direct action can also be liberatory because it puts power in the hands of ordinary people; instead of relying on someone else to do something we do it ourselves.
\subsection{\textbf{Building the New Society within the Shell of the Old}}
The means you use will greatly affect the ends you get. As such anarchists organize along the same principles in which we advocate organizing society: non-hierarchically. For this reason anarchist organizations are often based around general assemblies and spokescouncils. Many anarchists see the initial framework of anarchy being created within the old society, before capitalism and the state are abolished. Popular organs of self-management would be formed before the overthrow of the old society. This includes neighborhood assemblies, workers’ councils, syndicalist unions and the like. These non-hierarchical organizations would fight against the institutions of the old society (government, capitalism, patriarchy, etc.) and as the old society is destroyed they take over the running of society.
\section{\textbf{Different Kinds of Anarchists}}
\subsection{\textbf{Differences of Focus}}
In addition to differences over what an anarchist society should look like, different anarchists also focus more on different issues. Anarcha-Feminists focus on women’s liberation and the struggle against patriarchy. Eco-Anarchists focus on ecology and the destruction of the environment. Anarcho-syndicalists focus on unions and the labor movement. The divisions between the various kinds of anarchists overlap and are not absolute. Most different kinds of anarchists are willing to co-exist and work together.
\subsection{\textbf{Evolution vs. Revolution}}
The majority of anarchists are revolutionaries who believe that an anarchist society will come about as the result of a social revolution. The government would be overthrown and abolished, the means of production expropriated and placed under self-management and a rapid transition to anarchy made. Others believe in an evolutionary approach — that anarchy will come about as a result of a lengthy centuries-long evolution.
\subsection{\textbf{Violence}}
Some anarchists are also pacifists who believe all forms of violence are immoral. True pacifism logically implies anarchism. The state is inherently violent and the most violent organization in human history; other forms of hierarchy are usually violent as well. The majority of anarchists are not pacifists, however. Although non-pacifist anarchists do not glorify violence most believe that the use of violence in self-defense and\Slash{}or to overthrow hierarchy is justified.
\subsection{\textbf{Religion and Philosophy}}
Anarchists come from many different religions and philosophical backgrounds — from atheistic materialism to postmodernism to egoism to Taoism to Christianity and everything in between. Although most anarchists are atheists\Slash{}agnostics there are religious anarchists including Pagans, Christians, Muslims and Jews. Any religion or philosophy is theoretically compatible with anarchism so long as it does not advocate things (such as a god-king) that contradict the basic ideas above.
\section{\textbf{Anarchy In Action}}
\subsection{\textbf{Everyday Life}}
There are many examples of anarchist principles in real life. Some of them come from the daily lives of ordinary people living in contemporary hierarchical societies. One example is “a group of friends going on a camping trip. They plan their trip, and each person brings useful skills and tools to share. They work together to set up tents, fish, cook, clean up, with no one in a position of authority over anyone else. The group organizes itself, chores are done, and everyone passes the time as they please, alone or in groups with others. People discuss their concerns and possible solutions are proposed. No one is bound to go along with the group, but choosing to spend time together implies a willingness to at least try to work out constructive solutions to the problems and frictions that will inevitably arise. If no resolution is possible, the dissenting individuals can form another grouping or leave without fear of persecution by the rest of the group.”\footnote{“Consent or Coercion” by Affinity Group of Evolutionary Anarchists} Similar non-hierarchical forms of organization happen all the time even in the most authoritarian of societies. They’re informal and small scale but it is an example of anarchy in action. In an anarchist society non-hierarchical forms of organization would be the dominant form of organization.
\subsection{\textbf{Primitivist Societies}}
There have been many examples of anarchist societies throughout history; most of them have been agrarian or hunter-gatherer societies. The immense majority of human history was lived in primitive anarchy. The human race has been around between 50,000 and 500,000 years (depending on how you define human and what estimates you use). The first states came around about 7,000 years ago in Mesopotamia. For a long time after states and classes were created they were limited to certain parts of the world while much of the globe lived in anarchy. It is only in the last couple of centuries that states came to rule the entire world, primarily as a result of conquest. Although far from perfect, most primitivist societies were not the Hobbesian hellholes they are often portrayed as (see Stone Age Economics by Marshall Sahlins). Well known indigenous anarcho-primitivist societies include the !Kung and the Igbo (prior to western imperialism).
\subsection{\textbf{Ukrainian Revolution}}
In early 1918 the new Bolshevik government of Russia made peace with Germany and agreed to give up the Ukraine, formerly part of the Russian Empire, to Germany. The inhabitants of the Ukraine had little say in this and were opposed to it. A rebellion against German rule erupted which turned into an anarchist revolution. The revolution was rooted primarily among peasants although it included cities at its height. Village assemblies and communes were formed throughout much of the Ukraine. When it included cities factories were taken over by the workers. They formed decentralized democratic militias, which fought guerilla warfare against numerous statist armies that invaded the Ukraine during this time period. The Anarcho-Communist Nestor Makhno played a major role in organizing these militias. They successfully defeated the Germans, Austrians, Ukrainian Nationalists, and two white invasions led by General Denikin and then General Wrangel (the Whites were ultra-reactionary armies fighting the Bolsheviks in Russia). In 1921 the Bolsheviks, having recently won the civil war against the Whites, invaded the Ukraine. They used their vastly superior resources to conquer the Ukraine and implement a reign of terror.
\subsection{\textbf{Spanish Revolution}}
On July 19, 1936 General Fransisco Franco launched a Fascist coup against the Spanish Republic. In response the CNT, an anarcho-syndicalist union, and the UGT, a union affiliation with the Spanish Socialist Party, called a general strike. The Republic refused to release arms to the workers so they broke into the barracks and distributed arms to the people. They fought and defeated the Fascist coup in two-thirds of Spain. The state was effectively destroyed; the military was in rebellion and the police forces had dissolved during the fighting. The workers and peasants proceeded to take over the land and factories. Collectives were formed throughout anti-fascist Spain. Collectivism was the main economic system, although a few villages abolished money and implemented anarcho-communism. There were also elements of mutualism implemented in some places. Decentralized militias were formed to fight against the Fascists. After three years of civil war the fascists won. The victory of fascism was due not only to their superior arms and assistance from Hitler \& Mussolini but also strategic errors made by the anarcho-syndicalists and backstabbing by Marxist and Republican “allies” in the fight against fascism.
\section{\textbf{Common Questions and Objections}}
\subsection{\textbf{What Would You Replace The State With?}}
Nothing. Would you replace a tumor?
\subsection{\textbf{What About Human Nature}}
If human nature is bad then hierarchy should be abolished because those on the top will inevitably abuse their power. If human nature is good then there is no need for hierarchy because people will do good things without being dominated by others. Either way, we should have anarchy. If people are too evil to rule themselves then they are far too evil to rule other people. The immense majority of human history has been lived in hunter-gatherer societies, a form of primitivist anarchy. If human nature favors any particular social system it favors hunter-gatherer anarchy because that is what the majority of human history has been lived in. Given the immense diversity of social systems humans have created over the eons it is unlikely that human nature, if it even exists, plays a great role in determining social structure.
\subsection{\textbf{What Would Happen To Former Politicians and Capitalists?}}
Individual politicians and members of the capitalist class from the old society would be allowed to become part of the new society as equals. They would lose all their former powers and privileges and live alongside everyone else as equals. Those who do not want to are free to become hermits or leave. Anyone who does not want to participate in the various collective organizations would be free to leave and would be given access to a portion of the means of production so that they could support themselves on their own. During the Spanish Revolution “if you didn’t want to join the collective you were given some land but only as much as you could work yourself. You were not allowed to employ” wage-laborers.”\footnote{“The Spanish Civil War: Anarchism In Action” by Eddie Conlon, Chapter 2} They could attempt to set up alternative systems so long as they are completely voluntary. They could attempt to reestablish capitalism (or some other form of oppression) so long as it was completely non-violent and voluntary but doing so would be extremely difficult because few people would volunteer to be poor and work in their sweatshops. Few people will volunteer to be oppressed, especially in an anarchist society where hierarchy would be viewed quite negatively. Reestablishing some form of domination through purely voluntary and non-violent means would therefore be almost impossible.
\subsection{\textbf{How Could An Anarchist Society Defend Itself From Foreign Aggression and Statist Armies?}}
The same tactics used to overthrow hierarchy, direct action, could be used against counter-revolutionary armies. This includes, but is not limited to, civil disobedience, strikes, insurrections, street fighting, etc. If necessary the population could be armed and a decentralized network of democratic militias formed to wage guerilla warfare against the statist forces. This can be done against both foreign invaders (if one part of the world is in anarchy and the other is authoritarian) and against domestic counter-revolutionaries who attempt to use violence to force everyone back into an authoritarian society.
\subsection{\textbf{How Would Anarchists Deal With anti-Social Crimes?}}
Crime is the result of hierarchy; the abolition of hierarchy will cause it to disappear. 95\% of crime is caused by patriarchy, private property and capitalism (stealing, etc.); its abolition will result in the end of 95\% of crime. What little is left over could be better dealt with by the community than by any police force. Many historical pre-capitalist societies had little or no crime; a few weeks after the Spanish Revolution began crime plummeted. The state has proven completely incapable of combating crime — it has been trying to prevent crime for years yet has been a complete failure. At best it merely punishes people after the fact. “Prisons fail to improve or reform anyone. Local people aware of each others’ circumstances would be able to apply more suitable solutions, in keeping with the needs of the victim and the offender. The present penal system, on the other hand, \_creates\_ criminal behaviour. Long term prisoners are often rendered incapable of surviving outside an institution that makes all their decisions for them. How is locking people up with others of an anti-social turn of mind \dots{} supposed to develop responsibility and reasonable behaviour? Of course it does just the opposite. The majority of prisoners re-offend.”\footnote{“Everything You Ever Wanted To Know About Anarchy” by Anarchist Media Group, Cardiff (UK)} The state and capitalism are far worse then crime; they kill and rob on a scale far greater then any ordinary criminal. Under the present system petty criminals go to prison but the big criminals run the country.
\subsection{\textbf{But We Need Coordination and Administration}}
It is possible to coordinate activities without hierarchy. Any group of people can get together and hold a general assembly where they can divvy up the tasks they need to do and decide who will do what. If needed they can assign one or more people to act as coordinators. Such coordinators would simply implement the plans developed by the general assembly and would have no authority themselves. In the Ukrainian and Spanish Revolutions when workers took over factories the worker assemblies often created factory committees that performed administrative and coordination tasks. Decision making power stayed with the worker assemblies, the factory committees simply implemented what the workers decided in their assemblies. Coordination between multiple assemblies can be done through the council system.
% 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}
The Anarchist Library
\smallskip
Anti-Copyright
\bigskip
\includegraphics[width=0.25\textwidth]{logo-en}
\bigskip
\end{center}
\strut
\vfill
\begin{center}
Morpheus
Basic Principles of Anarchism
25\textsuperscript{th} June 2003
\bigskip
Retrieved on 2\textsuperscript{nd} August 2020 from https:\Slash{}\Slash{}web.archive.org\Slash{}web\Slash{}20070303054259fw\_\Slash{}http:\Slash{}\Slash{}question-everything.mahost.org\Slash{}Socio-Politics\Slash{}BasicAnarchy.html
\bigskip
\textbf{theanarchistlibrary.org}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/28-02-5.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-00608.warc.gz | 247,357,660 | 1,187 | %%
%% Ein Beispiel der DANTE-Edition
%%
%% 7. Auflage
%%
%% Beispiel 28-02-5 auf Seite 608.
%%
%% 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}
%StartShownPreambleCommands
\usepackage{pst-eucl}
%StopShownPreambleCommands
\begin{document}
\begin{pspicture}(-1,-1)(2.5,2)
\pstGeonode[PointSymbol=none,
PosAngle={-45,45,135}]{A}(0,2){B}(2.5,2){C}
\pspolygon(A)(B)(C)
\psset{arrows=->,linecolor=red}
\pstMarkAngle{C}{A}{B}{$\alpha$}
\pstMarkAngle[MarkAngleRadius=1]{B}{A}{C}{$\alpha$}
\pstMarkAngle[linestyle=dotted]{B}{C}{A}{$\gamma$}
\pstMarkAngle[arrowscale=2,MarkAngleRadius=-0.75]{A}{B}{C}{}
\end{pspicture}
\end{document}
|
https://granite.phys.s.u-tokyo.ac.jp/svn/LCGT/trunk/mif/doc/DesignDocument/MIF_Design.aux | u-tokyo.ac.jp | CC-MAIN-2022-40 | text/plain | application/x-tex | crawl-data/CC-MAIN-2022-40/segments/1664030336674.94/warc/CC-MAIN-20221001132802-20221001162802-00249.warc.gz | 325,983,007 | 8,002 | \relax
\ifx\hyper@anchor\@undefined
\global \let \oldcontentsline\contentsline
\gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global \let \oldnewlabel\newlabel
\gdef \newlabel#1#2{\newlabelxx{#1}#2}
\gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\let \contentsline\oldcontentsline
\let \newlabel\oldnewlabel}
\else
\global \let \hyper@last\relax
\fi
\providecommand*\HyPL@Entry[1]{}
\HyPL@Entry{0<</S/D>>}
\HyPL@Entry{1<</S/D>>}
\citation{BW Report}
\@writefile{toc}{\contentsline {chapter}{\numberline {1}Introduction}{3}{chapter.1}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {1.1}Requirements}{3}{section.1.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {1.1}{\ignorespaces bKAGRA Target Sensitivity in the BRSE mode}}{4}{figure.1.1}}
\newlabel{bKAGRA Target Sensitivity BRSE}{{1.1}{4}{bKAGRA Target Sensitivity in the BRSE mode\relax }{figure.1.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1.2}{\ignorespaces bKAGRA Target Sensitivity in the DRSE mode}}{4}{figure.1.2}}
\newlabel{bKAGRA Target Sensitivity DRSE}{{1.2}{4}{bKAGRA Target Sensitivity in the DRSE mode\relax }{figure.1.2}{}}
\citation{BW Report}
\@writefile{toc}{\contentsline {chapter}{\numberline {2}Optical Configuration}{5}{chapter.2}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {2.1}Overview}{5}{section.2.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Schematic of the main interferometer and the naming convention of IFO parameters}}{5}{figure.2.1}}
\newlabel{IFO diagram}{{2.1}{5}{Schematic of the main interferometer and the naming convention of IFO parameters\relax }{figure.2.1}{}}
\citation{JGW-G1100599}
\@writefile{lot}{\contentsline {table}{\numberline {2.1}{\ignorespaces Arm cavity parameters}}{6}{table.2.1}}
\newlabel{Arm cavity parameters}{{2.1}{6}{Arm cavity parameters\relax }{table.2.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2.2}Arm Cavity Parameters}{6}{section.2.2}}
\@writefile{toc}{\contentsline {subsubsection}{g-factor}{6}{section*.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.1}Arm Cavity Higher Order Mode Resonances}{6}{subsection.2.2.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces HOM power in the arm cavity relative to the TEM00 power. The mode number is defined as $n+m$ for TEMnm modes.}}{7}{figure.2.2}}
\newlabel{HOM Power in AC}{{2.2}{7}{HOM power in the arm cavity relative to the TEM00 power. The mode number is defined as $n+m$ for TEMnm modes}{figure.2.2}{}}
\@writefile{toc}{\contentsline {subsubsection}{g-factor}{7}{section*.3}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Resonance curves of HOMs taking into account the diffraction loss. The HOMs are expanded by the Laguerre-Gaussian basis. $\mr {LG}(p,l)$ corresponds to the mode number $2p+l$.}}{8}{figure.2.3}}
\newlabel{HOM Finesse}{{2.3}{8}{Resonance curves of HOMs taking into account the diffraction loss. The HOMs are expanded by the Laguerre-Gaussian basis. $\mr {LG}(p,l)$ corresponds to the mode number $2p+l$}{figure.2.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces The maximum HOM power ratio in the AC as a function of ITM ROC error for the negative g-factors. The ROC is swept by $\pm $1\% around the nominal value.}}{8}{figure.2.4}}
\newlabel{HOM Power in AC ITM ROC error negative-g}{{2.4}{8}{The maximum HOM power ratio in the AC as a function of ITM ROC error for the negative g-factors. The ROC is swept by $\pm $1\% around the nominal value}{figure.2.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces The maximum HOM power ratio in the AC as a function of ETM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value.}}{9}{figure.2.5}}
\newlabel{HOM Power in AC ETM ROC error negative-g}{{2.5}{9}{The maximum HOM power ratio in the AC as a function of ETM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value}{figure.2.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces The maximum HOM power ratio in the AC as a function of ITM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value.}}{9}{figure.2.6}}
\newlabel{HOM Power in AC ITM ROC error positive-g}{{2.6}{9}{The maximum HOM power ratio in the AC as a function of ITM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value}{figure.2.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.7}{\ignorespaces The maximum HOM power ratio in the AC as a function of ETM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value.}}{10}{figure.2.7}}
\newlabel{HOM Power in AC ETM ROC error positive-g}{{2.7}{10}{The maximum HOM power ratio in the AC as a function of ETM ROC error for the positive g-factors. The ROC is swept by $\pm $1\% around the nominal value}{figure.2.7}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.2}RF Sidebands Resonances in the Arm Cavities}{10}{subsection.2.2.2}}
\newlabel{RFSB frequency fine adjustment}{{2.2.2}{10}{RF Sidebands Resonances in the Arm Cavities\relax }{subsection.2.2.2}{}}
\@writefile{toc}{\contentsline {subsubsection}{Fine Adjustment of the RF Sideband Frequencies}{10}{section*.4}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.8}{\ignorespaces Ratio of the SB reflection phases by the arm cavities. We want to set it to 8/3, which is indicated by the green line.}}{11}{figure.2.8}}
\newlabel{RFSB Refl phase ratio}{{2.8}{11}{Ratio of the SB reflection phases by the arm cavities. We want to set it to 8/3, which is indicated by the green line}{figure.2.8}{}}
\@writefile{toc}{\contentsline {subsubsection}{HOM Resonances of the RF Sidebands}{11}{section*.5}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.9}{\ignorespaces Relative position of the RFSBs in the FSR of the arm cavities.}}{12}{figure.2.9}}
\newlabel{RFSB Refl phase FSR}{{2.9}{12}{Relative position of the RFSBs in the FSR of the arm cavities}{figure.2.9}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.10}{\ignorespaces Positions of the RF SBs and the HOMs in the FSR of the arm cavities. The colorful sharp peaks represent the resonant curves of the HOMs. The mode number is printed at the top of each resonance. The vertical lines are the positions of the RF SBs and their harmonics. The numbers associated with the lines indicate the harmonic order. The black lines are the f1 harmonics, whereas the red lines are the f2 harmonics.}}{12}{figure.2.10}}
\newlabel{RFSB HOM FSR}{{2.10}{12}{Positions of the RF SBs and the HOMs in the FSR of the arm cavities. The colorful sharp peaks represent the resonant curves of the HOMs. The mode number is printed at the top of each resonance. The vertical lines are the positions of the RF SBs and their harmonics. The numbers associated with the lines indicate the harmonic order. The black lines are the f1 harmonics, whereas the red lines are the f2 harmonics}{figure.2.10}{}}
\citation{PI Braginsky}
\@writefile{lof}{\contentsline {figure}{\numberline {2.11}{\ignorespaces Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ITM ROC is swept. g-factor is negative.}}{13}{figure.2.11}}
\newlabel{RFSB HOM FOM ITM negative-g}{{2.11}{13}{Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ITM ROC is swept. g-factor is negative}{figure.2.11}{}}
\@writefile{toc}{\contentsline {subsubsection}{g-factor and the RF SB resonances}{13}{section*.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.3}Parametric Instability}{13}{subsection.2.2.3}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.12}{\ignorespaces Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ETM ROC is swept. g-factor is negative.}}{14}{figure.2.12}}
\newlabel{RFSB HOM FOM ETM negative-g}{{2.12}{14}{Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ETM ROC is swept. g-factor is negative}{figure.2.12}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.13}{\ignorespaces Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ITM ROC is swept. g-factor is positive.}}{14}{figure.2.13}}
\newlabel{RFSB HOM FOM ITM positive-g}{{2.13}{14}{Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ITM ROC is swept. g-factor is positive}{figure.2.13}{}}
\citation{Sidles Sigg}
\@writefile{lof}{\contentsline {figure}{\numberline {2.14}{\ignorespaces Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ETM ROC is swept. g-factor is positive.}}{15}{figure.2.14}}
\newlabel{RFSB HOM FOM ETM positive-g}{{2.14}{15}{Figure of merit of the overlap between the RF SB harmonics and the HOMs when the ETM ROC is swept. g-factor is positive}{figure.2.14}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.4}Angular Instability by the Radiation Pressure}{15}{subsection.2.2.4}}
\citation{BW Report}
\@writefile{lof}{\contentsline {figure}{\numberline {2.15}{\ignorespaces Maps of the maximum parametric gain as functions of the ROCs of the test masses. Left: positive g-factor, Right: negative g-factor. The ROCs are swept by $\pm $2\% of their nominal values. White areas correspond to $R_\mr {max}<1$.}}{16}{figure.2.15}}
\newlabel{PI Plots}{{2.15}{16}{Maps of the maximum parametric gain as functions of the ROCs of the test masses. Left: positive g-factor, Right: negative g-factor. The ROCs are swept by $\pm $2\% of their nominal values. White areas correspond to $R_\mr {max}<1$}{figure.2.15}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.5}Conclusion on g-factors}{16}{subsection.2.2.5}}
\@writefile{toc}{\contentsline {section}{\numberline {2.3}Recycling Cavities}{16}{section.2.3}}
\@writefile{toc}{\contentsline {subsubsection}{Overview}{16}{section*.7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.1}Reflectivities}{16}{subsection.2.3.1}}
\@writefile{lot}{\contentsline {table}{\numberline {2.2}{\ignorespaces Recycling cavity parameters}}{17}{table.2.2}}
\newlabel{Recycling cavity parameters}{{2.2}{17}{Recycling cavity parameters\relax }{table.2.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2.3}{\ignorespaces Folding parameters. See Figure \ref {IFO diagram} for the meaning of the parameters.}}{17}{table.2.3}}
\newlabel{Folding parameters}{{2.3}{17}{Folding parameters. See Figure \ref {IFO diagram} for the meaning of the parameters}{table.2.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.2}Length and RF SB frequencies}{18}{subsection.2.3.2}}
\@writefile{toc}{\contentsline {subsubsection}{Constraints}{18}{section*.8}}
\@writefile{toc}{\contentsline {subsubsection}{SRCL linear range}{18}{section*.9}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.16}{\ignorespaces SRCL error signals for three different values of $R_\mr {m}$. The horizontal axis is the detuning of the SRC in terms of the one-way phase shift. The vertical axis is the signal from the POP port demodulated at the f1 frequency. The vertical line shows the operation point of DRSE (3.5$^\circ $). }}{19}{figure.2.16}}
\newlabel{SRCL Sweep}{{2.16}{19}{SRCL error signals for three different values of $R_\mr {m}$. The horizontal axis is the detuning of the SRC in terms of the one-way phase shift. The vertical axis is the signal from the POP port demodulated at the f1 frequency. The vertical line shows the operation point of DRSE (3.5$^\circ $)}{figure.2.16}{}}
\@writefile{toc}{\contentsline {subsubsection}{Selected Length and Frequencies}{19}{section*.10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.3}Radius of Curvature of the RC mirrors}{20}{subsection.2.3.3}}
\@writefile{toc}{\contentsline {section}{\numberline {2.4}Output mode-cleaner system}{20}{section.2.4}}
\citation{ROC Error}
\@writefile{lof}{\contentsline {figure}{\numberline {2.17}{\ignorespaces Output mode-cleaner system.}}{21}{figure.2.17}}
\newlabel{fig:OMCsystem}{{2.17}{21}{Output mode-cleaner system}{figure.2.17}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.18}{\ignorespaces {\it Left}: Signal loss due to the differential RoC errors of the test masses, and {\it Right}: Shot noise increase due to the junk light caused by the differential RoC errors of the test masses.}}{22}{figure.2.18}}
\newlabel{fig:HOM}{{2.18}{22}{{\it Left}: Signal loss due to the differential RoC errors of the test masses, and {\it Right}: Shot noise increase due to the junk light caused by the differential RoC errors of the test masses}{figure.2.18}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2.4}{\ignorespaces Amount of the light in each mode at the dark port before the OMC.}}{22}{table.2.4}}
\newlabel{tab:HOM}{{2.4}{22}{Amount of the light in each mode at the dark port before the OMC}{table.2.4}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2.5}{\ignorespaces Amount of the light in each mode at the dark port after the OMC.}}{22}{table.2.5}}
\newlabel{tab:HOM2}{{2.5}{22}{Amount of the light in each mode at the dark port after the OMC}{table.2.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.19}{\ignorespaces Frequency margin to the closest resonance of any higher order modes up to the 8th mode. The black, red, orange, green and blue curves correspond to the OMC length of 90, 80, 70, 60, and 50\nobreakspace {}cm, respectively. The horizontal line at the center indicates the suppression rate of 45\nobreakspace {}dB.}}{23}{figure.2.19}}
\newlabel{fig:modes}{{2.19}{23}{Frequency margin to the closest resonance of any higher order modes up to the 8th mode. The black, red, orange, green and blue curves correspond to the OMC length of 90, 80, 70, 60, and 50~cm, respectively. The horizontal line at the center indicates the suppression rate of 45~dB}{figure.2.19}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2.6}{\ignorespaces Setup parameters of the output mode-cleaner system.}}{23}{table.2.6}}
\newlabel{tab:OMCsetup}{{2.6}{23}{Setup parameters of the output mode-cleaner system}{table.2.6}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {3}Length Sensing and Control Scheme}{24}{chapter.3}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{bKAGRA LSC}{{3}{24}{Length Sensing and Control Scheme\relax }{chapter.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.1}{\ignorespaces RF sideband resonant conditions and signal ports. POP is drawn at the transmission of PR3 to avoid congestion of the diagram. However, POP is actually planned to be picked up from the back of PR2 because the beam size is much smaller there. }}{24}{figure.3.1}}
\newlabel{Signal Ports}{{3.1}{24}{RF sideband resonant conditions and signal ports. POP is drawn at the transmission of PR3 to avoid congestion of the diagram. However, POP is actually planned to be picked up from the back of PR2 because the beam size is much smaller there}{figure.3.1}{}}
\citation{Optickle}
\citation{LSC Code}
\@writefile{lot}{\contentsline {table}{\numberline {3.1}{\ignorespaces RF Sideband Frequencies}}{25}{table.3.1}}
\newlabel{RF Sideband Frequencies}{{3.1}{25}{RF Sideband Frequencies\relax }{table.3.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3.1}Overview}{25}{section.3.1}}
\@writefile{toc}{\contentsline {section}{\numberline {3.2}Simulation Conditions}{25}{section.3.2}}
\@writefile{toc}{\contentsline {subsubsection}{Arm Cavity Asymmetry}{25}{section*.11}}
\newlabel{Arm Cavity Asymmetry}{{3.2}{25}{Arm Cavity Asymmetry\relax }{section*.11}{}}
\@writefile{toc}{\contentsline {subsubsection}{PD}{26}{section*.12}}
\@writefile{toc}{\contentsline {section}{\numberline {3.3}Signal Name Convention}{26}{section.3.3}}
\@writefile{toc}{\contentsline {section}{\numberline {3.4}Signal Extraction Ports}{26}{section.3.4}}
\citation{Ohmae Thesis}
\citation{Ohmae Thesis}
\@writefile{lot}{\contentsline {table}{\numberline {3.2}{\ignorespaces Normalized Sensing Matrix of LSC in the case of BRSE. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\tmspace +\thinmuskip {.1667em}Hz to create this matrix.}}{27}{table.3.2}}
\newlabel{Sensing Matrix LSC SDM BRSE}{{3.2}{27}{Normalized Sensing Matrix of LSC in the case of BRSE. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\,Hz to create this matrix}{table.3.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3.3}{\ignorespaces Normalized Sensing Matrix of LSC in the case of DRSE. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\tmspace +\thinmuskip {.1667em}Hz to create this matrix.}}{27}{table.3.3}}
\newlabel{Sensing Matrix LSC SDM DRSE}{{3.3}{27}{Normalized Sensing Matrix of LSC in the case of DRSE. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\,Hz to create this matrix}{table.3.3}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3.4}{\ignorespaces Shot noise matrix of LSC in the case of BRSE. The numbers represent the displacement equivalent shot noise [$\mr {m/\sqrt {Hz}}$]. The interferometer response was evaluated at 100\tmspace +\thinmuskip {.1667em}Hz to create this matrix.}}{27}{table.3.4}}
\newlabel{Shot noise matrix LSC SDM BRSE}{{3.4}{27}{Shot noise matrix of LSC in the case of BRSE. The numbers represent the displacement equivalent shot noise [$\mr {m/\sqrt {Hz}}$]. The interferometer response was evaluated at 100\,Hz to create this matrix}{table.3.4}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3.5}{\ignorespaces Shot noise matrix of LSC in the case of DRSE. The numbers represent the displacement equivalent shot noise [$\mr {m/\sqrt {Hz}}$]. The interferometer response was evaluated at 100\tmspace +\thinmuskip {.1667em}Hz to create this matrix.}}{28}{table.3.5}}
\newlabel{Shot noise matrix LSC SDM DRSE}{{3.5}{28}{Shot noise matrix of LSC in the case of DRSE. The numbers represent the displacement equivalent shot noise [$\mr {m/\sqrt {Hz}}$]. The interferometer response was evaluated at 100\,Hz to create this matrix}{table.3.5}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3.6}{\ignorespaces Normalized Sensing Matrix of LSC for BRSE using the f3 sideband. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\tmspace +\thinmuskip {.1667em}Hz to create this matrix.}}{28}{table.3.6}}
\newlabel{Sensing Matrix LSC NRS}{{3.6}{28}{Normalized Sensing Matrix of LSC for BRSE using the f3 sideband. Each row is normalized by the diagonal element. The interferometer response was evaluated at 100\,Hz to create this matrix}{table.3.6}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3.5}Loop Noise}{28}{section.3.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.1}Servo loop model}{28}{subsection.3.5.1}}
\citation{LoopNoise}
\@writefile{lof}{\contentsline {figure}{\numberline {3.2}{\ignorespaces Block diagram of the feedback loops. The real DOF vector $\mathaccentV {vec}17E{x}$ contains the displacement of each mirror and other dynamic degrees of freedom in the interferometer, such as laser frequency and intensity. It is converted to the vector $\mathaccentV {vec}17E{e}$ of the error signals in the canonical DOFs by the detector matrix $D$. All the matrices in the figure are frequency dependent.}}{29}{figure.3.2}}
\newlabel{Fig:Feedback Diagram}{{3.2}{29}{Block diagram of the feedback loops. The real DOF vector $\vec {x}$ contains the displacement of each mirror and other dynamic degrees of freedom in the interferometer, such as laser frequency and intensity. It is converted to the vector $\vec {e}$ of the error signals in the canonical DOFs by the detector matrix $D$. All the matrices in the figure are frequency dependent}{figure.3.2}{}}
\newlabel{Loop Noise Formula}{{3.1}{29}{Servo loop model\relax }{equation.3.5.1}{}}
\newlabel{Define G}{{3.2}{29}{Servo loop model\relax }{equation.3.5.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3.7}{\ignorespaces Control Loop UGFs}}{29}{table.3.7}}
\newlabel{Control Loop UGFs}{{3.7}{29}{Control Loop UGFs\relax }{table.3.7}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.3}{\ignorespaces Loop Noise Coupling: BRSE}}{30}{figure.3.3}}
\newlabel{Loop Noise Coupling: BRSE, SDM}{{3.3}{30}{Loop Noise Coupling: BRSE\relax }{figure.3.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.4}{\ignorespaces Loop Noise Coupling: DRSE}}{30}{figure.3.4}}
\newlabel{Loop Noise Coupling: DRSE, SDM}{{3.4}{30}{Loop Noise Coupling: DRSE\relax }{figure.3.4}{}}
\citation{AD829_Data_Sheet}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.2}Feed forward}{31}{subsection.3.5.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.5}{\ignorespaces Loop Noise Coupling with Feed Forward: BRSE}}{31}{figure.3.5}}
\newlabel{Loop Noise Coupling FF: BRSE, SDM}{{3.5}{31}{Loop Noise Coupling with Feed Forward: BRSE\relax }{figure.3.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3.6}PD Dynamic Range}{31}{section.3.6}}
\newlabel{PD Dynamic Range}{{3.6}{31}{PD Dynamic Range\relax }{section.3.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.6}{\ignorespaces Loop Noise Coupling with Feed Forward: DRSE}}{32}{figure.3.6}}
\newlabel{Loop Noise Coupling FF: DRSE, SDM}{{3.6}{32}{Loop Noise Coupling with Feed Forward: DRSE\relax }{figure.3.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.7}{\ignorespaces PD noise coupling: BRSE.}}{33}{figure.3.7}}
\newlabel{PD Noise BRSE}{{3.7}{33}{PD noise coupling: BRSE}{figure.3.7}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.8}{\ignorespaces PD noise coupling: DRSE.}}{33}{figure.3.8}}
\newlabel{PD Noise BRSE}{{3.8}{33}{PD noise coupling: DRSE}{figure.3.8}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.9}{\ignorespaces PD noise coupling with feed forward: BRSE.}}{34}{figure.3.9}}
\newlabel{PD Noise BRSE FF}{{3.9}{34}{PD noise coupling with feed forward: BRSE}{figure.3.9}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.10}{\ignorespaces PD noise coupling with feed forward: DRSE.}}{34}{figure.3.10}}
\newlabel{PD Noise DRSE FF}{{3.10}{34}{PD noise coupling with feed forward: DRSE}{figure.3.10}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {4}Noise Requirements}{35}{chapter.4}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{Chapter: Noise Requirements}{{4}{35}{Noise Requirements\relax }{chapter.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4.1}Mirror Displacement Noise}{35}{section.4.1}}
\newlabel{Displacement Noise Requirement}{{4.1}{35}{Mirror Displacement Noise\relax }{section.4.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4.2}Laser Noises}{35}{section.4.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.1}{\ignorespaces Displacement noise requirements for auxiliary mirrors: BRSE}}{36}{figure.4.1}}
\newlabel{Displacement Noise Requirent for Each Mirror: BRSE, SDM}{{4.1}{36}{Displacement noise requirements for auxiliary mirrors: BRSE\relax }{figure.4.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.2}{\ignorespaces Displacement noise requirements for auxiliary mirrors: DRSE}}{36}{figure.4.2}}
\newlabel{Displacement Noise Requirent for Each Mirror: DRSE, SDM}{{4.2}{36}{Displacement noise requirements for auxiliary mirrors: DRSE\relax }{figure.4.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2.1}Frequency stabilization servo}{37}{subsection.4.2.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.3}{\ignorespaces Conceptual diagram of the frequency stabilization system}}{37}{figure.4.3}}
\newlabel{FSS Concept}{{4.3}{37}{Conceptual diagram of the frequency stabilization system\relax }{figure.4.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2.2}Frequency noise requirement}{37}{subsection.4.2.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.4}{\ignorespaces Laser frequency noise requirement at the output of the MC: BRSE}}{38}{figure.4.4}}
\newlabel{Laser freq noise requirement BRSE}{{4.4}{38}{Laser frequency noise requirement at the output of the MC: BRSE\relax }{figure.4.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2.3}Intensity noise}{38}{subsection.4.2.3}}
\@writefile{toc}{\contentsline {section}{\numberline {4.3}RF Oscillator Noises}{38}{section.4.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3.1}Phase Noise}{38}{subsection.4.3.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.5}{\ignorespaces Laser frequency noise requirement at the output of the MC: DRSE}}{39}{figure.4.5}}
\newlabel{Laser freq noise requirement DRSE}{{4.5}{39}{Laser frequency noise requirement at the output of the MC: DRSE\relax }{figure.4.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.6}{\ignorespaces Displacement noise requirement for the MC suspension: BRSE}}{39}{figure.4.6}}
\newlabel{MC disp requirement BRSE}{{4.6}{39}{Displacement noise requirement for the MC suspension: BRSE\relax }{figure.4.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.7}{\ignorespaces Displacement noise requirement for the MC suspension: DRSE}}{40}{figure.4.7}}
\newlabel{MC disp requirement DRSE}{{4.7}{40}{Displacement noise requirement for the MC suspension: DRSE\relax }{figure.4.7}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.8}{\ignorespaces Relative Intensity Noise (RIN) requirement: BRSE}}{40}{figure.4.8}}
\newlabel{RIN Req BRSE}{{4.8}{40}{Relative Intensity Noise (RIN) requirement: BRSE\relax }{figure.4.8}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.9}{\ignorespaces Relative Intensity Noise (RIN) requirement: DRSE}}{41}{figure.4.9}}
\newlabel{RIN Req DRSE}{{4.9}{41}{Relative Intensity Noise (RIN) requirement: DRSE\relax }{figure.4.9}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.10}{\ignorespaces SSB Phase noise requirements: BRSE}}{41}{figure.4.10}}
\newlabel{SSB Req BRSE}{{4.10}{41}{SSB Phase noise requirements: BRSE\relax }{figure.4.10}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.11}{\ignorespaces SSB Phase noise requirements: DRSE}}{42}{figure.4.11}}
\newlabel{SSB Req DRSE}{{4.11}{42}{SSB Phase noise requirements: DRSE\relax }{figure.4.11}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3.2}Amplitude Noise}{42}{subsection.4.3.2}}
\@writefile{toc}{\contentsline {section}{\numberline {4.4}Scattered Light Noise}{42}{section.4.4}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.12}{\ignorespaces RF oscillator amplitude noise requirements: BRSE}}{43}{figure.4.12}}
\newlabel{RF AM Req BRSE}{{4.12}{43}{RF oscillator amplitude noise requirements: BRSE\relax }{figure.4.12}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.13}{\ignorespaces RF oscillator amplitude noise requirements: DRSE}}{43}{figure.4.13}}
\newlabel{RF AM Req DRSE}{{4.13}{43}{RF oscillator amplitude noise requirements: DRSE\relax }{figure.4.13}{}}
\citation{Yamamoto SCL}
\@writefile{lof}{\contentsline {figure}{\numberline {4.14}{\ignorespaces Scattered light requirements for the carrier: BRSE}}{44}{figure.4.14}}
\newlabel{SCL Req Carrier BRSE}{{4.14}{44}{Scattered light requirements for the carrier: BRSE\relax }{figure.4.14}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.15}{\ignorespaces Scattered light requirements for the f1 RFSB: BRSE}}{45}{figure.4.15}}
\newlabel{SCL Req f1 BRSE}{{4.15}{45}{Scattered light requirements for the f1 RFSB: BRSE\relax }{figure.4.15}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.16}{\ignorespaces Scattered light requirements for the f2 RFSB: BRSE}}{45}{figure.4.16}}
\newlabel{SCL Req f2 BRSE}{{4.16}{45}{Scattered light requirements for the f2 RFSB: BRSE\relax }{figure.4.16}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.17}{\ignorespaces Scattered light requirements for the carrier: DRSE}}{46}{figure.4.17}}
\newlabel{SCL Req Carrier DRSE}{{4.17}{46}{Scattered light requirements for the carrier: DRSE\relax }{figure.4.17}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.18}{\ignorespaces Scattered light requirements for the f1 RFSB: DRSE}}{46}{figure.4.18}}
\newlabel{SCL Req f1 DRSE}{{4.18}{46}{Scattered light requirements for the f1 RFSB: DRSE\relax }{figure.4.18}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.19}{\ignorespaces Scattered light requirements for the f2 RFSB: DRSE}}{47}{figure.4.19}}
\newlabel{SCL Req f2 DRSE}{{4.19}{47}{Scattered light requirements for the f2 RFSB: DRSE\relax }{figure.4.19}{}}
\@writefile{lot}{\contentsline {table}{\numberline {4.1}{\ignorespaces Light power in the various parts of the interferometer: BRSE}}{47}{table.4.1}}
\newlabel{Power in the IFO BRSE}{{4.1}{47}{Light power in the various parts of the interferometer: BRSE\relax }{table.4.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4.1}Light power in the interferometer}{47}{subsection.4.4.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.20}{\ignorespaces Coupling coeffcients of scattered light for the carrier: BRSE}}{48}{figure.4.20}}
\newlabel{SCL Coupling Carrier BRSE}{{4.20}{48}{Coupling coeffcients of scattered light for the carrier: BRSE\relax }{figure.4.20}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.21}{\ignorespaces Coupling coeffcients of scattered light for the f1 RFSB: BRSE}}{48}{figure.4.21}}
\newlabel{SCL Coupling f1 BRSE}{{4.21}{48}{Coupling coeffcients of scattered light for the f1 RFSB: BRSE\relax }{figure.4.21}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.22}{\ignorespaces Coupling coeffcients of scattered light for the f2 RFSB: BRSE}}{49}{figure.4.22}}
\newlabel{SCL Coupling f2 BRSE}{{4.22}{49}{Coupling coeffcients of scattered light for the f2 RFSB: BRSE\relax }{figure.4.22}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.23}{\ignorespaces Coupling coeffcients of scattered light for the carrier: DRSE}}{49}{figure.4.23}}
\newlabel{SCL Coupling Carrier DRSE}{{4.23}{49}{Coupling coeffcients of scattered light for the carrier: DRSE\relax }{figure.4.23}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.24}{\ignorespaces Coupling coeffcients of scattered light for the f1 RFSB: DRSE}}{50}{figure.4.24}}
\newlabel{SCL Coupling f1 DRSE}{{4.24}{50}{Coupling coeffcients of scattered light for the f1 RFSB: DRSE\relax }{figure.4.24}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4.25}{\ignorespaces Coupling coeffcients of scattered light for the f2 RFSB: DRSE}}{50}{figure.4.25}}
\newlabel{SCL Coupling f2 DRSE}{{4.25}{50}{Coupling coeffcients of scattered light for the f2 RFSB: DRSE\relax }{figure.4.25}{}}
\@writefile{lot}{\contentsline {table}{\numberline {4.2}{\ignorespaces Light power in the various parts of the interferometer: DRSE}}{51}{table.4.2}}
\newlabel{Power in the IFO DRSE}{{4.2}{51}{Light power in the various parts of the interferometer: DRSE\relax }{table.4.2}{}}
\citation{Sidles Sigg}
\@writefile{toc}{\contentsline {chapter}{\numberline {5}Alignment Sensing and Control Scheme}{52}{chapter.5}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{ASC}{{5}{52}{Alignment Sensing and Control Scheme\relax }{chapter.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5.1}Overview}{52}{section.5.1}}
\@writefile{toc}{\contentsline {section}{\numberline {5.2}Soft and Hard Modes}{52}{section.5.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.1}{\ignorespaces The transfer functions from the torque on the test mass to angle of the test mass(top: pitch, lower: yaw). The blue curve shows the mechanical transfer function in the absence of radiation pressure. The green and red curve show the opto-mechanical transfer functions of the soft mode and hard mode.}}{53}{figure.5.1}}
\newlabel{ASC_optomech_negative}{{5.1}{53}{The transfer functions from the torque on the test mass to angle of the test mass(top: pitch, lower: yaw). The blue curve shows the mechanical transfer function in the absence of radiation pressure. The green and red curve show the opto-mechanical transfer functions of the soft mode and hard mode}{figure.5.1}{}}
\@writefile{lot}{\contentsline {table}{\numberline {5.1}{\ignorespaces Resonant frequencies under radiation pressure. $i$ represents the instability.}}{54}{table.5.1}}
\newlabel{ASC_resonantfrequencies}{{5.1}{54}{Resonant frequencies under radiation pressure. $i$ represents the instability}{table.5.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5.3}Simulation Conditions}{54}{section.5.3}}
\@writefile{toc}{\contentsline {section}{\numberline {5.4}Signal Extraction Ports}{54}{section.5.4}}
\@writefile{toc}{\contentsline {section}{\numberline {5.5}Angular noise coupling to DARM}{54}{section.5.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5.1}Structure of the ASC model}{54}{subsection.5.5.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.2}{\ignorespaces Normalized WFS sensing matrix. Each row is normalized by the diagonal element. SR2 is not controlled by the WFS.}}{55}{figure.5.2}}
\newlabel{ASC_WFSSensingMatrix}{{5.2}{55}{Normalized WFS sensing matrix. Each row is normalized by the diagonal element. SR2 is not controlled by the WFS}{figure.5.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.3}{\ignorespaces Structure of the ASC model.}}{55}{figure.5.3}}
\newlabel{ASC_ASCstructure}{{5.3}{55}{Structure of the ASC model}{figure.5.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5.2}Simulation results}{56}{subsection.5.5.2}}
\@writefile{lot}{\contentsline {table}{\numberline {5.2}{\ignorespaces ASC control loop UGFs}}{57}{table.5.2}}
\newlabel{ASC_controlUGFs}{{5.2}{57}{ASC control loop UGFs\relax }{table.5.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.4}{\ignorespaces Angular noise coupling to DARM (top: pitch, lower: yaw). The dotted line shows bKAGRA design sensitivity.}}{57}{figure.5.4}}
\newlabel{ASC_A2DARM}{{5.4}{57}{Angular noise coupling to DARM (top: pitch, lower: yaw). The dotted line shows bKAGRA design sensitivity}{figure.5.4}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {6}Lock Acquisition Scheme}{58}{chapter.6}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {6.1}Overview}{58}{section.6.1}}
\@writefile{toc}{\contentsline {section}{\numberline {6.2}Green Laser Pre-Lock}{58}{section.6.2}}
\newlabel{Green Laser Pre-Lock}{{6.2}{58}{Green Laser Pre-Lock\relax }{section.6.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.1}Overview}{58}{subsection.6.2.1}}
\citation{Tatsumi Green}
\@writefile{lof}{\contentsline {figure}{\numberline {6.1}{\ignorespaces Conceptual configuration of the green laser pre-lock. Green lasers are injected from the back of PR2 and SR2. Two green lasers are phase locked to the main laser with a frequency offset of about 100\tmspace +\thinmuskip {.1667em}MHz.}}{59}{figure.6.1}}
\newlabel{Green Lock Schematic}{{6.1}{59}{Conceptual configuration of the green laser pre-lock. Green lasers are injected from the back of PR2 and SR2. Two green lasers are phase locked to the main laser with a frequency offset of about 100\,MHz}{figure.6.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.2}Noise Analysis}{59}{subsection.6.2.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2.3}Third Harmonics Demodulation}{60}{subsection.6.2.3}}
\newlabel{Third Harmonics Demodulation}{{6.2.3}{60}{Third Harmonics Demodulation\relax }{subsection.6.2.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.2}{\ignorespaces THD MICH error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f1$ in Q-phase.}}{60}{figure.6.2}}
\newlabel{THD MICH error signal with various CARM offset}{{6.2}{60}{THD MICH error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f1$ in Q-phase}{figure.6.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.3}{\ignorespaces THD PRCL error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f2$ in I-phase.}}{61}{figure.6.3}}
\newlabel{THD PRCL error signal with various CARM offset}{{6.3}{61}{THD PRCL error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f2$ in I-phase}{figure.6.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.4}{\ignorespaces THD SRCL error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f1$ in I-phase.}}{61}{figure.6.4}}
\newlabel{THD SRCL error signal with various CARM offset}{{6.4}{61}{THD SRCL error signal with various CARM offset. Signal port is REFL, demodulated at $3\times f1$ in I-phase}{figure.6.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6.3}Non-Resonant Sideband for Lock Acquisition}{62}{section.6.3}}
\newlabel{Non-Resonant Sideband for Lock Acquisition}{{6.3}{62}{Non-Resonant Sideband for Lock Acquisition\relax }{section.6.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.5}{\ignorespaces NRS MICH error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f1|$ in Q-phase.}}{62}{figure.6.5}}
\newlabel{NRS MICH error signal with various CARM offset}{{6.5}{62}{NRS MICH error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f1|$ in Q-phase}{figure.6.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.6}{\ignorespaces NRS PRCL error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f2|$ in I-phase.}}{63}{figure.6.6}}
\newlabel{NRS PRCL error signal with various CARM offset}{{6.6}{63}{NRS PRCL error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f2|$ in I-phase}{figure.6.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.7}{\ignorespaces NRS SRCL error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f1|$ in I-phase.}}{63}{figure.6.7}}
\newlabel{NRS SRCL error signal with various CARM offset}{{6.7}{63}{NRS SRCL error signal with various CARM offset. Signal port is REFL, demodulated at $|f3-f1|$ in I-phase}{figure.6.7}{}}
\citation{KAGRA svn layout}
\citation{Wedge Error Aso}
\@writefile{toc}{\contentsline {chapter}{\numberline {7}Optical Layout}{64}{chapter.7}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{Optical Layout}{{7}{64}{Optical Layout\relax }{chapter.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {7.1}Basic design}{64}{section.7.1}}
\@writefile{toc}{\contentsline {section}{\numberline {7.2}Wedge angle error tolerance}{64}{section.7.2}}
\@writefile{toc}{\contentsline {section}{\numberline {7.3}Tunnel Slope}{64}{section.7.3}}
\citation{ROC Error}
\@writefile{toc}{\contentsline {chapter}{\numberline {8}Installation/Adjustment Procedure}{66}{chapter.8}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {9}iKAGRA}{67}{chapter.9}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {9.1}Overview}{67}{section.9.1}}
\@writefile{toc}{\contentsline {section}{\numberline {9.2}Changes from bKAGRA}{67}{section.9.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.2.1}Mirrors}{67}{subsection.9.2.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.2.2}Optical Layout}{67}{subsection.9.2.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {9.1}{\ignorespaces Differences between the iKAGRA and bKAGRA optical configurations/layouts.}}{68}{figure.9.1}}
\newlabel{iKAGRA OptLayout Change}{{9.1}{68}{Differences between the iKAGRA and bKAGRA optical configurations/layouts}{figure.9.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.2.3}Mode Matching}{68}{subsection.9.2.3}}
\@writefile{lot}{\contentsline {table}{\numberline {9.1}{\ignorespaces Length sensing ports of iKAGRA}}{69}{table.9.1}}
\newlabel{iKAGRA sensing ports}{{9.1}{69}{Length sensing ports of iKAGRA\relax }{table.9.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {9.2}{\ignorespaces Input mode matching of iKAGRA, mapped by changing the positions of the IMMT mirrors from the optimized ones for bKAGRA.}}{69}{figure.9.2}}
\newlabel{iKAGRA IMMT}{{9.2}{69}{Input mode matching of iKAGRA, mapped by changing the positions of the IMMT mirrors from the optimized ones for bKAGRA}{figure.9.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {9.2.4}Interferometer Control}{69}{subsection.9.2.4}}
\@writefile{toc}{\contentsline {chapter}{\numberline {A}Recycling Cavity Length Determination Algorithm}{70}{appendix.A}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{RCL Algorithm}{{A}{70}{Recycling Cavity Length Determination Algorithm\relax }{appendix.A}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {B}SRCL non-linearity}{71}{appendix.B}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{SRCL non-linearity}{{B}{71}{SRCL non-linearity\relax }{appendix.B}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {C}Mixed PM and AM for f1}{72}{appendix.C}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{PM + AM for f1}{{C}{72}{Mixed PM and AM for f1\relax }{appendix.C}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {D}Terminology}{73}{appendix.D}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{Appendix Terminology}{{D}{73}{Terminology\relax }{appendix.D}{}}
\@writefile{lot}{\contentsline {table}{\numberline {D.1}{\ignorespaces Terminology}}{73}{table.D.1}}
\newlabel{Terminology Table}{{D.1}{73}{Terminology\relax }{table.D.1}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {E}Contributors}{74}{appendix.E}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\bibcite{BW Report}{1}
\bibcite{JGW-G1100599}{2}
\bibcite{PI Braginsky}{3}
\bibcite{Shibata PI}{4}
\bibcite{Sidles Sigg}{5}
\bibcite{Somiya OMC}{6}
\bibcite{KAGRA svn layout}{7}
\bibcite{Optickle}{8}
\bibcite{LSC Code}{9}
\bibcite{Ohmae Thesis}{10}
\bibcite{LoopNoise}{11}
\bibcite{AD829_Data_Sheet}{12}
\bibcite{Yamamoto SCL}{13}
\bibcite{Tatsumi Green}{14}
\bibcite{Wedge Error Aso}{15}
\bibcite{ROC Error}{16}
|
https://ctan.math.washington.edu/tex-archive/info/examples/PSTricks_7_de/10-01-2.ltx | washington.edu | CC-MAIN-2022-27 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2022-27/segments/1656103642979.38/warc/CC-MAIN-20220629180939-20220629210939-00067.warc.gz | 247,584,855 | 1,060 | %%
%% Ein Beispiel der DANTE-Edition
%%
%% 7. Auflage
%%
%% Beispiel 10-01-2 auf Seite 126.
%%
%% 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{193.16928pt}
\setlength\parindent{0pt}
%StartShownPreambleCommands
\usepackage{pstricks}
%StopShownPreambleCommands
\begin{document}
\psframebox{Normal}%
\psframebox[framesep=10pt]{viel}%
\psframebox[framesep=0pt]{nichts}\\[20pt]
%
\psset{boxsep=false}%
\psframebox{Normal}%
\psframebox[framesep=10pt]{viel}%
\psframebox[framesep=0pt]{nichts}
\end{document}
|
https://www.coaps.fsu.edu/bibliography/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%20521%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=10&rowOffset=&wrapResults=1&citeOrder=&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | fsu.edu | CC-MAIN-2023-14 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2023-14/segments/1679296950373.88/warc/CC-MAIN-20230402012805-20230402042805-00156.warc.gz | 789,789,124 | 1,462 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Basu_etal2000} Basu, S., Meyers, S. D., \& O{\textquoteright}Brien, J. J. (2000). Annual and interannual sea level variations in the Indian Ocean from TOPEX/Poseidon observations and ocean model simulations. \textit{J. Geophys. Res.}, \textit{105}(C1), 975--994.
\end{thebibliography}
\end{document}
|
http://ida.darksky.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%201518%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=5&rowOffset=&wrapResults=1&citeOrder=&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | darksky.org | CC-MAIN-2020-40 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2020-40/segments/1600400213006.47/warc/CC-MAIN-20200924002749-20200924032749-00045.warc.gz | 68,482,071 | 1,340 | %&LaTeX
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Lewanzik_etal2016} Lewanzik, D., Voigt, C. C., \& Minderman, J. (2016). Transition from conventional to light-emitting diode street lighting changes activity of urban bats. \textit{J Appl Ecol}, \textit{54}(1), 264--271.
\end{thebibliography}
\end{document}
|
http://porocila.imfm.si/2013/mat/clani/banakh.tex | imfm.si | CC-MAIN-2020-29 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-29/segments/1593655929376.49/warc/CC-MAIN-20200711095334-20200711125334-00582.warc.gz | 112,791,001 | 4,106 | \clan {Taras Banakh}
%--------------------------------------------------------
% C. raziskovalni clanki objavljeni v znanstvenih revijah
% in v zbornikih konferenc
%--------------------------------------------------------
%\begin{skupina}{C}
%\objavljenoRevija
% {AVTORJI}
% {NASLOV}
% {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\objavljenoZbornik
% {AVTORJI}
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
% {ZBORNIK} {STRANI}
%\end{skupina}
\begin{skupina}{C}
\objavljenoRevija
%% 1.01: %list {\bf 13}. BANAKH, Taras, BARTOSZEWICZ, Artur, BIENIAS, Marek, G{\L}\c{A}B, Szymon. The continuity properties of
%compact-preserving functions. {\it Topology and its Applications}, $[$Print ed.$]$, 2013, vol. 160, iss. 7, str. 937-942.
%$[$COBISS.SI-ID 16600921$]$\\
{\crta, A.~Bartoszewicz, M.~Bienias, S.~G{\l}\c{a}b}
{The continuity properties of compact-preserving functions}
{Topology Appl.} {160} { 2013} {7} {937--942}
\objavljenoRevija
% 1.01: %list {\bf 3}. BANAKH, Taras, CHERVAK, Ostap, ZDOMSKYY, Lyubomyr. On character of points in the Higson corona of a metric space.
%{\it Commentationes Mathematicae Universitatis Carolinae}, 2013, vol. 54, no. 2, str. 159-178. $[$COBISS.SI-ID 16631385$]$\\
{\crta, O.~Chervak, L.~Zdomskyy}
{On character of points in the Higson corona of a metric space}
{Comment.\ Math.\ Univ.\ Carolin.} {54} {2013} {2} {159--178}
\objavljenoRevija
% 1.01: %list {\bf 11}. BANAKH, Taras, GURAN, Igor. Perfectly supportable semigroups are $\sigma$-discrete in each Hausdorff shift-invariant topology.
%{\it Topological algebra and its applications}, 2013, vol. 1, str. 1-8. $[$COBISS.SI-ID 16667993$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 101/92: Ne najdem podatka {STEVILKA}
{\crta, I.~Guran}
{Perfectly supportable semigroups are $\sigma$-discrete in each Hausdorff shift-invariant topology}
{Topol.\ Algebra Appl.} {1} {2013} {} {1--8}
\objavljenoRevija
% 1.01: %list {\bf 10}. BANAKH, Taras, HETMAN, Ivan, SAKAI, Katsuro. Recognizing the topology of the space of closed convex subsets of a Banach space.
%{\it Studia Mathematica}, 2013, vol. 216, no. 1, str. 17-33. $[$COBISS.SI-ID 16727897$]$\\
{\crta, I.~Hetman, K.~Sakai}
{Recognizing the topology of the space of closed convex subsets of a Banach space}
{Studia Math.} {216} {2013} {1} {17--3{3}}
\objavljenoRevija
% 1.01: %list {\bf 2}. BANAKH, Taras, KUCHARSKI, Andrzej, MARTYNENKO, Marta. A spectral characterization of skeletal maps.
%{\it Central European Journal of Mathematics}, 2013, vol. 11, no. 1, str. 161-169. $[$COBISS.SI-ID 16435033$]$\\
{\crta, A.~Kucharski, M.~Martynenko}
{A spectral characterization of skeletal maps}
{Cent.\ Eur.\ J. Math.} {11} {2013} {1} {161--169}
\objavljenoRevija
% 1.08: {\bf 15}. BANAKH, Taras, MINE, Kotaro, REPOV\v{S}, Du\v{s}an, SAKAI, Katsuro, YAGASAKI, Tatsuhiko. Detecting topological groups which
%are (locally) homeomorphic to LF-spaces. V: DI MAIO, Giuseppe (ur.), TSABAN, Boaz (ur.). {\it Fourth Workshop on Coverings, Selections and Games
%in Topology : on the occasion of Professor Ljubi\v{s}a D. R. Ko\v{c}inac's 65th birthday : special issue}, (Topology and its applications,
%ISSN 0166-8641, Vol. 160, iss. 18). Amsterdam $[$etc.$]$: Elsevier, 2013, str. 2272-2284. $[$COBISS.SI-ID 16776793$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/111: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/112: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/113: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/114: Ne najdem podatka {ZBORNIK}
{\crta, K.~Mine, D.~Repov\v{s}, K.~Sakai, T.~Yagasaki}
{Detecting topological groups which are (locally) homeomorphic to LF-spaces}
{Topology Appl.} {160} {2013} {18} {2272--2284}
\objavljenoRevija
% 1.01: %list {\bf 9}. BANAKH, Taras, NOWAK, Magdalena. A 1-dimensional Peano continuum which is not an IFS attractor.
%{\it Proceedings of the American Mathematical Society}, 2013, vol. 141, no. 3, str. 931-935. $[$COBISS.SI-ID 16623193$]$\\
{\crta, M.~Nowak}
{A 1-dimensional Peano continuum which is not an IFS attractor}
{Proc.\ Amer.\ Math.\ Soc.} {141} {2013} {3} {931--935}
\objavljenoRevija
% 1.01: %list {\bf 8}. BANAKH, Taras, PASTUKHOVA, Iryna. Topological and ditopological unosemigroups. {\it Matemati\v{c}n\`{\i} studi\"{\i}},
%2013, vol. 39, no. 2, str. 119-133. $[$COBISS.SI-ID 16810841$]$\\
{\crta, I.~Pastukhova}
{Topological and ditopological unosemigroup}
{Mat.\ Stud.} {39} {2013} {2} {1{1}9--13{3}}
\objavljenoRevija
% 1.01: %list {\bf 7}. BANAKH, Taras, PROTASOV, Igor{'} Vladimirovi\v{c}. Topologizations of G-spaces.
%{\it Journal of mathematical sciences}, 2013, vol. 188, no. 2, str. 77-84. $[$COBISS.SI-ID 16809561$]$\\
{\crta, I.~V.~Protasov}
{Topologizations of G-spaces}
{J. Math.\ Sci.\ (N. Y.)} {188} {2013} {2} {7{7}--84}
\objavljenoRevija
% 1.01: %list {\bf 6}. BANAKH, Taras, PROTASOV, Igor{'} Vladimirovi\v{c}, SLOBODIANIUK, Sergiy. Syndetic submeasures and
%partitions of G-spaces and groups. {\it International journal of algebra and computation}, 2013, vol. 23, no. 7, str. 1611-1623.
%$[$COBISS.SI-ID 16809305$]$\\
{\crta, I.~V.~Protasov, S.~Slobodianiuk}
{Syndetic submeasures and partitions of G-spaces and groups}
{Internat.\ J. Algebra Comput.} {23} {2013} {7} {161{1}--1623}
\objavljenoRevija
% 1.01: %list {\bf 4}. BANAKH, Taras, REPOV\v{S}, Du\v{s}an. Universal meager $F_\sigma$-sets in locally compact manifolds.
%{\it Commentationes Mathematicae Universitatis Carolinae}, 2013, vol. 54, no. 2, str. 179-188. $[$COBISS.SI-ID 16628825$]$\\
{\crta, D.~Repov\v{s}}
{Universal meager $F_\sigma$-sets in locally compact manifolds}
{Comment.\ Math.\ Univ.\ Carolin.} {54} {2013} {2} {179--18{8}}
\objavljenoRevija
% 1.01: {\bf 1}. BANAKH, Taras, REPOV\v{S}, Du\v{s}an. Universal nowhere dense subsets of locally compact manifolds.
%{\it Algebraic and geometric topology}, vol. 13, iss. 6, str. 3687-3731. $[$COBISS.SI-ID 16766809$]$\\
{\crta, D.~Repov\v{s}}
{Universal nowhere dense subsets of locally compact manifolds}
{Algebr.\ Geom.\ Topol.} {13} {2013} {6} {3687--3731}
\objavljenoRevija
% 1.01: %list {\bf 14}. BANAKH, Taras, TUREK, S{\l}awomir. The groups $S^3$ and SO(3) have no invariant binary $k$-network.
%{\it Topology proceedings}, 2013, vol. 41, str. 261-266. $[$COBISS.SI-ID 16434265$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 122/160: Ne najdem podatka {STEVILKA}
{\crta, S{\l}.~Turek}
{The groups $S^3$ and SO(3) have no invariant binary $k$-network}
{Topology Proc.} {41} {2013} {} {261--26{6}}
\objavljenoRevija
% 1.01: %list {\bf 5}. BANAKH, Taras, VALOV, Vesko. General position properties in fiberwise geometric topology.
%{\it Dissertationes Mathematicae}, 2013, vol. 491, str. 1-120. $[$COBISS.SI-ID 16767065$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 60/167: Ne najdem podatka {STEVILKA}
{\crta, V.~Valov}
{General position properties in fiberwise geometric topology}
{Dissertationes Math.\ (Rozprawy Mat.)} {491} {2013} {} {1--120}
\objavljenoRevija
% 1.01: %list {\bf 12}. POTYATYNYK, Oles, BANAKH, Taras. Dimension of graphoids of rational vector-functions.
%{\it Topology and its Applications}, 2013, vol. 160, iss. 1, str. 24-44. $[$COBISS.SI-ID 16486745$]$\\
{O.~Potyatynyk, \crta}
{Dimension of graphoids of rational vector-functions}
{Topology Appl.} {160} {2013} {1} {24--4{4}}
\end{skupina}
%--------------------------------------------------------
% D. urednistvo v znanstvenih revijah in zbornikih
% znanstvenih konferenc
%--------------------------------------------------------
\begin{skupina}{D}
%\urednikRevija
% {OPIS}
% {REVIJA}
%\urednikZbornik
% {OPIS}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
\urednikRevija
{Podro\v{c}ni urednik}
{Central European Journal of Mathematics}
\urednikRevija
{\v{C}lan uredni\v{s}kega odbora}
{Topological algebra and its applications}
\urednikRevija
{\v{C}lan uredni\v{s}kega odbora}
{Topology and its applications}
\end{skupina}
%--------------------------------------------------------
% F. vabljena predavanja na tujih ustanovah in
% mednarodnih konferencah
%--------------------------------------------------------
%\begin{skupina}{F}
%\predavanjeUstanova
% {NASLOV}
% {OPIS}
% {USTANOVA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\predavanjeKonferenca
% {NASLOV}
% {OPIS}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
\begin{skupina}{F}
\predavanjeKonferenca
% 3.16: %list {\bf 18}. Research Workshop of the Israel Science Foundation, Interactions between Logic,Topological structures and Banach
%spaces theory, Eilat, May 19-24, 2013, BANAKH, Taras{\it . Recognizing topological groups, which are locally homeomorphic to LF-spaces}.
%Eilat, 21. 05. 2013. $[$COBISS.SI-ID 16632665$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 165/239: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 165/240: Ne najdem podatka {OPIS}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 165/241: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 165/242: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 165/243: Ne najdem podatka {LETO}
{Recognizing topological groups, which are locally homeomorphic to LF-spaces}
{vabljeno predavanje}
{Research Workshop of the Israel Science Foundation, Interactions between Logic, Topological structures and Banach spaces theory}
{Eilat} {Izrael} {maj} {2013}
\predavanjeKonferenca
% 3.16: {\bf 17}. 28th Summer Conference on Topology and Its Applications, Nipissing University in North Bay, Ontario, July 23-26, 2013,
%BANAKH, Taras{\it . Fixed fractals of multi-valued maps}. Nipissing University, North Bay, 24. 7. 2013. $[$COBISS.SI-ID 16831577$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/264: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/265: Ne najdem podatka {OPIS}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/266: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/267: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/268: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 159/269: Ne najdem podatka {LETO}
{Fixed fractals of multi-valued maps}
{vabljeno predavanje}
{28\uth Summer Conference on Topology and Its Applications}
{North Bay, Ontario} {Kanada} {julij} {2013}
\predavanjeUstanova
% 3.14: {\bf 16}. BANAKH, Taras{\it . Extremal densities and measures on groups and G-spaces and their combinatorial applications}.
%Wroc{\l}aw: Uniwersytet Jagiello\'{n}ski, 25.-28. nov. 2013. $[$COBISS.SI-ID 16807257$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 150/252: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 150/253: Ne najdem podatka {OPIS}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 150/254: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 150/255: Ne najdem podatka {LETO}
{Extremal densities and measures on groups and G-spaces and their combinatorial applications}
{vabljeno predavanje}
{Uniwersytet Jagiello\'{n}ski}
{Wroc{\l}aw} {Poljska} {november} {2013}
\end{skupina}
%--------------------------------------------------------
% G. aktivne udelezbe na mednarodnih in domacih
% konferencah
%--------------------------------------------------------
%\begin{skupina}{G}
%\konferenca
% {NASLOV}
% {KONFERENCA}
% {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{skupina}
%\begin{skupina}{G}
%\konferenca
% 1.08: {\bf 15}. BANAKH, Taras, MINE, Kotaro, REPOV\v{S}, Du\v{s}an, SAKAI, Katsuro, YAGASAKI, Tatsuhiko. Detecting topological groups
%which are (locally) homeomorphic to LF-spaces. V: DI MAIO, Giuseppe (ur.), TSABAN, Boaz (ur.). {\it Fourth Workshop on Coverings,
%Selections and Games in Topology : on the occasion of Professor Ljubi\v{s}a D. R. Ko\v{c}inac's 65th birthday : special issue},
%(Topology and its applications, ISSN 0166-8641, Vol. 160, iss. 18). Amsterdam $[$etc.$]$: Elsevier, 2013, str. 2272-2284. $[$COBISS.SI-ID 16776793$]$\\
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/296: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/297: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\banakh.tex 132/298: Ne najdem podatka {LETO}
% {Detecting topological groups which are (locally) homeomorphic to LF-spaces}
% {4\uth Workshop on Coverings, Selections and Games in Topology : on the occasion of Professor Ljubi\v{s}a D. R. Ko\v{c}inac's 65\uth birthday}
% {Caserta} {Italija} {junij} {2013}
%\end{skupina}
|
http://ugastro.berkeley.edu/radio/2017/handout_links/lsfit/lsfit_2008.toc | berkeley.edu | CC-MAIN-2017-39 | unk | application/x-tex | crawl-data/CC-MAIN-2017-39/segments/1505818688671.43/warc/CC-MAIN-20170922055805-20170922075805-00681.warc.gz | 358,280,362 | 2,568 | \contentsline {section}{\numberline {0}LEAST-SQUAREs FITTING FOR TWO PARAMETERS, AS WITH A STRAIGHT LINE.}{4}
\contentsline {subsection}{\numberline {0.1}The closed-form expressions for a straight-line fit}{4}
\contentsline {subsection}{\numberline {0.2}Better is the following generalized notation.}{5}
\contentsline {section}{\numberline {1}LEAST-SQUARES FITTING FOR MANY PARAMETERS, AS WITH A CUBIC}{6}
\contentsline {section}{\numberline {2}FAR, FAR BEST AND EASIEST: MATRIX ALGEBRA}{7}
\contentsline {section}{\numberline {3}UNCERTAINTIES IN THE DERIVED COEFFICIENTS}{8}
\contentsline {section}{\numberline {4}A NUMERICAL EXAMPLE AND ITS SOLUTION IN IDL}{10}
\contentsline {subsection}{\numberline {4.1}Generation of the numerical example}{11}
\contentsline {subsection}{\numberline {4.2}Solution of the Numerical Example in IDL}{12}
\contentsline {subsection}{\numberline {4.3}Discussion of the numerical example}{14}
\contentsline {section}{\numberline {5}THE COVARIANCE MATRIX AND ITS NORMALIZED COUNTERPART}{14}
\contentsline {subsection}{\numberline {5.1} Definition of the normalized covariance (or correlation) matrix}{14}
\contentsline {subsection}{\numberline {5.2} The covariance in our numerical example}{16}
\contentsline {section}{\numberline {6}REJECTING BAD DATAPOINTS I.: CHAUVENET'S CRITERION}{18}
\contentsline {section}{\numberline {7}NONLINEAR LEAST SQUARES}{20}
\contentsline {section}{\numberline {8}CHI-SQUARE FITTING AND WEIGHTED FITTING: DISCUSSION IGNORING COVARIANCE }{23}
\contentsline {subsection}{\numberline {8.1} The weighted mean: the simplest chi-square fit}{24}
\contentsline {subsection}{\numberline {8.2}The multivariate chi-square fit}{25}
\contentsline {subsection}{\numberline {8.3}Which equation---8.9\hbox {} or 8.10\hbox {}?}{28}
\contentsline {subsection}{\numberline {8.4}Datapoints with known {\it relative} but unknown {\it absolute} dispersions}{28}
\contentsline {subsection}{\numberline {8.5} Persnickety Diatribe on Choosing $\sigma _{m}$ }{29}
\contentsline {subsubsection}{\numberline {8.5.1}Choosing and correcting $\sigma _{m}$}{29}
\contentsline {subsubsection}{\numberline {8.5.2}When you're using equation 8.9\hbox {}\dots }{29}
\contentsline {subsubsection}{\numberline {8.5.3}Think about your results!}{30}
\contentsline {subsubsection}{\numberline {8.5.4}When your measurements are correlated\dots }{30}
\contentsline {section}{\numberline {9}CHI-SQUARE FITTING AND WEIGHTED FITTING: DISCUSSION INCLUDING COVARIANCE }{31}
\contentsline {subsection}{\numberline {9.1} Phenomenological description}{31}
\contentsline {subsection}{\numberline {9.2} Calculating the uncertainties of a single parameter---gedankenexperiment}{34}
\contentsline {subsection}{\numberline {9.3} Calculating the uncertainties of two parameters---gedankenexperiment}{34}
\contentsline {subsection}{\numberline {9.4} Calculating the uncertainties of three parameters---gedankenexperiment}{35}
\contentsline {subsection}{\numberline {9.5} Doing these calculations the non-gedanken easy way}{35}
\contentsline {subsection}{\numberline {9.6} Important comments about uncertainties}{37}
\contentsline {section}{\numberline {10}BRUTE FORCE CHI-SQUARE AND THE CURVATURE MATRIX}{37}
\contentsline {subsection}{\numberline {10.1}Parameter Uncertainties in Brute Force chi-square Fitting}{37}
\contentsline {section}{\numberline {11}USING SINGULAR VALUE DECOMPOSITION (SVD)}{38}
\contentsline {subsection}{\numberline {11.1}Phenomenological description of SVD}{39}
\contentsline {subsection}{\numberline {11.2}Using SVD for Least Squares}{40}
\contentsline {subsection}{\numberline {11.3}Important Conclusion for Least Squares!!!}{42}
\contentsline {subsection}{\numberline {11.4}How Small is ``Small''?}{42}
\contentsline {subsubsection}{\numberline {11.4.1}Strictly Speaking\dots }{42}
\contentsline {subsubsection}{\numberline {11.4.2}Practically Speaking\dots }{42}
\contentsline {subsection}{\numberline {11.5}Doing SVD in IDL}{43}
\contentsline {subsubsection}{\numberline {11.5.1}IDL's SVD routine {\tt la\_svd}}{43}
\contentsline {subsubsection}{\numberline {11.5.2}My routine {\it lsfit\_svd}}{43}
\contentsline {section}{\numberline {12}REJECTING BAD DATAPOINTS II: STETSON'S METHOD PLUS CHAUVENET'S CRITERION}{43}
\contentsline {subsection}{\numberline {12.1}Stetson's sliding weight}{44}
\contentsline {subsection}{\numberline {12.2}Implementation of the weight in our matrix equations}{45}
\contentsline {section}{\numberline {13}MEDIAN/MARS, INSTEAD OF LEAST-SQUARES, FITTING}{46}
\contentsline {subsection}{\numberline {13.1} The Median versus the MARS}{46}
\contentsline {subsubsection}{\numberline {13.1.1} For the Standard Median---it's the MARS}{47}
\contentsline {subsubsection}{\numberline {13.1.2} For an arbitrary function, e.g.\ the slope---it's a weighted MARS}{47}
\contentsline {subsection}{\numberline {13.2} The General Technique for Weighted MARS Fitting}{49}
\contentsline {subsection}{\numberline {13.3}Implementation, a Caution, and When To Stop Iterating}{50}
\contentsline {subsection}{\numberline {13.4}Errors in the Derived Parameters}{50}
\contentsline {subsection}{\numberline {13.5} Pedantic Comment: The MARS and the Double-sided Exponential pdf}{50}
\contentsline {subsection}{\numberline {13.6}IDL's related resources}{51}
\contentsline {section}{\numberline {14}FITTING WHEN MORE THAN ONE MEASURED PARAMETERS HAVE UNCERTAINTIES}{52}
\contentsline {subsection}{\numberline {14.1}A preliminary: Why the slope is systematically small}{52}
\contentsline {subsection}{\numberline {14.2}Jefferys' Method: Introduction}{54}
\contentsline {subsection}{\numberline {14.3}The Data Matrix and Vector}{54}
\contentsline {subsection}{\numberline {14.4} The Data Covariance Matrix and Defining Chi-Square}{57}
\contentsline {subsection}{\numberline {14.5}Formulation of the Problem and its Solution with Lagrange Multipliers}{58}
\contentsline {subsection}{\numberline {14.6}The Derivative Matrices}{59}
\contentsline {subsection}{\numberline {14.7}The Specific Example}{59}
\contentsline {subsection}{\numberline {14.8}The Solution to the Lagrangian: Two Matrix Equations}{61}
\contentsline {subsection}{\numberline {14.9} Solving Equations 14.18a\hbox {} and 14.18b\hbox {} Iteratively}{62}
\contentsline {subsection}{\numberline {14.10}Taking all those derivatives!}{63}
\contentsline {subsection}{\numberline {14.11}The Initial Guess}{64}
\contentsline {subsection}{\numberline {14.12}The Covariance Matrix (and errors) of the Derived Parameters}{64}
\contentsline {section}{\numberline {15} NOTATION COMPARISON WITH NUMERICAL RECIPES}{64}
|
https://mirrors.mit.edu/CTAN/macros/latex/contrib/ecothesis/capitulos/cap01/introduction.tex | mit.edu | CC-MAIN-2022-49 | application/octet-stream | application/x-tex | crawl-data/CC-MAIN-2022-49/segments/1669446710813.48/warc/CC-MAIN-20221201121601-20221201151601-00779.warc.gz | 425,645,234 | 1,105 | \documentclass[12pt]{report}
\usepackage[utf8]{inputenc}
\usepackage[brazilian,brazil]{babel}
\usepackage{fancyhdr,setspace,float,graphicx,lscape,array,longtable,colortbl,amsmath,amssymb,booktabs,multirow,hyperref,pdfpages,tocloft,titlesec,lipsum,natbib}
\usepackage[sectionbib]{chapterbib}
\begin{document}
%***
\clearpage
\linenumbers % numeração de linhas
\modulolinenumbers[3] % numeração de linhas
%***
% Texto
%***
\chapter{Nam dui ligula}
%***
\lipsum[2-2] Nam dui ligula, fringilla a, euismod sodales, sollicitudin vel, wisi. Morbi
auctor lorem non justo \citep{lamport1986latex}.
\section{Euismod sodales}
\lipsum[2-3]
%*** APAGAR O EXEMPLO ACIMA
%*** REFERÊNCIAS
\bibliography{referencias.bib}
\bibliographystyle{apalike}
\end{document}
|
https://doc.libelektra.org/api/0.9.6/latex/doc_help_kdb-umount_md.tex | libelektra.org | CC-MAIN-2023-06 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2023-06/segments/1674764499890.39/warc/CC-MAIN-20230131190543-20230131220543-00512.warc.gz | 229,294,417 | 1,081 | \label{doc_help_kdb-umount_md_md_doc_help_kdb_umount}%
\Hypertarget{doc_help_kdb-umount_md_md_doc_help_kdb_umount}%
\hypertarget{doc_help_kdb-umount_md_autotoc_md2568}{}\doxysection{SYNOPSIS}\label{doc_help_kdb-umount_md_autotoc_md2568}
{\ttfamily kdb umount $<$name$>$}\hypertarget{doc_help_kdb-umount_md_autotoc_md2569}{}\doxysection{DESCRIPTION}\label{doc_help_kdb-umount_md_autotoc_md2569}
Unmount backend from key database. This command writes into the {\ttfamily /etc} directory and as such it requires root permissions.\hypertarget{doc_help_kdb-umount_md_autotoc_md2570}{}\doxysection{OPTIONS}\label{doc_help_kdb-umount_md_autotoc_md2570}
\begin{DoxyItemize}
\item {\ttfamily -\/H}, {\ttfamily -\/-\/help}\+: Show the man page.
\item {\ttfamily -\/V}, {\ttfamily -\/-\/version}\+: Print version info.
\item {\ttfamily -\/p}, {\ttfamily -\/-\/profile $<$profile$>$}\+: Use a different kdb profile.
\item {\ttfamily -\/C}, {\ttfamily -\/-\/color $<$when$>$}\+: Print never/auto(default)/always colored output.
\item {\ttfamily -\/v}, {\ttfamily -\/-\/verbose}\+: Show which mount points were considered.
\end{DoxyItemize}\hypertarget{doc_help_kdb-umount_md_autotoc_md2571}{}\doxysection{SEE ALSO}\label{doc_help_kdb-umount_md_autotoc_md2571}
\begin{DoxyItemize}
\item \mbox{\hyperlink{doc_help_kdb-mount_md}{kdb-\/mount(1)}}.
\item \mbox{\hyperlink{doc_help_elektra-mounting_md}{elektra-\/mounting(7)}}.
\end{DoxyItemize} |
http://aiml2011.ksu.ru/sample_rus.tex | ksu.ru | CC-MAIN-2018-09 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2018-09/segments/1518891812327.1/warc/CC-MAIN-20180219032249-20180219052249-00775.warc.gz | 17,376,191 | 1,334 | \mag=1200
\documentclass{amsart}
\usepackage{amssymb,amscd}
\textwidth=130mm
\advance\hoffset by -1in
\advance\voffset by -1in
\usepackage[cp1251]{inputenc}
\usepackage[russian]{babel}
\title{Название доклада}
\author{И.~О. Автор}
\address{Место работы, город}
\email{адрес@электронной.почты}
\begin{document}
\maketitle
Объем тезисов не должен превышать 1 страницы.
При наборе избегайте использования собственных командных
последовательностей.
{\bf Теорема.}
{\sl Формулировки теорем, предложений и проч. набираются наклонным шрифтом.}
Список литературы, если его наличие необходимо, оформляется при
помощи стандартных средств \LaTeX\ (окружение {\tt
thebibliography}).
Пример оформления литературы.
\renewcommand{\refname}{Литература}
%Использовать для тезисов на русском языке
%\renewcommand{\refname}{References}
%Использовать для тезисов на английском языке
\begin{thebibliography}{}
\bibitem{Sample1} Фамилия И.\,О., \emph{Название статьи} // {Название журнала}.~-- 1989.~-- Т.~11.~-- №~9.~-- C.~3--15.
\bibitem{Sample2} Фамилия И.\,О., \emph{Название книги}.~-- {Город: Издательство}, 1989.~-- C.~506.
\end{thebibliography}{}
\end{document}
|
https://www.authorea.com/users/262619/articles/367068/download_latex | authorea.com | CC-MAIN-2021-21 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-21/segments/1620243989756.81/warc/CC-MAIN-20210518063944-20210518093944-00356.warc.gz | 670,406,077 | 3,424 | \documentclass[11pt]{article}
\usepackage{fullpage}
\usepackage{setspace}
\usepackage{parskip}
\usepackage{titlesec}
\usepackage[section]{placeins}
\usepackage{xcolor}
\usepackage{breakcites}
\usepackage{lineno}
\usepackage{hyphenat}
\usepackage{times}
\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
\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}
\newcommand{\msun}{\,\mathrm{M}_\odot}
\begin{document}
\title{STP Theory}
\author[1]{Mathias Dankl}%
\author[1]{Daniel Robert Weilandt}%
\affil[1]{EPFL}%
\vspace{-1em}
\date{\today}
\begingroup
\let\center\flushleft
\let\endcenter\endflushleft
\maketitle
\endgroup
\selectlanguage{english}
\begin{abstract}
TODO%
\end{abstract}%
\sloppy
\section*{Introduction}
\label{intro}
\subsection*{STP based model}
For the derivation of the model, the starting point is the total Gibbs Free Energy change $\Delta$G of a given reversible chemical reaction.
\begin{equation}
\label{eqn:gibbsfreeenergyI}
\Delta G = RT \ln(\frac{\nu_b}{\nu_f})
\end{equation}
Applying equation \ref{eqn:gibbsfreeenergyI}, $\Delta$G may be expressed as a sum of an ideal and a non-ideal contribution.
\begin{equation}
\label{eqn:gibbsfreeenergyII}
\Delta G = \Delta G_0 + \beta(\Delta U_b + \Delta U_f)
\end{equation}
On the other hand, the non-ideal contribution to $\Delta$G is related to the activities $a_i$ = $\gamma_i c_i$ of the species.
\begin{equation}
\label{eqn:deltaGnonideal}
\Delta G_{nonideal} = RT\ln(\frac{\Pi_{i\in products}a_i^{\mu_i}}{\Pi_{i\in reactants}a_i^{\mu_i}})
\end{equation}
Now the activity coefficient $\gamma_i$ due to the presence of species i in the environment may be expressed in the framework of Scaled Particle Theory.
\begin{equation}
\label{eqn:gammai1}
\ln(\gamma_i) = \ln(1-S_3) + \frac{6S_2}{1-S_3}r_i+(\frac{12S_1}{1-S_3}+\frac{18S_2^2}{(1-S_3)^2})r_i^2 + (\frac{8S_0}{1-S_3}+\frac{24S_1S_2}{(1-S_3)^2}+\frac{24S_2^3}{(1-S_3)^3})r_i^3
\end{equation}
where
\begin{equation}
\label{eqn:sx}
S_x = \frac{\pi}{6}\sum_{i=1}^M \rho_i(2r_i)^x
\end{equation}
and $\rho_i$ is the density of the species i in the solution and the sum is running over all species in the environment (including reaction partners). Using equations \ref{eqn:gibbsfreeenergyI} - \ref{eqn:gibbsfreeenergyII}, an analytical expression of $\Delta_U$ is obtained, which depends solely on the concentrations/densities and radii of the species in solution.
\begin{equation}
\label{eqn:DeltaU}
\Delta U/\beta = \sum_{r=1}^N \mu_r[\beta_0\ln(1-S_3) + \beta_1\frac{6S_2}{1-S_3}r_i+(\beta_2\frac{S_1}{1-S_3}+\beta_3\frac{S_2^2}{(1-S_3)^2})r_i^2+(\beta_4\frac{S_0}{1-S_3}+\beta_5\frac{S_1S_2}{(1-S_3)^2}+\beta_6\frac{S_2^3}{(1-S_3)^3})r_i^3+\ln(c_r)]
\end{equation}
with $\beta_0 = -1$, $\beta_1 = 6$, $\beta_2 = 12$, $\beta_3 = 18$, $\beta_4 = 8$, $\beta_5 = \beta_6 = 24$ and the sum is over all reactants of the considered
reaction.
\section*{Section}
\label{igw}
\section {Section}
Mauris nec massa leo. Mauris ac diam auctor nisl imperdiet porta. Sed sit amet neque eget nisi dictum placerat. Duis sit amet pellentesque odio. Cras scelerisque sem a consectetur vehicula. Aliquam interdum luctus fringilla. Nunc sollicitudin, lorem in semper viverra, \citet{Goldreich_1990}, dui nisi sodales sem, ut condimentum erat leo eget arcu \citep{Goldreich_1990,Kumar_1994}. Donec pharetra aliquam metus, non pulvinar tellus interdum a. Mauris a ante pharetra, mollis enim in, eleifend erat. Pellentesque suscipit risus massa, non vestibulum libero euismod feugiat. In hac habitasse platea dictumst. Maecenas rutrum lobortis lobortis. Vestibulum convallis porttitor sem ac ultricies. Mauris volutpat fringilla nisl blandit semper. Proin nec iaculis sem. Aenean neque ipsum, pretium a faucibus non, tincidunt ut sapien.
\section*{Non-LaTeX Section}
{\label{583331}}
Integer in metus aliquam, cursus dolor eu, \textbf{maximus arcu}.
Integer vel finibus odio. Maecenas sit amet rhoncus purus. Ut molestie
augue vel magna rutrum fermentum. Curabitur eleifend, nisl non rutrum
auctor, diam sapien rutrum purus, quis dictum erat leo in leo.
Vestibulum semper, velit non malesuada sagittis, tortor dolor
sollicitudin enim, sed ullamcorper tellus diam vitae est. Nullam auctor
dui ac ultricies porta. Aliquam erat volutpat. Maecenas finibus ultrices
felis eu congue. Integer pulvinar, elit sed mollis aliquet, magna turpis
molestie nisi, sed auctor justo massa vitae felis. Vivamus dui justo,
auctor non magna eget, varius dapibus augue.~
\selectlanguage{english}
\FloatBarrier
\bibliographystyle{unsrt}
\bibliography{bibliography/converted_to_latex.bib%
}
\end{document}
|
http://ftp.lip6.fr/pub/tex-archive/macros/plain/graphics/graphicx.tex | lip6.fr | CC-MAIN-2019-22 | application/x-tex | text/x-matlab | crawl-data/CC-MAIN-2019-22/segments/1558232255165.2/warc/CC-MAIN-20190519201521-20190519223521-00362.warc.gz | 84,821,603 | 716 | % Plain TeX interface to graphicx package.
% David Carlisle
\input miniltx
\def\Gin@driver{dvips.def}
\input graphicx.sty
\resetatcatcode
|
https://gitlab.science.ru.nl/benoit/tweetnacl/-/raw/056bd548f8cf33be4ce13bdc2d1aa6932d9fae60/paper/csf-supplementary/usenix-g.tex?inline=false | ru.nl | CC-MAIN-2022-33 | text/plain | application/x-tex | crawl-data/CC-MAIN-2022-33/segments/1659882572043.2/warc/CC-MAIN-20220814143522-20220814173522-00697.warc.gz | 280,788,722 | 2,045 | \newpage
\section{Usenix Security 2020 Review \#324G}
\begin{tabular}{rl}
\toprule
Review recommendation & 4. Minor revision \\
Writing quality & 4. Well-written \\
Reviewer interest & 2. I might go to a talk about this \\
Reviewer expertise & 2. Some familiarity \\
\bottomrule
\end{tabular}
\begin{center}
\subheading{===== Paper summary =====}
\end{center}
The paper takes a C implementation of the X25519 DH operation in the TweetNaCl library and proves it is correct. This proof ocurrs in two stages. Firstly, the paper formalises RFC 7748, which standardised X25519, in Coq. Then it goes on to show the C code, the Coq reference and the mathematical definition coincide.
\begin{center}
\subheading{===== Strengths =====}
\end{center}
\begin{itemize}
\item Clearly Written
\item Comprehensive with respect to the studied object
\item Most formally verified cryptography code is generated or written with verification in mind, so verifying arbitrary code is impressive.
\end{itemize}
\begin{center}
\subheading{===== Weaknesses =====}
\end{center}
\begin{itemize}
\item TweetNaCl is explicitly written as a simple and easy to audit library, compared to faster, more complex implementations.
\item The paper does not extend tooling or provide general techniques.
\end{itemize}
\begin{center}
\subheading{===== Detailed comments for authors =====}
\end{center}
I found the paper easy to read, especially for relativel complex topic.
Although I am not an expect on the implementation of cryptographic primitives, I found the mathematical explanation and verification in particular easy to follow.
However, I found it very difficult to evaluate the scientific value of this paper. It gave me no new insights into proof methodology, the benefits or drawbacks of this particular approach, or the effort required.
If the paper was proposing a new technique which could be applied more generally, attempted to show the same technique scaled to multiple X25519 implementations or otherwise compared different techniques for verification this would significantly improve it.
\begin{center}
\subheading{===== Requested changes =====}
\end{center}
\begin{itemize}
\item Better clarify effort required for this undertaking.
\item Describe challenges for proving statements about the more complex (faster) implementations.
\item Describe which parts of the contributions could possibly be applied more generally.
\end{itemize}
|
https://dlmf.nist.gov/34.4.E2.tex | nist.gov | CC-MAIN-2018-09 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2018-09/segments/1518891813691.14/warc/CC-MAIN-20180221163021-20180221183021-00055.warc.gz | 639,777,632 | 828 | \[\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\
l_{1}&l_{2}&l_{3}\end{Bmatrix}=\Delta(j_{1}j_{2}j_{3})\Delta(j_{1}l_{2}l_{3})%
\Delta(l_{1}j_{2}l_{3})\Delta(l_{1}l_{2}j_{3})\*\sum_{s}\frac{(-1)^{s}(s+1)!}{%
(s-j_{1}-j_{2}-j_{3})!(s-j_{1}-l_{2}-l_{3})!(s-l_{1}-j_{2}-l_{3})!(s-l_{1}-l_{%
2}-j_{3})!}\*\frac{1}{(j_{1}+j_{2}+l_{1}+l_{2}-s)!(j_{2}+j_{3}+l_{2}+l_{3}-s)!%
(j_{3}+j_{1}+l_{3}+l_{1}-s)!},\] |
http://dlmf.nist.gov/31.2.E5.tex | nist.gov | CC-MAIN-2014-10 | application/x-tex | null | crawl-data/CC-MAIN-2014-10/segments/1394010354479/warc/CC-MAIN-20140305090554-00082-ip-10-183-142-35.ec2.internal.warc.gz | 54,244,698 | 563 | \[z={\mathop{\sin\/}\nolimits^{{2}}}\theta,\] |
https://7d8ac097-a-6ea39e70-s-sites.googlegroups.com/a/berzsenyi.hu/nmmv/feladatok/2000/2000-10-mo.tex?attachauth=ANoY7cqWv9VKax8MFLLJU2eNu5yevG7u6WAt19Q9ujo64iuJw-YRpc5KH7xbt8hGANMb8bCFVQl9JSMeIJoSNkvTBzJtjpAt8QJQuXMMQcJuh4JzaM0A7SaLorpkS-0UB_uN0tcUzaICG2Vkkp0vRUAxXoGFYYdfKgz4J4OAhVC-vZLSr3qxHlB4nBVqu-RT90qTkLUwcBJjiXJMconWGYB-ZxpVoFDnsJtC5qyGjhJllgjenT4hsXs%3D&attredirects=0 | googlegroups.com | CC-MAIN-2019-22 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2019-22/segments/1558232257316.10/warc/CC-MAIN-20190523164007-20190523190007-00516.warc.gz | 378,589,330 | 4,781 | \documentclass[a4paper,10pt]{article}
\usepackage[latin2]{inputenc}
\usepackage{graphicx}
\usepackage{amssymb}
\voffset - 20pt
\hoffset - 35pt
\textwidth 450pt
\textheight 650pt
\frenchspacing
\pagestyle{empty}
\def\ki#1#2{\hfill {\it #1 (#2)}\medskip}
\def\tg{\, \hbox{tg} \,}
\def\ctg{\, \hbox{ctg} \,}
\def\arctg{\, \hbox{arctg} \,}
\def\arcctg{\, \hbox{arcctg} \,}
\begin{document}
\begin{center} \Large {\em IX. Nemzetközi Magyar Matematika Verseny} \end{center}
\begin{center} \large{\em Dunaszerdahely, 2000. március 23-27.} \end{center}
\smallskip
\begin{center} \large{\bf 10. osztály} \end{center}
\bigskip
{\bf 1. feladat: } Oldjuk meg az egész számok körében az
$${\setlength\arraycolsep{2pt}\begin{array}{rcl}
x^2-y^2-z^2 &=& 1 \\[6pt]
y+z-x &=& 3
\end{array}}
$$
egyenletrendszert!
\ki{Neubauer Ferenc}{Munkács}\medskip
{\bf 1. feladat I. megoldása: } Fejezzük ki $x$-et a második egyenletből és helyettesítsük be az elsőbe! Azt kapjuk:
$$(y + z -3)^2 - y^2 - z^2 = 1$$
Végezzük el a műveleteket, ekkor az adódik:
$$yz - 3z - 3y + 4 = 0$$
Ezt átalakítva $z(y-3) = 3y - 4$-et kapjuk. $y = 3$-ra ez nyilván nem igaz. Ha $y \not = 3$, akkor átrendezve $z = {3y - 4 \over y - 3} = 3 + {5 \over y-3}$
Ez láthatóan csak akkor lesz egész, ha $y-3 | 5$, ez azt jelenti, hogy $y-3$ lehetséges értékei 1, 5, $-1$, $-5$. Ezekre az adott képletek alapján kiszámolva a változók értékét négy megoldást kapunk: $x = 9, y = 4, z = 8$, $x = -3; y = 2; z = -2$, $x = 9; y = 8; z = 4$ és $x = -3; y = -2; z = 2$.
\medskip
\hbox to \hsize{\hskip2truecm\hrulefill\hskip2truecm}
{\bf 2. feladat: } Az $ABC$ derékszögű háromszögben ($ACB\angle=90^\circ$) a beírt kör $K$ középpontját a háromszög köré írt kör $F$ középpontjával összekötő egyenes az átfogóval $45^\circ$-os szöget zár be. Számítsuk ki az átfogó és a beírt kör sugarának arányát!
\ki{Mészáros József}{Galánta}\medskip
{\bf 2. feladat I. megoldása: } %Ábra a jelölésekkel
Jelöljük $\rho$-val a beírt kör sugarát! Ekkor $FD = KD = CE = \rho$ (a $KCE$ és $KFD$ szögek is $45^{\circ}$-osak), tehát $FCB$ egyenlőszárú háromszög, hiszen az érintőszakaszok egyenlőségéből $BD = BE$ is teljesül. $AF = FB$, és a két előző egyenlőségünk miatt $FB = BC$. Ez azt jelenti, hogy $BAC \angle = 30^{\circ}$, $ABC \angle = 60^{\circ}$. Az $AF$ szakasz hosszát $c$-vel jelölve $BC = c$ és $AC = c \sqrt{3}$. Derékszögű háromszögben ismert összefüggés, hogy $CB + AC - AB = 2 \rho$. Ez pedig azt jelenti, hogy $c + c \sqrt{3} - 2c = 2 \rho$, ebből pedig $p = {c \sqrt{3} - c \over 2} = \rho$, ebből $c$-t kiemelve ${2c(\sqrt{3} - 1) \over 4} = \rho$. Ezt átrendezve pedig ${2c \over \rho} = {4 \over \sqrt{3} - 1}$, ezt gyöktelenítve pedig a kérdéses hányados $2 \sqrt{3} + 1$.
\medskip
\hbox to \hsize{\hskip2truecm\hrulefill\hskip2truecm}
{\bf 3. feladat: } Számítsuk ki az $a_1+a_2+\dots+a_{2000}$ összeget, ha
$a_n=\frac{1}{(n+1)\sqrt n + n\sqrt{n+1}} \ \ (n \in {\mathbb{N^+}})$!
\ki{Kántor Sándorné}{Debrecen}\medskip
{\bf 3. feladat I. megoldása: } Bontsuk szét az $a_n$-t definiáló törtet!
$${1 \over (n+1) \sqrt{n} + n \sqrt{n+1}} = {(n+1) \sqrt{n} - n \sqrt{n+1} \over (n+1)^2n - n^2(n+1)} = {1 \over \sqrt{n}} - {1 \over \sqrt{n+1}}$$
Így a feladatban szereplő összeg teleszkopikus:
{\setlength\arraycolsep{2pt}\begin{eqnarray*}
&&a_1 + a_2 + a_3 + \ldots + a_{1999} + a_{2000} = \\[6pt]
&&= \left({1 \over \sqrt{1}} - {1 \over \sqrt{2}} \right) + \left({1 \over \sqrt{2}} - {1 \over \sqrt{3}} \right) + \ldots + \left({1 \over \sqrt{1999}} - {1 \over \sqrt{2000}} \right) + \left({1 \over \sqrt{2000}} - {1 \over \sqrt{2001}} \right) = \\[6pt]
&&= 1 - {1 \over \sqrt{2001}} \approx 0,9977645
\end{eqnarray*}}
\medskip
\hbox to \hsize{\hskip2truecm\hrulefill\hskip2truecm}
{\bf 4. feladat: } Az $ABC$ háromszög $BC$ oldalán úgy vettük fel az $A_1, A_2, \dots, A_{n-1}$ pontokat, hogy az $AA_1, AA_2, \dots, AA_{n-1}$ félegyenesek a $BAC\angle=\alpha$ szöget $n$ egyenlő részre osztják. Igazoljuk, hogy
$$AB \cdot AA_1+AA_1\cdot AA_2+\dots+AA_{n-1}\cdot AC=AB\cdot AC\cdot \frac{\sin \alpha}{\sin{\frac{\alpha}{n}}} .$$
\ki{Bencze Mihály}{Brassó}\medskip
{\bf 4. feladat I. megoldása: } %Esetleg egy vázlatos ábra a pontok elhelyezkedéséről
A $BAA_1, A_1AA_2, \ldots , A_{n-1}AC$ háromszögek együttesen kiadják az $ABC$ háromszög területét. A trigonometrikus területképlettel ($\alpha$ az $A$-nál lévő szöget is jelöli)
$$T_{ABC} = {1 \over 2} AB \cdot AA_1 \sin {\alpha \over n} + {1 \over 2} AA_1 \cdot AA_2 \sin {\alpha \over n} + \ldots + {1 \over 2} AA_{n-1}\cdot AC \sin {\alpha \over n} = {1 \over 2}AB \cdot AC \sin \alpha$$
Ebből pedig átrendezve azt kapjuk, hogy
$$AB \cdot AA_1 + AA_1 \cdot AA_2 + \ldots + AA_{n-1} \cdot AC = AB \cdot AC {\sin \alpha \over \sin {\alpha \over n}},$$
és éppen ezt kellett igazolnunk.
\medskip
\hbox to \hsize{\hskip2truecm\hrulefill\hskip2truecm}
{\bf 5. feladat: } A táblára felírtak 3 pozitív számot. Egy lépésben a táblára felírt számok közül egyet letörölhetünk és helyére a megmaradt két szám összegénél 1-gyel kisebb számot írhatunk. Néhány lépés után a táblán ez a három szám áll: 17, 75, 91. Lehetett-e a kiinduló számhármas a) 2, 2, 2; és b) 3, 3, 3 ?
\ki{Szabó Magda}{Szabadka}\medskip
{\bf 5. feladat I. megoldása: } Nézzük meg először az a.) esetet! Ekkor három páros számból indulunk ki, egyet letörölve a helyére páratlant írunk, így lesz két páros és egy páratlan számunk. Ezek közül ha a páratlant töröljük le, a helyére páros kerül, de ha valamelyik párost, annak a helyébe páros fog kerülni. Ez pedig azt jelenti, hogy akárhány lépést is végzünk el, a kapott számhármas még mindig két páros és egy páratlan számot fog tartalmazni. Mivel pedig a feladat által megadott eredmény nem ilyen, azért nem lehetséges, hogy a $(2,2,2)$-ből indulva eljussunk ahhoz.
A b.) esetben léteznek ilyen lépések. Egy lehetséges sorozatot megadunk:
$$(3,3,3), (5,3,3), (5,3,7), (5,11,7), (17,11,7), (17,11,27), (17,43,27), (17,43,59), (17,75,59), (17,75,91)$$
\medskip
\hbox to \hsize{\hskip2truecm\hrulefill\hskip2truecm}
{\bf 6. feladat: } Az $ABCD$ négyzet $AB$ oldalának $A$-hoz közelebbi harmadolópontja $H$. A $H$ pont tükörképe $A$-ra $H_1$, $B$-re $H_2$. A $CH_1$ és $AD$ egyenesek metszéspontja $E$, a $DH_2$ és $BC$ egyenesek metszéspontja $F$, végül a $CH_1$ és $DH_2$ egyenesek metszéspontja $M$. Hányad része az $ABCD$ négyzet területének a $DEM$ és $CFM$ háromszögek területének összege?
\ki{Bíró Bálint}{Eger}\medskip
{\bf 6. feladat I. megoldása: } Jelöljük az $AH = AH_1$ távolságot $x$-szel! Ekkor $BH = BH_1 = 2x$. A $BH_2F$ és $CDF$ háromszögek hasonlók lesznek, mivel szögeik egyenlő nagyságúak. Ha most $BF$ felét $y$-nal jelöljük, akkor a hasonlóság miatt $CF = 3y$. Ugyanígy az $AH_1E$ és $CDE$ háromszögek is hasonlók, tehát ha az $AE$ hosszúságot $z$-vel jelöljük, akkor $DE = 3z$. Mivel a négyzet minden oldala egyenlő, azért $3x = 5y = 4z$.
\centerline{\includegraphics{figures/2000-10-6}}
Húzzunk $M$-en át párhuzamost $AB$-vel, legyenek ennek metszéspontjai $AD$-vel és $BC$-vel $G$ és $K$! Legyen a $GM$ szakasz hossza $v$, az $MK$-é $v'$! Ekkor írjuk fel a $DEM$ és $CFM$ háromszögek területösszegét!
$$T_{DEM} + T_{CFM} = {3zv \over 2} + {3yv' \over 2} = {3 \over 2} \left[zv + y(3x-v) \right],$$
hiszen az nyilvánvaló, hogy $v + v' = 3x$. Tekintve, hogy $z = {3 \over 4} x$, és $y = {3 \over }x$ (ezt láttuk be az előbb), azért
{\setlength\arraycolsep{2pt}\begin{eqnarray*}
T_{DEM} + T_{CFM} &=& {3 \over 2}\left[ {3 \over 4}xv + {3 \over 5}x \cdot 3x - {3 \over 5} xv \right] = \\[6pt]
&=& {3 \over 2}\left[ {3 \over 20}xv + {9 \over 5}x^2 \right] = {3 \over 2} \left[{3 \over 20}xv + {36 \over 20}x^2\right] = {9 \over 40}x[v + 12x]
\end{eqnarray*}}
Ebben már csak két ismeretlen van, $x$ és $v$. A négyzet területe $9x^2$, tehát elegendő meghatároznunk a ${v \over x}$ hányadost. Jelöljük ehhez a $GE$ szakasz hosszát $t$-vel! A $GEM$ és $AEH_1$ háromszögek hasonlók, mivel szögeik megegyeznek. Ez azt jelenti, hogy ${v \over t} = {x \over z} = {4 \over 3}$, tehát $3v = 4t$. Látható az is, hogy a $DGM$ és $DAH_2$ háromszögek is hasonlók, hiszen szögeik megegyeznek. Ezért ${3z - t \over v} = {3x \over 5x} = {3 \over 5}$. Ezt átrendezve $3z - {3 \over 4}v = {3 \over 5}v$, tehát $20z = 9v$. Tudjuk azonban, hogy $4z = 3x$, ebből $5 \cdot 3x = 9v$, vagyis $5x = 3v$. Ezt beírva a korábban kapott területképletbe
$$T_{DEM} + T_{CFM} = {9 \over 40}x \left[ v + 12x \right] = {9 \over 40}x \left[{5 \over 3}x + {36 \over 3}x \right] = 9x^2 {41 \over 120}$$
Mivel pedig az $ABCD$ négyzet területe $9x^2$, azért a két háromszög területösszege a négyzet területének ${41 \over 120}$-ad része.
\medskip
\vfill
\end{document} |
https://floridaclimateinstitute.org/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%20FROM%20refs%20WHERE%20serial%20%3D%201616%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=20&rowOffset=&wrapResults=1&citeOrder=creation-date&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | floridaclimateinstitute.org | CC-MAIN-2017-47 | application/x-latex | text/x-php | crawl-data/CC-MAIN-2017-47/segments/1510934809229.69/warc/CC-MAIN-20171125013040-20171125033040-00324.warc.gz | 614,898,511 | 1,368 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Howard_etal2017} Howard, J. L., Creed, J. C., Aguiar, M. V. P., \& Fourqurean, J. W. (2017). CO2 released by carbonate sediment production in some coastal areas may offset the benefits of seagrass {\textquotedblleft}Blue Carbon{\textquotedblright} storage. \textit{Limnology and Oceanography}, .
\end{thebibliography}
\end{document}
|
https://fifthestate.anarchistlibraries.net/library/402-winter-2019-bikes-for-peace.tex | anarchistlibraries.net | CC-MAIN-2021-49 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-49/segments/1637964363226.68/warc/CC-MAIN-20211205221915-20211206011915-00459.warc.gz | 311,584,164 | 3,435 | \documentclass[DIV=12,%
BCOR=0mm,%
headinclude=false,%
footinclude=false,open=any,%
fontsize=10pt,%
oneside,%
paper=210mm:11in]%
{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{english}
\setmainfont{cmunrm.ttf}[Script=Latin,%
Path=/usr/share/fonts/truetype/cmu/,%
BoldFont=cmunbx.ttf,%
BoldItalicFont=cmunbi.ttf,%
ItalicFont=cmunti.ttf]
\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\englishfont{cmunrm.ttf}[Script=Latin,%
Path=/usr/share/fonts/truetype/cmu/,%
BoldFont=cmunbx.ttf,%
BoldItalicFont=cmunbi.ttf,%
ItalicFont=cmunti.ttf]
% 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{Bikes for Peace}
\date{}
\author{Gregg Williard}
\subtitle{}
% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={Bikes for Peace},%
pdfauthor={Gregg Williard},%
pdfsubject={},%
pdfkeywords={Fifth Estate \#402, Winter 2019}%
}
\begin{document}
\begin{titlepage}
\strut\vskip 2em
\begin{center}
{\usekomafont{title}{\huge Bikes for Peace\par}}%
\vskip 1em
\vskip 2em
{\usekomafont{author}{Gregg Williard\par}}%
\vskip 1.5em
\vfill
\strut\par
\end{center}
\end{titlepage}
\cleardoublepage
\begin{quote}
Bikes have no power until bodily given
\end{quote}
\begin{quote}
and given, give back at higher gear.
\end{quote}
\begin{quote}
Being mounted, being ridden
\end{quote}
\begin{quote}
without armor plating, they’re
\end{quote}
\begin{quote}
light in their taking
\end{quote}
\begin{quote}
and being taken where.
\end{quote}
\begin{quote}
Not that bikes can’t be taken, and take
\end{quote}
\begin{quote}
to war: the U.S. in Havana, the British
\end{quote}
\begin{quote}
against Boers, the Japanese in Shanghai,
\end{quote}
\begin{quote}
and Germans in France, the V.C. and
\end{quote}
\begin{quote}
Viet Minh, all pedaling down some
\end{quote}
\begin{quote}
variety of Ho Chi Minh Trail.
\end{quote}
\begin{quote}
And the Paratrooper TM U.S. Military Bike
\end{quote}
\begin{quote}
folds 3x3x1 foot small, without the use
\end{quote}
\begin{quote}
of tools and weighs
\end{quote}
\begin{quote}
a mere 29 pounds of F.I.T.
\end{quote}
\begin{quote}
(Folding Integrated Technology). Today on
\end{quote}
\begin{quote}
the modern battlefield, with thermal and acoustic
\end{quote}
\begin{quote}
signatures read, the stealth and efficiency
\end{quote}
\begin{quote}
of the military bike is an advantage lost
\end{quote}
\begin{quote}
on no command.
\end{quote}
\begin{quote}
And yet.
\end{quote}
\begin{quote}
In historical accounts of these bicycle brigades
\end{quote}
\begin{quote}
again and again soldiers on bikes
\end{quote}
\begin{quote}
have been greeted with Laughs.
\end{quote}
\begin{quote}
There’s something about enlisting the bike to kill
\end{quote}
\begin{quote}
that seems fundamentally wacked.
\end{quote}
\begin{quote}
The Paratrooper TM folds 3x3x1 ft small,
\end{quote}
\begin{quote}
but most bikes go to peaces better
\end{quote}
\begin{quote}
(there’s endless kinds of peaces, see,
\end{quote}
\begin{quote}
and some might even turn Clausewitz
\end{quote}
\begin{quote}
upside down on Kaiser-spiked head to
\end{quote}
\begin{quote}
quip, Peace is the Continuation of War
\end{quote}
\begin{quote}
by Other Means, best waged Light-weight
\end{quote}
\begin{quote}
and quick, by bike).
\end{quote}
\begin{quote}
I’m not so sure. When it’s war it’s only
\end{quote}
\begin{quote}
war you ride and are ridden by:
\end{quote}
\begin{quote}
square wheels de rigueur, and
\end{quote}
\begin{quote}
derailleurs that shift smooth
\end{quote}
\begin{quote}
from nothing to nothing
\end{quote}
\begin{quote}
to less than naught.
\end{quote}
% 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}
Gregg Williard
Bikes for Peace
\bigskip
\href{https://www.fifthestate.org/archive/402-winter-2019/bikes-for-peace}{\texttt{https://www.fifthestate.org/archive/402-winter-2019/bikes-for-peace}}
Fifth Estate \#402, Winter 2019
\bigskip
\textbf{fifthestate.anarchistlibraries.net}
\end{center}
% end final page with colophon
\end{document}
% No format ID passed.
|
http://dlmf.nist.gov/13.10.E16.tex | nist.gov | CC-MAIN-2014-10 | application/x-tex | null | crawl-data/CC-MAIN-2014-10/segments/1394011240269/warc/CC-MAIN-20140305092040-00089-ip-10-183-142-35.ec2.internal.warc.gz | 48,399,824 | 674 | \[\int_{{0}}^{{\infty}}e^{{-t}}t^{{\frac{1}{2}\nu}}\mathop{U\/}\nolimits\!\left(%
a,b,t\right)\mathop{J_{{\nu}}\/}\nolimits\!\left(2\sqrt{xt}\right)dt=\mathop{%
\Gamma\/}\nolimits\!\left(\nu-b+2\right)x^{{\frac{1}{2}\nu}}e^{{-x}}\mathop{{%
\mathbf{M}}\/}\nolimits\!\left(a,a-b+\nu+2,x\right),\] |
http://voodoo-circle.sourceforge.net/doc_for_developers/latex/c__micro__error__symbol__index_8cpp.tex | sourceforge.net | CC-MAIN-2018-05 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2018-05/segments/1516084887621.26/warc/CC-MAIN-20180118210638-20180118230638-00654.warc.gz | 378,416,576 | 958 | \hypertarget{c__micro__error__symbol__index_8cpp}{
\section{c\_\-micro\_\-error\_\-symbol\_\-index.cpp File Reference}
\label{c__micro__error__symbol__index_8cpp}\index{c\_\-micro\_\-error\_\-symbol\_\-index.cpp@{c\_\-micro\_\-error\_\-symbol\_\-index.cpp}}
}
Class 'c\_\-micro\_\-error\_\-symbol\_\-index'.
{\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\_\-micro\_\-error\_\-symbol\_\-index.h\char`\"{}}\par
{\ttfamily \#include \char`\"{}../utils/precomp.h\char`\"{}}\par
Include dependency graph for c\_\-micro\_\-error\_\-symbol\_\-index.cpp:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=240pt]{c__micro__error__symbol__index_8cpp__incl}
\end{center}
\end{figure}
\subsection{Detailed Description}
Class 'c\_\-micro\_\-error\_\-symbol\_\-index'.
Definition in file \hyperlink{c__micro__error__symbol__index_8cpp_source}{c\_\-micro\_\-error\_\-symbol\_\-index.cpp}.
|
https://cheatography.com/elpluto/cheat-sheets/devo-linq-query-language-syntax/tex/ | cheatography.com | CC-MAIN-2022-49 | text/plain | application/x-tex | crawl-data/CC-MAIN-2022-49/segments/1669446711336.41/warc/CC-MAIN-20221208114402-20221208144402-00728.warc.gz | 188,129,429 | 9,528 | \documentclass[10pt,a4paper]{article}
% Packages
\usepackage{fancyhdr} % For header and footer
\usepackage{multicol} % Allows multicols in tables
\usepackage{tabularx} % Intelligent column widths
\usepackage{tabulary} % Used in header and footer
\usepackage{hhline} % Border under tables
\usepackage{graphicx} % For images
\usepackage{xcolor} % For hex colours
%\usepackage[utf8x]{inputenc} % For unicode character support
\usepackage[T1]{fontenc} % Without this we get weird character replacements
\usepackage{colortbl} % For coloured tables
\usepackage{setspace} % For line height
\usepackage{lastpage} % Needed for total page number
\usepackage{seqsplit} % Splits long words.
%\usepackage{opensans} % Can't make this work so far. Shame. Would be lovely.
\usepackage[normalem]{ulem} % For underlining links
% Most of the following are not required for the majority
% of cheat sheets but are needed for some symbol support.
\usepackage{amsmath} % Symbols
\usepackage{MnSymbol} % Symbols
\usepackage{wasysym} % Symbols
%\usepackage[english,german,french,spanish,italian]{babel} % Languages
% Document Info
\author{Rafa Hernández (elpluto)}
\pdfinfo{
/Title (devo-linq-query-language-syntax.pdf)
/Creator (Cheatography)
/Author (Rafa Hernández (elpluto))
/Subject (Devo LINQ, query language syntax Cheat Sheet)
}
% Lengths and widths
\addtolength{\textwidth}{6cm}
\addtolength{\textheight}{-1cm}
\addtolength{\hoffset}{-3cm}
\addtolength{\voffset}{-2cm}
\setlength{\tabcolsep}{0.2cm} % Space between columns
\setlength{\headsep}{-12pt} % Reduce space between header and content
\setlength{\headheight}{85pt} % If less, LaTeX automatically increases it
\renewcommand{\footrulewidth}{0pt} % Remove footer line
\renewcommand{\headrulewidth}{0pt} % Remove header line
\renewcommand{\seqinsert}{\ifmmode\allowbreak\else\-\fi} % Hyphens in seqsplit
% This two commands together give roughly
% the right line height in the tables
\renewcommand{\arraystretch}{1.3}
\onehalfspacing
% Commands
\newcommand{\SetRowColor}[1]{\noalign{\gdef\RowColorName{#1}}\rowcolor{\RowColorName}} % Shortcut for row colour
\newcommand{\mymulticolumn}[3]{\multicolumn{#1}{>{\columncolor{\RowColorName}}#2}{#3}} % For coloured multi-cols
\newcolumntype{x}[1]{>{\raggedright}p{#1}} % New column types for ragged-right paragraph columns
\newcommand{\tn}{\tabularnewline} % Required as custom column type in use
% Font and Colours
\definecolor{HeadBackground}{HTML}{333333}
\definecolor{FootBackground}{HTML}{666666}
\definecolor{TextColor}{HTML}{333333}
\definecolor{DarkBackground}{HTML}{1A7EA3}
\definecolor{LightBackground}{HTML}{F0F6F9}
\renewcommand{\familydefault}{\sfdefault}
\color{TextColor}
% Header and Footer
\pagestyle{fancy}
\fancyhead{} % Set header to blank
\fancyfoot{} % Set footer to blank
\fancyhead[L]{
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{C}
\SetRowColor{DarkBackground}
\vspace{-7pt}
{\parbox{\dimexpr\textwidth-2\fboxsep\relax}{\noindent
\hspace*{-6pt}\includegraphics[width=5.8cm]{/web/www.cheatography.com/public/images/cheatography_logo.pdf}}
}
\end{tabulary}
\columnbreak
\begin{tabulary}{11cm}{L}
\vspace{-2pt}\large{\bf{\textcolor{DarkBackground}{\textrm{Devo LINQ, query language syntax Cheat Sheet}}}} \\
\normalsize{by \textcolor{DarkBackground}{Rafa Hernández (elpluto)} via \textcolor{DarkBackground}{\uline{cheatography.com/46990/cs/21055/}}}
\end{tabulary}
\end{multicols}}
\fancyfoot[L]{ \footnotesize
\noindent
\begin{multicols}{3}
\begin{tabulary}{5.8cm}{LL}
\SetRowColor{FootBackground}
\mymulticolumn{2}{p{5.377cm}}{\bf\textcolor{white}{Cheatographer}} \\
\vspace{-2pt}Rafa Hernández (elpluto) \\
\uline{cheatography.com/elpluto} \\
\end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
\SetRowColor{FootBackground}
\mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Cheat Sheet}} \\
\vspace{-2pt}Not Yet Published.\\
Updated 22nd November, 2019.\\
Page {\thepage} of \pageref{LastPage}.
\end{tabulary}
\vfill
\columnbreak
\begin{tabulary}{5.8cm}{L}
\SetRowColor{FootBackground}
\mymulticolumn{1}{p{5.377cm}}{\bf\textcolor{white}{Sponsor}} \\
\SetRowColor{white}
\vspace{-5pt}
%\includegraphics[width=48px,height=48px]{dave.jpeg}
Measure your website readability!\\
www.readability-score.com
\end{tabulary}
\end{multicols}}
\begin{document}
\raggedright
\raggedcolumns
% Set font size to small. Switch to any value
% from this page to resize cheat sheet text:
% www.emerson.emory.edu/services/latex/latex_169.html
\footnotesize % Small font.
\begin{multicols*}{2}
\begin{tabularx}{8.4cm}{x{3.52 cm} x{4.48 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Structure keywords}} \tn
% Row 0
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{from}} & Point to a table for the query. Specify a table name using tags.\{\{nl\}\} `\{\{fa-eye\}\}{\bf{from}} my.app.web.auth` \tn
% Row Count 5 (+ 5)
% Row 1
\SetRowColor{white}
\{\{nobreak\}\}{\bf{where}} & Where clause to filter results. \{\{nl\}\} `
\{\{fa-check\}\}{\bf{where}} {[}filter1 expression{]}, {[}filter2 expression{]}\{\{nl\}\}
\{\{fa-eye\}\}String values in expressions have to be surrounded by double quotes, single quotes are not allowed. ` \tn
% Row Count 16 (+ 11)
% Row 2
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{select}} & Add column to result set: \{\{nl\}\} `\{\{fa-check\}\}{\bf{select}} source\_column or column operation as destination\_column\{\{nl\}\}\{\{fa-eye\}\}{\bf{select}} uriHost(uri) as host` \tn
% Row Count 24 (+ 8)
% Row 3
\SetRowColor{white}
\{\{nobreak\}\}{\bf{group every / by}} & Group clause with an optional server and client aggregation period filter: \{\{nl\}\} `\{\{fa-check\}\}{\bf{group}} {[}{\bf{every}} server\_period{]} {[}{\bf{by}} column{]} \{\{nl\}\} {[}{\bf{every}} client\_period{]}\{\{nl\}\}\{\{fa-eye\}\}{\bf{group}} by statusCode\{\{nl\}\}\{\{fa-eye\}\}{\bf{group}} every 10m\{\{nl\}\}\{\{fa-eye\}\}{\bf{group}} every 10m by statusCode every 1m` \tn
% Row Count 39 (+ 15)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.52 cm} x{4.48 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Structure keywords (cont)}} \tn
% Row 4
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{every}} & Client aggregation filter: `\{\{nl\}\} \{\{fa-check\}\}{\bf{every}} period\{\{nl\}\}
\{\{fa-eye\}\}Period syntax: an integer number follow by a symbol indicating the time period:{\bf{{[}s:seconds, m:minutes, h:hours, d:days, no suffix:milliseconds{]}}}\{\{nl\}\}
\{\{fa-eye\}\}{\bf{every}} 0 means no client period.\{\{nl\}\}
\{\{fa-eye\}\}{\bf{every}} 5m by serverIp ` \tn
% Row Count 15 (+ 15)
% Row 5
\SetRowColor{white}
\{\{nobreak\}\}{\bf{ifthenelse}} & {\bf{if/then/else}} equivalent clause to set conditionally column values: \{\{nl\}\} `
\{\{fa-check\}\}{\bf{ifthenelse}}(condition, errorValue, successValue ) \{\{nl\}\}
\{\{fa-eye\}\}select {\bf{ifthenelse}}(statusCode != 200,"Error","Success") as statusCodeDesc ` \tn
% Row Count 27 (+ 12)
% Row 6
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{decode}} & {\bf{switch/case}} equivalent clause to set conditionally column values:\{\{nl\}\} `
\{\{fa-check\}\}{\bf{decode}}(column, checkValue, value,{[}checkValue2, value2{]})\{\{nl\}\}
\{\{fa-eye\}\}Each pair of arguments {\bf{{[}checkValue, value{]}}} is equivalent to a case sentence of a switch statement. \{\{nl\}\}
\{\{fa-eye\}\}{\bf{decode}}(statusCode, 200, "Success", 400, "Not Found", 406, "Error", 404, "Error") as statusCodeDesc` \tn
% Row Count 45 (+ 18)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.52 cm} x{4.48 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Structure keywords (cont)}} \tn
% Row 7
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{nvl}} & {\bf{Null-Coalescing}} operator. Allow to set an alternate value when input value is null.\{\{nl\}\}
\{\{fa-check\}\}{\bf{nvl}}(column, \seqsplit{alternate\_value\_when\_null)`} \tn
% Row Count 7 (+ 7)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Aggregation functions and operators}} \tn
% Row 0
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{avg}} & Returns the {\bf{average}} of a range of values {[}{\bf{avg}}{]} or only over {\emph{not null}} values {[}{\bf{nnavg}}{]} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{avg}}(column); {\bf{nnavg}}(column) ` \tn
% Row Count 10 (+ 10)
% Row 1
\SetRowColor{white}
\{\{nobreak\}\}{\bf{count}} & Returns the {\bf{count}} of results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{count}}({[}column{]})\{\{nl\}\}
\{\{fa-eye\}\}With argument, include only not null entries in the count. ` \tn
% Row Count 19 (+ 9)
% Row 2
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{first / nnfirst}} & Returns the {\bf{first}} or the {\bf{not null first}} entry of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{first}}(column); {\bf{nnfirst}}(column) ` \tn
% Row Count 27 (+ 8)
% Row 3
\SetRowColor{white}
\{\{nobreak\}\}{\bf{last / nnlast}} & Returns the {\bf{last}} or the {\bf{not null last}} entry of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{last}}(column); {\bf{nnlast}}(column) ` \tn
% Row Count 35 (+ 8)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Aggregation functions and operators (cont)}} \tn
% Row 4
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{max / min}} & Returns the {\bf{maximum}} or the {\bf{minimum}} value for the columns provided, on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{max/min}}(col1, {[}col2{]}, {[}col3{]}…) ` \tn
% Row Count 8 (+ 8)
% Row 5
\SetRowColor{white}
\{\{nobreak\}\}{\bf{median}} & Returns the statistical {\bf{median}} for a column on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{median}}(column)\{\{nl\}\}
\{\{fa-eye\}\}Restricted to columns of integer type ` \tn
% Row Count 16 (+ 8)
% Row 6
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{sum}} & Returns the {\bf{sum}} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{sum}}(column) ` \tn
% Row Count 21 (+ 5)
% Row 7
\SetRowColor{white}
\{\{nobreak\}\}{\bf{sum2}} & Returns the {\bf{sum}} of the squares of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{sum2}}(column) ` \tn
% Row Count 27 (+ 6)
% Row 8
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{percentile5}}\{\{nl\}\}{\bf{percentile10}}\{\{nl\}\}{\bf{percentile25}}\{\{nl\}\}{\bf{percentile75}}\{\{nl\}\}{\bf{percentile90}}\{\{nl\}\}{\bf{percentile95}} & Returns the specific statistic {\bf{percentileN}}, using linear interpolation, of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{percentile{[}N{]}}}(column) ` \tn
% Row Count 35 (+ 8)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Aggregation functions and operators (cont)}} \tn
% Row 9
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{stddev / nnstddev}} & Returns the {\bf{biased standard deviation {[}stddev{]}}} of the values or not null values {\bf{{[}nnstddev{]}}} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{stddev/nnstddev}}(column)\{\{nl\}\}
\{\{fa-eye\}\}{\bf{Biased}} ` \tn
% Row Count 11 (+ 11)
% Row 10
\SetRowColor{white}
\{\{nobreak\}\}{\bf{ustddev / nnustddev}} & Returns the {\bf{unbiased standard deviation {[}ustddev{]}}} of the values or not null values {\bf{{[}unnstddev{]}}} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{ustddev/unnstddev}}(column) \{\{nl\}\}
\{\{fa-eye\}\}{\bf{Unbiased}} ` \tn
% Row Count 22 (+ 11)
% Row 11
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{var / nnvar}} & Returns the {\bf{biased variance {[}var{]}}} of the values or not null values {\bf{{[}nnvar{]}}} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{var/nnvar}}(column)\{\{nl\}\}
\{\{fa-eye\}\}{\bf{Biased}} ` \tn
% Row Count 32 (+ 10)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Aggregation functions and operators (cont)}} \tn
% Row 12
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{uvar / nnuvar}} & Returns the {\bf{unbiased variance {[}uvar{]}}} of the values or not null values {\bf{{[}unnvar{]}}} of the results on each group:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{uvar/unnvar}}(column)\{\{nl\}\}
\{\{fa-eye\}\}{\bf{Unbiased}} ` \tn
% Row Count 10 (+ 10)
% Row 13
\SetRowColor{white}
\{\{nobreak\}\}{\bf{hllpp}} & Returns the estimated count of distinct values of the results on each group using the {\bf{HyperLogLog++}} algorithm:\{\{nl\}\} `
\{\{fa-check\}\}{\bf{hllpp}}(column)\{\{nl\}\}
\{\{fa-eye\}\}Applies on {\bf{DC (distinct count)}} data types. ` \tn
% Row Count 22 (+ 12)
% Row 14
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{hllppcount}} & Returns the estimated count of distinct values of the results on each group using the {\bf{HyperLogLog++}} algorithm:\{\{nl\}\} `
\{\{fa-check\}\}{\bf{hllppcount}}(column)\{\{nl\}\}
\{\{fa-eye\}\}Applies on {\bf{float or integer}} data types. ` \tn
% Row Count 34 (+ 12)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{has, {[}-\textgreater{}{]}}} & Case sensitive {\bf{contains}} comparison. Using the operator {\bf{-\textgreater{}}} only allows check one value:\{\{nl\}\}`
\{\{fa-check\}\}{\bf{has}}(column, value1, {[}value2{]},…)\{\{nl\}\}
\{\{fa-check\}\}column -\textgreater{} value1 ` \tn
% Row Count 9 (+ 9)
% Row 1
\SetRowColor{white}
\{\{nobreak\}\}{\bf{weakhas}} & Case insensitive {\bf{contains}} comparison:\{\{nl\}\}`weakhas(column, value)` \tn
% Row Count 13 (+ 4)
% Row 2
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{in, {[}\textless{}-{]}}} & Case sensitive {\bf{is contained}} comparison. Using the operator {\bf{'\textless{}-'}} allows only one value:\{\{nl\}\}`\{\{fa-check-circle\}\} in(value1, {[}value2{]},{[}...{]}, column)\{\{nl\}\}\{\{fa-check-circle\}\} value1 \textless{}- column` \tn
% Row Count 22 (+ 9)
% Row 3
\SetRowColor{white}
\{\{nobreak\}\}{\bf{weakin}} & Case insensitive {\bf{is contained}} comparison:\{\{nl\}\}`weakin(value, column)` \tn
% Row Count 26 (+ 4)
% Row 4
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{startswith}} & Returns strings that start with specific value:\{\{nl\}\}`startswith(column, value)` \tn
% Row Count 30 (+ 4)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 5
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{endswith}} & Returns strings that end with a specific value:\{\{nl\}\}`endswith(column, value)` \tn
% Row Count 4 (+ 4)
% Row 6
\SetRowColor{white}
\{\{nobreak\}\}{\bf{toktains}} & Specialized {\bf{contains}} function for ASCII delimited tokens:\{\{nl\}\}`toktains(column, value, {[}bool\_left{]}, {[}bool\_right{]})` \tn
% Row Count 10 (+ 6)
% Row 7
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{length}} & Returns the length of a string value:\{\{nl\}\}`length(column)` \tn
% Row Count 13 (+ 3)
% Row 8
\SetRowColor{white}
\{\{nobreak\}\}{\bf{locate}} & Returns the position of a substring, {\bf{indexOf}} function:\{\{nl\}\}`locate(column, substring\_toLocate)` \tn
% Row Count 18 (+ 5)
% Row 9
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{lower}} & Returns the transformation to lower case:\{\{nl\}\}`lower(column)` \tn
% Row Count 21 (+ 3)
% Row 10
\SetRowColor{white}
\{\{nobreak\}\}{\bf{upper}} & Returns the transformation to upper case:\{\{nl\}\}`upper(column)` \tn
% Row Count 24 (+ 3)
% Row 11
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{replace}} & Replaces {\bf{only first occurrence}} of a string with a substitute string:\{\{nl\}\}`replace(column, stringToSearch, stringToReplace)` \tn
% Row Count 30 (+ 6)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 12
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{replaceall}} & Replaces {\bf{all occurrences}} of a search string with a substitute string:\{\{nl\}\}`replaceall(column, stringToSearch, stringToReplace)` \tn
% Row Count 6 (+ 6)
% Row 13
\SetRowColor{white}
\{\{nobreak\}\}{\bf{split}} & Returns a specific piece of splitting operation by a separator:\{\{nl\}\}`\{\{fa-eye\}\} pieceNumber begin at 0.\{\{nl\}\} split(column, separatorString, pieceNumber)` \tn
% Row Count 13 (+ 7)
% Row 14
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{splitre}} & Returns a specific piece of splitting operation by a regular expression:\{\{nl\}\}`\{\{fa-eye\}\} pieceNumber begin at 0.\{\{nl\}\} splitre(column, re(string) or regexp, pieceNumber)` \tn
% Row Count 21 (+ 8)
% Row 15
\SetRowColor{white}
\{\{nobreak\}\}{\bf{substring}} & Returns a substring beginning at specific index with the provided length:\{\{nl\}\}`substring(column, index, length)` \tn
% Row Count 26 (+ 5)
% Row 16
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{subs}} & Returns a string replacing {\bf{first substring occurrence}} based on a regular expression using a template string as substitution value:\{\{nl\}\}`\{\{fa-eye\}\} FailValue is returned when is provided and no occurrences found\{\{nl\}\}\{\{fa-check-circle\}\} subs(column, regexp, template, {[}failValue{]})\{\{nl\}\}\{\{fa-check-circle\}\} subs(column, re(string), template(string), {[}failValue{]})` \tn
% Row Count 42 (+ 16)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 17
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{subsall}} & Returns a string replacing {\bf{all substring occurrences}} based on a regular expression using a template string as substitution value:\{\{nl\}\}`\{\{fa-eye\}\} FailValue is returned when is provided and no occurrences found\{\{nl\}\}\{\{fa-check-circle\}\} subs(column, regexp, template, {[}failValue{]})\{\{nl\}\}\{\{fa-check-circle\}\} subs(column, re(string), template(string), {[}failValue{]})` \tn
% Row Count 16 (+ 16)
% Row 18
\SetRowColor{white}
\{\{nobreak\}\}{\bf{trim}} & Returns the result of trimming {\bf{both sides}}:\{\{nl\}\}`trim(column)` \tn
% Row Count 19 (+ 3)
% Row 19
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{ltrim}} & Returns the result of trimming {\bf{left side}}:\{\{nl\}\}`ltrim(column)` \tn
% Row Count 22 (+ 3)
% Row 20
\SetRowColor{white}
\{\{nobreak\}\}{\bf{rtrim}} & Returns the result of trimming {\bf{right side}}:\{\{nl\}\}`rtrim(column)` \tn
% Row Count 25 (+ 3)
% Row 21
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{matches, {[}\textasciitilde{}{]}}} & Matches function that finds occurrences in a column using a regular expression:\{\{nl\}\}`\{\{fa-check-circle\}\}matches(column, re(string) or regexp value)\{\{nl\}\}\{\{fa-check-circle\}\}column \textasciitilde{} re(string) or regexp value` \tn
% Row Count 35 (+ 10)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 22
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{peek}} & Returns the part of a string based on a regular expression, optionally indicating a specific part occurrence:\{\{nl\}\}`\{\{fa-eye\}\} If no partNumber is provided then returns first part occurrence.\{\{nl\}\}peek(column, re(string) or regexp, {[}partNumber{]})` \tn
% Row Count 11 (+ 11)
% Row 23
\SetRowColor{white}
\{\{nobreak\}\}{\bf{formatnumber}} & Format a number with a specific mask and locale:\{\{nl\}\}`formatnumber(numberColumn, mask, locale)\{\{nl\}\}\{\{fa-eye\}\}formatnumber(totalAmount, "\#\#\#.\#\#", "en-GB")` \tn
% Row Count 18 (+ 7)
% Row 24
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{damerau}} & Returns {\bf{Damerau}} distance:\{\{nl\}\}`damerau(column, value)` \tn
% Row Count 21 (+ 3)
% Row 25
\SetRowColor{white}
\{\{nobreak\}\}{\bf{hamming}} & Returns {\bf{Hamming}} distance:\{\{nl\}\}`hamming(column, value)` \tn
% Row Count 24 (+ 3)
% Row 26
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{levenshtein}} & Returns {\bf{Levenstein}} distance:\{\{nl\}\}`levenshtein(column, value)` \tn
% Row Count 27 (+ 3)
% Row 27
\SetRowColor{white}
\{\{nobreak\}\}{\bf{osa}} & Returns {\bf{osa}} distance:\{\{nl\}\}`osa(column, value)` \tn
% Row Count 30 (+ 3)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 28
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{publicsuffix}} & Returns the main public suffix of a hostname:\{\{nl\}\}`publicsuffix(hostnameColumn))\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.co.uk' = 'co.uk'` \tn
% Row Count 6 (+ 6)
% Row 29
\SetRowColor{white}
\{\{nobreak\}\}{\bf{rootdomain}} & Returns the root domain of a hostname part of an url:\{\{nl\}\}`rootdomain(hostnameUrlColumn)\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.com' = 'site'` \tn
% Row Count 12 (+ 6)
% Row 30
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{rootprefix}} & Returns the root prefix of a hostname part of an url:\{\{nl\}\}`rootpredix(hostnameUrlColumn))\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.com' = 'www.my.site'` \tn
% Row Count 19 (+ 7)
% Row 31
\SetRowColor{white}
\{\{nobreak\}\}{\bf{rootsuffix}} & Returns the root suffix of a hostname part of an url:\{\{nl\}\}`rootsuffix(hostnameUrlColumn))\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.com' = 'my.site.com'` \tn
% Row Count 26 (+ 7)
% Row 32
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{subdomain}} & Returns the subdomain of a hostname part of an url:\{\{nl\}\}`subdomain(hostnameUrlColumn)\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.com' = 'www'` \tn
% Row Count 32 (+ 6)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.36 cm} x{4.64 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{String operators and functions (cont)}} \tn
% Row 33
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{topleveldomain}} & Returns the top level domain of a hostname part of an url::\{\{nl\}\}`topleveldomain(hostnameUrlColumn)\{\{nl\}\} \{\{fa-eye\}\} 'www.my.site.co.uk' = 'uk'` \tn
% Row Count 7 (+ 7)
% Row 34
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{shannonentropy}}} \tn
% Row Count 8 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Cryptographic functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{md5}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{sha1}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{sha256}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{sha512}}} \tn
% Row Count 4 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{3.12 cm} x{4.88 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Web functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{urischeme}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{urihost}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uriport}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uripath}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{urifragment}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uriquery}}} \tn
% Row Count 6 (+ 1)
% Row 6
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uriuser}}} \tn
% Row Count 7 (+ 1)
% Row 7
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{urissp}}} \tn
% Row Count 8 (+ 1)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uriauthority}}} \tn
% Row Count 9 (+ 1)
% Row 9
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{absoluteuri}}} \tn
% Row Count 10 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{opaqueuri}}} \tn
% Row Count 11 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{urldecode}}} \tn
% Row Count 12 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaurl}}} \tn
% Row Count 13 (+ 1)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaname}}} \tn
% Row Count 14 (+ 1)
% Row 14
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uatype}}} \tn
% Row Count 15 (+ 1)
% Row 15
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaversion}}} \tn
% Row Count 16 (+ 1)
% Row 16
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaicon}}} \tn
% Row Count 17 (+ 1)
% Row 17
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uarobot}}} \tn
% Row Count 18 (+ 1)
% Row 18
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uainfourl}}} \tn
% Row Count 19 (+ 1)
% Row 19
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uafamily}}} \tn
% Row Count 20 (+ 1)
% Row 20
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uacompany}}} \tn
% Row Count 21 (+ 1)
% Row 21
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uacompanyurl}}} \tn
% Row Count 22 (+ 1)
% Row 22
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uadeviceicon}}} \tn
% Row Count 23 (+ 1)
% Row 23
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uadeviceinfourl}}} \tn
% Row Count 24 (+ 1)
% Row 24
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uadevicetype}}} \tn
% Row Count 25 (+ 1)
% Row 25
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaosurl}}} \tn
% Row Count 26 (+ 1)
% Row 26
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaosname}}} \tn
% Row Count 27 (+ 1)
% Row 27
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaosicon}}} \tn
% Row Count 28 (+ 1)
% Row 28
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaosfamily}}} \tn
% Row Count 29 (+ 1)
% Row 29
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaoscompany}}} \tn
% Row Count 30 (+ 1)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.12 cm} x{4.88 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Web functions (cont)}} \tn
% Row 30
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{uaoscompanyurl}}} \tn
% Row Count 1 (+ 1)
% Row 31
\SetRowColor{white}
\{\{nobreak\}\}{\bf{uaosversion}} & Possible {\bf{missing}} function to filter by OS version. \tn
% Row Count 4 (+ 3)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Meta functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{pragmavalue}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{tablename}}} \tn
% Row Count 2 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Data Types}} \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{str}}\{\{noshy\}\}~~~~~~~~~~~~~~~~~ & String \tn
% Row Count 6 (+ 6)
% Row 1
\SetRowColor{white}
{\bf{int}} & Integer number: `1,58,12598` \tn
% Row Count 8 (+ 2)
% Row 2
\SetRowColor{LightBackground}
{\bf{float}} & Floating point number:`24.256` \tn
% Row Count 10 (+ 2)
% Row 3
\SetRowColor{white}
{\bf{boolean}} & Boolean: `true, false` \tn
% Row Count 12 (+ 2)
% Row 4
\SetRowColor{LightBackground}
{\bf{timestamp}} & Timestamp date in format: `yyyy-MM-dd HH:mm:ss.SSS` \tn
% Row Count 15 (+ 3)
% Row 5
\SetRowColor{white}
{\bf{boxar(int)}} & Byte array in hexadecimal string format \tn
% Row Count 17 (+ 2)
% Row 6
\SetRowColor{LightBackground}
{\bf{duration}} & Amount of time: an integer following by a letter\{\{nl\}\} ` {[}d{]}ays, {[}h{]}ours, {[}m{]}inutes, {[}s{]}econds, {[}No suffix{]}:milliseconds` \tn
% Row Count 24 (+ 7)
% Row 7
\SetRowColor{white}
{\bf{geocord}} & Geographic coordinates set:\{\{nl\}\} `\{\{fa-check-circle\}\} Latitude/longitude sexagesimal values: 40º24'N 3º41'W\{\{nl\}\} \{\{fa-check-circle\}\} Hash representation of coordinates (geohash)` \tn
% Row Count 34 (+ 10)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Data Types (cont)}} \tn
% Row 8
\SetRowColor{LightBackground}
{\bf{ip}} & IPv4 address format: `\{\{fa-eye\}\} 192.168.5.56` \tn
% Row Count 3 (+ 3)
% Row 9
\SetRowColor{white}
{\bf{ip6}} & IPv6 address format: `\{\{fa-eye\}\} \seqsplit{2001:0db8:85a3:0000:0000:8a2e:0370:7334`} \tn
% Row Count 7 (+ 4)
% Row 10
\SetRowColor{LightBackground}
{\bf{net4}} & IPv4 address in format: `\{x.x.x.x/0` \tn
% Row Count 9 (+ 2)
% Row 11
\SetRowColor{white}
{\bf{net6}} & IPv6 address in format: ` x.x.x.x.x.x/s` \tn
% Row Count 11 (+ 2)
% Row 12
\SetRowColor{LightBackground}
{\bf{regexp}} & Regular expression: `\{\{fa-eye\}\} {[}\textasciicircum{}\textbackslash{}w{]}` \tn
% Row Count 13 (+ 2)
% Row 13
\SetRowColor{white}
{\bf{template}} & Represents a substitution string mask. \tn
% Row Count 15 (+ 2)
% Row 14
\SetRowColor{LightBackground}
{\bf{dc}} & Represents a estimated count of distinct elements in a data stream. \tn
% Row Count 19 (+ 4)
% Row 15
\SetRowColor{white}
{\bf{image}} & Image as Base64 encoding image. \tn
% Row Count 21 (+ 2)
% Row 16
\SetRowColor{LightBackground}
{\bf{mac}} & MAC address in format: `\{\{fa-eye\}\} 00:0a:95:9d:68:16` \tn
% Row Count 24 (+ 3)
% Row 17
\SetRowColor{white}
{\bf{namepattern}} & Represents a part of a table name: `\{\{fa-eye\}\} my.app, demo, ...` \tn
% Row Count 28 (+ 4)
% Row 18
\SetRowColor{LightBackground}
{\bf{set(name)}} & Represents a set of table names: `\{\{fa-eye\}\} \{my.app.test, my.app.test2\}` \tn
% Row Count 32 (+ 4)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{4 cm} x{4 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Data Types (cont)}} \tn
% Row 19
\SetRowColor{LightBackground}
{\bf{json}} & String in json format: `\{\{fa-eye\}\} \{"id":345, "name":"John"\}` \tn
% Row Count 4 (+ 4)
% Row 20
\SetRowColor{white}
{\bf{jq}} & Represents a {\bf{jq}} filter, {\bf{jq}} is a command line json processor.\{\{nl\}\}`\{\{fa-eye\}\} .email` \tn
% Row Count 9 (+ 5)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{3.04 cm} x{4.96 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Common comparison functions and operators}} \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{eq, {[}={]}}} & {\bf{Equals to}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} eq(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column1 = value or column` \tn
% Row Count 6 (+ 6)
% Row 1
\SetRowColor{white}
{\bf{eqic}} & Case insensitive {\bf{Equals to}} function:\{\{nl\}\}`eqic(column, value or column)` \tn
% Row Count 10 (+ 4)
% Row 2
\SetRowColor{LightBackground}
\{\{nobreak\}\}{\bf{ge, {[}\textgreater{}={]}}} & {\bf{Greater or equal}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} ge(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column \textgreater{}= value or column` \tn
% Row Count 17 (+ 7)
% Row 3
\SetRowColor{white}
{\bf{gt, {[}\textgreater{}{]}}} & {\bf{Greater than}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} gt(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column \textgreater{} value or column` \tn
% Row Count 23 (+ 6)
% Row 4
\SetRowColor{LightBackground}
{\bf{le, {[}\textless{}={]}}} & {\bf{Less or equal}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} le(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column \textless{}= value or column` \tn
% Row Count 30 (+ 7)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{x{3.04 cm} x{4.96 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Common comparison functions and operators (cont)}} \tn
% Row 5
\SetRowColor{LightBackground}
{\bf{lt, {[}\textless{}{]}}} & {\bf{Less than}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} lt(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column \textless{} value or column` \tn
% Row Count 6 (+ 6)
% Row 6
\SetRowColor{white}
{\bf{ne, {[}/={]}}} & {\bf{Not equal}} function and operator:\{\{nl\}\}`\{\{fa-check-circle\}\} ne(column, value or column)\{\{nl\}\}\{\{fa-check-circle\}\} column /= value or column` \tn
% Row Count 12 (+ 6)
% Row 7
\SetRowColor{LightBackground}
{\bf{isnull}} & Check if {\bf{is null}} function:\{\{nl\}\}`isnull(column)` \tn
% Row Count 15 (+ 3)
% Row 8
\SetRowColor{white}
\{\{nobreak\}\}{\bf{isnotnull}} & Check if {\bf{is not null}} function:\{\{nl\}\}`isnotnull(column)` \tn
% Row Count 18 (+ 3)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Logig Functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{and}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{or}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{not}}} \tn
% Row Count 3 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{JSON related functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{jqeval}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{label}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{jsonparse}}} \tn
% Row Count 3 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{2.08 cm} x{5.92 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Math functions and operators}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{abs}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{add / {[}+{]}}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{sub / {[}-{]}}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{mul / {[}*{]}}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{div / {[}\textbackslash{}{]}}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
{\bf{rdiv / {[}/{]}}} & Real division function and operator: \tn
% Row Count 7 (+ 2)
% Row 6
\SetRowColor{LightBackground}
{\bf{mod / {[}\%\%{]}}} & Module function: \tn
% Row Count 9 (+ 2)
% Row 7
\SetRowColor{white}
{\bf{rem / {[}\%{]}}} & Return the remain of a division operation: \tn
% Row Count 11 (+ 2)
% Row 8
\SetRowColor{LightBackground}
{\bf{pow}} & Power function: \tn
% Row Count 12 (+ 1)
% Row 9
\SetRowColor{white}
{\bf{cbrt}} & Cube root function: \tn
% Row Count 13 (+ 1)
% Row 10
\SetRowColor{LightBackground}
{\bf{sqrt}} & Square root function: \tn
% Row Count 14 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ceil}}} \tn
% Row Count 15 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{floor}}} \tn
% Row Count 16 (+ 1)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{round}}} \tn
% Row Count 17 (+ 1)
% Row 14
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{signum}}} \tn
% Row Count 18 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Statistical and specialised statistical functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{estimation}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{pack}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{unpackhllpp}}} \tn
% Row Count 3 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Network functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ispublic}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{isprivate}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ipip4}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ipprotocol}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{purpose}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{host}}} \tn
% Row Count 6 (+ 1)
% Row 6
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{routing}}} \tn
% Row Count 7 (+ 1)
% Row 7
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{httpstatusdescription}}} \tn
% Row Count 8 (+ 1)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{httpstatustype}}} \tn
% Row Count 9 (+ 1)
% Row 9
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{reputation}}} \tn
% Row Count 10 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{score}}} \tn
% Row Count 11 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{sbl}}} \tn
% Row Count 12 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Conversion functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{int}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{str}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{bool}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{float}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{image}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ip4}}} \tn
% Row Count 6 (+ 1)
% Row 6
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{net4}}} \tn
% Row Count 7 (+ 1)
% Row 7
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{ip6}}} \tn
% Row Count 8 (+ 1)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{net6}}} \tn
% Row Count 9 (+ 1)
% Row 9
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{mac}}} \tn
% Row Count 10 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{to16}}} \tn
% Row Count 11 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{from16}}} \tn
% Row Count 12 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{to64}}} \tn
% Row Count 13 (+ 1)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{from64}}} \tn
% Row Count 14 (+ 1)
% Row 14
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{toutf8}}} \tn
% Row Count 15 (+ 1)
% Row 15
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{fromutf8}}} \tn
% Row Count 16 (+ 1)
% Row 16
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{toz85}}} \tn
% Row Count 17 (+ 1)
% Row 17
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{fromz85}}} \tn
% Row Count 18 (+ 1)
% Row 18
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{compatible}}} \tn
% Row Count 19 (+ 1)
% Row 19
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{mapped}}} \tn
% Row Count 20 (+ 1)
% Row 20
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{translated}}} \tn
% Row Count 21 (+ 1)
% Row 21
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{template}}} \tn
% Row Count 22 (+ 1)
% Row 22
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{timestamp}}} \tn
% Row Count 23 (+ 1)
% Row 23
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{duration}}} \tn
% Row Count 24 (+ 1)
% Row 24
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{re}}} \tn
% Row Count 25 (+ 1)
% Row 25
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{parsedate}}} \tn
% Row Count 26 (+ 1)
% Row 26
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{formatdate}}} \tn
% Row Count 27 (+ 1)
% Row 27
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{humansize}}} \tn
% Row Count 28 (+ 1)
% Row 28
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{mkboxar}}} \tn
% Row Count 29 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{x{3.04 cm} x{4.96 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Special comparison functions}} \tn
% Row 0
\SetRowColor{LightBackground}
{\bf{matches}} & Matches function finds occurrences in a column using a regular expression:\{\{nl\}\}`\{\{fa-check-circle\}\}matches(column, re(string) or regexp value)\{\{nl\}\}\{\{fa-check-circle\}\}column \textasciitilde{} re(string) or regexp value` \tn
% Row Count 9 (+ 9)
% Row 1
\SetRowColor{white}
\{\{nobreak\}\}{\bf{anymatches}} & Find occurrences in a {\bf{set of names}} type column against a namepattern:\{\{nl\}\}`anymatches(setOfNames, nameglob(string) or namepattern)\{\{nl\}\}\{\{fa-eye\}\} anymatches(tables, \seqsplit{nameglob("my.app.*.*"))`} \tn
% Row Count 18 (+ 9)
% Row 2
\SetRowColor{LightBackground}
{\bf{nameglob}} & Return a formmated string as a {\bf{namepattern}} to use with {\bf{anymatches}}:\{\{nl\}\}`nameglob(string)` \tn
% Row Count 23 (+ 5)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Date and time functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{day}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{dayofweek}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{dayofyear}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{month}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{year}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{epoch}}} \tn
% Row Count 6 (+ 1)
% Row 6
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{hour}}} \tn
% Row Count 7 (+ 1)
% Row 7
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{minute}}} \tn
% Row Count 8 (+ 1)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{second}}} \tn
% Row Count 9 (+ 1)
% Row 9
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{millisecond}}} \tn
% Row Count 10 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{today}}} \tn
% Row Count 11 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{tomorrow}}} \tn
% Row Count 12 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{{\bf{yesterday}}} \tn
% Row Count 13 (+ 1)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{{\bf{period}}} \tn
% Row Count 14 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Packet functions}} \tn
% Row 0
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{hasio4}}} \tn
% Row Count 1 (+ 1)
% Row 1
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{hastcp}}} \tn
% Row Count 2 (+ 1)
% Row 2
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{hasudp}}} \tn
% Row Count 3 (+ 1)
% Row 3
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{hasether}}} \tn
% Row Count 4 (+ 1)
% Row 4
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4proto}}} \tn
% Row Count 5 (+ 1)
% Row 5
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4src}}} \tn
% Row Count 6 (+ 1)
% Row 6
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4dst}}} \tn
% Row Count 7 (+ 1)
% Row 7
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4status}}} \tn
% Row Count 8 (+ 1)
% Row 8
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4ttl}}} \tn
% Row Count 9 (+ 1)
% Row 9
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4len}}} \tn
% Row Count 10 (+ 1)
% Row 10
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4payload}}} \tn
% Row Count 11 (+ 1)
% Row 11
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4flags}}} \tn
% Row Count 12 (+ 1)
% Row 12
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4fragment}}} \tn
% Row Count 13 (+ 1)
% Row 13
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4cs}}} \tn
% Row Count 14 (+ 1)
% Row 14
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4hl}}} \tn
% Row Count 15 (+ 1)
% Row 15
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4ds}}} \tn
% Row Count 16 (+ 1)
% Row 16
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4ecn}}} \tn
% Row Count 17 (+ 1)
% Row 17
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ip4tos}}} \tn
% Row Count 18 (+ 1)
% Row 18
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{etherdst}}} \tn
% Row Count 19 (+ 1)
% Row 19
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ethersrc}}} \tn
% Row Count 20 (+ 1)
% Row 20
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{etherpayload}}} \tn
% Row Count 21 (+ 1)
% Row 21
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{etherstatus}}} \tn
% Row Count 22 (+ 1)
% Row 22
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ethertag}}} \tn
% Row Count 23 (+ 1)
% Row 23
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{ethertype}}} \tn
% Row Count 24 (+ 1)
% Row 24
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpdst}}} \tn
% Row Count 25 (+ 1)
% Row 25
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpsrc}}} \tn
% Row Count 26 (+ 1)
% Row 26
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpstatus}}} \tn
% Row Count 27 (+ 1)
% Row 27
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpflags}}} \tn
% Row Count 28 (+ 1)
% Row 28
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcppack}}} \tn
% Row Count 29 (+ 1)
% Row 29
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpcs}}} \tn
% Row Count 30 (+ 1)
\end{tabularx}
\par\addvspace{1.3em}
\vfill
\columnbreak
\begin{tabularx}{8.4cm}{p{0.8 cm} p{0.8 cm} }
\SetRowColor{DarkBackground}
\mymulticolumn{2}{x{8.4cm}}{\bf\textcolor{white}{Packet functions (cont)}} \tn
% Row 30
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpseq}}} \tn
% Row Count 1 (+ 1)
% Row 31
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcphl}}} \tn
% Row Count 2 (+ 1)
% Row 32
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcppayload}}} \tn
% Row Count 3 (+ 1)
% Row 33
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpurg}}} \tn
% Row Count 4 (+ 1)
% Row 34
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{tcpwin}}} \tn
% Row Count 5 (+ 1)
% Row 35
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udpsrc}}} \tn
% Row Count 6 (+ 1)
% Row 36
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udpport}}} \tn
% Row Count 7 (+ 1)
% Row 37
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udpstatus}}} \tn
% Row Count 8 (+ 1)
% Row 38
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udpcs}}} \tn
% Row Count 9 (+ 1)
% Row 39
\SetRowColor{white}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udplen}}} \tn
% Row Count 10 (+ 1)
% Row 40
\SetRowColor{LightBackground}
\mymulticolumn{2}{x{8.4cm}}{\{\{nobreak\}\}{\bf{udppayload}}} \tn
% Row Count 11 (+ 1)
\hhline{>{\arrayrulecolor{DarkBackground}}--}
\end{tabularx}
\par\addvspace{1.3em}
% That's all folks
\end{multicols*}
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=122306&type=tex | zentralblatt-math.org | CC-MAIN-2019-35 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-35/segments/1566027317130.77/warc/CC-MAIN-20190822130553-20190822152553-00253.warc.gz | 1,045,630,235 | 1,147 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 1990k.00528}
\itemau{Kay, J.; Lublin, J.; Poiner, G.; Prosser, M. (Sydney Univ. (Australia).Basser Dept.of Computer Science)}
\itemti{Not even well begun: Women in computing courses. Frauen in Computerkursen.}
\itemso{High. Educ. (1988) v. 18(5) p. 511-527. CODEN: HREDAN [ISSN 0018-1560]}
\itemab
\itemrv{~}
\itemcc{Q45}
\itemut{Women and Computers; Australia; Tertiary Education; Empirical Investigations; Sex Differences; Mathematics and Informatics; ; Frau und Informatik; Australien; Tertiaerbereich; Empirische Untersuchung; Geschlechtsunterschied; Mathematik und Informatik}
\itemli{doi:10.1007/BF00138745}
\end |
https://www.authorea.com/users/355670/articles/478819/download_latex | authorea.com | CC-MAIN-2021-39 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-39/segments/1631780057225.57/warc/CC-MAIN-20210921161350-20210921191350-00283.warc.gz | 697,524,381 | 2,558 | \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{Dynamical model of neuronal activity and ion channel dynamics over the
aortic wall}
\author[1]{Erhui Wang}%
\author[1]{Liancun Zheng}%
\author[1]{Xuelan Zhang}%
\author[1]{Kheder Suleiman}%
\author[2]{Chang Shu}%
\affil[1]{University of Science and Technology Beijing}%
\affil[2]{Chinese Academy of Medical Sciences and Peking Union Medical College}%
\vspace{-1em}
\date{\today}
\begingroup
\let\center\flushleft
\let\endcenter\endflushleft
\maketitle
\endgroup
\selectlanguage{english}
\begin{abstract}
The transmission of nerve signals is closely related to the incidence of
aortic dis- eases. However, due to the multilayer and complex structure
of the vascular wall, the mechanism of ion channel dynamics of aortic
diseases has not been under- standing well. Here, we demonstrate that
the ion channel dynamic behavior on neural information can be simulated
by a stochastic differential equation (SDEs) based on discrete Markov
chains. The continuous approximation model is formu- lated and solved
numerically. It can analyze the variation of voltage with time, and the
value of voltage is related to the trajectory of past voltage. By chang-
ing ion channel dynamics, our model can replicate in vitro and downward
spike adaptations in neocortical pyramidal cells and cap neurons.
Moreover, it also produces an inter-peak power-law distribution with a
longer first peak latency and higher peak-to-peak variability. The
results obtained in close agreement with the statistical data on ion
channels and potential actions. Our research extends the knowledge into
the biological mechanisms induced by ion channels and neural information
networks.%
\end{abstract}%
\sloppy
\textbf{Hosted file}
\verb`Neuronal20200902.pdf` available at \url{https://authorea.com/users/355670/articles/478819-dynamical-model-of-neuronal-activity-and-ion-channel-dynamics-over-the-aortic-wall}
\selectlanguage{english}
\FloatBarrier
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=29861&type=tex | zentralblatt-math.org | CC-MAIN-2019-47 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-47/segments/1573496668004.65/warc/CC-MAIN-20191114053752-20191114081752-00035.warc.gz | 1,052,259,254 | 1,514 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2013b.00337}
\itemau{Lock, Corey; Pugalee, David}
\itemti{Changes in the North Carolina mathematics curriculum: a comparative study, 1920s, 1930's with 2003.}
\itemso{Paditz, Ludwig (ed.) et al., Proceedings of the 10th international conference ``Models in Developing Mathematics Education'', Dresden, Saxony, Germany, September 11--17, 2009. Dresden: Hochschule f\"ur Technik und Wirtschaft (ISBN 83-919465-9-2). 376-377 (2009).}
\itemab
Summary: The purpose of this paper is to compare curriculum documents for K-12 education from the state of North Carolina from two time periods, 1920s and 2003. The historical development of the mathematics curriculum in North Carolina provides a snapshot of the shifts in mathematics teaching and learning. North Carolina, a state in the southeast of the United States, has had a statewide standard course over a period spanning more than eighty years. A document analysis of printed curriculum standards from allows a description of the mathematics concepts and tasks that were expected of students in those years. The analysis revealed stark contrasts in the focus of mathematics from a very computational emphasis to one of problem solving. The analysis also highlighted the understanding of algebraic concepts and ideas as an essential outcome of current mathematics programs.
\itemrv{~}
\itemcc{D30 A30}
\itemut{curriculum development; history of mathematics education; United States}
\itemli{}
\end |
http://kleine.mat.uniroma3.it/mp_arc/e/08-106.latex.mime | uniroma3.it | CC-MAIN-2019-26 | application/x-latex | message/rfc822 | crawl-data/CC-MAIN-2019-26/segments/1560627998513.14/warc/CC-MAIN-20190617163111-20190617185111-00240.warc.gz | 96,791,087 | 21,305 | Content-Type: multipart/mixed; boundary="-------------0806060316735"
This is a multi-part message in MIME format.
---------------0806060316735
Content-Type: text/plain; name="08-106.comments"
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="08-106.comments"
23 pages; AMS-Code: 35B65; 35J10; 35B45; 81Q05; 35J15; 81V55
---------------0806060316735
Content-Type: text/plain; name="08-106.keywords"
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="08-106.keywords"
Elliptic PDE, Schrodinger Operators, Regularity of Solutions,
Kustaanheimo-Stiefel transform, analytic hypoellipticity.
---------------0806060316735
Content-Type: application/x-tex; name="KS-arXiv.tex"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline; filename="KS-arXiv.tex"
\documentclass[reqno,12pt,draft]{amsart}
\NeedsTeXFormat{LaTeX2e}[1994/12/01]
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{enumerate}
\usepackage{fancybox}
\newcommand{\bx}{\mathbf{x}}
\newcommand{\by}{\mathbf{y}}
\newcommand{\bz}{\mathbf{z}}
\newcommand{\bp}{\mathbf{p}}
\newcommand{\p}{\partial}
\theoremstyle{plain}
\newtheorem{thm}{Theorem}[section]{\bf}{\it}
\newtheorem{prop}[thm]{Proposition}{\bf}{\it}
\newtheorem{lemma}[thm]{Lemma}{\bf}{\it}
\newtheorem{lem}[thm]{Lemma}{\bf}{\it}
\newtheorem{cor}[thm]{Corollary}{\bf}{\it}
\theoremstyle{definition}
\newtheorem*{acknowledgement}{Acknowledgement}
\newtheorem{remark}[thm]{Remark}{\it}{\rm}
\newtheorem{defn}[thm]{Definition}{\bf}{\rm}
\newtheorem{rem}[thm]{Remark}{\rm}{\rm}
\newtheorem{example}[thm]{Example}
\newtheorem{disc}[thm]{Preliminary discussion}{\bf}{\rm}
\newcommand{\supp}{{\operatorname{supp}}}
\newcommand{\Span}{{\operatorname{span}}}
\newcommand{\Vol}{{\operatorname{Vol}}}
\newenvironment{pf}{\par\medskip\noindent\textit{Proof}:\,}{\hspace*{\fill}\qed\medskip\par\noindent}
\newenvironment{pf*}[1]{\par\medskip\noindent\textit{#1}\,:}{\hspace*{\fill}\qed\medskip\par\noindent}
\numberwithin{equation}{section}
%\numberwithin{theorem}{section}
\newcommand{\R}{{\mathbb R}}
\newcommand{\N}{{\mathbb N}}
\newcommand{\C}{{\mathbb C}}
\title[Analytic structure of Coulombic wave functions]{Analytic
structure of many-body Coulombic wave functions}
\thanks{\copyright\ 2008 by the
authors. This article may be reproduced in its entirety for
non-commercial purposes.}
\author[S. Fournais, M. and T. Hoffmann-Ostenhof, and T. \O. S\o rensen]
{S. Fournais \and M. Hoffmann-Ostenhof \and T. Hoffmann-Ostenhof \and
T. \O stergaard S\o rensen}
\address[S. Fournais]{Department of Mathematical Sciences, University
of Aarhus, Ny Munkegade, Building
1530, DK-8000 \AA rhus C, Denmark.}
\email{[email protected]}
\address[S. Fournais on leave from]{CNRS and Laboratoire de
Math\'{e}matiques d'Orsay,
Univ Paris-Sud, Orsay CEDEX, F-91405, France.}
\address[M. Hoffmann-Ostenhof]
{Fakult\"at f\"ur Mathematik,
Universit\"at Wien,
Nordbergstra\ss e 15,
A-1090 Vienna,
Austria.}
\email{[email protected]}
\address[T. Hoffmann-Ostenhof]{Institut f\"ur Theoretische
Chemie, W\"ahringer\-strasse 17,
Universit\"at Wien,
A-1090 Vienna,
Austria.}
\address[T. Hoffmann-Ostenhof, 2nd address]{
The Erwin Schr\"{o}dinger International Institute for
Mathematical Physics,
Boltzmanngasse 9,
A-1090 Vienna, Austria.}
\email{[email protected]}
\address[T. \O stergaard S\o rensen]
{Department of Mathematical Sciences,
Aalborg University,
Fredrik Bajers Vej 7G,
DK-9220 Aalborg East, Denmark.}
\email{[email protected]}
\date{\today}
\begin{document}
\thispagestyle{empty}
\begin{abstract}
We investigate the analytic structure of solutions of non-relativistic
Schr\"odinger equations describing Coulombic many-par\-ticle
systems. We prove the following: Let $\psi({\bf x})$ with ${\bf
x}=(x_1,\dots, x_N)\in
\mathbb R^{3N}$ denote an $N$-electron wavefunction of such a system
with one nucleus fixed at the origin. Then in a neighbourhood of a
coalescence point, for which $x_1=0$ and the other electron
coordinates do not coincide, and differ from 0, $\psi$ can be
represented locally as $\psi({\bf x})=\psi^{(1)}({\bf x})+|x_1|\psi^{(2)}({\bf
x})$ with
$\psi^{(1)},\psi^{(2)}$ real analytic. A similar representation holds
near
two-electron coalescence points.
The Kustaanheimo-Stiefel transform and analytic hypoellipticity
play an essential role in the
proof.
\end{abstract}
\maketitle
\section{Introduction and results}
\subsection{Introduction}
In quantum chemistry and atomic and molecular physics, the regularity
properties of the Coulombic wavefunctions \(\psi\), and of their
corresponding one-electron densities \(\rho\), are of great
importance. These regularity properties determine the convergence
properties of various (numerical) approximation schemes (see
\cite{BrisLions, Flad1, Flad2, y1,y2,y3} for some recent works).
They are also of intrinsic mathematical interest.
The pioneering work is due to Kato \cite{kato57}, who proved that
$\psi$ is Lipschitz continuous, i.e., $\psi\in C^{0,1}$, near
two-particle coalescence points.
In a series of recent papers the present authors have studied these
properties in detail. In \cite{CMP2} we deduced an optimal
representation of $\psi$ of the form $\psi=\mathcal F\Phi$ with an
explicit $\mathcal F\in C^{0,1}$, such that $\Phi\in C^{1,1}$,
characterizing the singularities of $\psi$ up to second derivatives;
see \cite[Theorem 1.1]{CMP2} for a precise statement. In particular,
$\mathcal F$ contains logarithmic terms which stem from the
singularities of the potential at three-particle coalescence
points. This characterization has been applied in \cite{AHP2} and
\cite{3der} in the study of the electron density $\rho$ and (in the
atomic case) its spherical average $\widetilde\rho$ close to the
nuclei. Real analyticity of $\rho$ away from the nuclei was proved in
\cite{Ark}; see also \cite{CMP1}, \cite{Taxco}.
In this paper we derive a different representation of \(\psi\) which
completely settles its analytic structure in the neighbourhood of
two-par\-ticle coalescence points.
%
The Kustaanheimo-Stiefel transform (KS-transform for short) and
analytic hypoanalyticity of a certain degenerate elliptic operator are
crucial for the proof.
We start with the one-particle case.
\begin{thm}\label{Hill}
Let $\Omega\subset \mathbb R^3$ be a neighbourhood of the origin and
assume that $W^{(1)},\:W^{(2)},\: F^{(1)}$, and $F^{(2)}$ are real
analytic functions in $\Omega$. Let
\begin{equation}\label{Hone}
H=-\Delta+\frac{W^{(1)}}{|x|}+W^{(2)}\,,
\end{equation}
and assume that \(\varphi\in W^{1,2}(\Omega)\) satisfies
\begin{equation}\label{Hpsi}
H\varphi=\frac{F^{(1)}}{|x|}+F^{(2)}
\end{equation}
in $\Omega$ in the distributional sense.
Then there exists a neighbourhood \(\widetilde\Omega\subset\Omega\) of
the origin, and real analytic functions $\varphi^{(1)},
\varphi^{(2)}:\widetilde\Omega\to\C\) such that
\begin{equation}\label{psian}
\varphi(x)=\varphi^{(1)}(x)+|x|\varphi^{(2)}(x)\,, \ x\in\widetilde\Omega\,.
\end{equation}
\end{thm}
% \begin{remark}\label{remark0}
% Most relevant from a physical point of view is of course when
% $W^{(1)},\:W^{(2)},\: F^{(1)}$, and $F^{(2)}$ are real-valued.
% \end{remark}
\begin{remark}\label{remark1}
Theorem \ref{Hill} is a generalization of an almost 25 years old
result by Hill \cite{Hill}. The present investigations were partly
motivated by this work. Hill considered solutions to
\begin{equation}\label{Hill1}
\big(-\Delta-\frac{Z}{|x|}+V^{(1)}(x)+|x|V^{(2)}(x)\big)\varphi=0\,,
\end{equation}
with $V^{(1)}$ and $V^{(2)}$ real analytic near the origin, and proved
that $\varphi$ satisfies \eqref{psian}. The statement \eqref{psian} can
easily be seen to hold for Hydrogenic eigenfunctions. These have the
form $e^{-\beta |x|}P(x)$ for some $\beta>0$, where $P(x)$ can be
written as linear combinations of polynomials in $|x|$ times
homogeneous harmonic polynomials. In particular, Hill's result implies
that $\varphi$ satisfies \eqref{psian} near the origin for a one-electron
molecule with fixed nuclei, one of them at the origin.
\end{remark}
\begin{remark}\label{remark2}
Hill's proof is rather involved. Our proof is quite different, also
not easy, but has the advantage that it can be generalized to treat
the Coulombic many-particle case; see Theorem \ref{thm:main} and its
proof below,
and also Remark~\ref{rem:1}.
The proof of Theorem~\ref{Hill} uses the KS-transform (see
Section~\ref{sec:Hill} for the definition). This transform was
introduced in the 1960's \cite{KS} to regularize the Kepler problem in
classical mechanics (see also \cite{Kustaanheimo,stiefel, Knauf}) and
has found applications in problems related to the Coulomb potential in
classical mechanics and quantum mechanics, see
\cite{JeckoKnauf,GerardKnauf, HelfferEtAl, HelfferSiedentop1,
HelfferSiedentop2, Jost}. The KS-transform is a homogeneous
extension of the Hopf map (also called the Hopf fibration), the first
example of a map from $\mathbb S^3$ to $\mathbb S^2$ which is not
null-homotopic, discovered in the 1930's \cite{Hopf}. For more on the
literature on the KS-transform, see \cite{Knauf, HelfferSiedentop1}.
\end{remark}
We move to the \(N\)-particle problem. For the sake of simplicity we
consider the atomic case and mention extensions in the remarks.
Let $H$ be the non-relativistic Schr\"odinger operator of an
$N$-electron atom with nuclear charge $Z>0$ in the fixed nucleus
approximation,
\begin{equation}\label{H}
H=\sum_{j=1}^N\Big(-\Delta_j-\frac{Z}{|x_j|}\Big)
+\sum_{1\le i<j\le N}\frac{1}{|x_i-x_j|}\,=:-\Delta + V\,.
\end{equation}
Here the $x_j=(x_{j,1},x_{j,2},x_{j,3})\in \mathbb R^3$, $j=1,\dots,
N$, denote the positions of the electrons, and the $\Delta_j$ are the
associated Laplacians so that $\Delta=\sum_{j=1}^N\Delta_j$ is the
$3N$-dimensional Laplacian. Let ${\bf x}=(x_1,x_2,\dots, x_N)\in
\mathbb R^{3N}$ and let $\nabla=(\nabla_1,\dots, \nabla_N)$
denote the $3N$-dimensional gradient operator.
The operator $H$ is bounded from \(W^{2,2}(\R^{3N})\) to
\(L^2(\R^{3N})\), and defines a bounded quadratic form on
\(W^{1,2}(\R^{3N})\) \cite{katobook}.
%
%selfadjoint with operator domain $\mathcal
%D(H)=W^{2,2}(\mathbb R^{3N})$ and form domain $\mathcal
%Q(H)=W^{1,2}(\mathbb R^{3N})$ \cite{katobook}.
%
We investigate local
solutions $\psi$ of
\begin{align}\label{eigen}
H\psi=E\psi\ , \quad E\in \R\,,
\end{align}
in a neighbourhood of two-particle coalescence points.
More precisely, let \(\Sigma\) denote the set of coalescence points,
\begin{align}\label{eq:Sigma}
\Sigma:=\Big\{{\bf x}=(x_1,\ldots,x_N)\in\R^{3N}\,\Big|\,
\prod_{j=1}^{N}|x_j|
\!\!\prod_{1\le i<j\le N}|x_i-x_j|=0\Big\}\,.
\end{align}
If, for some \(\Omega\subset\R^{3N}\), \(\psi\) is a distributional
solution to \eqref{eigen} in \(\Omega\), then \cite[Section 7.5,
pp.\ 177--180]{Hormander} \(\psi\) is real
analytic away from \(\Sigma\), that is, \(\psi\in
C^{\omega}(\Omega\setminus\Sigma)\).
Let, for \(k,\ell\in\{1,\ldots,N\}, k\neq \ell\),
\begin{align}
\label{eq:Sigma-k}
\Sigma_k':&=\Big\{{\bf x}\in\R^{3N}\,\Big|\,
\prod_{j=1,j\neq k}^{N}|x_j|\prod_{1\le i<j\le
N}|x_i-x_j|=0\Big\}\,,\\
\label{eq:Sigma-k-l}
\Sigma_{k,\ell}':&=\Big\{{\bf x}\in\R^{3N}\,\Big|\,
\,\prod_{j=1}^{N}|x_j|\prod_{1\le i<j\le
N, \{i,j\}\neq\{k,\ell\}}
\!\!\!\!\!\!\!|x_i-x_j|=0\Big\}\,.
\end{align}
Then we denote
\begin{align}
\label{eq:sigmas}
\Sigma_k:=\Sigma\setminus\Sigma_k'\ , \quad
\Sigma_{k,\ell}:=\Sigma\setminus\Sigma_{k,\ell}'
\end{align}
the two kinds of `two-particle coalescence
points'.
The main result of this paper is the following.
\begin{thm}\label{thm:main}
Let \(H\) be the non-relativistic Hamiltonian of an atom, given by
\eqref{H}, let \(\Omega\subset\R^{3N}\) be an open set, and
assume that $\psi\in W^{1,2}(\Omega)$ satisfies, for some
\(E\in\R\),
\begin{align}
\label{eq:eigen}
H\psi=E\psi\ \ \text{ in }\ \Omega
\end{align}
in the distributional sense.
Let the sets \(\Sigma_k\) and
\( \Sigma_{k,\ell}\) be given by \eqref{eq:sigmas}.
Then, for all \(k\in\{1,\ldots,N\}\), there exists a neighbourhood
\(\Omega_k\subset\Omega\) of \(\Omega\cap\Sigma_k\), and
real analytic functions
\(\psi_k^{(1)},\psi_{k}^{(2)}:\Omega_k\to\C\) such that
\begin{align}
\label{eq:resultPSIa}
&\psi({\bf x})=\psi_{k}^{(1)}({\bf x})+|x_k|\psi_{k}^{(2)}({\bf
x})\,,\ {\bf x}\in\Omega_k\,,
\end{align}
and for all \(k,\ell\in\{1,\ldots,N\}\), \(k\neq\ell\), there exists
a neighbourhood \(\Omega_{k,\ell}\subset\Omega\) of
\(\Omega\cap\Sigma_{k,\ell}\), and real analytic functions
\(\psi_{k,\ell}^{(1)},\psi_{k,\ell}^{(2)}:\Omega_{k,\ell}\to\C\) such
that
\begin{align}
\label{eq:resultPSIb}
&\psi({\bf x})=\psi_{k,\ell}^{(1)}({\bf
x})+|x_k-x_\ell|\psi_{k,\ell}^{(2)}({\bf x})\,,\ {\bf x}\in\Omega_{k,\ell}\,.
\end{align}
\end{thm}
%
\begin{remark}\label{rem:0}
The proof of Theorem \ref{thm:main} again uses the KS-transform. Due
to the presence of the other electron coordinates we are confronted
with additional problems. We have to deal with degenerate elliptic
PDE's where the corresponding operators (of Gru{\v{s}}in-type) are
analytic hypoelliptic, see \cite{grusin2}.
\end{remark}
\begin{remark}\label{rem:1}
Theorem~\ref{thm:main} extends in the obvious way to
electronic eigenfunctions of Hamiltonians of $N$-electron molecules
with \(K\) nuclei fixed at positions $(R_1,\ldots, R_K) \in \mathbb
R^3$, given by
\begin{equation}\label{moleculfixed}
H=\sum_{j=1}^N\Big(-\Delta_j
-\sum_{\ell=1}^K\frac{Z_\ell}{|x_j-R_\ell|}\Big)
+\sum_{1\le i<j\le N}\frac{1}{|x_i-x_j|}\,.
\end{equation}
Furthermore we can replace in \eqref{moleculfixed}, as in
Theorem~\ref{Hill}, the potential terms by more general terms, and
allow for inhomogeneities.
For instance, the result holds for general Coulombic
many-particle systems described by
\begin{equation}\label{Hv}
H=\sum_{j=1}^n{}-\frac{\Delta_j}{2m_j}+\sum_{1\le i<j\le
n}v_{ij}(x_i-x_j)\,,
\end{equation}
where the $m_j>0$ denote the masses of the particles, and
$v_{ij}=v_{i,j}^{(1)}|x_i-x_j|^{-1}+v^{(2)}_{i,j}$ with
$v^{(k)}_{ij},\:k=1,2$, real analytic.
\end{remark}
\begin{remark}\label{extensions}
In separate work we will present additional regularity results (not
primarily for Coulomb problems) obtained partly using the techniques
developed in the present paper.
\end{remark}
%
\section{Proofs of the main theorems}
\label{sec:Hill}
%
As mentioned in the introduction our proofs are based on the
Ku\-staan\-heimo-Stiefel (KS) transform. We will 'lift' the
differential equations to new coordinates using that transform. The
solutions to the new equations will be real analytic functions. By
projecting to the original coordinates we get the structure results
Theorem~\ref{Hill} and Theorem~\ref{thm:main}.
In the present section we will introduce the KS-transform and show how
it allows to obtain Theorems~\ref{Hill} and \ref{thm:main}. The
more technical verifications of the properties of the KS-transform and its
composition with real analytic functions needed for these proofs are left
to Sections~\ref{sec:KS} and \ref{sec:AnAndKS}.
Define the KS-transform \(K:\R^4\to\R^3\) by
\begin{align}
\label{eq:KSbis}
K(y)=\left(\begin{matrix}
y_1^2-y_2^2-y_3^2+y_4^2\\
2(y_1y_2-y_3y_4)\\
2(y_1y_3+y_2y_4)
\end{matrix}\right)\,.
\end{align}
%
It is a simple computation to verify that
\begin{align}
\label{eq:norms}
|K(y)|:=\|K(y)\|_{\R^3} = \|y\|_{\R^4}^2=:|y|^2\, \text{ for all
}y\in\R^4\,.
\end{align}
%
Let \(f:\R^3\to\C\) be any
\(C^2\)-function, and define, with \(K\) as above,
\begin{align}\label{eq:def-compo}
f_K:\R^4\to\C\ , \qquad f_K(y):=f(K(y))\,.
\end{align}
Then for all \(y\in\R^4\setminus\{0\},\) (see Lemma~\ref{lem:2}),
\begin{align} \label{eq:Laplace-formula}
(\Delta f)(K(y))&=\frac{1}{4|y|^2}\,\Delta f_K(y)\,.
\end{align}
%
\subsection{Proof of Theorem~\ref{Hill}}
%
Assume \(\varphi\in W^{1,2}(\Omega)\) satisfies (see
\eqref{Hone}--\eqref{Hpsi})
\begin{align}
\label{eq:one-partBIS}
\big({}-\Delta+\frac{W^{(1)}}{|x|}+W^{(2)}\big)\varphi
=\frac{F^{(1)}}{|x|}+F^{(2)}\,,
\end{align}
with \(W^{(1)}, W^{(2)}, F^{(1)}, F^{(2)}\) real analytic in
\(\Omega\subset\R^3\).
% Due to elliptic regularity for equations with real analytic
% coefficients \cite[Section 7.5,
% pp.\ 177--180]{Hormander}, \(\varphi\) is real analytic away from
% \(0\in\R^3\). Therefore, \(\varphi\) can be written as in
% \eqref{psian} in \(\Omega\setminus\{0\}\). (This representation is of
% course not unique since \(|x|\) is analytic here).
Assume without loss that \(\Omega=B_3(0,r)\) for some \(r>0\).
(Here, and in the sequel, \(B_n(x_0,r)=\{x\in\R^n\,|\, |x-x_0|<r\}\).)
Since
\(\varphi\in L^2(\Omega)\),
Remark~\ref{rem:ext-K} in Section~\ref{sec:KS} below implies that
\(\varphi_K\) is well-defined, as an element of
\(L^2(K^{-1}(\Omega),\tfrac{4}{\pi}|y|^2dy)\).
We will show that \(\varphi_K\) satisfies (in the distributional sense)
\begin{align}
\label{eq:new-psi-y}
\big({}-\Delta_y+4(W^{(1)}_K+|y|^2W^{(2)}_K)\big)\varphi_K
=4(F^{(1)}_K+|y|^2F^{(2)}_K)\,
\end{align}
in \(K^{-1}(\Omega)=B_4(0,\sqrt{r})\), with \(W^{(i)}_K, F^{(i)}_K\), \(i=1,2\),
defined as in \eqref{eq:def-compo}. Since \(W^{(i)}, F^{(i)}\),
\(i=1,2\), are real analytic in \(B_3(0,r)\) by assumption, and
\(K:\R^4\to\R^3\) (see \eqref{eq:KSbis}) and \(y\mapsto|y|^2\) are
real analytic, the coefficients in the elliptic equation in
\eqref{eq:new-psi-y} are real analytic in \(B_4(0,\sqrt{r})\).
It follows from elliptic regularity for equations with real analytic
coefficients \cite[Section 7.5,
pp.\ 177--180]{Hormander}
%follows (as above) from elliptic regularity that
that \(\varphi_K:B_4(0,\sqrt{r})\to\C\) is real analytic. The statement of
Theorem~\ref{Hill} then follows from
Proposition~\ref{prop:one particle} in Section~\ref{sec:AnAndKS}
below.
It therefore remains to prove that \(\varphi_K\) satisfies
\eqref{eq:new-psi-y}.
By elliptic regularity, $\varphi \in
W^{2,2}(\Omega')$ for all \(\Omega'=B_3(0,r')\), $r' < r$. (To see
this, use Hardy's inequality \cite[Lemma p.\ 169]{RS2} and that \(\varphi\in
W^{1,2}(\Omega)\) to conclude that \(\Delta\varphi=G\) with \(G\in
L^{2}(\Omega')\). Then use \cite[Theorem 8.8]{GT}).
It follows % (from Remark~\ref{rem:ext-K} in
% Section~\ref{sec:KS}
% below; see also \eqref{eq:L-2-abs})
that both \((\Delta\varphi)_K\)
and \((|\,\cdot\,|^{-1}\varphi)_K\) are well-defined, as elements of
\(L^2(K^{-1}(\Omega'),\tfrac{4}{\pi}|y|^2dy)\) (see Remark~\ref{rem:ext-K} in
Section~\ref{sec:KS}
below; see also \eqref{eq:L-2-abs}). This and
\eqref{eq:one-partBIS} imply that, as functions in
\(L^2(K^{-1}(\Omega'))=L^2(B_4(0,\sqrt{r'}))\),
\begin{align}\label{eq:almost-tranf}
|y|(\Delta\varphi)_K = |y|\big((W\varphi)_K-F_K\big)\,,
\end{align}
with
\begin{align}\label{eq:W-F}
W(x)=\frac{W^{(1)}(x)}{|x|}+W^{(2)}(x)\,, \qquad
F(x)=\frac{F^{(1)}(x)}{|x|}+F^{(2)}(x)\,.
\end{align}
Let \(f\in C_0^{\infty}(K^{-1}(\Omega))\); then there exists \(r'<r\)
such that \(\supp(f)\subset K^{-1}(\Omega')\), \(\Omega':=B_3(0,r')\);
choose
\(\{\varphi_n\}_{n\in\N}\subset C^{\infty}(\Omega')\) such that
\(\varphi_n\to\varphi\) and \(\Delta\varphi_n\to\Delta\varphi\) in
\(L^2(\Omega')\)-norm. This is possible since $\varphi \in
W^{2,2}(\Omega')$.
Note that both \(\Delta
f\) and \(4|y|^2f\) belong to \(C_0^{\infty}(K^{-1}(\Omega))\) when
\(f\) does.
Using \eqref{eq:Laplace-formula} for \(\varphi_n\in
C^{\infty}(\Omega')\),
Remark~\ref{rem:ext-K} in Section~\ref{sec:KS}
below therefore implies that
\begin{align*}
&\int_{K^{-1}(\Omega)} (\Delta f)(y)\,\varphi_{K}(y)\,dy
=\lim_{n\to\infty} \int_{K^{-1}(\Omega)}(\Delta f)(y)
\,(\varphi_{n})_{K}(y)\,dy
\\&=\lim_{n\to\infty} \int_{K^{-1}(\Omega)}\!\!\!\!\!\!\!\!\!\!
f(y)
\,[\Delta_y(\varphi_{n})_{K}](y)\,dy
=\lim_{n\to\infty} \int_{K^{-1}(\Omega)}\!\!\!\!\!\!\!\!\!\!
4|y|^2f(y)
\,(\Delta_x\varphi_{n})_{K}(y)\,dy
\\&=\int_{K^{-1}(\Omega)}\!\!\!\!\!
4|y|^2f(y)
\,(\Delta_x\varphi)_{K}(y)\,dy \,.
\end{align*}
It follows from this and \eqref{eq:almost-tranf} that
\begin{align*}
&\int_{K^{-1}(\Omega)} (\Delta f)(y)\,\varphi_{K}(y)\,dy
=\int_{K^{-1}(\Omega)} 4|y|^2f(y)\,\big((W\varphi)_K-F_K\big)(y)\,dy\,.
\end{align*}
Since \((W\varphi)_K=W_K\varphi_K\), and, by \eqref{eq:W-F} and \eqref{eq:norms},
\begin{align*}
%\label{eq:W-F_with_K}
W_K(y)&=|y|^{-2}\big(W^{(1)}_K(y)+|y|^2W^{(2)}_K(y)\big)\,,\\
F_K(y)&=|y|^{-2}\big(F^{(1)}_K(y)+|y|^2F^{(2)}_K(y)\big)\,,
\end{align*}
this implies that, for all \(f\in C_{0}^{\infty}(K^{-1}(\Omega))\),
\begin{align*}
\int_{K^{-1}(\Omega)}
\varphi_K(y)\big[{}-&\Delta_yf(y)
+4(W^{(1)}_K(y)+|y|^2W^{(2)}_K(y))f(y)\big]\,dy
\\&=\int_{K^{-1}(\Omega)} 4(F^{(1)}_K(y)+|y|^2F^{(2)}_K(y))f(y)\,dy\,,
\end{align*}
which means that \(\varphi_K\) satisfies \eqref{eq:new-psi-y} in the
distributional sense, in \(K^{-1}(\Omega)=B_4(0,\sqrt{r})\).
\qed
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsection{The \(N\)-particle problem}\label{sec:N}
%
In this section we prove Theorem~\ref{thm:main}. We only prove
the statement \eqref{eq:resultPSIa}, the proof of
\eqref{eq:resultPSIb} is completely analogous, after an orthogonal
transformation of coordinates. We assume \(k=1\), the proof for other
\(k\)'s is the same.
Let \(H\) be given by \eqref{H}.
Then, with \((x,x')\equiv(x_1,x')\in\R^3\times\R^{3N-3}\),
\(x'=(x_2,\ldots,x_N)\),
\begin{align}
\label{eq:Hbis}
H-E=-\Delta_{x}-\Delta_{x'}-\frac{Z}{|x|}+V_E(x,x')\,,
\end{align}
where
\begin{align}\label{def:V-E}
V_E(x_1,x')
=\sum_{j=2}^N -\frac{Z}{|x_j|}+\sum_{1\le i<j\le
N}\frac{1}{|x_i-x_j|} - E
\end{align}
is real analytic on \(\Omega\setminus\Sigma_1'\) (see
\eqref{eq:Sigma-k} for \(\Sigma_1'\)).
Assume \(\psi\in W^{1,2}(\Omega)\) satisfies
\begin{align}\label{eq:new Schr}
(H-E)\psi=0\quad \text{on} \quad\Omega\,,
\end{align}
% Since \(V(x,x')=-Z|x|^{-1}+V_E(x,x')\) is real analytic on
% \(\Omega\setminus\Sigma\) (with \(\Sigma\) given in \eqref{eq:Sigma})
% it follows, by elliptic regularity for equations with real analytic
% coefficients \cite[Section 7.5,
% pp.\ 177--180]{Hormander}, that \(\psi\) is real analytic on
% \(\Omega\setminus\Sigma\). It follows that in a neighbourhood of any point
% \((x_0,x'_0)\in\Omega\setminus\Sigma\), we have a representation of
% \(\psi\) as in
% \eqref{eq:resultPSIa}--\eqref{eq:resultPSIaBIS}.
%
and let \((x_0,x_0')\in\Omega\cap\Sigma_1\); then (see
\eqref{eq:sigmas}) \(x_0=0\). We will first prove that there exists a
neighbourhood \(\Omega_1(P)\) of \(P=(0,x_0')\) and real analytic
functions \(\psi_{P}^{(1)},\psi_{P}^{(2)}:\Omega_1(P)\to\C\) such that
\begin{align}
\label{eq:resultPSIaBIS}
&\psi({\bf x})=\psi_{P}^{(1)}({\bf x})+|x|\psi_{P}^{(2)}({\bf
x})\,,\ {\bf x}\in\Omega_1(P)\,.
\end{align}
By the above, \(V_E\) is real analytic on a neighbourhood of \((0,x_0')\),
say, on
\[
U(R)=\big\{(x,x')\in\R^{3}\times\R^{3N-3}\,\big|\, |x|<R,
|x'-x_0'|<R\big\}\subset\Omega
\] for some
\(R>0\), \(R\) small. Let
\begin{align}
U_{K}(R):=\big\{(y,x')\in\R^{4}\times\R^{3N-3}\,\big|\, |y|<\sqrt{R},
|x'-x_0'|<R\big\}\,.
\end{align}
Define now, with \(K:\R^4\to\R^3\) as in \eqref{eq:KSbis},
\begin{align}
\label{eq:def-new-u}
u:U_{K}(R)\to\C\,&, \quad u(y,x'):=\psi(K(y),x')\,,\\
\label{eq:def-new-w}
W:U_{K}(R)\to\R\,&, \quad W(y,x'):=V_E(K(y),x')\,.
\end{align}
Since (by \eqref{eq:norms})
\((K(y),x')\in U(R)\) for \((y,x')\in U_{K}(R)\), it follows that \(u\)
and \(W\) are well-defined, and \(W\) is real analytic on \(U_{K}(R)\)
since \(K\) is real analytic and \(V_E\) is real analytic on \(U(R)\).
As in the proof of Theorem~\ref{Hill}, we get that \eqref{eq:new Schr}
implies that \(u\) satisfies
\begin{align}
\label{eq:new for u}
Q(y,x',D_{y},D_{x'})u=0\quad \text{on} \quad U_{K}(R)\,,
\end{align}
where
\begin{align}\label{def:Grusin}
Q(y,x',D_{y},D_{x'}):={}-\Delta_y-4|y|^2\Delta_{x'}+4|y|^2W(y,x')-4Z
\end{align}
is a degenerate elliptic operator, a
so-called `Gru{\v{s}}in-type operator'.
Since \(|y|^2W(y,x')\) is real analytic on \(U_{K}(R)\), the operator
\(Q\) is (real) analytic hypoelliptic due to \cite[Theorem
5.1]{grusin2}. Therefore \eqref{eq:new for u} implies that \(u\) is
real analytic on some neighbourhood of \((0,x'_{0})\in\R^4\times\R^{3N-3}\).
It follows from Proposition~\ref{prop:many} in
Section~\ref{sec:AnAndKS} below that there exist a neighbourhood
\(\Omega_1(P)\subset\R^{3N}\) of \(P=(0,x_0')\in\R^3\times\R^{3N-3}\)
and real analytic
functions \(\psi_{P}^{(1)},\psi_{P}^{(2)}:\Omega_1(P)\to\C\) such that
\eqref{eq:resultPSIaBIS} holds.
Let now
\begin{align*}
\Omega_1:=\bigcup_{P\in\Omega\cap\Sigma_1}\Omega_{1}(P)\subset\Omega\subset\R^{3N}\,,
\end{align*}
and define \(\psi_{1}^{(1)}, \psi_{1}^{(2)}:\Omega_1\to\C\) by
\begin{align}\label{eq:def-psis}
\psi_{1}^{(i)}({\bf x})=\psi_{P}^{(i)}({\bf x})\ \text{ when } {\bf x}
\in\Omega_{1}(P)\ (i=1,2)\,.
\end{align}
To see that this is well-defined, we need to verify that if \({\bf
x}\in \Omega_1(P)\cap\Omega_1(Q)\), then \(\psi_{P}^{(i)}({\bf
x})=\psi_{Q}^{(i)}({\bf x})\), \(i=1,2\). Let therefore
\(\widetilde\psi^{(i)}=\psi^{(i)}_P-\psi^{(i)}_Q\), \(i=1,2\), then
\begin{align}\label{eq:unique-cont-assump}
\widetilde\psi^{(1)}({\bf x})+|x|\widetilde\psi^{(2)}({\bf x})=0\,,\
{\bf x}\in \Omega_1(P)\cap\Omega_1(Q)\,,
\end{align}
with \(\widetilde\psi^{(1)}, \widetilde\psi^{(2)}\) real analytic in
\( \Omega_1(P)\cap\Omega_1(Q)\). Let \(\tilde{\bf x}_0=(0,\tilde{x}'_0)\in
\Omega_1(P)\cap\Omega_1(Q)\). Then, since \(\widetilde\psi^{(i)},
i=1,2\), are real analytic, there exist \(\delta>0\) and \(P_n^{(i)},
i=1,2\), homogeneous
polynomials of degree \(n\) such that
\begin{align}\label{eq:expansion-here}
\widetilde\psi^{(i)}({\bf x}) =
\sum_{n=0}^{\infty}P_n^{(i)}(x,x'-\tilde{x}_0')\,, \quad i=1,2\,,
\end{align}
for \({\bf
x}\in B_{3N}(\tilde{\bf x}_0,\delta)\). It follows from
\eqref{eq:unique-cont-assump} (by homogeneity) that, for all
\(n\in\N\) and \({\bf x}=(x,x')\in B_{3N}(\tilde{\bf x}_0,\delta)\),
\begin{align*}
P^{(1)}_n(x, x'-\tilde{x}'_0)+|x| P^{(2)}_{n-1}(x,x'-\tilde{x}_0')=0\,.
\end{align*}
But for \(n\) even, \(P^{(1)}_n\) is an even function,
while \(P_{n-1}^{(2)}\), and therefore \(|x|P^{(2)}_{n-1}\), is
odd. Therefore, \(P_n^{(1)}=P^{(2)}_{n-1}=0\). Similarly for \(n\)
odd.
It follows that \(\widetilde\psi^{(1)}=\widetilde\psi^{(2)}=0\) on
\(B_{3N}(\tilde{\bf x}_0,\delta)\), and therefore also on
\(\Omega_1(P)\cap\Omega_1(Q)\), since \(\widetilde\psi^{(1)},
\widetilde\psi^{(2)}\) are real analytic. This proves that
\(\psi_{1}^{(1)}\) and \(\psi_{1}^{(2)}\) in
\eqref{eq:def-psis} are well-defined. Since they are obviously real
analytic, this finishes the proof of Thereom~\ref{thm:main}.
%
\qed
%
\section{The Kustaanheimo-Stiefel transform}
\label{sec:KS}
%
The KS-transform turns out to be a very useful and natural tool for the
investigation of Schr\"odinger equations with Coulombic
interactions. In particular \eqref{eq:norms} and the following lemma
are important for our proofs. Most of the facts stated here are
well-known (see e.\ g.\ \cite[Appendix A]{HelfferEtAl}).
\begin{lem}\label{lem:2}
Let \(K:\R^4\to\R^3\) be defined as in \eqref{eq:KSbis}, let
\(f:\R^3\to\C\) be any \(C^2\)-function, and define
\(f_K:\R^4\to\C\) by \eqref{eq:def-compo}.
Finally, let
\begin{align}
\label{def:P}
L(y,D_y):=y_1\frac{\p}{\p y_4}-y_4\frac{\p}{\p y_1}
+y_3\frac{\p}{\p y_2}-y_2\frac{\p}{\p y_3}\,.
\end{align}
\noindent{\rm (a)} Then, with \([A;B]=AB-BA\) the commutator of
\(A\) and \(B\),
\begin{align}
\label{eq:firstOrder}
L(y,D_y)f_{K}&=0\ , \qquad\qquad \big[\Delta;L(y,D_y)\big]=0\,,
\end{align}
and \eqref{eq:Laplace-formula} holds.
\noindent{\rm (b)} Furthermore, for a function $g \in C^1({\mathbb
R}^4)$, the following
two statements are equivalent:
\begin{enumerate}[{\rm (i)}]
\item \label{i} There exists a function $f:{\mathbb R}^3
\rightarrow {\mathbb C}$
such that $g= f_K$.
\item \label{ii} The function $g$ satisfies
\begin{align}
\label{eq:1}
Lg = 0\,.
\end{align}
\end{enumerate}
\noindent{\rm (c)} Finally, let \(U=B_3(0,r)\subset\R^3\) for
\(r\in(0,\infty]\). Then, for \(\phi\in C_0(\R^3)\) (continuous with
compact support),
\begin{align}
\label{eq:L-2-formula}
\int_{K^{-1}(U)}|\phi(K(y))|^2\,dy =
\frac{\pi}{4}\int_{U}\frac{|\phi(x)|^2}{|x|}\,dx\,.
\end{align}
In particular,
\begin{align}
\label{eq:L-2-abs}
\big\||y|\phi_K\big\|^2_{L^2(K^{-1}(U))}=\frac{\pi}{4}\|\phi\|^2_{L^2(U)}\,.
\end{align}
\end{lem}
\begin{remark}\label{rem:ext-K}
By a density argument, the isometry \eqref{eq:L-2-abs} allows to
extend the composition by \(K\) given by \eqref{eq:def-compo} (the
pull-back \(K^*\) by \(K\)) to a map
\begin{align*}
%\label{eq:ext-K}
K^{*}: L^2(U, dx)&\to L^2(K^{-1}(U), \tfrac{4}{\pi}|y|^2dy)\\
\phi&\mapsto \phi_K
\end{align*}
in the case when \(U=B_3(0,r), r\in(0,\infty]\).
This makes \(\phi_K\) well-defined for any \(\phi\in L^2(U)\).
%
Furthermore, if \(\phi_n\to\phi\) in
\(L^2(U)\), then, for all \(g\in C^{\infty}(K^{-1}(U))\) (\(g\in
C_{0}^{\infty}(K^{-1}(U))\), if \(r=\infty\))
\begin{align}
\label{eq:test-conv}
\lim_{n\to\infty}\int_{K^{-1}(U)} g(y)(\phi_n)_K(y)\,dy
=\int_{K^{-1}(U)} g(y)\phi_K(y)\,dy\,.
\end{align}
This follows from Schwarz' inequality and \eqref{eq:L-2-abs},
\begin{align*}
\Big|\int_{K^{-1}(U)}&g(y)\big((\phi_n)_K(y)-\phi_K(y)\big)\,dy\Big|
\\&\le
\Big(\int_{K^{-1}(U)}\frac{|g(y)|^2}{|y|^2}\,dy\Big)^{1/2}
\big\||y|\big((\phi_n)_K-\phi_K\big)\big\|_{L^2(K^{-1}(U))}
\\&= \frac{\sqrt{\pi}}{2}\Big(\int_{K^{-1}(U)}\frac{|g(y)|^2}{|y|^2}\,dy\Big)^{1/2}
\|\phi_n-\phi\|_{L^2(U)}\to0\,,\ n\to\infty\,.
\end{align*}
Here the \(y\)-integral clearly converges since \(g\in
C^{\infty}(\R^4)\) (\(g\in
C_{0}^{\infty}(\R^4)\), if \(r=\infty\)).
\end{remark}
\begin{remark}
As a consequence of \eqref{eq:norms} and \eqref{eq:firstOrder}
(choose
\(f(x)=|x|^j\)), we have that
\begin{align}\label{eq:P norm zero}
L(y,D_y)|y|^{2j}=0\ ,\ j\in\N\,.
\end{align}
\end{remark}
\begin{proof}[Proof of Lemma~\ref{lem:2}]
The lemma is easier to prove in `double polar coordinates' in
\(\R^4\). Let
\begin{align}
\label{eq:doublepolar}
(R,\Omega):=(r_1,r_2,\theta_1,\theta_2)
\in(0,\infty)^2\times[0,2\pi)^2
\end{align}
be defined by the relation
\begin{align}
\label{eq:polar coord}
& y\equiv y(R,\Omega)=\big(y_1(R,\Omega), y_2(R,\Omega), y_3(R,\Omega),
y_4(R,\Omega)\big)\,,\\
&(y_1,y_4)=r_1(\cos\theta_1,\sin\theta_1)\ ,\quad
(y_3,y_2)=r_2(\cos\theta_2,\sin\theta_2)\,.
\label{eq:polar coordBIS}
\end{align}
Then it follows directly from \eqref{eq:KSbis} that
\begin{align}
\label{eq:K polar}
K(y(R,\Omega))=\left(\begin{matrix}
r_1^2-r_2^2\\
-2r_1r_2\sin(\theta_1-\theta_2)\\
2r_1r_2\cos(\theta_1-\theta_2)
\end{matrix}\right)\,.
\end{align}
We note in passing that the relation \eqref{eq:norms} is immediate
from \eqref{eq:K polar}.
%
In the double polar coordinates,
\begin{align}\label{eq:L in polar}
L = \frac{\partial}{\partial \theta_1} + \frac{\partial}{\partial \theta_2}\,,
\end{align}
and
\begin{align*}
\Delta = \Big(\frac{\partial^2}{\partial r_1^2 } + \frac{1}{r_1}
\frac{\partial}{\partial r_1 }+
\frac{1}{r_1^2} \frac{\partial^2}{\partial \theta_1^2}\Big) +
\Big(\frac{\partial^2}{\partial r_2^2 } + \frac{1}{r_2}
\frac{\partial}{\partial r_2 }+
\frac{1}{r_2^2} \frac{\partial^2}{\partial \theta_2^2}\Big)\,.
\end{align*}
%
Therefore, it is obvious that $L$ and $\Delta$ commute. Furthermore,
from \eqref{eq:K polar} we see that $f_K$ only depends on the angles
through the expression $\theta_1 - \theta_2$ and therefore,
\begin{align*}
L f_K = \big( \frac{\partial}{\partial \theta_1} +
\frac{\partial}{\partial \theta_2}\big) f_K = 0\,.
\end{align*}
%
The proof of \eqref{eq:Laplace-formula} is merely an elementary
computation, which we leave to the reader. This finishes the proof of
point (a) of the lemma.
From \eqref{eq:firstOrder} we infer that in order to prove point (b)
we have to show that \eqref{ii}
implies \eqref{i}.
To do so, we need to define a function \(f:\R^3\to\C\) such that
\(g=f_{K}\). If \(x=0\), let \(f(x):=g(0)\), then
\(g(0)=f(0)=f(K(0))=f_{K}(0)\) by \eqref{eq:norms}. Assume now that
\(x\in\R^3\setminus\{0\}\). We claim that the pre-image of \(x\) under
\(K\), \(K^{-1}(\{x\})\), is a circle in \(\R^4\) (in the literature
called the `Hopf circle')
%\cite{knoerrer}),
and that \(g\) is
constant on this circle. Then, taking any \(y\in K^{-1}(\{x\})\) and
letting \(f(x):=g(y)\), we have that \(f\) is well-defined, and
satisfies \(f_{K}(y)=f(K(y))=f(x)=g(y)\). This will finish the proof
of point (b) of the lemma.
To prove the claim, assume first that \(x\in\R^3\setminus\{0\}\),
\(x=(x_1,x_2,x_3)\) with \((x_2,x_3)\neq(0,0)\). Then the equations
(see \eqref{eq:K polar} and \eqref{eq:norms})
\begin{align}
\label{eq:solve-K-invers}
\begin{split}
r_1^2-r_2^2&=x_1, \\
-2r_1r_2\sin\vartheta&=x_2,\\
2r_1r_2\cos\vartheta&=x_3,\\
(r_1^2+r_2^2)^2&=x_1^2+x_2^2+x_3^2
\end{split}
\end{align}
uniquely determine \(r_1,r_2\in(0,\infty)\), and determine
\(\vartheta\) modulo \(2\pi\); choose the solution
\(\vartheta\in[0,2\pi)\). That
is, the pre-image of \(x\) under
\(K\) is the set of points in \(\R^4\) with double polar coordinates
\((r_1,r_2,\theta_1,\theta_2)\), where \((r_1,r_2)\) is the unique
solution to \eqref{eq:solve-K-invers}, and
\(\theta_1-\theta_2=\vartheta\) modulo \(2\pi\), with
\(\vartheta\in[0,2\pi)\). Defining new angles
\(\theta=\theta_1+\theta_2, \vartheta=\theta_1-\theta_2\), this set is
the circle in \(\R^4\) with centre at the origin and radius
\((x_1^2+x_2^2+x_3^2)^{1/4}=\sqrt{r_1^2+r_2^2}\), parametrized by
\(\theta\in[0,2\pi)\). Since, by \eqref{eq:L in polar}, the function
\(g\) (strictly speaking, \(g\) composed with the map in
\eqref{eq:polar coord}) is independent of \(\theta=\theta_1+\theta_2\),
\(g\) is, as claimed, constant on this circle.
On the other hand, assume \(x=(t,0,0), t\in\R\setminus\{0\}\). Then
the equations
\begin{align}
\label{eq:solve-K-invers-bis}
\begin{split}
r_1^2-r_2^2&=t, \\
(r_1^2+r_2^2)^2&=t^2
\end{split}
\end{align}
have a unique solution \((r_1,r_2)\); in fact,
\((r_1,r_2)=(\sqrt{t},0)\) if \(t>0\) and
\((r_1,r_2)=(0,\sqrt{-t})\) if \(t<0\). In both cases, the pre-image of \(x\) under
\(K\) is a circle, namely (see also \eqref{eq:doublepolar})
\begin{align*}%\label{eq:two circles}
C_{+}&=\{(\sqrt{t}\cos\theta_1,0,0,\sqrt{t}\sin\theta_1)\}\in\R^4\,|\,\theta_1\in[0,2\pi)\}
\quad\quad\ \,(t>0)\,,\\
C_{-}&=\{(0,\sqrt{-t}\sin\theta_2,\sqrt{-t}\cos\theta_2,0)\}\in\R^4\,|\,\theta_2\in[0,2\pi)\}
\quad (t>0)\,.
\end{align*}
Since \(y_2=y_3=0\) for any \(y=(y_1,y_2,y_3,y_4)\in C_{+}\),
\eqref{def:P} and \eqref{eq:1} imply that \(\p g/\p\theta_1=0\), with
\(\theta_1\) the angle parametrizing \(C_{+}\), and so \(g\) is, as
claimed, constant on \(C_{+}\); similarly for \(C_{-}\). This finishes
the proof of point (b) of the lemma.
We finish by proving point (c); this is merely a calculation which we
for simplicity also do in `double polar coordinates':
Recall that \(|y|^2=r_1^2+r_2^2=|x|\) (see \eqref{eq:norms}).
By \eqref{eq:polar coordBIS} and \eqref{eq:K polar}, and since
\(U=B_3(0,r)\) and \(K^{-1}(U)=B_4(0,\sqrt{r})\),
\begin{align*}
\int_{K^{-1}(U)}\!\!\!\!\!\!\!
|\phi(K(y))|^2\,dy=&\int_0^{2\pi}\Big\{\int_{0}^{\sqrt{r}}
r_1\,dr_1\int_0^{\sqrt{r-r_1^2}} r_2\,dr_2\int_0^{2\pi}d\theta_1 \\
\big|\phi\big(r_1^2-&r_2^2,-2r_1r_2\sin(\theta_1-\theta_2),
2r_1r_2\cos(\theta_1-\theta_2)\big)\big|^2\Big\}\,d\theta_2\,.
\end{align*}
In the triple integral inside \(\big\{\cdot\}\) we make (for fixed
\(\theta_2\)) the change of
variables
\begin{align*}
x=K_{\theta_2}(r_1,r_2,\theta_1)=\big(r_1^2-&r_2^2,-2r_1r_2\sin(\theta_1-\theta_2),
2r_1r_2\cos(\theta_1-\theta_2)\big)\,.
\end{align*}
From the foregoing (see after \eqref{eq:solve-K-invers-bis}) it follows
that the image of \(K_{\theta_2}\) is \(U\).
The determinant of the Jacobian is
\begin{align*}
&\det(D K_{\theta_2})\\
&=\left|\left[
\begin{array}{ccc}
2r_1 & -2r_2 & 0 \\
-2r_2\sin(\theta_1-\theta_2) & -2r_1\sin(\theta_1-\theta_2)
& -2r_1r_2\cos(\theta_1-\theta_2) \\
2r_2\cos(\theta_1-\theta_2) & 2r_1\cos(\theta_1-\theta_2) &
-2r_1r_2\sin(\theta_1-\theta_2)
\end{array}
\right]\right| \\
& = 8r_1r_2(r_1^2+r_2^2)\,.
\end{align*}
Recall that \(|y|^2=r_1^2+r_2^2=|x|\). Therefore the integral is
\begin{align*}
\int_{K^{-1}(U)}|\phi(K(y)|^2\,dy
=\int_0^{2\pi}\Big\{\int_{U}|\phi(x)|^2\,\frac{dx}{8|x|}\Big\}\,d\theta_2
=\frac{\pi}{4}\int_{U}\frac{|\phi(x)|^2}{|x|}\,dx\,.
\end{align*}
This proves \eqref{eq:L-2-formula}; applying it to \(\sqrt{|x|}\phi\)
gives \eqref{eq:L-2-abs}. This finishes the proof of point (c), and
therefore, of Lemma~\ref{lem:2}.
\end{proof}
%
\begin{lemma}\label{lem:sph-harm}
Let the differential operator \(L=L(y,D)\) be given by \eqref{def:P},
and let $P_{2k}$ be a harmonic, homogeneous polynomial of degree $2k$ in
$\R^4$ such that $L P_{2k} = 0$.
Then there exists a harmonic
polynomial in $\R^3$, $Y_{k}$, homogeneous of degree $k$, such that
\begin{align}
P_{2k}(y) = Y_{k}(K(y))\ \text{ for all } y\in \R^4\,,
\end{align}
with \(K:\R^4\to\R^3\) from \eqref{eq:KSbis}.
\end{lemma}
%
\begin{proof}
Using that $L P_{2k} = 0$ we get from Lemma~\ref{lem:2} the existence
of a function $Y_{k}$ such that $P_{2k}(y) = Y_{k}(K(y))$. Since the
KS-transform is homogeneous of degree $2$, $Y_{k}$ is necessarily
homogeneous of degree $k$. Furthermore, by \eqref{eq:Laplace-formula},
$Y_{k}$ is harmonic. So we only have left to prove that $Y_{k}$ is a
polynomial.
Let ${\mathcal L}_n$ be the (positive) Laplace-Beltrami operator on
the sphere $\mathbb{S}^{n-1}$. Then one can express the Laplace
operator in % the ambient space
$\R^n$ as
\begin{align}\label{eq:Beltrami}
\Delta = \frac{\p^2}{\p r^2} + \frac{n-1}{r} \frac{\p}{\p r} -
\frac{{\mathcal L}_n}{r^2}\,.
\end{align}
%
Furthermore, $\sigma({\mathcal L}_n) = \{
\ell(\ell+n-1)\}_{\ell=0}^{\infty}$ and the eigenspace corresponding
to the eigenvalue $\ell(\ell+n-1)$ is exactly spanned by the
restrictions to ${\mathbb S}^{n-1}$ of the harmonic, homogeneous
polymials in $\R^n$ of degree $\ell$.
Using the fact that $\Delta Y_{k}=0$ and that $Y_{k}$ is
homogeneous of degree $k$ in $\R^3$ we find that
$Y_{k}\big|_{{\mathbb S}^2}$ is an eigenfunction of ${\mathcal L}_3$
with eigenvalue $k(k+2)$. Thus there exists a homogeneous, harmonic
polynomial $\widetilde Y_{k}$ of degree $k$ such that
\begin{align*}
\widetilde Y_{k}\big|_{\mathbb{S}^2} = Y_{k}\big|_{\mathbb{S}^2}\,.
\end{align*}
%
Since the functions have the same homogeneity, they are identical
everywhere. This finishes the proof of the lemma.
\end{proof}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Analyticity and the KS-transform}
\label{sec:AnAndKS}
In this section we study the regularity of functions given as a
composition with the Kustaanheimo-Stiefel transform. We start with the
one-particle case.
\begin{prop}\label{prop:one particle}
Let $U \subset \R^3$ be open with $0 \in U$, and let $\varphi:U\to \C$
be a function. Let ${\mathcal{U}} = K^{-1}(U) \subset \R^4$, with
\(K:\R^4\to\R^3\) from \eqref{eq:KSbis}, and suppose that
\begin{align}\label{assum:analy}
\varphi_K = \varphi \circ K:\mathcal{U}\to \C
\end{align}
is real analytic.
Then there exist functions $\varphi^{(1)}, \varphi^{(2)}$, real
analytic in a neighbourhood of $0 \in \R^3$, such that
\begin{align}\label{res:prop}
\varphi(x) = \varphi^{(1)}(x)+ |x|\varphi^{(2)}(x)\,.
\end{align}
\end{prop}
\begin{proof}
Note that \(K(-y)=K(y)\) for all \(y\in\R^4\), so that
\(\varphi_{K}(-y)=\varphi_{K}(y)\) for all \(y\in\R^4\). It follows
that \(\varphi_{K}\) can be written as an absolutely convergent power
series containing only terms of even order. Furthermore, since the sum
is absolutely convergent, the order of summation is unimportant, and
so, for some \(R>0\), \(c_{\beta}\in\C\),
\begin{align}\label{eq:one}
\varphi_{K}(y)=\sum_{\beta\in\N^4, |\beta|/2\in\N}c_\beta y^\beta
=\sum_{n=0}^\infty\sum_{|\beta|=2n}c_\beta y^\beta
\ \text{ for } \ |y|<R\,.
\end{align}
This implies (see e.\ g.\ \cite[sections 2.1--2.2]{Krantz}) that there
exists constants
\(C_1,M_1>0\) such that
\begin{align}\label{eq:ja}
|c_\beta|\le C_1 M_1^{|\beta|}\quad\text{for all } \beta\in\N^4\,.
\end{align}
Note that for fixed \(n\in\N\),
\begin{align}\label{def:Q}
Q^{(2n)}(y):=\sum_{\beta\in\N^4,
|\beta|=2n}c_{\beta}\,y^{\beta}
\end{align}
is a homogeneous polynomial of degree \(2n\). By \cite[Theorem
2.1]{Stein},
\begin{align}
\label{eq:expansionP}
Q^{(2n)}(y)=\sum_{j=0}^{n}|y|^{2j}H^{(2n)}_{2n-2j}(y)\,,
\end{align}
where \(H_{2n-2j}^{(2n)}\) is a homogeneous {\it harmonic} polynomial
of degree \(2n-2j\), \(j=0,1,\ldots,n\). It follows that
\begin{align}
\label{eq:first sum}
\varphi_{K}(y)=\sum_{n=0}^\infty Q^{(2n)}(y)
=\sum_{n=0}^\infty\sum_{j=0}^{n}|y|^{2j}H^{(2n)}_{2n-2j}(y)\,.
\end{align}
We need the following lemma.
\begin{lemma}\label{lem:back to Y's}
There exist harmonic polynomials \(Y_{n-j}^{(2n)}:\R^3\to\C\),
homogeneous of degree \(n-j\), such that
\begin{align}\label{eq: given by Y}
H_{2n-2j}^{(2n)}(y) = Y_{n-j}^{(2n)}(K(y))\ \text{ for all } y\in \R^4\,,
\end{align}
with \(K:\R^4\to\R^3\) from \eqref{eq:KSbis}. In particular, the
function
\begin{align}\label{eq:new q}
q^{(2n)}(x):=\sum_{j=0}^{n}|x|^{j}Y_{n-j}^{(2n)}(x)
\end{align}
satisfies
\begin{align}\label{eq:relation}
q^{(2n)}(K(y))=Q^{(2n)}(y) \ \text{ for all } y\in \R^4\,.
\end{align}
\end{lemma}
%
\begin{pf*}{Proof of Lemma~\ref{lem:back to Y's}}
Recall (see \eqref{eq:firstOrder}) that, with \(L\equiv L(y,D_y)\) as
in \eqref{def:P}, \(L\varphi_{K}=0\), and therefore, since power
series can be differentiated termwise (see \eqref{eq:first sum}),
\begin{align}\label{eq:termbytermdiff}
0=L\varphi_{K}=\sum_{n=0}^{\infty}LQ^{(2n)}\,.
\end{align}
Since \(LQ^{(2n)}\) is again a homogeneous polynomial of degree
\(2n\), it follows that
\begin{align}\label{eq:PonQ}
LQ^{(2n)}=0\,, \ n=0,1,\ldots\,.
\end{align}
Since \(L\) is a first order differential operator, \eqref{eq:P norm
zero} implies that
\begin{align}\label{eq:compu P on terms}
L[|y|^{2j}H_{2n-2j}^{(2n)}]
=|y|^{2j}[LH_{2n-2j}^{(2n)}]\,,
\end{align}
where \(LH_{2n-2j}^{(2n)}\) is again a homogeneous polynomial of order
\(2(n-j)\). Then \eqref{eq:expansionP}, \eqref{eq:PonQ}, and
\eqref{eq:compu P on terms} imply that
\begin{align}
\label{eq:zeroExp}
\sum_{j=0}^{n}|y|^{2j}[LH_{2n-2j}^{(2n)}](y)=0\ \text{
for all } y\in\R^4\,.
\end{align}
Since \(H_{2n-2j}^{(2n)}\) is harmonic, and (see \eqref{eq:firstOrder})
\([\Delta;L]=0\), we get that \(LH_{2n-2j}^{(2n)}\) is a homogeneous
{\it harmonic} polynomial of degree \(2(n-j)\). Note that for
\(|y|=1\), the left side of \eqref{eq:zeroExp} is a linear combination
of spherical harmonics of different degrees. From the linear
independence of such spherical harmonics it follows that
\begin{align}\label{eq:PonPjzero}
&LH_{2n-2j}^{(2n)}=0 \text{ for all }
j=0,\ldots,n, \text{ and }n\in\N\,.
\end{align}
%
From Lemma~\ref{lem:sph-harm} it follows that there exist harmonic
polynomials in $\R^3$, $Y_{n-j}^{(2n)}$, homogeneous of degree $n-j$,
such that \eqref{eq: given by Y} holds.
Now \eqref{eq:relation} follows from this and \eqref{eq:norms}. This
finishes the proof of the lemma.
\end{pf*}
%
Lemma~\ref{lem:back to Y's}, \eqref{eq:first sum}, and
\(|K(y)|=|y|^2\), imply that
\begin{align}
\label{eq:first with K}
\varphi_{K}(y)=\varphi(K(y))=\sum_{n=0}^{\infty}\sum_{j=0}^{n}
|K(y)|^{j}\,Y_{n-j}^{(2n)}(K(y))\,.
\end{align}
Formally, we can now finish the proof of Proposition~\ref{prop:one
particle} by defining
\begin{align}\label{eq:phi1-temp}
\varphi^{(1)}(x)&:=\sum_{n=0}^{\infty}\sum_{j=0,j\text{
even}}^{n}\!\!|x|^{j}\,Y_{n-j}^{(2n)}(x)\,,\\
\label{eq:phi2-temp}
\varphi^{(2)}(x)&:=\sum_{n=0}^{\infty}\sum_{j=1,j\text{
odd}}^{n}\!\!|x|^{j-1}\,Y_{n-j}^{(2n)}(x)\,.
\end{align}
However, it is not {\it a priori} clear that these sums converge and
thus define real analytic functions. The remainder of the proof will
establish the necessary convergence.
\begin{lemma}\label{lem:split one particle}
There exists \(r>0\) such that the two series in \eqref{eq:phi1-temp}
and \eqref{eq:phi2-temp} converge for \(|x|<r\).
More precisely, there exists a universal constant $R>0$ such that with
$\widetilde{C}_1:= R C_1$, $ \widetilde{M}_1 = 2 M_1^2$ (with $C_1,
M_1$ from \eqref{eq:ja}),
\begin{align}\label{eq:BoundYn}
|Y_{n-j}^{(2n)}(x) | \leq \widetilde{C}_1 \widetilde{M}_1^{n} |x|^{n-j}.
\end{align}
%
\end{lemma}
\begin{proof}
Clearly, the convergence of the series in \eqref{eq:phi1-temp} and
\eqref{eq:phi2-temp} is a consequence of \eqref{eq:BoundYn}: take $r <
1/(2 \widetilde{M}_1)$. Thus we only have to prove the estimate
\eqref{eq:BoundYn}.
We return to \eqref{eq:one}. For fixed \(\beta\), with
\(|\beta|=2n>0\) we have (again using \cite[Theorem 2.1]{Stein}) that,
for some \(d_j^{(\beta)}\in\C\),
\begin{align}\label{eq:two}
y^\beta=\sum_{j=0}^{n}|y|^{2j}d_j^{(\beta)}P_{2n-2j}^{(\beta)}(y)\,,
\end{align}
where \(P_{2n-2j}^{(\beta)}\) is a harmonic homogeneous polynomial of
degree \(2n-2j\), which depends on \(\beta\), and satisfies
\(\|P_{2n-2j}^{(\beta)}\|_{L^2(\mathbb{S}^3)}=1\).
It follows from \eqref{def:Q} and \eqref{eq:two} that
\begin{align}\label{eq:twoBis}
Q^{(2n)}(y)=\sum_{j=0}^n |y|^{2j}\sum_{|\beta|=2n}c_\beta
d_j^{(\beta)}P_{2n-2j}^{(\beta)}(y)\,.
\end{align}
Comparing \eqref{eq:expansionP} with \eqref{eq:twoBis} we see that
\begin{align}\label{new sums}
\sum_{j=0}^{n}|y|^{2j}\big[H^{(2n)}_{2n-2j}(y)
-\sum_{|\beta|=2n}c_{\beta}d_{j}^{(\beta)}P_{2n-2j}^{(\beta)}(y)\big]=0\,.
\end{align}
Restricting to \(|y|=1\), \eqref{new sums} becomes a sum of spherical
harmonics with different degrees, which are linearly independent,
implying that (see \eqref{eq: given by Y})
\begin{align}\label{eq:another new expansion}
Y_{n-j}^{(2n)}(K(y))=H_{2n-2j}^{(2n)}(y)
=\sum_{|\beta|=2n}c_{\beta}d_{j}^{(\beta)}P_{2n-2j}^{(\beta)}(y)\,.
\end{align}
We are now going to bound the \(Y_{n-j}^{(2n)}\)'s in \(L^{\infty}\).
Since the (restriction to \(\mathbb{S}^3\) of the)
\(P_{2n-2j}^{(\beta)}\)'s in \eqref{eq:two} are orthogonal in
\(L^2(\mathbb{S}^3)\) (they are homogeneous of different degrees), we
get (by Parseval's identity), from setting \(|y|=1\) in
\eqref{eq:two}, that
\begin{align}\label{eq:three}
\sum_{j=0}^{n}|d_j^{(\beta)}|^2
=\int_{\mathbb{S}^3}|y^\beta|^2\,d\omega
\le\int_{\mathbb{S}^3}|y|^{2|\beta|}\,d\omega
=\int_{\mathbb{S}^3}1\,d\omega=\Vol(\mathbb{S}^3)\,,
\end{align}
and so the \(d_j^{(\beta)}\)'s are bounded, uniformly in \(j\) and
\(\beta\), by \(\Vol(\mathbb{S}^3)^{1/2}\).
Due to homogeneity, and using \cite[Lemma 8]{Mueller}, we get, for any
\(y\in\R^3\setminus\{0\}\) and \(j\le n\), that
\begin{align}\label{eq:eight}\nonumber
\big|P_{2n-2j}^{(\beta)}(y)\big|
&=|y|^{2n-2j}\big|P_{2n-2j}^{(\beta)}(y/|y|)\big|
\le |y|^{2n-2j}\big\|P_{2n-2j}^{(\beta)}\big\|_{L^{\infty}(\mathbb{S}^3)}
\\&\le |y|^{2n-2j}\frac{2n-2j+1}{\Vol(\mathbb{S}^3)^{1/2}}
\le |y|^{2n-2j}\frac{3n}{\Vol(\mathbb{S}^3)^{1/2}}\,.
\end{align}
Note that (see \cite[pp.\ 138--139]{Stein})
\begin{align}\label{eq:no.multiindex}
\# \big\{\sigma\in\N^k\,\big|\, |\sigma|=\ell\big\} =
\binom{k+\ell-1}{k-1}\,,
\end{align}
and so
\begin{align}\label{eq:non}
\# \big\{\beta\in\N^4\,\big|\, |\beta|=2n\big\} &=
\frac{(4+2n-1)!}{(4-1)!(2n)!}
\\&=\frac16(2n+3)(2n+2)(2n+1)\le 10n^3\,.\nonumber
\end{align}
It follows from \eqref{eq:another new expansion}, \eqref{eq:ja},
\eqref{eq:three} \eqref{eq:eight}, and \eqref{eq:non} that (with
\(C_1\) and \(M_1\) the constants in \eqref{eq:ja})
\begin{align}\label{eq:estimateAgain}
\big|Y_{n-j}^{(2n)}(K(y))\big|&\le
\sum_{|\beta|=2n}|c_\beta|\,|d_j^{(\beta)}|\,\big|
P_{2n-2j}^{(\beta)}(y)\big|
\\&\le 10C_1n^4|y|^{2n-2j}M_1^{2n}
=10C_1n^4|K(y)|^{n-j}M_1^{2n}\,.\nonumber
\end{align}
The desired estimate \eqref{eq:BoundYn} clearly follows, using the
surjectivity of $K$, with $R := 10 \max_{n} n^4 2^{-n}$.
\end{proof}
Recall that each term $|x|^j Y^{(2n)}_{n-j}(x)$ in the definition
\eqref{eq:phi1-temp} of
$\varphi^{(1)}$ is a homogeneous {\it polynomial} (of degree $n$) in
$x$, and similarly for $\varphi^{(2)}$. Therefore, the series
\eqref{eq:phi1-temp} and \eqref{eq:phi2-temp} are convergent power
series. This implies that $\varphi^{(1)}, \varphi^{(2)}$ define
real analytic functions on $\{ |x|< r\}$ (see \cite[sections 2.1--2.2]{Krantz}).
Finally, using \eqref{eq:first with K}, \eqref{eq:phi1-temp} and
\eqref{eq:phi2-temp},
\begin{align}
\label{eq:conv-series-again}\nonumber
\varphi^{(1)}(K(y)) + &|K(y)|\varphi^{(2)}(K(y))
\\&=\sum_{n=0}^{\infty}\sum_{j=0}^{n}|K(y)|^j\,Y^{(2n)}_{n-j}(K(y))
=\varphi(K(y))\,.
\end{align}
%
This, and the surjectivity of $K$, imply \eqref{res:prop} and
therefore finishes the proof of Proposition~\ref{prop:one particle}.
\end{proof}
For the \(N\)-particle case, we have the following analogous result.
\begin{prop}\label{prop:many}
Let $U\subset \R^{3}$, \(U'\subset\R^{3N-3}\) be open, with $0\in U$,
\(x_0'\in U'\) and let $\psi:U\times U' \to \C$ be a function. Let $\mathcal{U}
= K^{-1}(U) \subset \R^4$, with \(K:\R^4\to\R^3\) from
\eqref{eq:KSbis}, and suppose that
\begin{align}\label{assum:analyN}
u:\mathcal{U}\times U'&\to \C\\
(y,x')&\mapsto \psi(K(y),x')\nonumber
\end{align}
is real analytic.
Then there exist functions $\psi^{(1)}, \psi^{(2)}$, real analytic in
a neighbourhood \(\mathcal{W}\) of $(0,x_0') \in \R^{3N}$, such that
\begin{align}\label{res:propN}
\psi(x,x') = \psi^{(1)}(x,x')+ |x|\psi^{(2)}(x,x')\ ,
\quad(x,x')\in \mathcal{W}\,.
\end{align}
\end{prop}
\begin{proof}
Define
\begin{align}\label{eq:IndexK}
\varphi_{\gamma}(x) := \frac{1}{\gamma!} \partial_{x'}^{\gamma}
\psi(x,x')\big|_{x'=x_0'}\, , \quad
\varphi_{\gamma,K}(y):= \varphi_{\gamma}(K(y))\,.
\end{align}
This is well defined by the assumption on \(u\).
Since, as in the proof of Proposition~\ref{prop:one particle}, \(u\)
is even with respect to \(y\in\R^4\), and the series converges
absolutely, we have, for \(|y|<\sqrt{R}, |x'-x_0'|<R\) for some
\(R>0\), \(c_{\beta\gamma}\in\C\),
\begin{align*}
%\label{eq:expansion for new u}%\nonumber
u(y,x')&=\!\!\!\!
\sum_{\beta\in\N^4,|\beta|/2\in\N,\gamma\in\N^{3N-3}}
\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!
c_{\beta\gamma}\,y^{\beta}(x'-x_0')^{\gamma}\,,
\end{align*}
with
\begin{align}
\label{eq:bounds-const-two}
|c_{\beta\gamma}|\le
C_2M_2^{|\beta+\gamma|}=C_2M_2^{|\beta|}M_2^{|\gamma|}
\quad\text{for all } \beta\in\N^4, \gamma\in\N^{3N-3}\,,
\end{align}
for some constants \(C_2,M_2>0\).
Clearly it follows that
\begin{equation}\label{eq:another-new}
\varphi_{\gamma,K}(y) = \!\!\!\!\sum_{\beta\in\N^{4},|\beta|/2\in\N}
\!\!\!\!c_{\beta\gamma}\,y^{\beta}\,,
\end{equation}
so that
\begin{align}
\label{eq:expansion for new u}\nonumber
u(y,x')&=\!\!\!\!\sum_{\gamma\in\N^{3N-3}}\!\!\!\big(\!\!\sum_{\beta\in\N^{4},|\beta|/2\in\N}
\!\!\!\!\!\!
c_{\beta\gamma}\,y^{\beta}\big)(x'-x_0')^{\gamma}
\\&=\sum_{\gamma\in\N^{3N-3}}\!\!\varphi_{\gamma,K}(y)\,(x'-x_0')^{\gamma}\,.
\end{align}
%
Moreover, from %\eqref{eq:expansion for new u} and
\eqref{eq:bounds-const-two} we have that, for all
\(\gamma\in\N^{3N-3}\),
\begin{align}
\label{eq:bounds-const-just-y}
|c_{\beta\gamma}|\le C_1(\gamma)M_2^{|\beta|}\quad \text{ where }
\quad C_1(\gamma):=C_2M_2^{|\gamma|}\,.
\end{align}
In particular, \eqref{eq:another-new} and
\eqref{eq:bounds-const-just-y} show that
$\varphi_{\gamma,K}$ is real analytic near $y=0$. Repeating
the arguments in the proof of Proposition~\ref{prop:one particle} for
\(\varphi_{\gamma,K}\) for fixed \(\gamma\in\N^{3N-3}\), we get that
\begin{align}\label{eq:some expansion}
\varphi_{\gamma}(x)&=
\sum_{n=0}^{\infty}
\sum_{\ell=0}^{[n/2]}|x|^{2\ell}\,Y^{(2n),\gamma}_{n-2\ell}(x)
\\&\qquad+|x|\sum_{n=0}^{\infty}
\sum_{\ell=0}^{[(n-1)/2]}|x|^{2\ell}\,
Y^{(2n),\gamma}_{n-(2\ell+1)}(x)\,, \nonumber
\end{align}
where \(Y^{(2n),\gamma}_{n-k}:\R^3\to\C\) are harmonic polynomials,
homogeneous of degree \(n-k\), depending on \(\gamma\in\N^{3N-3}\).
Therefore, for some \(a_{\alpha}(\gamma),b_{\alpha}(\gamma)\in\C\),
\(\alpha\in\N^{3}\),
\begin{align}\label{eq:aalphas}
\sum_{\ell=0}^{[n/2]}|x|^{2\ell}\,Y^{(2n),\gamma}_{n-2\ell}(x)
&=\sum_{|\alpha|=n}a_{\alpha}(\gamma)x^{\alpha}\,,\\
\label{eq:balphas}
\sum_{\ell=0}^{[(n-1)/2]}|x|^{2\ell}\,Y^{(2n),\gamma}_{n-(2\ell+1)}(x)
&=\sum_{|\alpha|=n-1}b_{\alpha}(\gamma)x^{\alpha}\,,
\end{align}
with (see \eqref{eq:BoundYn}),
\begin{align}\label{eq:est-Y's-many-part}
\big|\sum_{|\alpha|=n}a_{\alpha}(\gamma)x^{\alpha}\big|
\leq R C_1(\gamma) n (2M_2^2)^n |x|^n,\\
\big|\sum_{|\alpha|=n-1}b_{\alpha}(\gamma)x^{\alpha}\big|
\le R C_1(\gamma) n (2M_2^2)^n |x|^n.
\end{align}
Recall that (see \eqref{eq:no.multiindex})
\begin{align}\label{eq:no.mult.N}
\# \{\gamma\in\N^{3N-3}\,|\, |\gamma|=k\} = \binom{3N+k-4}{3N-4}
\,.%\le C_3 k^{aN+b}\,.
\end{align}
By definition, discarding part of the denominator,
\begin{equation*}
\binom{3N+k-4}{3N-4}
\leq
\frac{(3N+k-4)!}{k!} =
(3N+k-4)\cdot\ldots\cdot (k+1)\,.
\end{equation*}
This last product contains \((3N-4)\) terms each of which are smaller
than \((3N+k)\). Thus
\begin{equation*}
\binom{3N+k-4}{3N-4} \leq (3N+k)^{3N-4} \leq C_3 k^{3N}\,,
\end{equation*}
for some \(C_3\) (depending on $N$) and all \(k\geq 1\).
It follows that, for \(|x|<1/(4 M_2^2)\), \(|x'-x_0'|<1/(2M_2)\),
\begin{align*}
\Big|\sum_{\gamma\in\N^{3N-3}}&\sum_{n=0}^{\infty}
\sum_{|\alpha|=n}a_{\alpha}(\gamma)x^{\alpha}(x'-x_0')^{\gamma}\Big|
\\&\le R C_2
\sum_{k=0}^{\infty}\sum_{\gamma\in\N^{3N-3},|\gamma|=k}\sum_{n=0}^{\infty}
(2M_2^2)^n |x|^n
M_2^{|\gamma|}|x'-x_0'|^{|\gamma|}
\\&\le R C_2C_3
\Big(\sum_{k=0}^{\infty}\frac{k^{3N}}{2^{k}}\Big)
\Big(\sum_{n=0}^{\infty}\frac{n}{2^n}\Big)<\infty\,,
\end{align*}
and so, with \(a_{\alpha\gamma}:=a_{\alpha}(\gamma)\),
\begin{align}
\label{eq:def-first-fct}
\psi^{(1)}(x,x'):=
\sum_{\gamma\in\N^{3N-3}}
\sum_{\alpha\in\N^3}a_{\alpha\gamma}x^{\alpha}(x'-x_0')^{\gamma}
\end{align}
defines a real analytic function in a neighborhood of $(0,x_0')$.
Similarly, with \(b_{\alpha\gamma}:=b_{\alpha}(\gamma)\),
\begin{align}
\label{eq:def-second-fct}
\psi^{(2)}(x,x'):=\sum_{\gamma\in\N^{3N-3}}
\sum_{\alpha\in\N^3}b_{\alpha\gamma}x^{\alpha}(x'-x_0')^{\gamma}
\end{align}
defines a real analytic function in a neighborhood of $(0,x_0')$. From
the above observations and from \eqref{eq:expansion for new u},
\eqref{eq:IndexK}, \eqref{eq:some expansion}, \eqref{eq:aalphas} and
\eqref{eq:balphas} it follows that
\begin{align}
\label{eq:second-to-last-form}\nonumber
\psi^{(1)}&(K(y),x')+|K(y)|\,\psi^{(2)}(K(y),x')
\\&=\nonumber
\sum_{\gamma\in\N^{3N-3}}\sum_{n=0}^{\infty}
\sum_{\ell=0}^{[n/2]}|K(y)|^{2\ell}\,
Y^{(2n),\gamma}_{n-2\ell}(K(y))(x'-x_0')^{\gamma}
\\&\ \ +\sum_{\gamma\in\N^{3N-3}}|K(y)|
\nonumber
\sum_{n=0}^{\infty}\sum_{\ell=0}^{[(n-1)/2]}|K(y)|^{2\ell}\,
Y^{(2n),\gamma}_{n-(2\ell+1)}(K(y))(x'-x_0')^{\gamma}
\\&=\sum_{\gamma\in\N^{3N-3}}\varphi_{\gamma,K}(y)(x'-x_0')^{\gamma}
=u(y,x')=\psi(K(y),x')\,,
\end{align}
and so, by the surjectivity of \(K\),
\begin{align}
\label{eq:last-formula}
\psi(x,x')=\psi^{(1)}(x,x')+|x|\,\psi^{(2)}(x,x')\,,
\end{align}
with \(\psi^{(i)}, i=1,2\), real analytic on
\begin{equation*}
\big\{(x,x')\in\R^{3N}\,\big|\,|x|<1/(4 M_2^2)\,,\
|x'-x_0'|<1/(2M_2)\big\}\,.
\end{equation*}
This finishes the proof of Proposition~\ref{prop:many}.
\end{proof}
\begin{acknowledgement}
Financial support from the
Danish Natural Science Research
Council, under the grant Mathematical Physics and Partial Differential
Equations (T\O S), and from
the European Science Foundation Programme {\it Spectral Theory and Partial
Differential Equations} (SPECT),
is gratefully acknowledged. SF is
supported by a Skou Grant and a Young Elite Researcher Award from the Danish Research
Council.
The authors wish to thank Bernard Helffer
(SF, T\O S), G\"unther H\"ormann (MHO), Gerd Grubb (T\O S), Andreas
Knauf (T\O S), and Heinz Siedentop (T\O S)
for helpful discussions.
\end{acknowledgement}
\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR }
% \MRhref is called by the amsart/book/proc definition of \MR.
\providecommand{\MRhref}[2]{%
\href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2}
}
\providecommand{\href}[2]{#2}
\begin{thebibliography}{10}
\bibitem{JeckoKnauf}
Fran\c{c}ois Castella, Thierry Jecko, and Andreas Knauf, \emph{Semiclassical
{R}esolvent {E}stimates for {S}chr\"odinger {O}perators with {C}oulomb
{S}ingularities}, Ann. Henri Poincar\'e ({\it Online First}) (2008).
\bibitem{Flad1}
Heinz-J{\"u}rgen Flad, Wolfgang Hackbusch, and Reinhold Schneider, \emph{Best
{$N$}-term approximation in electronic structure calculations. {I}.
{O}ne-electron reduced density matrix}, M2AN Math. Model. Numer. Anal.
\textbf{40} (2006), no.~1, 49--61.
\bibitem{Flad2}
\bysame, \emph{Best {$N$}-term approximation in electronic structure
calculations. {II}. {J}astrow factors}, M2AN Math. Model. Numer. Anal.
\textbf{41} (2007), no.~2, 261--279.
\bibitem{CMP1}
S{\o}ren Fournais, Maria Hoffmann-Ostenhof, Thomas Hoffmann-Ostenhof, and
Thomas {\O}stergaard~S{\o}rensen, \emph{The {E}lectron {D}ensity is {S}mooth
{A}way from the {N}uclei}, Comm. Math. Phys. \textbf{228} (2002), no.~3,
401--415.
\bibitem{Taxco}
\bysame, \emph{On the regularity of the density of electronic wavefunctions},
\textbf{307} (2002), 143--148.
\bibitem{Ark}
\bysame, \emph{Analyticity of the density of electronic wavefunctions}, Ark.
Mat. \textbf{42} (2004), no.~1, 87--106.
\bibitem{CMP2}
\bysame, \emph{Sharp {R}egularity {R}esults for {C}oulombic {M}any-{E}lectron
{W}ave {F}unctions}, Comm. Math. Phys. \textbf{255} (2005), no.~1, 183--227.
\bibitem{AHP2}
\bysame, \emph{Non-{I}sotropic {C}usp {C}onditions and {R}egularity of the
{E}lectron {D}ensity of {M}olecules at the {N}uclei}, Ann. Henri Poincar\'e
\textbf{8} (2007), no.~4, 731--748.
\bibitem{3der}
S{\o}ren Fournais, Maria Hoffmann-Ostenhof, and Thomas
{\O}stergaard~S{\o}rensen, \emph{Third derivative of the one-electron density
at the nucleus}, {\tt arXiv:math-ph/0607004v1} (2006).
\bibitem{GerardKnauf}
Christian G{\'e}rard and Andreas Knauf, \emph{Collisions for the {Q}uantum
{C}oulomb {H}amiltonian}, Comm. Math. Phys. \textbf{143} (1991), no.~1,
17--26.
\bibitem{GT}
David Gilbarg and Neil~S. Trudinger, \emph{Elliptic partial differential
equations of second order}, Classics in Mathematics, Springer-Verlag, Berlin,
2001, Reprint of the 1998 edition.
\bibitem{grusin2}
V.~V. Gru{\v{s}}in, \emph{A certain class of elliptic pseudodifferential
operators that are degenerate on a submanifold}, Mat. Sb. (N.S.) \textbf{84
(126)} (1971), 163--195, (English translation: Math. USSR-Sb. 13 (1971),
155--185).
\bibitem{HelfferEtAl}
Bernard Helffer, Andreas Knauf, Heinz Siedentop, and Rudi Weikard, \emph{On the
absence of a first order correction for the number of bound states of a
{S}chr\"odinger operator with {C}oulomb singularity}, Comm. Partial
Differential Equations \textbf{17} (1992), no.~3-4, 615--639.
\bibitem{HelfferSiedentop1}
Bernard Helffer and Heinz Siedentop, \emph{Regularization of atomic
{S}chr\"odinger operators with magnetic field}, Math. Z. \textbf{218} (1995),
no.~3, 427--437.
\bibitem{HelfferSiedentop2}
\bysame, \emph{A generalization of the {K}ustaanheimo-{S}tiefel transform for
two-centre systems}, Bull. London Math. Soc. \textbf{28} (1996), no.~1,
33--42.
\bibitem{Hill}
Robert~Nyden Hill, \emph{On the analytic structure of the wave function for a
hydrogen atom in an analytic potential}, J. Math. Phys. \textbf{25} (1984),
no.~5, 1577--1583.
\bibitem{Hopf}
Heinz Hopf, \emph{\"{U}ber die {A}bbildungen der dreidimensionalen {S}ph\"are
auf die {K}ugelfl\"ache}, Math. Ann. \textbf{104} (1931), no.~1, 637--665.
\bibitem{Hormander}
Lars H{\"o}rmander, \emph{Linear partial differential operators}, Third revised
printing. Die Grundlehren der mathematischen Wissenschaften, Band 116,
Springer-Verlag, Berlin, 1976.
\bibitem{Jost}
Res Jost, \emph{Das {H}-{A}tom nach {K}ustaanheimo-{S}tiefel-{S}cheifele},
Lecture notes by Hanruedi Tschudi of a course by Res Jost on theoretical
physics for mathematicians, Winter Semester 1974/75, ETH-Z\"urich, 1975.
\bibitem{kato57}
Tosio Kato, \emph{On the eigenfunctions of many-particle systems in quantum
mechanics}, Comm. Pure Appl. Math. \textbf{10} (1957), 151--177.
\bibitem{katobook}
\bysame, \emph{Perturbation theory for linear operators}, Classics in
Mathematics, Springer-Verlag, Berlin, 1995, Reprint of the 1980 edition.
\bibitem{Knauf}
Andreas Knauf, \emph{The {$n$}-centre problem of celestial mechanics for large
energies}, J. Eur. Math. Soc. (JEMS) \textbf{4} (2002), no.~1, 1--114.
\bibitem{Krantz}
Steven~G. Krantz and Harold~R. Parks, \emph{A primer of real analytic
functions}, second ed., Birkh\"auser Advanced Texts: Basler Lehrb\"ucher.
[Birkh\"auser Advanced Texts: Basel Textbooks], Birkh\"auser Boston Inc.,
Boston, MA, 2002.
\bibitem{Kustaanheimo}
Paul~E. Kustaanheimo, \emph{Spinor regularization of the {K}epler motion}, Ann.
Univ. Turku. Ser. A I No. \textbf{73} (1964), 7.
\bibitem{KS}
Paul~E. Kustaanheimo and Eduard~L. Stiefel, \emph{Perturbation theory of
{K}epler motion based on spinor regularization}, J. Reine Angew. Math.
\textbf{218} (1965), 204--219.
\bibitem{BrisLions}
Claude Le~Bris and Pierre-Louis Lions, \emph{From atoms to crystals: a
mathematical journey}, Bull. Amer. Math. Soc. (N.S.) \textbf{42} (2005),
no.~3, 291--363 (electronic).
\bibitem{Mueller}
Claus M{\"u}ller, \emph{Spherical harmonics}, Lecture Notes in Mathematics,
vol.~17, Springer-Verlag, Berlin, 1966.
\bibitem{RS2}
Michael Reed and Barry Simon, \emph{Methods of modern mathematical physics.
{II}. {F}ourier {A}nalysis, {S}elf-{A}djointness}, Academic Press [Harcourt
Brace Jovanovich Publishers], New York, 1975.
\bibitem{Stein}
Elias~M. Stein and Guido Weiss, \emph{Introduction to {F}ourier analysis on
{E}uclidean spaces}, Princeton University Press, Princeton, N.J., 1971,
Princeton Mathematical Series, No. 32.
\bibitem{stiefel}
Eduard~L. Stiefel and Gerhard Scheifele, \emph{Linear and regular celestial
mechanics. {P}erturbed two-body motion, numerical methods, canonical theory},
Springer-Verlag, New York, 1971, Die Grundlehren der mathematischen
Wissenschaften, Band 174.
\bibitem{y1}
Harry Yserentant, \emph{On the regularity of the electronic {S}chr\"odinger
equation in {H}ilbert spaces of mixed derivatives}, Numer. Math. \textbf{98}
(2004), no.~4, 731--759.
\bibitem{y2}
\bysame, \emph{Sparse grid spaces for the numerical solution of the electronic
{S}chr\"odinger equation}, Numer. Math. \textbf{101} (2005), no.~2, 381--389.
\bibitem{y3}
\bysame, \emph{The hyperbolic cross space approximation of electronic
wavefunctions}, Numer. Math. \textbf{105} (2007), no.~4, 659--690.
\end{thebibliography}
\end{document}
---------------0806060316735--
|
http://www.isska.ch/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%20115%20ORDER%20BY%20first_author%2C%20author_count%2C%20author%2C%20year%2C%20title&client=&formType=sqlSearch&submit=Cite&viewType=&showQuery=0&showLinks=1&showRows=15&rowOffset=&wrapResults=1&citeOrder=&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg= | isska.ch | CC-MAIN-2023-14 | application/x-latex | application/x-latex | crawl-data/CC-MAIN-2023-14/segments/1679296945218.30/warc/CC-MAIN-20230323225049-20230324015049-00137.warc.gz | 75,702,532 | 1,355 | %&LaTeX
\documentclass{article}
\usepackage[latin1]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\begin{document}
\begin{thebibliography}{1}
\bibitem{Bianchi-Demicheli_etal2016} Bianchi-Demicheli, F., Tantardini, L., Oppizzi, N., \& Blant, M. (2016). D{\'e}couverte d{\textquoteright}un bouquetin (Capra ibex) et de deux ours bruns (Ursus arctos) pl{\'e}istoc{\`e}nes dans des grottes du Monte Generoso. \textit{Bollettino della Societ{\`a} Ticinese di scienze naturali}, \textit{104}, 71--75.
\end{thebibliography}
\end{document}
|
https://dlmf.nist.gov/10.22.E52.tex | nist.gov | CC-MAIN-2021-10 | application/x-tex | application/x-tex | crawl-data/CC-MAIN-2021-10/segments/1614178356232.19/warc/CC-MAIN-20210226060147-20210226090147-00294.warc.gz | 299,542,033 | 816 | \[\int_{0}^{\infty}J_{\nu}\left(bt\right)\exp\left(-p^{2}t^{2}\right)\mathrm{d}t%
=\frac{\sqrt{\pi}}{2p}\exp\left(-\frac{b^{2}}{8p^{2}}\right)I_{\ifrac{\nu}{2}}%
\left(\frac{b^{2}}{8p^{2}}\right),\] |
https://git.informatik.fh-nuernberg.de/Linux-Infrastruktur-Automatisierung/Dokumentation/-/raw/42bfbbf8b0b5826a7b0bf63eec82122d5b70990b/Bericht.tex?inline=false | fh-nuernberg.de | CC-MAIN-2020-45 | text/plain | application/x-tex | crawl-data/CC-MAIN-2020-45/segments/1603107904287.88/warc/CC-MAIN-20201029124628-20201029154628-00458.warc.gz | 347,693,300 | 17,720 | \documentclass[12pt, a4paper, oneside, ngerman]{report}
%Import Packages
%set document layout
\usepackage[a4paper, left=3cm, right=2cm, top=2cm, dvipdfm]{geometry}
\usepackage[german,main=ngerman]{babel}
%format font
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{titlesec}
\usepackage{url}
%box around verbatim
\usepackage{fancyvrb}
% Use Links
\usepackage{hyperref}
% for code sections
\usepackage{listings}
\usepackage{color}
% configuring code sections
% change default language in Document with \lstset{language=Python}
% Code in \begin{lstlisting} Code \end{lstlisting}
\definecolor{dkgreen}{rgb}{0,0.6,0}
\definecolor{gray}{rgb}{0.5,0.5,0.5}
\definecolor{mauve}{rgb}{0.58,0,0.82}
\lstset{frame=tb,
language=bash
aboveskip=3mm,
belowskip=3mm,
showstringspaces=false,
columns=flexible,
basicstyle={\small\ttfamily},
numbers=none,
numberstyle=\tiny\color{gray},
keywordstyle=\color{blue},
commentstyle=\color{dkgreen},
stringstyle=\color{mauve},
breaklines=true,
breakatwhitespace=true,
tabsize=3
}
%BibTeX for References
\usepackage[
backend=biber,
style=alphabetic,
citestyle=alphabetic
]{biblatex}
\bibliography{libbib.bib}
\title{Automatisches Deployment von openSUSE Leap\\
mit Salt und PXE\\
Projektarbeit}
\author{Jannik Main, Sarah Julia Kriesch}
\begin{document}
\maketitle
%Inhaltsverzeichniss generieren
\tableofcontents
\newpage
\chapter{Vorwort}
Die Wartung und Instandhaltung von Laboren ist ein oft komplexes und
sehr zeit-konsumierendes Unterfangen.\\
Hierbei ist es wichtig, eine Balance zwischen neuesten Features und
Softwareupdates für die Nutzer, hier vorwiegend Studierende,
bereitzustellen und nichtsdestotrotz eine grundsätzliche Stabilität und
Sicherheit zu gewährleisten.\\
Bei der Wahl des Betriebssystems werden deshalb meist LTS- Long Term
Support Versionen eingesetzt, die über einen langen Zeitraum auf
Stabilität getestet wurden und sich insbesondere für Serversysteme
eignen.\\
Auch die Konfiguration und Anpassung auf die Hochschulinterne
Infrastruktur, etwa der Zugriff auf das Active Directory und die
Möglichkeit den Labor-eigenen Druckdienst über ein Ticket zu verwenden
stellt hinsichtlich der Einrichtung eine Herausforderung dar.\\
Zuletzt sollte auch die auf den Rechnern verfügbare Software, etwaige
IDE's wie die Jetbrains-Produkte oder eine TeX Live IDE der Software
entsprechen, die die Studierenden bereits einsetzen können und mit der
sie oft in Kontakt kommen. \\
In Anbetracht der Entwicklungsgeschwindigkeit heutiger Software stellt
ein Automatisches Deployment deshalb eine wichtige Hilfestellung für
Administratoren dar.\\
Mit unserem Projekt möchten wir genau hier ansetzen, und den
Adminstrationsaufwand für unser fakultätseigenes Linux-Labor auf ein
Minimum reduzieren. Hierdurch soll auch der Aufwand für den
Updatevorgang aller Rechner so weit reduziert werden, das dies
problemlos unter dem Semester möglich wäre.
\chapter{Ist-Analyse}
Momentan ist das Linux-Labor mit Ubuntu eingerichtet.
Die Systeme wurden manuell installiert und konfiguriert.
Die Authentifizierung mit dem Active Directory mit Kerberos und
die Einbindung der Windows-Laufwerke wurden manuell eingepflegt. Die
Home-Verzeichnisse wurden dort nicht mit eingebunden, so dass so gut
wie nie ein Student dort seine Daten vom Linux-Labor aus abgelegt hat.\\
Der Drucker wurde mit Cups überall eingerichtet und hinterher so
konfiguriert, dass das Druck-Budget über Kerberos-Tickets bei den
entsprechenden Studenten abgebucht wird.
\chapter{Projektziel}
Alle Linux-Systeme müssen ans Active Directory angebunden werden,
damit sich jeder Informatik-Student dort anmelden kann. Für die
automatische Erstinstallation ist ein PXE-Server mit iso-Image notwendig.
Dann wird über das Netzwerk gebootet und die Installation durchgeführt. \\
Die Installation und Konfiguration soll automatisch mit Salt eingerichtet
werden, so dass auch Upgrades automatisch durchgeführt werden können.
Dafür muss dann zum Schluss nur noch die Versionsnummer angepasst werden.
Somit soll auch die Pflege/Wartung der Systeme erleichtert werden. \\
Alle Studenten arbeiten auf den Windows-Rechnern auf ihrem Windows-Laufwerk,
wo alle Daten abgespeichert werden. Das soll auch unter Linux mit cifs
möglich sein, so dass die Studenten alle wichtigen Daten dort ablegen
können und nicht an einen Rechner gebunden sind.
\chapter{Salt}
\section{Einführung}
Salt ist eine Open-Source-Konfigurationsmanagement-Software und
Remote Code Execution Engine, welche uns ein automatisches
Deployment der vorgesehenen Pakete ermöglicht.\\
Die von der Firma SaltStack geschriebene Software besteht im
wesentlichen aus zwei Teilen: dem Salt-Master und den Salt-Minions.
Beide besitzen zwei asymetrische Schlüssel, über den sie sich den
anderen gegenüber authentifizieren und mit ihnen kommunzieren
können.\\
\section{Salt-Master}
Der Salt-Master gibt Instruktionen an die Minions weiter.
Um dies zu ermöglichen, ist bei ihm eine Liste der aktuell
verbundenen Minions hinterlegt.
Diese können, entweder in Summe oder einzeln, mittels der
hinterlegten Konfiguration oder für direkte Shell-Befehlsausführung
angewiesen werden.\\
Die auf drei Verzeichnisse aufgeteilte Konfigurationen beinhaltet
die Liste der Pakete und deren Installationsanleitung, sowie
zusätzliche Konfiguration selbiger.
Auch können hier Betriebssystem-, oder im Linux-Fall
distributionsspezifische, sowie umgebungsabhängige
Installationskonfigurationen hinterlegt werden (Von hier an nur noch
als distibutionsspezifische Konfigurationen bezeichnet). Dies ist
z.B.\ bei variierenden Paketnamen ungemein hilfreich.\\
Die Dateiendung ist, soweit nicht genauer spezifiziert, eine
\text{*}.sls.
Die drei verwendeten Verzeichnisse heißen standardmäßig salt,
pillar, formulas.
\subsection{salt}
Im salt-Verzeichnis werden die distributionsspezifischen Profile
angelegt.
Wichtig ist hier insbesondere die top.sls-Datei, welche bei einem
simplen state.apply abgearbeitet wird.
Folgt diesem noch ein Dateiname, so wird diese im
salt-Verzeichnis erwartet.\\
Das Verzeichnis ist für normale Paketinstallationen über die
standard-Paketinstaller gedacht, wodurch eine simple Paketliste
ohne weitere Konfigurationen hinreichend ist. \\
Genauso weren mit include die Formulas mit eingebunden und
entsprechende Installationen von dort aus ausgeführt.
\subsection{pillar}
Das Pillar-Verzeichnis steht für Variablen, Sensitive Daten,
Konfigurationen und sonstige zu übertragende Daten zur
Verfügung. Jedes von SaltStack akzeptierte Formula enthält
eine Datei mit dem Namen pillar.example.sls, die man als Vorlage
ins Pillar-Verzeichnis kopieren und in die top.sls mit einbinden
kann. Anschließend werden dann die Beispiel-Einträge mit den
eigenen Systemkonfigurationen angepasst, so dass über das
entsprechende Salt-Formula die angepassten Konfigurations-Dateien
automatisch hinzugefügt werden.
\subsection{formulas}
Formulas sind eine Konfigurations-/Installationsschnittstelle für
aufwendigere Pakete, welche meist nicht über einen Paketmanager
installierbar oder konnfigurierbar sind. Mit Hilfe von Formulas
lassen sich aufwändige Installationsroutinen mit automatischen
Konfigurationen auf Deployments in wenigen Minuten reduzieren. \\
Es wurden folgende Formulas aus verschiedenen
github-Repositories verwendet:
\begin{itemize}
\item Java: \\
\url{https://github.com/salt-formulas/salt-formula-java}
\item Jetbrains CLion: \\
\url{https://github.com/saltstack-formulas/jetbrains-clion-formula}
\item Jetbrains Intellij-IDEA:\\
\url{https://github.com/saltstack-formulas/jetbrains-intellij-formula}
\item Jetbrains PHPStorm: \\
\url{https://github.com/saltstack-formulas/jetbrains-phpstorm-formula}
\item Kerberos: \\
\url{https://github.com/saltstack-formulas/kerberos-formula}
\item Samba mit winbind-AD:\\
\url{https://github.com/saltstack-formulas/samba-formula}
\item SSSD:\\
\url{https://github.com/colin-stubbs/salt-formula-sssd}
\end{itemize}
\\
Diese Formulas werden in der Master-Konfiguration
/etc/salt/master unter der Kategorie
file\textunderscore{}roots alle
aufgelistet, so dass alle Installationen und Konfigurationen aus
dem Verzeichnis /srv/formulas/
aufgerufen werden können. Jedes Forumula hat eine README-Datei,
wo die Verwendung der Optionen (states) für die sls-Datei im
salt-Verzeichnis mit aufgelistet ist. Zum Beispiel hat sssd die
States sssd und sssd.sysauth. Weil sssd zusammen mit dem
Kerberos-Formula zur Kerberos-Initialisierung gebraucht wird,
wurde die kerberosIn.sls unter /srv/salt/ angelegt und für
sssd folgender Eintrag mit angelegt:\\
\begin{Verbatim}[frame=single]
include:
-\ sssd
-\ sssd.sysauth
\end{Verbatim}
\\
Mit dem include wird sicher gestellt, dass diese Optionen zur
Installation und Konfiguration ausgeführt werden.
\subsection{Passwort-Verschlüsselung}
Bisher wurde die Erst-Authentifizierung am Kerberos-Server manuell
durchgeführt. Viele Salt-Formulas haben auch die Option der
Benutzer-Authentifizierung. Allerdings werden in den Beispielen
dann die Passwörter als Klartext mit angegeben. Auf der Konferenz
FrOSCon haben wir den Tipp bekommen die Passwörter mit gpg zu
verschlüsseln. Das wird auch an der TU Chemnitz so gehandhabt.\\
Nach diesem Vorschlag wurde uns von Herrn Fischer ein Benutzer
erstellt.\\
Salt hat eine Option mit gpg Passwörter zu entschlüsseln.
Dafür generiert man mit gpg auf dem Salt-Master ein Schlüsselpaar,
worauf Salt ohne Passwort zugreifen kann. Hier gab es das Problem,
dass mit der Aktualisierung auf gpg2 der Befehl geändert hat,
weil es aus Sicherheitsgründen besser ist immer ein Passwort
mit zu übergeben. \\
Dann kann mit Hilfe des Schlüssels das entsprechende Passwort
verschlüsselt werden. Die daraus resultierende PGP-Message wird in
Base64 kodiert ausgegeben und kann dann so als Multiline-String
unterhalb einer Pipe in eine sls-Datei eingefügt werden. \\
Damit Salt weiß, dass hier gpg zur Entschlüsselung verwendet werden soll,
wird in der master-Konfiguration gpg\textunderscore{}keydir und
decrypt\textunderscore{}pillar entkommentiert.
Dort werden dann das Verzeichnis vom Schlüssel
und der entsprechende Pillar-Eintrag mit angegeben. So kann dann
der Salt-Master mit Hilfe von gpg das Passwort aus der PGP-Message lesen.\\
Eine ausführliche Anleitung wurde dazu als Blog-Artikel
veröffentlicht\cite{sarah:gpg_salt}.
\section{Salt-Minion}
\label{sec:salt_min}
Der Salt-Minion ist die Clientseitige Software, welche auf den
automatisch zu konfigurierenden Linux-Rechnern installiert werden
muss. Er führt die vom Salt-Master erhaltenen Befehle aus und
konfiguriert somit das System nach der hinterlegten Anleitung.\\
Für die Konfiguration des Salt-Minions muss die IP des Salt-Masters
und dessen Fingerabdruck in der Konfigurationsdatei /etc/salt/minion
hinterlegt werden. Anschließend muss der Minion noch vom Master
hinzugefügt werden. Ersteres soll über das OpenBuildService
PXE-image bereits automatisiert geschehen.
\section{Software-Stack}
Die durch Salt verwaltete und konfigurierte Software ist im
folgenden mit einem kurzen Erfahrungsbericht und weiterführenden,
wichtigen Hinweisen kurz aufgezählt.
\subsection{Java}
Die Java Runtime Environment und das Java Software Development
Kit sind zwei grundlegende Anforderungen für Universitätsrechner
für Studierende mit Programmierkenntnissen.
Leider mussten wir jedoch feststellen, das Java und openSUSE
sich nach wie vor nur schwer zur Zusammenarbeit überreden
lassen. Bis jetzt gibt es einige Anleitungen, wie man Java
manuell mit Aufwand installieren kann. \\
Deshalb wurde hier ein Salt-Formula für Java mit ausgewählt, so dass
es mit der aktuellsten Version installiert und konfiguriert wird.
\subsection{JetBrains}
Um die Softwareentwicklung den Studierenden möglicht einfach zu
machen, installierten wir einige IDEs. Die JetBrains-Produkte
erfreuen sich hierbei unter den Studenten an zunehmender
Beliebtheit, da diese ihnen über eine Studentenlizen auch auf
ihren Privatrechnern kostenlos zur Verfügung steht.
Neben dem Standartumfang sind sie besonders für ihre
CodeCompletion-Funktionen bekannt.\\
Wir haben uns hierbei für drei IDEs entschieden:
\begin{itemize}
\item Intellij für Java-Entwicklung
\item PhpStorm für Webentwicklung
\item CLion für C/C++ Entwicklung
\end{itemize}
\subsubsection{Installation}
Die IDEs werden über die zugehörigen Formulare automatisch
installiert und stehen den Studierenden zur Verfügung.\\
Für Intellij IDEA musste weiterhin Java installiert werden.
\subsubsection{Lizensierung}
Um die IDEs nutzen zu können, muss der Hochschuleigene
Lizenzserver verwendet werden.\\
Um die Webaddresse des Lizenzservers automatisiert zu
hinterlegen, muss im HOME-Verzeichnis der Studierenden ein
Folgende Dateistruktur für jede IDE angelegt werden:
\textquotedblleft.\textless{}IDE\textgreater{}\textless{}Versionsnummer\textgreater{}/config/\textless{}IDE\textunderscore{}in\textunderscore{}Kleinbuchstaben\textgreater{}.key\textqoutedblright{}
erstellt werden.\\
Hierfür werden diese unter /etc/jetbrains erstellt und beim
Login in das HOME-Verzeichnis der Studierenden kopiert.
\subsubsection{Erfahrungsbericht}
Problematisch war hier insbesondere das erstellen der
Verzeichnisse, da hierfür die Versionsnummer ausgelesen
werden musste.\\
Nach einigen anfänglich erfolglosen Versuchen diese aus
Konfigurationsdateien zu extrahieren entwickelten
wir ein Shellskript, welches diese Information aus den
Ordnernamen unter /usr/local/jetbrains extrahiert.
\subsection{Visual Studio Code}
Neben den JetBrains IDEs erfreut sich auch VisualStudio Code
immer größerer Beliebtheit. Da dieses, im Gegensatz zu
VisualStudio, OpenSource-Softare ist, wollten wir auch dieses
Tool zur Verfügung stellen.
\subsubsection{Installation}
Für VisualStudio Code existiert ein Formula.\\
Bis auf den im Erfahrungsbericht angesprochenen Bug verlief
die Installation hiermit problemlos.
\subsubsection{Erfahrungsbericht}
Da für die Installation ein zusätzliches Repository zum
Paketmanager zypper hinzugefügt werden sollte, fanden wir
hier einen Bug.\\
Entgegen der Annahme importiert rpm den GPG-Schlüssel nicht
automatisch mit in seinen Schlüsselspeicher. Die Folge war
dementsprechend, das das Paket von einem für rpm unbekannten
GPG-Schlüssel signiert und somit zurückgewiesen wurde.\\
Unser Workaround besteht darin, mittels Salt den rpm-Befehl
seperat auszuführen und somit den Schlüssel
hinzuzufügen.\cite{github:zypper}
\subsection{Latex}
Latex ist die Grundlage für wissenschaftliches Arbeiten und
Dokumentationen an der Hochschule. Deshalb sollte auf jedem Linux-Client
ein Latex-Editor mit allen notwendigen Features von Latex mit
installiert werden.
\subsubsection{texlive}
Es gibt unterschiedliche Pakete von texlive für Latex zur Auswahl.
Diese bringen jeweils einen unterschiedlichen Umfang an
Funktionalitäten mit.\\
Damit es zu keinen Problemen beim Kompilieren
kommt und weil der Festplattenplatz der Clients im Labor mehr
als ausreicht, wird hier das Paket texlive-scheme-full verwendet.
\subsubsection{Texmaker}
Während des Studiums wurden schon Erfahrungen mit Latex gesammelt
und Texmaker hat sich als hilfreicher Lieblings-Editor herausgestellt.
Deshalb wird im latex.sls Texmaker als Editor mit installiert.
Somit kann in der Zukunft auch im Linux-Labor mit Latex
gearbeitet werden.
\chapter{Kerberos}
Kerberos wird zur Authentifizierung mit dem Active Directory gebraucht.
Genauso ist dieser Dienst zur Ticket-Generierung beim Drucken und zur
Geldabbuchung bei den Studenten-Accounts benötigt. \\
Weil zur Benutzer-Authentifizierung nicht nur die Datei krb5.conf
konfiguriert werden und zusätzlich der SSSD-Client eingerichtet werden muss,
werden neben dem Kerberos-Formula noch das SSSD-Formula, das Samba-Formula
und das PAM-Formula gebraucht.
\section{SSSD-Formula}
Der SSSD-Client ist die Grundlage des Usermanagements und der
Systemauthentifizierung am Active Directory auf den Linux-Clients.
Das sssd-Formula wurde bisher nur mit Debian, Ubuntu und Red Hat getestet.
Deshalb musste in der Datei map.jinja Suse als Betriebssystemkategorie
hinzugefügt werden. Genauso wurde dort sssd als notwendiges Paket mit
seinem Daemon als service mit angegeben. \\
Leider wurde dieses Formula bisher auch nur mit LDAP verwendet und dafür
bereitgestellt. Auch hier mussten die Konfigurationen dann erweitert werden. \\
Hinzu kommt eine spät genannte Anforderung, dass sich an den Rechnern
nur Informatik-Studenten anmelden können sollen. Dafür muss neben der
Anmeldung mit dem Active Directory der LDAP-Baum mit angegeben und
überprüft werden, ob der Benutzer in der Gruppe ou=Students ist. \\
Bei diesem Formula kann man die Möglichkeit der einfachen Erweiterbarkeit
der sssd.conf mit eigenen Parametern positiv hervorheben. Somit war es
möglich den Eintrag ldap durch ad zu ersetzen und weitere Optionen mit
anzugeben, die dann mit übernommen wurden. \\
Damit der SSSD-Daemon funktioniert, werden keytab-Dateien gebraucht, die
mit dem Kerberos-Formula mit eingebunden werden können.
\section{Kerberos-Formula}
Das Kerberos-Formula wird schon für openSUSE angeboten. Allerdings wird
mit der Option kerberos.keytab nur die Einbindung schon existierender
keytab-Dateien mit angeboten, so dass sich der Benutzer für die
unterschiedlichen Dienste im Netzwerk, wie z.B. ssh und cifs mit unseren
Windows-Laufwerken, automatisch direkt anmelden kann. Als Minimum wird die
Standard-Datei krb5.keytab gebraucht. Leider haben unsere Administratoren
die Anforderung, dass diese keytab-Dateien automatisch mit der ersten
Anmeldung unseres Benutzers mit angelegt werden. \\
Dafür wird noch eine Konfiguration des samba-clients und folgende Befehle
automatisiert gebraucht:
\lstset{language=bash}
\begin{lstlisting}[frame=single]
net ads join -U ${Benutzer}%${Passwort}
net ads keytab list
klist -k
net ads list
net ads kerberos
net ads keytab add cifs ipp nfs ftp ssh http -U ${Benutzer}
klist -k
\end{lstlisting}
Nach dem Joinen des Principals wird die Keytab-Liste generiert und
mit klist bestätigt. Dann wird diese zu Kerberos hinzugefügt.
Genauso werden noch alle notwendigen Dienste in diese Datei geladen und
mit klist gemerged.
\\
\\
Weil man so eine automatische Generierung der keytab-Dateien mit dem
Kerberos-Formula als ToDo in der Zukunft geplant hatte, wurde dieses
Feature von uns implementiert und mit in die keytab.sls integriert. \\
Außerdem ist wie das SSSD-Formula dieses Formula auf LDAP statt Active Directory
ausgelegt, weshalb ein Kerberos-Paket für Active Directory mit in der Liste
für Suse-Systeme aufgenommen wurde. Genauso konnte hier die Liste der
Parameter für die Konfigurationen ohne Probleme angepasst und erweitert
werden. Die notwendigen Daten wurden von den Admins bereit gestellt.
\section{Samba-Formula}
Der Benutzer vom Kerberos kann ohne Samba-Konfiguration nicht
funktionieren. Deshalb wurde noch das Samba-Formula mit hinzugefügt. \\
Das Samba-Formula installiert nicht nur den samba-client, sondern konfiguriert die smb.conf und
nsswitch.conf so, dass die Kerberos-Authentifizierung mit aktiviert wird.
Genauso bietet dieses Formula die Funktionalität, dass der erste
Hauptbenutzer einer Domain joinen kann und entsprechend den Windows-Laufwerken
die Home-Verzeichnisse mit angelegt werden. \\
Somit ist das Samba-Formula nicht nur für Kerberos hilfreich, sondern
erfüllt schon zusätzliche Anforderungen mit, die eigentlich separat von
der Kerberos-Authentifizierung angegangen werden sollten. Außerdem
beinhaltet die smb.conf die Konfiguration, dass zum Drucken cups verwendet werden
soll, was schon zum Anfang des Projekts mit beschlossen wurde.
\section{PAM-Formula}
Das Windows-Laufwerk wurde bisher mit PAM und der Datei
pam\textunderscore{}mount\textunderscore{}conf.xml
mit Hilfe von cifs gemountet. Diese Datei wird mit dem PAM-Formula mit
eingebunden und konfiguriert.
\section{Fazit zu Kerberos}
Eigentlich erfordert ein anständiger Softwareentwicklungsprozess,
dass man ein Modul nach dem anderen einbindet und zuerst dessen Funktionalität
testet, bevor man die nächste Aufgabe angeht. Das sollte auuch hier
umgesetzt werden. Leider haben sich dann immer mehr Abhängigkeiten zwischen
den Formulas ergeben, weil eine manuelle Eingabe oder automatische Generierung
der keytab-Dateien gewünscht wurde. \\
Zuerst war nur geplant das sssd-Formula und das Kerberos-Formula zu verwenden,
weil diese die Grundlagen zur Kerberos-Authentifizierung bieten und alles
notwendige dafür bereitstellen. Dann stellte sich heraus, dass zum
Joinen die smb.conf und nsswitch.conf gebraucht werden und deshalb die
Integration der notwendigen Befehle im Kerberos-Formula fehlschlugen.
Deshalb kam dann noch das Samba-Formula dazu, womit die Kette der
Abhängigkeiten länger wurde. Allerdings wurden damit mehrere Anforderungen,
wie z.B. die Einbindung der Windows-Laufwerke und die Authentifizierung mit
der Generierung der Benutzer-Verzeichnisse, auf einmal erfüllt. \\
Allerdings hat das eine nicht vorhersehbare Komplexität mitgebracht,
die dann wieder einiges an Zeit der Umsetzung und Lösungsfindung gebraucht hat.
\chapter{openSUSE Image}
Damit ein möglichst aufwandsarmer Update-Vorgang durchgeführt werden
kann, sollen die Linux-Rechner ein openSUSE image von einem PXE-Server
während des Bootvorgangs laden.
Dies soll die Rechner auf dem neuesten Stand halten und auch das
hinzufügen neuer Rechner vereinfachen.
\section{SUSE Studio}
SUSE Studio stellte ein graphisches Frontend für das
Kommandozeileninterface kiwi dar, welches für die Erstellung von
images verwendet wird.
Leider war SUSE Studio zum Projektzeitpunkt nicht mehr öffentlich
verfügbar, weshalb besagte images nun über kiwi in Kombination mit
dem OpenBuildService gebaut werden müssen.
\section{kiwi}
Kiwi ist der Name des Kommandozeilentools, welches hinter SUSE
Studio stand.
Es unterstützt die Erstellung diverser image-Typen.\\
Die relevanten Dateien bestehen aus: einer Konfigurationsdatei
(.xml), einem (optionalen) Quellarchiv (meist tar.bz2), sowie
optionalen Shellskripten. Die hier gefundene Zusammenfassung kann
hier ausführlicher gefunden werden\cite{suse:kiwi}\\
Das Bauen von kiwi-images lässt sich in zwei Phasen aufteilen: Das
Generieren des Verzeichnisbaums und des images.
\subsection{Konfigurationsdatei}
Die Konfiguration des images erfolgt in einer XML-Syntax.
Für das Bauen auf dem Open Build Service muss jedoch die Datei auf
\text{*}.kiwi enden.
Sie ist in verschiedene Abschnitte gegliedert:\\
\subsubsection{description}
Dieser Abschnitt enthält Informationen über den Autor des
Paketes (Name, Kontakt), sowie weitere Informationen über das
Image.\\
In unserem Fall also:
\begin{Verbatim}[frame=single]
<description type="boot">
<author>Jannik Main</author>
<contact>[email protected]</contact>
<specification>
openSUSE Leap 15.0 PXE boot with salt-minion
</specification>
</description>
\end{Verbatim}
\subsubsection{preferences}
Hier wird kiwi konfiguriert. Optionen wie der eigentliche
Image-Typ, Firmwareart, Dateisystem oder zusätzliche Funktionen
können hier angegeben werden.\\
In unserem Fall wird in preferences weiterhin angegeben:\\
\begin{itemize}
\item version: Die fortlaufende Versionsnummer, welche zu
Releasezwecken oder kleineren Patches inkrementiert
wird.
\item packagemanager: Enthält den für die Distribution zu
verwendenden Paketmanager.
(zypper unter openSUSE, apt unter debian etc.)
\item locale/keytable/timezone: Enthält
Sprach-/Layout-/Zeiteinstellungen, um das System den
Preferenzen des Nutzers anzupassen.
\end{itemize}
\begin{Verbatim}[frame=single]
<preferences>
<type image="oem" boot="oemboot/suse-leap15.0" bootloader="grub2"
bootpartition="true" installpxe="true" bootprofile="default"
bootkernel="std" filesystem="ext4" firmware="efi"
kernelcmdline="splash"/>
<version>2.8.0</version>
<packagemanager>zypper</packagemanager>
<locale>en_US</locale>
<keytable>de</keytable>
<timezone>Europe/Berlin</timezone>
<rpm-excludedocs>true</rpm-excludedocs>
<rpm-check-signatures>false</rpm-check-signatures>
<bootsplash-theme>openSUSE</bootsplash-theme>
<bootloader-theme>openSUSE</bootloader-theme>
</preferences>
\end{Verbatim}
Besonders interessant sind hierbei die types-Attribute, deren
korrekte Konfiguration und Verständnis uns die meiste Zeit
gekostet haben. Deshalb sind diese noch einmal extra aufgeführt:
\subsubsection{perferences/type}
Die von uns derzeit verwendeten Parameter zielen auf ein
pxe-bootbares oem-image ab, welches den Kontent des Daten-images
auf die Festplatte kopiert.
\begin{itemize}
\item image: Dies definiert den Typ des images. Neben oem
kann hier beispielsweise auch iso eingetragen werden, um
eine iso-Datei zu erstellen (Was jedoch nicht mit den
restlichen Parametern kompatibel wäre).
\item boot, bootloader, bootpartition, bootkernel,
bootprofile: Hier wird die zu wählende Konfiguration
für den Bootvorgang bestimmt.
\item installpxe: Dieser essentiell wichtige Parameter teilt
kiwi mit, das wir ein oem-basiertes PXE-Image und kein
standart oem-Image haben möchten.
\item filesystem: Gibt das Dateisystem für das Datenimage
an.
\item firmware: Gibt an, ob ein BIOS/Legacy-bootbares oder
ein UEFI-bootbares Image erstellt wird.
\item kernelcmdline: Enthält Bootparameter für den Kernel.
\end{itemize}
Für weitere Informationen zu den verschiedenen, möglichen
Parametern, siehe\cite{suse:kiwi_schema} und
teilweise\cite{suse:kiwi}.
\subsubsection{user}
Enthält zu erstellende Nutzer.\\
An dieser Stelle haben wir den Root-Nutzer mit einem
Beispielpasswort eingefügt, welches, da es öffentlich sichtbar
ist, zwingend geändert werden sollte.
\subsubsection{repository}
Hier werden die Paketquellen, aus welchen der OpenBuildService
die zu installierenden Pakete beziehen soll, angegeben.
Alternativ können diese auch als Archiv im Projekt mitgeliefert
werden.
Ebenfalls möglich wäre das Kopieren und Modifizieren eines
bereits existierenden Paketes innerhalb des Projekts.
\subsubsection{packages}
Enthält die in das image zu integrierenden Pakete.
Neben den für die Distribution zwingend benötigten Paketen
liefern wir an dieser Stelle noch einen konfigurierten
Salt-Minion mit, mittels dessen wir, wie in
\hyperref[sec:salt_min]{Sektion Salt} erwähnt, die weitere
Installation/Konfiguration vornehmen können.
\subsection{Quellarchiv}
Die Quellrepositories müssen alle Pakete beinhalten, die das image
beinhalten soll. Im Normalfall ist dies der Open Build Service.
\subsection{Shellskripte}
Währende des Erstellprozesses werden bis zu zwei optionale
Shellskripte ausgeführt: images.sh und config.sh
\subsubsection{images.sh}
Wird zu Beginn des zweiten Teilbereiches (Nach Ende der
Erstellung des Verzeichnisbaums) ausgeführt, sofern vorhanden.\\
Soll das System durch das Entfernen von Daten, die nur für das
Generieren des Verzeichnisbaumes erforderlich sind, das Image
aufräumen.
\subsubsection{config.sh}
Wird am Ende der Installation, aber vor den Paketskripten im
Generieren des Verzeichnisbaums-Abschnitt ausgeführt.
\subsection{Generieren des Verzeichnisbaums}
Zu Beginn erstellt kiwi aus der gegebenen Konfigurationsdatei einen
Verzeichnisbaum.
Dieser lässt sich über ein change-root-Tool wir chroot beliebig
navigieren und erkunden.
Bis auf das kiwi-Verzeichnis, welches eine Kopie der Konfiguration,
sowie wichtige Bauelemente beinhaltet, spiegelt das
Verzeichnis das spätere Innenleben des images wieder.\\
Zum Ende dieses Erstellungsprozesses wird noch das config.sh-Skript,
sofern vorhanden, ausgeführt.
Achtung: Manuelle Änderungen innerhalb des Verzeichnis werden bei
der nächsten Ausführung des Befehls überschrieben und können im
zweiten Schritt zu schwer verfolgbaren Fehlern führen.
Deshalb ist dies nicht zu empfehlen!
\subsection{Generieren des Images}
(Um diesen Schritt durchlaufen zu können, ist das erfolgreiche
Abschließen des Vorherigen zwingend erforderlich.) Zu Beginn des
zweiten Schrittes wird das images.sh Shellskript ausgeführt, sofern
vorhanden.\\
Aus dem Verzeichnisbaum können nun unterschiedliche Imagetypen
generiertwerden.
Möglich sind beispielsweise USB-Live-Images, PXEBoot, Amazon EC2,
Docker, KVM/Qemu, VirtualBox, VMWare oder auch Vagrant-Images.\\
\section{OpenBuildService}
Der OpenBuildService ist ein OpenSource-Projekt, welches von
SUSE-Entwicklern erstellt und seitdem aktiv gemaintaint wird.
Es ermöglicht Paketierern das automatische Bauen von Paketen
oder images und hat einen Fokus auf Continuos Integration.\\
Auch wenn der größte Fokus auf SUSE-Produkten liegt, können auch
andere Linux-Distributionen wie Debian oder Fedora hier Pakete
und images für ihre Distribution bauen.
Jeder Nutzer erhält ein mit seinem Account verknüpftes
Home-Projekt, in dem er zunächst
\textquotedblleft{}experimentieren\textquotedblright{} (neue
Pakete anlegen) kann.
Weiterhin kann der Nutzer Zugriff auf Nicht-Home-Projekte
anfragen (beispielsweise als Paketmaintainer) oder ein eigenes,
weiteres Projekt beantragen.
\subsubsection{Pakete auf dem OBS}
Paketierer haben beim erstellen von Paketen zwei
grundsätzliche Probleme:
\begin{enumerate}
\item muss das Paket für die Distribution/-en gebaut
werden, was auf dem lokalen Rechner je nach Leistung
ein wenig dauern kann.
\item müssen eventuelle Abhängigkeiten zu anderen
Paketen stets aktuell gehalten werden (das heißt,
der Paketautor muss sich immer alle aktuellen Pakete
herunterladen und sein Paket gegen diese bauen).
\end{enumerate}
Diesen beiden Problemen möchte der OpenBuildService
vorbeugen.\\
Das Prinzip ist hierbei einfach, statt seine erstellten
Pakete selbst lokal zu bauen, übernimmt diese Aufgabe der
OpenBuildService. Diesem stehen hierfür verschiedene Worker
zur Verfügung, die die Aufträge nach einer Warteschlange
abarbeiten.\\
Sollten sich innerhalb des Paketes oder einer seiner
Abhängigkeiten etwas ändern, so wird dies vom
OpenBuildService automatisch registriert und das Paket zum
erneuten Bauen eingereiht.
\subsubsection{osc}
osc ist das Kommandozeilentool, um mit dem OpenBuildService
zu interagieren. Zwar gibt es auch ein Webinterface, jedoch
ist das osc-tool meiner Erfahrung nach trotz Einlernungszeit
binnen kürzester Zeit effektiver und einfacher zu
handhaben.\\
Eingestellt ist das Tool auf build.opensuse.org, wobei auch
andere, selbstgehostete Versionen eingestellt werden können.
\subsection{rpmlint}
Der OpenBuildService verwendet eine speziell konfigurierte
Version des rpmlint-tools.
Dieses überprüft bauende Pakete auf bekannte Schwachstellen
und Probleme.
Neben normalen Problemen wie:
\begin{itemize}
\item Fehlende Angaben wie Author
\item Ungültige oder unbekannte Lizenz
\item Ungültigen oder fehlenden Definitionen in der
Konfigurationsdatei
\end{itemize}
weden insbesondere potentielle Sicherheitsrisiken
herausgefiltert. Dazu zählen beispielsweise:
\begin{itemize}
\item modifizierte oder neue polkit-Regeln
\item setuid-binaries
\item binaries mit speziellen Capabilities
\end{itemize}
Falls diese kritisch sein sollten, wird hierdurch der
Buildvorgang unterbrochen.
Um das Paket nun doch noch erfolgreich nach Factory zu
bringen, muss nun ein manueller Audit des Paketes durch ein
Mitglied der proaktiven Seite des security-teams durchgeführt
werden. Dieser kann bei Bedarf die Änderungen auf ein
Whitelist setzen und hierdurch das Bauen ermöglichen.
\subsection{Images auf dem OBS}
Seit der Einstellung des SUSE Studio-Projekts werden images
über den OpenBuildService erstellt.
Auch SUSE-eigene Images wie Live-CDs/-USB-Sticks, images für
diverse Hypervisor (KVM, VirtualBox, VMWare usw.) und Container
(z.b. Docker) optimiert und andere Dienstleister wie AWS werden
über den OpenBuildService gebaut.
Hierfür werden dem Entwickler einige Templates zur Verfügung
gestellt, jedoch sind diese, zumindest zum Projektzeitpunkt,
veraltet und deshalb für uns nicht weiter zu gebrauchen.\\
Hilfreicher waren hier schon die templates aus dem
kiwi-desc-netboot-Paket, jedoch hat auch dieses unter der
derzeitigen OBS-Version nicht korrekt gebaut.\\
Problematisch scheint derzeit in erster Linie das Auffinden
eines korrekten Quellrepositories zu sein, da zum
Projektzeitpunkt ein Bug für -mini-Pakete, welche standardmäßig
in den images dabei sind, für Paketkonflikte sorgt.\\
Im Gegensatz zum lokalen Bauvorgang hat der OpenBuildService im
Umgang mit kiwi einige Eigenheiten. Diese wären:
\begin{itemize}
\item Die Konfigurationsdatei muss eine *.kiwi-Datei sein
(config.xml ist als Dateiname nicht möglich)
\end{itemize}
\subsection{OBS auf anderen Systemen}
Der OpenBuildService unterstützt neben SUSE-Distributionen auch
beispielsweise Debian, Ubuntu, Red Hat, sowie sogar Windows
beim Paketbau.
Auch andere Architekturen sind neben x86 (z.b. AMD64, z Systems,
POWER) möglich\cite{suse:obs}
\section{Fazit zur Imageerstellung}
Der Werdegang der Image-Erstellung hat sich rückblickend leider als
kritisch herausgestellt. Problematisch war hier in erster Linie die
Dokumentation, welche den Hinweis auf neuere Versionen und Verfahren
nicht eindeutig plaziert hatte.\\
Beispielsweise ist die ausführlichste Dokumentation\cite{suse:kiwi},
auf der ein Großteil dieses Abschnittes basiert, zwar prinzipiell
richtig, die verwendeten Pakete mit enthaltenen Templates und Teile
der erklärten Mechanismen existieren leider nach SLE 12 nicht mehr.
Konkret lag das Problem hier daran, das wir das image mit
image\text{=„pxe“} anstelle des empfohlenen image\text{=„oem“} und
installpxe\text{=}true in den preferences unter type bauen wollten.
Dies war höchst bedauerlich, da wir nun mehrere Monate erfolgloser
Versuche, anhand der hier erläuterten Mechanismen ein
funktionstüchtiges Image zusammenzustellen für einen Abschnitt
aufgewendet haben, der im Projektplan für wenige Tage vorgesehen
war.\\
Über die korrekte Herangehensweise erfuhren wir erst nach langer
Kommunikation mit verschiedenen Community-Mitgliedern, wenige Tage
vor Ende der Projektfrist. Statt, wie lange vermutet ein Image vom
Typ pxe zu bauen, ist die Verwendung eines oem-Images mit gesetztem
pxeboot-Parameter die empfohlene Verwendungsweise.\\
Nun angeführt sind einige Links zu aktuellen Seiten, welche
aktuellere Informationen beinhalten und uns einiges an Arbeit
erspart hätten:
\begin{itemize}
\item
\href{https://opensource.suse.com/kiwi/building/build_oem_disk.html}{kiwi-Dokumentation
für das Erstellen von OEM-Images (auch für PXE empfohlen)}
\item
\href{https://doc.opensuse.org/projects/kiwi/schema-doc}{Schema-Dokumentation
für kiwi (enthält alle existierenden Optionen)}
\item
\href{https://build.opensuse.org/package/show/Virtualization:Appliances:Images/kiwi-image-pxe-ramdisk}{Ein
Template für die Erstellung eines PXE-Images mit RAMDisk}
\end{itemize}
\subsection{Versionshergang}
Die Idee war zu Beginn folgende: Zunächst wollten wir ein
einfaches, funktionstüchtiges iso-Image bauen, da sich dies
leichter testen ließe. Leider hat dies auch mit den
Live-Image-Vorlagen nicht funktioniert, da diese nicht
erfolgreich bauten.\\
Nach einigen erfolglosen Versuchen, ein funktionstüchtiges
iso-Image aufzusetzen, entschlossen wir uns aus Zeitgründen,
direkt mit dem PXE-Image fortzufahren. Hierbei experimentierten
wir mit sowohl mit image-type\text{=}pxe, als auch mit
image-type\text{oem}, bei zweiterem wurde ich hier leider lange
von der Fehlermeldung \textquotedblleft{}Unknown Image
Flavor\textquotedblright{} abgelenkt, welche sich aufgrund der
Parameterkonstellation ergaben.\\
Da uns leider kein funktionstüchtiges Template für ein pxe-image
wie in unserem Fall bekannt war,
taten wir uns hier schwer, diese richtig zu verwenden.
\chapter{PXE-Boot}
Für die Installation von openSUSE mit dem PXE-Server wird ein
PXE-Server gebraucht.
Weil es im Subnetz nur einen DHCP-Server geben darf, wird der
DHCP-Server der Fakultät Informatik verwendet.
Dafür wurden die MAC-Adressen der Clients herausgesucht und diesen
mit BOOTP der PXE-Server auf invis.informatik.fh-nuernberg.de
zugewiesen, dass die Clients per PXE aus /pxelinux.0 starten sollen.
\section{Installation}
Auf dem PXE-Server wurden die Pakete atftpd, syslinux und
vsftpd installiert. Die Konfiguration des atftpd-Daemons liegt unter
/etc/sysconfig/atftpd. \\
Zum automatischen Start müssen diese Dienste mit \textquoteleft{}systemctl
enable\textquoteright{}
aktiviert und \\
\textquoteleft{}systemctl start\textquoteright{}gestartet werden.
\section{Firewall}
Die Firewall-Ports sind nicht automatisch freigeschaltet.
Deshalb braucht man folgende firewalld-Befehle: \\
\begin{lstlisting}[frame=single]
firewall-cmd --add-service=tftp --permanent
firewall-cmd --add-port=69/udp --permanent #TFTP
firewall-cmd --add-port=67/udp --permanent #BOOTP
firewall-cmd --add-port=67/tcp --permanent #BOOTP
firewall-cmd --add-port=4011/udp --permanent
firewall-cmd --reload
\end{lstlisting}
\section{Konfiguration}
Weil das PXE-Image einiges an Platz braucht und alles mit dem Backup
abgesichert werden soll, wurde der TFTP-Server so konfiguriert, dass
die Daten alle unter /opt/ abgelegt werden können. \\
Nachdem die oben genannten Pakete installiert wurden, mussten die
beiden Dateien pxelinux.0 und menu.c32 aus /usr/share/syslinux/
nach /opt/tftpboot/ kopiert werden.
Weil im DHCP-Server der Eintrag für /pxelinux.0 bei allen Hosts
zum Booten steht, wurde noch ein Symlink von
/opt/tftpboot/pxelinux.0 nach /pxelinux.0 generiert.
Damit nicht nur root die Dateien unter tftpboot lesen kann, mussten
die Benutzerrechte rekursiv auf nobody:nobody mit 755 angepasst
werden.
\section{Boot-Konfiguration}
Damit das Image geladen werden kann, muss in der Datei default unter
/opt/tftpboot/pxelinux.cfg/ das Image und der Linux-Kernel mit angegeben
werden. Bei einem OEM-Image sieht das in unserem Fall so aus: \\
\begin{Verbatim}[frame=single]
label install
openSUSE mit eigenem Image installieren
kernel preload/linux
append initrd=preload/pxeboot.initrd
rawimage=ftp://preload/opensuse-leap-15.0-image.x86_64-2.8.0-Build80.1.raw rawdevice=/dev/sda vga=normal pxe=1
\end{Verbatim}
\section{UEFI}
Die Clients im Linux-Labor sind zwar schon etwas älter, aber bei der
Projektplanung ging man davon aus, dass diese kein UEFI beim PXE-Bootvorgang
mehr benötigen würden. Leider ließ sich das BIOS nicht so konfigurieren,
dass PXE mit Legacy funktioniert. Selbst ein BIOS-Update hat nicht geholfen.
Deshalb mussten aus dem openSUSE-Repository
http://download.opensuse.org/distribution/leap/15.0/repo/oss/boot/x86_64/loader/
und http://download.opensuse.org/distribution/leap/15.0/repo/oss/EFI/BOOT/
die Dateien message, memtest, bootx64.efi, grub.efi und grub.cfg ins Verzeichnis
/opt/tftpboot/ kopiert werden. In der grub.cfg musste dann der menuentry
von Installation auf das PXE-Verzeichnis unseres Images angepasst werden.
Die Kennzeichnung mit linuxefi vor dem Installations-Verzeichnis sagt aus,
dass hier UEFI verwendet werden soll. \\
Im DHCP-Server musste dann noch der Boot-Eintrag von pxelinux.0 auf
bootx64.efi umgeändert werden. \\
Weil die Systeme kein Legacy unterstützen, ist damit auch die Konfiguration
vom PXE-Server komplexer geworden.
\section{UEFI und Legacy bei unterschiedlichen Systemen}
Die Virtuellen Maschinen von Herrn Prof. Stappert verwenden kein UEFI.
Somit sind die notwendigen Dateien (unter UEFI) hier nicht notwendig.
Weil die Datei pxelinux.0 im selben Verzeichnis liegt, kann man ohne Probleme
auch Legacy-Systeme installieren, indem man den Eintrag pxelinux.0 statt
bootx64.efi verwendet.
\section{Fazit zum PXE-Server}
Es wurde viel zu wenig Zeit für den PXE-Server mit eingeplant. Die Konfiguration
wurde schon wegen UEFI komplexer. Hinzu kommt, dass bei der Verwendung von
KIWI beim Imagebau in der default-Datei zusätzliche Paramiter wie kiwiserver
mit der IP-Adresse des PXE-Servers notwendig sind und im tftpboot-Verzeichnis
ein KIWI-Verzeichnis mit einer speziellen KIWI-Konfiguration für den Bootvorgang
mit angelegt werden muss. Der TFTP-Server hat einige dieser Optionen in der
default-Datei nicht erkennen können, was das Debuggen deutlich erschwert hat.\\
Nach diesen Problemen wurde noch nachträglich (nach dem Hinweis des
KIWI-Entwicklers Marcus Schäfer) auf das OEM-Image gewechselt.
\chapter{automatisches Deployment}
\chapter{Fazit}
Der ursprünglich für die Active Directory geplante invis-Server musste
aufgrund von Konfigurationsproblemen und schwerwiegenden Differenzen
zwischen unserem und dem für ihm geplanten Einsatzzweck leider entfernt
werden.
Stattdessen wird nun direkt ein Kerberos-Client und sssd verwendet.
Das bringt einiges an Komplexität mit sich, weil sämtliche
LDAP-Spezifikationen mit Verbindung zum Active Directory als
Konfigurationen zusätzlich mit angegeben werden müssen.\\
Eines der Dinge, welche uns leider große Schwierigkeiten bereitet hat,
war die Erstellung des PXE images mit kiwi. Um so ärgerlicher war nun zu
erfahren, das es für die Erstellung eines solchen bereits eine
einfacherer, modernere Lösung geben soll. Dies erfuhren wir am
27.Februar, kurz vor der Fertigstellung unserer Variante.\\
An dieser Stelle muss auf jeden Fall die Dokumentation angepasst werden,
welche leider allgemein im Falle von kiwi mit dem OpenBuildService sehr
schwer nachzuvollziehen (und teilweise nicht mehr auf dem neuesten
Stand) war.
\printbibliography{}
\end{document}
|
https://www.zentralblatt-math.org/matheduc/en/?id=13216&type=tex | zentralblatt-math.org | CC-MAIN-2019-30 | text/plain | application/x-tex | crawl-data/CC-MAIN-2019-30/segments/1563195526446.61/warc/CC-MAIN-20190720045157-20190720071157-00346.warc.gz | 891,120,199 | 1,490 | \input zb-basic
\input zb-matheduc
\iteman{ZMATH 2014d.00210}
\itemau{Mac an Bhaird, Ciar\'an; Fitzmaurice, Olivia; N{\'\i} Fhloinn, Eabhnat; O'Sullivan, Ciar\'an}
\itemti{Student non-engagement with mathematics learning supports.}
\itemso{Teach. Math. Appl. 32, No. 4, 191-205 (2013).}
\itemab
Summary: Large numbers of students entering higher education take some level of mathematics as part of their degrees, and it is widely reported that a considerable minority of these students demonstrate a lack of the basic mathematical skills that they require to succeed. A common response has been the establishment of mathematics learning supports to give students the opportunity to reach the levels required. Research has shown that in general, although the supports appear to impact positively on students who avail of them, a significant number of students do not engage appropriately. This article presents preliminary findings from a national survey carried out at nine higher education institutions in Ireland, focusing on the reasons given by students for their lack of engagement with the extra supports. It looks at the students' mathematical backgrounds; the type of institution they attend, and discusses what these students reported would encourage them to avail of the supports.
\itemrv{~}
\itemcc{C25 C45 B40 D35}
\itemut{learning support; non-engagement; lack of mathematical skills; university education}
\itemli{doi:10.1093/teamat/hrt018}
\end |
http://petr.olsak.net/ftp/olsak/bulletin/stormcl.tex | olsak.net | CC-MAIN-2021-43 | text/x-tex | text/x-matlab | crawl-data/CC-MAIN-2021-43/segments/1634323585302.91/warc/CC-MAIN-20211020055136-20211020085136-00425.warc.gz | 54,793,378 | 19,578 | % Jak TeX k~fontům ze Střešovic přišel
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Zpravodaj 4/2001 Petr Olšák
\chyph % použijte csplain
\hsize=12.14cm
\vsize=17.3cm
\parindent=15pt
\raggedbottom % Vynechat dole na stránce příp. místo
\let\pagefont=\tenrm
\footline={\pagefont\ifodd\pageno\hfill\fi\the\pageno\hfil}
%% Parametry sazby %%
\emergencystretch=2em % Dodatečná roztažitelnost
\parindent=14pt % Odstavcová zarážka
\widowpenalty=10000 \clubpenalty=10000 % Absolutní zákaz vdov a sirotků
\lineskip=0pt % Velké boxy se budou dotýkat
\bigskipamount=12pt \medskipamount=6pt % Nevkládat deformovatelné výplňky
\smallskipamount=3pt
\def\,{\thinspace} \def\.{\kern.1em }
\def\CS{$\cal C\kern-.1667em\lower.5ex\hbox{$\cal S$}\kern-.075em $}
\let\smallA=\sevenrm
\def\La{L\kern-.36em\raise.5ex\hbox{\smallA A}\kern-.12em}
\def\LaTeX{\La\TeX}
\def\twoe{$2_{\textstyle\varepsilon}$}
\def\begitems{\medskip\bgroup\catcode`\*=13 \narrower}
\def\enditems{\par\egroup\medskip}
{\catcode`\*=13 \gdef*{\par\noindent\llap{$\bullet$\ }\ignorespaces}}
\catcode`\"=13
\def"{\hbox\bgroup\let"=\egroup\setverb\tt}
\def\setverb{\def\do##1{\catcode`##1=12}\dospecials\obeyspaces}
\def\begtt{\medskip\bgroup
\setverb\catcode`\"=12\catcode`\~=13
\def\par##1{\endgraf\ifx##1\egroup\else\leavevmode\fi##1}\obeylines \obeyspaces
\startverb}
{\catcode`\|=0 \catcode`\\=12
|gdef|startverb#1\endtt{|tt#1|egroup|medskip|testpar}}
\long\def\testpar#1{\ifx\par#1\else\noindent\fi#1}
\def\subsec #1\par{\bigskip\bigskip\hbox{}\nobreak\vskip-\medskipamount
\noindent{\bigbf #1}\par\nobreak\bigskip\noparindent}
\def\noparindent{\everypar={\setbox0=\lastbox\everypar={}}}
\font\titulbf=csbx12 scaled\magstep1
\font\scap=cscsc10
\font\bigbf=csbx12
\newdimen\authorwidth
\def\bigtitul #1\par{\hrule height4pt\kern1pt
\hrule height2pt\kern1pt \hrule height1pt \medskip
\hbox{\titulbf #1}%
\hbox to\hsize{\leaders \vrule height3.5pt depth-2.5pt\hfil
\setbox0=\hbox{\vrule height 9pt depth3pt \scap\ \Author\ \vrule}%
\global\authorwidth=\wd0 \box0 \vrule height7pt width3pt}
\nointerlineskip \line{\hfil\vrule width\authorwidth height.4pt
\vrule width3pt}%
\nointerlineskip \line{\hfil\vrule width\authorwidth height2pt}%
\vskip1cm \noparindent
}
\def\url#1{{\tt#1}}
\def\ps{Post\-Script}
%\input sjannon
%\setfonts [JannonText/] \lineskiplimit=-2pt
\def\Author{Petr Olšák}
\bigtitul Jak \TeX{} k~fontům ze Střešovic přišel
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Už delší dobu mě mrzelo, že se \TeX{} používá skoro výhradně jen
s~Computer Modern fonty. Přitom tento program je navržen tak, že dokáže
pracovat s~libovolnými fonty v~libovolném (třeba dnes ještě neznámém)
formátu. Samozřejmě, pro každý nový formát fontů je potřeba mít
v~\TeX{}u doprovodný software, který umožní takové fonty použít.
Všichni jistě víme, že formát \ps{} Type1 takovou softwarovou podporu
v~\TeX{}u má. Je tam už od počátků existence \ps{}u.
Tak proč se v~\TeX{}u používá tak často (a mnohdy nevhodně) jen
Computer Modern? Není to tím, že pouze Computer Modern je standardní
součástí každé instalace \TeX{}u? Nebo tím, že běžně používaná makra
v~\TeX{}u jsou implicitně nastavena na Computer Modern? Nebo dokonce
tím, že instalace nových fontů je poněkud náročnější a mnohdy vyžaduje
větší zkušenosti s~počítačovými formáty fontů? Nebo snad tím, že
vytvoření dokumentu v~jiném než standardním fontu ohrožuje jeho
přenositelnost? Nebo možná tím, že \TeX{} je zadarmo a jeho uživatelé
očekávají stejnou vlastnost i od fontů? Nebo konečně tím, že alternativa
k~rozsáhlé skupině matematických fontů v~Computer Modern se pro jiné
rodiny fontů hledá jen obtížně?
Myslím si, že výše uvedené důvody se sčítají. Je pravda, že dnes už
mnozí \TeX{}isté sáhnou aspoň někdy po písmu z~nabídky standardních 35
\ps{}ových fontů od Adobe, které jsou přítomny v~každém \ps{}ovém
RIPu. Podporu pro tyto fonty včetně počeštění (virtuální skripty
\TeX{}u) jsem před asi osmi lety udělal a zařadil do
\CS{}\TeX{}u. Protože dnes k~těm standardním fontům od Adobe existují
volně dostupné alternativy implementované například ve volně šířeném
\ps{}ovém RIPu Ghostscript, mohou si uživatelé \TeX{}u udělat kdykoli
náhled dokumentu sázeného těmito fonty a nemusejí fonty od Adobe
kupovat ani tvořit dokument
\uv{naslepo} a čekat, až výsledek projde \ps{}ovým RIPem tiskárny
nebo osvitové jednotky.
Počeštění pro 35 Adobe fontů jsem kdysi dělal s~vědomím limitů, které
vycházely z~technické podstaty těchto fontů. Protože fonty nebude mít
běžný uživatel v~počítači, ale budou jen v~RIPu tiskárny nebo osvitové
jednotky, nebylo možné k~nim přidávat další znaky nebo je nějak
modifikovat. Bylo možné využít pouze znaky, které v~těchto
fontech byly obsaženy a skládat je do znaků kompozitních. Tak
například pro akcent u~písmen ď a ť jsem použil apostrof, ačkoli tam
většinou vypadá dost humpolácky. Nebo akcenty nad verzálkami musely
být stejné, jako akcenty pro mínusky. Ty verzálkové ale mnohdy příliš
vyčnívaly z~řádku. Pokoušel jsem se na ně aplikovat (v~rámci
virtuálních skriptů v~\TeX{}u a prostřednictvím standardních
\ps{}ových operátorů) geometrické deformace, což sice částečně
pomohlo, ale výsledek měl některé další nedostatky, kvůli
kterým jsem tento trik nakonec do oficiální distribuce nezařadil.
Tušíte asi, že jsem v~souvislosti s~těmito problémy zajásal, když jsem se
dozvěděl o~existenci Střešovické písmolijny a prohlédnul její nabídku.
Ty fonty mají naprosto perfektní akcenty a půjdou v~\TeX{}u použít
bez dodatečného počešťování, protože samozřejmě české jsou.
Fonty ze Střešovic mají všechny náležitosti, které pro kvalitní sazbu
s~radostí využijeme, a přitom v~mnoha jiných fontech tyto věci chybí.
Mám na mysli třeba bohatý repertoár ligatur nebo variantní písmeno
\uv{v} v~některých kurzívách. Navíc texty, kterými byly ukázky fontů
na WWW stránkách~\url{www.lege.cz/typo/stormenu.htm}
proloženy, mně osobně přímo mluvily z~duše.
Tak se stalo, že jsem se asi před dvěma lety seznámil s~majitelem Střešovické
písmolijny a tvůrcem všech fontů v~jediné osobě: panem Františkem
Štormem. Mluvili jsme o~tom, jak by mohla vypadat spolupráce
písmolijny s~\CS TUGem a zmínil jsem možnost vytvoření podpory pro
jeho fonty v~\TeX{}u. On namítal, že z~hlediska množství zákazníků
jsou pro něj \TeX{}isté jen minoritou. S~tím se dá, bohužel, jen
souhlasit. Je proto pro něj zatím ekonomicky nevýhodné pronikat do
problematiky \TeX{}u a nabízet zákazníkům i tuto podporu. Věnoval mi
na zkoušku jednu čtyř-řezovou rodinu, abych ji zkusil dostat do \TeX{}u.
Neodpustím si uvést jednu perličku, která při předávání těchto čtyř
fontů nastala. Pan Štorm se mě zeptal, zda to chci pro PC nebo
MAC. Zalapal jsem po dechu, protože Linux běží na PC i na MAC, ale
tušil jsem, že takto otázka nebyla myšlena. Viděl jsem, že on pracuje
s~počítačem i operačním systémem od MACů a věděl jsem, že potřebuji ke
svému štěstí PFB a AFM soubory. Nic víc. Vyšel jsem z~domněnky, že tyto
soubory mají v~obou systémech stejný formát a prohlásil jsem:
\uv{Bude lepší, když mi to dáte v~nativním formátu, ve kterém
pracujete, aby nedocházelo ke zbytečným ztrátám informace konverzemi.}
Cítíte asi, jaká jsem při té řeči měl ramena. Dostal jsem variantu MAC
a dobře mi tak. Hned druhý den jsem běžel pokorně za panem
Štormem s~disketou znova, protože jsem celý večer strávil
zbytečným objevováním naprosto nepochopitelných odlišností
formátů fontů pro MAC a zbytek světa.
Ačkoli jsem pak po týdnu přišel už s~lepšími výsledky včetně tištěné
ukázky článku vysázeného v~\TeX{}u těmi zapůjčenými fonty, k~další
dohodě v~té době nedošlo. Asi jsem měl tehdy příliš
mnoho připomínek k~těm fontům. Například, že znak se jménem
"copyright" by měl vytisknout \uv{\copyright} a nikoli \uv{Š}.
Přitom znak "Scaron" ve fontu vůbec nebyl k~nalezení.
Podobně pod znakem "sterling" jsem očekával symbol britské měny a
nikoli ligaturu \uv{fi} a tak bych mohl pokračovat.
Udělal jsem si tehdy pro ty fonty takový speciální "*.enc" soubor,
který zmíněný problém zmatení názvů obcházel, ale doporučil jsem
autorovi, že by bylo lepší mít to správně rovnou v~těch fontech.
Pan Štorm asi tušil, že \TeX{}isté budou mít takové záhadné
připomínky (vždyť ty fonty jsou kódovány pro Windows, tak kde je
problém?) tak dlouho, dokud on nenechá v~těch fontech hodně další
práce. A~to se mu pro malou \TeX{}ovou obec nevyplatilo.
Pak jsme se asi dva roky neviděli. Až v~květnu letošního roku (2001)
se na diskusní skupině "[email protected]"
objevil tápající dotaz, jak zařadit do \TeX{}u fonty, které si někdo
koupil ve Střešovické písmolijně. Ačkoli jsem už zapomněl, kdo
otázku položil, myslím si, že mu nyní vděčíme za to, že ucelená podoba
\TeX{}ové podpory pro fonty ze Střešovic existuje. Kdyby se totiž
autor dotazu s~technickými problémy porval sám a na nic se neptal, tak
by vše zůstalo ve stavu před dvěma lety. Se Štormovými fonty by se
rvali další a další \TeX{}isté vždy znovu, a přitom každý by to udělal
trochu jinak a neexistoval by jednotný standard na podporu těchto fontů.
Ten tápající dotaz ale rozpoutal novou diskusi o~potřebě jednotného přístupu
k~začlenění fontů ze Střešovické písmolijny.
Při další komunikaci s~panem Štormem jsem už přesně věděl, jak mám
odpovědět na otázku \uv{MAC nebo PC} a dostal jsem další vzorek čtyř
fontů k~testům. Byl jsem mile překvapen, že fonty už nyní
obsahují znaky se správnými názvy a těch znaků bylo dokonce kolem 370.
Ukázalo se, že Střešovická písmolijna za ty dva roky udělala na
fontech velký kus práce. I~pan Štorm byl mile překvapen, když dostal
ode mne vzorek dokumentu s~těmito fonty ve formátu PDF zpracovaný
pdf\TeX{}em. Došlo ke vzájemné shodě, že bude pro \TeX{}isty výhodnější,
když bude pro ně podpora jednotně připravena. A~tak jsem si v~červnu
roku 2001 odnášel ze Střešovic CDčko \hbox{(ve verzi PC:-)}
včetně krabice s~písmovým katalogem. Příslib byl, že přes
prázdniny udělám pro \TeX{}isty podporu ke všem těmto
fontům a zveřejním ji na Webu.
Dobře se slibuje a hůř se dělá. Narazil jsem během práce na několik
technických problémů, které popíšu níže. Navíc jsem se rozhodl udělat
pro \TeX{} makro, které by mi umožnilo udržet přehled a pořádek nad
tak velkým množstvím fontů. Myšlenku toho makra, které jsem nazval
OFS, taky popíšu níže. Přitom poptávka \LaTeX{}istů je dost silná,
tak jsem se přemohl a pokusil se toto makro udělat nejen pro plain,
ale i pro \LaTeX{}. Konečně manželka měla poměrně dost řečí, že děti
chtějí jíst a že nás moje koníčky (tj.~\TeX) a můj učitelský plat
příliš neuživí. Tuto skutečnost na rozdíl od předchozích dvou už
nerozepíšu podrobněji níže. Byl jsem nakonec rád, že se mi termín
dokončení s~odřenýma ušima podařilo splnit.
\TeX{}ovou podporu pro písma ze Střešovic najdete od září 2001 na
stránkách sdružení \CS TUG, konkrétně na \url{www.cstug.cz/stormtype}.
Je tam balíček obsahující metriky a "fd" soubory pro všechny
fonty. Balíček též obsahuje mé makro OFS. Dále na WWW stránce najdete
klikací katalog s~ukázkami všech fontů zpracovaný pdf\TeX{}em.
Konečně tam je k~mání balíček se \uv{zdrojovými texty},
přesně řečeno s~nástroji, pomocí kterých jsem ty metriky generoval.
Ctím zásadu \TeX{}u (nověji též GNU GPL a podobných licencí), že
výsledek práce se sluší zveřejnit včetně zdrojových textů.
Metriky jsou přitom už výsledkem nějakého procesu, na který bylo
potřeba použít určité nástroje. Tyto nástroje si samozřejmě
nechci nechat pro sebe.
Podpora obsahuje z~pohledu \TeX{}u při použití makra OFS
287 fontů členěných do 86 rodin. Některé tyto fonty ovšem slučují dva
různé fonty označované v~katalogu Střešovické písmolijny jako základní
(číslice na řádce) a OSF (skákavé číslice, old style figures).
Takže z~pohledu písmolijny je podporováno 321 různých fontů.
Podpora zahrnuje metriky stejných fontů pro rozličná kódování,
takže nesmí překvapit, že v~balíčku lze nalézt celkem
857 metrik a 260 {\tt fd} souborů. Mapovací soubor pro "dvips"
s~názvem "storm.map" obsahuje 1124 řádků, protože umožňuje
odstraněním některých komentářů řešit problém nejednoznačnosti
názvů některých fontů.
\subsec Jak na výrobu \TeX{}ových metrik
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Protože fonty obsahují všechny potřebné akcentované znaky a ještě
mraky akcentovaných znaků navíc, odpadá důvod pro použití virtuálních
skriptů v~\TeX{}u (zvaných též virtuální fonty). Skutečně, virtuální
skript nám příliš nepomůže řešit některé chybějící znaky, jako je
například znak "Eng" z~kódování T1 (na pozici 141) nebo písmeno j
bez tečky. Můžeme sice tyto znaky pomocí virtuálních skriptů
substituovat z~jiných fontů, ale výsledek by byl při použití těchto
znaků stejně jako pěst do očí bijící. Jediným přínosem při použití
virtuálních fontů by byla možnost vytvoření znaku \uv{SS} jako
verzálky ke znaku \ss. To se ale použije jen v~německých textech
a navíc jen tehdy, pokud konvertujeme automaticky text psaný
malými písmeny na verzálky pomocí "\uppercase".
Přitom se dá problém řešit jinak (viz třeba příklad
v~dokumentaci k~makru OFS na straně~15).
Nestojí tedy za to ztrojnásobovat velikost instalace
přítomností virtuálních skriptů (ke každé metrice by navíc musela
existovat metrika \uv{raw} a virtuální skript "*.vf".
Pro konverzi metrik jsem použil program "afm2tfm" z~distribuce
"dvips". Koketoval jsem chvíli sice i s~programem "fontinst", ale zdál
se mi příliš pomalý, což při tom množství fontů bylo znát. V~době, kdy
jsem se rozhodl pro "afm2tfm", jsem ještě netušil, že
nastanou potíže, které by se možná daly lépe řešit právě programem
"fontinst". Nechtělo se mi ale na poslední chvíli přecházet na jiný
program (možná by se objevily další skryté obtíže), takže podpora
zůstala postavena na programu "afm2tfm". Základní postup pro vytvoření
metriky tedy vypadá takto:
\begtt
$ afm2tfm soubor.afm -T kodovani.enc -v metrika metrika
$ rm metrika.tfm
... tato metrika.tfm neobsahuje kerningové informace
$ vptovf metrika
... vzniká cílová metrika.tfm
$ rm metrika.vf metrika.vpl
\endtt
Jak již jsem zmínil, fonty běžně obsahují asi 370 znaků. Myšlenky na
použití $\Omega$\TeX{}u mě přešly dřív, než mě vůbec mohly napadnout.
Tato varianta \TeX{}u je v~našich zemích natolik málo používaná, že
by výsledná \TeX{}ová podpora byla použitelná jen pro otrlé jedince,
kteří se nebojí instalovat méně obvyklý software a šťourat se v~jeho
možnostech. Já sám mezi takové jedince nepatřím.
Bylo tedy potřeba znaky z~dodaných fontů rozdělit do dvou metrik:
základní a rozšiřující. Základní metriku jem kódoval podle \CS-fontů
(tzv.~kódování IL2) a druhou verzi základní metriky jsem
připravil v~kódování T1 pro \TeX{}isty s~mezinárodním rozletem.
Každý font má tedy tři metriky: základní ve dvou variantách a
jednu rozšiřující. V~rozšiřující metrice jsou všechny \uv{zbylé}
znaky, které se nevyskytují v~průniku kódování T1 a IL2, ale jsou ve
Štormových fontech přítomny. Tím je možno pokrýt všechny znaky z~fontu
buď dvojicí IL2 + rozšiřující metrika nebo dvojicí T1 + rozšiřující
metrika. Rozšiřující metriku jsem kódoval bez dalších souvislostí
prostě tak, jak mi to přišlo pod prsty. Kódování jsem nazval SE1
(zkratka od StormEncoding1).
Předchozí odstavec není řečen úplně přesně. Metrika kódovaná podle T1
neobsahuje všechny znaky z~tohoto kódování, protože ve Štormových
fontech chybějí znaky "dotlessj", "visiblespace", "Eng", "eng" a "SS".
Na pozicích pro tyto znaky jsou prázdná místa s~výjimkou pozice~26 pro
"dotlessj", kam jsem strčil variantní písmeno~\uv{v}, aby mohlo tvořit
ligaturu s~okrajem slova. Takto vzniklé kódování je interně označeno
jako "StormT1Encoding" a najdeme jej v~souboru "stormt1.enc".
V~\LaTeX{}ovém NFSS se používá pořád název \uv{T1} s~tím, že výše
jmenované znaky v~tomto kódování prostě nebudou při použití
Štormových fontů fungovat.
Rovněž IL2 metrika není zcela přesně shodná s~kódováním
podle \CS{}fontů. Především chybějí velká řecká písmena používaná
v~matematické sazbě na pozicích~0 až~10. Dále chybí "dotlessj"
(pozice~17) a škrtátko pro polské~L (pozice~32). Navíc jsou zaneseny
všechny znaky jako v~kódování XL2, tj. znaky "ellipsis", "dagger",
"daggerdbl", "bullet", "sterling", "paragraph"
\hbox{(pozice 128--133)}, "section" (pozice~167),
"Lslash" (pozice~163), "lslash" (pozice~179)
a některé akcentované znaky z~abeced evropských
států. Kromě znaků z~XL2 kódování, které je deklarováno v~souboru
"xl2.enc" a v~[TST] na straně 157, jsem ještě přidal tyto znaky:
"euro" (pozice~134), "trademark", "copyright", "registered"
(pozice~136--138), "guilsinglleft", "guilsinglright",
variantní~\uv{v}, ligatury "ct", "st", "ft", "longst" a znak "longs"
\hbox{(pozice 142--149)} a dále znaky "florin" na pozici~151,
"quotesinglbase" na pozici~154 a "quoteleft" na pozici~155. Takto
vytvořené kódování jsem nazval "StormL2Encoding" a uložil do souboru
"storml2.enc". V~\LaTeX{}ovém NFSS se nadále tomuto kódování říká
\uv{IL2} s~tím, že nové znaky jsou deklarovány v~souboru
"se1ini.def".
\subsec Objevují se problémy
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Při vytváření \TeX{}ových metrik jsem narazil na několik
problémů, které zde popíšu podrobně, aby další uživatelé
\TeX{}u nemuseli v~případě generování dalších metrik objevovat
objevené.
Především mě šokoval pohled do metriky "afm". BoundingBoxy všech
znaků tam byly úplně stejné a to docela velké:
"B -147 -677 1475 1004".
Za to pan Štorm asi nemůže, ale programátora, který dělal
ten program používaný panem Štormem při generování "afm" metrik,
bych nakopal do zadku. Nu což, bylo potřeba prohnat všechny "*.pfb"
soubory \ps{}ovým RIPem a zeptat se jej na skutečné BoundingBoxy
znaků. Na to už existuje v~Ghostscriptu \ps{}ový program, který se
jmenuje "printafm.ps". Ten ale nevytiskne tabulku kerningových
párů. Čerpá totiž informace jen z~{\tt*.pfb} souborů a tam tato
tabulka uložena není.
Není zas ale takový problém slepit informace o~kerningových
párech z~originální "afm" metriky a informace o~BoundingBoxech
z~výstupu programu "printafm.ps". K~tomu jsem použil pár
starodávných ale vynikajících UNIXových programů, jako je "grep",
"cat", "tail" nebo "head" a lepilo se mi to automaticky
zpět do metriky se správnými BoundingBoxy i se zachovanými
kerningovými páry. Odpovídající skriptík se jménem "naf" je samozřejmě
v~distribuci \TeX{}ové podpory přiložen.
Nastal ale nečekaně další problém. Program "printafm.ps" jaksi
nepočítá příliš s~tím, že by font měl někdy více než 256 znaků. Takže
výše uvedený postup znamenal náhodnou ztrátu některých znaků. Naštěstí
je program "afm2tfm.ps" vlastně jen prostým \ps{}ovým kódem, takže
jsem se v~něm povrtal a tuto vlastnost opravil. Tím vzniknul program
"myprintafm.ps", který jsem nakonec skutečně použil. Je
v~distribuci přiložen. Oprava je zatím jen provizorní, protože program
"myprintafm.ps" nyní umí maximálně 512 znaků. Pro potřeby fontů ze
Střešovické písmolijny to bylo dostačující. Protože mně nečiní velké
potěšení vrtat se v~\ps{}ových kódech, nechal jsem toho, ačkoli tuším,
jak by se to dalo udělat bez limitu na počet znaků.
Na cestě k~perfektním metrikám nyní zaskřípal program "afm2tfm".
Nevím z~jakých důvodů, ale ten program má v~sobě vloženou jistou
zbytečnou inteligenci na přepočítávání výšek akcentovaných znaků
u~vyjmenovaných akcentů. Jakoby nestačil údaj z~BoundingBoxu, když už ho
máme správně! Výsledky byly takové, že výšky akcentovaných znaků byly
(mírně řečeno) ulítlé. To pak tajuplně rozhazovalo řádkovou
osnovu v~\TeX{}u, aniž by byl vidět důvod toho rozhození.
Rozhodl jsem se nekompromisně zasáhnout a tuto nadbytečnou inteligenci
z~programu "afm2tfm" pro mé účely odstranit. Samozřejmě, že
program je k~dispozici včetně zdrojových textů v~jazyce~C, takže nebyl
problém chybu najít, pojmenovat, odstranit a program znovu
zkompilovat. Tak vznikl program "my-afm2tfm", který je v~distribuci
přiložen. Kdybych používal programy bez otevřeného zdrojového kódu,
asi bych byl v~tuto chvíli už úplně ztracen.
Nyní přichází na řadu další zádrhel. Všechny metriky mají svorně psáno
"XHeight 700", což samozřejmě není pravda. Každý font má přeci
jinou střední výšku písma. Zde si nejsem tak jist, zda to je opomenutí
pana Štorma, nebo v~tom má prsty ten bezejmenný programátor, který by
si měl připravit na zadek polštář. Údaj "XHeight" se přenáší do
\TeX{}ové metriky jako parametr "\fontdimen5" alias "1ex".
Ten je pak mimo jiné použit \TeX{}ovým primitivem
"\accent" na usazování akcentů,
pokud náhodou dané písmeno už požadovaný akcent přímo ve fontu nemá.
Asi tušíte, jak by asi šlo chybu opravit. Je třeba se podívat na
BoundingBox malého písmene x a výšku toho boxu použít místo
"Xheight". Ten BoundingBox už máme přece správně vypočítaný díky
programu "myprintafm.ps"\kern.1em! Asi by šlo nějakým perlíkem do "afm"
metriky vlézt a popsanou činnost automatizovat. Mě se ale zdálo
jednodušší říci programu "my-afm2tfm", aby se vykašlal na
"Xheight" a za zavazující považoval výšku písmene x. Vždyť jsem se
už ve zdrojovém kódu tohoto programu jednou vrtal, takže nečinilo potíže to
udělat podruhé.
Sláva, konečně máme \TeX{}ové metriky snad bez chyb. Všechny skripty,
které jsem pro generování metrik použil, jsou přiloženy v~distribuci.
\subsec Odhalování chyb
%%%%%%%%%%%%%%%%%%%%%%%
Při práci na \TeX{}ové podoře jsem postupně objevil ve fontech a
v~mnoha souvisejících programech nebo knihách chyby. Zde je jejich
výčet:
\begitems
* Dvě chyby v~mé knize \TeX{}book naruby.
* Jedna chyba v~\TeX{}u. Nebo je to jen nepříjemná vlastnost?
* Výše popsané chyby v~programech "printafm.ps" a "afm2tfm".
* Chyba v~pdf\TeX{}u, která už v~nové verzi není.
* Chyba v~programu "dvips".
* Chyba v~Ghostscriptu verze~7.0.
* Acroread verze~3.0 pro UNIX nezobrazí Iogonek.
* Několik chyb ve Štormových fontech.
\enditems
Chyby v~\TeX{}booku naruby jsem zanesl do "errata.txt". Na straně
78 připouštím jednotku "mu" v~parametru "\hskip",
což není pravda. Na straně 378 nezmiňuji možnost použít "\ifx"
na test shody expandovatelných primitivů.
Chyba v~\TeX{}u je následující: Pokud použijeme znaky tvořící
automaticky ligaturu s~hraničním znakem slova, pak se tyto znaky
objeví i uvnitř slova v~místě, kde používáme primitiv "\-" pro
vyznačení nestandardního dělení slov. Musíme tedy do těchto míst
přidat ještě primitiv "\noboundary". Pak se ale zase znak nepromění
na alternativní, pokud je náhodou slovo v~tom místě skutečně
rozděleno. Je-li slovo děleno podle vzorů dělení
(ne vyznačením~"\-"), pak se vše chová správně.
To znamená, že znak je normální
uvnitř a při rozdělení slova se jako první na následujícím řádku
promění automaticky ve znak alternativní.
Chyby v~programech pdf\TeX{}, "dvips" a Ghostscript~7.0 jsou podrobně
popsány v~dokumentaci k~\TeX{}ové podpoře. Jedná se o~to, že pdf\TeX{}
byl ve starší verzi (kterou ovšem stále používám) zmaten mezerami
uvnitř závorek vymezující "/FontBBox". Program "dvips" je zase zmaten
tím, když má vysekávat nepotřebné znaky v~dokumentu, kde se setkají
dvě různé metriky odkazující na stejný font (což je v~případě fontů
s~více než 256 znaky dost přirozený požadavek). Konečně Ghostscript
verze~7.0 náhodně padá při generování bitmap s~hlášením
{\tt gs died on signal 13}.
Acroread 3.0 se projevil zajímavou chybou. Zatvrzele odmítá zobrazit
znak "Iogonek". Místo něj najdeme v~dokumentu bílé místo. Přitom minuska
"iogonek" je v~pořádku. Použijeme-li vyšší verzi acroreaderu na stejný
PDF dokument, znak Iogonek se objeví tam, kde má být. Kdybych měl po
ruce zdrojový text toho programu, okamžitě bych se podíval, jaká
speciální akce je v~něm při výskytu znaku Iogonek v~dokumentu
naprogramovaná. Protože to ale není program s~otevřeným zdrojovým
kódem, zbyla mi z~této příhody pouze obava, že programátoři při
výskytu tohoto znaku naprogramovali nějakou rošťárnu.
Chyby ve fontech Střešovické písmolijny jsem oznámil autorovi po
dokončení \TeX{}ové podpory. Vesměs všechny byly odstraněny na
počkání, takže pokud objednáme fonty dnes, pak už tyto chyby obsahovat
nebudou. Nicméně pro úplnost uvádím jejich výčet.
\begitems
* V~Jannon Antikvě byl nenulový ItalicAngle, ačkoli tam má být nulový.
* Kurzívy Serapionu neměly variantní \uv{v} na pozici "pi", ačkoli
jiné kurzívy měly tento znak právě na této pozici.
* Medi\ae val Italic měl nulové šířky pro znaky 1/2, 1/4, 3/4,
$^1$, $^2$, $^3$ a znak~$/$ (to není obyčejné lomítko, ale lomítko
vhodné pro slitky zlomků)
* Medi\ae val SC Bold Italic měl na pozici znaku \uv{ž} znak \uv{ý}.
* MramorLight měl na pozici znaku \uv{ů} znak \uv{Ú}.
* SplendidOrnamenty neobsahoval kudrlinku inzerovanou v~katalogu pod kódem
znaku~\uv{@}.
* Dvojice znaků [ a J (náhodou se to v~testu fontů sešlo v~rodině
Jannon a JBaskerville) byla příliš nalepena na sebe a asi by
potřebovala korekci kernem. V~plainové verzi vzorníčku fontů
jsem si pomohl makrem, které tam přidává mezírku 0,05em.
\enditems
Kromě toho jsem ještě narazil na nepříjemnou věc, která vyplývá
z~koncepce programu "afm2tfm" a omezení v~metrikách "tfm".
V~těchto metrikách se všechny rozměrové údaje ukládají jako
racionální číslo, přičemž skutečný rozměr získáme tak, že toto číslo
násobíme stanovenou jednotkou. V~"afm2tfm" byla celkem logicky
stanovena jednotka jako tisícina velikosti fontu, protože to je
v~\ps{}ových fontech obvyklé a v~\ps{}ových metrikách si pak vystačíme
s~celými čísly. Jenomže metrika "tfm" má možnost uložit racionální
číslo maximálně ve velikosti 2048. Ve fontu Zeppelin, který je takový
hodně rozšířený a navíc má jenom verzálky, byl tento limit
překročen. Hádejte u~jakého znaku? Je to znak \ss, který ve verzálkové
podobě je do fontu správně zakreslen jako SS. Tento \uv{dvojznak} má v~\ps{}ových
jednotkách šířku kolem 2200, takže použití této jednotky při
převodu do "tfm" způsobilo chybu. Program
"vptovf" vypíše varování a uloží šířku nula. Musel jsem tedy manuálně
upravit tuto šířku na správný rozměr pomocí "tftopl", "vi", "pltotf".
Podobný problém jsem řešil s~fontem Splendid Ornamenty.
\subsec Motivace k~makru OFS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Myslím si, že existuje ještě jeden důvod malého využití jiných
fontů než Computer Modern v~\TeX{}u, který jsem v~úvodu svého článku
neuvedl. Tím důvodem je skutečnost, že s~rostoucím
počtem instalovaných fontů klesá přehled o~tom, jak se jmenují. Přitom
znalost jejich jmen je nutná podmínka použití, neboť v~\TeX{}u na
rozdíl od interaktivních systémů musíme název fontu napsat někam do
souboru podle smluvené syntaxe a pak \TeX{}ovat. \TeX{}ista si tedy musí
v~určitém okamžiku vzpomenout na název fontu a zapsat jej do
nějakého souboru maker nebo přímo do dokumentu.
Interaktivní systémy mají v~tomto ohledu na rozdíl od \TeX{}u
výhodu. Všechny fonty, které jsou instalovány, se zobrazují v~klikací
nabídce, takže stačí se chopit myši a klikat. Tato možnost obvykle
v~\TeX{}u chybí.
Když jsem si přinesl domů CDčko ze Střešovic a začal listovat
písmovými katalogy, probudila se ve mě panika, že si budu muset názvy
metrik všech těch fontů pamatovat, abych je mohl efektivně
využít. Vždyť já si nejsem schopen zapamatovat ani metriky
standardních 35 fontů od Adobe. Kdo si má pamatovat, že třeba Palatino
Italic má metriku "pplri8z.tfm"? Ani NFSS tento problém neřeší.
Musím totiž vědět, že Palatino má v~NFSS zkratku "ppl" a že je
k~dispozici varianta \uv{medium-weight/italic}. Pak teprve font zapíšu
jako "IL2/ppl/m/it/10". Věřím, že je každému jasné, že to není
žádná velká výhra, spíš cesta z~bláta do louže. Já bych přitom
chtěl napsat někam prostě \uv{Palatino} a případně se dozvědět,
jaké varianty této rodiny jsou k~dispozici.
Můžete namítnout, že tento problém řeší \LaTeX{} se svými stylovými
soubory. Tam skutečně mohu napsat
"\usepackage{palatino}". Ovšem ten název
\uv{palatino} je implementován jako název souboru. S~dlouhými názvy
souborů bývá v~některých systémech potíž, zatímco dlouhé názvy
rodin jsou celkem obvyklé. Pokud budu mít v~\TeX{}u instalovánu stovku
rodin, stěží si budu pamatovat všechny jejich názvy. Přitom souhrnný
slovníček názvů všech instalovaných rodin NFSS neřeší.
Abych zahnal tu paniku, která vznikla při mém listování v~katalogu,
rozhodl jsem se udělat makro OFS (Olšákův Fontový Systém). Nyní
mohu na začátek dokumentu napsat text, který jsem ochoten si
pamatovat:
\begtt
\input allfonts
\showfonts
\endtt
%
nebo rovnou na (UNIXový) příkazový řádek napíšu:
\begtt
$ tex allfonts \\showfonts\\end
\endtt
%
a na terminál a do logu se mi vylistuje seznam všech rodin, které mohu
použít. Navíc vedle každé rodiny je seznam všech variant, které jsou
v~dané rodině k~dispozici. Názvy rodin nemají omezení
na 8 písmen a jsou zapisovány pokud možno tak, aby to nebylo ani
příliš rozvláčné (John Baskerville Text), ani nic neříkající
zkratka (sjbt). V~případě citované rodiny se na terminálu objeví
řádek s~nabídkou "[JBaskervilleText/]".
Pokud budu chtít přepnout sazbu do této rodiny,
napíšu prostě "\setfonts[JBaskervilleText/]" a pokud budu
chtít použít jen konkrétní variantu Bold Italic, pak napíšu
"\setfonts[JBaskervilleText-bi/12pt]".
Stačí tedy udržovat soubor "allfonts.tex" tak, aby zahrnoval
informace o~všech fontech v~\TeX{}ovém systému.
Při instalaci nové skupiny fontů do něj přidám jeden řádeček.
Například po instalaci fontů ze skupiny Jannon mohu využít už
připravený soubor "sjanon.tex", takže do
"allfonts.tex" přidám
\begtt
\input sjannon
\endtt
%
a mám vystaráno. Listing všech rodin ze Střešovické
písmolijny po zadání příkazu "\showfonts" najdeme na WWW stránce
\TeX{}ové podpory. Listing obsahuje 86 řádků týkajících se rodin fontů
ze Střešovic a na každém řádku je výčet variant dané rodiny.
Podrobnější informace o~makru OFS najdeme v~dokumentaci na
\url{http://petr.olsak.net/ftp/olsak/ofs}.
Dalším motivem k~napsání OFS byla skutečnost, že font se zhruba 370
znaky bylo nutno rozložit do dvou metrik. Přitom šlo o~to, aby byla
po ruce efektivní makra, která umožní mezi základní a rozšiřující
metrikou automaticky přepínat podle toho, jaký znak chceme vytisknout.
Tak jsem nakonec dospěl v~plainu k~něčemu podobnému, jako je v~NFSS
"\DeclareTextSymbol" a podobné věci, jen je to v~OFS
ještě trochu chytřejší a deklaruje se to mnohem logičtěji a přehledněji.
Na závěr si zkusíme porovnat, ve které z~následujících tří hlášek se
nejvýstižněji vysvětluje, v~jakém fontu došlo k~přetečení boxu:
\begtt
Overfull \hbox (9.36813pt too wide) in paragraph at lines 7--10
\tenrm mem, který vznikl v dílně pro-fe-sora Don-|
Overfull \hbox (9.36813pt too wide) in paragraph at lines 7--10
\IL2/ppl/m/n/12 mem, který vznikl v dílně pro-fe-sora Don-|
Overfull \hbox (9.36813pt too wide) in paragraph at lines 7--10
\Palatino-rm/at12pt mem, který vznikl v dílně pro-fe-sora Don-|
\endtt
První hlášení je klasické z~plainu, druhé při použití NFSS a třetí při
použití OFS v~plainu.
\subsec Tak trochu recenze k~fontům ze Střešovic
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Původně jsem chtěl napsat článek, který by byl recenzí na Štormovy
fonty. Nakonec jsem ale napsal také \uv{o~okolnostech vzniku \TeX{}ové
podpory} a teprve nyní se vracím k~původnímu předsevzetí.
Ty fonty se mi zdají po výtvarné stránce velmi zdařilé. Troufám
si dokonce říci, že plno fontů, které se objevují běžně v~operačních
systémech nebo jsou přibaleny k~nějakému kreslicímu programu, nesahají
svou kvalitou Štormovým fontům ani po kotníky.
Je třeba si uvědomit, že písma vznikají
v~{\it české\/} dílně ve Střešovicích
a dělá je absolvent Vysoké školy uměleckoprůmyslové, který je
držitelem několika ocenění za písma
a je uznávaným odborníkem mezi typografy. Buďme rádi, že taková
dílna u~nás vůbec existuje a že nejsme odkázáni jen na písma z~dovozu
(jejich autoři se na naše akcenty dívají jako na něco poněkud exotického
bez hlubšího pochopení souvislostí) nebo jen na písma počeštěná
programátory, a mnohdy typografy-amatéry.
Pokud jde o~technickou realizaci těch fontů, tak jsem plno problémů
podrobně popsal výše. Je potřeba odlišovat technické problémy, které
navíc pravděpodobně běžní zákazníci Střešovické písmolijny používající
komerční DTP programy nemají, od hodnocení kvality fontů po výtvarné
stránce a z~hlediska čitelnosti.
Oceňuji rozsáhlou nabídku chlebového písma, která možná (na rozdíl
od titulkových písem) po letmém prohlédnutí katalogu amatéra moc
nezaujme, ale o~to více se bude hodit při každodenní práci.
Fonty Regula Antiqua a Regula Kursiva chápu jen jako zajímavý
experiment, který se snaží do písma dostat dobovou patinu. Takto
jednoduše to ale asi nepůjde dělat, protože je příliš rychle patrné,
že stejná písmenka mají pořád se opakující stejné kazy. Kdyby mělo
každé písmenko aspoň pět variant, pak by se dalo v~\TeX{}u udělat
makýrko, které by do sazby náhodně vybíralo pro požadované písmeno pokaždé
jinou variantu. Možná by to vypadalo zajímavě, ale obávám se, že by to
pořád působilo dost uměle. Tisk takového textu na laserové tiskárně
nebo ofsetem je velmi vzdálen klasické technologii knihtisku, kdy i
hmatem na papíře ta písmenka někdy cítíme.
Kolegy \TeX{}isty bych chtěl upozornit, že některá písma (zvláště
jejich základní, tj.~netextové formy), mají poměrně vysoko umístěnu
horní dotažnici, takže se může stát, že se například desetibodová
velikost písma nevejde ani do dvanáctibodového řádkování. \TeX{}nicky
řečeno: i pro tyto parametry se hodí nastavit zápornou hodnotu
"\lineskiplimit". Lidově řečeno: i pro takové řádkování se může
s~velkou náhodou stát, že se písmenka ze dvou sousedních řádků
budou dotýkat.
Pokud bych měl Střešovické písmolijně něco vytknout, pak je to
chybějící decentní, ne příliš široké a čitelné neproporcionální písmo.
Chápu, že emulace psacího stroje nespadá do oblasti typografie, ale na
druhé straně si myslím, že takový font by našel použití v~počítačových
příručkách všeho druhu. Tam se s~velkou pravidelností objevují výpisy
počítačových programů, ukázky příkazových řádků systému a podobné
věci. Tyto záležitosti i v~dnešním světě moderních počítačů
si programátor na obrazovce svého monitoru zobrazuje nějakým čitelným
neproporcionálním fontem. Má k~tomu rozumné důvody. Je-li v~knize
pro takové ukázky použito proporcionální písmo, je to
přinejmenším nezvyklé.
Taky mě mrzí, že v~nabídce chybí matematické fonty. Tady ale naprosto
chápu, že nabídka se odvíjí od poptávky. Udělat kvalitní sadu
matematických fontů dá asi mnohem více práce, než výroba běžné
čtyř nebo dokonce šestiřezové rodiny. Zřejmě je poptávka
po matematických fontech mezi zákazníky v~DTP studiích
nulová, takže se to nevyplatí.
Ještě bych měl jednu připomínku týkající se znaku "ellipsis"
(tři tečky). Zarazilo mě, že ve všech fontech ze Střešovické
písmolijny je tento znak kreslen tak, jako by někdo napsal normálně
těsně za sebou tři tečky bez znalosti o~tom, co to je
elipsa\dots{} Vzpomínám si, jak jsme se s~tímto mikrotypografickým
problémem vydováděli v~\TeX{}u, když jsme zařazovali do kerningových
párů dvojici teček tak, aby byly více prostrčeny a aby ani diletanti
bez znalosti existence elipsy nebyli jednoduše schopni natlačit ty tři
tečky těsně vedle sebe. Každý \TeX{}ista je navíc hned v~úvodních manuálech
poučen, že nemá cpát tři tečky v~textu těsně za sebou, ale má použít
sekvenci "\dots", která vytiskne elipsu s~prostrkanými tečkami.
Při pohledu na znak "ellipsis" ve Štormových fontech
jsem se rozhodl {\it nenasměrovat\/} \TeX{}ovou sekvenci
"\dots" na tento znak, ale ponechat ji jako makro, které mezi trojici
teček přidává dodatečné mezery.
Rád bych zmínil existenci skvělého písmového
katalogu Střešovické písmolijny. Ten katalog je přesně
to, co bych od katalogu očekával. Jednotlivé řezy jsou ve všech
obvyklých velikostech sázeny v~běžném textu v~bloku, aby bylo vidět
jejich chování při normálním provozu. Také tam jsou náhledy stránek
včetně okrajů a střídání základního řezu s~kurzívou nebo tučným písmem,
jak bývá v~některých textech obvyklé. Nebo tam najdeme extrémní
zmenšení řezu až na hranici čitelnosti či naopak zvětšení, aby byly
vidět detaily. Ke katalogu bych měl jen jedinou výhradu: začala se mi
záhy rozlepovat vazba a musel jsem použít záchranné práce
s~lepidlem.
Při přechodu na verzi Typokatalogu~4 Internetové stránky Střešovické
písmolijny~\url{www.pismolijna.cz} po nějakou dobu nefungovaly
s~Netscapem~4.x. V~současné době už je zmíněná chyba odstraněna a
stránky spolupracují i s~uvedenou verzí prohlížeče. Stává se mi ovšem
bohužel velmi často, že webmasteři různých sajtů ignorují požadavky na
funkčnost stránek v~této verzi Netscape, a~přitom nemají důvod: jejich
stránky neobsahují žádný konkrétní efekt, který nejde v~uvedeném
prohlížeči realizovat. Je proto příjemné vědět, že stránky Střešovické
písmolijny mezi takové ignorantské sajty nepatří.
Licenční ujednání k~fontům je typicky komerční a z~technického pohledu
na věc obtížně interpretovatelné. Podobné ujednání ovšem najdeme i
u~jiných písmolijen, takže níže naznačené problémy nejsou ničím
specifickým jen pro Střešovickou písmolijnu.
Všechny komerční licence k~fontům se potýkají s~problémem typickým
pro tento druh software. Co to znamená \uv{použití} fontů? Je to
okamžik, kdy je potřeba použít jejich metrické údaje k~výpočtu sazby?
Domnívám se, že rozhodně ne. Metrické údaje k~fontům jsou volně
zveřejněny třeba i u~takových firem, jako je Adobe. Kdokoli je může
použít a teoreticky vypočítat rozložení sazby na stránkách. Když nemáme
vlastní popisy tvaru jednotlivých znaků, pak takový dokument stejně
nezrealizujeme do konečné podoby. Kdyby moje domněnka nebyla pravdivá,
pak bych výrazně porušil licenci zveřejněním metrických údajů ke všem
Štormovým fontům ve formátu \TeX{} na Internetu. Jsem ale přesvědčen,
že jsem licenci tímto krokem neporušil, protože jsem zveřejnil {\it
jen\/} metrické údaje bez informací o~tvarech jednotlivých znaků.
Jiná interpretace slova \uv{použití} fontů by mohla tvrdit, že se
jedná o~okamžik downloadování popisů tvarů znaků do dokumentu. To se
asi nejvíce blíží pojetí licence na fonty. Je ovšem důležité se
vyvarovat možnosti volně zveřejnit na Internetu nebo někomu poskytnout
dokument s~úplnými downloadovanými fonty, protože by je kdokoli trochu
více vládnoucí počítačem mohl z~tohoto dokumentu vykostit a začít
nelegálně \uv{používat}. V~tom případě by měl podle mého názoru na
takovém stavu vinu i ten, kdo dokument zveřejnil, protože on tomu
pirátovi umožnil jednoduše krádež. Právníci by se na takovém případě
asi vydováděli. Ve Štormově licenci je o~tomto problému také zmínka:
\uv{Smíte poskytnout kopii písma (písem) použitého
v~určitém dokumentu tiskárně zakázek nebo servisnímu
pracovišti, pouze pokud toto již vlastní
platnou licenci od S.~P. k~užívání příslušného
písmového softwaru.}
Dalším výkladem slova \uv{použití} fontů by mohl být okamžik, kdy je
třeba vytvořit tvary znaků podle jejich matematických popisů. To se
děje v~osvitových jednotkách, v~tiskárnách a při náhledech též
přímo v~počítači. Když vytvoříme dokument s~downloadovanými fonty a
pošleme jej na některé z~uvedených zařízení, teprve pak se fonty
v~tomto smyslu \uv{použijí}. Licence Střešovické písmolijny proto
uvádí, že je možno takto fonty~\uv{použít} na neomezeném počtu
tiskáren a osvitových jednotek, ovšem v~základní licenci je dovoleno
jen do jednoho takového výstupního zařízení fonty trvale instalovat.
Typicky nepočítačový, ale jistě správný, výklad slova
\uv{použití} písma je okamžik, kdy text čte čtenář.
Pokud má třeba Vieweghova kniha náklad několika set
tisíc výtisků, pak je \uv{použití} písma v~takové knize
řekl bych skoro lidové. To licence vůbec neřeší, ale možná by měla.
Otázka možnosti \uv{použití} jakéhokoli softwaru na limitovaném počtu
počítačů je rovněž problematická, pokud vezmeme v~úvahu propojení
počítačů do sítě. Tam můžeme software reálně instalovat jen na jediném
počítači a ostatní pracoviště mohou sloužit jako grafické
terminály k~tomuto počítači. Z~technického pohledu software pracuje
pouze na jediném počítači (protože jedničky a nuly takového software se
odehrávají v~elektrických obvodech tohoto jediného počítače) a
ke koncovému pracovišti je přiveden po síti jen výsledný obraz dané
aplikace. Takových pracovišť sloužících jako grafické terminály ovšem
může být k~tomu centrálnímu počítači připojeno libovolně mnoho a
současně na tom počítači může tedy pracovat velmi mnoho
uživatelů. Existenci takových multiuživatelských počítačů většina
softwarových licencí vůbec neřeší. Asi proto, že právníky, kteří texty
licencí navrhují, takové technické řešení vůbec nenapadlo. Oni možná
jsou schopni si pod pojmem počítač představit jen osobní PC, na kterém
v~jednu chvíli může pracovat jen jeden člověk.
Základní licence ke Štormovým fontům má limit pěti počítačů. Ani tato
licence neřeší možnost existence víceuživatelských počítačů s~větším
množstvím terminálů na nezávislých pracovištích.
Moje úvaha k~licenci neznamená, že bych ji chtěl nějak
zpochybnit. Rozumím tomu jednoduše tak,
že při masovějším \uv{použití} písma v~DTP
studiích a reklamních agenturách s~více zaměstnanci
je potřeba za to písmo připlatit. Jednotlivec při
zakoupení licence k~fontu dostane standardní limit \uv{pět počítačů}.
Na rozdíl od obrovských softwarových společností při
nákupu licence k~fontům ze Střešovic dáváme peníze konkrétnímu
člověkovi, který {\it osobně\/} za svou práci ručí. Považuji to za
velký rozdíl a myslím si, že se to pozná i podle
přístupu k~zákazníkům.
\subsec Písmo Lido
%%%%%%%%%%%%%%%%%%
Pan Štorm uvolnil pro bezplatné šíření na Internetu šest řezů písma
Lido. Původně se jednalo o~zakázku pro Lidové noviny (odtud asi
pramení název), ale nakonec z~této zakázky sešlo. Sazeči v~tomto
deníku nadále používají běžné písmo Times New Roman, které je součástí
operačního systému MS~Windows.
Uvolněné písmo Lido je na Internetu k dostání pouze ve verzi TrueType,
přičemž pro profesionální použití ve verzi Type~1 je potřeba zaplatit
licenční poplatek.
Protože TrueTypové verze písma se v~\TeX{}u dají použít jen
v~některých distribucích nebo po konverzi fontu na Type~1, pan Štorm
se nakonec rozhodl udělat pro \TeX{}isty výjimku a umožnit jim
používat zdarma i {\tt pfb} formát těchto fontů. Fonty jsem zařadil do
archivu {\tt slido.tgz} a umístil na \url{www.cstug.cz/stormtype}.
Samozřejmě je i při použití těchto písem nutné dodržovat licenční ujednání.
%\vfil\break
\input typomono
\end
|
https://www.cmi.ac.in/~ramprasad/lecturenotes/algcomp/lecture15.tex | cmi.ac.in | CC-MAIN-2020-45 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2020-45/segments/1603107912807.78/warc/CC-MAIN-20201031032847-20201031062847-00671.warc.gz | 617,722,701 | 4,618 | \documentclass[11pt]{article}
\usepackage{latexsym}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{hyperref}
\usepackage{algorithmic}
\usepackage{algorithm}
\newcommand{\handout}[5]{
\noindent
\begin{center}
\framebox{
\vbox{
\hbox to 5.78in { {\bf Algebra and Computation } \hfill Course Instructor: #2 }
\vspace{4mm}
\hbox to 5.78in { {\Large \hfill #5 \hfill} }
\vspace{2mm}
\hbox to 5.78in { {\em #3 \hfill #4} }
}
}
\end{center}
\vspace*{4mm}
}
\newcommand{\lecture}[4]{\handout{#1}{#2}{Lecturer: #3}{Scribe: #4}{Lecture #1}}
\newtheorem{theorem}{Theorem}
\newtheorem{theorem*}{Theorem}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{observation}[theorem]{Observation}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{claim}[theorem]{Claim}
\newtheorem{fact}[theorem]{Fact}
\newtheorem{subclaim}[theorem]{Subclaim}
% my custom commands
\newcommand{\inparen}[1]{\left(#1\right)} %\inparen{x+y} is (x+y)
\newcommand{\inbrace}[1]{\left\{#1\right\}} %\inbrace{x+y} is {x+y}
\newcommand{\insquar}[1]{\left[#1\right]} %\insquar{x+y} is [x+y]
\newcommand{\inangle}[1]{\left\langle#1\right\rangle} %\inangle{A} is <A>
\newcommand{\abs}[1]{\left|#1\right|} %\abs{x} is |x|
\newcommand{\norm}[1]{\left\Vert#1\right\Vert} %\norm{x} is ||x||
\newcommand{\union}{\cup}
\newcommand{\Union}{\bigcup}
\newcommand{\intersection}{\cap}
\newcommand{\super}[2]{#1^{\inparen{#2}}} %\super{G}{i-1} is G^{(i-1)}
\newcommand{\setdef}[2]{\inbrace{{#1}\ : \ {#2}}}
\newcommand{\inv}[1]{#1^{-1}}
% Commands specific to this file
% TODO: Find the right way to typeset group index
\DeclareMathOperator{\Sym}{Sym}
\newcommand{\gpidx}[2]{\insquar{#1 : #2}} %\gpidx{H}{K} is [H : K]
\newcommand{\gpigs}[2]{\gpidx{\super{G}{#1}}{\super{G}{#2}}} %Group index of g super ...
\newcommand{\llhd}{\!\!\lhd\!\!\lhd}
% \newcommand{\ceil}[1]{\lceil #1 \rceil}
\newcommand{\floor}[1]{\lfloor #1 \rfloor}
% \newcommand{\f}{\mathbb{F}}
% \newcommand{\R}{\mathbb{R}}
%for algorithms
\renewcommand{\algorithmicrequire}{\textbf{Input:}}
\begin{document}
\lecture{15: Bivariate Factorization: Missing Pieces}{V. Arvind}{V.
Arvind}{Ramprasad Saptharishi}
\section{Overview}
Last class we did bivariate factorization, but we made some
assumptions in the beginning. The hope was that with some
preprocessing, the assumptions can be guarenteed. This class we shall
see what those preprocessing steps are.
After that, we shall discuass a Hensel Lifting take on Newton's root
finding algorithm.
\section{The Missing Pieces}
The algorithm relies on the assumption that the factorization of $f$
and $f(x,0)$ is square free since we want the pseodo-gcd of factors to
be $1.$ We need to make sure that we can pull out repeated factors in
the beginning.
\subsection{$f$ is square free}
In the univariate case, this was trivial since we just had to take the
derivative and do it. Multivariate cases are a little tricky. The
first step is to remove the {\em content} of each variable from the
polynomial.
Think of the polynomail $f$ as one over $F[y][x]$, a univariate
polynomial with coefficients coming from $F[y].$ The $y$-content of
$f$ is defined as the $\gcd$ of the coefficients of the polynomial
when considered as one in $F[y][x].$
The $x$-content and $y$-content are clearly factors of $f$ and hence
we can factorize them using univariate factorization. Hence we can
assume that
$$
f = f_1^{e_1}f_2^{e_2}\cdots f_k^{e_k}
$$
where each $f_i$ is an irreducible factor with $x$-content and
$y$-content being $1.$ Let us look at this as $f = f_1^e h.$ Then,
$$
\pderiv{f}{x} = ef_1^{e-1}h\pderiv{f_1}{x} + f_1^e\pderiv{h}{x}
$$
Suppose both $\pderiv{f}{x}$ and $\pderiv{f}{y}$ are zero, then the
only way this can happen if each power of $x$ and $y$ is a multiple of
$p.$ Hence $f(x,y) = g(x^p,y^p)$ and this can be checked easily and it
now just amounts to factorizing $g.$
We can now assume without loss of generality that $\pderiv{f}{x}$ is
non-zero. Now suppose that $\pderiv{f_1}{x}$ was non-zero, then
clearly from the above equation the largest power of $f_1$ that
divides $\pderiv{f}{x}$ is $f^{e-1}.$
Let $u = \pderiv{f}{x}$, $v = \pderiv{f}{y}$, $u' = f/\gcd(f,u)$ and
$v' = f/\gcd(f,v)$, whenever they are non-zero. The bad news is that,
since some of the $\pderiv{f_i}{x}$ could be zero, it misses out the
factors that are $x^p$ polynomials. The good news is that, these are
the only things that $u'$ and $v'$ would miss.
Hence, factorize $u'$ and $v'$, then divide $f$ by the collection of
factors. We are then assured that the remaining factors have to be
polynomails of $x^p$ and $y^p$. We can them make the transformation
and recurse.
Thus, we can ensure that $f$ does not have any repeated factors.
\subsection{$f(x,0)$ is square free}
Though we have $f(x,y)$ to be square free, substituting $0$ for $y$
would case certain factors to collapse; $f(x,0)$ could have repeated
roots. The trick is to make a small change of variables to ensure that
it is square free.
Replace $f(x,y)$ by $f_\beta(x,y) = f(x,y+\beta).$ We need to show
that there exists a $\beta$ such that $f(x,\beta) = f_\beta(x,0)$ is
square free.
If $f' = 0$, then reverse the roles of $x$ and $y$ (if both are zero,
then it is a polynomial of $x^p$ and $y^p$). Note that $\gcd(f,f')
\neq 1$ if and only if $Res_x(f,f')=0.$ And since the resultant is a
polynomial of degree $2d^2$, this can have atmost $2d^2$ roots of $F.$
Hence if $|F| > 2d$, we can just substitute $2d^2+1$ values for $y$ and
we would get a polynomial where the residue is non-zero, and thus
$f_\beta(x,0)$ would be square free.
Hence, all that's left to do is the case when $|F| \leq 2d^2.$ The
trick is to go to a larger field and work there. Suppose $F$ =
$\F_q$, choose a prime $t$ such that $q^t > 2d^2$ and $t>\deg f.$
Replace $F$ by $\F_{q^t}$ (just find an irreducible polynomial of
degree $t$ and work in $\F_q$ modulo that polynomial). In this larger
field, the irreducible factors could split even further.
$$
f = f_1'f_2'\cdots f_{k'}'
$$
where bunches of these factors correspond to the original factors. To
study these bunches, we need an important map known as the {\em
Frobenius map.}
\begin{eqnarray*}
\sigma:\F_{q^t} &\longrightarrow & \F_{q^t}\\
a & \mapsto & a^q
\end{eqnarray*}
Note that the map fixes every element of $\F_q$ pointwise, and is an
automorphism. This can be naturally extended to the ring $\F_q[x,y].$
And since $f_1 \in \F_q[x,y]$, the frobenius map will fix it. We are
interested in finding the bunch of $f_i'$ that correspond to $f_1.$
Suppose $f_1'\mid f_1$, then by the automorphism, $\sigma(f_1') \mid
f_1$, $\sigma^2(f_1') \mid f_1$ and so on.
Since $\sigma^t(f_1') = f_1'$, for any $r$ such that $\sigma^r(f_1') =
f_1'$ will force $r$ to divide $t.$ Since $t$ is chosen to be a prime,
either $r=t$ or $r=1.$ If $r=t$, then each of the $t$ elements of the
form $\sigma^i(f_1')$ would be a factor of $f_1.$ But since $t > \deg
f$, all of them cannot fit inside $f$.
Hence $r=1$, and thus the factorization does not fit further in
$\F_{q^t}.$ We can now hunt for a $\beta$ here to make it square
free.
\section{Hensel Lifting and Newton Rhapson}
Suppose we are given a polynomial $f(x) \in \Z[x]$, we want to find a
root of $f$ efficiently by successive approximations. We shall do this
using Hensel lifting.
Pick a small prime $p$ such that $f(x)$ is square free.
\begin{eqnarray*}
f(x) & = & f_0 + f_1x + f_2x^2 + \cdots f_nx^n\\
f(x+h) & = & \sum_{i=1}^n f_i(x+h)^i\\
& = & \sum_{i=1}^n f_i(x^i + ihx^i-1 + \cdots )\\
& = & f(x) + hf'(x) + h^2P(x,h)
\end{eqnarray*}
Now using Berlekamp's algorithm, find an $x$ such that $f(x) = 0 \pmod
p.$ Suppose there exists an $\hat{x}$ such that $\hat{x} = x\pmod{p}$
and $f(\hat{x}) = 0$ then $\hat{x} = x + ap$. And hence
\begin{eqnarray*}
f(\hat{x}) & = & f(x) + apf'(x) + a^2p^2P(x,ap)\\
\implies 0 = f(\hat{x}) & = & f(x) + apf'(x) \pmod{p^2}
\end{eqnarray*}
Since $f(x) = 0\pmod{p}$, it makes sense to talk about
$\inparen{f(x)/p}.$ Thus, if we were to choose $a =
\inparen{-f(x)/p}\insquar{f'(x)}^{-1}$, the above equation would be
satisfied.
\begin{eqnarray*}
a & = & \inparen{\frac{-f(x)}{p}}\insquar{f'(x)}^{-1}\pmod{p}\\
\implies \hat{x} & = & x - f(x)\insquar{f'(x)}^{-1} \pmod{p}
\end{eqnarray*}
Thus, from a factorization modulo $p$, we have gone up to $p^2$ with
$\hat{x}$ as our next approximation. \\
Newton-Rhapson also has the similar expression. You are given a
function $f$, you choose a random point $x$. The next approximation is
given by drawing the tangent to the curve $f$ at $(x,f(x))$ and taking
the point where this tangent meets the $x$-axis as its next
approximation.
The following picture would make it clear.
\includegraphics[width=2.5in]{newton.png}
If the coordinate of $C$ was $\hat{x}$, our next approximation,
\begin{eqnarray*}
f'(x) & = & \frac{f(x)}{x - \hat{x}}\\
\implies \hat{x} = x - \frac{f(x)}{f'(x)}
\end{eqnarray*}
which is exactly what we got in the Hensel Lifting method.
Newton's method however require floating point arithmetic (since
division by $f'(x)$ is actual division, unlike inverse modulo $p$ in
the hensel lifting case), while it enjoys the ease of not having to
find the inverse modulo a number.
%%% Local Variables:
%%% mode: latex
%%% TeX-master: "lecture15"
%%% End:
\end{document}
|
https://www.ttp.kit.edu/Preprints/ttp/ttp10/ttp10-46/2loopgutthresh_dias.tex | kit.edu | CC-MAIN-2019-35 | text/x-tex | application/x-tex | crawl-data/CC-MAIN-2019-35/segments/1566027313501.0/warc/CC-MAIN-20190817222907-20190818004907-00287.warc.gz | 1,022,637,097 | 2,007 | \SetScale{0.5}
%
% diagram 254, top2l_2p_6
\begin{minipage}[t]{3.8cm}
\begin{picture}(170,70)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashCArc(150,50)(40,100,180){8}
\SetColor{Blue}
\SetWidth{3}
\DashCArc(150,50)(40,180,360){8}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(169,72)(30,148,317){4}{6}
\SetColor{Blue}
\SetWidth{3}
\DashCArc(161,62)(32,-22,125){8}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(60,50)(110,50){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(190,50)(240,50){4}{4}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(144,89){2}
%\Text(55,40)[]{\scriptsize$G$}
%\Text(55,9)[]{\scriptsize$G$}
%\Text(81,31)[]{\scriptsize$A_\mu$}
%\Text(100,42)[]{\scriptsize$G$}
\end{picture}
\end{minipage}
%
% diagram 63, top2l_2p_7
\begin{minipage}[t]{3.8cm}
\begin{picture}(170,70)(0,0)
\SetColor{Red}
\SetWidth{3}
\DashCArc(150,90)(40,0,180){16}
\SetColor{Red}
\SetWidth{3}
\DashLine(110,90)(190,90){16}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,90)(40,180,270){4}{5}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,90)(40,270,360){4}{5}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(60,50)(150,50){4}{7}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,50)(240,50){4}{7}
\SetColor{Black}
\Vertex(190,90){2}
\Vertex(110,90){2}
\Vertex(150,50){2}
%\Text(78,59)[]{\scriptsize$H_2$}
%\Text(80,40)[]{\scriptsize$H_1$}
%\Text(50,33)[]{\scriptsize$A_\mu$}
%\Text(100,33)[]{\scriptsize$A_\mu$}
\end{picture}
\end{minipage}
%
% diagram 2, top2l_2p_1
\begin{minipage}[t]{3.8cm}
\begin{picture}(170,70)(0,0)
\SetColor{Blue}
\SetWidth{3}
\Gluon(110,50)(190,50){4}{6}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,180){4}{9}
\SetColor{Black}
\SetWidth{0.5}
\GlueArc(150,50)(40,180,360){4}{9}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(60,50)(110,50){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(190,50)(240,50){4}{4}
\SetColor{Black}
\Vertex(110,50){2}
\Vertex(190,50){2}
%\Text(75,54)[]{\scriptsize$A_\mu$}
%\Text(75,32)[]{\scriptsize$A_\mu$}
%\Text(49,10)[]{\scriptsize$A_\mu$}
\end{picture}
\end{minipage}
%
% diagram 3, top2l_2p_2
\begin{minipage}[t]{3.8cm}
\begin{picture}(170,70)(0,0)
\SetColor{Black}
\SetWidth{0.5}
\ArrowLine(150,10)(150,90)
\SetColor{Black}
\SetWidth{0.5}
\ArrowArc(150,50)(40,90,180)
\SetColor{Black}
\SetWidth{0.5}
\ArrowArc(150,50)(40,180,270)
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,90){4}{4}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,270,360){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(60,50)(110,50){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(190,50)(240,50){4}{4}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(150,10){2}
\Vertex(150,90){2}
%\GText(150,35){0.95}{fl}
%\GText(115,90){0.95}{fl}
%\GText(115,10){0.95}{fl}
%\GText(180,90){0.95}{Xlgut}
%\GText(180,10){0.95}{Xtgut}
\end{picture}
\end{minipage}
%
%
%
% diagram 6, top2l_2p_4
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,90)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashArrowArc(150,50)(40,180,360){2}
\SetColor{Blue}
\SetWidth{3}
\DashCArc(150,50)(40,130,180){8}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,50){4}{3}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,82)(23,180,360){4}{6}
\SetColor{Blue}
\SetWidth{3}
\DashCArc(150,82)(23,0,180){8}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(173,81){2}
\Vertex(127,81){2}
%\GText(170,10){0.95}{cgut}
%\GText(105,70){0.95}{GoldGut}
%\GText(190,70){0.95}{Xlgut}
%\GText(150,60){0.95}{Xtgut}
%\GText(165,105){0.95}{GoldGut}
%\BText(70,90){6}
\end{picture}
\end{minipage}
%
%
% diagram 34, top2l_2p_3
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,90)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashArrowArc(150,50)(40,180,360){2}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,90,180){4}{4}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,90){4}{4}
\SetColor{Green}
\SetWidth{3}
\DashCArc(150,115)(25,-90,270){8}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(150,90){2}
%\GText(165,10){0.95}{cgut}
%\GText(115,80){0.95}{Xlgut}
%\GText(180,80){0.95}{Xtgut}
%\GText(165,130){0.95}{Sgut}
%\BText(70,80){34}
\end{picture}
\end{minipage}
%
%
% diagram 5, top2l_2p_4
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,90)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashArrowArc(150,50)(40,180,360){2}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,130,180){4}{3}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,50){4}{3}
\SetColor{Black}
\SetWidth{0.5}
\DashCArc(150,82)(23,180,360){8}
\SetColor{Green}
\SetWidth{3}
\DashCArc(150,82)(23,0,180){8}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(173,81){2}
\Vertex(127,81){2}
%\GText(170,10){0.95}{cgut}
%\GText(105,70){0.95}{Xlgut}
%\GText(190,70){0.95}{Xlgut}
%\GText(150,60){0.95}{Sl}
%\GText(165,105){0.95}{Sgut}
%\BText(70,90){5}
\end{picture}
\end{minipage}
%
%
% diagram 38, top2l_2p_2
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,90)(0,0)
\SetColor{Blue}
\SetWidth{3}
\Gluon(150,90)(150,10){4}{6}
\SetColor{Blue}
\SetWidth{3}
\DashArrowArc(150,50)(40,270,360){2}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowArc(150,50)(40,180,270){2}
\SetColor{Blue}
\SetWidth{3}
\GlueArc(150,50)(40,0,90){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\GlueArc(150,50)(40,90,180 ){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(190,50){2}
\Vertex(110,50){2}
\Vertex(150,10){2}
\Vertex(150,90){2}
%\GText(150,35){0.95}{Xtgut}
%\GText(115,90){0.95}{g}
%\GText(115,10){0.95}{c}
%\GText(180,90){0.95}{Xlgut}
%\GText(180,10){0.95}{cgut}
%\BText(70,80){38}
\end{picture}
\end{minipage}
%
%
%
% diagram 18, top2l_3p_40
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,100)(0,0)
\SetColor{Blue}
\SetWidth{3}
\Gluon(190,50)(150,115){4}{6}
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(110,50)(190,50){2}
\SetColor{Blue}
\SetWidth{0.5}
\DashLine(150,115)(139,96){8}
\SetColor{Blue}
\SetWidth{3}
\Gluon(123,70)(110,50){4}{3}
\SetColor{Green}
\SetWidth{3}
\DashCArc(131,83)(15,55,241){8}
\SetColor{Black}
\SetWidth{0.5}
\DashCArc(131,83)(15,-119,55){8}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,115)(150,150){4}{3}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(110,50){2}
\Vertex(139,96){2}
\Vertex(123,70){2}
\Vertex(150,115){2}
\Vertex(190,50){2}
%\GText(170,100){0.95}{Xlgut}
%\GText(165,50){0.95}{cgut}
%\GText(140,110){0.95}{GoldGut}
%\GText(110,95){0.95}{Sgut}
%\GText(150,77){0.95}{Sl}
%\GText(110,65){0.95}{Xlgut}
%\BText(75,95){18}
\end{picture}
\end{minipage}
%
% diagram 1, top2l_3p_36
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,100)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashLine(110,50)(127,77){8}
\SetColor{Blue}
\SetWidth{3}
\Gluon(127,77)(150,115){4}{3}
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(110,50)(190,50){2}
\SetColor{Blue}
\SetWidth{3}
\Gluon(150,115)(173,77){4}{3}
\SetColor{Blue}
\SetWidth{3}
\Gluon(173,77)(190,50){4}{3}
\SetColor{Red}
\SetWidth{3}
\DashCArc(150,115)(45,239,301){16}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,115)(150,150){4}{3}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(127,77){2}
\Vertex(173,77){2}
\Vertex(150,115){2}
\Vertex(110,50){2}
\Vertex(190,50){2}
%\GText(150,50){0.95}{cgut}
%\GText(115,70){0.95}{GoldGut}
%\GText(185,70){0.95}{Xlgut}
%\GText(130,100){0.95}{Xtgut}
%\GText(175,100){0.95}{Xlgut}
%\GText(150,70){0.95}{Hgut1}
%\BText(75,95){1}
\end{picture}
\end{minipage}
%
% diagram 1, top2l_3p_34
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,100)(0,0)
\SetColor{Red}
\SetWidth{3}
\DashLine(110,100)(150,140){16}
\SetColor{Red}
\SetWidth{3}
\DashLine(150,140)(190,100){16}
\SetColor{Blue}
\SetWidth{3}
\Gluon(110,50)(110,100){4}{4}
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(190,100)(190,50){2}
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(110,50)(190,100){2}
\SetColor{Blue}
\SetWidth{3}
\Gluon(190,50)(110,100){4}{8}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,140)(150,180){4}{4}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(150,140){2}
\Vertex(110,50){2}
\Vertex(190,50){2}
\Vertex(110,100){2}
\Vertex(190,100){2}
%\GText(102,80){0.95}{Xl}
%\GText(198,80){0.95}{cgut}
%\GText(130,65){0.95}{cgut}
%\GText(170,65){0.95}{Xt}
%\GText(130,120){0.95}{Hgut2}
%\GText(170,120){0.95}{Hgut3}
%\BText(70,95){1}
\end{picture}
\end{minipage}
%
% diagram 1, top2l_3p_20
\begin{minipage}[b]{3.8cm}
\begin{picture}(170,100)(0,0)
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(110,50)(150,50){2}
\SetColor{Blue}
\SetWidth{3}
\DashArrowLine(150,50)(190,50){2}
\SetColor{Blue}
\SetWidth{3}
\Gluon(110,50)(150,115){4}{6}
\SetColor{Blue}
\SetWidth{3}
\Gluon(150,115)(190,50){4}{6}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,50)(150,115){4}{6}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(60,50)(110,50){2}
\SetColor{Black}
\SetWidth{0.5}
\Gluon(150,115)(150,150){4}{3}
\SetColor{Black}
\SetWidth{0.5}
\DashArrowLine(190,50)(240,50){2}
\SetColor{Black}
\Vertex(110,50){2}
\Vertex(150,115){2}
\Vertex(150,50){2}
\Vertex(190,50){2}
%\GText(130,50){0.95}{cgut}
%\GText(170,50){0.95}{cgut}
%\GText(125,85){0.95}{Xtgut}
%\GText(150,80){0.95}{g}
%\GText(175,85){0.95}{Xgut}
%\BText(75,95){1}
\end{picture}
\end{minipage}
%
|
Subsets and Splits