A PLL power model that accurately estimates the power consumption during both lock and acquisition states is presented. The model is within 5% of circuit level simulation (SPICE) values. No significant power overhead (+/5% of the power consumed at the final frequency) is incurred during the acquisition process. 1. The PLL dynamic behavior The PLL can be described as a 2 order continuous time sy...

by drawing blood through a heparin lock, patients can be protected from skin damages duo to repeated needle sticks. in addition, this procedure can assist to gain more precise results in laboratory test and to prevent further complications. probably, you have ever used a heparin lock in order to infusion of medicines but, it is possible that you never use of that for blood sampling. both two pr...

1 The PLL (Phase Lock Loop) can synchronize with a deterministic input wave or with a random input symbols. In the first case we have a WPLL (Wave Phase Lock Loop) and in the second case we have a SPLL (Symbol Phase Lock Loop. The WPLL (Wave Phase Lock Loop) is also known as WLL (Wave Lock Loop) or only PLL (Phase Lock Loop). The SPLL (Symbol Phase Lock Loop) is also known as SLL (Symbol Lock L...

New app1ication.a th.at support cooperative work of users on. distributed computers often share perai9ten.t data atru.cturea that con,tain poinders. For th.eae app1ication.a. th,e un.derlyin,g system, often wea th,e “page aenler” arch,itecture. in which th,e persistent data are ah.ipped from th.e server on a page basis, ad clients cache th,e pagea for object-grain accesses. In this pagegrain. e...

When are we locked in a path? This is one of the main questions concerning path dependency. Coming from Arthur's model of increasing returns and technology adoption (Arthur 1989), this paper addresses the question of when and how a lock-in occurs. To gain a better understanding of the path process, different modifications are made. First, the random selection of two types of adopters is substit...

In this paper, we present the PR-lock, a prioritized spin-lock mutual exclusion algorithm for real time systems. The PR-lock is a contention-free spin lock, in which blocked processes spin on locally stored or cached variables. In contrast to previous work on prioritized spin locks, our algorithm maintains a pointer to the lock holder. As a result, our spin lock can support priority inheritance...

The UK government’s e-Borders project presents an intriguing anomaly: despite repeated and acknowledged failings of the over two decades, it has remained a core part border strategy across successive administrations. This article seeks to explain surprising resilience this programme by developing concept political lock-in. We combine insights from critical security studies with science technolo...