Complete issue 30:3 as one pdf - TUG

More documents

Recommendations

Info

$E-m: Guidelines for Future TEX Extensions - TUG$

$TUG 2001: A TEX Odyssey PROGRAM$

$LATEX Sophisticated professional typesetting for business and ...$

$TEX and Scripting Languages - TUG$

$Geometric Diversions with TEX, METAFONT and METAPOST - TUG$

$Writing Gregg Shorthand with mEtaFoNt and LATEX - TUG$

$Generating LaTeX documents through Matlab - TUG$

E46 MAPS 39 Luigi Scarso andimport thisintoLua: \startluacode function testR(samples,outpdf,w,h,kernel) require("python") pyR = python.import("test-R") dens = pyR.density(samples,outpdf,w,h,kernel) dens.run() end \stopluacode \def\plotdenstiy[#1]{% \getparameters[R][#1]% \expanded{\ctxlua{testR("\Rsamples", "\Routpdf", \Rwidth, \Rheight,"\Rkernel")}}} \setupbodyfont[sans,14pt] \starttext \startTEXpage \plotdenstiy[samples={u-random-int}, outpdf={test-001.pdf}, width={10},height={7}, kernel={o}] \setupcombinations[location=top] \startcombination[1*2] {\vbox{\hsize=400bp This is a density plot of around {\tt 100 000} random numbers between $0$ and $2^{16}-1$ generated from {\tt \hbox{/dev/urandom}}}}{} {\externalfigure[test-001.pdf][width={400bp}]}{} \stopcombination \stopTEXpage \stoptext Notethe conditional statement if __name__ == ’__main__’ : that permits to test the script with an ordinary Python interpreter. It’s worth notingthat rpy2isincludedin Sagetoo. For more information about scientic computation with Pythonsee [61] and[62] (alsowithsite[31])and[54]. The example of Sage shows that in this case we can think of luatex lunatic as an extension of Sage but also that luatex lunatic is extended with Sage. This is somehow similar to CWEB: code and description are tangledtogether,butnowthere’snotaspeciclanguage like C in CWEB (in fact we can do the same with R). Eventually “untangled” is a matter of separation of Figure 2. Result of the R code Pythoncode inadierent le from the sourcetexle. By the way, it’s important to underline that CWEB is more advanced than other (C) code documentation systems because itembedssourcecodeinsidedescriptivetextratherthanthereverse(as is common practice in most programming languages). Documentation can be not “linear”, a bit unusual for ordinary programmers, but it’s a more ecient and eective description of complex systems. Here we are talking about “linear” documentation, much like this article: a linearsequence oftext-and-code printedas theyappear. Of course some computations may require much more time to be completed than the time of generation of the respective document (and ConTEXt is also a multipass system),sothisapproachisprettyinecient—weneeda set of macros that take care of intermediate results, i.e. caching macros or multipass macros. For example, in ConTEXt-mkivwe can say \doifmode{*first}{% % this code will be executed only at first pass \Mymacro } so \Mymacro will be executed only at the rst pass; there isalso a Two Pass Data module core-two.mkiv that can be used for this, but don’t forget that we also have Lua andPythonforourneeds. Graphs In LuaTEX–ConTEXt-mkiv we already have a very powerful tool for technical drawing: MetaPost. Simple searching reveals for example METAGRAPH [32] or the moregenericLuaGRAPH[19],aLuabindingtographviz [38] with output also in MetaPost; both are capable of drawing (un)directed graphs and/or networks. The next two modulesare more oriented to graph calculations.
LuaTEX lunatic EUROTEX 2009 E47 MetaPost is an example of “embedding” an interpreter in LuaTEXatcompilationtime(seeluaopen_mplib(L)invoid luainterpreter(void)in$HOMEDIR/source/texk/web2c/luatexdir/lua /luastuff.c). So hosting Python is not a new idea: the dierence is thatthe “embedding” isdoneat run time. igraph. igraph “is a free software package for creating and manipulating undirected and directed graphs. It includesimplementationsforclassicgraphtheoryproblems likeminimumspanningtreesandnetworkow,andalso implementsalgorithmsforsomerecentnetworkanalysis methods, like community structure search. The ecient implementationofigraphallowsittohandlegraphswith millions of vertices and edges. The rule of thumb is that if your graph ts into the physical memory then igraph canhandleit. [11] To install igraph we must rst install pycairo, a Python binding to cairo [1], a well known 2D graphics library: so we gain anothertoolforgenericdrawing. Figure 3. The result of the igraph code. Thistime we coded the Pythonlayer asaclass: import igraph class spanningtree(object) : def __init__(self,ofn): self.ofn = ofn def distance(self,p1, p2): return ((p1[0]-p2[0]) ** 2 + (p1[1]-p2[1]) ** 2) ** 0.5 def plotimage(self): res = igraph.Graph.GRG(100, 0.2, return_coordinates=True) g = res[0] xs = res[1] ys = res[2] layout = igraph.Layout(zip(xs, ys)) weights = [self.distance(layout[edge.source], layout[edge.target]) for edge in g.es] max_weight = max(weights) g.es["width"] = \ [6 - 5*weight/max_weight for weight in weights] mst = g.spanning_tree(weights) fig = igraph.Plot(target=self.ofn) fig.add(g, layout=layout, opacity=0.25, vertex_label=None) fig.add(mst, layout=layout, edge_color="blue", vertex_label=None) fig.save() if __name__ == ’__main__’: sp = spanningtree(’test-igraph.png’) sp.plotimage() In this case we calculate a minimum spanning tree of a graph, and save the result in test-igraph.png. The Lua layer isso simplethat it isencapsulated inaTEX macro: \def\PlotSpanTree#1{% \startluacode require("python") local spantree_module local sp spantree_module = python.import("test-igraph") sp = spantree_module.spanningtree("#1") sp.plotimage() \stopluacode \externalfigure[#1]} \starttext \startTEXpage \PlotSpanTree{test-igraph.png} \stopTEXpage \stoptext NetworkX. NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics,and functionsof complexnetworks. [22] The code is simpler: we have only two layers: the Python layer, and the TEX layer. The Python layer is a trivial modication of knuth_miles.py (see [24], [36], [60]), and is left to the reader (hint: rename ..__init__.. in def run()). \starttext \startTEXpage \ctxlua{require("python"); knuth=python.import("test-networkx"); knuth.run();}
Page 1 and 2: Proceedings MAPS 39 • TUGboat 30:
Page 3: Table of Contents EuroTEX 2009, Han
Page 8 and 9: E4 MAPS 39 TUG 2010 TEX’s 2 5 ann
Page 10 and 11: E6 MAPS 39 Kees van der Laan What T
Page 12 and 13: E8 MAPS 39 Kees van der Laan andthe
Page 14 and 15: E10 MAPS 39 Kees van der Laan I hav
Page 16 and 17: E12 MAPS 39 Kees van der Laan Knuth
Page 18 and 19: E14 MAPS 39 Kees van der Laan have
Page 20 and 21: E16 MAPS 39 Kees van der Laan I mus
Page 22 and 23: E18 MAPS 39 Kees van der Laan First
Page 24 and 25: E20 MAPS 39 Kees van der Laan The p
Page 26 and 27: E22 MAPS 39 Kees van der Laan drawa
Page 28 and 29: E24 MAPS 39 Kees van der Laan Synta
Page 30 and 31: E26 MAPS 39 Kees van der Laan Essen
Page 32 and 33: E28 MAPS 39 Kees van der Laan NaumG
Page 34 and 35: E30 MAPS 39 Kees van der Laan The a
Page 36 and 37: E32 MAPS 39 Kees van der Laan 19. M
Page 38 and 39: E34 MAPS 39 Luigi Scarso LuaTEX lun
Page 40 and 41: E36 MAPS 39 Luigi Scarso It’s bet
Page 42 and 43: E38 MAPS 39 Luigi Scarso So we must
Page 44 and 45: E40 MAPS 39 Luigi Scarso luatex-sna
Page 46 and 47: E42 MAPS 39 Luigi Scarso it’s bou
Page 48 and 49: E44 MAPS 39 Luigi Scarso ghost.appe
Page 52 and 53: E48 MAPS 39 Luigi Scarso \externalf
Page 54 and 55: E50 MAPS 39 Luigi Scarso %% \startl
Page 56 and 57: E52 MAPS 39 Luigi Scarso [8] http:/
Page 63 and 64: Willi Egger EUROTEX 2009 E59 Decora
Page 65 and 66: Decorating CD-ROMs and DVDs EUROTEX
Page 77 and 78: The language mix EUROTEX 2009 E73 S
Page 79 and 80: The language mix EUROTEX 2009 E75 \
Page 81 and 82: The language mix EUROTEX 2009 E77 T
Page 83: E16 & DEtool: typesetting language
Page 87: E16 & DEtool: typesetting language
Page 90 and 91: E86 MAPS 39 Siep Kroonenberg A netw
Page 92 and 93: E88 MAPS 39 Siep Kroonenberg machin
Page 94 and 95: E90 MAPS 39 Siep Kroonenberg Additi
Page 96 and 97: E92 MAPS 39 Jean-Michel Hufflen Usi
Page 98 and 99: E94 MAPS 39 Jean-Michel Hufflen fun
Page 100 and 101:
E96 MAPS 39 Jean-Michel Hufflen (de
Page 102 and 103:
E98 MAPS 39 Jean-Michel Hufflen Not
Page 104 and 105:
E100 MAPS 39 A.-M. Aebischer, B. Ae
Page 106 and 107:
Page 108 and 109:
Page 111 and 112:
Stanislav Jan Šarman EUROTEX 2009
Page 113 and 114:
Writing Pitman shorthand with Metaf
Page 115 and 116:
Writing Pitman shorthand with Metaf
Page 117 and 118:
Optimizing PDF output size of TEX d
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Taco Hoekwater EUROTEX 2009 E131 Ge
Page 137 and 138:
Generating PDF for e-reader devices
Page 139 and 140:
Generating PDF for e-reader devices
Page 141 and 142:
LuaTEX says goodbye to Pascal EUROT
Page 143 and 144:
LuaTEX says goodbye to Pascal EUROT
Page 145 and 146:
Taco Hoekwater EUROTEX 2009 E141 Th
Page 147 and 148:
Hans Hagen & Taco Hoekwater EUROTEX
Page 149 and 150:
John Trapp EUROTEX 2009 E145 Using
Page 151 and 152:
Using L ATEX as a computing languag
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Experiences typesetting mathematica
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Abstracts without papers UsingTEXFo
Page 185 and 186:
Abstracts without papers EUROTEX 20
Page 187:
The information here comes from the
show all

Complete issue 30:3 as one pdf - TUG

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?