Bunch–Davies vacuum: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
tweak
 
en>Yobot
m →‎References: WP:CHECKWIKI error fixes / special characters in sortkey fixed using AWB (9427)
Line 1: Line 1:
The Bosch 1-1/8-Inch SDS-plus Swift Adjust Rotary Hammer provides the perfect mixture of power, influence power, drilling speed, and luxury. Bosch tools are made by a single of the major tool companies in the United States and are utilized by professionals and novices alike.  With these two major corporations joining forces, it can only help to preserve the Dremel tool on leading of the marketplace. There are six major varieties of Dremel tool accessories, including those for rotary tools, oscillating tools, scroll saws, engravers, VersaTip tools and contour sander tools.<br><br>The Dremel oscillating tool presents accessories for cutting wood, metal and drywall, sand paper for wood or paint removal, and flexible, rigid or grout remover scraper blades. The rotary tool accessories are obtainable individually, or in kits. The rotary tool also presents a cutting, carving and sanding kit with 48 pieces, an 11-piece carving and engraving kit, and 11-piece lock-cutting kit, a 31-piece sanding and grinding kit, a reduce-off wheel kit and a set of six router bits.<br><br>The rotary tool's field array almost certainly shorted (that is the case 95% of the time).  It was just creating a horrible grinding noise and wouldn't preserve speed. I haven't heard of any other related troubles with this distinct rotary tool, so I feel I just got a dud. Got my replacement rotary tool, got a flex shaft attachment, and started carving once againI have to have to find out how to tie Maori knots, also, and also discover a right polishing approach that operates for complicated surfaces.<br><br>The tool has so quite a few functions you could even put a sharpening bit to sharpen your knives at residence. This kit from the veteran producers of rotary tools is a fantastic piece of technology.  The three tools are the saw tool, the rotary tool and the oscillating tool. The tool has a 6A motor and generates an output of up to 17,000RPM. The tool will deliver you with terrific manage as well as precision.<br><br>You will finish up obtaining tired since of the potential to keep on employing a well-balanced tool. When you choose this particular rotary sludge hammer upward, you can have the stability. General Overall we're providing this a "5 Blade" The actual Bosch rotary Sludge hammer has outstanding stability, a lot of energy and also the SDS program makes it easy to alter bits on the run. Which tends to make it seem that Bosch is falsely promoting this tool.<br><br>All the threads are plastic - Try to remember when utilizing the attachments that screw onto the tool anything is plastic, so never over tighten them or you'll be replacing attachmentsLow speed setting may possibly not be greatest - When applying low speed settings and the tool starts to jump and sputter around your workpiece or breaking the pieces you are functioning onIf you loved this informative article and you would want to receive more details with regards to [http://www.bestoscillatingtoolreviews.com/belt-sander-reviews-find-the-best-model/ Belt Sander Reviews] please visit our own web site. Don't forget that speed is at times greater and lighter pressureYou will not have to appear far for an accessory or attachment that will function with this tool.<br><br>Like the Bosch MX25 Oscillating MultiTool , we were disappointed to see the M12 only go to Six� alternatively of Spinal Tap's and HomeFixated's advisable 11.� We're still waiting for the 1st tool enterprise to come out with the HomeFixated edition cordless that goes all the way up to 11.� C'mon tool businessesKeeping a rotary tool on track for a round piece reduce-off task is not as quick as you could possibly feelA rotary tool can reduce with either a wheel or a straight bit.<br><br>Bigger, heavier duty rotary tools are normally much better for qualified function and bigger projects, such as cutting drywall, electrical work and metal cutting. Attachments: Accessories that can be employed to enable rotary tools to take on a number of tasks. There are various things to look at just before obtaining a rotary tool. Some electric rotary tools may weigh significantly less than portable ones, but you also have to consider that it's corded.
{{no footnotes|date=March 2013}}
{{cleanup|reason=Should be using the &lt;ref&gt;-tags; an expert might need to check if the refs support the text|date=March 2012}}
[[Image:CheiPageRank.png|thumb|280px| Nodes with links in the plane of PageRank and CheiRank]]
 
The '''CheiRank''' is an [[Eigenvalues and eigenvectors|eigenvector]] with a maximal real eigenvalue of the [[Google matrix]] <math> G^* </math> constructed for a directed network with the inverted directions of links.  It is similar to the [[PageRank]] vector, which ranks the network nodes in average proportionally to a number of incoming links being the maximal eigenvector of the [[Google matrix]] <math> G </math>  with a given initial direction of links. Due to inversion of link directions the '''CheiRank''' ranks the network nodes in average proportionally to a number of outgoing links. Since each node belongs both to '''CheiRank''' and [[PageRank]] vectors the ranking of information flow on a directed network becomes '''two-dimensional'''.
 
==Definition==
[[Image:CheiRank1.jpg|thumb|280px|  Fig1. Distribution of procedure calls of Linux Kernel network  in the plane of PageRank probability <math> x = \log_{10} P_i </math> and CheiRank probability <math> y = \log_{10} {P}^*_i </math> for Linux version 2.6.32 with matrix size <math> N=285509 </math> at <math> \alpha=0.85</math>, color shows the density of nodes with white for maximum and blue for minimum, black space has no nodes  (from [7])]]
 
For a given directed network the Google matrix is constructed in the way described in the article [[Google matrix]]. The [[PageRank]] vector  is the eigenvector with the maximal real eigenvalue <math> \lambda=1 </math>. It was introduce in [1] and is discussed in the article [[PageRank]]. In a similar way  the CheiRank is the eigenvector with the maximal real eigenvalue of the matrix <math> G^* </math> built in the same way as <math> G </math> '''but''' using inverted direction of links in the initially given adjacency matrix.  Both matrices <math> G </math> and <math> G^* </math> belong to the class of Perron–Frobenius operators and according to the [[Perron–Frobenius theorem]] the CheiRank <math> P^*_i </math> and PageRank <math> P_i </math> eigenvectors have nonnegative components which can be interpreted as probabilities [2,3]. Thus all <math> N </math> nodes <math> i </math> of the network can be ordered in a decreasing probability order with ranks <math> K^*_i, K_i </math> for CheiRank and PageRank <math> P^*_i, P_i </math> respectively. In average the PageRank probability <math> P_i </math> is proportional to the number of ingoing links with <math> P_i \propto 1/{K_i}^\beta </math> [4,5,6]. For the World Wide Web (WWW) network the exponent <math> \beta =1/(\nu-1) \approx 0.9 </math> where <math> \nu \approx 2.1</math> is the exponent for ingoing links distribution [4,5]. In a similar way the CheiRank probability is in average proportional to the number of outgoing links with
<math> P^*_i \propto 1/{K^*_i}^{\beta^*} </math> with
<math> \beta^* =1/(\nu^*-1) \approx 0.6 </math> where <math> \nu^* \approx 2.7 </math> is the exponent for outgoing links distribution of the WWW [4,5]. The CheiRank was introduced for the procedure call network of Linux Kernel software in [7], the term itself was used in [8]. While the PageRank highlights very well known and popular nodes, the CheiRank highlights very communicative nodes. Top PageRank and CheiRank nodes have certain analogy to authorities and hubs appearing in the [[HITS algorithm]] [9] but the HITS is query dependent while the rank probabilities <math> P_i </math> and <math> P^*_i </math> classify all nodes of the network. Since each node belongs both to CheiRank and PageRank we obtain a two-dimensional ranking of network nodes. It should be noted that there had been early studies of PageRank in networks with inverted direction of links [10,11]  but the properties of two-dimensional ranking had not be analyzed in detail.
 
[[Image:CheiRank2.jpg|thumb|280px|  Fig2.  Dependence of probability of PageRank <math> P </math>  (red curve) and CheiRank <math> P^* </math> (blue curve) on the corresponding rank indexes <math> K </math> and <math> K^* </math>. The straight dashed lines show the power law dependence with the slope <math> \beta=0.92; 0.57 </math>  respectively, corresponding to <math> \beta=1/(\nu-1) </math> (from [8])]]
 
==Examples==
An example of nodes distribution in the plane of PageRank and CheiRank is shown in Fig.1 for the procedure call network of Linux Kernel software taken from [7].
 
[[Image:CheiRank3.jpg|thumb|280px|  Fig3.  Density distribution of Wikipedia English articles (2009) in the plane of PageRank and CheiRank indexes <math> 0 < \ln K, \ln K^* < \ln N </math> shown by color with blue for minimum  and white for maximum (black for zero); green/red points show top 100 personalities from PageRank/CheiRank, yellow pluses show top 100 personalities from Hart's book, number of articles <math> N = 3282257 </math> (from [8])]]
 
The dependence of <math> P, P^* </math> on <math> K, K^* </math> for the network of hyperlink network  of Wikipedia English articles is shown in Fig.2 from [8]. The distribution of these articles in the plane of PageRank and CheiRank is shown in Fig.3 from [8]. The difference between PageRank and CheiRank is clearly seen from the names of Wikipedia articles (2009) with highest rank. At the top of PageRank we have 1.United States, 2.United Kingdom, 3.France while for CheiRank we find 1.Portal:Contents/Outline of knowledge/Geography and places, 2.List of state leaders by year, 3.Portal:Contents/Index/Geography and places. Clearly PageRank selects first articles on a broadly known subject with a large number of ingoing links while CheiRank selects first highly communicative articles with many outgoing links. Since the articles are distributed in 2D they can be ranked in various ways corresponding to projection of 2D set on a line. The horizontal and vertical lines correspond to PageRank and CheiRank, 2DRank combines properties of CheiRank and PageRank as it is discussed in [8]. It gives top Wikipedia articles 1.India, 2.Singapore, 3.Pakistan.
 
The 2D ranking highlights the properties of Wikipedia articles in a new rich and fruitful manner. According to the PageRank the top 100 personalities described in Wikipedia articles have in 5 main category activities: 58 (politics), 10 (religion),17 (arts), 15 (science), 0 (sport) and thus the importance of politicians is strongly overestimated. The CheiRank gives respectively 15, 1, 52, 16, 16 while for  2DRank one finds 24, 5, 62, 7, 2.
Such type of 2D ranking can find useful applications for various complex directed networks including the WWW.
 
CheiRank and PageRank naturally appear for the world trade network,
or [[international trade]],
where they and linked with export and import flows for a given country respectively [12].
 
Possibilities of development of two-dimensional search engines based on PageRank and CheiRank are considered in [13]. Directed networks can be characterized by the correlator between PageRank and CheiRank vectors: in certain networks this correlator is close to zero (e.g. Linux Kernel network)
while other networks have large correlator values (e.g. Wikipedia or university networks) [7,13].
 
==Simple network example==
[[Image:CheiRank4.jpg|thumb|240px|  Fig4. Example of directed network]]
[[Image:CheiRank5.jpg|thumb|240px|  Fig5. Related matrix <math> S </math>]]
[[Image:CheiRank6.jpg|thumb|240px|  Fig6. Related matrix <math> S^* </math>]]
A simple example of the construction of the Google matrices <math> G </math> and <math> G^* </math>, used for determination of the related PageRank and CheiRank vectors, is given below. The directed network example with 7 nodes is shown in Fig.4. The matrix <math> S </math>, built with the rules described
in the article [[Google matrix]], is shown in Fig.5;
the related Google matrix is <math> G=\alpha S + (1-\alpha)e e^{T}/N</math>
and the PageRank vector is the right eigenvector of <math> G </math>
with the unit eigenvalue (<math> G P=P</math>). In a similar way, to determine the CheiRank eigenvector all directions of links in Fig.4 are inverted,
then the matrix <math> S^* </math> is built,
according to the same rules applied for the network with inverted link
directions, as shown in Fig.6. The related Google matrix is  
<math> G^*=\alpha S^* + (1-\alpha)e e^{T}/N</math> and the CheiRank vector
is the right eigenvector of <math> G^* </math>
with the unit eigenvalue (<math> G^* P^*=P^*</math>). Here <math> \alpha \approx 0.85 </math> is the damping factor taken at its usual value.
 
==See also==
* [[PageRank]], [[HITS algorithm]], [[Google matrix]]
* [[Markov chains]], [[Transfer operator]], [[Perron–Frobenius theorem]]
* [[Information retrieval]]
* [[Web search engines]]
 
==References==
{{reflist}}
* {{Cite web
| last = [1] Brin S. |coauthors= Page L.
  | publisher = Computer Networks and ISDN Systems v.30, p.107
| title =  The anatomy of a large-scale hypertextual Web search engine
|format= <!--None-->| year = 1998
  | postscript = <!--None-->
}}
* {{cite book |last= [2] Langville|first= Amity N |coauthors= Carl Meyer|title= [[Google's PageRank and Beyond]] |publisher= [[Princeton University Press]] |year= 2006  |isbn= 0-691-12202-4 }}
* {{Cite web
| last = [3] Austin | first =  David
| publisher = AMS Feature Columns
| title =  How Google Finds Your Needle in the Web's Haystack
| url = http://www.ams.org/samplings/feature-column/fcarc-pagerank
|format= <!--None-->| year = 2008
| postscript = <!--None-->
}}
* {{Cite web
| last = [4] Donato D. |coauthors= Laura L., Leonardi S., Millozzi S.
| publisher = Eur. Phys. J. B v.38, p.239
| title =  Large scale properties of the Webgraph
|format= <!--None-->| year = 2004
| postscript = <!--None-->
}}
* {{Cite web
| last = [5] Pandurangan G. |coauthors= Ranghavan P., Upfal E.
| publisher = Internet Math. v.3, p. 1
| title =  Using PageRank to Characterize Web Structure
|format= <!--None-->| year = 2005
| postscript = <!--None-->
}}
* {{Cite web
| last = [6] Litvak N. |coauthors= Scheinhardt W.R.W, Volkovich Y.
| publisher = Lecture Notes in Computer Science, V.4936 p.72 {{doi|10.1007/978-3-540-78808-9}}
| title =  Probabilistic Relation between In-Degree and PageRank
|format= <!--None-->| year = 2008
| postscript = <!--None-->
}}
* {{Cite arxiv
| last = [7] Chepelianskii | first =  Alexei D.
| eprint = 1003.5455
  | title = Towards physical laws for software architecture
| year = 2010
| postscript = <!--None-->
}}
* {{Cite web
| last = [8] Zhirov A.O. |coauthors= Zhirov O.V., Shepelyansky D.L.
| publisher = Eur. Phys. J. B v.77, p.523
| title =  Two-dimensional ranking of Wikipedia articles
|format= <!--None-->| year = 2010
| postscript = <!--None-->
}}
* {{Cite web
| last = [9] Kleinberg |first = Jon
| publisher = Journal of the ACM v.46(5), p.604
| title =  Authoritative sources in a hyperlinked environment
|format= <!--None-->| year = 1999
| postscript = <!--None-->
}}
* {{Cite web
| last = [10] Fogaras |first = D.
| publisher = Lecture Notes in Computer Science v.2877, p.65
| title =  Where to start browsing the web?
|format= <!--None-->| year = 2003
| postscript = <!--None-->
}}
* {{Cite web
| last = [11] Hrisitidis V. |coauthors= Hwang H., Papakonstantinou Y,
| publisher = ACM Trans. Database Syst. v.33, p.1
| title = Authority-based keyword search in databases
  | format= <!--None-->| year = 2008
| postscript = <!--None-->
}}
* {{Cite arxiv
| last = [12] Ermann L. |coauthors= Shepelyansky D.L.
  | eprint = 1103.5027
| title = Google matrix of the world trade network
| format= <!--None-->| year = 2011
| postscript = <!--None-->
}}
* {{Cite arxiv
| last = [13] Ermann L. |coauthors= Chepelianskii A.D., Shepelyansky D.L.
| eprint = 1106.6215
| title = Towards two-dimensional search engines
| format= <!--None-->| year = 2011
| postscript = <!--None-->
}}
 
==External links==
* [http://www.quantware.ups-tlse.fr/QWLIB/2drankwikipedia/ Two-dimensional ranking of Wikipedia articles]
* [http://www.quantware.ups-tlse.fr/QWLIB/tradecheirank/ World trade: CheiRank versus PageRank]
* [http://www.quantware.ups-tlse.fr/QWLIB/dvvadi/ Towards two-dimensional search engines]
 
[[Category:Link analysis]]

Revision as of 05:07, 21 August 2013

Template:No footnotes Template:Cleanup

Nodes with links in the plane of PageRank and CheiRank

The CheiRank is an eigenvector with a maximal real eigenvalue of the Google matrix constructed for a directed network with the inverted directions of links. It is similar to the PageRank vector, which ranks the network nodes in average proportionally to a number of incoming links being the maximal eigenvector of the Google matrix with a given initial direction of links. Due to inversion of link directions the CheiRank ranks the network nodes in average proportionally to a number of outgoing links. Since each node belongs both to CheiRank and PageRank vectors the ranking of information flow on a directed network becomes two-dimensional.

Definition

File:CheiRank1.jpg
Fig1. Distribution of procedure calls of Linux Kernel network in the plane of PageRank probability and CheiRank probability for Linux version 2.6.32 with matrix size at , color shows the density of nodes with white for maximum and blue for minimum, black space has no nodes (from [7])

For a given directed network the Google matrix is constructed in the way described in the article Google matrix. The PageRank vector is the eigenvector with the maximal real eigenvalue . It was introduce in [1] and is discussed in the article PageRank. In a similar way the CheiRank is the eigenvector with the maximal real eigenvalue of the matrix built in the same way as but using inverted direction of links in the initially given adjacency matrix. Both matrices and belong to the class of Perron–Frobenius operators and according to the Perron–Frobenius theorem the CheiRank and PageRank eigenvectors have nonnegative components which can be interpreted as probabilities [2,3]. Thus all nodes of the network can be ordered in a decreasing probability order with ranks for CheiRank and PageRank respectively. In average the PageRank probability is proportional to the number of ingoing links with [4,5,6]. For the World Wide Web (WWW) network the exponent where is the exponent for ingoing links distribution [4,5]. In a similar way the CheiRank probability is in average proportional to the number of outgoing links with with where is the exponent for outgoing links distribution of the WWW [4,5]. The CheiRank was introduced for the procedure call network of Linux Kernel software in [7], the term itself was used in [8]. While the PageRank highlights very well known and popular nodes, the CheiRank highlights very communicative nodes. Top PageRank and CheiRank nodes have certain analogy to authorities and hubs appearing in the HITS algorithm [9] but the HITS is query dependent while the rank probabilities and classify all nodes of the network. Since each node belongs both to CheiRank and PageRank we obtain a two-dimensional ranking of network nodes. It should be noted that there had been early studies of PageRank in networks with inverted direction of links [10,11] but the properties of two-dimensional ranking had not be analyzed in detail.

Fig2. Dependence of probability of PageRank (red curve) and CheiRank (blue curve) on the corresponding rank indexes and . The straight dashed lines show the power law dependence with the slope respectively, corresponding to (from [8])

Examples

An example of nodes distribution in the plane of PageRank and CheiRank is shown in Fig.1 for the procedure call network of Linux Kernel software taken from [7].

Fig3. Density distribution of Wikipedia English articles (2009) in the plane of PageRank and CheiRank indexes shown by color with blue for minimum and white for maximum (black for zero); green/red points show top 100 personalities from PageRank/CheiRank, yellow pluses show top 100 personalities from Hart's book, number of articles (from [8])

The dependence of on for the network of hyperlink network of Wikipedia English articles is shown in Fig.2 from [8]. The distribution of these articles in the plane of PageRank and CheiRank is shown in Fig.3 from [8]. The difference between PageRank and CheiRank is clearly seen from the names of Wikipedia articles (2009) with highest rank. At the top of PageRank we have 1.United States, 2.United Kingdom, 3.France while for CheiRank we find 1.Portal:Contents/Outline of knowledge/Geography and places, 2.List of state leaders by year, 3.Portal:Contents/Index/Geography and places. Clearly PageRank selects first articles on a broadly known subject with a large number of ingoing links while CheiRank selects first highly communicative articles with many outgoing links. Since the articles are distributed in 2D they can be ranked in various ways corresponding to projection of 2D set on a line. The horizontal and vertical lines correspond to PageRank and CheiRank, 2DRank combines properties of CheiRank and PageRank as it is discussed in [8]. It gives top Wikipedia articles 1.India, 2.Singapore, 3.Pakistan.

The 2D ranking highlights the properties of Wikipedia articles in a new rich and fruitful manner. According to the PageRank the top 100 personalities described in Wikipedia articles have in 5 main category activities: 58 (politics), 10 (religion),17 (arts), 15 (science), 0 (sport) and thus the importance of politicians is strongly overestimated. The CheiRank gives respectively 15, 1, 52, 16, 16 while for 2DRank one finds 24, 5, 62, 7, 2. Such type of 2D ranking can find useful applications for various complex directed networks including the WWW.

CheiRank and PageRank naturally appear for the world trade network, or international trade, where they and linked with export and import flows for a given country respectively [12].

Possibilities of development of two-dimensional search engines based on PageRank and CheiRank are considered in [13]. Directed networks can be characterized by the correlator between PageRank and CheiRank vectors: in certain networks this correlator is close to zero (e.g. Linux Kernel network) while other networks have large correlator values (e.g. Wikipedia or university networks) [7,13].

Simple network example

File:CheiRank4.jpg
Fig4. Example of directed network
File:CheiRank5.jpg
Fig5. Related matrix
File:CheiRank6.jpg
Fig6. Related matrix

A simple example of the construction of the Google matrices and , used for determination of the related PageRank and CheiRank vectors, is given below. The directed network example with 7 nodes is shown in Fig.4. The matrix , built with the rules described in the article Google matrix, is shown in Fig.5; the related Google matrix is and the PageRank vector is the right eigenvector of with the unit eigenvalue (). In a similar way, to determine the CheiRank eigenvector all directions of links in Fig.4 are inverted, then the matrix is built, according to the same rules applied for the network with inverted link directions, as shown in Fig.6. The related Google matrix is and the CheiRank vector is the right eigenvector of with the unit eigenvalue (). Here is the damping factor taken at its usual value.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

External links