http://www.nursingresearch.co.nz/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%201618%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=15&rowOffset=&wrapResults=1&citeOrder=creation-date&citeStyle=APA&exportFormat=RIS&exportType=html&exportStylesheet=&citeType=LaTeX&headerMsg=

nursingresearch.co.nz

CC-MAIN-2019-35

application/x-latex

application/x-latex

crawl-data/CC-MAIN-2019-35/segments/1566027314959.58/warc/CC-MAIN-20190819201207-20190819223207-00438.warc.gz

%&LaTeX \documentclass{article} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{Brown2019} Brown, J. (2019). \textit{Thorn in the flesh: the experience of women living with surgical mesh complications}. Master{\textquoteright}s thesis, University of Otago, Dunedin. Retrieved August 20, 2019, from https://www.nzno.org.nz/resources/library/theses \end{thebibliography} \end{document}

http://theanarchistlibrary.org/library/benjamin-tucker-tolstoyism-gone-to-seed.tex

theanarchistlibrary.org

CC-MAIN-2020-29

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2020-29/segments/1593655924908.55/warc/CC-MAIN-20200711064158-20200711094158-00361.warc.gz

\documentclass[DIV=12,% BCOR=10mm,% headinclude=false,% footinclude=false,% fontsize=11pt,% twoside,% paper=210mm:11in]% {scrartcl} \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{english} \let\chapter\section % 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{bigfoot} \usepackage{perpage} \DeclareNewFootnote{default} \DeclareNewFootnote{B} \MakeSorted{footnoteB} \renewcommand*\thefootnoteB{(\arabic{footnoteB})} % 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{“Tolstoyism Gone to Seed”} \date{November 25, 1927} \author{Benjamin Tucker} \subtitle{} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={“Tolstoyism Gone to Seed”},% pdfauthor={Benjamin Tucker},% pdfsubject={},% pdfkeywords={letter}% } \begin{document} \thispagestyle{empty} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge “Tolstoyism Gone to Seed”\par}}% \vskip 1em \vskip 2em {\usekomafont{author}{Benjamin Tucker\par}}% \vskip 1.5em {\usekomafont{date}{November 25, 1927\par}}% \end{center} \vskip 3em \par November 25, 1927 Dear Mr. Schumm: I wrote you of the proposition of the National Institute for the Blind regarding ‘The Ego and His Own.’ It turns out to be a bit less encouraging than the first letters to Fifield indicated. Not bad, though, after all. What it amounts to is this; a copy is to be cut in raised type, by hand, by a volunteer, for Helen Keller, and a duplicate is to be put in the general library of raised type for the blind. I suppose, then, that Helen Keller is interested, or, if not, that some enthusiastic person hopes to interest her. One sees now in Russia the perfect realization of “peace at any price,’ a land that knows not hate, the flowering of the gospel of universal love, Tolstoyism gone to seed. What a spectacle does that unhappy country present today! Simple, stupid, sodden; reeking, rotting, rampant; a deliquescent nest of life that crawls and creeps, she melts, she sprawls, she slops, she stinks! A gigantic Camembert, in the last disgusting stage. Yours sincereley, Benj R. Tucker c\Slash{}o Munroe \& Co. 4 rue Ventadour Paris, France % 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} Benjamin Tucker “Tolstoyism Gone to Seed” November 25, 1927 \bigskip Retrieved on 2016-10-28 from http:\Slash{}\Slash{}marxists.architexturez.net\Slash{}archive\Slash{}tucker\Slash{}1927\Slash{}tolstoyism.htm Source: Benjamin R. Tucker Papers, New York Public Library; Transcribed: by Mitchell Abidor, 2009. \bigskip \textbf{theanarchistlibrary.org} \end{center} % end final page with colophon \end{document}

http://release-notes.trms.com/tex/199

trms.com

CC-MAIN-2023-14

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2023-14/segments/1679296945376.29/warc/CC-MAIN-20230325222822-20230326012822-00021.warc.gz

\section{Carousel 5.1.3 Release Notes} \begin{description} \item[{\color{red} \textbf{3119} \textbf{Configuration window nesting problem} \textbf{Added a missing target attribute to the "main menu" link in the error screen.} \item[{\color{red} \textbf{3159} \textbf{Possible crash when the DisplayEngine displays many zones} \textbf{Fixed issue where the DisplayEngine was not allocating enough memory for its internal zone list which could potentially corrupt memory and crash with a large number of zones.} \item[{\color{red} \textbf{3163} \textbf{5.1.2's DisplayEngine won't launch on some systems} \textbf{Fixed issue where the DisplayEngine required runtime libraries that weren't available on some systems.} \end{description}

https://www.math.bgu.ac.il/en/teaching/fall2021/courses/linear-algebra-for-biotechnology.tex

bgu.ac.il

CC-MAIN-2022-49

text/tex

application/x-tex

crawl-data/CC-MAIN-2022-49/segments/1669446710900.9/warc/CC-MAIN-20221202082526-20221202112526-00737.warc.gz

\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://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{english} \setotherlanguage{hebrew} \setmainfont[Ligatures=TeX]{Libertinus Serif} \SepMark{‭.} \robustify\hebrewnumeral \robustify\Hebrewnumeral \robustify\Hebrewnumeralfinal % vim: ft=eruby.tex: \begin{document} \pagestyle{empty} \pagenumbering{gobble} \pagestyle{fancy} \begin{center} \huge{The Department of Mathematics}\\[0.1\baselineskip] \Large{2020--21--A term}\\[0.2\baselineskip] \end{center} \begin{description} \item[Course Name] Linear Algebra for Biotechnology \item[Course Number] \LRE{201‭.1‭.9551} \item[Course web page]\mbox{}\\ \url{https://www.math.bgu.ac.il//en/teaching/fall2021/courses/linear-algebra-for-biotechnology} \item[Lecturer] Dr. Natalia Gulko, \nolinkurl{<gulko@post.bgu.ac.il>}, Office מינוס 108 \item[Office Hours] \url{https://www.math.bgu.ac.il/en/teaching/hours} \end{description} \section*{Abstract} \section*{Requirements and grading\footnote{Information may change during the first two weeks of the term. Please consult the webpage for updates}} \section*{Course topics} Complex numbers.Systems of linear equations. Solving linear systems: row reduction and echelon forms. Homogenous and inhomogenous systems.Rank of matrix.Vector spaces. Linearly independent and linearly dependent sets of vectors. Linear combinations of vectors.Inner (dot) product, length, and orthogonality. The Gram - Schmidt process.Matrices: vector space of matrices, linear matrix operations, matrix multiplication, inverse matrix. An algorithm for finding inverse matrix by means of elementary row operations.Rank of matrix and its invertibility. Solving systems of linear equations by means of inverse matrix.Determinants. Condition detA=0 and its meaning. Tranposed matrix.Eigenvectors and eigenvalues. The characteristic polynomial and characteristic equation. Finding of eigenvectors and eigenvalues.Diagonalization and diagonalizable matrices. Symmetric matrices. % vim: ft=eruby.tex: \end{document} % vim: ft=eruby.tex:

https://www.freehaven.net/doc/fh-related-pubs.tex

freehaven.net

CC-MAIN-2019-13

application/x-tex

application/x-tex

crawl-data/CC-MAIN-2019-13/segments/1552912203326.34/warc/CC-MAIN-20190324043400-20190324065400-00344.warc.gz

\section{Publication Services} There are a number of projects and papers which discuss anonymous publication services. We start this section by providing an overview of some of the related projects and papers. After this overview, we examine in detail the amount of anonymity and privacy protection that each project offers. \subsection{The Eternity Service} Ross Anderson's paper on the Eternity Service \cite{eternity} is the motivation for this entire project. It includes a wonderful vision of how the world might work in the future, in terms of data havens and distributed decentralized data storage. The overall goal is to build a system that provides highly available data: as Anderson phrases, it ``[t]he basic idea is to use redundancy and scattering techniques to replicate data across a large set of machines (such as the Internet), and add anonymity mechanisms to drive up the cost of selective service denial attacks.'' A publisher would upload a document and some digital cash, along with a requested file duration (cost would be based on document size and desired duration). In the simple design, a publisher would upload the document to 100 servers, and remember ten of these servers for the purposes of auditing their performance. Because he does not record most of the servers to whom he submitted the file, there is no way to identify which of the participating eternity servers are storing his file. Document queries are done via broadcast, and document delivery is achieved through one-way anonymous remailers. On the other hand, it relies on a stable digital cash scheme, which is certainly not available today. Further, it has a strong correlation between ability to store data into the system and amount of real-world capital available. While our proposal does have a loose correlation between available resources and amount of influence over the servnet, the correlation is not nearly as direct. There are also a number of contradictions and other issues which are not addressed in his brief paper: for instance, if documents are submitted anonymously but publishers are expected to remember a random sample of servers so they can audit them, what do they do when they find that some server is cheating? Since publishers are anonymous, it would seem that they have no power at all. Anderson passes this responsibility on to the digital cash itself, so servers do not receive payment if they stop providing the associated service. He does not elaborate on the possible implications of this increased accountability to the anonymity of the authors. Another problem is that there is no consideration at all to maintaining a dynamic list of available servers and allowing servers to smoothly join and leave. He proposes that a directory of files in the system should itself be a file in the system. However, without a mechanism for updating or revising files, this would appear very difficult to achieve. \subsection{The {\tt .cz} implementation} A team of students at Charles University in Czechoslovakia decided to implement their version \cite{eternitycz} of Anderson's idea. They use a mixnet and made overall reasonable design decisions. Tonda Bene wrote his PhD thesis \cite{benethesis} on this design, and provided many more concrete explanations of the details that Anderson skips over in his original paper. However, there are a number of issues that we have with their implementation: \begin{itemize} \item They implement everything they need by themselves. They do not exist in a vacuum -- for example, the world already has `good enough' loose time synchronization applications such as xntpd, so there is no need to implement a new API and designs. This leads to code bloat and too many layers of abstraction, which makes verifying security very difficult. \item Almost all of their files are binary. It would be easier to examine or modify their configuration files if they were in a human-readable and human-writable format. \item BSD-limited. Their code is not ported to Linux yet, much less other platforms. First of all, the port is probably difficult if they have not yet successfully ported it to another platform. Secondly, a well-designed system (whether in perl, C, or Java) should be extremely portable already -- this does not bode well. \item A centralized (single or few) trusted bank system is assumed. \end{itemize} \subsection{Eternity Usenet} Adam Back proposed \cite{eternityusenet} a simpler implementation of the Eternity Service, using the existing Usenet infrastructure to distribute the posted files all around the world. This is an excellent idea, but on the other hand this limits the participating servers to systems which already host Usenet news. Further, news administrators much specifically choose to participate in this variant of the eternity service, and so they may well choose not to carry the `alt' groups that comprise the service. Eternity Usenet uses normal Usenet mechanisms for retrieval, posting, and expiring, so publishers may not have control over the expiration time or propagation rate of their document. To achieve anonymity in publishing, Eternity Usenet employs cypherpunks type I and type II (mixmaster) remailers as gateways from email to newsgroups. Publishers PGP-sign documents which they wish to publish into the system: these documents are formatted in html, and readers make http search or query requests to `Eternity Servers' which map these requests into NNTP commands either to a remote news server or a local news spool. With the initial implementation, the default list of newsgroups to read consists only of {\tt alt.anonymous.messages}. The Eternity Server effectively provides an interface to a virtual web filesystem which posters populate via Usenet posts. Back treats Usenet as an append-only file system. His system provides support for replacing files (virtual addresses) because newer posts signed with the same PGP key are assumed to be from the same publisher. Addresses are claimed on a first-come first-served basis, and PGP signatures provide linkability between an initial file at a given address and a revision of that file. However, he does not appear to provide an explanation of conflict resolution that might arise from two addresses being claimed at the same time -- since Usenet posts may arrive out of order, it would seem that there might be some subtle attacks against file coherency if two different Eternity Servers have a different notion of who owns a file. Also, while the system is not directly `censorable' as we usually consider it, the term `eternity' is misleading. Usenet posts expire based on age and size. Back does not provide an analysis of how long a given document will survive in the network. The task of making a feasible distributed store of Eternity documents is left as a future work. Four public-access Eternity Servers are listed at the end of the article; none of these servers is still available. This indicates that active work on Eternity Usenet is not ingoing. %so anonymity might not be as strongly preserved on either side of the %transaction. Additionally, people can post data to the service, and then %prove that a specific server was hosting that data (since all of them are). %This is crucial for laws where mere possession of the data is illegal. %\subsection{India Project} %While the India Project{\footnote {\tt http://www.eecs.harvard.edu/\~{}india/}} has no %real anonymity measures and is designed with efficiency (high bandwidth reads) in mind, %it includes an implementation of Rabin's information dispersal algorithm; this might be %able to be lifted entirely and reused for our project. % \subsection{Internet Memory Project} % It, uhm, exists. We should look it up. I bet it doesn't address anonymity. \subsection{Napster} The Napster service\cite{napster} is a company based around connecting people who are offering MP3 files to people who want to download them. While they provide no real anonymity and disclaim all legal liability, a very important thing to note about the Napster service is that it is highly successful. Thousands of people use Napster daily to exchange music; if there were greater security (and comparable ease of use), we suspect that many thousands more would participate. The existence of Napster presents a very clear argument that the Internet community wants a service like this, at least for music. %The response to the Metallica suit\cite{metallica} --- in particular, %the continued use of Napster for trading of illegal MP3 files --- %indicates that the Internet community is willing to continue use of %this service even knowing that it could have negative legal %consequences. \subsection{Gnutella} Gnutella\cite{gnutella} is a peer-to-peer Napster clone. It was developed by a subsidiary company of AOL, and once it went public it was immediately shut down by AOL (presumably since AOL has interests in not disrupting the music and movie industries). Development is proceeding via a widely scattered group of open-source contributors. Gnutella depends on the ``Small Worlds'' model to maintain a connected network; see Subsection \ref{subsec:smallworlds} for a more detailed description and analysis of this idea. According to the new developers' web site: \begin{quotation} Gnutella puts a stop to all those shenanigans. When you send a query to the GnutellaNet, there is not much in it that can link that query to you. I'm not saying it's totally impossible to figure out who's searching for what, but it's pretty unlikely, and each time your query is passed, the possibility of discovering who originated that query is reduced exponentially. More on that in the next section. In short, there is no safer way to search without being watched. A big however, however. To speed things up, downloads are not anonymous. Well, we have to make compromises. But again, nobody's keeping logs, and nobody's trying to profile you. \end{quotation} There is a strong contradiction between their bold statement about perfection and their warnings that users concerned about maintaining anonymity really should avoid using the system. Behind the media hype, it is clear there are a number of aspects of their protocol \cite{gnutellaprotocol} that help to reveal identities of users. The header of a Gnutella packet contains a number of fields. Two of these fields are the `TTL' (time to live: the number of additional hops after which the packet should be dropped) and `Hops taken' (the number of hops this packet has made since its creation). The TTL is started at some default value based on the expected size of the network, and the Hops value is effectively an inverse of the TTL during the travel of the packet. Because the Hops value is 1 when the packet is initially sent, it is clear when a given server is generating a query (assuming it is playing by the protocol, which for the vast majority of users is a reasonable assumption). Even if there were no Hops value, the fact that the TTL itself has a default value for most client programs is sufficient to make a server originating a request distinguishable from another server in the system, in the mathematical sense presented in Chapter 2. Further, the Gnutella network is not so well distributed as they might lead users to believe. While the protocol is designed for a user to set up connections with his `friends', there is no infrastructure in place for easily building such a set of friends. Instead, the Gnutella site offers a `default' set of friends with which users can start. Most users will never change this file if the service is functional. This means that the actual network is built not as a flat network but rather as a hierarchical system, as shown in their pictures of the Gnutella network topology \cite{gnutellamaps}. There are a small number of central nodes which would be ideal targets for government agencies or other organizations collecting information about users. %If the TTL and Hops fields aren't enough, every message in the system is %stamped with a Globally Unique Identifier (GUID). This identifier is used %to recognize messages which have already been seen, so they are not passed %on redundantly. This prevents the Gnutella network from an exponential %explosion of messages, since the default TTL is typically as high as 25. If the TTL and Hops fields aren't enough to reveal identities, it turns out that only the queries have any semblance of anonymity protection. The actual downloads are done by point-to-point connections, meaning that the IP addresses of server and reader are both revealed to each other. This is done for reasons of efficiency. Sites such as the Gnutella Wall of Shame\cite{gnushame}, which attempts to entrap child pornographers using the Gnutella service, show that the direct file-transfer portion of the Gnutella service has been demonstrated to not adequately protect the anonymity of servers or readers. Gnutella is not designed to be an anonymous communications or publication network. Gnutella is a network designed to provide {\em availability} for data from one user to the next, and it does a relatively good job of this. %http://gnutella.wego.com/go/wego.pages.page?groupId=116705&view=page&folderId=118398&pageId=118400 %http://capnbry.dyndns.org/gnutella/protocol.html %http://www.rixsoft.com/Knowbuddy/gnutellafaq.html \subsection{Freenet} The Freenet project \cite{freenet} is one of the most popular related works. Like Gnutella, Freenet proposes an interconnected network of nodes, each acting as both client and server. When a user wishes to request a document, she hashes the name of that document (where she gets this name is outside the scope of Freenet) and then queries her own server about the location. If her server does not have it, it passes the query on to a nearby server which is `more likely' to have it. Freenet clusters documents with similar hashes nearby each other, and uses a complex routing protocol to route queries `downhill' until they arrive at the desired document. Freenet is similar to Gnutella in that its main purpose is to provide highly {\em available} data to its users. There are also a number of differences between Freenet and Gnutella. First of all, Freenet caches data near requestors. Specifically, when a request is answered over a given path, all servers along that path cache that document. This means that future queries for that document will be answered very quickly, assuming the copies of that document haven't expired from the nearby caches. This introduces another important feature: persistence of data. Because nodes cache documents as they are requested, the documents do not disappear from the system when the server offering those documents disappears. This is a key improvement over Napster and Gnutella. Freenet bases document lifetime on the popularity of the document: frequently requested files get duplicated around the system, whereas infrequently requested files live in only a few places or die out completely. While this is a valid choice for a system that emphasizes availability, it precludes certain uses of the system. For instance, I can see circumstances where a file has a 12 month lifetime but only becomes popular in the last few months of its lifetime. Examples include photos of JFK Jr.\ saluting his father, or a (timestamped) Idaho phone book that has those ten extra names that the FBI might one day be accused of `erasing'. Indeed, this is already happening -- \cite{yugo} describes a case where Yugoslav phone books are being collected ``to document residency for the close to one million people forced to evacuate Kosovo.'' Freenet takes some steps to increase anonymity. Their goals include both sender and reader anonymity, as well as plausible deniability for servers -- the notion that a server does not know the contents of documents it is storing. They provide this last, which we clarify as isolated-server document-anonymity (as opposed to connected-server), by referencing and storing files as $H(name)$ and having users encrypt the documents themselves with $name$ before inserting them. This means that anybody who knows the original $name$ string can decrypt the document, but the server storing the document is unable to invert $H(name)$ to determine $name$. However, they have the same flaw with publisher- and reader-anonymity that Gnutella does, due to the presence of the TTL and Depth (comparable to Hops) fields in the Freenet message headers. Because the document requests are also sent through the network (rather than peer-to-peer as they are in Gnutella), there's room for a little bit more anonymity than Gnutella provides. However, nodes nearby a reader still have a greater than even chance of being able to identify that reader. Further, statistical attacks similar to those described in the Crowds \cite{crowds} paper might work to pinpoint the location of a given reader or publisher; however, the caching does provide some protection against this since the network topology for a given document changes dramatically after each request. This needs to be analyzed further. Another attack to consider is that simply doing a request from a strict political environment will cause a copy of the data to migrate into that jurisdiction, giving law enforcement more reason to shut those servers down. On the other hand, it may well be that such environments will close down servers without requiring `sufficient cause', so the political and legal arguments are meaningless. It might even be that a less anonymous system is more likely to be accepted in more parts of the world. This will have to be explored simply by trying it. However, because Freenet provides weaker anonymity than Free Haven, it is currently unsuitable for use by those who are truly concerned about maintaining their privacy, such as political dissidents or other whistleblowers. (See Chapter 4 for more details about these issues.) \subsection{Graduated Mirroring} The `Graduated Mirroring' proposal \cite{gradmirroring} was introduced by Ron Rivest in response to our initial proposals about a buddy system and other accountability measures that greatly increase the complexity of the system. In short, this idea involves a group of servers, each controlled by a person called the `manager', which all sign up to receive documents published to the service. Each published document arrives at each server; the manager manually peruses the document and decides how important or valuable he believes it to be. Based on this evaluation, he chooses how many shares of the document to store. For each share, he basically chooses a random share number and generates that share via some information dispersal algorithm -- this share generation is implemented by evaluating a polynomial which describes the overall document at a number of random values. Server managers can modify their support for a given document. If they want to support the document less, they simply throw out some of their shares. If they want to support the document more, they retrieve the document and generate some new shares. When a document no longer has enough support for readers to be able to reconstruct it, that document has effectively expired; server managers still holding information about that document may then decide to throw away whatever they have about the document -- this effectively replaces the notion of a publisher-chosen expiration date with a much simpler notion of server-popularity. This notion of popularity is similar to the notion that Freenet uses, but the duration of a document is based on how much the {\em servers} like the document rather than on how much the readers like the document. While this system has some excellent features, including simplicity first and foremost, we have a number of issues with it. The first issue is that it is not what we want to build: the fact that only popular data would get mirrored is counter to our design goal of content-neutrality. We believe that it does not capture the essence of what we want from a data haven. Indeed, it also goes against our basic assumptions about computing: we have a lot of hardware, and very few people. This trend will get more pronounced as time goes on. Having a person hand-sort and consider each item really cuts down on the number of people who would be willing to host a server. Overall, we believe that paving the way for an automated robust data haven based on privacy of publisher and data is going to have more of an effect in the long run. %\subsection{Anon} %http://www.inf.tu-dresden.de/\~{}hf2/anon/ \subsection{Intermemory} The Intermemory Project \cite{GY98} \cite{CEGGSY98} is an initiative at NEC Research aimed at producing an archival system which makes use of spare space on the Internet. The goal is high availability and high persistence of information. Intermemory uses information dispersal to mitigate the consequences of server failure, and spends much time addressing systems issues such as synchronization of information between many different servers. Servers join Intermemory and donate a certain amount of space temporarily in return for the right to store some small fraction of that space in the system forever. The ``economic'' viability of the Intermemory design depends on the assumption that tomorrow's storage will be cheap and plentiful enough to meet the obligations incurred today. At present, Intermemory exists as a prototype implementation within NEC. The public papers on Intermemory do not even address security, much less anonymity, and it is not clear how the system reacts in the presence of malicious adversaries. We therefore do not formally compare Intermemory to the other systems listed here. Instead, we mention it as an example of a publication and archival system which is designed without the severe constraints necessary to ensure anonymity. \subsection{Publius} Publius attacks the problem of anonymous publishing from a different angle. Rather than trying to come up with a routing protocol like Gnutella and Freenet, Publius simply employs some one-way anonymous channel to transfer documents from publishers to servers. The Publius protocol is designed to maintain availability of documents on these servers. In this system, a publisher generates a key $K$ for her document, and encrypts the document with this key. She performs Shamir's secret-sharing algorithm to build a set of $n$ key shares, any $k$ of which is sufficient to reconstruct $K$. From there, she chooses some $n$ of the Publius servers and anonymously delivers the encrypted message plus one share to each of these $n$ servers. In this way, the document is replicated over each server, but the key is split over the $n$ servers. Document reading is implemented by running a local web proxy on the reader's machine; the $n$ addresses chosen as servers are concatenated into a URL which is presumably published or otherwise remembered. (Publius provides no description of how a directory service might be built, or any other mechanism for remembering URLs after documents are inserted.) The URL used to retrieve the document specifies all $n$ servers at which the document was stored. This means that to retrieve a given document, the local proxy fetches each document independently, reconstructs the original key $K$, and then decrypts the document. The Publius system provides strong publisher-anonymity, because a one-way channel is sufficient for communications to the servers. In addition, because a cryptographically strong secret-sharing protocol is used and each server only receives one share, Publius provides both computational and also information-theoretic isolated-server document-anonymity: a given server is not able to determine anything about a document that it is helping to store. On the other hand, there are a number of limitations beyond those the authors of the paper enumerate. For instance, the entire scheme is based on a static, system-wide list of available servers. Since these servers are permanent, there is no support for adding new servers or purging dead ones. Perhaps more importantly, however, there is no support for recognizing misbehaving servers and removing from them the list of available servers. Another point is that readers cannot determine if a share is corrupt simply by examining it: the reader must request all of the shares and attempt to reconstruct in order to determine the integrity of a share. Providing a mechanism for self-evident share integrity checking might provide significant robustness to the system. Publius is by far the strongest related work in terms of our notions of anonymity. The paper is very well-written and goes into considerable detail on various attacks and counters to those attacks. \subsection{An analysis of anonymity} Many of these related works offer their own variant of `anonymity' for some of the agents in the system. In this section, we analyze this anonymity that each work provides in the context of the definitions and formalizations proposed in Chapter 2. % \begin{center} \begin{table}[htc] \begin{tabular}{|c|ccccc|} \hline Project & Publisher & Reader & Server & Document & Query \\ \hline Gnutella & & & & & \\ \hline FreeNet & & & & \cm & \\ \hline Eternity Usenet& \cm & & & & \\ \hline Publius & \cm & & & \cm & \\ \hline Free Haven & \cm & \cm & \cm & \cm & \\ \hline \end{tabular} \caption{Overview: Computational Anonymity} \label{table:comp-anon-pub} \end{table} % \end{center} This first table provides an overview of the protections for each of the broad categories of anonymity against computationally-limited adversaries. Informally, for polynomially-bounded adversaries who have passive access to some of the edges between agents, a \cm on this table indicates that the adversary has less than a polynomial + $\frac12$ chance of correctly guessing the identity of one of the individuals involved in any given transaction. Gnutella fails to provide publisher-anonymity, reader-anonymity, or server-anonymity because of the peer-to-peer connections for actual file transfer. Because Gnutella servers start out knowing the intended contents of the document they are offering, they also fail to provide document-anonymity. Freenet achieves document-anonymity because servers are not unable to reverse the hash of the document name to determine the key with which to decrypt the document. However server-anonymity is not provided because given a document, it is very easy to locate a server that is carrying that document -- querying any server at all will result in that server carrying the document! Because of the TTL and Hops fields for both reading and publishing, Freenet also fails to achieve publisher- or reader-anonymity. Eternity Usenet provides publisher anonymity via the use of one-way anonymous remailers. Reader anonymity is not protected, and it is clear that a Usenet service that offers Eternity files is carrying the Eternity feed. Because each downstream host gets its only entire copy of the feed, there is no document-anonymity in Eternity Usenet. Publius achieves document-anonymity because the key is split between the $n$ servers, and without sufficient shares of the key a server is unable to decrypt the document that is stores. Because documents are published to Publius through a one-way anonymous remailer, it provides publisher-anonymity. However, it provides no support for protecting readers, and the servers containing a given file are clearly marked in the URL used for retrieving that file. Free Haven achieves publisher-anonymity via an anonymous remailer channel. Similarly, reader-anonymity is provided because the responses are directed through a mixnet to a temporary address that the reader provides. Server anonymity is maintained because document requests are performed via broadcast, and the results arrive out of a one-way channel. Free Haven achieves document-anonymity because the document itself is split; assuming a wide enough dispersal of documents, a given server will never see enough shares of a document to be able to reconstruct it. Certainly a server that is not actively trying to rebuild a document (for instance, by doing a request for the other shares) will not have the document available, since it is broken into shares before publication. \begin{table}[htc] %\begin{center} \begin{tabular}{|c|ccc|ccc|ccc|cc|cc|} \hline Project & \multicolumn{3}{c}{Publisher} & \multicolumn{3}{c}{Reader} \vline & \multicolumn{3}{c}{Server} \vline & \multicolumn{2}{c}{Document} \vline & \multicolumn{2}{c}{Query} \vline \\ & C & I-T & P-F & C & I-T & P-F & C & I-T & P-F & C & I-T & C & I-T \\ \hline Gnutella & & & & & & & & & & & & & \\ \hline FreeNet & & & & & & & & & & \cm & & & \\ \hline Eternity Usenet & \cm & \cm & \cm &&&& &&& && & \\ \hline Publius & \cm & \cm & \cm & & & & & & & \cm & \cm & & \\ \hline Free Haven & \cm & \cm & \cm & \cm & & \cm & \cm & & & \cm & & & \\ \hline FH + ideal mix &\cm&\cm&\cm & \cm & \cm & \cm & \cm & \cm &\cm & \cm & & & \\ \hline \end{tabular} \caption{Anonymity Properties of Publishing Systems} \label{table:real-anon-pub} \end{table} %\end{center} This second table provides a more detailed view of the different publishing systems which we examined. There are a number of interesting points that become clearer once we increase the resolution of the table. First of all, we see that the secret sharing algorithm which Publius uses provides a stronger form of document-anonymity, since an isolated server really can learn nothing at all about the contents of a document that it is helping to store. Secondly, we see that those systems which provide publisher anonymity tend to provide a very strong form of it -- namely, computational, information-theoretic, and also perfect-forward publisher anonymity. This is because the publishers can make use of one-way communications channels, effectively removing any linkability; removing the need for a reply pseudonym on the mixnet means that there is `nothing to crack'. Thirdly, we note that Free Haven achieves perfect-forward reader anonymity: this is because readers make up a new pseudonym for every document request, so there is no linkability. The most important line by far in this table is the last line, though. The fact that it implies that Free Haven is part of the reason it achieves this much anonymity is slightly misleading: it really is the ideal mix which is providing the first nine aspects of anonymity. Assuming a robust ideal mix network like that described in Chapter 2, there would be no linkability between transactions, and mere computational ability on the part of the adversary would be insufficient to identify the parties in a transaction. This would mean that we could in fact relegate most of the anonymity to the communications channel itself, and provide a simple back-end file system or equivalent service to transfer documents between agents. Thus the design of the back-end system could be based primarily on addressing other issues such as availability of documents, protections against flooding and denial of service attacks, and accountability in the face of this enforced anonymity. Unfortunately, the design and deployment of such an ideal mix network is a very challenging task, and one for our future works chapter. Until then, we focus on providing increased anonymity with a combination of more conventional mix networks and a publication system tailored for the mixnet.

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

nist.gov

CC-MAIN-2014-10

application/x-tex

crawl-data/CC-MAIN-2014-10/segments/1394010650250/warc/CC-MAIN-20140305091050-00004-ip-10-183-142-35.ec2.internal.warc.gz

\[S_{n}(x)=\sum_{{k=0}}^{{n-1}}\frac{\mathop{\sin\/}\nolimits\!\left((2k+1)x% \right)}{2k+1}=\frac{1}{2}\int_{0}^{x}\frac{\mathop{\sin\/}\nolimits\!\left(2% nt\right)}{\mathop{\sin\/}\nolimits t}dt=\tfrac{1}{2}\mathop{\mathrm{Si}\/}% \nolimits\!\left(2nx\right)+R_{n}(x),\]

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

ku.edu

CC-MAIN-2014-49

text/x-tex

crawl-data/CC-MAIN-2014-49/segments/1416931009551.23/warc/CC-MAIN-20141125155649-00159-ip-10-235-23-156.ec2.internal.warc.gz

%% %% This is file `braids.sty', %% generated with the docstrip utility. %% %% The original source files were: %% %% braids.dtx (with options: `package') %% ---------------------------------------------------------------- %% braids --- a style file for drawing braid diagrams with TikZ/PGF %% E-mail: stacey@math.ntnu.no %% Released under the LaTeX Project Public License v1.3c or later %% See http://www.latex-project.org/lppl.txt %% ---------------------------------------------------------------- %% \NeedsTeXFormat{LaTeX2e} \ProvidesPackage{braids}[2011/05/07 v1.0 Tikz/PGF commands for drawing braid diagrams] \def\braid@pgfversion{2.10}% \ifx\pgfversion\braid@pgfversion \else \PackageWarning{braids}{This package was designed using PGF2.10; you are using \pgfversion.}% \fi \long\def\ge@addto@macro#1#2{% \begingroup \toks@\expandafter\expandafter\expandafter{\expandafter#1#2}% \xdef#1{\the\toks@}% \endgroup} \newcommand{\braid}[1][]{% \begingroup \braid@start{#1}} \def\braid@process{% \afterassignment\braid@handle\let\braid@token=% } \def\braid@process@start{% \afterassignment\braid@handle@start\let\braid@token=% } \def\braid@handle@start{% \let\braid@next=\braid@handle \ifx\braid@token a \let\braid@next=\braid@maybe@locate \else \ifx\braid@token(%) \iffalse)\fi %Indentation hack! \let\braid@next=\braid@assign@name \else \ifx\braid@token\@sptoken \let\braid@next=\braid@process@start \fi \fi \fi \braid@next% } \let\braid@semicolon=; \let\braid@bar=| \def\braid@handle{% \let\braid@next=\braid@process \ifnum\the\catcode`\;=\active \expandafter\let\expandafter\braid@semicolon\tikz@activesemicolon \fi \ifnum\the\catcode`\|=\active \expandafter\let\expandafter\braid@bar\tikz@activebar \fi \ifx\braid@token\braid@semicolon \let\braid@next=\braid@render \else \ifx\braid@token^ \let\braid@next=\braid@sup \else \ifx\braid@token_ \let\braid@next=\braid@sub \else \ifx\braid@token- \braid@increase@levelfalse \else \ifx\braid@token[ \let\braid@next=\braid@process@options \else \ifx\braid@token\braid@bar \edef\braid@tmp{,\expandafter\the\value{braid@level}}% \ge@addto@macro\braid@floors\braid@tmp% \else \ifx\braid@token\bgroup \braid@beginscope \else \ifx\braid@token\egroup \braid@endscope \else \ge@addto@macro\braid@label{\braid@token}% \fi \fi \fi \fi \fi \fi \fi \fi \braid@next% } \def\braid@maybe@locate{% \afterassignment\braid@@maybe@locate\let\braid@token=% } \def\braid@@maybe@locate{% \let\braid@next=\braid@handle \ifx\braid@token t \let\braid@next=\braid@find@location \fi \braid@next% } \def\braid@find@location{% \afterassignment\braid@@find@location\let\braid@token=% } \def\braid@@find@location{% \let\braid@next=\braid@location@error \ifx\braid@token(%) \let\braid@next=\braid@locate \else \ifx\braid@token\@sptoken \let\braid@next=\braid@find@location \fi \fi \braid@next% } \def\braid@location@error{% \PackageWarning{braids}{Could not figure out location for braid}% \braid@process@start% } \def\braid@locate#1){% \tikz@scan@one@point\braid@relocate(#1)% } \def\braid@relocate#1{% #1\relax \advance\pgf@x by -\braid@width \pgftransformshift{\pgfqpoint{\pgf@x}{\pgf@y}} \braid@process@start% } \def\braid@assign@name#1){% \def\braid@name{#1}% \braid@process@start% } \def\braid@process@options#1]{% \tikzset{#1}% \braid@process% } \def\braid@sup#1_#2{\g@addto@macro\braid@label{_{#2}^{#1}}\braid@add@crossing{#2}{#1}} \def\braid@sub#1{\@ifnextchar^{\braid@@sub{#1}}{\g@addto@macro\braid@label{_{#1}}\braid@add@crossing{#1}{1}}} \def\braid@@sub#1^#2{\g@addto@macro\braid@label{_{#1}^{#2}}\braid@add@crossing{#1}{#2}} \def\braid@ne{1} \def\braid@add@crossing#1#2{% \edef\braid@crossing@type{#2}% \edef\braid@this@strand{#1}% \pgfmathtruncatemacro{\braid@next@strand}{#1+1} \ifbraid@increase@level \stepcounter{braid@level} \fi \braid@increase@leveltrue \braid@tx=\braid@this@strand\braid@width \braid@ty=\value{braid@level}\braid@height \advance\braid@ty by \braid@eh \braid@nx=\braid@tx \braid@ny=\braid@ty \advance\braid@nx by \braid@width \advance\braid@ny by \braid@height \braid@cy=\braid@ty \braid@dy=\braid@ny \advance\braid@cy by .5\braid@height \advance\braid@dy by -.5\braid@height \advance\braid@ty by .05\braid@height \advance\braid@ny by -.05\braid@height \expandafter\let\expandafter\braid@this@path@origin\csname braid@strand@\braid@this@strand @origin\endcsname \ifx\braid@this@path@origin\relax \let\braid@this@path@origin\braid@this@strand \pgfsyssoftpath@setcurrentpath{\@empty} \pgfpathmoveto{\pgfpoint{\braid@tx}{0pt}} \pgfsyssoftpath@getcurrentpath{\braid@this@path} \else \expandafter\let\expandafter\braid@this@path\csname braid@strand@\braid@this@path@origin\endcsname \fi \expandafter\let\expandafter\braid@next@path@origin\csname braid@strand@\braid@next@strand @origin\endcsname \ifx\braid@next@path@origin\relax \let\braid@next@path@origin\braid@next@strand \pgfsyssoftpath@setcurrentpath{\@empty} \pgfpathmoveto{\pgfpoint{\braid@nx}{0pt}} \pgfsyssoftpath@getcurrentpath{\braid@next@path} \else \expandafter\let\expandafter\braid@next@path\csname braid@strand@\braid@next@path@origin\endcsname \fi \pgfsyssoftpath@setcurrentpath{\braid@this@path} \pgfpathlineto{\pgfqpoint{\braid@tx}{\braid@ty}} \ifx\braid@crossing@type\braid@over@cross \pgfpathcurveto{\pgfqpoint{\braid@tx}{\braid@cy}}{\pgfqpoint{\braid@nx}{\braid@dy}}{\pgfqpoint{\braid@nx}{\braid@ny}} \else \pgfpathcurvebetweentimecontinue{0}{.4}{\pgfqpoint{\braid@tx}{\braid@ty}}{\pgfqpoint{\braid@tx}{\braid@cy}}{\pgfqpoint{\braid@nx}{\braid@dy}}{\pgfqpoint{\braid@nx}{\braid@ny}} \pgfpathcurvebetweentime{.6}{1}{\pgfqpoint{\braid@tx}{\braid@ty}}{\pgfqpoint{\braid@tx}{\braid@cy}}{\pgfqpoint{\braid@nx}{\braid@dy}}{\pgfqpoint{\braid@nx}{\braid@ny}} \fi \pgfsyssoftpath@getcurrentpath{\braid@this@path} \pgfsyssoftpath@setcurrentpath{\braid@next@path} \pgfpathlineto{\pgfqpoint{\braid@nx}{\braid@ty}} \ifx\braid@crossing@type\braid@over@cross \pgfpathcurvebetweentimecontinue{0}{.4}{\pgfqpoint{\braid@nx}{\braid@ty}}{\pgfqpoint{\braid@nx}{\braid@cy}}{\pgfqpoint{\braid@tx}{\braid@dy}}{\pgfqpoint{\braid@tx}{\braid@ny}} \pgfpathcurvebetweentime{.6}{1}{\pgfqpoint{\braid@nx}{\braid@ty}}{\pgfqpoint{\braid@nx}{\braid@cy}}{\pgfqpoint{\braid@tx}{\braid@dy}}{\pgfqpoint{\braid@tx}{\braid@ny}} \else \pgfpathcurveto{\pgfqpoint{\braid@nx}{\braid@cy}}{\pgfqpoint{\braid@tx}{\braid@dy}}{\pgfqpoint{\braid@tx}{\braid@ny}} \fi \pgfsyssoftpath@getcurrentpath{\braid@next@path} \expandafter\let\csname braid@strand@\braid@this@path@origin \endcsname\braid@this@path \expandafter\let\csname braid@strand@\braid@next@path@origin \endcsname\braid@next@path \expandafter\let\csname braid@strand@\braid@this@strand @origin\endcsname\braid@next@path@origin \expandafter\let\csname braid@strand@\braid@next@strand @origin\endcsname\braid@this@path@origin \pgfmathparse{\value{braid@strands} < \braid@next@strand ? "\noexpand\setcounter{braid@strands}{\braid@next@strand}" : ""} \pgfmathresult \braid@process% } \def\braid@floors@trim,{} \def\braid@render@floor{% \draw (\floorsx,\floorsy) rectangle (\floorex,\floorey); } \def\braid@render{ \ifx\braid@floors\@empty \else \pgfsys@beginscope \pgfsyssoftpath@setcurrentpath{\empty} \edef\braid@floors{\expandafter\braid@floors@trim\braid@floors} \braid@tx=\braid@width \advance\braid@tx by \braid@eh \braid@nx=\value{braid@strands}\braid@width \advance\braid@nx by -\braid@eh \foreach \braid@f in \braid@floors { \pgfsys@beginscope \braid@ty=\braid@f\braid@height \advance\braid@ty by \braid@eh \advance\braid@ty by \braid@height \braid@ny=\braid@ty \advance\braid@ny by \braid@height \edef\floorsx{\the\braid@tx} \edef\floorsy{\the\braid@ty} \edef\floorex{\the\braid@nx} \edef\floorey{\the\braid@ny} \let\tikz@options=\pgfutil@empty \expandafter\tikzset\expandafter{\braid@floors@style} \pgfmathtruncatemacro{\braid@ff}{\braid@f+2} \expandafter\let\expandafter\braid@floor@style\csname braid@options@floor@\braid@ff\endcsname \ifx\braid@floor@style\relax \else \expandafter\tikzset\expandafter{\braid@floor@style}% \fi \tikz@options \braid@render@floor \pgfsys@endscope } \pgfsys@endscope \fi \stepcounter{braid@level} \foreach \braid@k in {1,...,\value{braid@strands}} { \pgfsys@beginscope \tikz@mode@drawtrue% \let\tikz@mode=\pgfutil@empty \let\tikz@options=\pgfutil@empty \braid@tx=\braid@k\braid@width \braid@ty=\value{braid@level}\braid@height \advance\braid@ty by 2\braid@eh \expandafter\let\expandafter\braid@path@origin\csname braid@strand@\braid@k @origin\endcsname \ifx\braid@path@origin\relax \pgfsyssoftpath@setcurrentpath{\@empty} \pgfpathmoveto{\pgfqpoint{\braid@tx}{0pt}} \let\braid@path@origin\braid@k \else \expandafter\let\expandafter\braid@path\csname braid@strand@\braid@path@origin\endcsname \pgfsyssoftpath@setcurrentpath{\braid@path} \fi \pgflineto{\pgfqpoint{\braid@tx}{\braid@ty}} \expandafter\tikzset\expandafter{\braid@style} \expandafter\let\expandafter\braid@style\csname braid@options@strand@\braid@path@origin\endcsname \ifx\braid@style\relax \else \expandafter\tikzset\expandafter{\braid@style} \fi \braid@options \tikz@mode \tikz@options \edef\tikz@temp{\noexpand\pgfusepath{% \iftikz@mode@draw draw\fi% }}% \tikz@temp \ifx\braid@name\pgfutil@empty \else \coordinate (\braid@name-\braid@path@origin-e) at (\braid@tx,\braid@ty); \coordinate (\braid@name-rev-\braid@k-e) at (\braid@tx,\braid@ty); \braid@nx=\braid@path@origin\braid@width \coordinate (\braid@name-\braid@path@origin-s) at (\braid@nx,0pt); \coordinate (\braid@name-rev-\braid@k-s) at (\braid@nx,0pt); \fi \pgfsys@endscope } \ifx\braid@name\pgfutil@empty \else \braid@tx=\value{braid@strands}\braid@width \braid@ty=\value{braid@level}\braid@height \advance\braid@ty by 2\braid@eh \advance\braid@tx by \braid@width \braid@tx=.5\braid@tx \braid@ty=.5\braid@ty \coordinate (\braid@name) at (\braid@tx,\braid@ty); \fi \pgfsys@endscope \endgroup} \def\braid@start#1{% \pgfsys@beginscope \setcounter{braid@level}{-1}% \let\braid@label\@empty \let\braid@floors\@empty \let\braid@name\empty \pgfkeys{/pgf/braid/.cd,#1} \let\braid@options\tikz@options \tikz@transform \setcounter{braid@strands}{\pgfkeysvalueof{/pgf/braid/number of strands}}% \braid@width=\pgfkeysvalueof{/pgf/braid/width} \braid@height=\pgfkeysvalueof{/pgf/braid/height} \braid@eh=\pgfkeysvalueof{/pgf/braid/border height} \braid@height=-\braid@height \braid@eh=-\braid@eh \braid@increase@leveltrue \braid@process@start } \newdimen\braid@width \newdimen\braid@height \newdimen\braid@tx \newdimen\braid@ty \newdimen\braid@nx \newdimen\braid@ny \newdimen\braid@cy \newdimen\braid@dy \newdimen\braid@eh \newif\ifbraid@increase@level \let\braid@style\pgfutil@empty \let\braid@floors@style\pgfutil@empty \def\braid@over@cross{1} \newcounter{braid@level} \newcounter{braid@strands} \pgfkeys{ /tikz/braid/.search also={/pgf}, /pgf/braid/.search also={/pgf,/tikz}, /pgf/braid/.cd, number of strands/.initial=0, height/.initial=1cm, width/.initial=1cm, border height/.initial=.25cm, name/.code={% \def\braid@name{#1}% }, at/.code={% \braid@relocate{#1}% }, floor command/.code={% \def\braid@render@floor{#1}% }, style strands/.code 2 args={% \def\braid@temp{#2}% \braidset{style each strand/.list={#1}}% }, style each strand/.code={% \expandafter\edef\csname braid@options@strand@#1\endcsname{\braid@temp}% }, style floors/.code 2 args={% \def\braid@temp{#2}% \braidset{style each floor/.list={#1}}% }, style each floor/.code={% \expandafter\edef\csname braid@options@floor@#1\endcsname{\braid@temp}% }, style all floors/.code={% \def\braid@floors@style{#1} } } \def\braidset#1{% \pgfkeys{/pgf/braid/.cd,#1}} %% %% Copyright (C) 2011 by Andrew Stacey <stacey@math.ntnu.no> %% %% This work may be distributed and/or modified under the %% conditions of the LaTeX Project Public License (LPPL), either %% version 1.3c of this license or (at your option) any later %% version. The latest version of this license is in the file: %% %% http://www.latex-project.org/lppl.txt %% %% This work is "maintained" (as per LPPL maintenance status) by %% Andrew Stacey. %% %% This work consists of the files braids.dtx %% braids_doc.tex %% and the derived files README.txt, %% braids.ins, %% braids.pdf, %% braids.sty, %% braids_doc.pdf. %% %% %% End of file `braids.sty'.

https://mirror.anarhija.net/usa.anarchistlibraries.net/mirror/l/lv/lucien-van-der-walt-2010-anarchist-survey.tex

anarhija.net

CC-MAIN-2022-33

application/octet-stream

application/x-tex

crawl-data/CC-MAIN-2022-33/segments/1659882570692.22/warc/CC-MAIN-20220807181008-20220807211008-00479.warc.gz

\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{2010 Anarchist Survey} \date{December 2010} \author{Lucien van der Walt} \subtitle{Notes for a critical assesment} % https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion \hypersetup{% pdfencoding=auto, pdftitle={2010 Anarchist Survey},% pdfauthor={Lucien van der Walt},% pdfsubject={Notes for a critical assesment},% pdfkeywords={notes; anarchist movement}% } \begin{document} \thispagestyle{empty} \strut\vskip 2em \begin{center} {\usekomafont{title}{\huge 2010 Anarchist Survey\par}}% \vskip 1em {\usekomafont{subtitle}{Notes for a critical assesment\par}}% \vskip 2em {\usekomafont{author}{Lucien van der Walt\par}}% \vskip 1.5em {\usekomafont{date}{December 2010\par}}% \end{center} \vskip 3em \par Recently, an “Anarchist Survey” was run online, with the results appearing around August 2010. This is a very interesting, indeed important, initiative – let me stress that. However, it is let down by some important flaws in research design and data analysis. The use of the internet to deliver the survey also some inherent problems. Because of these issues, the survey cannot be considered representative and it cannot be considered a solid basis from which to draw conclusions about anarchism today. Regarding \textbf{administration}, participation is entirely self-selected, as people were invited to participate. This means there are no controls for representivity, and no way to judge response rates. Moreover, it would overrepresent people who like filling out forms on the internet. There is no way to measure to ensure that people don’t vote twice, thrice or whatever. The invitation was through internet networks, mainly linked to anarchism. Obviously people outside of those networks are not included, and, since the authors defined anarchism very loosely (see below), the invitation also went out to networks of people whose links to anarchism are tenuous at best. The internet, of course, is an extremely cheap delivery platform with an amazing coverage, but it is shaped by language, heavily biased towards some regions and its demographics are not representative in terms of age, class or race. Its hardly surprising that only 17.6 percent of those who responded are over 36 – what does \emph{not} follow is that this is an accurate reflection of anarchism\Slash{} syndicalism \emph{as a whole.} In effect, a survey in English, on the internet, will be affected by factors outside of its control: the overwhelming weight of the US internet audience, the overrepresentation of middle class people, the massive underrepresentation of regions like India and Africa; all of these factors will also shape the contours of the networks which were drawn into the survey. In the case of even Anglophone Africa,the internet is profoundly dominated by South Africa, a country in which internet access is itself tied directly to class and race. Consequently, it is not surprising that less than 10\% of respondents are from Africa, Asia and Latin America. Most are from North America and Europe (just short of 90\%), and North America means almost only Canada and the US, not Mexico; Europe here, given language, really mainly means the UK and Ireland. Obviously this has a large impact on the data generated, and on the ability of the survey’s administrators to answer some of the questions that they hoped to answer e.g. “whether or not anarchism was in fact appealing to a significant number of non-whites (sic.)”. The authors themselves concede in the report that most respondents are “white straight men between the ages of 16 and 45” [but then try explain this away:] “Then again, this is also the dominant group of Internet users\dots{}” [Actually, this is the “dominant group of Internet users that a survey like this will \emph{attract\dots{}} so] this not quite true; \dots{} the[y[ should qualify [this] with the statement “\dots{}\emph{in the US and UK}“; it is simply not true globally. There are serious problems with the \textbf{design}. The survey uses categories that cause problematic results. There are problems with the language used (such as the term “non-white”, considered pejorative in many countries). While trying to get a sense of the racial categories of respondents, the designers left out major categories, such as Latinos\Slash{} Hispanic, now the largest US racial “minority”, not to mention Latin American categories like \emph{mestizo} and Indian. The analysis of the data apologises for this omission, but seems to think it is addressed by the category “indigenous”. However, “indigenous” is a much larger category and could include e.g. aboriginals in Australia [and would not include a great many Latin Americans]. Moreover, the US construct Latinos\Slash{} Hispanic applies to \emph{all} Latin Americans, white, black, \emph{mestizo}, \emph{pardo}, Indian etc., but these categories are clearly differentiated in Latin America. Meanwhile, in the survey “white” (dubbed Caucasian, an Americanism) is separated from “semitic”, although Jews (who would presumably fit here) are considered white in almost all countries. The authors then go on to worry, in their analysis, that the data suggests that the movement has an “ostensible lack of appeal [\dots{}] for non-whites [that] warrants further discussion.” [But] since the survey tells us more about who could (or bothered to) respond, it does itself not demonstrate an “ostensible lack of appeal” in general. (This is not to say that there isn’t an issue here – simply that such a conclusion cannot be drawn from the data set that this survey constructs). As noted earlier, the definition of anarchism used is rather loose and questionable, so questionable groups like “anarcho-capitalists” and “primitivists” and “Christian anarchism” are included as types of anarchism, while categories like “revolutionary syndicalism” and “anarchist people of colour” are not. Authors listed as “anarchists” included people who have nothing to with anarchism, like John Zerzan, the “primitivist” crank, Steve Best, the animal rights extremist etc. Rather than use anarchist or Marxist definitions of class, it uses marketing survey-type class categories like “lower middle class,” [and] distinguishes “working class” from “poor\Slash{} unemployed”. No definition is given of these categories, so what it means to be in (say) “lower middle class” [is unclear]. Where a “working class” person who earns a minimum wage would fit in is unclear [- are they “poor,” “working class,” “lower middle class”?]. In discussing “work sector”, there are some peculiar design decisions. The question here slips between [economic] sectors (e.g. education), specific occupations that cut across sectors (e.g. “art”), and types of work (e.g. manual labour). Where an electrician at a university, for example, goes is unclear. Strikingly, the main economic sectors are entirely absent: defence\Slash{} war, manufacturing, mining, agriculture, and most of the service sector e.g. transport, security, cleaning, finance. That pretty much excludes 80\% of everyone employed in most countries. On the other hand, “art”, hardly a site of mass employment, is listed. Similar issues arise with other questions. For instance, on the issue of whether “violence” can be used by anarchists, has overlapping, imprecise and leading options like “violence should only be used as a form of defence” and “violence will unfortunately be part of the revolution”. The mainstream anarchist position is that violence should only be used for “self-defence” and \emph{this is why} it would be “part of the revolution” since the ruling class will not quietly. Throwing in “unfortunately” implies a judgement against violence which goes against this basic logic. Meanwhile, violence as a \emph{strategy,} as insurrectionist anarchism, is not covered. In short, interesting results but of an anecdotal quality only. Even so, interestingly, responses to question 25 showed that most people [who responded] disagreed that “anarcho-capitalists,” “individualists,” “lifestyle anarchists” (and its sub-category, so-called “Crimethinc”), “primitivists” and “Christian anarchists” etc. are anarchists in the first place. Equally, it is interesting that responses to question 20 showed the most common anarchist “labels” people used were the traditional, red anarchist ones: anarchist-communist, libertarian socialist, social anarchist and anarcho-syndicalist. Question 27, on favourite anarchist thinkers, was dominated by actual anarchists and syndicalists, with the exception of Bookchin, and in question 45 (favourite book ), Kropotkin dominated, with Bakunin, Berkman, Chomsky, Goldman, Rocker and \emph{Black Flame} (!) all coming out towards the top. % 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 (Mirror) \smallskip Anti-Copyright \bigskip \includegraphics[width=0.25\textwidth]{logo-yu.pdf} \bigskip \end{center} \strut \vfill \begin{center} Lucien van der Walt 2010 Anarchist Survey Notes for a critical assesment December 2010 \bigskip Retrieved on 8\textsuperscript{th} September 2021 from \href{https://lucienvanderwalt.com/2011/01/15/2010-anarchist-survey-notes-for-a-critical-assesment/}{lucienvanderwalt.com} (minor edit Feb 2013, marked with []) \bigskip \textbf{usa.anarchistlibraries.net} \end{center} % end final page with colophon \end{document} % No format ID passed.

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%20296%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/1674764500126.0/warc/CC-MAIN-20230204110651-20230204140651-00753.warc.gz

%&LaTeX \documentclass{article} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage{textcomp} \begin{document} \begin{thebibliography}{1} \bibitem{Misra_etal2011} Misra, V., Moeller, L., Stefanova, L., Chan, S., O{\textquoteright}Brien, J. J., Smith III, T. J., et al. (2011). The influence of the Atlantic Warm Pool on the Florida panhandle sea breeze: FLORIDA SEA BREEZE VARIATIONS. \textit{J. Geophys. Res.}, \textit{116}(D21). \end{thebibliography} \end{document}

https://ctan.math.washington.edu/tex-archive/info/examples/lgc2/8-2-12.ltx

washington.edu

CC-MAIN-2022-27

text/x-tex

text/x-matlab

crawl-data/CC-MAIN-2022-27/segments/1656103821173.44/warc/CC-MAIN-20220630122857-20220630152857-00559.warc.gz

%% %% The LaTeX Graphics Companion, 2ed (first printing May 2007) %% %% Example 8-2-12 on page 527. %% %% 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{348.0pt} \StartShownPreambleCommands \usepackage{array}\usepackage{xymtexps} \StopShownPreambleCommands \begin{document} \setlength{\tabcolsep}{1mm} \changeunitlength{.05pt} \begin{tabular}{@{}>{\small}lcccc@{}}\hline \emph{Ring Size} & \multicolumn{4}{c@{}}{\itshape\small Specific Commands}\\\hline 3 & \cyclopropanev {1==a1;2==a2;3==a3} & \cyclopropanevi {1==a1;2==a2;3==a3} & \cyclopropaneh {1==a1;2==a2;3==a3} & \cyclopropanehi {1==a1;2==a2;3==a3} \\ & \footnotesize\verb|\cyclopropanev| & \footnotesize\verb|\cyclopropanevi| & \footnotesize\verb|\cyclopropaneh| & \footnotesize\verb|\cyclopropanehi| \\ 4 & \cyclobutane {1==a1;2==a2;3==a3} &&& \\ & \footnotesize\verb|\cyclobutane| &&& \\ 5 & \cyclopentanev {1==a1;2==a2;3==a3} & \cyclopentanevi {1==a1;2==a2;3==a3} & \cyclopentaneh {1==a1;2==a2;3==a3} & \cyclopentanehi {1==a1;2==a2;3==a3} \\ & \footnotesize\verb|\cyclopentanev| & \footnotesize\verb|\cyclopentanevi| & \footnotesize\verb|\cyclopentaneh| & \footnotesize\verb|\cyclopentanehi| \\ 6 & \cyclohexanev {1==a1;2==a2;3==a3} & & \cyclohexaneh {1==a1;2==a2;3==a3} & \\ & \footnotesize\verb|\cyclohexanev| & & \footnotesize\verb|\cyclohexaneh| & \\ 5,6 & \indanev {1==a1;2==a2;3==a3} & \indanevi {1==a1;2==a2;3==a3} & \indaneh {1==a1;2==a2;3==a3} & \indanehi {1==a1;2==a2;3==a3} \\ & \footnotesize\verb|\indanev| & \footnotesize\verb|\indanevi| & \footnotesize\verb|\indaneh| & \footnotesize\verb|\indanehi| \\ 6,6 & \decalinev {1==a1;2==a2;3==a3} & \decalineh {1==a1;2==a2;3==a3} & \decalinevb {1==a1;2==a2;3==a3} & \decalinevt {1==a1;2==a2;3==a3} \\ & \footnotesize\verb|\decalinev| & \footnotesize\verb|\decalineh| & \footnotesize\verb|\decalinevb| & \footnotesize\verb|\decalinevt| \\ 6,6,6 & \hanthracenev {1==a1;2==a2;3==a3} & \hphenanthrenev {1==a1;2==a2;3==a3} && \\ & \footnotesize\verb|\hanthracenev| & \footnotesize\verb|\hphenanthrenev| && \\ \end{tabular} \end{document}