Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov –...Beniamino Murgante
Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov – National Centre for Geocomputation, National University of Ireland , Maynooth (Ireland)
Intelligent Analysis of Environmental Data (S4 ENVISA Workshop 2009)
Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov –...Beniamino Murgante
Kernel based models for geo- and environmental sciences- Alexei Pozdnoukhov – National Centre for Geocomputation, National University of Ireland , Maynooth (Ireland)
Intelligent Analysis of Environmental Data (S4 ENVISA Workshop 2009)
In many applications one observes rapid change of the solution in the boundary region. Accurate and numerically efficient resolution of the solution close to the moving boundaries is considered to be an important problem. We develop an approach to the optimization of the discretization grids for finite-difference scheme. Using the suggested approach we are able to achieve the exponential convergence of the boundary Neumann- to-Dirichlet maps. It increases the convergence order without increasing the stencil size of the finite-difference scheme and preserves stability.
the slides are aimed to give a brief introductory base to Neural Networks and its architectures. it covers logistic regression, shallow neural networks and deep neural networks. the slides were presented in Deep Learning IndabaX Sudan.
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...Leo Asselborn
This presentation proposes an approach to algorithmically synthesize control strategies for
set-to-set transitions of uncertain discrete-time switched linear systems based on a combination
of tree search and reachable set computations in a stochastic setting. For given Gaussian
distributions of the initial states and disturbances, state sets wich are reachable to a chosen
confidence level under the effect of time-variant hybrid control laws are computed by using
principles of the ellipsoidal calculus. The proposed algorithm iterates over sequences of the
discrete states and LMI-constrained semi-definite programming (SDP) problems to compute
stabilizing controllers, while polytopic input constraints are considered. An example for illustration is included.
A short course I taught in 2002 at the University of Hawaii's Kauai Community College. This course was offered to professionals working on radar tracking systems for air, missile, surface, and subsurface vehicle tracking. The material is a decade old, so it does not cover the latest technology. However, it is an excellent primer for those just starting on the subject.
In many applications one observes rapid change of the solution in the boundary region. Accurate and numerically efficient resolution of the solution close to the moving boundaries is considered to be an important problem. We develop an approach to the optimization of the discretization grids for finite-difference scheme. Using the suggested approach we are able to achieve the exponential convergence of the boundary Neumann- to-Dirichlet maps. It increases the convergence order without increasing the stencil size of the finite-difference scheme and preserves stability.
the slides are aimed to give a brief introductory base to Neural Networks and its architectures. it covers logistic regression, shallow neural networks and deep neural networks. the slides were presented in Deep Learning IndabaX Sudan.
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...Leo Asselborn
This presentation proposes an approach to algorithmically synthesize control strategies for
set-to-set transitions of uncertain discrete-time switched linear systems based on a combination
of tree search and reachable set computations in a stochastic setting. For given Gaussian
distributions of the initial states and disturbances, state sets wich are reachable to a chosen
confidence level under the effect of time-variant hybrid control laws are computed by using
principles of the ellipsoidal calculus. The proposed algorithm iterates over sequences of the
discrete states and LMI-constrained semi-definite programming (SDP) problems to compute
stabilizing controllers, while polytopic input constraints are considered. An example for illustration is included.
A short course I taught in 2002 at the University of Hawaii's Kauai Community College. This course was offered to professionals working on radar tracking systems for air, missile, surface, and subsurface vehicle tracking. The material is a decade old, so it does not cover the latest technology. However, it is an excellent primer for those just starting on the subject.
Convex Optimization Modelling with CVXOPTandrewmart11
An introduction to convex optimization modelling using cvxopt in an IPython environment. The facility location problem is used as an example to demonstrate modelling in cvxopt.
constant strain triangular which is used in analysis of triangular in finite element method with the help of shape function and natural coordinate system.
This slide contain description about the line, circle and ellipse drawing algorithm in computer graphics. It also deals with the filled area primitive.
Subgradient Methods for Huge-Scale Optimization Problems - Юрий Нестеров, Cat...Yandex
We consider a new class of huge-scale problems, the problems with sparse subgradients. The most important functions of this type are piecewise linear. For optimization problems with uniform sparsity of corresponding linear operators, we suggest a very efficient implementation of subgradient iterations, the total cost of which depends logarithmically in the dimension. This technique is based on a recursive update of the results of matrix/vector products and the values of symmetric functions. It works well, for example, for matrices with few nonzero diagonals and for max-type functions.
We show that the updating technique can be efficiently coupled with the simplest subgradient methods. Similar results can be obtained for a new non-smooth random variant of a coordinate descent scheme. We also present promising results of preliminary computational experiments.
We study communication cost of computing functions when inputs are distributed among k processors, each of which is located at one vertex of a network/graph called a terminal. Every other node of the network also has a processor, with no input. The communication is point-to-point and the cost is the total number of bits exchanged by the protocol, in the worst case, on all edges. Our results show the effect of topology of the network on the total communication cost. We prove tight bounds for simple functions like Element-Distinctness (ED), which depend on the 1-median of the graph. On the other hand, we show that for a large class of natural functions like Set-Disjointness the communication cost is essentially n times the cost of the optimal Steiner tree connecting the terminals. Further, we show for natural composed functions like ED∘XOR and XOR∘ED, the naive protocols suggested by their definition is optimal for general networks. Interestingly, the bounds for these functions depend on more involved topological parameters that are a combination of Steiner tree and 1-median costs. To obtain our results, we use some tools like metric embeddings and linear programming whose use in the context of communication complexity is novel as far as we know. (Based on joint works with Jaikumar Radhakrishnan and Atri Rudra)
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
2. Abstract
Numerical Linear Algebra for Data and Link Analysis
Modern information retrieval and data mining systems must operate on extremely large datasets and require efficient, robust and
scalable algorithms. Numerical linear algebra provides a solid foundation for the development of such algorithms and analysis
of their behavior.
In this talk I will discuss several linear algebra based methods and their practical applications:
i) Spectral graph partitioning. I will describe a recursive spectral algorithm for bi-partite graph partitioning and its application
to simultaneous clustering of bidded terms and advertisers in pay-for-performance market data. I will also present a new local
refinement strategy that allows us to improve cluster quality.
ii) Web graph link analysis. I will discuss a linear system formulation of the PageRank algorithm and the use of Krylov
subspace methods for an efficient solution. I will also describe our scalable parallel implementation and present results of
numerical experiments for the convergence of iterative methods on multiple graphs with various parameter settings.
In conclusion I will outline some difficulties encountered while developing these applications and address possible solutions
and future research directions.
3. Outline
• Introduction
– Computational science and information retrieval
• Spectral clustering and graph partitioning
– Spectral clustering
– Flow refinement
– Bi-partite spectral and advertiser-term clustering
• Web graph link analysis
– PageRank as linear system
– Krylov subspace methods
– Numerical experiments
• Parallel implementation
– Distributed matrices
– MPI, PETSc, etc
• Conclusion and future work
4. 1. Introduction
1.1. Computational science for information retrieval
• Multiple applications of numerical methods, no specilized algorithms
• Large scale problems
• Practical applications
Scientific Computing Information Retrieval
Problem in continuum, governed by PDE Discrete data is given
discretization for numerical solution no control over problem size
control over resolution
2D or 3D geometry High dimensional spaces
Uniform distribution of node degrees Power-low degree distribution
5. 1.2. Scientific Computing vs Information Retrieval graphs
FEM mesh for CFD simulations Artist-Artist similarity graph
7. 2.1. Graph partitioning
• Bisecting the graph, edge separator
Good and balanced cut
• Balanced partition
• “Natural” boundaries partition = clustering
8. 2.2. Metrics - good cut
• Partitioning:
cut(V1, V2) = eij ; assoc(V1, V ) = d(vi)
i∈V1 ,j∈V2 i∈V1
• Objective functions:
– Minimal cut:
M Cut(V1, V2) = cut(V1, V2);
– Normalized cut:
cut(V1, V2) cut(V1, V2)
N Cut(V1, V2) = +
assoc(V1, V ) assoc(V2, V )
– Quotient Cut:
cut(V1, V2)
QCut(V1, V2) =
min(assoc(V1, V ), assoc(V2, V ))
9. 2.3. Graph cuts
• Let G = (V, E) - graph, A(G) - adjacency matrix
• Let V = V + ∪ V − be partitioning of the nodes
• Let v = {+1, −1, +1, ... − 1, +1}T - indicator vector
-1 -1 +1 +1 +1
x x x x x
• v(i) = +1, if v(i) ∈ V +; v(i) = −1, if v(i) ∈ V −
• Compute the number of edges, connecting V + and V −
1 1
cut(V +, V −) = (v(i) − v(j))2 = vT Lv
4 4
e(i,j)
• L=D−A
• Minimal cut partitioning - smallest number of edges to remove
• Exact solution is NP-hard!
10. 2.4. Spectral method - motivation (from Physics)
• Linear graph - 5 nodes:
1 2 3 4 5
x x x x x
• Energy of the system:
1 1
E= m x(i)2 + k
˙ (x(i) − x(j))2
2 i
2 i,j
• Equations of motion:
d2x
M 2 = −kLx
dt
• Laplacian matrix 5x5:
1 −1
−1 2 −1
L= −1 2 −1
−1 2 −1
−1 1
11. 2.5. Spectral method - motivation (from Physics)
• Eigenproblem:
Lx = λx
2
• Second lowest λ2 = ω2 mode bisecting the string into two equal sized
components
12. 2.6. Spectral method - relaxation
• Discrete problem → continuous problem
• Discrete problem:
find
1
min( vT Lv)
4
constraints v(i) = ±1, i v(i) = 0;
• Relaxation - continuous problem:
find
1
min( xT Lx)
4
constraints: x(i)2 = N , i x(i) = 0
• Exact constraint satisfies relaxed equation, but not other way around!
• Given x(i), round them up by v(i) = sign(x(i))
13. 2.7. Spectral method - computations
• Constraint optimization problem:
1
Q(x) = xT Lx − λ(xT x − N )
4
• Additional constraint: x e = {1, 1, 1, .., 1}
• Minimization
1 xT Lx
min( )
x⊥x1 4 xT x
• Courant Fischer Minimax Theorem
Lx = λx
Looking for λ2 (second smallest) eigenvalue and x2
14. 2.8. Family of spectral methods
• Ratio cut:
cut(V1, V2) cut(V1, V2)
RCut(V1, V2) = +
|V1| |V2|
(D − A)x = λx
• Normalized cut:
cut(V1, V2) cut(V1, V2)
N Cut(V1, V2) = +
assoc(V1, V ) assoc(V2, V )
assoc(V1, V1) assoc(V2, V2)
N Cut(V1, V2) = 2 − ( + )
assoc(V1, V ) assoc(V2, V )
(D − A)x = λDx
15. 2.9. Spectral partitioning algorithm
Algorithm 1
Compute the eigenvector v2 corresponding to λ2 of L(G)
for all node n in G do
if v2 (n) < 0 then
put node n in partition V-
else
put node n in partition V+
end if
end for
16. 2.10. Spectral ordering algorithm
Algorithm 2
Compute the eigenvector v2 corresponding to λ2 of L(G)
for all node n in G do
sort n according to v2 (n)
end for
• Permute columns and rows of A according to “new” ordering
• Since − v(j))2 is minimized ⇒
e(i,j) (v(i)
there are few edges connecting distant v(i) and v(j)
20. 2.14. Flow refinment
Set up and solve minimum S-T cut problem
• Divide node in 3 sets according to embedding ordering
• set up s-t max flow problem with one set of nodes pinned to the source and
another to the sink with inf capacity links
• solve to obtain S-T min cut ( min-cut max-flow theorem, find saturated fron-
tier),
• move the partition
21. 2.15. Flow refinment
cut(A,B)=171 cut(A,B)=70
QCut=0.0108 QCut=0.0053
NCut=0.0206 NCut=0.0088
part size=1433 part size=1195
22. 2.16. Flow refinment
cut(A,B)=11605 cut(A,B)=36688
QCut=0.242 QCut=0.160
NCut=0.267 NCut=0.296
part size=266 part size=1103
23. 2.17. Recursive spectral
• tree → flat clusters
25. 2.19. Data: Advertiser - bidded term data
aj Terms
aj Terms
ti
ti
A= A=
Advertisers
Advertisers
• Simultaneous clustering of advertisers and bidded terms (co-clustering)
• Bi-partite graph partitioning problem
26. 2.20. Bi-partite graph case
• Adjacency matrix for the bipartite graph
ˆ 0 A
A=
AT 0
• Eigensystem:
D1 −A x D1 0 x
=λ
−AT D2 y 0 D2 y
• Normalization:
−1/2 −1/2
An = D1 AD2
Anv = (1 − λ)u
AT u = (1 − λ)v
n
• SVD decomposition:
An = uσvT , σ = 1 − λ
29. 2.23. Computational consideration
• Large and very sparse matrices
• Only top few eigenvectors needed
• Precision requirements low
• Iterative Krylov subspace methods, Lanczos and Arnoldi algorithms
• Only matrix-vector multiply
31. 3.1. PageRank model
• Random walk on the graph
• Markov process: memoryless, homogeneous,
• Stationary distribution: existence, uniqueness, convergence.
• Perron-Frobenius theorem; irreducible, every state is reachable from every
other, and aperiodic - no cycles
32. 3.2. PageRank model
• Construct probability matrix
P = D−1A, D = diag(A)
• Construct transition matrix for Markov process (row-stochastic)
P = P + (dvT )
• Correct reducibility (irreducible)
P = cP + (1 − c)(evT )
• Markov chain stationary distribution exist and unique (Perron-Frobenius)
P T p = λp
33. 3.3. Linear system formulation
• PageRank equation
(cP + c(dvT ) + (1 − c)(evT ))x = λx
• Normalization
(eT x) = (xT e) = ||x||1, λ1 = 1
• Identity
(dT x) = ||x|| − ||PT x||.
• Linear system
(I − cPT )x = v(||x||1 − c||PT x||1)
34. 3.4. Linear System vs Eigensystem
Eigensystem Linear system
P T p = λp (I − cPT )x = k(x) v
P = cP + c(dvT ) + (1 − c)(evT ) k(x) = ||x||1 − c||PT x||1
x
λ=1 p= ||x||1
• Iteration matrices: P , I − cPT - different rate of convergence
• Vector v - rhs or in the matrix
• More methods available for linear system
• Solution is linear with respect to v
38. 3.8. Krylov subspace methods
• Linear system
Ax = b, A = I − cPT , b = kv
• Residual
r = b − Ax
• Krylov subspace
Km = span{r, Ar, A2r, A3r...Amr}
• xm is build from x0 + Km, xm = x0 + qm−1(A)r0
• Only matrix-vector products
• Explicit minimization in subspace, extra information for next step
39. 3.9. Krylov subspace methods
• Generalize Minimum Residual (GMRES)
pick xn ∈ Kn , such that min ||b − Axn ||, rn ⊥ AKn
• Biconjugate Gradient (BiCG)
n−1
pick xn ∈ Kn , such that rn ⊥ span{w, AT w, ...AT w)
• Biconjugate Gradient Stabilized (BiCGSTAB)
• Quasi-Minimal Residual (QMR)
• Conjugate Gradient Squared (CGS)
• Chebyshev Iterations.
Preconditioners
• Convergence depends on cond(A) = λmax/λmin
• Preconditioner M, M−1A x = M−1b
• Iterate M−1A - better condition number
• Diagonal preconditioner M = D
50. 4.1. Matrix-Vector multiply
• Iterative process
Ax→x
• Every process “owns” several rows of the matrix
• Every process “owns” corresponding part of the vector
• Communications required for multiplication
51. 4.2. Distributed matrices
• Computing:
– Load balancing: equal number of non-zeros per processor
– Minimize communications: smallest number “of the processor” ele-
ments
• Storage:
– Number of non-zeros per processor
– Number of rows per processor
52. 4.3. Practical data distribution
• Balanced graph partitioning
– Exact - NP hard
– Approximate - multi-resolution, spectral, geometric,
• Practical solution
– Sort graph in lexigraphic order
– Fill processors consecutively by row, adding rows until
wrowsnp + wnnz nnzp > (wrowsn + wnnz nnz)/p
with wrows : wnnz = 1/1, 2/1, 4/1
53. 4.4. Data distribution schemes
y2 std parellelization and distribution
400
smart
nrows
350
300
250
time, s
200
150
100
50
5 10 15 20 25 30
# of processors
60. 5. Conclusions
• Eigenvalues everywhere! Linear algebra methods provide provably good
solutions to many problems. Methods are very general.
• Power-law graphs with high variance in node degrees present challenges to
high performance parallel computing
• Skewed distribution, chains, central core, singletons makes clustering of
power-law data a difficult problem
• Embedding in 1D is probably not sufficient for this type of data, higher
dimensions needed
61. 5.1. References
• Collaborators:
– Kevin Lang, Pavel Berkhin
– David Gleich and Matt Rasmussen
• Publications:
– “Fast Parallel PageRank: A Linear System Approach”, 2004
– “Spectral Clustering of Large Advertiser Datasets”, 2003
– “Clustering of bipartite advertiser-keyword graph”, 2002
• References:
– Spectral graph partitioning:
M. Fiedler (1973), A. Pothen (1990), H. Simon (1991), B. Mohar (1992), B. Hendrickson
(1995), D. Spielman (1996), F. Chang (1996), S. Guattery (1998), R. Kannan (1999), J.
Shi (2000), I. Dhillon ( 2001), A. Ng (2001), H. Zha (2001), C. Ding (2001)
– PageRank computing:
S.Brin (1998), L. Page (1998), J. Kleinberg (1999), A. Arasu (2002), T. Haveliwala
(2002-03), A. Langville (2002), G. Jeh (2003), S. Kamvar (2003), A. Broder (2004)