1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
%
% references.bib
%
% (c) 2020 Prof Dr Andreas Müller, Hochschule Rapperswil
%
@article{BRIN1998107,
title = "The anatomy of a large-scale hypertextual Web search engine",
journal = "Computer Networks and ISDN Systems",
volume = "30",
number = "1",
pages = "107 - 117",
year = "1998",
note = "Proceedings of the Seventh International World Wide Web Conference",
issn = "0169-7552",
doi = "https://doi.org/10.1016/S0169-7552(98)00110-X",
url = "http://www.sciencedirect.com/science/article/pii/S016975529800110X",
author = "Sergey Brin and Lawrence Page",
keywords = "World Wide Web, Search engines, Information retrieval, PageRank, Google",
abstract = "In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://google.stanford.edu/ To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of Web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the Web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and Web proliferation, creating a Web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale Web search engine — the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want."
}
@book{buch:linalg,
title = {Lineare Algebra},
author = {Andreas M"uller},
url = {https://github.com/AndreasFMueller/LinAlg.git},
year = {2010}
}
@book{buch:mathsem-wavelets,
title = {Mathematisches Seminar Wavelets},
author = { Andreas M"uller and others },
year = {2019},
}
@book{buch:mathsem-dgl,
title = {Mathematisches Seminar Differentialgleichungen},
author = { Andreas M"uller and others },
year = {2016},
}
@online{buch:rfc2409,
title = {The Internet Key Exchange (IKE)},
author = { D. Harkins and D. Carrel},
url = {https://datatracker.ietf.org/doc/html/rfc2409},
year = {1998}
}
@online{buch:fftw,
title = {Fastest Fourier Transform in the West},
url = {http://www.fftw.org/},
DAY = {23},
MONTH = {july},
YEAR = 2018
}
@online{buch:repo,
subtitle = {Source Code Repository},
author = {Andreas Müller},
url = {https://github.com/AndreasFMueller/SeminarNumerik.git},
DAY = 6,
MONTH = {february},
YEAR = 2020
}
@book{buch:henrici,
author = {Peter Henrici},
title = {Essentials of numerical analysis},
subtitle = {With pocket calculator demonstrations},
year = 1982,
publisher = {John Wiley and Sons, Inc.},
isbn = {0-471-05904-8}
}
@online{buch:tartaglia,
title = {Niccolò Tartaglia},
url = {https://de.wikipedia.org/wiki/Niccolò_Tartaglia},
date = {2020-02-06},
year = {2020},
month = {2},
day = {6}
}
@online{buch:kahan-summation,
title = {Kahan summation algorithm},
url = {https://en.wikipedia.org/wiki/Kahan_summation_algorithm},
date = {2020-02-29},
year = {2020},
month = {2},
day = {29}
}
@book{buch:watkins,
title = {Fundamentals of Matrix Computations},
author = {David S. Watkins},
year = 2010,
publisher = {John Wiley and Sons, Inc.},
edition = {3}
}
@online{buch:lissajous,
title = {Makeing Shapes with PSLab Oscilloscope},
author = {CloudyPadmal},
url = {https://blog.fossasia.org/making-shapes-with-pslab-oscilloscope/},
DAY = 7,
month = 3,
year = 2020
}
@book{buch:richardson,
title = {The emergence of numerical weather prediction: Richardson's dream},
author = {Peter Lynch},
year = 2006,
publisher = {Cambridge University Press},
isbn = {978-0-52-185729-1}
}
@book{buch:dieudonne,
title={Foundations of Modern Analysis},
author={Jean Dieudonn{\'e}},
number={Vol. 1},
lccn={60008049},
series={Dieudonn{\'e}, Jean: Treatise on analysis},
year={1960},
publisher={Academic Press}
}
@book{buch:ebbinghaus,
title = {Zahlen},
year = 1983,
inseries = {Grundwissen Mathematik},
volume = 1,
publisher = {Springer-Verlag},
author = { Hans-Dieter Ebbinghaus et al },
isbn = { 3-540-12666-X }
}
@online{buch:primitivepolynomiallist,
title = {Primitive Polynomial List},
url = {https://www.partow.net/programming/polynomials/index.html},
day = 8,
month = 3,
year = 2021
}
@book{skript:landaulifschitz1,
author = {Landau, L. D. and Lifschitz, E. M.},
title = {Mechanik},
series = {Lehrbuch der theoretischen Physik},
volume = {1},
publisher = {Akademie-Verlag},
year = {1981},
language = {german},
}
@buch{skript:brualdi,
title = {The mutually beneficial relationships of graphs and matrices},
author = {Richard A. Brualdi},
series = {CBMS Regionals conference series in mathematics},
number = {115},
publisher = {American Mathematical Society},
isbn = {978-0-8218-5315-3},
year = 2011,
language = {english}
}
|
