Katz centrality: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
 
en>Bkafle62
Line 1: Line 1:
In addition to this situation, the business now offers entertaining paddles, whitewater paddles, SUP paddles, visiting paddles etc. They are included in distinct sizes and sizes. Amateur paddle range contains Carlisle, Cannon and proportion as well as touring fun, it also holds feature, venture, relationships and Carlisle.
The '''List Update''' or the '''List Access''' problem is a simple model used in the study of [[Competitive analysis (online algorithm)|competitive analysis]] of [[online algorithms]]. Given a set of items in a list where the cost of accessing an item is proportional to its distance from the head of the list, e.g. a [[Linked List]], and a request sequence of accesses, the problem is to come up with a strategy of reordering the list so that the total cost of accesses is minimized. The reordering can be done at any time but incurs a cost, and the standard cost model includes a free transposition of the item being accessed anywhere ahead of its current position and a paid transposition of a unit cost for exchanging any two items in the list. Performance of algorithms depend on the construction of request sequences by adversaries under various [[Adversary model]]s


Your paddles build your encounter significantly more beneficial. You may prefer a with them based on this hobby your sport you're going to action.   <br><br> These specs create a stand up canoe reliable and simple to go. However, a stick up kayak will never be for you and needs the paddler to enjoy a good deal of experience with controlling your [http://www.youtube.com/watch?v=dxC-dprhv98 fishing kayak reviews] in numerous conditions. Moreover, paddlers, chiefly amateurs should not try to arise inside their average sit in or lay on peak kayaks for paddling or for angling. <br><br> [http://www.youtube.com/watch?v=NMuXVs8MuPQ inflatable kayak reviews] kayaks are really greatly popular thought to be among amateur as well as complex paddlers as they are mild in body fat yet reliable and easy to go. Furthermore, a lot more liquid, they kayaks happen to be compressed and additionally experience a smaller converting spoke. Really pitfall with expansive kayaks is they are usually more laggard when compared to a kayaks.
An online algorithm for this problem has to reorder the elements and serve requests based only on the knowledge of previously requested items and hence its strategy may not have the optimum cost as compared to an offline algorithm that gets to see the entire request sequence and devise a complete strategy before serving the first request.
 
==Adversary Models==
An adversary is an entity that gets to choose the request sequence <math>\sigma</math> for an algorithm ''ALG''. Depending of whether <math>\sigma</math> can be changed based on the strategy of ''ALG'', adversaries are given various powers, and the performance of ''ALG'' is measured against these adversaries.
 
An '''oblivious adversary''' has to construct the entire request sequence <math>\sigma</math> before running ''ALG'', and pays the optimal offline price, <math>OPT(\sigma)</math> which is compared against <math>ALG(\sigma)</math>
 
An '''adaptive online adversary''' gets to make the next request based on the previous results of the online algorithm, but pays for the request optimally and online.  
 
An '''adaptive offline adversary''' gets to make the next request based on the previous results of the online algorithm, but pays the optimal offline cost.
 
==Offline algorithms==
Competitive analysis for many list update problems were carried out without any specific knowledge of the exact nature of the optimum offline algorithm (OPT). The best known algorithm runs in O(''n''2<sup>''l''</sup>(''l''-1)!) time and O(''l''!) space where ''n'' is the length of the request sequence and ''l'' is the length of the list.<ref>N. Reingold and J. Westbrook. Optimum Offline algorithms for the list update and paging rules. Technical Report YALE/DcS/TR-805, Yale University, New Haven, Conn, August 1990</ref>
 
It is interesting to note that paid transpositions are in general necessary for optimum algorithms. Consider a list (''a'',''b'',''c'') where ''a'' is at the head of the list, and a request sequence ''c'',''b'',''c'',''b''. An optimal offline algorithm using only free exchanges would cost 9 (3+3+2+1), whereas an optimal offline algorithm using only paid exchanges would cost 7 (Swap ''c'' and ''a'' in the beginning = 1+(1+2+1+2)). So, we cannot get away with just using free transpositions for the optimum offline algorithm.
 
The optimum list update problem was proven to be [[NP-Hard]] by {{harv|Ambühl|2000}}.
 
==Online algorithm==
An online algorithm ''ALG'' has a competitive ratio ''c'' if for any input it performs at least as good as ''c'' times worse than OPT. i.e. if there exists an <math>\alpha\geq0</math> such that for all finite length request sequences <math>\sigma</math>, <math> ALG(\sigma)-c.OPT(\sigma)\leq\alpha</math>. Online algorithms can either be deterministic or randomized and it turns out that randomization in this case can truly help against oblivious adversaries.
 
===Deterministic===
Most deterministic algorithms are variants of these three algorithms :
; MTF (Move to front) : After accessing an item move it to the front of the list without changing the order of other items
; TRANS (Transpose) : After accessing an item, transpose it with the immediately preceding item.
; FC (Frequency Count) : For each item maintain a frequency count of the number of accesses to it - when an element is accessed increase its frequency count and reorder the list in the decreasing order of frequencies.
 
Observe that all these use just free transpositions. It turns out that both TRANS and FC are not competitive. In a classic result using [[Potential method]] analysis {{harv|Sleator|Tarjan|1985}} proved that MTF is 2-competitive. The proof does not require the explicit knowledge of OPT but instead counts the number of inversions i.e. elements occurring in opposite order in the lists of MTF and OPT.  
 
Any deterministic algorithm has a lower bound of <math>2-\frac{2}{l+1}</math> for a list of length ''l'', and MTF is actually the optimum deterministic list update algorithm. The type of adversary doesn't matter in the case of deterministic algorithms, because the adversary can run a copy of the deterministic algorithm on his own to precompute the most disastrous sequence.
 
===Randomized===
Consider the following simple randomized algorithm :
; BIT : For every item in the list, maintain a bit. Initialize all the bits uniformly and randomly to 0 or 1. When an item is accessed, flip the bit, and if it is 1 move it to the front, else don't.
 
This algorithm is barely random - it makes all its random choices in the beginning and not during the run. It turns out that BIT breaks the deterministic bound - it is '''better''' than MTF against oblivious adversaries. It is 7/4-competitive. There are other randomized algorithms, like COMB, that perform better than BIT. Boris Teia proved a lower bound of 1.5 for any randomized list update algorithm.<ref>Teia, Boris, A lower bound for randomized list update algorithms, Inf. Process. Lett. (1993), pp. 5--9</ref>
 
==Related Problems==
The list update problem where elements maybe inserted and deleted is called the dynamic list update problem, as opposed to the static list update problem where only accessing list elements are allowed. The upper bound of <math>2-\frac{2}{l+1}</math> holds for the dynamic model as well.
 
There are different cost models as well. In the usual full cost model, an access to an element located at a position ''i'' costs ''i'', but the last comparison is inevitable for any algorithm, i.e. there are ''i-1'' elements standing in the way of ''i''. In the partial cost model, these final comparison costs totaling to the number of elements in the request sequence are ignored. For the costs of paid transpositions other than unity, '''P'''<sup>'''d'''</sup> models are used.
 
==See also==
* [[Online algorithm]]
* [[Competitive analysis (online algorithm)|Competitive analysis]]
* [[Cache algorithms]]
 
==Notes==
{{Reflist}}
 
== References ==
*{{citation|title=Amortized efficiency of list update and paging rules|first1=D.|last1=Sleator|author1-link=Daniel Sleator|first2=R.|last2=Tarjan|author2-link=Robert Tarjan|journal=Communications of the ACM|year=1985|doi=10.1145/2786.2793|volume=28|issue=2|pages=202–208}}.
 
*{{cite book
| authorlink = Allan Borodin
| author = Borodin, A.
| coauthors = El-Yaniv, R.
| url = http://www.cs.technion.ac.il/~rani/book.html
| title = Online Computation and Competitive Analysis
| publisher = Cambridge University Press
| year = 1998
| isbn = 0-521-56392-5}}
 
*{{Citation
| authorlink = Christoph Ambühl
  | author = Ambühl, C.
| title = Offline list update is np-hard
| publisher = Springer
| year = 2000
| pages = 42–51 }}
 
[[Category:Analysis of algorithms]]
[[Category:Online algorithms]]
[[Category:Randomized algorithms]]

Revision as of 01:05, 17 December 2013

The List Update or the List Access problem is a simple model used in the study of competitive analysis of online algorithms. Given a set of items in a list where the cost of accessing an item is proportional to its distance from the head of the list, e.g. a Linked List, and a request sequence of accesses, the problem is to come up with a strategy of reordering the list so that the total cost of accesses is minimized. The reordering can be done at any time but incurs a cost, and the standard cost model includes a free transposition of the item being accessed anywhere ahead of its current position and a paid transposition of a unit cost for exchanging any two items in the list. Performance of algorithms depend on the construction of request sequences by adversaries under various Adversary models

An online algorithm for this problem has to reorder the elements and serve requests based only on the knowledge of previously requested items and hence its strategy may not have the optimum cost as compared to an offline algorithm that gets to see the entire request sequence and devise a complete strategy before serving the first request.

Adversary Models

An adversary is an entity that gets to choose the request sequence for an algorithm ALG. Depending of whether can be changed based on the strategy of ALG, adversaries are given various powers, and the performance of ALG is measured against these adversaries.

An oblivious adversary has to construct the entire request sequence before running ALG, and pays the optimal offline price, which is compared against

An adaptive online adversary gets to make the next request based on the previous results of the online algorithm, but pays for the request optimally and online.

An adaptive offline adversary gets to make the next request based on the previous results of the online algorithm, but pays the optimal offline cost.

Offline algorithms

Competitive analysis for many list update problems were carried out without any specific knowledge of the exact nature of the optimum offline algorithm (OPT). The best known algorithm runs in O(n2l(l-1)!) time and O(l!) space where n is the length of the request sequence and l is the length of the list.[1]

It is interesting to note that paid transpositions are in general necessary for optimum algorithms. Consider a list (a,b,c) where a is at the head of the list, and a request sequence c,b,c,b. An optimal offline algorithm using only free exchanges would cost 9 (3+3+2+1), whereas an optimal offline algorithm using only paid exchanges would cost 7 (Swap c and a in the beginning = 1+(1+2+1+2)). So, we cannot get away with just using free transpositions for the optimum offline algorithm.

The optimum list update problem was proven to be NP-Hard by Template:Harv.

Online algorithm

An online algorithm ALG has a competitive ratio c if for any input it performs at least as good as c times worse than OPT. i.e. if there exists an such that for all finite length request sequences , . Online algorithms can either be deterministic or randomized and it turns out that randomization in this case can truly help against oblivious adversaries.

Deterministic

Most deterministic algorithms are variants of these three algorithms :

MTF (Move to front)
After accessing an item move it to the front of the list without changing the order of other items
TRANS (Transpose)
After accessing an item, transpose it with the immediately preceding item.
FC (Frequency Count)
For each item maintain a frequency count of the number of accesses to it - when an element is accessed increase its frequency count and reorder the list in the decreasing order of frequencies.

Observe that all these use just free transpositions. It turns out that both TRANS and FC are not competitive. In a classic result using Potential method analysis Template:Harv proved that MTF is 2-competitive. The proof does not require the explicit knowledge of OPT but instead counts the number of inversions i.e. elements occurring in opposite order in the lists of MTF and OPT.

Any deterministic algorithm has a lower bound of for a list of length l, and MTF is actually the optimum deterministic list update algorithm. The type of adversary doesn't matter in the case of deterministic algorithms, because the adversary can run a copy of the deterministic algorithm on his own to precompute the most disastrous sequence.

Randomized

Consider the following simple randomized algorithm :

BIT
For every item in the list, maintain a bit. Initialize all the bits uniformly and randomly to 0 or 1. When an item is accessed, flip the bit, and if it is 1 move it to the front, else don't.

This algorithm is barely random - it makes all its random choices in the beginning and not during the run. It turns out that BIT breaks the deterministic bound - it is better than MTF against oblivious adversaries. It is 7/4-competitive. There are other randomized algorithms, like COMB, that perform better than BIT. Boris Teia proved a lower bound of 1.5 for any randomized list update algorithm.[2]

Related Problems

The list update problem where elements maybe inserted and deleted is called the dynamic list update problem, as opposed to the static list update problem where only accessing list elements are allowed. The upper bound of holds for the dynamic model as well.

There are different cost models as well. In the usual full cost model, an access to an element located at a position i costs i, but the last comparison is inevitable for any algorithm, i.e. there are i-1 elements standing in the way of i. In the partial cost model, these final comparison costs totaling to the number of elements in the request sequence are ignored. For the costs of paid transpositions other than unity, Pd models are used.

See also

Notes

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.

References

  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010.
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  1. N. Reingold and J. Westbrook. Optimum Offline algorithms for the list update and paging rules. Technical Report YALE/DcS/TR-805, Yale University, New Haven, Conn, August 1990
  2. Teia, Boris, A lower bound for randomized list update algorithms, Inf. Process. Lett. (1993), pp. 5--9