Compare commits
No commits in common. "master" and "gh-pages" have entirely different histories.
53
+++/lestyle.css
Normal file
53
+++/lestyle.css
Normal file
@ -0,0 +1,53 @@
|
||||
body {
|
||||
width: 100%;
|
||||
height: 100%;
|
||||
margin: 0;
|
||||
padding: 0;
|
||||
}
|
||||
|
||||
.agent {
|
||||
padding: 1.5em;
|
||||
float: left;
|
||||
margin: 1em;
|
||||
width: 20em;
|
||||
background-color: #eeeeee;
|
||||
}
|
||||
|
||||
.card {
|
||||
padding: 1.5em;
|
||||
float: left;
|
||||
display: inline;
|
||||
margin: 1em;
|
||||
width: 20em;
|
||||
background-color: #eeeeee;
|
||||
}
|
||||
|
||||
.card:hover {
|
||||
background-color: #eeeeff;
|
||||
}
|
||||
|
||||
.data {
|
||||
margin-left: 0.5em;
|
||||
}
|
||||
|
||||
.name {
|
||||
font-weight: bold;
|
||||
}
|
||||
|
||||
table {
|
||||
width: 100%;
|
||||
}
|
||||
|
||||
a.button {
|
||||
margin: 0.3em;
|
||||
text-align: center;
|
||||
font-size: 0.8em;
|
||||
-webkit-appearance: button;
|
||||
-moz-appearance: button;
|
||||
appearance: button;
|
||||
text-decoration: none;
|
||||
color: initial;
|
||||
width: 100px;
|
||||
height: 20px;
|
||||
}
|
||||
|
||||
31
+++/style.css
Normal file
31
+++/style.css
Normal file
@ -0,0 +1,31 @@
|
||||
body {
|
||||
background-color: rgb(255, 255, 255);
|
||||
}
|
||||
|
||||
#ffframe {
|
||||
padding: 3em;
|
||||
}
|
||||
|
||||
text {
|
||||
display: block;
|
||||
width: 40em;
|
||||
text-align: left;
|
||||
}
|
||||
|
||||
img {
|
||||
width: 40em;
|
||||
}
|
||||
|
||||
li
|
||||
{
|
||||
padding: 0.3em;
|
||||
}
|
||||
|
||||
fff img {
|
||||
width: 40em;
|
||||
margin-bottom: 20em;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
12
.gitignore
vendored
12
.gitignore
vendored
@ -1,12 +0,0 @@
|
||||
# python byte-compiled / optimized
|
||||
__pycache__/
|
||||
*.py[cod]
|
||||
*$py.class
|
||||
|
||||
# local work dirs
|
||||
archives/
|
||||
setenv/
|
||||
|
||||
# txt report
|
||||
*.d
|
||||
*.txt
|
||||
674
LICENSE
674
LICENSE
@ -1,674 +0,0 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
{one line to give the program's name and a brief idea of what it does.}
|
||||
Copyright (C) {year} {name of author}
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 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/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
{project} Copyright (C) {year} {fullname}
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
||||
70
README
70
README
@ -1,70 +0,0 @@
|
||||
Nettime Survey (1995-2016)
|
||||
|
||||
1@@@@@@@@@@@@@@@@@@@f
|
||||
1@@@@@@@@@@@@@@@@@@@@@@@@@@@@@L
|
||||
t@@@@@@@@@@@@@0CCCCCCCCCC0@@@@@@@@@@@@f
|
||||
f@@@@@@@@@0CCCCCCCCCCCCCCCCCCCCCCCC0@@@@@@@@L
|
||||
f@@@@@@@0CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCG@@@@@@L
|
||||
1@@@@@@0CCCCCCCCCCCCCCCCCCG@@@@@@@@0CCCCCCCCCCG@@@@@L
|
||||
t@@@@@@0CCCCCCCCCCCCCCCCCCCG@@@@@@@@@@0CCCCCCCCCCC0@@@@@L
|
||||
f@@@@@@0CCCCCC0@@0CCCCCCCCCC0@@@@@@@@@@@@0CCCCCCCCCCCCG@@@@@L
|
||||
f@@@@@0CCCCCCCC0@@@@0CCCCCCCCG@@@@@@@@@@@@0CCCCCCCCCCCCCCG@@@@L
|
||||
f@@@@@0CCCCCCCCCC0@@@@0CCCCCCCG@@@@@@@@@@@0CCCCCCCCCCCCCCCCG@@@@L
|
||||
f@@@@@0CCCCCCCCCCC0@@@@@0CCCCCCC0@@@@@@@@@0CCCCCCCCCCCCCCCCCCG@@@@L
|
||||
f@@@@@0CCCCCCCCCCCCC0@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@0CCCCCCCCG@@@@L
|
||||
f@@@@0CCCCCCCCCCCCCCC0@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@0CCG@@@L
|
||||
t@@@@0CCCCCCCCCG0GCCCCCC0@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@0CCCG@@@L
|
||||
t@@@@0CCCC@@@@@@@@@@@@GCCCCCCCC0@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CCC@@@@CCCCCCC@@@@@0CCCCCC0@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CC@@@CC0@@8@8@@CCC@@8CCCC0@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0C0@@CCCC@0@@@@GCCCC@@CCCC0@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0C@@8CC@88@@@@@@CCCC@@GCC0@@@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0C8@@CCC@@@@@@@@GCCC@@CC0@@@@@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CC@@@CCG@@@@@@@0CC@@8CC0@@@@@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CC@@@@@@C@@8CCC@@@0CCC0@@@@@@@@@@@@@@@@@@@@@@0CCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CCCC@@@@@@@@@@@@0CCCCCCCCC0@@@@@@0C0@@@@@@0CCCCCCCCCCCCCCCCCG@@@L
|
||||
f@@@@0CCCCCCCG080CCCCCCCCCCCCCCG@@@@@0CC0@@@@@0CCG@@@@@@0CCCCCCCG@@@L
|
||||
f@@@@0CCCCCCCCCCCCCCCCCCCCCCC0@@@@@@0CCCG@@@@@@@@@@@@@@@0CCCCCG@@@L
|
||||
f@@@@0CCCCCCCCCCCCCCCCCCCCCCG@@@@@@0CCCG@@@@@@@@@@@0CCCCCCCCG@@@L
|
||||
t@@@@0CCCCCCCCCCCCCCCCCCCCCG@@@@@0CCCCCCCCCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@0CCCCCCCCCCCCCCCCCCCCG@@@@@0CCCCCCCCCCCCCCCCCCCCCCCG@@@L
|
||||
t@@@@@0CCCCCCCCCCCCCCCCCCG@@@@0CCCCCCCCCCCCCCCCCCCCCCG@@@@L
|
||||
t@@@@@0CCCCCCCCCCCCCCCCG@@@@0CCCCCCCCCCCCCCCCCCCCG@@@@L
|
||||
t@@@@@0CCCCCCCCCCCCCCG@@@0CCCCCCCCCCCCCCCCCCCG@@@@L
|
||||
t@@@@@@0CCCCCCCCCCCG@@0CCCCCCCCCCCCCCCCCG@@@@@L
|
||||
f@@@@@@@@0CCCCCCCCCCCCCCCCCCCCCCCCG@@@@@@@L
|
||||
t@@@@@@@@@@@0CCCCCCCCCCG@@@@@@@@@@L
|
||||
1@@@@@@@@@@@@@@@@@@@@@@@@@f
|
||||
1@@@@@@@@@@@L
|
||||
|
||||
Usage: archive.py [options]
|
||||
|
||||
Options:
|
||||
-h, --help show this help message and exit
|
||||
-u URL, --url=URL nettime url
|
||||
(default='http://www.nettime.org/archives.php')
|
||||
-l LIST, --list=LIST nettime's list name (default=nettime-l)
|
||||
-a ARCH, --arch=ARCH path to archives directory (default='archives')
|
||||
|
||||
Dependencies: bs4
|
||||
|
||||
---
|
||||
|
||||
Usage: report.py [options]
|
||||
|
||||
Options:
|
||||
-h, --help show this help message and exit
|
||||
-i INPUT_SCRIPT, --input-script=INPUT_SCRIPT
|
||||
input (json) script mapping commands to text
|
||||
placeholders
|
||||
-o OUTPUT_FILE, --output-file=OUTPUT_FILE
|
||||
report file to be generated
|
||||
-t TEMPLATE_FILE, --template-file=TEMPLATE_FILE
|
||||
template file from which the report is generated
|
||||
-a ARCHIVE, --archive=ARCHIVE
|
||||
the archive dir or file (.json.gz) to produce the
|
||||
report from (default='nettime-l_2016-12-31.json.gz')
|
||||
|
||||
Dependencies: pandas, matplotlib (for graphs)
|
||||
|
||||
|
||||
29
archive.py
29
archive.py
@ -1,29 +0,0 @@
|
||||
import sys, logging
|
||||
from optparse import OptionParser
|
||||
import nettime.archiver as nettime
|
||||
|
||||
logging.basicConfig(level=logging.DEBUG)
|
||||
|
||||
def run(options):
|
||||
|
||||
if not options.url:
|
||||
sys.exit('No url. Aborting.')
|
||||
|
||||
if not options.list:
|
||||
sys.exit('No list. Aborting.')
|
||||
|
||||
## check valid url?... nej
|
||||
|
||||
nettime.archive_from_url(options.url, options.list, options.arch)
|
||||
sys.exit()
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
||||
p = OptionParser();
|
||||
p.add_option('-u', '--url', action="store", help="nettime url (default='http://www.nettime.org/archives.php')", default="http://www.nettime.org/archives.php")
|
||||
p.add_option('-l', '--list', action="store", help="nettime's list name (default=nettime-l)", default="nettime-l")
|
||||
p.add_option('-a', '--arch', action="store", help="path to archives directory (default='archives')", default="archives")
|
||||
|
||||
options, args = p.parse_args()
|
||||
|
||||
run(options)
|
||||
@ -1 +0,0 @@
|
||||
nettime-survey.xyz
|
||||
@ -1,98 +0,0 @@
|
||||
[
|
||||
{ "format": "html",
|
||||
"command": "html_msgs_threads_replies_avg_rep_msg_thrd",
|
||||
"replace": "<--html_msgs_threads_replies_avg_rep_msg_thrd-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_activity_from_ranking",
|
||||
"replace": "<--html_activity_from_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_initiated_from_ranking",
|
||||
"replace": "<--html_threads_initiated_from_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_activity_threads_initiated_avg_ranking",
|
||||
"replace": "<--html_threads_activity_threads_initiated_avg_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_replies_to_ranking",
|
||||
"replace": "<--html_threads_replies_to_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_replies_to_ranking",
|
||||
"replace": "<--html_threads_replies_to_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_initiated_replies_avg_ranking",
|
||||
"replace": "<--html_threads_initiated_replies_avg_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_replies_ranking",
|
||||
"replace": "<--html_replies_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_replies_avg_ranking",
|
||||
"replace": "<--html_replies_avg_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_ranking",
|
||||
"replace": "<--html_threads_ranking-->"
|
||||
},
|
||||
{ "format": "html",
|
||||
"command": "html_threads_ranking_year",
|
||||
"replace": "<--html_threads_ranking_year-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_msgs_threads_replies",
|
||||
"replace": "<--tab_msgs_threads_replies-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_avg_rep_msg_thrd",
|
||||
"replace": "<--tab_avg_rep_msg_thrd-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_activity_from_ranking",
|
||||
"replace": "<--tab_activity_from_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_replies_to_ranking",
|
||||
"replace": "<--tab_threads_replies_to_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_initiated_from_ranking",
|
||||
"replace": "<--tab_threads_initiated_from_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_activity_threads_initiated_avg_ranking",
|
||||
"replace": "<--tab_threads_activity_threads_initiated_avg_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_initiated_replies_avg_ranking",
|
||||
"replace": "<--tab_threads_initiated_replies_avg_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_content_length_from_ranking",
|
||||
"replace": "<--tab_content_length_from_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_ranking",
|
||||
"replace": "<--tab_threads_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_threads_ranking_year",
|
||||
"replace": "<--tab_threads_ranking_year-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_msgs_threads_replies_avg_rep_msg_thrd",
|
||||
"replace": "<--tab_msgs_threads_replies_avg_rep_msg_thrd-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_replies_ranking",
|
||||
"replace": "<--tab_replies_ranking-->"
|
||||
},
|
||||
{ "format": "text",
|
||||
"command": "tab_replies_avg_ranking",
|
||||
"replace": "<--tab_replies_avg_ranking-->"
|
||||
}
|
||||
]
|
||||
Binary file not shown.
|
Before Width: | Height: | Size: 46 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 26 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 34 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 25 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 28 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 26 KiB |
3726
docs/index.html
3726
docs/index.html
File diff suppressed because it is too large
Load Diff
219
docs/index.md
219
docs/index.md
@ -1,219 +0,0 @@
|
||||
---
|
||||
title: Nettime Survey (1995-2016)
|
||||
---
|
||||
|
||||
|
||||
|
||||
#Synopsis
|
||||
|
||||
While contemporary social media have been critiqued for their ephemeral effects on activist politics, the mailing list has proven an enduring venue for geographically dispersed communities to participate and remain in dialog over the course of decades. Founded in Amsterdam in 1995, the Nettime mailing list ([http://nettime.org](http://nettime.org)) has played host to a community of activists and media artists and help to launch or establish the careers of a number of prominent new media theorists and Internet critics. Established in an era prior to the corporatization of the Web, over the course of its twenty first years (1995-2016), Nettime has continued to discuss the Web in terms of the radical political possibilities with which it was imagined in its ‘salad days’.
|
||||
|
||||
This project aims to trace the evolution of Nettime (more precisely nettime-l) through a survey of its mailing list's archive ([http://nettime.org/archives.php](http://nettime.org/archives.php)).
|
||||
|
||||
#Survey
|
||||
|
||||
During our quick investigation of Nettime's list structure and content, we came up with three main clusters of questions that we subsequently approached in our study.
|
||||
|
||||
* List activity: As a mailing list, Nettime is popularly associated with mid-90s / early 2000s media activism, yet it continues to be active to this day.
|
||||
|
||||
* When was Nettime most active?
|
||||
* Does Nettime have periods and/or cohorts?
|
||||
|
||||
* List vigour: A mailing list's health may, perhaps, be seen as a function of the extent to which it is a space of dialogue.
|
||||
|
||||
* When was Nettime at its most dialogical?
|
||||
* What can be a sound measure of Nettime's vigour (over time)?
|
||||
|
||||
* Outspokeness: Mailing lists, such as Nettime, tend to be influenced by stark intellectual and political convictions bolstered by strong personalities.
|
||||
|
||||
* Who have been (are) Nettime's most prolific contributors?
|
||||
* Is there different kinds of contributions (posting, threads/replies)?
|
||||
* How might one begin to periodize the list in light of these contributions?
|
||||
* Does Nettime have cliques?
|
||||
|
||||
It is worth noting that our study does not (at this stage) present a discourse analysis of the content of the mailing list per se. Rather, we used the structure of the list itself (the "meta-data" so to speak) to infer a type of "time series" of the networked activity that occurred on the list in the past 21 years (1995-2016).
|
||||
|
||||
##Activity
|
||||
|
||||
There are a few instances where Nettime talks to itself, notably to inform the list of the number of its subscribers. These messages usually report certain subscription milestones, and from the current archive, we have identified six of these messages (listed in the table below) which gives an idea of the 'subscription rate' of Nettime over the years.
|
||||
|
||||
One can clearly see that this rate increases at the beginning of the 00's, flattens out between 2002 and 2005, diminishes considerably between 2005 and 2011 and increases slightly between 2011 and 2015. More precisely, if, for the sake of argument, we were to assume the subscription rate to be linear (which of course is not really), then from 1995 to 2001 the rate is roughly 33 subscriptions/month, from 2001 to 2002 it is 66 subscriptions/month (600 in 9 months), from 2002 to 2004 it accounts to 27 subscriptions/month, from 2004 to 2005 to 25 subscriptions/month, form 2005 to 2011 it drops to 6 subscriptions/month and finally it amounts to 10 subscriptions/month from 2011 to 2015.
|
||||
|
||||
|
||||
<table>
|
||||
<tbody>
|
||||
<tr>
|
||||
<td>Subscribers</td>
|
||||
<td>Date</td>
|
||||
<td>Reference</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>4500 (N4.5K) </td>
|
||||
<td> 09/2015 </td>
|
||||
<td> [https://www.nettime.org/Lists-Archives/nettime-l-1509/msg00035.html](https://nettime.org/Lists-Archives/nettime-l-1509/msg00035.html)</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>4000 (N4K) </td>
|
||||
<td> 11/2011 </td>
|
||||
<td> [https://www.nettime.org/Lists-Archives/nettime-l-1111/msg00041.html](https://www.nettime.org/Lists-Archives/nettime-l-1111/msg00041.html)</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>3500 (N3.5K) </td>
|
||||
<td> 04/2005 </td>
|
||||
<td> [http://www.nettime.org/Lists-Archives/nettime-l-0504/msg00003.html](http://www.nettime.org/Lists-Archives/nettime-l-0504/msg00003.html)</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>3250 (N3.25K) </td>
|
||||
<td> 06/2004 </td>
|
||||
<td> [http://www.nettime.org/Lists-Archives/nettime-l-0407/msg00029.html](http://www.nettime.org/Lists-Archives/nettime-l-0407/msg00029.html)</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>2600 (N2.6K) </td>
|
||||
<td> 06/2002 </td>
|
||||
<td> [http://www.nettime.org/Lists-Archives/nettime-l-0207/msg00087.html](http://www.nettime.org/Lists-Archives/nettime-l-0207/msg00087.html)</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>2000 (N2K) </td>
|
||||
<td> 09/2001 </td>
|
||||
<td> [http://www.nettime.org/Lists-Archives/nettime-l-0109/msg00133.html](http://www.nettime.org/Lists-Archives/nettime-l-0109/msg00133.html)</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
|
||||
<div class="figure"><p class="caption">table 0: Nettime's subscriptions digest</p></div>
|
||||
|
||||
|
||||
Put simply, 3500 subscribers joined Nettime in the first 10 years of its existence, and it took 10 years for another 1000 subscribers to join them.
|
||||
|
||||
Though this is only subscriptions. Not everyone post to the list. So what about the actual number of messages over time?
|
||||
|
||||
|
||||
|
||||
What we colloquially refer to as a "cohort" resembles, to some degree, the notion of subscription rate discussed above. Both notions speak to the idea of Nettime's "newcomers". Though rather than consisting of the sheer amount of subscriptions over time (data which is not available from the archive), we consider when a message first appeared on the list given an email address provenance. The graph of _figure 0_ displays the sum of these "first message" instances per month (50 months quintiles). A spike in the graph could be read as the formation of a new cohort, that is, an increase in the activity of newcomers, which may signify, albeit hypothetically, that an aggregate of common interests are brought forth on the list.
|
||||
|
||||
Theres are observable spikes that appear here and there through out the months and years in _figure 0_, however, these are short lived (max 6 months). What is more striking is the sustained activity that occurred in first two quintiles of the graph (1996-2004). This activity can be correlated with the high subscription rate described earlier. Though, unlike subscriptions, the amount of "first messages" peaked around the year 2000, rather than between 2001-2002 (66 subscriptions/month). Let us call this peak the 2000 cohort.
|
||||
|
||||
After 2004, the number of first messages declines. As noted below, this can be attributed to the creation of nettime-ann in 2005, which rerouted announcement-type activity out off nettime-l. Nonetheless, it can be argued, when considering the low subscription rate in the interval 2005-2011 (6 subscriptions/month), that the barely noticeable peaks of 2008 and 2011 are significant. Thus Nettime may harbor more than a single 2000 cohort, 2008 and 2011 being the other two though remarkably less momentous than the first one.
|
||||
|
||||
|
||||
|
||||
|
||||
The graph above illustrates the total amount of messages that have been posted on Nettime over two decades. It is clear that, as with the subscription rates and the cohorts, the list was most active in 1999, 2000, 2001, 2002, and 2003. It diminished considerably in 2004 and plateaued (more or less) until 2010, then increased in 2011 and decreased again the last 5 years.
|
||||
|
||||
In our conversations with Geert Lovink, we derived a few observations on the data at hand, mainly that:
|
||||
|
||||
* The fact that the list became moderated in 1999 did not prevent its activity to grow considerably or at least sustain its level of activity in the subsequent years.
|
||||
* nettime-ann was created in July 2005 and may be the reason explaining the drop in activity on nettime-l during the last decade.
|
||||
* The spikes in 2008/2009 may be explained by the global economical context.
|
||||
* The spike in 2011 may be explained by the political uprisings in the middle-east.
|
||||
|
||||
Was Nettime's heyday only part of the first decade of its existence? Judged solely in terms of sheer amount of postings to the list (activity), it clearly can be seen to have diminished. However, in what follows, we propose different schemata, measuring the amount of dialog on the list (vigour) as well categorizing that dialog by the most prolific contributors (outspokeness).
|
||||
|
||||
##Vigour
|
||||
|
||||
A mailing list certainly lay itself to announcements-type messages where a single message is posted to the list while no one does and/or is expected to reply. Yet, more importantly, what mailing lists also allow is to produce 'threads' which are formed around a varying amount of replies to an initial message. These threads form the basis of an asynchronous 'dialog' so to speak. As introduce in the previous section, we came up with the term 'vigour' to account for this practice of replying to messages, which, in turn, create 'dialogical' dynamics between some of the list's members.
|
||||
|
||||
Our study surveys Nettime's vigour by analyzing the 'who' and 'when' of the list's thread formation. What follows is an overall (initial) measure of this vigour over time.
|
||||
|
||||
<--html_msgs_threads_replies_avg_rep_msg_thrd-->
|
||||
|
||||
<div class="figure"><p class="caption">table 1: Nettime list's components (message, threads, replies) year by year</p></div>
|
||||
|
||||
It is worth noting and explaining here the nomenclature/taxonomy used in the survey. First, the survey differentiates between what is called a 'message' and a 'thread', a message being anything that is posted on the list while a thread is a message that has at least one reply (a type of message that initiates a 'dialog'/thread). Every thread is a message but not all messages are threads. Second, the survey differentiates between what is dubbed a 'reply' and a thread. A reply is typically a reply to a thread, or, differently put, it is a reply to a message that makes this initial message a thread. Thus reply and thread are closely connected yet different. Needless to say that, as for the case of a thread, a reply is a message but not all messages are replies. Finally, there is single messages, ones that are neither threads or replies. The following chart is a breakdown of _figure 1_, following this 'message-thread-reply' taxonomy.
|
||||
|
||||
|
||||
|
||||
What becomes clear from the chart above is how the ratio of replies and threads versus the sheer amount of messages increases considerably in the last 10 years. While the volume of messages decreases, the average number of 'dialogical' messages increases (threads and replies). The following charts attest this (quite simple and obvious) observation.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
According to our survey, it is fair to say that Nettime has become a more dialogical mailing list in the second decade of its existence. Since 2006, the list steadily churns out, on average, more threads and replies than single messages posting; in other words, less announcements and more discussions/dialogs.
|
||||
|
||||
The following chart (_figure 5_) shows an even more sustained trend that complements our observations, that is, the ratio of the number of replies per thread. This steady, almost linear, increase over time of the number of replies to given threads shows a certain 'maturity' of the list as it demonstrates how Nettime dialogs are composed of an increasing number of messages and interlocutors.
|
||||
|
||||
|
||||
|
||||
While there are many reasons that can explain this shift in the list's activities and behaviours (branching off of nettime-ann in 2005, the 'rise' of political activism since 2008, the list's subscribers knowing each other, etc.) our survey nonetheless observes a sustained trend towards Nettime developing a 'thread culture' as opposed to an earlier 'announcement culture'. Yet, since we are not performing discourse analysis of the content of the list, it is impossible to correlate a shift of discourse which could, potentially, accompany such a shift of culture.
|
||||
|
||||
Coming back to our notion of 'vigour' (as described in the previous section), our survey clearly demonstrates that Nettime is more vigourous then ever, as it harbours more dialogs (threads and replies) on average than it did in its early 'salad days'. While the subscription rate may have decreased in the last decade, Nettime, nonetheless, seems to have become an durable/stable dialogical space that features an increasing amount participation from its members.
|
||||
|
||||
##Outspokenness
|
||||
|
||||
What messages have being discussed the most on Nettime? Who are the list's most prolific contributors in terms of (1) messages, (2) threads and (3) replies? In this section, we are interested in ranking messages and contributors according to their respective (brute) statistics derived from the archive. What follows is a set of self-explanatory tables and figures that have been produced with these statistics.
|
||||
|
||||
###Activity (aka. messages)
|
||||
|
||||
<--html_activity_from_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 2: Top 10 contributors ranking for total amount of messages</p></div>
|
||||
|
||||
|
||||
|
||||
###Threads
|
||||
|
||||
<--html_threads_initiated_from_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 3: Top 10 contributors ranking for total amount of (initiated) threads</p></div>
|
||||
|
||||
<--html_threads_activity_threads_initiated_avg_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 4: Top 10 contributors ranking for average amount of (initiated) threads</p></div>
|
||||
|
||||
###Replies
|
||||
|
||||
Our survey's replies statistics are divided into two categories: (1) replies to a thread initiated by a given contributor ('replies to') and (2) replies originating from a given contributor ('replies from')
|
||||
|
||||
<--html_threads_replies_to_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 5: Top 10 contributors ranking for total amount of 'replies to'</p></div>
|
||||
|
||||
|
||||
|
||||
<--html_threads_initiated_replies_avg_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 6: Top 10 contributors ranking for average amount of 'replies to'</p></div>
|
||||
|
||||
<--html_replies_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 7: Top 10 contributors ranking for amount of 'replies from'</p></div>
|
||||
|
||||
<--html_replies_avg_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 8: Top 10 contributors ranking for average amount of 'replies from'</p></div>
|
||||
|
||||
###Most replied messages overall (1995-2016)
|
||||
|
||||
<--html_threads_ranking-->
|
||||
|
||||
<div class="figure"><p class="caption">table 9: Top 10 most replied messages</p></div>
|
||||
|
||||
###Most replied messages per year (1995-2016)
|
||||
|
||||
<--html_threads_ranking_year-->
|
||||
|
||||
#Method & Archives
|
||||
|
||||
The survey's object of study is Nettime's archived mailing list, which is available online [nettime.org/archive.php](nettime.org/archive.php). We had to program a custom [MHonArc](http://www.mhonarc.at) web scrapper to gather all the messages from this online archive since there is no export function available from the current web interface.
|
||||
|
||||
* All Nettime Survey's scripts written in Python are publicly available and can be found at [https://github.com/gauthiier/nettime](https://github.com/gauthiier/nettime). The logic and output scripts heavily rely on [pandas](http://pandas.pydata.org) and [matplotlib](http://matplotlib.org).
|
||||
* Nettime archive (1995-2016) is publicly available in the legacy [mbox](http://www.qmail.org/man/man5/mbox.html) format at the following address: [http://nettime-survey.xyz/arch/nettime-l-2016-12-31.mbox.tar.gz](http://nettime-survey.xyz/arch/nettime-l-2016-12-31.mbox.tar.gz) (archived 31/12/2016)
|
||||
* Nettime archive (1995-2016) is publicly available in json format at the following address: [http://nettime-survey.xyz/arch/nettime-l-2016-12-31.json.gz](http://nettime-survey.xyz/arch/nettime-l-2016-12-31.json.gz) (archived 31/12/2016)
|
||||
|
||||
Also, consistent with the ‘90s’-era origins of Nettime, our survey aesthetically resembles a web 1.0 report and does not allow for much interaction (static html page). This was deliberate ;-)
|
||||
|
||||
#Further Research
|
||||
|
||||
To our mind the content of the posts and conversations in Nettime is, in fact, what makes this list of particular interest from the perspective of new media studies. Our survey is, of course, limited in scope and could have featured a much deeper (and perhaps more scientific) analysis of the list. To this end, here are a couple of points that may be worked on:
|
||||
|
||||
* It seems that a thorough time analysis of the list would prompt interesting question having to do with periodizing the ‘eras’ or ‘times of Nettime’, in terms of who were the main contributing figures in different periods and how might they have clustered into specific cohorts. However, given the fact that subscriptions dramatically diminished in the last decade, the vigourous times of Nettime may not signify the emergence of new cohorts (with perhaps different discourses) so much as changing dynamics within an existing one.
|
||||
|
||||
* Performing a discourse analysis on the content of the messages may also shed light into Nettime's periods. For instance, we know that media-arts-centered debates took place on the list at different times (we are very interested on these). Would it be possible to periodise these instances and compare their advent, for example, with the more activist-type dialogs that seem the pervade the list in all epochs?
|
||||
|
||||
* Dialogical clusters may be extracted and analysed to foreground the possible various 'cliques' that may, by habit, form depending on the subject at hand. Coupling this type of analysis with the previous discourse analysis could potentially produce an interesting index of the list.
|
||||
|
||||
#Nettime Surveyors
|
||||
|
||||
David Gauthier and Marc Tuters. Special thanks to Geert Lovink for his insights.
|
||||
|
||||
@ -1,29 +0,0 @@
|
||||
# generates docs
|
||||
|
||||
ARCHIVE := arch/nettime-l_2016-12-31.json.gz
|
||||
CMDSCRIPT := command-script.json
|
||||
|
||||
all: init index.html txt.txt clean-stage
|
||||
|
||||
init:
|
||||
@command -v pandoc > /dev/null 2>&1 || (echo 'pandoc not found... please visit -- http://johnmacfarlane.net/pandoc/installing.html' && exit 1)
|
||||
|
||||
%.md.stage: index.md
|
||||
python ../report.py -i $(CMDSCRIPT) -o $@ -t $< -a $(ARCHIVE)
|
||||
|
||||
%.html: %.md.stage
|
||||
pandoc -s --template style/template.html5 -c style/style.css -o $@ $<
|
||||
|
||||
%.txt.stage: txt.d
|
||||
python ../report.py -i $(CMDSCRIPT) -o $@ -t $< -a $(ARCHIVE)
|
||||
|
||||
%.txt: %.txt.stage
|
||||
fold -sw 80 $< > $@
|
||||
|
||||
clean-stage:
|
||||
rm -rf *.stage
|
||||
|
||||
clean:
|
||||
rm -rf *.hml *.txt
|
||||
|
||||
.PHONY: init clean clean-stage
|
||||
@ -1,530 +0,0 @@
|
||||
/*
|
||||
Style.css
|
||||
A revised Pandoc/Markdown/Multi-Markdown CSS stylesheet tailored for html5
|
||||
output for the wwwriting site hosted on ....
|
||||
Author: gauthiier
|
||||
Revised: 10 Feb 2015
|
||||
|
||||
This file is based on:
|
||||
|
||||
Buttondown
|
||||
A Markdown/MultiMarkdown/Pandoc HTML output CSS stylesheet
|
||||
Author: Ryan Gray
|
||||
Date: 15 Feb 2011
|
||||
Revised: 21 Feb 2012
|
||||
|
||||
General style is clean, with minimal re-definition of the defaults or
|
||||
overrides of user font settings. The body text and header styles are
|
||||
left alone except title, author and date classes are centered. A Pandoc TOC
|
||||
is not printed, URLs are printed after hyperlinks in parentheses.
|
||||
Block quotes are italicized. Tables are lightly styled with lines above
|
||||
and below the table and below the header with a boldface header. Code
|
||||
blocks are line wrapped.
|
||||
|
||||
All elements that Pandoc and MultiMarkdown use should be listed here, even
|
||||
if the style is empty so you can easily add styling to anything.
|
||||
|
||||
There are some elements in here for HTML5 output of Pandoc, but I have not
|
||||
gotten around to testing that yet.
|
||||
*/
|
||||
|
||||
/* NOTES:
|
||||
|
||||
Stuff tried and failed:
|
||||
|
||||
It seems that specifying font-family:serif in Safari will always use
|
||||
Times New Roman rather than the user's preferences setting.
|
||||
|
||||
Making the font size different or a fixed value for print in case the screen
|
||||
font size is making the print font too big: Making font-size different for
|
||||
print than for screen causes horizontal lines to disappear in math when using
|
||||
MathJax under Safari.
|
||||
*/
|
||||
|
||||
/* ---- Front Matter ---- */
|
||||
|
||||
/* Pandoc header DIV. Contains .title, .author and .date. Comes before div#TOC.
|
||||
Only appears if one of those three are in the document.
|
||||
*/
|
||||
|
||||
div#header, header
|
||||
{
|
||||
/* Put border on bottom. Separates it from TOC or body that comes after it. */
|
||||
border-bottom: 1px solid #aaa;
|
||||
margin-bottom: 0.5em;
|
||||
}
|
||||
|
||||
.title /* Pandoc title header (h1.title) */
|
||||
{
|
||||
text-align: center;
|
||||
}
|
||||
|
||||
.author, .date /* Pandoc author(s) and date headers (h2.author and h3.date) */
|
||||
{
|
||||
text-align: center;
|
||||
}
|
||||
|
||||
/* Pandoc table of contents DIV when using the --toc option.
|
||||
NOTE: this doesn't support Pandoc's --id-prefix option for #TOC and #header.
|
||||
Probably would need to use div[id$='TOC'] and div[id$='header'] as selectors.
|
||||
*/
|
||||
|
||||
div#TOC, nav#TOC
|
||||
{
|
||||
/* Put border on bottom to separate it from body. */
|
||||
border-bottom: 1px solid #aaa;
|
||||
margin-bottom: 0.5em;
|
||||
}
|
||||
|
||||
@media print
|
||||
{
|
||||
div#TOC, nav#TOC
|
||||
{
|
||||
/* Don't display TOC in print */
|
||||
display: none;
|
||||
}
|
||||
}
|
||||
|
||||
/* ---- Headers and sections ---- */
|
||||
|
||||
h1, h2, h3, h4, h5, h6
|
||||
{
|
||||
/* font-family: "Helvetica Neue", Helvetica, "Liberation Sans", Calibri, Arial, sans-serif; /* Sans-serif headers */
|
||||
|
||||
font-family: "Liberation Serif", "Georgia", "Times New Roman", serif; /* Serif headers */
|
||||
|
||||
page-break-after: avoid; /* Firefox, Chrome, and Safari do not support the property value "avoid" */
|
||||
}
|
||||
|
||||
/* Pandoc with --section-divs option */
|
||||
|
||||
div div, section section /* Nested sections */
|
||||
{
|
||||
margin-left: 2em; /* This will increasingly indent nested header sections */
|
||||
}
|
||||
|
||||
p {}
|
||||
|
||||
/* Main container for the whole content / body section -- html5 */
|
||||
content {
|
||||
padding: 0.9em;
|
||||
max-width: 45em;
|
||||
display: block;
|
||||
text-align: justify;
|
||||
margin: auto;
|
||||
word-wrap: break-word;
|
||||
}
|
||||
|
||||
.references {
|
||||
text-align: left;
|
||||
}
|
||||
|
||||
blockquote
|
||||
{
|
||||
font-style: italic;
|
||||
}
|
||||
|
||||
li /* All list items */
|
||||
{
|
||||
}
|
||||
|
||||
li > p /* Loosely spaced list item */
|
||||
{
|
||||
margin-top: 1em; /* IE: lack of space above a <li> when the item is inside a <p> */
|
||||
}
|
||||
|
||||
ul /* Whole unordered list */
|
||||
{
|
||||
}
|
||||
|
||||
ul li /* Unordered list item */
|
||||
{
|
||||
}
|
||||
|
||||
ol /* Whole ordered list */
|
||||
{
|
||||
}
|
||||
|
||||
ol li /* Ordered list item */
|
||||
{
|
||||
}
|
||||
|
||||
hr {}
|
||||
|
||||
/* ---- Some span elements --- */
|
||||
|
||||
sub /* Subscripts. Pandoc: H~2~O */
|
||||
{
|
||||
}
|
||||
|
||||
sup /* Superscripts. Pandoc: The 2^nd^ try. */
|
||||
{
|
||||
}
|
||||
|
||||
em /* Emphasis. Markdown: *emphasis* or _emphasis_ */
|
||||
{
|
||||
}
|
||||
|
||||
em > em /* Emphasis within emphasis: *This is all *emphasized* except that* */
|
||||
{
|
||||
font-style: normal;
|
||||
}
|
||||
|
||||
strong /* Markdown **strong** or __strong__ */
|
||||
{
|
||||
}
|
||||
|
||||
/* ---- Links (anchors) ---- */
|
||||
|
||||
a /* All links */
|
||||
{
|
||||
/* Keep links clean. On screen, they are colored; in print, they do nothing anyway. */
|
||||
text-decoration: none;
|
||||
}
|
||||
|
||||
@media screen
|
||||
{
|
||||
a:hover
|
||||
{
|
||||
/* On hover, we indicate a bit more that it is a link. */
|
||||
text-decoration: underline;
|
||||
}
|
||||
}
|
||||
|
||||
@media print
|
||||
{
|
||||
a {
|
||||
/* In print, a colored link is useless, so un-style it. */
|
||||
color: black;
|
||||
background: transparent;
|
||||
}
|
||||
|
||||
a[href^="http://"]:after, a[href^="https://"]:after
|
||||
{
|
||||
/* However, links that go somewhere else, might be useful to the reader,
|
||||
so for http and https links, print the URL after what was the link
|
||||
text in parens
|
||||
*/
|
||||
content: " (" attr(href) ") ";
|
||||
font-size: 90%;
|
||||
}
|
||||
}
|
||||
|
||||
/* ---- Images ---- */
|
||||
|
||||
img
|
||||
{
|
||||
/* Let it be inline left/right where it wants to be, but verticality make
|
||||
it in the middle to look nicer, but opinions differ, and if in a multi-line
|
||||
paragraph, it might not be so great.
|
||||
*/
|
||||
vertical-align: middle;
|
||||
max-width: 100%;
|
||||
}
|
||||
|
||||
div.figure /* Pandoc figure-style image */
|
||||
{
|
||||
/* Center the image and caption */
|
||||
margin-left: auto;
|
||||
margin-right: auto;
|
||||
text-align: center;
|
||||
font-style: italic;
|
||||
}
|
||||
|
||||
/** EXXXTRA **/
|
||||
figure /* Pandoc figure-style image */
|
||||
{
|
||||
/* Center the image and caption */
|
||||
margin-left: auto;
|
||||
margin-right: auto;
|
||||
text-align: center;
|
||||
font-style: italic;
|
||||
}
|
||||
|
||||
p.caption /* Pandoc figure-style caption within div.figure */
|
||||
{
|
||||
/* Inherits div.figure props by default */
|
||||
}
|
||||
|
||||
.inline-img
|
||||
{
|
||||
display: block;
|
||||
margin-right: auto;
|
||||
margin-left: auto;
|
||||
}
|
||||
|
||||
/* ---- Code blocks and spans ---- */
|
||||
|
||||
pre, code
|
||||
{
|
||||
background-color: #fdf7ee;
|
||||
/* BEGIN word wrap */
|
||||
/* Need all the following to word wrap instead of scroll box */
|
||||
/* This will override the overflow:auto if present */
|
||||
white-space: pre-wrap; /* css-3 */
|
||||
white-space: -moz-pre-wrap !important; /* Mozilla, since 1999 */
|
||||
white-space: -pre-wrap; /* Opera 4-6 */
|
||||
white-space: -o-pre-wrap; /* Opera 7 */
|
||||
word-wrap: break-word; /* Internet Explorer 5.5+ */
|
||||
/* END word wrap */
|
||||
}
|
||||
|
||||
pre /* Code blocks */
|
||||
{
|
||||
/* Distinguish pre blocks from other text by more than the font with a background tint. */
|
||||
padding: 0.5em; /* Since we have a background color */
|
||||
border-radius: 5px; /* Softens it */
|
||||
/* Give it a some definition */
|
||||
border: 1px solid #aaa;
|
||||
/* Set it off left and right, seems to look a bit nicer when we have a background */
|
||||
margin-left: 0.5em;
|
||||
margin-right: 0.5em;
|
||||
}
|
||||
|
||||
@media screen
|
||||
{
|
||||
pre
|
||||
{
|
||||
/* On screen, use an auto scroll box for long lines, unless word-wrap is enabled */
|
||||
white-space: pre;
|
||||
overflow: auto;
|
||||
/* Dotted looks better on screen and solid seems to print better. */
|
||||
border: 1px dotted #777;
|
||||
}
|
||||
}
|
||||
|
||||
code /* All inline code spans */
|
||||
{
|
||||
}
|
||||
|
||||
p > code, li > code /* Code spans in paragraphs and tight lists */
|
||||
{
|
||||
/* Pad a little from adjacent text */
|
||||
padding-left: 2px;
|
||||
padding-right: 2px;
|
||||
}
|
||||
|
||||
li > p code /* Code span in a loose list */
|
||||
{
|
||||
/* We have room for some more background color above and below */
|
||||
padding: 2px;
|
||||
}
|
||||
|
||||
/* ---- Math ---- */
|
||||
|
||||
span.math /* Pandoc inline math default and --jsmath inline math */
|
||||
{
|
||||
/* Tried font-style:italic here, and it messed up MathJax rendering in some browsers. Maybe don't mess with at all. */
|
||||
}
|
||||
|
||||
div.math /* Pandoc --jsmath display math */
|
||||
{
|
||||
}
|
||||
|
||||
span.LaTeX /* Pandoc --latexmathml math */
|
||||
{
|
||||
}
|
||||
|
||||
eq /* Pandoc --gladtex math */
|
||||
{
|
||||
}
|
||||
|
||||
/* ---- Tables ---- */
|
||||
|
||||
/* A clean textbook-like style with horizontal lines above and below and under
|
||||
the header. Rows highlight on hover to help scanning the table on screen.
|
||||
*/
|
||||
|
||||
/*table {
|
||||
width: 100%;
|
||||
}
|
||||
|
||||
table, th, td {
|
||||
border: 1px solid black;
|
||||
text-align: center;
|
||||
}
|
||||
*/
|
||||
|
||||
table
|
||||
{
|
||||
|
||||
width: 100%;
|
||||
|
||||
/* border-collapse: collapse;
|
||||
*/
|
||||
|
||||
border: 1pt solid black;
|
||||
|
||||
/* Center */
|
||||
margin-left: auto;
|
||||
margin-right: auto;
|
||||
}
|
||||
|
||||
thead /* Entire table header */
|
||||
{
|
||||
border-bottom: 1pt solid #000;
|
||||
background-color: #eee; /* Does this BG print well? */
|
||||
}
|
||||
|
||||
tr.header /* Each header row */
|
||||
{
|
||||
}
|
||||
|
||||
tbody /* Entire table body */
|
||||
{
|
||||
}
|
||||
|
||||
/* Table body rows */
|
||||
|
||||
tr {
|
||||
border: 1pt solid black;
|
||||
}
|
||||
tr.odd:hover, tr.even:hover /* Use .odd and .even classes to avoid styling rows in other tables */
|
||||
{
|
||||
background-color: #eee;
|
||||
}
|
||||
|
||||
/* Odd and even rows */
|
||||
tr.odd {}
|
||||
tr.even {}
|
||||
|
||||
td, th /* Table cells and table header cells */
|
||||
{
|
||||
vertical-align: top; /* Word */
|
||||
vertical-align: baseline; /* Others */
|
||||
padding-left: 0.5em;
|
||||
padding-right: 0.5em;
|
||||
padding-top: 0.2em;
|
||||
padding-bottom: 0.2em;
|
||||
border: 1pt solid black;
|
||||
}
|
||||
|
||||
/* Removes padding on left and right of table for a tight look. Good if thead has no background color*/
|
||||
/*
|
||||
tr td:last-child, tr th:last-child
|
||||
{
|
||||
padding-right: 0;
|
||||
}
|
||||
tr td:first-child, tr th:first-child
|
||||
{
|
||||
padding-left: 0;
|
||||
}
|
||||
*/
|
||||
|
||||
th /* Table header cells */
|
||||
{
|
||||
font-weight: bold;
|
||||
}
|
||||
|
||||
tfoot /* Table footer (what appears here if caption is on top?) */
|
||||
{
|
||||
}
|
||||
|
||||
caption /* This is for a table caption tag, not the p.caption Pandoc uses in a div.figure */
|
||||
{
|
||||
caption-side: top;
|
||||
border: none;
|
||||
font-size: 0.9em;
|
||||
font-style: italic;
|
||||
text-align: center;
|
||||
margin-bottom: 0.3em; /* Good for when on top */
|
||||
padding-bottom: 0.2em;
|
||||
}
|
||||
|
||||
/* ---- Definition lists ---- */
|
||||
|
||||
dl /* The whole list */
|
||||
{
|
||||
border-top: 2pt solid black;
|
||||
padding-top: 0.5em;
|
||||
border-bottom: 2pt solid black;
|
||||
}
|
||||
|
||||
dt /* Definition term */
|
||||
{
|
||||
font-weight: bold;
|
||||
}
|
||||
|
||||
dd+dt /* 2nd or greater term in the list */
|
||||
{
|
||||
border-top: 1pt solid black;
|
||||
padding-top: 0.5em;
|
||||
}
|
||||
|
||||
dd /* A definition */
|
||||
{
|
||||
margin-bottom: 0.5em;
|
||||
}
|
||||
|
||||
dd+dd /* 2nd or greater definition of a term */
|
||||
{
|
||||
border-top: 1px solid black; /* To separate multiple definitions */
|
||||
}
|
||||
|
||||
/* ---- Footnotes ---- */
|
||||
|
||||
a.footnote, a.footnoteRef { /* Pandoc, MultiMarkdown footnote links */
|
||||
font-size: small;
|
||||
vertical-align: text-top;
|
||||
}
|
||||
|
||||
a[href^="#fnref"], a.reversefootnote /* Pandoc, MultiMarkdown, ?? footnote back links */
|
||||
{
|
||||
}
|
||||
|
||||
@media print
|
||||
{
|
||||
a[href^="#fnref"], a.reversefootnote /* Pandoc, MultiMarkdown */
|
||||
{
|
||||
/* Don't display these at all in print since the arrow is only something to click on */
|
||||
display: none;
|
||||
}
|
||||
}
|
||||
|
||||
div.footnotes /* Pandoc footnotes div at end of the document */
|
||||
{
|
||||
}
|
||||
|
||||
div.footnotes li[id^="fn"] /* A footnote item within that div */
|
||||
{
|
||||
}
|
||||
|
||||
/* You can class stuff as "noprint" to not print.
|
||||
Useful since you can't set this media conditional inside an HTML element's
|
||||
style attribute (I think), and you don't want to make another stylesheet that
|
||||
imports this one and adds a class just to do this.
|
||||
*/
|
||||
|
||||
@media print
|
||||
{
|
||||
.noprint
|
||||
{
|
||||
display:none;
|
||||
}
|
||||
}
|
||||
|
||||
/* custom styling for nettime survey (1995-2016)*/
|
||||
|
||||
.thread_rank_year {
|
||||
display: inline-block;
|
||||
border: 1px solid black;
|
||||
margin: 1em;
|
||||
}
|
||||
|
||||
.thread_rank_year .year_t {
|
||||
border: 1px solid black;
|
||||
margin: 1em;
|
||||
padding: 0.25em;
|
||||
}
|
||||
|
||||
.thread_rank_year .year_t:hover {
|
||||
background-color: blue;
|
||||
}
|
||||
|
||||
|
||||
|
||||
.thread_rank_year .rank_t {
|
||||
display: none;
|
||||
margin: 1em;
|
||||
margin-bottom: 2em;
|
||||
}
|
||||
@ -1,18 +0,0 @@
|
||||
|
||||
var ranks = document.getElementsByClassName("thread_rank_year");
|
||||
|
||||
for(var i = 0; i < ranks.length; i++) {
|
||||
let r = ranks[i];
|
||||
r.state = false;
|
||||
r.addEventListener('click', function(who) {
|
||||
if(r.state) {
|
||||
r.children[1].style.display = 'none';
|
||||
} else {
|
||||
r.children[1].style.display = 'block';
|
||||
}
|
||||
r.state = !r.state;
|
||||
}, false);
|
||||
}
|
||||
|
||||
|
||||
|
||||
@ -1,69 +0,0 @@
|
||||
<!DOCTYPE html>
|
||||
<html$if(lang)$ lang="$lang$"$endif$>
|
||||
<head>
|
||||
<meta charset="utf-8">
|
||||
<meta name="generator" content="pandoc">
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
|
||||
$for(author-meta)$
|
||||
<meta name="author" content="$author-meta$">
|
||||
$endfor$
|
||||
$if(date-meta)$
|
||||
<meta name="dcterms.date" content="$date-meta$">
|
||||
$endif$
|
||||
<title>$if(title-prefix)$$title-prefix$ - $endif$$pagetitle$</title>
|
||||
<style type="text/css">code{white-space: pre;}</style>
|
||||
$if(quotes)$
|
||||
<style type="text/css">q { quotes: "“" "”" "‘" "’"; }</style>
|
||||
$endif$
|
||||
$if(highlighting-css)$
|
||||
<style type="text/css">
|
||||
$highlighting-css$
|
||||
</style>
|
||||
$endif$
|
||||
$for(css)$
|
||||
<link rel="stylesheet" href="$css$">
|
||||
$endfor$
|
||||
$if(math)$
|
||||
$math$
|
||||
$endif$
|
||||
$for(header-includes)$
|
||||
$header-includes$
|
||||
$endfor$
|
||||
</head>
|
||||
<body>
|
||||
$for(include-before)$
|
||||
$include-before$
|
||||
$endfor$
|
||||
<content>
|
||||
$if(title)$
|
||||
<header>
|
||||
<h1 class="title">$title$</h1>
|
||||
$if(subtitle)$
|
||||
<h1 class="subtitle">$subtitle$</h1>
|
||||
$endif$
|
||||
$if(cover)$
|
||||
<figure>
|
||||
<img src="$cover$"/>
|
||||
</figure>
|
||||
$endif$
|
||||
$for(author)$
|
||||
<h2 class="author">$author$</h2>
|
||||
$endfor$
|
||||
$if(date)$
|
||||
<h3 class="date">$date$</h3>
|
||||
$endif$
|
||||
</header>
|
||||
$endif$
|
||||
$if(toc)$
|
||||
<nav id="$idprefix$TOC">
|
||||
$toc$
|
||||
</nav>
|
||||
$endif$
|
||||
$body$
|
||||
</content>
|
||||
$for(include-after)$
|
||||
$include-after$
|
||||
$endfor$
|
||||
<script src="style/style.js"></script>
|
||||
</body>
|
||||
</html>
|
||||
|
Before Width: | Height: | Size: 9.6 KiB After Width: | Height: | Size: 9.6 KiB |
BIN
figures/activity-ranking-text.png
Normal file
BIN
figures/activity-ranking-text.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 54 KiB |
|
Before Width: | Height: | Size: 486 KiB After Width: | Height: | Size: 486 KiB |
47
figures/activity-ranking.txt
Normal file
47
figures/activity-ranking.txt
Normal file
@ -0,0 +1,47 @@
|
||||
|
||||
> total nbr. posts
|
||||
|
||||
from posts
|
||||
|
||||
geert{at}xs4all.nl 883
|
||||
patrice{at}xs4all.nl 710
|
||||
tbyfield{at}panix.com 444
|
||||
sondheim{at}panix.com 388
|
||||
morlockelloi{at}yahoo.com 260
|
||||
jya{at}pipeline.com 242
|
||||
bhcontinentaldrift{at}gmail.com 213
|
||||
bruces{at}well.com 199
|
||||
brian.holmes{at}wanadoo.fr 190
|
||||
jaromil{at}dyne.org 180
|
||||
|
||||
--
|
||||
|
||||
> total nbr. replies
|
||||
|
||||
from replies
|
||||
|
||||
geert{at}xs4all.nl 483
|
||||
patrice{at}xs4all.nl 306
|
||||
bhcontinentaldrift{at}gmail.com 223
|
||||
felix{at}openflows.com 170
|
||||
brian.holmes{at}wanadoo.fr 145
|
||||
jaromil{at}dyne.org 128
|
||||
tbyfield{at}panix.com 125
|
||||
jya{at}pipeline.com 108
|
||||
dk{at}telekommunisten.net 104
|
||||
newmedia{at}aol.c 102
|
||||
|
||||
------------
|
||||
|
||||
from nbr-references subject url
|
||||
date
|
||||
2015-04-01 07:35:14 nettime{at}kein.org 48 <nettime> nottime: the end of nettim https://nettime.org/Lists-Archives/nettime-l-1504/msg00001.html
|
||||
2014-05-11 15:57:28 geert{at}xs4all.nl 35 <nettime> tensions within the bay area elites https://nettime.org/Lists-Archives/nettime-l-1405/msg00018.html
|
||||
2011-05-13 06:52:45 nak44{at}cornell.edu 34 <nettime> ISEA 2011 fees https://nettime.org/Lists-Archives/nettime-l-1105/msg00055.html
|
||||
2003-10-01 06:36:04 sdela{at}ahk.nl 29 Re: <nettime> A Puff Piece on Wikipedia (Fwd) https://nettime.org/Lists-Archives/nettime-l-0310/msg00002.html
|
||||
2006-06-06 19:51:17 tobias{at}techno.ca 29 <nettime> report_on_NNA https://nettime.org/Lists-Archives/nettime-l-0606/msg00006.html
|
||||
2016-02-12 21:33:21 geert{at}xs4all.nl 27 <nettime> notes from the DIEM25 launch https://nettime.org/Lists-Archives/nettime-l-1602/msg00014.html
|
||||
2012-08-27 13:21:03 nettime{at}kein.org 26 <nettime> crowd-funding on nettim https://nettime.org/Lists-Archives/nettime-l-1208/msg00023.html
|
||||
2012-05-03 08:43:01 bhcontinentaldrift{at}gmail.com 25 <nettime> The insult of the 1 percent: "Art-history majors" https://nettime.org/Lists-Archives/nettime-l-1205/msg00004.html
|
||||
2007-11-06 09:17:29 davidg{at}xs4all.nl 23 <nettime> Goodbye Classic ? https://nettime.org/Lists-Archives/nettime-l-0711/msg00011.html
|
||||
2009-05-11 21:29:14 geert{at}xs4all.nl 23 <nettime> Political Work in the Aftermath of the New Media Arts\tCrisis https://nettime.org/Lists-Archives/nettime-l-0905/msg00038.html
|
||||
BIN
figures/activity-total-messages.png
Normal file
BIN
figures/activity-total-messages.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 82 KiB |
35
figures/index.html
Normal file
35
figures/index.html
Normal file
@ -0,0 +1,35 @@
|
||||
<html lang="en">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
|
||||
<link rel="stylesheet" type="text/css" href="../+++/style.css"/>
|
||||
<title>Nettime Survey</title>
|
||||
</head>
|
||||
<body>
|
||||
<div id="ffframe" align="center">
|
||||
<h1>Nettime Survey:</h1>
|
||||
<h2>A History of Debates within Critical Internet Studies</h2>
|
||||
<br>
|
||||
<text>
|
||||
<h3>Activity</h3>
|
||||
<div class="fff">
|
||||
<img src="activity-total-messages.png"/>
|
||||
</div>
|
||||
<h3>Vigour (replies within threads)</h3>
|
||||
<div class="fff">
|
||||
<img src="threads-replies-total.png"/>
|
||||
<img src="threads-avg-replies.png"/>
|
||||
<img src="threads-avg-replies-per-threads.png"/>
|
||||
</div>
|
||||
<h3>Outspokenness</h3>
|
||||
<div class="fff">
|
||||
<img src="activity-ranking-text.png" style="width: 25em;"/>
|
||||
<br><br>
|
||||
Nbr. messages per author (total)
|
||||
<img src="activity-ranking.png"/>
|
||||
<br><br><br>
|
||||
Nbr. replies per message (total)
|
||||
<img src="threads-ranking.png"/>
|
||||
</div>
|
||||
</text>
|
||||
</div>
|
||||
</body>
|
||||
BIN
figures/threads-avg-replies-per-threads.png
Normal file
BIN
figures/threads-avg-replies-per-threads.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 85 KiB |
BIN
figures/threads-avg-replies.png
Normal file
BIN
figures/threads-avg-replies.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 92 KiB |
|
Before Width: | Height: | Size: 373 KiB After Width: | Height: | Size: 373 KiB |
BIN
figures/threads-replies-total.png
Normal file
BIN
figures/threads-replies-total.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 96 KiB |
141
index.html
Normal file
141
index.html
Normal file
@ -0,0 +1,141 @@
|
||||
<html lang="en">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
|
||||
<link rel="stylesheet" type="text/css" href="+++/style.css"/>
|
||||
<title>Nettime Survey</title>
|
||||
</head>
|
||||
<body>
|
||||
<div id="ffframe" align="center">
|
||||
<a href="figures/index.html"><h1>Nettime Survey:</h1>
|
||||
<h2>A History of Debates within Critical Internet Studies</h2>
|
||||
<img src="figures/Nettime.org-logo.png" style="width: 25em;"/></a>
|
||||
<br>
|
||||
<text>
|
||||
|
||||
<a href="figures/index.html"> -- Survey -- </a>
|
||||
|
||||
<h2>Introduction</h2>
|
||||
|
||||
<p>
|
||||
This project aims to trace the evolution of debates with the field of critical Internet studies over the course of time through studying the Nettime mailing list.
|
||||
</p>
|
||||
|
||||
<h2>Summary</h2>
|
||||
|
||||
<p>
|
||||
While contemporary social media have been critiqued for their ephemeral effects on activist politics, the mailing list has proven an enduring venue for geographically dispersed communities to participate remain in dialogue over the course of decades. Founded in Amsterdam in 1995, the Nettime mailing list has played host to a community of activists and media artists and help to launch or establish the careers of a number of prominent new media theorists and Internet critics (including Geert Lovink, Lev Manovich, Matthew Fuller, Brian Holmes, Bruce Sterling, amongst others). Established in an era prior to the corporatization of the Web, over the course of its twenty years, Nettime has continued to discuss the Web in terms of the radical political possibilities with which it was imagined in its ‘salad days’.
|
||||
</p>
|
||||
|
||||
<h2>Research Questions</h2>
|
||||
|
||||
<p>
|
||||
<ul>
|
||||
<li>List activity: As a mailing list, Nettime is popularly associated with mid-90’s media activism, yet it continues to be active to this day.
|
||||
<ul><li>When was Nettime most active?</li></ul>
|
||||
</li>
|
||||
<li>List vigour: A list’s health may, perhaps, be seen as a function of the extent to which it is also a space for dialogue.
|
||||
<ul><li>When was Nettime at its most dialogical?</li></ul>
|
||||
</li>
|
||||
<li>Outspokenness: Mailing lists like Nettime appear to be dominated by strong personalities.
|
||||
<ul><li>Who have been Nettime’s most prolific contributors?</li>
|
||||
<li>and how might one begin to periodize the list in relation to those personalities?</li></ul>
|
||||
</li>
|
||||
</ul>
|
||||
</p>
|
||||
|
||||
<h2>Methodology</h2>
|
||||
|
||||
<p>
|
||||
The object of study is an archived mailing list, a web interface to which is available online <a href="https://nettime.org">nettime.org/archive.php</a>. The objective is to scrape all the data in order to query the database in relation to the research questions.
|
||||
</p>
|
||||
|
||||
<h4><i>Data Gathering</i></h4>
|
||||
|
||||
<ul>
|
||||
|
||||
<li>
|
||||
Tools are written in Python and can be found at <a href="https://github.com/gauthiier/nettime">https://github.com/gauthiier/nettime</a>
|
||||
</li>
|
||||
<li>
|
||||
Scripts to crawl and aggregate Nettime's <a href="https://nettime.org/archives.php">online archive (nettime-l)</a> using custom <a href="https://www.mhonarc.org">MHonArc</a> scrappers have been devised.
|
||||
</li>
|
||||
<li>
|
||||
An archive of all Nettime's emails in both custom json and legacy <a href="http://www.qmail.org/man/man5/mbox.html">mbox</a> formats has been produced.
|
||||
</li>
|
||||
|
||||
|
||||
</ul>
|
||||
|
||||
<h4><i>Visualization</i></h4>
|
||||
|
||||
<ul>
|
||||
<li>
|
||||
Consistent with the ‘90’s-era origins of the Nettime list, time series data analytics were graphed in a series of simple bar graph using Python's numpy, pandas and matplotlib packages.
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
<h2>Findings</h2>
|
||||
|
||||
<p>
|
||||
In consultation with Geert Lovink, one of the list’s founders -- and the most prolific poster, by far -- we discussed our data and identified a few unexpected patterns, namely:
|
||||
</p>
|
||||
|
||||
<ul>
|
||||
<li>
|
||||
that, when assessed in terms of the number of posts over time (list activity), that:
|
||||
<ul>
|
||||
<li>
|
||||
the list paradoxically grew in 2000 subsequent to its having become a moderated list -- a major controversy, famously chronicled by Lovink (‘03)
|
||||
</li>
|
||||
<li>
|
||||
that, as expected, the list activity diminished in 2004 -- which coincided with the birth of social media, and blogs
|
||||
</li>
|
||||
<li>
|
||||
that there was a spike in activity in 2011, that could be explained as corresponded with the global surge in activism in that same year
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
|
||||
<li>
|
||||
that, when assessed in terms of relative number of replies over time (list vigour), that:
|
||||
<ul>
|
||||
<li>
|
||||
Nettime has steadily become a more ‘dialogical space’
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
|
||||
<li>
|
||||
that, when assessed in terms of the most prolific contributors over time (outspokenness), that:
|
||||
<ul>
|
||||
<li>
|
||||
different figures can be seen to be dominated the years and that, presumably this might offer an entry-way into periodizing the ‘times of Nettime’
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
<h2>Further Research</h2>
|
||||
|
||||
<ul>
|
||||
<li>
|
||||
To our mind the content of the posts and conversations in Nettime is, in fact, what makes this list of particular interest from the perspective of new media studies. To this end, future work could analyse the content of the list, filtering twenty years of posts, in order, for example, to identify the most ‘controversial’. Another interesting question has to do with periodizing the ‘eras’ or ‘times of Nettime’, in terms of who were the dominant figures in different periods and how might they have clustered into cohorts.
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
<h2>Keywords</h2>
|
||||
|
||||
<p>media art history, mailing list analysis, media activism, mapping debate</p>
|
||||
|
||||
<h2>Team Members</h2>
|
||||
|
||||
<p>David Gauthier, Marc Tuters</p>
|
||||
|
||||
<h2>References</h2>
|
||||
|
||||
<p>Geert Lovink <em>Dark Fiber: Tracking Critical Internet Culture.</em> MIT Press: Cambridge: MIT Press, 2003.
|
||||
|
||||
</text>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@ -1,158 +0,0 @@
|
||||
import numpy as np
|
||||
import pandas as pd
|
||||
import email, email.parser
|
||||
import os, datetime, json, gzip, re
|
||||
from random import randint
|
||||
import query
|
||||
|
||||
def format_from(from_str):
|
||||
from_addr = email.utils.parseaddr(from_str)[1]
|
||||
if '{AT}' not in from_addr:
|
||||
tok = from_str.split()
|
||||
try:
|
||||
at = tok.index('{AT}')
|
||||
from_addr = ''.join(tok[at-1:at+2])
|
||||
if from_addr.startswith('<') or from_addr.endswith('>'):
|
||||
from_addr = from_addr.strip('<').strip('>')
|
||||
except ValueError:
|
||||
return None
|
||||
return from_addr.lower()
|
||||
|
||||
def format_date(date_str):
|
||||
try:
|
||||
date_tz = email.utils.parsedate_tz(date_str)
|
||||
time_tz = email.utils.mktime_tz(date_tz) #utc timestamp
|
||||
except TypeError:
|
||||
print "Format Date TypeError"
|
||||
print " > " + date_str
|
||||
return None
|
||||
except ValueError:
|
||||
print "Format Date ValueError"
|
||||
print " > " + date_str
|
||||
return None
|
||||
|
||||
dt = datetime.datetime.fromtimestamp(time_tz)
|
||||
|
||||
try:
|
||||
pdt = pd.to_datetime(dt)
|
||||
return pdt
|
||||
except pd.tslib.OutOfBoundsDatetime:
|
||||
print 'time out of bound'
|
||||
print dt
|
||||
return None
|
||||
|
||||
def message_to_tuple_record(msg, records, references=None):
|
||||
|
||||
# check date first?
|
||||
date_time = format_date(msg['date'])
|
||||
if not date_time:
|
||||
return
|
||||
|
||||
# filter date?
|
||||
nettime_min_date = pd.to_datetime('01/10/1995', format='%d/%m/%Y')
|
||||
nettime_max_date = pd.to_datetime(datetime.datetime.now())
|
||||
if date_time < nettime_min_date or date_time > nettime_max_date:
|
||||
return None
|
||||
|
||||
# check / filter from email address second?
|
||||
from_addr = format_from(msg['from'])
|
||||
if not from_addr:
|
||||
return
|
||||
|
||||
records.append((msg['message-id'],
|
||||
from_addr,
|
||||
msg['author_name'],
|
||||
msg['subject'],
|
||||
date_time,
|
||||
msg['url'],
|
||||
len(msg['content']),
|
||||
0 if not msg.has_key('follow-up') else len(msg['follow-up']),
|
||||
references))
|
||||
|
||||
if msg.has_key('follow-up'):
|
||||
for f in msg['follow-up']:
|
||||
message_to_tuple_record(f, records, references=msg['message-id'])
|
||||
|
||||
return
|
||||
|
||||
def json_data_to_pd_dataframe(json_data):
|
||||
|
||||
records = []
|
||||
for d in json_data:
|
||||
for dd in d['threads']:
|
||||
message_to_tuple_record(dd, records)
|
||||
|
||||
df = pd.DataFrame.from_records(records,
|
||||
index='date',
|
||||
columns=['message-id',
|
||||
'from',
|
||||
'author',
|
||||
'subject',
|
||||
'date',
|
||||
'url',
|
||||
'content-length',
|
||||
'nbr-references',
|
||||
'references'])
|
||||
|
||||
df.index.name = 'date'
|
||||
|
||||
return df
|
||||
|
||||
def load_from_file(filename, archive_dir, json_data=None):
|
||||
|
||||
if not filename.endswith('.json.gz'):
|
||||
file_path = os.path.join(archive_dir, filename + '.json.gz')
|
||||
else:
|
||||
file_path = os.path.join(archive_dir, filename)
|
||||
|
||||
if os.path.isfile(file_path):
|
||||
with gzip.open(file_path, 'r') as fp:
|
||||
json_data = json.load(fp)
|
||||
return json_data_to_pd_dataframe(json_data['threads'])
|
||||
else:
|
||||
#list of all "filename[...].json.gz" in archive_dir
|
||||
files = sorted([f for f in os.listdir(archive_dir) if os.path.isfile(os.path.join(archive_dir, f)) and f.startswith(filename) and f.endswith('.json.gz')])
|
||||
if files:
|
||||
filename = files[-1] # take the most recent (listed alpha-chronological)
|
||||
file_path = os.path.join(archive_dir, filename)
|
||||
if os.path.isfile(file_path):
|
||||
with gzip.open(file_path, 'r') as fp:
|
||||
json_data = json.load(fp)
|
||||
return json_data_to_pd_dataframe(json_data['threads'])
|
||||
else:
|
||||
#list of all json files in archive_dir/filename
|
||||
dir_path = os.path.join(archive_dir, filename)
|
||||
if not os.path.isdir(dir_path):
|
||||
return None
|
||||
|
||||
files = [os.path.join(dir_path, f) for f in os.listdir(dir_path) if os.path.isfile(os.path.join(dir_path, f)) and f.endswith('.json')]
|
||||
if not files:
|
||||
return None
|
||||
|
||||
# load all json files
|
||||
threads = []
|
||||
for file_path in files:
|
||||
with open(file_path, 'r') as fp:
|
||||
json_data = json.load(fp)
|
||||
threads.append(json_data)
|
||||
|
||||
return json_data_to_pd_dataframe(threads)
|
||||
|
||||
|
||||
class Archive:
|
||||
|
||||
data = None # "raw" json data
|
||||
dataframe = None # main pd dataframe
|
||||
|
||||
def __init__(self, data="nettime-l", archive_dir="archives"):
|
||||
|
||||
if isinstance(data, pd.core.frame.DataFrame):
|
||||
self.dataframe = data.copy()
|
||||
|
||||
if isinstance(data, str):
|
||||
self.dataframe = load_from_file(data, archive_dir, self.data)
|
||||
|
||||
def query(self):
|
||||
q = query.Query(self)
|
||||
return q
|
||||
|
||||
@ -1,26 +0,0 @@
|
||||
import urllib2, urllib, urlparse
|
||||
import os, re, json, gzip
|
||||
import mhonarccrawl
|
||||
import datetime
|
||||
|
||||
def archive_from_url(url, sublist_name="nettime-l", archive_dir="archives"):
|
||||
url = url.rstrip()
|
||||
archive_list_dir = check_dir(archive_dir, sublist_name)
|
||||
|
||||
archive_name = sublist_name.lower()
|
||||
archive_date = datetime.datetime.strftime(datetime.datetime.now(), '%Y-%m-%d')
|
||||
archive = {'name' : sublist_name.lower(), 'url': url, 'date': archive_date, 'threads' : []}
|
||||
|
||||
archive['threads'] = mhonarccrawl.collect_from_url(url, sublist_name, archive_list_dir, mbox=True)
|
||||
|
||||
file_path = os.path.join(archive_dir, archive_name + "_" + archive_date + ".json.gz")
|
||||
with gzip.open(file_path, 'w') as fp:
|
||||
json.dump(archive, fp, indent=4)
|
||||
|
||||
return
|
||||
|
||||
def check_dir(base_dir, list_name):
|
||||
arc_dir = os.path.join(base_dir, list_name)
|
||||
if not os.path.exists(arc_dir):
|
||||
os.makedirs(arc_dir)
|
||||
return arc_dir
|
||||
@ -1,128 +0,0 @@
|
||||
import query
|
||||
import logging, html, numpy
|
||||
from tabulate import tabulate
|
||||
|
||||
class Html:
|
||||
|
||||
query = None
|
||||
|
||||
def __init__(self, q=None):
|
||||
|
||||
if not isinstance(q, query.Query):
|
||||
logging.error("HtmlFormat constructor Error: query must be of type nettime.query.Query")
|
||||
raise Exception()
|
||||
|
||||
self.query = q
|
||||
|
||||
def threads_ranking(self, rank=5, resolution=None):
|
||||
|
||||
data = self.query.threads_ranking(rank=rank)
|
||||
|
||||
print data
|
||||
|
||||
h = html.HTML()
|
||||
t = h.table()
|
||||
|
||||
r = t.tr
|
||||
r.td('date', klass='td_date_t')
|
||||
r.td('from', klass='td_from_t')
|
||||
r.td('replies', klass='td_rep_t')
|
||||
r.td('subject', klass='td_subject_t')
|
||||
|
||||
for i, row in data.iterrows():
|
||||
r = t.tr
|
||||
|
||||
print row.index
|
||||
|
||||
r.td(str(row['date']), klass='td_date')
|
||||
r.td(row['from'], klass='td_from')
|
||||
r.td(str(row['nbr-references']), klass='td_rep')
|
||||
r.td('', klass='td_subject').text(str(h.a(row['subject'], href=row['url'])), escape=False)
|
||||
|
||||
return str(t)
|
||||
|
||||
@staticmethod
|
||||
def from_dataframe(data_frame, table_name=None, name_map={}, url_map={}):
|
||||
|
||||
header = []
|
||||
if data_frame.index.name in name_map:
|
||||
header.append(name_map[data_frame.index.name])
|
||||
else:
|
||||
header.append(data_frame.index.name)
|
||||
for h in data_frame.columns:
|
||||
if h in name_map:
|
||||
h = name_map[h]
|
||||
header.append(h)
|
||||
|
||||
css_header = []
|
||||
css_element = []
|
||||
for i in header:
|
||||
css_header.append('td_' + i + '_t')
|
||||
css_element.append('td_' + i)
|
||||
|
||||
h = html.HTML()
|
||||
if table_name:
|
||||
t = h.table(id=table_name, klass=table_name + '_t')
|
||||
else:
|
||||
t = h.table()
|
||||
|
||||
# url map
|
||||
url_hash = {}
|
||||
url_skip = []
|
||||
url_keys = url_map.keys()
|
||||
for u in url_keys:
|
||||
if u in header and url_map[u] in header:
|
||||
url_indx = header.index(url_map[u])
|
||||
url_hash[header.index(u)] = url_indx
|
||||
url_skip.append(url_indx)
|
||||
header.pop(url_indx)
|
||||
|
||||
#header
|
||||
r = t.tr
|
||||
n = 0
|
||||
for j in header:
|
||||
r.td(str(j), klass=css_header[n])
|
||||
n += 1
|
||||
|
||||
|
||||
#elements
|
||||
for k, row in data_frame.iterrows():
|
||||
r = t.tr
|
||||
r.td(str(k), klass=css_element[0])
|
||||
n = 1
|
||||
for l in row:
|
||||
|
||||
if n in url_skip:
|
||||
continue
|
||||
|
||||
if isinstance(l, float):
|
||||
if l % 1 > 0:
|
||||
l = '{0:.4f}'.format(l)
|
||||
else:
|
||||
l = int(l)
|
||||
|
||||
if n in url_hash.keys():
|
||||
url = row[url_hash[n] - 1]
|
||||
r.td('', klass=css_element[n]).text(str(h.a(str(l), href=url)), escape=False)
|
||||
|
||||
else:
|
||||
r.td(str(l), klass=css_element[n])
|
||||
n += 1
|
||||
|
||||
return str(t)
|
||||
|
||||
class Tab:
|
||||
|
||||
@staticmethod
|
||||
def from_dataframe(data_frame, name_map={}, format=".0f"):
|
||||
|
||||
header = []
|
||||
header.append(data_frame.index.name)
|
||||
for h in data_frame.columns:
|
||||
if h in name_map:
|
||||
h = name_map[h]
|
||||
header.append(h)
|
||||
|
||||
return tabulate(data_frame, headers=header, floatfmt=format)
|
||||
|
||||
|
||||
@ -1,250 +0,0 @@
|
||||
import urllib2, urllib, urlparse
|
||||
import logging
|
||||
from bs4 import BeautifulSoup
|
||||
import email, email.parser
|
||||
from email.mime.text import MIMEText
|
||||
import mailbox
|
||||
import time, dateutil, string
|
||||
from pprint import pprint as pp
|
||||
import sys, os, re, json, gzip
|
||||
import traceback
|
||||
|
||||
DELAY = 0.2
|
||||
|
||||
# hack for the mailbox module (re: force mbox.add() encoding to utf8)
|
||||
reload(sys)
|
||||
sys.setdefaultencoding('utf8')
|
||||
|
||||
|
||||
def collect_from_url(url, sublist_name, base_arch_dir="archives", mbox=False):
|
||||
|
||||
response = urllib2.urlopen(url)
|
||||
html = response.read()
|
||||
soup = BeautifulSoup(html, "html.parser")
|
||||
|
||||
# base url
|
||||
base_url = soup.select('body p:nth-of-type(2) base')[0].get('href')
|
||||
|
||||
#collect name
|
||||
list_name = soup.select('body p:nth-of-type(2) base title')[0].string
|
||||
logging.info("Getting " + list_name + " list archive for " + sublist_name)
|
||||
|
||||
lists = soup.select('ul:nth-of-type(2) li')
|
||||
|
||||
threads = []
|
||||
|
||||
for l in lists:
|
||||
|
||||
if l.strong is None:
|
||||
continue
|
||||
|
||||
name = l.strong.string
|
||||
|
||||
if name.lower() == sublist_name.lower():
|
||||
|
||||
threads_url_list = []
|
||||
threads_links = l.select('ul li a')
|
||||
for t in threads_links:
|
||||
thread_url = urlparse.urljoin(base_url, t.get('href'))
|
||||
threads_url_list.append(thread_url)
|
||||
|
||||
nbr_threads = str(len(threads_url_list))
|
||||
n = 0
|
||||
|
||||
for u in threads_url_list:
|
||||
n += 1
|
||||
logging.info("## " + str(n) + " / " + nbr_threads + " ##")
|
||||
threads.append(collect_threads_from_url(u, base_arch_dir, mbox))
|
||||
|
||||
return threads
|
||||
|
||||
# for u in threads_url_list[0:10]:
|
||||
# print "---------------------------------------"
|
||||
# tt = collect_threads_from_url(u, base_arch_dir, mbox)
|
||||
# threads.append(tt)
|
||||
|
||||
|
||||
return None
|
||||
|
||||
def collect_threads_from_url(url, base_arch_dir, mbox):
|
||||
|
||||
response = urllib2.urlopen(url)
|
||||
html = response.read()
|
||||
soup = BeautifulSoup(html, "html.parser")
|
||||
|
||||
# base url
|
||||
base_url = url
|
||||
|
||||
# collect name
|
||||
threads_name = soup.select('p:nth-of-type(1) title')[0].string
|
||||
threads_name = threads_name.replace(' ', '_')
|
||||
|
||||
# thread data struct
|
||||
threads = {'name' : threads_name, 'url' : base_url, 'threads' : []}
|
||||
|
||||
logging.info("Collecting Threads of: " + threads_name)
|
||||
|
||||
# check if archive already exists
|
||||
file_path = os.path.join(base_arch_dir, threads['name'] + ".json")
|
||||
if os.path.isfile(file_path):
|
||||
logging.info("archive already exists. loading from file " + file_path)
|
||||
with open(file_path, 'r') as fpin:
|
||||
threads = json.load(fpin)
|
||||
else:
|
||||
lists = soup.select('ul:nth-of-type(1) > li')
|
||||
|
||||
nbr_threads = str(len(lists))
|
||||
n = 0
|
||||
|
||||
for l in lists:
|
||||
n += 1
|
||||
logging.info("> " + str(n) + " / " + nbr_threads)
|
||||
|
||||
try:
|
||||
thread = archive_thread(l, base_url, None)
|
||||
threads['threads'].append(thread)
|
||||
except:
|
||||
ex_type, ex, tb = sys.exc_info()
|
||||
print ex_type
|
||||
print ex
|
||||
traceback.print_tb(tb)
|
||||
del tb
|
||||
continue
|
||||
|
||||
time.sleep(DELAY)
|
||||
|
||||
# write
|
||||
logging.info("writing archive to file " + file_path)
|
||||
|
||||
with open(file_path, 'w') as fp:
|
||||
json.dump(threads, fp, indent=4)
|
||||
|
||||
if mbox:
|
||||
mbox_path = os.path.join(base_arch_dir, threads['name'] + ".txt")
|
||||
mbox_path_gz = mbox_path + ".gz"
|
||||
logging.info("writing mbox " + mbox_path)
|
||||
if not os.path.isfile(mbox_path):
|
||||
box = mailbox.mbox(mbox_path)
|
||||
box.lock()
|
||||
try:
|
||||
for t in threads['threads']:
|
||||
write_mbox_message(t, box)
|
||||
box.flush()
|
||||
except:
|
||||
ex_type, ex, tb = sys.exc_info()
|
||||
print ex_type
|
||||
print ex
|
||||
traceback.print_tb(tb)
|
||||
del tb
|
||||
finally:
|
||||
box.unlock()
|
||||
|
||||
with open(mbox_path) as fpin, gzip.open(mbox_path + '.gz', 'wb') as fpout:
|
||||
fpout.writelines(fpin)
|
||||
|
||||
else:
|
||||
logging.info("mbox " + mbox_path + " already exists.")
|
||||
|
||||
logging.info("done. ")
|
||||
|
||||
return threads
|
||||
|
||||
|
||||
|
||||
def archive_thread(li, base_url, parent_thread_data):
|
||||
|
||||
thread_link = li.select('strong a')[0]
|
||||
thread_url = urlparse.urljoin(base_url, thread_link.get('href'))
|
||||
thread_id = thread_link.get('name')
|
||||
thread_title = thread_link.string
|
||||
thread_author_name = li.select('em')[0].string
|
||||
|
||||
message = {u'id': thread_id, u'subject': thread_title, u'url': thread_url, u'author_name': thread_author_name}
|
||||
|
||||
collect_message(thread_url, message)
|
||||
|
||||
follow = li.select('ul > li')
|
||||
if len(follow) > 0:
|
||||
for f in follow:
|
||||
follow_link = f.select('strong a')
|
||||
if len (follow_link) > 0:
|
||||
archive_thread(f, base_url, message) ## recursion
|
||||
|
||||
if parent_thread_data is None:
|
||||
return message
|
||||
|
||||
if u'follow-up' not in parent_thread_data:
|
||||
parent_thread_data[u'follow-up'] = []
|
||||
|
||||
parent_thread_data[u'follow-up'].append(message)
|
||||
|
||||
return message
|
||||
|
||||
|
||||
def collect_message(url, message):
|
||||
|
||||
print url
|
||||
|
||||
response = urllib2.urlopen(url)
|
||||
html = response.read()
|
||||
soup = BeautifulSoup(html, "html.parser")
|
||||
|
||||
#note: this should follow an RFC header standard -- MHonArc has header info in the 1th <pre>
|
||||
|
||||
message_labels = ('to', 'subject', 'from', 'date', 'message-id', 'content-type')
|
||||
|
||||
# mhonarc xcomments
|
||||
# ref: http://www.schlaubert.de/MHonArc/doc/resources/printxcomments.html
|
||||
message['subject'] = parse_xcomment(soup, "X-Subject")
|
||||
message['date'] = parse_xcomment(soup, "X-Date")
|
||||
message['from'] = parse_xcomment(soup, "X-From-R13") #useless...
|
||||
message['message-id'] = parse_xcomment(soup, 'X-Message-Id')
|
||||
message['content-type'] = parse_xcomment(soup, 'X-Content-Type')
|
||||
|
||||
# parse what is displayed on the page
|
||||
|
||||
info = soup.select('ul:nth-of-type(1) > li')
|
||||
|
||||
for i in info:
|
||||
if i.em == None:
|
||||
continue
|
||||
field = i.em.string
|
||||
if field.lower() in message_labels:
|
||||
message[field.lower()] = i.text.strip(field + ": ")
|
||||
|
||||
## reformat from -- [author_name, email_addr]
|
||||
|
||||
# from_addr = email.utils.parseaddr(message['from'])
|
||||
# message['author_name'] = from_addr[0]
|
||||
# message['from'] = from_addr[1]
|
||||
|
||||
## -- content --
|
||||
message['content'] = soup.select('pre:nth-of-type(2)')[0].text
|
||||
|
||||
# mhonarc xcomments
|
||||
# ref: http://www.schlaubert.de/MHonArc/doc/resources/printxcomments.html
|
||||
def parse_xcomment(soup, xcom):
|
||||
com = soup.find(text=re.compile(xcom))
|
||||
if com is not None:
|
||||
return com.strip('<!-- ').strip(' -->').strip(xcom + ":").strip()
|
||||
return com
|
||||
|
||||
def to_mbox_message(msg):
|
||||
mime = MIMEText('', 'plain', _charset='utf8')
|
||||
mime['From'] = msg['from']
|
||||
mime['Subject'] = msg['subject']
|
||||
mime['Message-Id'] = msg['message-id']
|
||||
mime['Date'] = msg['date']
|
||||
mime.set_payload(msg['content'], charset='utf8')
|
||||
mbox_message = mailbox.mboxMessage(mime)
|
||||
mbox_message.set_from(mime['From'], email.utils.parsedate(mime['Date']))
|
||||
return mbox_message
|
||||
|
||||
# throws exception
|
||||
def write_mbox_message(msg, mbox):
|
||||
mbox_msg = to_mbox_message(msg)
|
||||
mbox.add(mbox_msg) # here
|
||||
if u'follow-up' in msg:
|
||||
for f in msg['follow-up']:
|
||||
write_mbox_message(f, mbox)
|
||||
|
||||
@ -1,74 +0,0 @@
|
||||
import numpy as np
|
||||
import pandas as pd
|
||||
import query
|
||||
|
||||
# for colormaps see:
|
||||
# http://scipy.github.io/old-wiki/pages/Cookbook/Matplotlib/Show_colormaps
|
||||
# http://pandas.pydata.org/pandas-docs/stable/visualization.html#colormaps
|
||||
# http://matplotlib.org/examples/color/colormaps_reference.html
|
||||
# for colors see:
|
||||
# http://matplotlib.org/examples/color/named_colors.html
|
||||
|
||||
def bar_plot_series(series, title, color='blueviolet', ylim=None):
|
||||
return series.plot(kind = 'bar', title=title, color=color, alpha=0.8, stacked=True, ylim=ylim)
|
||||
|
||||
def save(plot, name):
|
||||
fig = plot.get_figure()
|
||||
fig.savefig(name)
|
||||
|
||||
class Plot:
|
||||
|
||||
query = None
|
||||
|
||||
def __init__(self, q=None):
|
||||
|
||||
if not isinstance(q, query.Query):
|
||||
logging.error("HtmlFormat constructor Error: query must be of type nettime.query.Query")
|
||||
raise Exception()
|
||||
|
||||
self.query = q
|
||||
|
||||
'''
|
||||
activity
|
||||
'''
|
||||
|
||||
def activity_from_ranking(self, resolution='y', rank=5, colormap='spectral', figsize=(8, 7)):
|
||||
|
||||
activity_rank = self.query.activity_from_ranking(rank=rank, series=True).keys()
|
||||
series = []
|
||||
for k in activity_rank:
|
||||
series.append(self.query.activity_from(k, resolution, series=True))
|
||||
|
||||
df = pd.concat(series, axis=1)
|
||||
|
||||
return df.plot.area(colormap='spectral', figsize=figsize, stacked=False)
|
||||
|
||||
'''
|
||||
content lenght
|
||||
'''
|
||||
|
||||
def content_length_from_ranking(self, resolution='y', rank=5, colormap='spectral', figsize=(8, 7)):
|
||||
|
||||
content_rank = self.query.content_length_from_ranking(rank=rank, series=True).keys()
|
||||
series = []
|
||||
for k in content_rank:
|
||||
series.append(self.query.content_length_from(k, resolution, series=True))
|
||||
|
||||
df = pd.concat(series, axis=1)
|
||||
|
||||
return df.plot.area(colormap=colormap, figsize=figsize, stacked=False)
|
||||
|
||||
'''
|
||||
threads
|
||||
'''
|
||||
|
||||
def threads_from_ranking(self, resolution='y', rank=5, colormap='spectral', figsize=(8, 7)):
|
||||
|
||||
threads_rank = self.query.threads_from_ranking(rank=rank, series=True).keys()
|
||||
series = []
|
||||
for k in threads_rank:
|
||||
series.append(self.query.threads_from(k, resolution, series=True))
|
||||
|
||||
df = pd.concat(series, axis=1)
|
||||
|
||||
return df.plot.area(colormap=colormap, figsize=figsize, stacked=False)
|
||||
470
nettime/query.py
470
nettime/query.py
@ -1,470 +0,0 @@
|
||||
import numpy as np
|
||||
import pandas as pd
|
||||
import archive
|
||||
import logging
|
||||
|
||||
class Query:
|
||||
|
||||
netarchive = None # nettime.archive.Archive object
|
||||
activity = None # (very) sparse dataframe (index=date(month), columns=from, values=activity(month))
|
||||
content_length = None # (very) sparse dataframe (index=date(month), columns=from, values=content-length(month in bytes))
|
||||
threads = None # ...
|
||||
replies = None # ...
|
||||
|
||||
def __init__(self, arch=None):
|
||||
|
||||
if not isinstance(arch, archive.Archive):
|
||||
logging.error("Query constructor Error: arch must be of type nettime.archive.Archive")
|
||||
raise Exception()
|
||||
|
||||
self.netarchive = arch
|
||||
|
||||
'''
|
||||
activity
|
||||
'''
|
||||
|
||||
def _activity(self):
|
||||
|
||||
if self.activity is None:
|
||||
from_index = self.netarchive.dataframe.reindex(columns=['from'])
|
||||
self.activity = from_index.groupby([pd.TimeGrouper(freq='M'), 'from']).size().unstack('from').fillna(0)
|
||||
|
||||
return self.activity
|
||||
|
||||
def activity_from(self, email_address, resolution='y', series=False):
|
||||
|
||||
eaddr = email_address.replace('@', '{at}').lower()
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._activity()
|
||||
try:
|
||||
af = self.activity[eaddr]
|
||||
except KeyError:
|
||||
return None
|
||||
|
||||
activity_from = af.groupby([pd.TimeGrouper(freq=freq)]).sum()
|
||||
|
||||
if freq == 'AS':
|
||||
activity_from.index = activity_from.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
activity_from.index.name = 'year'
|
||||
else:
|
||||
activity_from.index = activity_from.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
activity_from.index.name = 'year-month'
|
||||
|
||||
if series:
|
||||
return activity_from
|
||||
|
||||
return activity_from.to_frame('nbr-messages').astype(int)
|
||||
|
||||
def activity_from_ranking(self, rank=5, filter_nettime=True, series=False):
|
||||
|
||||
self._activity()
|
||||
afr = self.activity.sum(axis=0).order(ascending=False)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
afr = afr[afr.index.str.contains(p)]
|
||||
|
||||
if series:
|
||||
return afr[:rank]
|
||||
|
||||
return afr[:rank].to_frame('nbr-messages').astype(int)
|
||||
|
||||
|
||||
def activity_overall(self, resolution='y', series=False):
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._activity()
|
||||
|
||||
y = self.activity.sum(axis=1)
|
||||
y = y.groupby([pd.TimeGrouper(freq=freq)]).sum()
|
||||
|
||||
if freq == 'AS':
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
y.index.name = 'year'
|
||||
else:
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
y.index.name = 'year-month'
|
||||
|
||||
if series:
|
||||
return y
|
||||
|
||||
return y.to_frame('nbr-messages').astype(int)
|
||||
|
||||
def cohort(self, resolution='m', series=False):
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._activity()
|
||||
|
||||
c = self.activity.idxmax().order().to_frame('date')
|
||||
c.index = c['date']
|
||||
|
||||
cohort = c.groupby([pd.TimeGrouper(freq=freq)]).size()
|
||||
|
||||
if freq == 'AS':
|
||||
cohort.index = cohort.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
cohort.index.name = 'year'
|
||||
else:
|
||||
cohort.index = cohort.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
cohort.index.name = 'year-month'
|
||||
|
||||
if series:
|
||||
return cohort
|
||||
|
||||
return cohort.to_frame('first-messages').astype(int)
|
||||
|
||||
'''
|
||||
content lenght
|
||||
'''
|
||||
|
||||
def _content_length(self):
|
||||
|
||||
if self.content_length is None:
|
||||
from_content_index = self.netarchive.dataframe.reindex(columns=['from', 'content-length'])
|
||||
self.content_length = from_content_index.groupby([pd.TimeGrouper(freq='M'), 'from']).sum()
|
||||
self.content_length = self.content_length.reset_index().pivot(columns='from', index='date', values='content-length').fillna(0)
|
||||
|
||||
return self.content_length
|
||||
|
||||
def content_length_from(self, email_address, resolution='y', series=False):
|
||||
|
||||
eaddr = email_address.replace('@', '{at}').lower()
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._content_length()
|
||||
try:
|
||||
af = self.content_length[eaddr]
|
||||
except KeyError:
|
||||
return None
|
||||
|
||||
content_length_from = af.groupby([pd.TimeGrouper(freq=freq)]).sum()
|
||||
|
||||
if freq == 'AS':
|
||||
content_length_from.index = content_length_from.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
content_length_from.index.name = 'year'
|
||||
else:
|
||||
content_length_from.index = content_length_from.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
content_length_from.index.name = 'year-month'
|
||||
|
||||
if series:
|
||||
return content_length_from
|
||||
|
||||
return content_length_from.to_frame('nbr-bytes').astype(int)
|
||||
|
||||
def content_length_from_ranking(self, resolution='y', rank=5, filter_nettime=True, series=False):
|
||||
|
||||
self._content_length()
|
||||
cfr = self.content_length.sum(axis=0).order(ascending=False)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
cfr = cfr[cfr.index.str.contains(p)]
|
||||
|
||||
if series:
|
||||
return cfr[:rank]
|
||||
|
||||
return cfr[:rank].to_frame('nbr-bytes').astype(int)
|
||||
|
||||
def content_length_overall(self, resolution='y', series=False):
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._content_length()
|
||||
|
||||
y = self.content_length.sum(axis=1)
|
||||
y = y.groupby([pd.TimeGrouper(freq=freq)]).sum()
|
||||
|
||||
if freq == 'AS':
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
y.index.name = 'year'
|
||||
else:
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
y.index.name = 'year-month'
|
||||
|
||||
if series:
|
||||
return y
|
||||
|
||||
return y.to_frame('nbr-bytes').astype(int)
|
||||
|
||||
|
||||
'''
|
||||
threads
|
||||
'''
|
||||
|
||||
def _threads(self, thresh=0):
|
||||
|
||||
if self.threads is None:
|
||||
self.threads = self.netarchive.dataframe[self.netarchive.dataframe['nbr-references'] > thresh].reindex(columns=['from','nbr-references','subject', 'url', 'message-id']).sort_values('nbr-references', ascending=False)
|
||||
return self.threads;
|
||||
|
||||
def threads_ranking(self, rank=5, resolution=None):
|
||||
|
||||
self._threads()
|
||||
|
||||
if resolution == None:
|
||||
data = self.threads.drop('message-id', axis=1)[:rank]
|
||||
return data.reindex_axis(['subject', 'from', 'nbr-references', 'url'], axis=1)
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
# get the threads ranking per time resolution
|
||||
#
|
||||
data = self.threads.drop('message-id', axis=1)
|
||||
data = data.groupby([pd.TimeGrouper(freq=freq)])
|
||||
r = {}
|
||||
for k, v in data:
|
||||
if freq == 'AS':
|
||||
time_key = k.strftime('%Y')
|
||||
else:
|
||||
time_key = k.strftime('%Y-%m')
|
||||
frame = v[:rank]
|
||||
frame = frame.reindex_axis(['subject', 'from', 'nbr-references', 'url'], axis=1)
|
||||
r[time_key] = frame
|
||||
return r
|
||||
|
||||
|
||||
def threads_replies_to(self, email_address, resolution='y', series=False):
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
self._threads()
|
||||
|
||||
eaddr = email_address.replace('@', '{at}').lower()
|
||||
|
||||
self._threads()
|
||||
threads_from = self.threads.reindex(columns=['from', 'nbr-references'])
|
||||
threads_from_ranking = threads_from.groupby([pd.TimeGrouper(freq=freq), 'from']).sum() # <-- sum = adding up nbr references
|
||||
threads_from_ranking = threads_from_ranking.reset_index().pivot(columns='from', index='date', values='nbr-references').fillna(0)
|
||||
|
||||
if series:
|
||||
return threads_from_ranking[eaddr]
|
||||
|
||||
threads_from_ranking = threads_from_ranking[eaddr].to_frame('nbr-threads').astype(int)
|
||||
|
||||
if freq == 'AS':
|
||||
threads_from_ranking.index = threads_from_ranking.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
threads_from_ranking.index.name = 'year'
|
||||
else:
|
||||
threads_from_ranking.index = threads_from_ranking.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
threads_from_ranking.index.name = 'year-month'
|
||||
|
||||
return threads_from_ranking
|
||||
|
||||
def threads_replies_to_ranking(self, rank=5, filter_nettime=True):
|
||||
|
||||
self._threads()
|
||||
|
||||
tfr = self.threads.reindex(columns=['from', 'nbr-references']).groupby('from').sum().sort_values('nbr-references', ascending=False)
|
||||
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
tfr = tfr[tfr.index.str.contains(p)]
|
||||
|
||||
tfr = tfr[:rank].astype(int)
|
||||
return tfr
|
||||
|
||||
def threads_initiated_from_ranking(self, rank=5, filter_nettime=True, series=False):
|
||||
|
||||
self._threads()
|
||||
tir = self.threads.reindex(columns=['from']).groupby('from').size().sort_values(ascending=False)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
tir = tir[tir.index.str.contains(p)]
|
||||
|
||||
if series:
|
||||
return tir[:rank]
|
||||
|
||||
return tir[:rank].to_frame('nbr-initiated-threads').astype(int)
|
||||
|
||||
def threads_activity_threads_initiated_avg_ranking(self, rank=5, filter_nettime=True):
|
||||
|
||||
# activity
|
||||
self._activity()
|
||||
afr = self.activity.sum(axis=0).astype(int)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
afr = afr[afr.index.str.contains(p)]
|
||||
|
||||
# initiated threads [top 25]
|
||||
self._threads()
|
||||
tir = self.threads.reindex(columns=['from']).groupby('from').size().sort_values(ascending=False)[:25] # <-- top 25
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
tir = tir[tir.index.str.contains(p)]
|
||||
|
||||
inter = afr.index.intersection(tir.index)
|
||||
avg = tir[inter] / afr[inter]
|
||||
|
||||
labels = ['messages', 'threads', 'avg.threads']
|
||||
return pd.concat([afr[avg.index], tir[avg.index], avg], axis=1, keys=labels).sort_values('avg.threads', ascending=False)[:rank]
|
||||
|
||||
def threads_initiated_replies_avg_ranking(self, rank=5, filter_nettime=True):
|
||||
|
||||
self._threads()
|
||||
|
||||
#initiated
|
||||
tir = self.threads.reindex(columns=['from']).groupby('from').size().sort_values(ascending=False)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
tir = tir[tir.index.str.contains(p)]
|
||||
|
||||
#replies [top 25]
|
||||
tfr = self.threads.reindex(columns=['from', 'nbr-references']).groupby('from').sum().sort_values('nbr-references', ascending=False)[:25] # <-- top 25
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
tfr = tfr[tfr.index.str.contains(p)]
|
||||
tfr = tfr['nbr-references'] # dataframe to series
|
||||
|
||||
|
||||
inter = tir.index.intersection(tfr.index)
|
||||
avg = tfr[inter] / tir[inter]
|
||||
|
||||
labels = ['threads', 'replies', 'avg.replies']
|
||||
return pd.concat([tir[avg.index], tfr[avg.index], avg], axis=1, keys=labels).sort_values('avg.replies', ascending=False)[:rank]
|
||||
|
||||
|
||||
def threads_overall(self, resolution='y', aggregate='sum', tresh=0):
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
agg = aggregate.lower()
|
||||
if not agg in ['sum', 'mean', 'count']:
|
||||
return None
|
||||
|
||||
if not self.threads is None:
|
||||
del self.threads
|
||||
self.threads = None
|
||||
|
||||
self._threads(tresh)
|
||||
|
||||
if agg == 'sum':
|
||||
# number of replies total (re: sum all the replies)
|
||||
y = self.threads.groupby([pd.TimeGrouper(freq=freq)]).sum()
|
||||
elif agg == 'mean':
|
||||
y = self.threads.groupby([pd.TimeGrouper(freq=freq)]).mean()
|
||||
else:
|
||||
# number of threads (re: msgs with at least one reply)
|
||||
y = self.threads['nbr-references'].groupby([pd.TimeGrouper(freq=freq)]).count()
|
||||
y = y.to_frame('nbr-threads')
|
||||
|
||||
if freq == 'AS':
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y'))
|
||||
y.index.name = 'year'
|
||||
else:
|
||||
y.index = y.index.format(formatter=lambda x: x.strftime('%Y-%m'))
|
||||
y.index.name = 'year-month'
|
||||
|
||||
return y
|
||||
|
||||
|
||||
'''
|
||||
replies
|
||||
'''
|
||||
|
||||
def _replies(self):
|
||||
|
||||
if self.replies is None:
|
||||
self.replies = self.netarchive.dataframe[self.netarchive.dataframe['references'] > 0].reindex(columns=['from','references'])
|
||||
return self.replies;
|
||||
|
||||
def replies_ranking(self, rank=5, resolution=None):
|
||||
|
||||
self._replies()
|
||||
|
||||
if resolution == None:
|
||||
data = self.replies.groupby('from').size().sort_values(ascending=False)[:rank]
|
||||
return data.to_frame('nbr_replies')
|
||||
|
||||
freq = 'M'
|
||||
if resolution.lower() == 'y':
|
||||
freq = 'AS'
|
||||
elif resolution.lower() == 'm':
|
||||
freq = 'M'
|
||||
else:
|
||||
return None
|
||||
|
||||
# get the threads ranking per time resolution
|
||||
#
|
||||
data = self.replies.groupby([pd.TimeGrouper(freq=freq)])
|
||||
r = {}
|
||||
for k, v in data:
|
||||
if freq == 'AS':
|
||||
time_key = k.strftime('%Y')
|
||||
else:
|
||||
time_key = k.strftime('%Y-%m')
|
||||
frame = v.groupby('from').size().sort_values(ascending=False)[:rank]
|
||||
r[time_key] = frame.to_frame('nbr-replies')
|
||||
return r
|
||||
|
||||
def replies_avg_ranking(self, rank=5, filter_nettime=True):
|
||||
|
||||
# activity
|
||||
self._activity()
|
||||
afr = self.activity.sum(axis=0)
|
||||
if filter_nettime:
|
||||
p = r'^((?!nettime*).)*$'
|
||||
afr = afr[afr.index.str.contains(p)]
|
||||
|
||||
# replies in thread [top 25]
|
||||
|
||||
self._replies()
|
||||
rpl = data = self.replies.groupby('from').size().sort_values(ascending=False)[:25]
|
||||
|
||||
inter = afr.index.intersection(rpl.index)
|
||||
avg = rpl[inter] / afr[inter]
|
||||
|
||||
labels = ['messages', 'replies', 'avg.replies']
|
||||
return pd.concat([afr[avg.index], rpl[avg.index], avg], axis=1, keys=labels).sort_values('avg.replies', ascending=False)[:rank]
|
||||
|
||||
|
||||
|
||||
@ -1,267 +0,0 @@
|
||||
import query
|
||||
import format
|
||||
import plot
|
||||
|
||||
class Report:
|
||||
|
||||
query = None
|
||||
matrix = None
|
||||
|
||||
def __init__(self, q=None):
|
||||
|
||||
if not isinstance(q, query.Query):
|
||||
logging.error("HtmlFormat constructor Error: query must be of type nettime.query.Query")
|
||||
raise Exception()
|
||||
|
||||
self.query = q
|
||||
|
||||
'''
|
||||
(basic) stats
|
||||
'''
|
||||
|
||||
def matrix_msgs_threads(self):
|
||||
|
||||
if self.matrix is None:
|
||||
|
||||
# nbr messages
|
||||
mat = self.query.activity_overall()
|
||||
|
||||
# nbr threads
|
||||
mat['nbr-threads'] = self.query.threads_overall(aggregate='count')['nbr-threads'].astype(int)
|
||||
|
||||
# nbr replies
|
||||
mat['nbr-replies'] = self.query.threads_overall(aggregate='sum')['nbr-references'].astype(int)
|
||||
|
||||
# nbr non-replies (aka. non-threads)
|
||||
mat['nbr-single-messages'] = mat['nbr-messages'].astype(int) - mat['nbr-replies'] - mat['nbr-threads']
|
||||
|
||||
# avg. threads per message
|
||||
mat['avg-thrd-per-msg'] = mat['nbr-threads'] / mat['nbr-messages']
|
||||
|
||||
# avg. replies per message
|
||||
mat['avg-rep-per-msg'] = mat['nbr-replies'] / mat['nbr-messages']
|
||||
|
||||
# avg. threadss + replies per message
|
||||
mat['avg-thrd-rep-per-msg'] = (mat['nbr-threads'] + mat['nbr-replies']) / mat['nbr-messages']
|
||||
|
||||
# avg. threadss + replies per message
|
||||
mat['diff-thrd-rep-vs-single-msg'] = (mat['nbr-threads'] + mat['nbr-replies']) - mat['nbr-single-messages']
|
||||
|
||||
# avg. rep per thread
|
||||
mat['avg-rep-per-thrd'] = mat['nbr-replies'] / mat['nbr-threads']
|
||||
# same as:
|
||||
# mat['avg-rep-per-thrd'] = q.threads_overall(aggregate='mean')['nbr-references']
|
||||
|
||||
|
||||
|
||||
self.matrix = mat
|
||||
|
||||
return self.matrix
|
||||
|
||||
'''
|
||||
plots
|
||||
'''
|
||||
|
||||
def plot_nbr_msgs(self, title='Nbr. Messages', label='messages', color='mediumblue'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['nbr-messages'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_nbr_threads(self, title='Nbr. Threads', label='threads', color='crimson'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['nbr-threads'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_nbr_replies(self, title='Nbr. Replies in Threads', label='replies', color='dimgray'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['nbr-replies'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_avg_thread_p_msg(self, title='Avg. Threads', label='', color='crimson'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['avg-thrd-per-msg'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_avg_replies_p_msg(self, title='Avg. Replies', label='', color='dimgray'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['avg-rep-per-msg'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_avg_threads_replies_p_msg(self, title='Avg. Threads + Replies', label='avg', color='crimson'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['avg-thrd-rep-per-msg'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_diff_threads_replies_v_single_msg(self, title='Diff. Threads + Replies vs Single Messages', label='diff', color='b'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['diff-thrd-rep-vs-single-msg'].to_frame(label), title=title, color=color)
|
||||
|
||||
|
||||
def plot_avg_rep_p_thrd(self, title='Ratio Replies per Thread', label='replies-per-thread', color='blueviolet'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix['avg-rep-per-thrd'].to_frame(label), title=title, color=color)
|
||||
|
||||
def plot_msgs_replies(self, title='Messages Constituency'):
|
||||
|
||||
self.matrix_msgs_threads()
|
||||
|
||||
return plot.bar_plot_series(self.matrix[['nbr-single-messages', 'nbr-threads', 'nbr-replies']], color=['b', 'crimson', 'dimgray'], title=title)
|
||||
|
||||
def plot_cohort(self, title='Cohorts'):
|
||||
|
||||
c = self.query.cohort()
|
||||
|
||||
return c.plot(color='b', title=title)
|
||||
|
||||
'''
|
||||
text (tabular)
|
||||
'''
|
||||
|
||||
def tab_msgs_threads_replies(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Tab.from_dataframe(self.matrix[['nbr-messages', 'nbr-threads', 'nbr-replies']].astype(int),
|
||||
name_map={'nbr-messages': 'messages', 'nbr-threads': 'threads', 'nbr-replies': 'replies in threads'})
|
||||
|
||||
def tab_avg_rep_msg_thrd(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Tab.from_dataframe(self.matrix[['avg-thrd-per-msg', 'avg-rep-per-thrd']],
|
||||
name_map={'avg-thrd-per-msg': 'avg. thread per message', 'avg-rep-per-thrd': 'avg. replies per thread'}, format=".4f")
|
||||
|
||||
def tab_msgs_threads_replies_avg_rep_msg_thrd(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Tab.from_dataframe(self.matrix[['nbr-messages', 'nbr-threads', 'nbr-replies', 'avg-thrd-per-msg', 'avg-rep-per-thrd']],
|
||||
name_map={'nbr-messages': 'messages', 'nbr-threads': 'threads', 'nbr-replies': 'replies in threads', 'avg-thrd-per-msg': 'avg. thread per message', 'avg-rep-per-thrd': 'avg. replies per thread'}, format=".4f")
|
||||
|
||||
def tab_activity_from_ranking(self, rank=10):
|
||||
d = self.query.activity_from_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr-messages': 'messages'})
|
||||
|
||||
#
|
||||
def tab_threads_replies_to_ranking(self, rank=10):
|
||||
d = self.query.threads_replies_to_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d)
|
||||
|
||||
#
|
||||
def tab_threads_initiated_from_ranking(self, rank=10):
|
||||
d = self.query.threads_initiated_from_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr-initiated-threads': 'nbr. initiated threads'})
|
||||
|
||||
#
|
||||
def tab_threads_activity_threads_initiated_avg_ranking(self, rank=10):
|
||||
d = self.query.threads_activity_threads_initiated_avg_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, format=".4f")
|
||||
|
||||
#
|
||||
def tab_threads_initiated_replies_avg_ranking(self, rank=10):
|
||||
d = self.query.threads_initiated_replies_avg_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, format=".4f")
|
||||
|
||||
def tab_content_length_from_ranking(self, rank=5):
|
||||
d = self.query.activity_from_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr-bytes': 'bytes'})
|
||||
|
||||
def tab_threads_ranking(self, rank=5):
|
||||
d = self.query.threads_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr-references': 'nbr. replies'})
|
||||
|
||||
def tab_threads_ranking_year(self, rank=5, resolution='y'):
|
||||
d = self.query.threads_ranking(rank=rank, resolution=resolution)
|
||||
years = sorted(d)
|
||||
nl = '\n'
|
||||
s = ""
|
||||
for i in years:
|
||||
s += 'year: ' + i + nl
|
||||
s += format.Tab.from_dataframe(d[i], name_map={'nbr-references': 'nbr. replies'}) + nl
|
||||
return s + nl
|
||||
|
||||
def tab_replies_ranking(self, rank=10):
|
||||
d = self.query.replies_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr_replies': 'nbr. replies to threads'})
|
||||
|
||||
def tab_replies_avg_ranking(self, rank=10):
|
||||
d = self.query.replies_avg_ranking(rank=rank)
|
||||
return format.Tab.from_dataframe(d, name_map={'nbr-replies': 'nbr. replies'})
|
||||
|
||||
'''
|
||||
html
|
||||
'''
|
||||
def html_msgs_threads_replies(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Html.from_dataframe(self.matrix[['nbr-messages', 'nbr-threads', 'nbr-replies']],
|
||||
name_map={'nbr-messages': 'messages', 'nbr-threads': 'threads', 'nbr-replies': 'replies in threads'})
|
||||
|
||||
def html_avg_rep_msg_thrd(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Html.from_dataframe(self.matrix[['avg-thrd-per-msg', 'avg-rep-per-thrd']],
|
||||
name_map={'avg-thrd-per-msg': 'avg. thread per message', 'avg-rep-per-thrd': 'avg. replies per thread'})
|
||||
|
||||
def html_msgs_threads_replies_avg_rep_msg_thrd(self):
|
||||
self.matrix_msgs_threads()
|
||||
return format.Html.from_dataframe(self.matrix[['nbr-messages', 'nbr-threads', 'nbr-replies', 'avg-thrd-per-msg', 'avg-rep-per-thrd']],
|
||||
name_map={'year': 'Year', 'nbr-messages': 'Messages', 'nbr-threads': 'Threads', 'nbr-replies': 'Replies', 'avg-thrd-per-msg': 'Avg. Threads', 'avg-rep-per-thrd': 'Ratio Replies per Thread'})
|
||||
|
||||
def html_activity_from_ranking(self, rank=10):
|
||||
d = self.query.activity_from_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'nbr-messages': 'Messages'})
|
||||
|
||||
#
|
||||
def html_threads_replies_to_ranking(self, rank=10):
|
||||
d = self.query.threads_replies_to_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'nbr-references': 'Replies'})
|
||||
|
||||
#
|
||||
def html_threads_initiated_from_ranking(self, rank=10):
|
||||
d = self.query.threads_initiated_from_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'nbr-initiated-threads': '(Initiated) Threads)'})
|
||||
|
||||
#
|
||||
def html_threads_activity_threads_initiated_avg_ranking(self, rank=10):
|
||||
d = self.query.threads_activity_threads_initiated_avg_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'messages': 'Messages', 'threads': 'Threads', 'avg.threads': 'Avg. Threads'})
|
||||
|
||||
#
|
||||
def html_threads_initiated_replies_avg_ranking(self, rank=10):
|
||||
d = self.query.threads_initiated_replies_avg_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'threads': 'Threads', 'replies': 'Replies', 'avg.replies': 'Avg. Replies'})
|
||||
|
||||
def html_content_length_from_ranking(self, rank=10):
|
||||
d = self.query.activity_from_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'nbr-bytes': 'bytes'})
|
||||
|
||||
def html_threads_ranking(self, rank=10):
|
||||
d = self.query.threads_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'date': 'Date', 'subject': 'Subject', 'from': 'From', 'nbr-references': 'Replies'}, url_map={'Subject': 'url'})
|
||||
|
||||
def html_threads_ranking_year(self, rank=5, resolution='y'):
|
||||
d = self.query.threads_ranking(rank=rank, resolution=resolution)
|
||||
years = sorted(d)
|
||||
nl = '\n'
|
||||
s = ""
|
||||
for i in years:
|
||||
s += '<div class="thread_rank_year">' + nl
|
||||
s += '<div class="year_t">' + i + '</div>' + nl
|
||||
s += '<div class="rank_t">' + nl
|
||||
s += format.Html.from_dataframe(d[i], name_map={'date': 'Date', 'subject': 'Subject', 'from': 'From', 'nbr-references': 'Replies'}, url_map={'Subject': 'url'}) + nl
|
||||
s += '</div>' + nl
|
||||
s += '</div>' + nl
|
||||
return s + nl
|
||||
|
||||
def html_replies_ranking(self, rank=10):
|
||||
d = self.query.replies_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'nbr_replies': 'Replies'})
|
||||
|
||||
def html_replies_avg_ranking(self, rank=10):
|
||||
d = self.query.replies_avg_ranking(rank=rank)
|
||||
return format.Html.from_dataframe(d, name_map={'from': 'From', 'messages': 'Messages', 'replies': 'Replies', 'avg.replies': 'Avg. Replies'})
|
||||
|
||||
|
||||
136
report.py
136
report.py
@ -1,136 +0,0 @@
|
||||
import sys, os, json, logging
|
||||
from optparse import OptionParser
|
||||
|
||||
reload(sys)
|
||||
sys.setdefaultencoding('utf8')
|
||||
|
||||
# matplot view/windows
|
||||
import matplotlib
|
||||
matplotlib.interactive(True)
|
||||
|
||||
# pd display
|
||||
import pandas as pd
|
||||
pd.set_option('display.max_colwidth', 100)
|
||||
|
||||
import nettime.archive
|
||||
import nettime.query
|
||||
import nettime.report
|
||||
|
||||
class ReportDispatch:
|
||||
|
||||
def __init__(self, r=None):
|
||||
|
||||
if not isinstance(r, nettime.report.Report):
|
||||
logging.error("Rep constructor Error: r be of type nettime.report.Report")
|
||||
raise Exception()
|
||||
|
||||
self.r = r
|
||||
|
||||
def text(self, command, params=None):
|
||||
|
||||
func = {
|
||||
"tab_msgs_threads_replies": self.r.tab_msgs_threads_replies,
|
||||
"tab_avg_rep_msg_thrd": self.r.tab_avg_rep_msg_thrd,
|
||||
"tab_activity_from_ranking": self.r.tab_activity_from_ranking,
|
||||
"tab_threads_replies_to_ranking": self.r.tab_threads_replies_to_ranking,
|
||||
"tab_threads_initiated_from_ranking": self.r.tab_threads_initiated_from_ranking,
|
||||
"tab_threads_activity_threads_initiated_avg_ranking": self.r.tab_threads_activity_threads_initiated_avg_ranking,
|
||||
"tab_threads_initiated_replies_avg_ranking": self.r.tab_threads_initiated_replies_avg_ranking,
|
||||
"tab_content_length_from_ranking": self.r.tab_content_length_from_ranking,
|
||||
"tab_threads_ranking": self.r.tab_threads_ranking,
|
||||
"tab_threads_ranking_year": self.r.tab_threads_ranking_year,
|
||||
"tab_msgs_threads_replies_avg_rep_msg_thrd": self.r.tab_msgs_threads_replies_avg_rep_msg_thrd,
|
||||
"tab_replies_ranking": self.r.tab_replies_ranking,
|
||||
"tab_replies_avg_ranking": self.r.tab_replies_avg_ranking
|
||||
}
|
||||
|
||||
return func[command]()
|
||||
|
||||
def html(self, command, params=None):
|
||||
|
||||
func = {
|
||||
"html_msgs_threads_replies": self.r.html_msgs_threads_replies,
|
||||
"html_avg_rep_msg_thrd": self.r.html_avg_rep_msg_thrd,
|
||||
"html_activity_from_ranking": self.r.html_activity_from_ranking,
|
||||
"html_threads_replies_to_ranking": self.r.html_threads_replies_to_ranking,
|
||||
"html_threads_initiated_from_ranking": self.r.html_threads_initiated_from_ranking,
|
||||
"html_threads_activity_threads_initiated_avg_ranking": self.r.html_threads_activity_threads_initiated_avg_ranking,
|
||||
"html_threads_initiated_replies_avg_ranking": self.r.html_threads_initiated_replies_avg_ranking,
|
||||
"html_content_length_from_ranking": self.r.html_content_length_from_ranking,
|
||||
"html_threads_ranking": self.r.html_threads_ranking,
|
||||
"html_threads_ranking_year": self.r.html_threads_ranking_year,
|
||||
"html_msgs_threads_replies_avg_rep_msg_thrd": self.r.html_msgs_threads_replies_avg_rep_msg_thrd,
|
||||
"html_replies_ranking": self.r.html_replies_ranking,
|
||||
"html_replies_avg_ranking": self.r.html_replies_avg_ranking
|
||||
}
|
||||
|
||||
return func[command]()
|
||||
|
||||
def run(options):
|
||||
|
||||
if options.input_script and os.path.isfile(options.input_script):
|
||||
with open(options.input_script, 'r') as fp:
|
||||
input_script = json.load(fp)
|
||||
else:
|
||||
print 'No input script. Nothing to do.'
|
||||
return
|
||||
|
||||
if options.template_file and os.path.isfile(options.template_file):
|
||||
with open(options.template_file, 'r') as fp:
|
||||
out = fp.read() # not optimal but will do
|
||||
else:
|
||||
print 'No template file. Nothing to do.'
|
||||
return
|
||||
|
||||
if os.path.isfile(options.archive):
|
||||
path, file = os.path.split(options.archive)
|
||||
a = nettime.archive.Archive(data=file, archive_dir=path)
|
||||
else:
|
||||
a = nettime.archive.Archive(options.archive)
|
||||
|
||||
q = nettime.query.Query(a)
|
||||
r = nettime.report.Report(q)
|
||||
|
||||
rep = ReportDispatch(r)
|
||||
|
||||
for cmd in input_script:
|
||||
|
||||
if cmd['format'] == 'html':
|
||||
res = rep.html(cmd['command'])
|
||||
elif cmd['format'] == 'text':
|
||||
res = rep.text(cmd['command'])
|
||||
else:
|
||||
continue
|
||||
|
||||
if res is not None:
|
||||
out = out.replace(cmd['replace'], res)
|
||||
|
||||
with open(options.output_file, 'w') as fp:
|
||||
fp.write(out) # not optimal but will do
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
||||
p = OptionParser();
|
||||
p.add_option('-i', '--input-script', action="store", help="input (json) script mapping commands to text placeholders")
|
||||
p.add_option('-o', '--output-file', action="store", help="report file to be generated")
|
||||
p.add_option('-t', '--template-file', action="store", help="template file from which the report is generated")
|
||||
p.add_option('-a', '--archive', action="store", help="the archive dir or file (.json.gz) to produce the report from (default='nettime-l_2016-12-31.json.gz')", default="nettime-l_2016-12-31.json.gz")
|
||||
|
||||
options, args = p.parse_args()
|
||||
|
||||
if options.input_script is None:
|
||||
p.print_help()
|
||||
p.error('No input file specified.')
|
||||
|
||||
if options.output_file is None:
|
||||
p.print_help()
|
||||
p.error('No output file specified.')
|
||||
|
||||
if options.template_file is None:
|
||||
p.print_help()
|
||||
p.error('No template file specified.')
|
||||
|
||||
run(options)
|
||||
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user